rivet is hosted by Hepforge, IPPP Durham

Rivet analyses reference

BELLE_2013_I1225975

Cross section for $e^+e^-\to J/\psi\pi^+\pi^-$ at energies between 3.8 and 4.82 GeV
Experiment: BELLE (KEKB)
Inspire ID: 1225975
Status: VALIDATED
Authors:
  • Peter Richardson
References:
  • Phys.Rev.Lett. 110 (2013) 252002, 2013
Beams: e+ e-
Beam energies: ANY
Run details:
  • e+e- to hadrons

Measurement of the cross section for $e^+e^-\to J/\psi\pi^+\pi^-$ at energies between 3.8 and 4.82 GeV using radiative return by BELLE.

Source code: BELLE_2013_I1225975.cc
  1// -*- C++ -*-
  2#include "Rivet/Analysis.hh"
  3#include "Rivet/Projections/FinalState.hh"
  4#include "Rivet/Projections/UnstableParticles.hh"
  5
  6namespace Rivet {
  7
  8
  9  /// @brief e+ e- > pi+ pi- J/Psi
 10  class BELLE_2013_I1225975 : public Analysis {
 11  public:
 12
 13    /// Constructor
 14    RIVET_DEFAULT_ANALYSIS_CTOR(BELLE_2013_I1225975);
 15
 16
 17    /// @name Analysis methods
 18    /// @{
 19
 20    /// Book histograms and initialise projections before the run
 21    void init() {
 22      declare(FinalState(), "FS");
 23      declare(UnstableParticles(), "UFS");
 24      book(_nJPsi, "TMP/jpsi");
 25    }
 26
 27    void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
 28      for (const Particle &child : p.children()) {
 29        if (child.children().empty()) {
 30          --nRes[child.pid()];
 31          --ncount;
 32        }
 33        else {
 34          findChildren(child,nRes,ncount);
 35        }
 36      }
 37    }
 38
 39    /// Perform the per-event analysis
 40    void analyze(const Event& event) {
 41      const FinalState& fs = apply<FinalState>(event, "FS");
 42      map<long,int> nCount;
 43      int ntotal(0);
 44      for (const Particle& p : fs.particles()) {
 45        nCount[p.pid()] += 1;
 46        ++ntotal;
 47      }
 48      const FinalState& ufs = apply<FinalState>(event, "UFS");
 49      for (const Particle& p : ufs.particles()) {
 50        if (p.children().empty()) continue;
 51        // find the omega
 52        if (p.pid()==443) {
 53          map<long,int> nRes = nCount;
 54          int ncount = ntotal;
 55          findChildren(p,nRes,ncount);
 56          // omega pi+pi-
 57          if (ncount!=2) continue;
 58          bool matched = true;
 59          for (const auto& val : nRes) {
 60            if (abs(val.first)==211) {
 61              if (val.second !=1) {
 62                matched = false;
 63                break;
 64              }
 65            }
 66            else if (val.second!=0) {
 67              matched = false;
 68              break;
 69            }
 70          }
 71          if (matched) {
 72            _nJPsi->fill();
 73            break;
 74          }
 75        }
 76      }
 77    }
 78
 79
 80    /// Normalise histograms etc., after the run
 81    void finalize() {
 82      scale(_nJPsi, crossSection()/ sumOfWeights() /picobarn);
 83      Estimate1DPtr  mult;
 84      book(mult, 1, 1, 1);
 85      for (auto& b : mult->bins()) {
 86        if (inRange(sqrtS()/GeV, b.xMin(), b.xMax())) {
 87          b.set(_nJPsi->val(), _nJPsi->err());
 88        }
 89      }
 90    }
 91
 92    /// @}
 93
 94
 95    /// @name Histograms
 96    /// @{
 97    CounterPtr _nJPsi;
 98    /// @}
 99
100
101  };
102
103  RIVET_DECLARE_PLUGIN(BELLE_2013_I1225975);
104
105}