{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:RR7R6WSDLQHA3H5GBRGG6MRBEB","short_pith_number":"pith:RR7R6WSD","schema_version":"1.0","canonical_sha256":"8c7f1f5a435c0e0d9fa60c4c6f3221204a470f7a758b442b6cf669b3b10c7780","source":{"kind":"arxiv","id":"1708.08396","version":3},"attestation_state":"computed","paper":{"title":"Controlled Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Adrian N. Bishop, Arnaud Doucet, George Deligiannidis, Jeremy Heng","submitted_at":"2017-08-28T16:07:15Z","abstract_excerpt":"Sequential Monte Carlo methods, also known as particle methods, are a popular set of techniques for approximating high-dimensional probability distributions and their normalizing constants. These methods have found numerous applications in statistics and related fields; e.g. for inference in non-linear non-Gaussian state space models, and in complex static models. Like many Monte Carlo sampling schemes, they rely on proposal distributions which crucially impact their performance. We introduce here a class of controlled sequential Monte Carlo algorithms, where the proposal distributions are det"},"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":"1708.08396","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2017-08-28T16:07:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c080b9304dc1a0644e977cd1f60c5f2055f17239f59572fbd565c0a62e46bc9","abstract_canon_sha256":"ea186bad607441a62be2bd8bec6765349b520e91dedef120190ebb7b90fdfacb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:51:04.412257Z","signature_b64":"ZvgpVZ8+COKPm43iCT8XwG1UY4tWFAo42TdFMgwonvtK6sHzKfhP7cRx0vmCYQk/wREa/WWnebdUm63SeoAECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c7f1f5a435c0e0d9fa60c4c6f3221204a470f7a758b442b6cf669b3b10c7780","last_reissued_at":"2026-07-05T02:51:04.411830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:51:04.411830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Controlled Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Adrian N. Bishop, Arnaud Doucet, George Deligiannidis, Jeremy Heng","submitted_at":"2017-08-28T16:07:15Z","abstract_excerpt":"Sequential Monte Carlo methods, also known as particle methods, are a popular set of techniques for approximating high-dimensional probability distributions and their normalizing constants. These methods have found numerous applications in statistics and related fields; e.g. for inference in non-linear non-Gaussian state space models, and in complex static models. Like many Monte Carlo sampling schemes, they rely on proposal distributions which crucially impact their performance. We introduce here a class of controlled sequential Monte Carlo algorithms, where the proposal distributions are det"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08396","kind":"arxiv","version":3},"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/1708.08396/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":"1708.08396","created_at":"2026-07-05T02:51:04.411899+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08396v3","created_at":"2026-07-05T02:51:04.411899+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08396","created_at":"2026-07-05T02:51:04.411899+00:00"},{"alias_kind":"pith_short_12","alias_value":"RR7R6WSDLQHA","created_at":"2026-07-05T02:51:04.411899+00:00"},{"alias_kind":"pith_short_16","alias_value":"RR7R6WSDLQHA3H5G","created_at":"2026-07-05T02:51:04.411899+00:00"},{"alias_kind":"pith_short_8","alias_value":"RR7R6WSD","created_at":"2026-07-05T02:51:04.411899+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/RR7R6WSDLQHA3H5GBRGG6MRBEB","json":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB.json","graph_json":"https://pith.science/api/pith-number/RR7R6WSDLQHA3H5GBRGG6MRBEB/graph.json","events_json":"https://pith.science/api/pith-number/RR7R6WSDLQHA3H5GBRGG6MRBEB/events.json","paper":"https://pith.science/paper/RR7R6WSD"},"agent_actions":{"view_html":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB","download_json":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB.json","view_paper":"https://pith.science/paper/RR7R6WSD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08396&json=true","fetch_graph":"https://pith.science/api/pith-number/RR7R6WSDLQHA3H5GBRGG6MRBEB/graph.json","fetch_events":"https://pith.science/api/pith-number/RR7R6WSDLQHA3H5GBRGG6MRBEB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB/action/storage_attestation","attest_author":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB/action/author_attestation","sign_citation":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB/action/citation_signature","submit_replication":"https://pith.science/pith/RR7R6WSDLQHA3H5GBRGG6MRBEB/action/replication_record"}},"created_at":"2026-07-05T02:51:04.411899+00:00","updated_at":"2026-07-05T02:51:04.411899+00:00"}