{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:6MRS27PX5XK6BF5V4NFHN4CAWR","short_pith_number":"pith:6MRS27PX","schema_version":"1.0","canonical_sha256":"f3232d7df7edd5e097b5e34a76f040b47a199bcb7b96e2ab72c418414c49cac3","source":{"kind":"arxiv","id":"1612.02161","version":2},"attestation_state":"computed","paper":{"title":"Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Marco F. Cusumano-Towner, Vikash K. Mansinghka","submitted_at":"2016-12-07T09:29:58Z","abstract_excerpt":"A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Metropolis-Hastings, produce output samples drawn from a distribution that may be far from the target posterior distribution. This paper shows how to upper-bound the symmetric KL divergence between the output distribution of a broad class of sequential Monte Carlo (SMC) samplers and their target posterior distributions, subject to assumptions about the accuracy of a separate gold"},"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":"1612.02161","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-12-07T09:29:58Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"39b60c6e9b51e19e942a2d126ed27f9b46c6e7c6d62e768e9dd2250a91e362a9","abstract_canon_sha256":"1af22ac25db429e50182a90e49a906029f28924c13b60b140e96ea85452ab76d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:57.588023Z","signature_b64":"n9G75rxWDacEbRzXw8vzdpDF6Y8FILvZHcylFN0q/uPGumNp0y/4Kn2b1EXCUYydVs0mtkM4bt2rIn7oH+xZBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f3232d7df7edd5e097b5e34a76f040b47a199bcb7b96e2ab72c418414c49cac3","last_reissued_at":"2026-05-18T00:44:57.587441Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:57.587441Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Measuring the non-asymptotic convergence of sequential Monte Carlo samplers using probabilistic programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Marco F. Cusumano-Towner, Vikash K. Mansinghka","submitted_at":"2016-12-07T09:29:58Z","abstract_excerpt":"A key limitation of sampling algorithms for approximate inference is that it is difficult to quantify their approximation error. Widely used sampling schemes, such as sequential importance sampling with resampling and Metropolis-Hastings, produce output samples drawn from a distribution that may be far from the target posterior distribution. This paper shows how to upper-bound the symmetric KL divergence between the output distribution of a broad class of sequential Monte Carlo (SMC) samplers and their target posterior distributions, subject to assumptions about the accuracy of a separate gold"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.02161","kind":"arxiv","version":2},"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":"1612.02161","created_at":"2026-05-18T00:44:57.587524+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.02161v2","created_at":"2026-05-18T00:44:57.587524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.02161","created_at":"2026-05-18T00:44:57.587524+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MRS27PX5XK6","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MRS27PX5XK6BF5V","created_at":"2026-05-18T12:30:01.593930+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MRS27PX","created_at":"2026-05-18T12:30:01.593930+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/6MRS27PX5XK6BF5V4NFHN4CAWR","json":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR.json","graph_json":"https://pith.science/api/pith-number/6MRS27PX5XK6BF5V4NFHN4CAWR/graph.json","events_json":"https://pith.science/api/pith-number/6MRS27PX5XK6BF5V4NFHN4CAWR/events.json","paper":"https://pith.science/paper/6MRS27PX"},"agent_actions":{"view_html":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR","download_json":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR.json","view_paper":"https://pith.science/paper/6MRS27PX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.02161&json=true","fetch_graph":"https://pith.science/api/pith-number/6MRS27PX5XK6BF5V4NFHN4CAWR/graph.json","fetch_events":"https://pith.science/api/pith-number/6MRS27PX5XK6BF5V4NFHN4CAWR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR/action/storage_attestation","attest_author":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR/action/author_attestation","sign_citation":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR/action/citation_signature","submit_replication":"https://pith.science/pith/6MRS27PX5XK6BF5V4NFHN4CAWR/action/replication_record"}},"created_at":"2026-05-18T00:44:57.587524+00:00","updated_at":"2026-05-18T00:44:57.587524+00:00"}