{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:GERI4YRXVY37XYLHYNWOYRWXIJ","short_pith_number":"pith:GERI4YRX","schema_version":"1.0","canonical_sha256":"31228e6237ae37fbe167c36cec46d7425ed67391cfbf07e65d80558ee5913192","source":{"kind":"arxiv","id":"2509.08102","version":1},"attestation_state":"computed","paper":{"title":"Recursive Adaptive Importance Sampling with Optimal Replenishment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel W\\\"urzler Barreto, Mevin B. Hooten","submitted_at":"2025-09-09T19:25:31Z","abstract_excerpt":"Increased access to computing resources has led to the development of algorithms that can run efficiently on multi-core processing units or in distributed computing environments. In the context of Bayesian inference, many parallel computing approaches to fit statistical models have been proposed in the context of Markov Chain Monte Carlo methods, but they either have limited gains due to high latency cost or rely on model-specific decompositions. Alternatively, adaptive importance sampling, sequential Monte Carlo, and recursive Bayesian methods provide a parallel-friendly and asymptotically ex"},"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":"2509.08102","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ME","submitted_at":"2025-09-09T19:25:31Z","cross_cats_sorted":["stat.CO"],"title_canon_sha256":"037f5735168bc9db1da462600584cdee9d12c545edce1fd69687ecd65eef82b4","abstract_canon_sha256":"60e437b5a0709596f19c5c24907971a9465c0d20a73d84ce0abb2aa75ec956ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:08:22.405397Z","signature_b64":"ZHK+0+V6iY9ZM07BcKoiZ7g0bhvUzdx7iFWUJbmNhCiezBHlyBAEDaBbHuY/xXjGz3U9ILFpZQ7bhx+sV4AbBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"31228e6237ae37fbe167c36cec46d7425ed67391cfbf07e65d80558ee5913192","last_reissued_at":"2026-07-05T12:08:22.404899Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:08:22.404899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Recursive Adaptive Importance Sampling with Optimal Replenishment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.CO"],"primary_cat":"stat.ME","authors_text":"Daniel W\\\"urzler Barreto, Mevin B. Hooten","submitted_at":"2025-09-09T19:25:31Z","abstract_excerpt":"Increased access to computing resources has led to the development of algorithms that can run efficiently on multi-core processing units or in distributed computing environments. In the context of Bayesian inference, many parallel computing approaches to fit statistical models have been proposed in the context of Markov Chain Monte Carlo methods, but they either have limited gains due to high latency cost or rely on model-specific decompositions. Alternatively, adaptive importance sampling, sequential Monte Carlo, and recursive Bayesian methods provide a parallel-friendly and asymptotically ex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.08102","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/2509.08102/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":"2509.08102","created_at":"2026-07-05T12:08:22.404958+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.08102v1","created_at":"2026-07-05T12:08:22.404958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.08102","created_at":"2026-07-05T12:08:22.404958+00:00"},{"alias_kind":"pith_short_12","alias_value":"GERI4YRXVY37","created_at":"2026-07-05T12:08:22.404958+00:00"},{"alias_kind":"pith_short_16","alias_value":"GERI4YRXVY37XYLH","created_at":"2026-07-05T12:08:22.404958+00:00"},{"alias_kind":"pith_short_8","alias_value":"GERI4YRX","created_at":"2026-07-05T12:08:22.404958+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.07981","citing_title":"Making Recursive Bayesian Inference Robust","ref_index":2,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ","json":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ.json","graph_json":"https://pith.science/api/pith-number/GERI4YRXVY37XYLHYNWOYRWXIJ/graph.json","events_json":"https://pith.science/api/pith-number/GERI4YRXVY37XYLHYNWOYRWXIJ/events.json","paper":"https://pith.science/paper/GERI4YRX"},"agent_actions":{"view_html":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ","download_json":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ.json","view_paper":"https://pith.science/paper/GERI4YRX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.08102&json=true","fetch_graph":"https://pith.science/api/pith-number/GERI4YRXVY37XYLHYNWOYRWXIJ/graph.json","fetch_events":"https://pith.science/api/pith-number/GERI4YRXVY37XYLHYNWOYRWXIJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ/action/storage_attestation","attest_author":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ/action/author_attestation","sign_citation":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ/action/citation_signature","submit_replication":"https://pith.science/pith/GERI4YRXVY37XYLHYNWOYRWXIJ/action/replication_record"}},"created_at":"2026-07-05T12:08:22.404958+00:00","updated_at":"2026-07-05T12:08:22.404958+00:00"}