{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:4BHULVW64A7VXYC72CLMF24L2W","short_pith_number":"pith:4BHULVW6","schema_version":"1.0","canonical_sha256":"e04f45d6dee03f5be05fd096c2eb8bd5bd15df6023040b2977e1e201e216de2a","source":{"kind":"arxiv","id":"1903.12583","version":1},"attestation_state":"computed","paper":{"title":"Unifying Sequential Monte Carlo with Resampling Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert J. Webber","submitted_at":"2019-03-29T15:47:52Z","abstract_excerpt":"Sequential Monte Carlo (SMC) is a class of algorithms that approximate high-dimensional expectations of a Markov chain. SMC algorithms typically include a resampling step. There are many possible ways to resample, but the relative advantages of different resampling schemes remains poorly understood. Here, a theoretical framework for comparing resampling schemes is presented. The framework uses resampling matrices to provide a simple description for the SMC resampling step. The framework identifies the matrix resampling scheme that gives the lowest possible error. The framework leads to new asy"},"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":"1903.12583","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2019-03-29T15:47:52Z","cross_cats_sorted":[],"title_canon_sha256":"9b352933984fd17808fa1a40617bac7ff147ecc06dfc656c8e55ac44016b79d0","abstract_canon_sha256":"547c9c040f17f8b2ddbf47c05b4a9f0f2c2eeaf1e137c927c0d8b1367a21cc19"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:53.669583Z","signature_b64":"6hhlfcJcP5YQflirPLKA+wFiI2/Z6kyDcgs0m2fg3j2WbIk4B8HSE8aCmqwL1dhfWnNLv5F3Dqm8fCSvF+rlBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e04f45d6dee03f5be05fd096c2eb8bd5bd15df6023040b2977e1e201e216de2a","last_reissued_at":"2026-05-17T23:49:53.669196Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:53.669196Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Unifying Sequential Monte Carlo with Resampling Matrices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert J. Webber","submitted_at":"2019-03-29T15:47:52Z","abstract_excerpt":"Sequential Monte Carlo (SMC) is a class of algorithms that approximate high-dimensional expectations of a Markov chain. SMC algorithms typically include a resampling step. There are many possible ways to resample, but the relative advantages of different resampling schemes remains poorly understood. Here, a theoretical framework for comparing resampling schemes is presented. The framework uses resampling matrices to provide a simple description for the SMC resampling step. The framework identifies the matrix resampling scheme that gives the lowest possible error. The framework leads to new asy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.12583","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":""},"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":"1903.12583","created_at":"2026-05-17T23:49:53.669254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.12583v1","created_at":"2026-05-17T23:49:53.669254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.12583","created_at":"2026-05-17T23:49:53.669254+00:00"},{"alias_kind":"pith_short_12","alias_value":"4BHULVW64A7V","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"4BHULVW64A7VXYC7","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"4BHULVW6","created_at":"2026-05-18T12:33:10.108867+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/4BHULVW64A7VXYC72CLMF24L2W","json":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W.json","graph_json":"https://pith.science/api/pith-number/4BHULVW64A7VXYC72CLMF24L2W/graph.json","events_json":"https://pith.science/api/pith-number/4BHULVW64A7VXYC72CLMF24L2W/events.json","paper":"https://pith.science/paper/4BHULVW6"},"agent_actions":{"view_html":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W","download_json":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W.json","view_paper":"https://pith.science/paper/4BHULVW6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.12583&json=true","fetch_graph":"https://pith.science/api/pith-number/4BHULVW64A7VXYC72CLMF24L2W/graph.json","fetch_events":"https://pith.science/api/pith-number/4BHULVW64A7VXYC72CLMF24L2W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W/action/storage_attestation","attest_author":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W/action/author_attestation","sign_citation":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W/action/citation_signature","submit_replication":"https://pith.science/pith/4BHULVW64A7VXYC72CLMF24L2W/action/replication_record"}},"created_at":"2026-05-17T23:49:53.669254+00:00","updated_at":"2026-05-17T23:49:53.669254+00:00"}