Papers › Toward a computationally-efficient follow-up pipeline for blind continuous...
Toward a computationally-efficient follow-up pipeline for blind continuous gravitational-wave searches
Lorenzo Mirasola, Rodrigo Tenorio
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.
The sensitivity of continuous gravitational-wave (CW) searches for unknown neutron stars (NSs) is limited by their parameter space breadth. To fit within reasonable computing budgets, hierarchical schemes are used to identify interesting candidates using affordable methods. The resulting sensitivity depends on the number of candidates selected to follow-up. In this work, we present a novel framework to evaluate the effectiveness of stochastic CW follow-ups. Our results allow for a significant reduction of the computing cost of pyfstat, a well-established follow-up method. We also simplify the setup of multistage follow-ups by removing the need for parameter-space metrics. The study was conducted on Gaussian and real O3 Advanced LIGO data covering both isolated and binary sources. These results will have a positive impact on the sensitivity of all-sky searches in the forthcoming observing runs of the LIGO-Virgo-KAGRA collaboration.
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