Papers › Is the bump significant? An axion-search example
Is the bump significant? An axion-search example
Frederik Beaujean, Allen Caldwell, Olaf Reimann
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.
Many experiments in physics involve searching for a localized excess over background expectations in an observed spectrum. If the background is known and there is Gaussian noise, the amount of excess of successive observations can be quantified by the runs statistic taking care of the look-elsewhere effect. The distribution of the runs statistic under the background model is known analytically but the computation becomes too expensive for more than about a hundred observations. This work demonstrates a principled high-precision extrapolation from a few dozen up to millions of data points. It is most precise in the interesting regime when an excess is present. The method is verified for benchmark cases and successfully applied to real data from an axion search. The code that implements our method is available at https://github.com/fredRos/runs .
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