Lea Reuter

Lea Reuter

Auto-generated profile, based on publicly available information

Lea Reuter

Institute of Experimental Particle Physics (ETP) Karlsruhe Institute of Technology (KIT) Karlsruhe Germany

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
21 March 2024 in Computing and Software for Big Science
Verified
Journal Article
Open access
PDF file
MNMarc Neu
Marc Neu
JBJürgen Becker
Jürgen Becker
PDPhilipp Dorwarth
Philipp Dorwarth
TFTorben Ferber
Torben Ferber
LRLea Reuter
Lea Reuter
KUKai Unger
Kai Unger
We present a design methodology that enables the semi-automatic generation of a hardware-accelerated graph building architectures for locally constrained graphs based on formally described detector definitions. In addition, we define a similarity measure in order to compare our locally constrained graph building approaches with commonly used k-nearest neighbour building approaches. To demonstrate the feasibility of our solution for particle physics applications, we implemented a real-time graph building approach in a case study for the Belle II central drift chamber using Field-Programmable Gate Arrays (FPGAs). Our presented solution adheres to all throughput and latency constraints currently present in the hardware-based trigger of the Belle II experiment. We achieve constant time complexity at the expense of linear space complexity and thus prove that our automated methodology generates online graph building designs suitable for a wide range of particle physics applications. By enabling an hardware-accelerated preprocessing of graphs, we enable the deployment of novel Graph Neural Networks (GNNs) in first-level triggers of particle physics experiments.

11 September 2024 in Journal of High Energy Physics
Verified
Journal Article
Open access
PDF file
IAI Adachi
I Adachi
LAL Aggarwal
L Aggarwal
HAH Aihara
H Aihara
NAN Akopov
N Akopov
Alberto AloisioAlberto Aloisio
Alberto Aloisio
RŽR Žlebčík
R Žlebčík
We present the result of a search for the charged-lepton-flavor violating decay τ − → μ − μ + μ − using a 424 fb −1 sample of data recorded by the Belle II experiment at the SuperKEKB e + e − collider. The selection of e + e − → τ + τ − events is based on an inclusive reconstruction of the non-signal tau decay, and on a boosted decision tree to suppress background. We observe one signal candidate, which is compatible with the expectation from background processes. We set a 90% confidence level upper limit of 1.9 × 10 −8 on the branching fraction of the τ − → μ − μ + μ − decay, which is the most stringent bound to date.

3 May 2025 in Computing and Software for Big Science
Verified
Journal Article
Open access
PDF file
LRL. Reuter
L. Reuter
GPG. De Pietro
G. De Pietro
SSS. Stefkova
S. Stefkova
TFT. Ferber
T. Ferber
VBV. Bertacchi
V. Bertacchi
LZL. Zani
L. Zani
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 involving 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 charge efficiency of 85.4% per track, with a fake rate of 2.5%, averaged over the full detector acceptance. In comparison, the baseline algorithm achieves 52.2% efficiency and a fake rate of 4.1%. 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.

1 November 2025 in The European Physical Journal C
Verified
Journal Article
Open access
PDF file
IAI Adachi
I Adachi
HAH Ahmed
H Ahmed
YAY Ahn
Y Ahn
HAH Aihara
H Aihara
NAN Akopov
N Akopov
RŽR Žlebčík
R Žlebčík
The Belle II experiment’s ability to identify particles critically affects the sensitivity of its measurements. We describe Belle II’s algorithms for identifying charged particles and evaluate their performance in separating pions, kaons, and protons using $$426\,\text {fb}^{-1}$$ 426 fb - 1 of data collected at the energy-asymmetric $${\varvec{e}}^+{\varvec{e}}^-$$ e + e - collider SuperKEKB in 2019–2022 at center-of-mass energies at and near the mass of the $$\Upsilon $$ Υ (4S).

1 September 2022 in Machine Learning: Science and Technology
Verified
Journal Article
Open access
JKJames Kahn
James Kahn
ITIlias Tsaklidis
Ilias Tsaklidis
OTOskar Taubert
Oskar Taubert
LRLea Reuter
Lea Reuter
GDGiulio Dujany
Giulio Dujany
MGMarkus Götz
Markus Götz
In this work, we present a neural approach to reconstructing rooted tree graphs describing hierarchical interactions, using a novel representation we term the lowest common ancestor generations (LCAG) matrix. This compact formulation is equivalent to the adjacency matrix, but enables learning a tree’s structure from its leaves alone without the prior assumptions required if using the adjacency matrix directly. Employing the LCAG therefore enables the first end-to-end trainable solution which learns the hierarchical structure of varying tree sizes directly, using only the terminal tree leaves to do so. In the case of high-energy particle physics, a particle decay forms a hierarchical tree structure of which only the final products can be observed experimentally, and the large combinatorial space of possible trees makes an analytic solution intractable. We demonstrate the use of the LCAG as a target in the task of predicting simulated particle physics decay structures using both a Transformer encoder and a neural relational inference encoder graph neural network. With this approach, we are able to correctly predict the LCAG purely from leaf features for a maximum tree-depth of 8 in 92.5 % of cases for trees up to 6 leaves (including) and 59.7 % for trees up to 10 in our simulated dataset.

21 July 2025 in Physical Review Letters
Verified
Journal Article
Open access
IAI Adachi
I Adachi
LAL Aggarwal
L Aggarwal
HAH Ahmed
H Ahmed
JAJ K Ahn
J K Ahn
HAH Aihara
H Aihara
BCBelle and Belle II Collaborations
Belle and Belle II Collaborations
Using data samples of 102 million ϒ ( 1 S ) events and 158 million ϒ ( 2 S ) events collected by the Belle detector at the KEKB asymmetric-energy e + e − collider, we search for [ u d s c c ¯ ] pentaquark states decaying to J / ψ Λ . Using the first observations of ϒ ( 1 S , 2 S ) inclusive decays to J / ψ Λ , we find evidence of the P c c ¯ s ( 4459 ) 0 state with a local significance of 3.3 standard deviations, including statistical and systematic uncertainties. We measure the mass and width of the P c c ¯ s ( 4459 ) 0 to be ( 4471.7 ± 4.8 ± 0.6 ) MeV / c 2 and ( 22 ± 13 ± 3 ) MeV , respectively. The branching fractions for P c c ¯ s ( 4459 ) 0 production are measured to be B [ ϒ ( 1 S ) → P c c ¯ s ( 4459 ) 0 / P ¯ c c ¯ s ( 4459 ) 0 + anything ] = ( 3.5 ± 2.0 ± 0.2 ) × 10 − 6 and B [ ϒ ( 2 S ) → P c c ¯ s ( 4459 ) 0 / P ¯ c c ¯ s ( 4459 ) 0 + anything ] = ( 2.9 ± 1.7 ± 0.4 ) × 10 − 6 . The inclusive branching fractions of ϒ ( 1 S , 2 S ) → J / ψ Λ / Λ ¯ are measured to be B [ ϒ ( 1 S ) → J / ψ Λ / Λ ¯ + anything ] = ( 36.9 ± 5.3 ± 2.4 ) × 10 − 6 and B [ ϒ ( 2 S ) → J / ψ Λ / Λ ¯ + anything ] = ( 22.3 ± 5.7 ± 3.1 ) × 10 − 6 . We measure the visible cross section σ ( e + e − → J / ψ Λ / Λ ¯ + anything ) = ( 90 ± 14 ± 6 ) fb for the continuum production at s = 10.52 GeV . In all cases, the first uncertainties are statistical and the second are systematic.