REVIEW 1 cited by
J_{E_T}: A Global Jet Finding Algorithm
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
Signed reviews
read the original abstract
We introduce a new jet-finding algorithm for a hadron collider based on maximizing a J_{E_T} function for all possible combinations of particles in an event. This function prefers a larger value of the jet transverse energy and a smaller value of the jet mass. The jet shape is proved to be a circular cone in Cartesian coordinates with the geometric center shifted from the jet momentum toward the central region. The jet cone size shrinks for a more forward jet. We have implemented our J_{E_T} algorithm with a reasonable running time scaling as N n^3, where "N" is the total number of particles and "n" (much less than N) is the number of particles in a fiducial region. Many features of our J_{E_T} jets are similar to anti-k_t jets, including the reconstructed jet momentum and the "back-reaction" from soft contamination. Nevertheless, when the jet parameters in the two algorithms are matched using QCD jets, we find that the J_{E_T} algorithm has a larger efficiency than anti-k_t for identifying objects with hard splittings such as a W-jet.
Forward citations
Cited by 1 Pith paper
-
Quantum Algorithms for Jet Clustering
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...
Discussion (0). Continue with ORCID to comment.