Papers › End-to-End Multi-Track Reconstruction using Graph Neural Networks at Belle II
End-to-End Multi-Track Reconstruction using Graph Neural Networks at Belle II
Lea Reuter, Giacomo De Pietro, Slavomira Stefkova, Torben Ferber, Valerio Bertacchi, Giulia Casarosa, Luigi Corona, Patrick Ecker, Alexander Glazov, Yubo Han, Martina Laurenza, Thomas Lueck, Ludovico Massaccesi, Suryanarayan Mondal, Bianca Scavino, Stefano Spataro, Christian Wessel, Laura Zani
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We present the study of an end-to-end multi-track reconstruction algorithm for the central drift chamber of the Belle II experiment at the SuperKEKB collider using Graph Neural Networks for an unknown number of particles. The algorithm uses detector hits as inputs without pre-filtering to simultaneously predict the number of track candidates in an event and their kinematic properties. In a second step, we cluster detector hits for each track candidate to pass to a track fitting algorithm. Using a realistic full detector simulation including beam-induced backgrounds and detector noise taken from actual collision data, we find significant improvements in track finding efficiencies for tracks in a variety of different event topologies compared to the existing baseline algorithm used in Belle II. For events with a hypothetical long-lived massive particle with a mass in the GeV-range decaying uniformly along its flight direction into two charged particles, the GNN achieves a combined track finding and fitting efficiency of 85.4% with a fake rate of 2.5%, compared to 52.2% and 4.1% for the baseline algorithm. This is the first end-to-end multi-track machine learning algorithm for a drift chamber detector that has been utilized in a realistic particle physics environment.
In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections