Rivet analyses
Cross section for e+e− → ϕπ+π− between 2 and 3.08 GeV
Experiment: BESIII (BEPC)
Inspire ID: 2688408
Status: VALIDATED
Authors: - Peter Richardson
References: - Phys.Rev.D 108 (2023) 3, 032011 - arXiv: 2112.13219
Beams: e+ e-
Beam energies: (1.0, 1.0); (1.0, 1.0); (1.1, 1.1); (1.1, 1.1); (1.1, 1.1); (1.1, 1.1); (1.1, 1.1); (1.1, 1.1); (1.2, 1.2); (1.2, 1.2); (1.2, 1.2); (1.2, 1.2); (1.3, 1.3); (1.3, 1.3); (1.4, 1.4); (1.4, 1.4); (1.4, 1.4); (1.5, 1.5); (1.5, 1.5); (1.5, 1.5); (1.5, 1.5); (1.5, 1.5)GeV
Run details: - e+e- to hadrons
Measurement of the cross section for e+e− → ϕπ+π− for energies between 2 and 3.08 GeV.
Source
code:BESIII_2023_I2688408.cc
// -*- C++ -*-
#include "Rivet/Analysis.hh"
#include "Rivet/Projections/FinalState.hh"
#include "Rivet/Projections/UnstableParticles.hh"
namespace Rivet {
/// @brief e+e- -> phi pi+ pi-
class BESIII_2023_I2688408 : public Analysis {
public:
/// Constructor
RIVET_DEFAULT_ANALYSIS_CTOR(BESIII_2023_I2688408);
/// @name Analysis methods
/// @{
/// Book histograms and initialise projections before the run
void init() {
// Initialise and register projections
declare(FinalState(), "FS");
declare(UnstableParticles(), "UFS");
// counter
book(_cphipippim, 1, 1, 1);
for (const string& en : _cphipippim.binning().edges<0>()) {
double eval = stod(en)*GeV;
if (isCompatibleWithSqrtS(eval)) {
_sqs = en; break;
}
}
raiseBeamErrorIf(_sqs.empty());
}
void findChildren(const Particle& p,map<long,int>& nRes, int& ncount) const {
for (const Particle &child : p.children()) {
if (child.children().empty()) {
nRes[child.pid()]-=1;
--ncount;
}
else {
findChildren(child,nRes,ncount);
}
}
}
/// Perform the per-event analysis
void analyze(const Event& event) {
const FinalState& fs = apply<FinalState>(event, "FS");
map<long,int> nCount;
int ntotal(0);
for (const Particle& p : fs.particles()) {
nCount[p.pid()] += 1;
++ntotal;
}
const FinalState& ufs = apply<FinalState>(event, "UFS");
for (const Particle& p : ufs.particles(Cuts::pid==PID::PHI)) {
if (p.children().empty()) continue;
map<long,int> nRes=nCount;
int ncount = ntotal;
findChildren(p,nRes,ncount);
// phi pi+pi-
if (ncount==2) {
bool matched = true;
for (const auto& val : nRes) {
if (abs(val.first)==211) {
if (val.second!=1) {
matched = false;
break;
}
}
else if (val.second!=0) {
matched = false;
break;
}
}
if (matched) {
_cphipippim->fill(_sqs);
break;
}
}
}
}
/// Normalise histograms etc., after the run
void finalize() {
scale(_cphipippim, crossSection()/ sumOfWeights() /picobarn);
}
/// @}
/// @name Histograms
/// @{
BinnedHistoPtr<string> _cphipippim;
string _sqs = "";
/// @}
};
RIVET_DECLARE_PLUGIN(BESIII_2023_I2688408);
}