Cluster Counting Algorithm for the CEPC Drift Chamber using LSTM and DGCNN
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:N4KO4CVFrecord.jsonopen to challenge →
read the original abstract
The particle identification (PID) of hadrons plays a crucial role in particle physics experiments, especially in flavor physics and jet tagging. The cluster-counting method, which measures the number of primary ionizations in gaseous detectors, is a promising breakthrough in PID. However, developing an effective reconstruction algorithm for cluster counting remains challenging. To address this challenge, we propose a cluster-counting algorithm based on long short-term memory and dynamic graph convolutional neural networks for the CEPC drift chamber. Experiments on Monte Carlo simulated samples demonstrate that our machine-learning-based algorithm surpasses traditional methods. It improves the $K/\pi$ separation of PID by 10\%, meeting the PID requirements of CEPC.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.