Rivet analyses
e+e− → Ω−Ω̄+ for $\sqrt{s}=3.49$ to 3.67 GeV
Experiment: BESIII (BEPC)
Inspire ID: 2611486
Status: VALIDATED NOHEPDATA
Authors: - Peter Richardson
References: - arXiv: 2212.03693
Beams: e- e+
Beam energies: (1.7, 1.7); (1.8, 1.8); (1.8, 1.8); (1.8, 1.8); (1.8, 1.8); (1.8, 1.8); (1.8, 1.8); (1.8, 1.8)GeV
Run details: - e+ e- to hadrons.
Measurement of the cross section for e+e− → Ω−Ω̄+ for $\sqrt{s}=3.49-3.67$ GeV by BESIII.
Source
code:BESIII_2022_I2611486.cc
// -*- C++ -*-
#include "Rivet/Analysis.hh"
#include "Rivet/Projections/FinalState.hh"
#include "Rivet/Projections/UnstableParticles.hh"
namespace Rivet {
/// @brief e+ e- > Omega- Omegabar+
class BESIII_2022_I2611486 : public Analysis {
public:
/// Constructor
RIVET_DEFAULT_ANALYSIS_CTOR(BESIII_2022_I2611486);
/// @name Analysis methods
/// @{
/// Book histograms and initialise projections before the run
void init() {
// projections
declare(FinalState(), "FS");
declare(UnstableParticles(Cuts::abspid==3334), "UFS");
// histos
book(_sigma,1,1,1);
for (const string& en : _sigma.binning().edges<0>()) {
const 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");
// total hadronic and muonic cross sections
map<long,int> nCount;
int ntotal(0);
for (const Particle& p : fs.particles()) {
nCount[p.pid()] += 1;
++ntotal;
}
// find the Omegas
const FinalState& ufs = apply<UnstableParticles>(event, "UFS");
for (const Particle& p1 : ufs.particles()) {
bool matched = false;
// find the children
map<long,int> nRes = nCount;
int ncount = ntotal;
findChildren(p1,nRes,ncount);
for (const Particle& p2 : ufs.particles()) {
if(p2.pid() != -p1.pid()) continue;
map<long,int> nRes2 = nRes;
int ncount2 = ncount;
findChildren(p2,nRes2,ncount2);
if (ncount2!=0) continue;
matched=true;
for (const auto& val : nRes2) {
if (val.second!=0) {
matched = false;
break;
}
}
if (matched) {
_sigma->fill(_sqs);
break;
}
}
if (matched) break;
}
}
/// Normalise histograms etc., after the run
void finalize() {
scale(_sigma, crossSection()/ sumOfWeights() /femtobarn);
}
/// @}
/// @name Histograms
/// @{
BinnedHistoPtr<string> _sigma;
string _sqs = "";
/// @}
};
RIVET_DECLARE_PLUGIN(BESIII_2022_I2611486);
}