Pith. sign in

REVIEW 1 cited by

Jet reconstruction in hadronic collisions by Gaussian filtering

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 0806.1499 v2 pith:URUGDJQX submitted 2008-06-09 nucl-ex hep-ex

classification nucl-exhep-ex
keywords algorithmcollisionsgaussianmathrmalgorithmsconventionalfilterhadronic
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

A new algorithm for jet finding in hadronic collisions is presented. The algorithm, based on a Gaussian filter in $(\eta,\phi)$, is specifically intended for use in heavy ion collisions and/or for detectors with limited acceptance. The performance of the algorithm is compared to two conventional algorithms, a seedless cone algorithm and a $k_\perp$ algorithm, for Pythia simulated di-jet events in $\sqrt{s} = 200 \mathrm{GeV}$ $p + p$ collisions with $4 \mathrm{GeV}/c \le \sqrt{Q^2} \le 16 \mathrm{GeV}/c$. The Gaussian filter is found to perform as well as, and in some instances better than, the conventional algorithms.

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