{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:KHI4HMNGS2HRQ6TCET6LCDAXUY","short_pith_number":"pith:KHI4HMNG","schema_version":"1.0","canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","source":{"kind":"arxiv","id":"2606.22930","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.22930","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-22T07:06:05Z","cross_cats_sorted":["astro-ph.IM"],"title_canon_sha256":"22e3fdfbfec9c099b13c72fdf88e29287ab996703ea73fd83f97ccb02e745636","abstract_canon_sha256":"5c1f12cd37aca0aa4a5e090b4d4b5c4e4a5e6eb58043abc50e7d03d56224e107"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:04.542051Z","signature_b64":"BDEu3RzvC2qMPAu7foQXchBO7Ca9vSd9c0kqhHH5BowbtmBPTcI3zb0SKXpKOhX6Sj4Q+kTsjUZo3a3M9NNrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","last_reissued_at":"2026-06-23T03:14:04.541672Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:04.541672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.22930","created_at":"2026-06-23T03:14:04.541731+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.22930v1","created_at":"2026-06-23T03:14:04.541731+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22930","created_at":"2026-06-23T03:14:04.541731+00:00"},{"alias_kind":"pith_short_12","alias_value":"KHI4HMNGS2HR","created_at":"2026-06-23T03:14:04.541731+00:00"},{"alias_kind":"pith_short_16","alias_value":"KHI4HMNGS2HRQ6TC","created_at":"2026-06-23T03:14:04.541731+00:00"},{"alias_kind":"pith_short_8","alias_value":"KHI4HMNG","created_at":"2026-06-23T03:14:04.541731+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY","json":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY.json","graph_json":"https://pith.science/api/pith-number/KHI4HMNGS2HRQ6TCET6LCDAXUY/graph.json","events_json":"https://pith.science/api/pith-number/KHI4HMNGS2HRQ6TCET6LCDAXUY/events.json","paper":"https://pith.science/paper/KHI4HMNG"},"agent_actions":{"view_html":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY","download_json":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY.json","view_paper":"https://pith.science/paper/KHI4HMNG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.22930&json=true","fetch_graph":"https://pith.science/api/pith-number/KHI4HMNGS2HRQ6TCET6LCDAXUY/graph.json","fetch_events":"https://pith.science/api/pith-number/KHI4HMNGS2HRQ6TCET6LCDAXUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/action/storage_attestation","attest_author":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/action/author_attestation","sign_citation":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/action/citation_signature","submit_replication":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/action/replication_record"}},"created_at":"2026-06-23T03:14:04.541731+00:00","updated_at":"2026-06-23T03:14:04.541731+00:00"}