Pith. sign in

REVIEW 1 cited by

The Georgi Algorithms of Jet Clustering

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 1408.3823 v3 pith:M2LX4XOB submitted 2014-08-17 hep-ph hep-ex

classification hep-phhep-ex
keywords functionalgorithmsclusteringconebetageorgiindexkinematics
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

We reveal the direct link between the jet clustering algorithms recently proposed by Howard Georgi and parton shower kinematics, providing firm foundation from the theoretical side. The kinematics of this class of elegant algorithms is explored systematically for partons with arbitrary masses and the jet function is generalized to $J^{(n)}_\beta$ with a jet function index $n$ in order to achieve more degrees of freedom. Based on three basic requirements that, the result of jet clustering is process-independent and hence logically consistent, for softer subjets the inclusion cone is larger to conform with the fact that parton shower tends to emit softer partons at earlier stage with larger opening angle, and that the cone size cannot be too large in order to avoid mixing up neighboring jets, we derive constraints on the jet function parameter $\beta$ and index $n$ which are closely related to cone size cutoff. Finally, we discuss how jet function values can be made invariant under Lorentz boost.

Discussion (0). Continue with ORCID 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. Quantum Algorithms for Jet Clustering

    hep-ph 2019-08 accept novelty 7.0 of 10

    Thrust can be computed in O(N^2) time with a Grover-based quantum algorithm under a sequential data-loading model, and in O(N^2 log N) time classically with sorting, but the quantum advantage is only formal for very r...

Pith tools