{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RNVQVPQJDXLPNRCTPQALH4VZVW","short_pith_number":"pith:RNVQVPQJ","schema_version":"1.0","canonical_sha256":"8b6b0abe091dd6f6c4537c00b3f2b9ad92429711069d5b11e58148a355564668","source":{"kind":"arxiv","id":"2606.07981","version":1},"attestation_state":"computed","paper":{"title":"Making Recursive Bayesian Inference Robust","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel W\\\"urzler Barreto, Mevin B. Hooten, Myungsoo Yoo","submitted_at":"2026-06-06T05:12:21Z","abstract_excerpt":"While Bayesian inference has become increasingly popular with advances in computational resources, its algorithms can be computationally prohibitive and may not scale with large datasets. This has led to growing interest in alternative algorithms, such as approximation methods and variants of Markov chain Monte Carlo. Among these approaches, prior proposal-recursive Bayesian (PP-RB) inference facilitates scalable Bayesian computation by recursively updating the posterior distribution across stages and utilizing parallel computing resources. While the well-known ``degeneracy'' issue in PP-RB ha"},"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.07981","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"stat.ME","submitted_at":"2026-06-06T05:12:21Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"0720223e87d204017b2a7d41d76db62e69cff33b0ea5ff3f0675b874cb672404","abstract_canon_sha256":"95bcca561351894ff39aa1fc9a11c0dccf28083306e918451c65c98789e586ef"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-09T01:04:57.103549Z","signature_b64":"bPDkgVcuKZ+CmZbXnTQrXg0kjdbGRBv2sAW+GvS5hOAwqgH0R6ExXdcRq0a1TTKhxAyD9bzKzZfaal57xhv+Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8b6b0abe091dd6f6c4537c00b3f2b9ad92429711069d5b11e58148a355564668","last_reissued_at":"2026-06-09T01:04:57.103149Z","signature_status":"signed_v1","first_computed_at":"2026-06-09T01:04:57.103149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Making Recursive Bayesian Inference Robust","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel W\\\"urzler Barreto, Mevin B. Hooten, Myungsoo Yoo","submitted_at":"2026-06-06T05:12:21Z","abstract_excerpt":"While Bayesian inference has become increasingly popular with advances in computational resources, its algorithms can be computationally prohibitive and may not scale with large datasets. This has led to growing interest in alternative algorithms, such as approximation methods and variants of Markov chain Monte Carlo. Among these approaches, prior proposal-recursive Bayesian (PP-RB) inference facilitates scalable Bayesian computation by recursively updating the posterior distribution across stages and utilizing parallel computing resources. While the well-known ``degeneracy'' issue in PP-RB ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.07981","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.07981/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.07981","created_at":"2026-06-09T01:04:57.103204+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.07981v1","created_at":"2026-06-09T01:04:57.103204+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.07981","created_at":"2026-06-09T01:04:57.103204+00:00"},{"alias_kind":"pith_short_12","alias_value":"RNVQVPQJDXLP","created_at":"2026-06-09T01:04:57.103204+00:00"},{"alias_kind":"pith_short_16","alias_value":"RNVQVPQJDXLPNRCT","created_at":"2026-06-09T01:04:57.103204+00:00"},{"alias_kind":"pith_short_8","alias_value":"RNVQVPQJ","created_at":"2026-06-09T01:04:57.103204+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/RNVQVPQJDXLPNRCTPQALH4VZVW","json":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW.json","graph_json":"https://pith.science/api/pith-number/RNVQVPQJDXLPNRCTPQALH4VZVW/graph.json","events_json":"https://pith.science/api/pith-number/RNVQVPQJDXLPNRCTPQALH4VZVW/events.json","paper":"https://pith.science/paper/RNVQVPQJ"},"agent_actions":{"view_html":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW","download_json":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW.json","view_paper":"https://pith.science/paper/RNVQVPQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.07981&json=true","fetch_graph":"https://pith.science/api/pith-number/RNVQVPQJDXLPNRCTPQALH4VZVW/graph.json","fetch_events":"https://pith.science/api/pith-number/RNVQVPQJDXLPNRCTPQALH4VZVW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW/action/storage_attestation","attest_author":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW/action/author_attestation","sign_citation":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW/action/citation_signature","submit_replication":"https://pith.science/pith/RNVQVPQJDXLPNRCTPQALH4VZVW/action/replication_record"}},"created_at":"2026-06-09T01:04:57.103204+00:00","updated_at":"2026-06-09T01:04:57.103204+00:00"}