Newshot

Curvature-Aware Edge Dynamic GNNs for Low-$p_T$ Track Reconstruction at HL-LHC

Summary

arXiv:2611.17343v1 Announce Type: cross Abstract: Particle track reconstruction in high-energy collider experiments is a computationally demanding combinatorial problem, traditionally solved by Kalman filters that scale poorly with increasing detector occupancy. Graph Neural Networks (GNNs) have recently emerged as a promising alternative. In this work, we introduce the Manifold Helical-IN, a novel Interaction Network architecture that explicitly embeds detector spacepoints onto a helical manifold chart using curvature-aware features. This geometric projection mathematically unrolls the tightly curling trajectories of low-momentum particles. Consequently, the network can distinguish true physical tracks from combinatorial noise with good precision. Evaluated on the TrackML challenge dataset, the proposed Manifold Helical-IN achieves a reconstruction efficiency of 0.9675 in the experimentally critical $p_T > 0.5$ GeV regime, approaching recently reported Transformer-based approaches. Cr…

Original text(via arXiv cs.LG)

Physics > Instrumentation and Detectors

Title:Curvature-Aware Edge Dynamic GNNs for Low-$p_T$ Track Reconstruction at HL-LHC

Abstract:Particle track reconstruction in high-energy collider experiments is a computationally demanding combinatorial problem, traditionally solved by Kalman filters that scale poorly with increasing detector occupancy. Graph Neural Networks (GNNs) have recently emerged as a promising alternative. In this work, we introduce the Manifold Helical-IN, a novel Interaction Network architecture that explicitly embeds detector spacepoints onto a helical manifold chart using curvature-aware features. This geometric projection mathematically unrolls the tightly curling trajectories of low-momentum particles. Consequently, the network can distinguish true physical tracks from combinatorial noise with good precision. Evaluated on the TrackML challenge dataset, the proposed Manifold Helical-IN achieves a reconstruction efficiency of 0.9675 in the experimentally critical $p_T > 0.5$ GeV regime, approaching recently reported Transformer-based approaches. Crucially, the manifold embedding yields a fake track rate of 0.0037. This represents a 13-fold improvement over the baseline Helical-IN (0.0508). Furthermore, the model maintains good track coherence, as quantified by our proposed Mean Hit Recovery Fraction (MHRF) of 0.858, and achieves a highly efficient inference latency of approximately 150 ms per event on a single NVIDIA A100 GPU. These results represent a critical step toward real-time soft particle tracking for the High-Level Trigger (HLT). By operating within practical HLT latency budgets, this geometry-aware approach provides a pathway to recover soft, anomalous Beyond Standard Model signatures such as unclustered energy patterns (SUEPs), that routinely evade standard hardware filters.
Subjects:Instrumentation and Detectors (physics.ins-det) ; Machine Learning (cs.LG); High Energy Physics - Experiment (hep-ex); Data Analysis, Statistics and Probability (physics.data-an)
Cite as:arXiv:2611.17343 [physics.ins-det]
(or arXiv:2611.17343v1 [physics.ins-det] for this version)
https://doi.org/10.48550/arXiv.2611.17343 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.LG
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗