Pith. sign in

REVIEW 1 cited by

Dynamical grooming meets LHC data

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

arxiv 2103.06566 v2 pith:HGH57K3B submitted 2021-03-11 hep-ph hep-ex

classification hep-phhep-ex
keywords analyticdatacomparisondynamicalfindgroomingmomentumnon-perturbative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

In this work, we analyse the all-orders resummation structure of the momentum sharing fraction, $z_g$, opening angle, $\theta_g$, and relative transverse momentum, $k_{t,g}$, of the splitting tagged by the dynamical grooming procedure in hadronic collisions. We demonstrate that their resummation does non-exponentiate and it is free of clustering logarithms. Then, we analytically compute the probability distributions of ($z_g$, $\theta_g$, $k_{t,g}$) up to next-to next-to-double logarithm accuracy (N2DL) in the narrow jet limit, including a matching to leading order in $\alpha_s$. On the phenomenological side, we perform an analytic-to-parton level comparison with Pythia and Herwig. We find that differences between the analytic and the Monte-Carlo results are dominated by the infra-red regulator of the parton shower. Further, we present the first analytic comparison to preliminary ALICE data and highlight the role of non-perturbative corrections in such low-$p_t$ regime. Once the analytic result is corrected by a phenomenologically determined non-perturbative factor, we find very good agreement with the data.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. High-Dimensional Unfolding in Large Backgrounds

    hep-ph 2025-07 conditional novelty 6.0 of 10

    OmniFold-HI, an ML unfolding algorithm that handles large backgrounds and high-dimensional auxiliary observables, is derived, shown equivalent to iterative Bayesian unfolding, and demonstrated to improve jet-substruct...

Pith tools