{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:KHI4HMNGS2HRQ6TCET6LCDAXUY","short_pith_number":"pith:KHI4HMNG","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"},"canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","source":{"kind":"arxiv","id":"2606.22930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22930","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22930v1","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22930","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_12","alias_value":"KHI4HMNGS2HR","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_16","alias_value":"KHI4HMNGS2HRQ6TC","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_8","alias_value":"KHI4HMNG","created_at":"2026-06-23T03:14:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:KHI4HMNGS2HRQ6TCET6LCDAXUY","target":"record","payload":{"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"},"canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","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"},"source_kind":"arxiv","source_id":"2606.22930","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:14:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"A9NFblLBYRBeJWFH9DwpJlLWo6XEdjsHfDE3ScgoHLUmUf1sN1m4a8cWGMFTESTOws4i5uvWGRuI3z5hpmogCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:31.202795Z"},"content_sha256":"5b141036cf42a836f84fc0a28346d273aa251ce34c09687aa2a6a3075ec8d075","schema_version":"1.0","event_id":"sha256:5b141036cf42a836f84fc0a28346d273aa251ce34c09687aa2a6a3075ec8d075"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:KHI4HMNGS2HRQ6TCET6LCDAXUY","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-23T03:14:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sxYzoEQtzS/pSs2HSm9kdxeWSzF1pQ/cR5cJY4Bjm/UNZZwqWm/+avERt+eWJrOS+sn01+zY8mLkV4okmEAGDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T09:21:31.203173Z"},"content_sha256":"de5368bd5cf7ec9d22e9117a0a73f23fa4f64316f77137dc033545822c5fbac2","schema_version":"1.0","event_id":"sha256:de5368bd5cf7ec9d22e9117a0a73f23fa4f64316f77137dc033545822c5fbac2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/bundle.json","state_url":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T09:21:31Z","links":{"resolver":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY","bundle":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/bundle.json","state":"https://pith.science/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KHI4HMNGS2HRQ6TCET6LCDAXUY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:KHI4HMNGS2HRQ6TCET6LCDAXUY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5c1f12cd37aca0aa4a5e090b4d4b5c4e4a5e6eb58043abc50e7d03d56224e107","cross_cats_sorted":["astro-ph.IM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-22T07:06:05Z","title_canon_sha256":"22e3fdfbfec9c099b13c72fdf88e29287ab996703ea73fd83f97ccb02e745636"},"schema_version":"1.0","source":{"id":"2606.22930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.22930","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"arxiv_version","alias_value":"2606.22930v1","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.22930","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_12","alias_value":"KHI4HMNGS2HR","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_16","alias_value":"KHI4HMNGS2HRQ6TC","created_at":"2026-06-23T03:14:04Z"},{"alias_kind":"pith_short_8","alias_value":"KHI4HMNG","created_at":"2026-06-23T03:14:04Z"}],"graph_snapshots":[{"event_id":"sha256:de5368bd5cf7ec9d22e9117a0a73f23fa4f64316f77137dc033545822c5fbac2","target":"graph","created_at":"2026-06-23T03:14:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.22930/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Johannes Buchner","cross_cats":["astro-ph.IM"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-22T07:06:05Z","title":"First analytical coverage bounds of a fully specified nested sampling algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.22930","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5b141036cf42a836f84fc0a28346d273aa251ce34c09687aa2a6a3075ec8d075","target":"record","created_at":"2026-06-23T03:14:04Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5c1f12cd37aca0aa4a5e090b4d4b5c4e4a5e6eb58043abc50e7d03d56224e107","cross_cats_sorted":["astro-ph.IM"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.CO","submitted_at":"2026-06-22T07:06:05Z","title_canon_sha256":"22e3fdfbfec9c099b13c72fdf88e29287ab996703ea73fd83f97ccb02e745636"},"schema_version":"1.0","source":{"id":"2606.22930","kind":"arxiv","version":1}},"canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51d1c3b1a6968f187a6224fcb10c17a6093f6cf7abbfae24e7287b2ca2dc87bf","first_computed_at":"2026-06-23T03:14:04.541672Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-23T03:14:04.541672Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BDEu3RzvC2qMPAu7foQXchBO7Ca9vSd9c0kqhHH5BowbtmBPTcI3zb0SKXpKOhX6Sj4Q+kTsjUZo3a3M9NNrAw==","signature_status":"signed_v1","signed_at":"2026-06-23T03:14:04.542051Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.22930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5b141036cf42a836f84fc0a28346d273aa251ce34c09687aa2a6a3075ec8d075","sha256:de5368bd5cf7ec9d22e9117a0a73f23fa4f64316f77137dc033545822c5fbac2"],"state_sha256":"edf67c75740ee2d05c9c4d656714fa10586506d0e46f2f6e9393c5f0c3492934"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mQ5rByquKD2c7LK99rYtenmCbdAX3pKJScPkSdJmLggLkVEkY5XRKAND9CsxornsiecSpDEH1Ft17fuRIVm4Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T09:21:31.205406Z","bundle_sha256":"85566ed2d4a34a35db04eb0ee3cc86eed692ab3dde0f022a810f2e9fd6886369"}}