{"paper":{"title":"First analytical coverage bounds of a fully specified nested sampling algorithm","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["astro-ph.IM"],"primary_cat":"stat.CO","authors_text":"Johannes Buchner","submitted_at":"2026-06-22T07:06:05Z","abstract_excerpt":"Nested sampling is a Monte Carlo algorithm for posterior estimation and Bayesian model comparison. It maintains a population of $K$ live points sampled from the prior, and at each iteration discards the lowest-likelihood point and replaces it with a new sample drawn from the prior restricted to exceed the discarded likelihood. Achieving this likelihood-restricted prior sampling efficiently and reliably is the central computational challenge. For low-to-moderate dimensional problems, MLFriends is a general and robust region-based approach that constructs a proposal region by bootstrap aggregati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22930","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.22930/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}