Rivet analyses referenceBELLE_2008_I764099Cross Section for $e^+e^-\to\Upsilon(1,2,3S)\pi^+\pi^-$ and $\Upsilon(1S)K^+K^-$ at 10.87 GeVExperiment: BELLE (KEKB) Inspire ID: 764099 Status: VALIDATED Authors:
Beam energies: ANY Run details:
Measurement of the cross section for $e^+e^-\to\Upsilon(1,2,3S)\pi^+\pi^-$ and $\Upsilon(1S)K^+K^-$ at 10.87 GeV measured by BELLE. Source code: BELLE_2008_I764099.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_2008_I764099 : public Analysis {
11 public:
12
13 /// Constructor
14 RIVET_DEFAULT_ANALYSIS_CTOR(BELLE_2008_I764099);
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(_nUps1pipi, "TMP/nUps1pipi");
25 book(_nUps2pipi, "TMP/nUps2pipi");
26 book(_nUps3pipi, "TMP/nUps3pipi");
27 book(_nUps1KK, "TMP/nUps1KK");
28 }
29
30 void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
31 for (const Particle &child : p.children()) {
32 if(child.children().empty()) {
33 --nRes[child.pid()];
34 --ncount;
35 }
36 else
37 findChildren(child,nRes,ncount);
38 }
39 }
40
41 /// Perform the per-event analysis
42 void analyze(const Event& event) {
43 const FinalState& fs = apply<FinalState>(event, "FS");
44 map<long,int> nCount;
45 int ntotal(0);
46 for (const Particle& p : fs.particles()) {
47 nCount[p.pid()] += 1;
48 ++ntotal;
49 }
50 const FinalState& ufs = apply<FinalState>(event, "UFS");
51 for (const Particle& p : ufs.particles()) {
52 if(p.children().empty()) continue;
53 if(p.pid() != 553 &&
54 p.pid() != 100553 &&
55 p.pid() != 200553 ) continue;
56 map<long,int> nRes = nCount;
57 int ncount = ntotal;
58 findChildren(p,nRes,ncount);
59 if(ncount!=2) continue;
60 bool matched = true;
61 for(auto const & val : nRes) {
62 if(abs(val.first)==321 || abs(val.first)==211) {
63 continue;
64 }
65 else if(val.second!=0) {
66 matched = false;
67 break;
68 }
69 }
70 if(matched) {
71 if(nRes[211]==1 && nRes[-211]==1 ) {
72 if(p.pid()==553)
73 _nUps1pipi->fill();
74 if(p.pid()==100553)
75 _nUps2pipi->fill();
76 if(p.pid()==200553)
77 _nUps3pipi->fill();
78 }
79 else if(nRes[321]==1 && nRes[-321]==1) {
80 if(p.pid()==553)
81 _nUps1KK->fill();
82 }
83 }
84 }
85 }
86
87
88 /// Normalise histograms etc., after the run
89 void finalize() {
90 double fact = crossSection()/ sumOfWeights() /picobarn;
91 for(unsigned int ix=1;ix<5;++ix) {
92 double sigma = 0.0, error = 0.0;
93 if(ix==1) {
94 sigma = _nUps1pipi->val()*fact;
95 error = _nUps1pipi->err()*fact;
96 }
97 else if(ix==2) {
98 sigma = _nUps2pipi->val()*fact;
99 error = _nUps2pipi->err()*fact;
100 }
101 else if(ix==3) {
102 sigma = _nUps3pipi->val()*fact;
103 error = _nUps3pipi->err()*fact;
104 }
105 else if(ix==4) {
106 sigma = _nUps1KK->val()*fact;
107 error = _nUps1KK->err()*fact;
108 }
109 Estimate1DPtr mult;
110 book(mult, ix, 1, 1);
111 for (auto& b : mult->bins()) {
112 if (inRange(sqrtS()/GeV, b.xMin(), b.xMax())) {
113 b.set(sigma, error);
114 }
115 }
116 }
117 }
118
119 /// @}
120
121 /// @name Histograms
122 /// @{
123 CounterPtr _nUps1pipi,_nUps2pipi,_nUps3pipi,_nUps1KK;
124 /// @}
125
126 };
127
128 RIVET_DECLARE_PLUGIN(BELLE_2008_I764099);
129
130}
|