REVIEW 4 cited by
Drell-Yan lepton pair production at NNLO QCD with parton showers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Drell-Yan lepton pair production at NNLO QCD with parton showers
read the original abstract
We present a simple approach to combine NNLO QCD calculations and parton showers, based on the UNLOPS technique. We apply the method to the computation of Drell-Yan lepton-pair production at the Large Hadron Collider. We comment on possible improvements and intrinsic uncertainties.
Forward citations
Cited by 4 Pith papers
-
Resonance-aware parton-shower matching for off-shell top-antitop production with semi-leptonic decays at electron-positron colliders
A resonance-aware MC@NLO matching procedure preserves top-antitop line shapes when NLO QCD predictions for off-shell ttbar production at e+e− colliders are showered with Pythia8.
-
An Optimal Transportation Approach for Improved Confidence Intervals
Optimal-transport couplings are used to construct confidence intervals that reduce coverage error relative to classical quantile-based intervals, with consistency theory and data-driven hyperparameters.
-
An Optimal Transportation Approach for Improved Confidence Intervals
An optimal transport method is proposed to construct confidence intervals with improved coverage, including theoretical consistency results, error bounds, and simulation comparisons.
-
Monte Carlo Event Generators for Future Lepton Colliders
Reviews selected challenges in Monte Carlo event generators for future lepton colliders including electroweak corrections, initial-state radiation, beam dynamics, perturbative QCD and non-perturbative modelling.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.