Hadronization Corrections to Jet Cross Sections in Deep-Inelastic Scattering
read the original abstract
The size of non-perturbative corrections to high E_T jet production in deep-inelastic scattering is reviewed. Based on predictions from fragmentation models, hadronization corrections for different jet definitions are compared and the model dependence as well as the dependence on model parameters is investigated. To test whether these hadronization corrections can be applied to next-to-leading order (NLO) calculations, jet properties and topologies in different parton cascade models are compared to those in NLO. The size of the uncertainties in estimating the hadronization corrections is compared to the uncertainties of perturbative predictions. It is shown that for the inclusive k_\perp ordered jet clustering algorithm the hadronization corrections are smallest and their uncertainties are of the same size as the uncertainties of perturbative NLO predictions.
This paper has not been read by Pith yet.
Forward citations
Cited by 12 Pith papers
-
Physics inspired quantum algorithm for QCD splitting functions
A modular two-qubit quantum circuit is constructed to encode the concurrence of helicity entanglement in pure-gluon splitting, with parameters calibrated to LHC jet data so that composed circuits reproduce experimenta...
-
Physics inspired quantum algorithm for QCD splitting functions
A modular two-qubit quantum circuit primitive is built to reproduce QCD gluon-splitting entanglement via concurrence, with parameters fitted to LHC data and validated on hardware for three-prong jets.
-
Jet fragmentation function and groomed substructure of bottom quark jets in proton-proton collisions at 5.02 TeV
CMS measures soft-drop groomed radius and momentum balance plus a charged fragmentation function for b jets, observing dead-cone suppression compared to inclusive jets.
-
High Multiplicity Trigger for Long-Lived Particles in CMS detector
CMS implements and deploys a dedicated high-multiplicity trigger targeting displaced LLP decays in the muon system for Run 3 data taking.
-
A generalised-$k_t$ jet algorithm for Deep Inelastic Scattering
The authors define a generalised-k_t jet algorithm family for DIS in the Breit frame, extending the prior p=0 case, and test its use for struck-quark jet identification and non-perturbative effects.
-
Particle transformers for identifying Lorentz-boosted Higgs bosons decaying to a pair of W bosons
PaRT achieves >50% tagging efficiency for boosted H->WW jets at 1% background efficiency, decorrelated from jet mass, with data-to-simulation scale factors of 0.9-1.0 on 138 fb^{-1} of 13 TeV collisions.
-
Search for heavy Majorana neutrinos at muon-proton colliders via lepton-number-violating signals
Simulates LNV signals from heavy Majorana neutrinos (200-3000 GeV) at a 5.3 TeV μp collider and projects 2σ limits on |V_ℓN|² superior to LHC bounds for 100 fb⁻¹ and 1 ab⁻¹ luminosities.
-
KIGNet: Physics-Motivated Multi-Graph Representation Learning for Explainable Jet Tagging
E-PCN reaches 94.67% macro-accuracy on 10-class jet tagging by weighting graphs with angular separation, transverse momentum, momentum fraction, and invariant mass, with Grad-CAM showing the first two account for 76% ...
-
NLO QCD and EW corrections to semileptonic vector-boson scattering at the LHC
NLO QCD and EW corrections computed for semileptonic vector-boson scattering in two fiducial regions at the LHC.
-
FastJet user manual
FastJet is a C++ package providing implementations of sequential recombination jet algorithms, cone algorithms via plugins, jet substructure tools, and pileup estimation for pp and e+e- collisions.
-
The Monte Carlo Ecosystem in High-Energy Physics: A Primer
A primer that surveys the architecture, methodologies, computational challenges, and future trajectory of the Monte Carlo event generator ecosystem in collider physics.
- Looking inside jets: an introduction to jet substructure and boosted-object phenomenology
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.