Papers › Algorithmic Pulsar Timing
Algorithmic Pulsar Timing
Camryn Phillips, Scott Ransom
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.
Pulsar timing is a process of iteratively fitting pulse arrival times to constrain the spindown, astrometric, and possibly binary parameters of a pulsar, by enforcing integer numbers of pulsar rotations between the arrival times. Phase connection is the process of unambiguously determining those rotation numbers between the times of arrival (TOAs) while determining a pulsar timing solution. Pulsar timing currently requires a manual process of step-by-step phase connection performed by individuals. In an effort to quantify and streamline this process, we created the Algorithmic Pulsar Timer, APT, an algorithm which can accurately phase connect and time isolated pulsars. Using the statistical F-test and knowledge of parameter uncertainties and covariances, the algorithm decides what new data to include in a fit, when to add additional timing parameters, and which model to attempt in subsequent iterations. Using these tools, the algorithm can phase-connect timing data that previously required substantial manual effort. We tested the algorithm on 100 simulated systems, with a 99% success rate. APT combines statistical tests and techniques with a logical decision-making process, very similar to the manual one used by pulsar astronomers for decades, and some computational brute-force, to automate the often tricky process of isolated pulsar phase connection, setting the foundation for automated fitting of binary pulsar systems.
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