Search

Particle tracking in modern high-energy physics experiments is a challenging task. Well-proven algorithms are no longer capable of providing satisfactory results in terms of processing throughput due to an enormous amount of data being produced through the detector's environments. At the same time, Graph Neural Networks (GNN) have shown great potential, namely the GNN approach, which was introduced by the HEP.TrkX project at LHC. We have already applied such approach for the BM@N experiment of the NICA megaproject and, despite the fact that the straightforward adaptation of the original approach did not achieve significant results for the simulated data from the BM@N GEM detector, we proposed a novel Line Digraph approach with the usage of GNN model, which demonstrated a big potential in the BM@N GEM detector's fixed target environment. Because of such success, we decided to adapt our algorithm to experiments with the collider environment, such as BES-III experiment in China. The overall potential of Line Digraph approach generalization is demonstrated: we achieved encouraging results in terms of tracking efficiency and processing speed on Monte-Carlo simulated data. [ABSTRACT FROM AUTHOR]

One of the most important problems of data processing in high energy and nuclear physics is the event reconstruction. Its main part is the track reconstruction procedure which consists in looking for all tracks that elementary particles leave when they pass through a detector among a huge number of points, so-called hits, produced when flying particles fire detector coordinate planes. Unfortunately, the tracking is seriously impeded by the famous shortcoming of multiwired, strip in GEM detectors due to the appearance in them a lot of fake hits caused by extra spurious crossings of fired strips. Since the number of those fakes is several orders of magnitude greaterthan for true hits, one faces with the quite serious difficulty to unravelpossible track-candidates via true hits ignoring fakes. On the basis of our previous two-stage approach based on hits preprocessing using directed K-d tree search followed by a deep neural classifier we introduce here two new tracking algorithms. Both algorithms combine those two stages in one while using different types of deep neural nets. We show that both proposed deep networks do not require any special preprocessing stage, are more accurate, faster and can be easier parallelized. Preliminary results of our new approaches for simulated events are presented. [ABSTRACT FROM AUTHOR]