1. Tracking in the CBM experiment I. Kisel Kirchhoff Institute of Physics, University of Heidelberg (for the CBM Collaboration) TIME05, Zurich, Switzerland October 03-07, 2005 KIP CBM

2. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg2/12 Facility for Antiproton and Ion Research (GSI, Darmstadt) Future accelerator complex FAIR at GSI, Darmstadt: Research program includes: Radioactive Ion beams: Radioactive Ion beams: Structure of nuclei far from stability Anti-proton beams: Anti-proton beams: hadron spectroscopy, anti hydrogen Ion and laser induced plasmas: Ion and laser induced plasmas: High energy density in matter High-energy nuclear collisions: High-energy nuclear collisions: Strongly interacting matter at high baryon densities SIS 100 Tm SIS 300 Tm U: 35 AGeV p: 90 GeV Compressed Baryonic Matter (CBM) Experiment

3. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg3/12 Facility for Antiproton and Ion Research Photomontage of the existing and the planned research facility at GSI/FAIR.

4. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg4/12 Tracking Nuclear Collisions Tracking challenge: 10 7 Au+Au reactions/sec ~ 1000 charged particles/event momentum measurement with resolution < 1% secondary vertex reconstruction (  30  m) high speed data acquisition and trigger system PhysicsObservables In-medium modifications of hadrons: onset of chiral symmetry restoration , ,   e + e - (μ + μ - ) open charm: D 0, D ± Strangeness in matter: enhanced strangeness production K, , , ,  Indications for deconfinement: anomalous charmonium suppression ? D 0, D ±, J/   e + e - (μ + μ - ) Critical point: event-by-event fluctuations , K Open charm measurement: one of the prime interests of CBM, and one of the most difficult tasks

5. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg5/12 The Compressed Baryonic Matter (CBM) Experiment Radiation hard silicon pixel/strip detectors in a magnetic dipole field Tracking, momentum measurement, vertex reconstruction: Radiation hard silicon pixel/strip detectors in a magnetic dipole field RICH & TRD (& ECAL) Electron ID: RICH & TRD (& ECAL) TOF (& RICH) Hadron ID: TOF (& RICH) ECAL Photons,  0,  : ECAL High interaction rates beam target STS (5, 10, 20, 40, 60, 80, 100 cm) TRDs (4,6, 8 m) TOF (10 m) ECAL (12 m) RICH magnet

6. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg6/12 Modular Structure of DAQ MAPS, STSRICHECAL Detector PC Farm Event Builder Network 10 7 ev/s 10 5 sl/s 50 kB/ev 100 ev/slice 5 MB/slice N x M SchedulerScheduler TRD Sub-Farm RU RU RU RU RU RU RU RU RU RU RU RU RU RU RU RU Farm Control System Sub-Farm SF n available SF n tt MAPSSTSRICHTRDECAL SF n tt MAPSSTSRICHTRDECAL SF n tt tt tt ttHLTC++, Framework, GEANT L1 CPU C++, Framework, GEANT L1 FPGA C++, SystemC, VHDL

7. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg7/12 Cellular Automaton method for track finding 1. 1.Generate a set of tracklets (similar to seeding). Tracklets are created everywhere – all chambers are seeding chambers. The same set of cuts can be applied as in the Kalman Filter track finder – the cuts reflect geometrical acceptance of a detector that is common for all methods. As hits are sorted, tracklets are generated in groups with the same leftmost hit (due to inserted loops over chambers). Therefore, every hit stores two pointers – to the first and last tracklets of his group. Every tracklet has a counter meaning possible position on a track (initially 0). 2. 2.Extrapolate tracklets back to the previous layer. Usually tracklets are created (as in KF) starting from the downstream chambers and moving to the target. Therefore, during generation of the next portion of tracklets (one or two chambers closer to the target) the algorithm applies the track model to the tracklets with a common point (simple selection of the tracklets using the stored pointers, see 1). 3. 3.Find neighbors and increase the counter. If neighbors (possible track continuations) are found, a counter of a current tracklet is incremented with respect to a neighbor with the largest counter. 4. 4.Continue to 1 for all chambers. 5. 5.Collect track candidates. Start with tracklets having the largest counter (max_counter), for each of them take a neighbor (at the right) which has a counter=max_counter-1, continue similar to the Simple Kalman Filter but follow counters (!), make branches, but no empty layers, keep the best (chi2) track for each initial tracklet with the largest counter. 6. 6.Apply competition between track-candidates. After step 5 a set of track-candidates of the same length is created, therefore chi2 is well suitable criterion to sort them. After sorting start with the best (chi2) track and flag all hits of the track as used. Continue with the next track (with lower chi2), check if number of used hits is less than X (parameter, depends on track density) and flag his hits as used or delete the track. Proceed with the next track-candidate etc. 7. 7.Continue to step 5, but collect tracks starting with the counter = max_counter-1. Proceed 5-7 decrementing max_counter until the shortest tracks (usually of length=tracklet_length+1) are collected. 8. 8.Merge clones if necessary. In case of significant detector inefficiency merge short tracks into long tracks. 9. 9.Kill ghost. Apply additional cuts to kill ghost tracks, most of them are short tracks. Implementations: ARES (NIM A329, 1993) NEMO (NIM A387, 1997) HERA-B (NIM A489, 2002; NIM A490, 2002) LHCb (LHCb note 2003-064, 2003) CBM (CHEP04, 2004) (see http://www-linux.gsi.de/~ikisel/reco/ )http://www-linux.gsi.de/~ikisel/reco/ FilterSmootherCleaner Drawing analogy to the Kalman method one can consider steps 1-4 as Filter, 5-7 as Smoother, and 8-9 as Cleaner.

8. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg8/12 Performance of track finding Track category Efficiency, % Reference set99.45 All set96.98 Extra set89.46 Clone 0.01 Ghost 0.61 ALL MC TRACKS RECONSTRUCTABLE TRACKS Number of hits >= 4 REFERENCE TRACKS Momentum > 1 GeV S. Gorbunov, I. Kisel and I. Vassiliev, Analysis of D 0 meson detection in Au+Au collisions at 25 AGeV, CBM-PHYS-note-2005-001

9. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg9/12 Tracking in non-homogeneous magnetic field MethodResidualsPulls  p/p xytxtx tyty q/pxytxtx tyty Runge-Kutta 40.6427241.5 1.171.051.011.021.00 Analytic 30.6427241.5 1.181.051.001.021.00 Analytic 20.6827241.5 1.301.081.011.031.00 Analytic 10.9430251.5 1.901.371.031.101.02 Analytic Light0.6427241.5 1.191.051.001.021.00 Analytic Central2.4938251.71.53.772.231.031.331.00 The precision of extrapolation does not depend on a shape of the magnetic field. One can cut off the higher-order terms in the series. S. Gorbunov and I. Kisel, An analytic formula for track extrapolation in an inhomogeneous magnetic field, CBM-SOFT-note-2005-001

10. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg10/12 Elastic net for the traveling salesman problem Discrete EN (*) Pentium IV/2.4 GHz R. Durbin and D. Willshaw, An analogue approach to the travelling salesman problem, Nature, 326 (1987) 689

11. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg11/12 Standalone elastic net ring finder in RICH All set: N hits ≥ 5 Ref set: N hits ≥ 15 Extra set: 5 ≤ N hits < 15 Reconstructed: ≥ 70% hits from the same MC Clone: MC reconstructed few times Ghost: < 70% hits from the same MC Reference set94.3 All set74.0 Extra set65.5 Clone rate 0.8 Ghost rate12.8 Hits/event1394 Found MC rings/event39 Time/event5.4 ms Time/hit 3.9  s S. Gorbunov and I. Kisel, Elastic net for standalone RICH ring finding, CBM-SOFT-note-2005-002

12. 03-07 October 2005, TIME05Ivan Kisel, KIP, Uni-Heidelberg12/12Summary High track density at high rate High track density at high rate Most crucial blocks of the (off-line) reconstruction code ready Most crucial blocks of the (off-line) reconstruction code ready Work on detector optimization Work on detector optimization CBM notes and other publications on reconstruction at: CBM notes and other publications on reconstruction at: http://www-linux.gsi.de/~ikisel/reco/ http://www-linux.gsi.de/~ikisel/reco/http://www-linux.gsi.de/~ikisel/reco/ Participants from the CBM experiment: Participants from the CBM experiment: Walter Müller, Johann Heuser, Iouri Vassiliev and Ivan Kisel Walter Müller, Johann Heuser, Iouri Vassiliev and Ivan Kisel