Papers › Fully Bayesian Unfolding
Fully Bayesian Unfolding
Georgios Choudalakis
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.
Bayesian inference is applied directly to the problem of unfolding. The outcome is a posterior probability density for the spectrum before smearing, defined in the multi-dimensional space of all possible spectra. Regularization consists in choosing a non-constant prior. Despite some similarity, the fully bayesian unfolding (FBU) method, presented here, should not be confused with D'Agostini's iterative method.
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