Pith. sign in

REVIEW 1 cited by

Deterministic Annealing as a jet clustering algorithm in hadronic collisions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 hep-ph/0407214 v2 pith:MWZL4JFA submitted 2004-07-19 hep-ph

L. Angelini , G. Nardulli , L. Nitti , M. Pellicoro , D. Perrino , S. Stramaglia This is my paper · ORCID
classification hep-ph
keywords annealingdeterministicalgorithmcollisionshadronicproblemableadapted
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We show that a general purpose clusterization algorithm, Deterministic Annealing, can be adapted to the problem of jet identification in particle production by high energy collisions. In particular we consider the problem of jet searching in events generated at hadronic colliders. Deterministic Annealing is able to reproduce the results obtained by traditional jet algorithms and to exhibit a higher degree of flexibility.

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