rivet is hosted by Hepforge, IPPP Durham

Rivet analyses reference

BELLE_2016_I1389855

Cross section for $e^+e^-\to h_b(n=1,2)\pi^+\pi^-$ at energies between 10.77 and 11.02 GeV
Experiment: BELLE (KEKB)
Inspire ID: 1389855
Status: VALIDATED
Authors:
  • Peter Richardson
References:
  • Phys.Rev.Lett. 117 (2016) no.14, 142001
Beams: e+ e-
Beam energies: ANY
Run details:
  • e+e- to hadrons

Measurement of the cross section for $e^+e^-\to h_b(n=1,2)\pi^+\pi^-$ at energies between 10.77 and 11.02 GeV by BELLE.

Source code: BELLE_2016_I1389855.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 Add a short analysis description here
 10  class BELLE_2016_I1389855 : public Analysis {
 11  public:
 12
 13    /// Constructor
 14    RIVET_DEFAULT_ANALYSIS_CTOR(BELLE_2016_I1389855);
 15
 16
 17    /// @name Analysis methods
 18    /// @{
 19
 20    /// Book histograms and initialise projections before the run
 21    void init() {
 22
 23      declare(FinalState(), "FS");
 24      declare(UnstableParticles(), "UFS");
 25
 26      book(_nhb1, 1, 1, 3);
 27      book(_nhb2, 1, 1, 4);
 28
 29      // Check which indices match the Ecm energy
 30      for (const auto& est : refData<YODA::BinnedEstimate<int>>(1, 1, 1).bins()) {
 31        if (inRange(sqrtS()/MeV, est.valMin(), est.valMax())) {
 32          edges.push_back(est.xEdge());
 33        }
 34      }
 35    }
 36
 37    void findChildren(const Particle& p, map<long,int>& nRes, int &ncount) {
 38      for (const Particle &child : p.children()) {
 39        if (child.children().empty()) {
 40          --nRes[child.pid()];
 41          --ncount;
 42        }
 43        else {
 44          findChildren(child,nRes,ncount);
 45        }
 46      }
 47    }
 48
 49    /// Perform the per-event analysis
 50    void analyze(const Event& event) {
 51
 52      const FinalState& fs = apply<FinalState>(event, "FS");
 53      map<long,int> nCount;
 54      int ntotal(0);
 55      for (const Particle& p : fs.particles()) {
 56        nCount[p.pid()] += 1;
 57        ++ntotal;
 58      }
 59      const FinalState& ufs = apply<FinalState>(event, "UFS");
 60      for (const Particle& p : ufs.particles()) {
 61        if (p.children().empty()) continue;
 62        // find the omega
 63        if (p.pid()== 10553|| p.pid()==110553) {
 64          map<long,int> nRes = nCount;
 65          int ncount = ntotal;
 66          findChildren(p,nRes,ncount);
 67          // omega pi+pi-
 68          if(ncount!=2) continue;
 69          bool matched = true;
 70          for (const auto& val : nRes) {
 71            if (abs(val.first)==211) {
 72              if (val.second !=1) {
 73                matched = false;
 74                break;
 75              }
 76            }
 77            else if (val.second!=0) {
 78              matched = false;
 79              break;
 80            }
 81          }
 82          if (matched) {
 83            for (const int Ecm : edges) {
 84              if (p.pid() == 10553) {
 85                _nhb1->fill(Ecm);
 86              }
 87              else {
 88                _nhb2->fill(Ecm);
 89              }
 90            }
 91            break;
 92          }
 93        }
 94      }
 95    }
 96
 97
 98    /// Normalise histograms etc., after the run
 99    void finalize() {
100      const double sf = crossSection()/sumOfWeights()/picobarn;
101      scale({_nhb1, _nhb2}, sf);
102    }
103    /// @}
104
105
106    /// @name Histograms
107    /// @{
108    BinnedHistoPtr<int> _nhb1, _nhb2;
109    vector<int> edges;
110    /// @}
111
112  };
113
114  RIVET_DECLARE_PLUGIN(BELLE_2016_I1389855);
115}