Rivet analyses referenceSND_2020_I1806118Cross Section for $e^+e^-\to K^+K^-\pi^0$ and $\phi\pi^0$ from threshold to 2.1 GeVExperiment: SND (VEPP-2000) Inspire ID: 1806118 Status: VALIDATED Authors:
Beam energies: ANY Run details:
Cross section for $e^+e^-\to K^+K^-\pi^0$ between threshold and 2.1 GeV. The $\phi\pi^0$ radiative subprocess is also measured. Source code: SND_2020_I1806118.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- -> K+K-pi0
10 class SND_2020_I1806118 : public Analysis {
11 public:
12
13 /// Constructor
14 RIVET_DEFAULT_ANALYSIS_CTOR(SND_2020_I1806118);
15
16
17 /// @name Analysis methods
18 /// @{
19
20 /// Book histograms and initialise projections before the run
21 void init() {
22
23 // Initialise and register projections
24 declare(FinalState(), "FS");
25 declare(UnstableParticles(), "UFS");
26
27 // Book histograms
28 book( _nKKPi, 1, 1, 1);
29 book(_nPhiPi,"TMP/nPhiPi", refData(2,1,1));
30 for (const string& en : _nKKPi.binning().edges<0>()) {
31 double end = std::stod(en)*GeV;
32 if(isCompatibleWithSqrtS(end)) {
33 _ecms = en;
34 break;
35 }
36 }
37 }
38
39 void findChildren(const Particle & p,map<long,int> & nRes, int &ncount) {
40 for (const Particle &child : p.children()) {
41 if(child.children().empty()) {
42 nRes[child.pid()]-=1;
43 --ncount;
44 }
45 else
46 findChildren(child,nRes,ncount);
47 }
48 }
49
50 /// Perform the per-event analysis
51 void analyze(const Event& event) {
52 const FinalState& fs = apply<FinalState>(event, "FS");
53
54 map<long,int> nCount;
55 int ntotal(0);
56 for (const Particle& p : fs.particles()) {
57 nCount[p.pid()] += 1;
58 ++ntotal;
59 }
60 // KK pi state
61 if(ntotal==3 && nCount[321]==1 &&
62 nCount[-321]==1 && nCount[111]==1)
63 _nKKPi->fill(_ecms);
64 // phi pi state
65 const FinalState& ufs = apply<FinalState>(event, "UFS");
66 for (const Particle& p : ufs.particles(Cuts::pid==333)) {
67 if(p.children().empty()) continue;
68 map<long,int> nRes = nCount;
69 int ncount = ntotal;
70 findChildren(p,nRes,ncount);
71 if(ncount!=1) continue;
72 bool matched = true;
73 for(auto const & val : nRes) {
74 if(val.first==111) {
75 if(val.second!=1) {
76 matched = false;
77 break;
78 }
79 }
80 else if(val.second!=0) {
81 matched = false;
82 break;
83 }
84 }
85 if(matched) {
86 _nPhiPi->fill(sqrtS()/GeV);
87 break;
88 }
89 }
90 }
91
92
93 /// Normalise histograms etc., after the run
94 void finalize() {
95 double fact = crossSection()/ sumOfWeights() /nanobarn;
96 scale(_nKKPi ,fact);
97 scale(_nPhiPi,fact);
98 Estimate1DPtr mult;
99 book(mult, 2, 1, 1);
100 barchart(_nPhiPi,mult);
101 }
102 /// @}
103
104
105 /// @name Histograms
106 /// @{
107 BinnedHistoPtr<string> _nKKPi;
108 Histo1DPtr _nPhiPi;
109 string _ecms;
110 /// @}
111
112
113 };
114
115
116 RIVET_DECLARE_PLUGIN(SND_2020_I1806118);
117
118}
|