Pith. sign in

REVIEW 1 cited by

Jet characterization in Heavy Ion Collisions by QCD-Aware Graph Neural Networks

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 2103.14906 v2 pith:EJB5XEQM submitted 2021-03-27 physics.data-an hep-ph

classification physics.data-anhep-ph
keywords graphheavyparticlesfindingtechniqueapplicabilitybackgroundcollisions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The identification of jets and their constituents is one of the key problems and challenging task in heavy ion experiments such as experiments at RHIC and LHC. The presence of huge background of soft particles pose a curse for jet finding techniques. The inabilities or lack of efficient techniques to filter out the background lead to a fake or combinatorial jet formation which may have an errorneous interpretation. In this article, we present Graph Reduction technique (GraphRed), a novel class of physics-aware and topology-based attention graph neural network built upon jet physics in heavy ion collisions. This approach directly works with the physical observables of variable-length set of final state particles on an event-by-event basis to find most likely jet-induced particles in an event. This technique demonstrate the robustness and applicability of this method for finding jet-induced particles and show that graph architectures are more efficient than previous frameworks. This technique exhibit foremost time a classifier working on particle-level in each heavy ion event produced at the LHC. We present the applicability and integration of the model with current jet finding algorithms such as FastJet.

Discussion (0). Sign in 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. Positional Encoding meets Persistent Homology on Graphs

    cs.LG 2025-06 reject novelty 7.0 of 10

    PiPE combines positional encodings with persistent homology features in a message-passing framework and is claimed to be provably more expressive than either approach alone, with empirical gains on molecular benchmarks.

Pith tools