Pith. sign in

REVIEW 1 cited by

A Simple Alternative to Jet-Clustering Algorithms

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.1161 v2 pith:IILUTHVY submitted 2014-08-06 hep-ph

classification hep-ph
keywords jetsalgorithmsclassdescribeexamplespropertiessimplesome
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

I describe a class of iterative jet algorithms that are based on maximizing a fixed function of the total 4-momentum rather than clustering of pairs of jets. I describe some of the properties of the simplest examples of this class, appropriate for jets at an $e^+e^-$ machine. These examples are sufficiently simple that many features of the jets that they define can be determined analytically with ease. The jets constructed in this way have some potentially useful properties, including a strong form of infrared safety.

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