{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UZVWLL6KEK5FAX3HPOUVUBJ7VR","short_pith_number":"pith:UZVWLL6K","schema_version":"1.0","canonical_sha256":"a66b65afca22ba505f677ba95a053fac7aa14cdd6f53098c75eb961d02af0b61","source":{"kind":"arxiv","id":"1903.04797","version":3},"attestation_state":"computed","paper":{"title":"Elements of Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","submitted_at":"2019-03-12T09:28:05Z","abstract_excerpt":"A core problem in statistics and probabilistic machine learning is to compute probability distributions and expectations. This is the fundamental problem of Bayesian statistics and machine learning, which frames all inference as expectations with respect to the posterior distribution. The key challenge is to approximate these intractable expectations. In this tutorial, we review sequential Monte Carlo (SMC), a random-sampling-based class of methods for approximate inference. First, we explain the basics of SMC, discuss practical issues, and review theoretical results. We then examine two of th"},"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.04797","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2019-03-12T09:28:05Z","cross_cats_sorted":["cs.LG","stat.CO"],"title_canon_sha256":"247ce20970ffcf5e33e6e0de6555b1528ab433ec6edf6b125f050ce318bbcfd9","abstract_canon_sha256":"009d34da4c4592bdb390f2c1110f37842433b1dde23a7561154150f768db15a0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:44:46.912428Z","signature_b64":"itagH9d+POmrguHZrcMZJzk4ujNQBsQr/wf8kP1EeelAkiJlYz4s6RwS2DwLNwSp6cbYLDiYIPJtmEkIAKDsBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a66b65afca22ba505f677ba95a053fac7aa14cdd6f53098c75eb961d02af0b61","last_reissued_at":"2026-07-05T09:44:46.911935Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:44:46.911935Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Elements of Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.CO"],"primary_cat":"stat.ML","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","submitted_at":"2019-03-12T09:28:05Z","abstract_excerpt":"A core problem in statistics and probabilistic machine learning is to compute probability distributions and expectations. This is the fundamental problem of Bayesian statistics and machine learning, which frames all inference as expectations with respect to the posterior distribution. The key challenge is to approximate these intractable expectations. In this tutorial, we review sequential Monte Carlo (SMC), a random-sampling-based class of methods for approximate inference. First, we explain the basics of SMC, discuss practical issues, and review theoretical results. We then examine two of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.04797","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/1903.04797/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":"1903.04797","created_at":"2026-07-05T09:44:46.911992+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.04797v3","created_at":"2026-07-05T09:44:46.911992+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.04797","created_at":"2026-07-05T09:44:46.911992+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZVWLL6KEK5F","created_at":"2026-07-05T09:44:46.911992+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZVWLL6KEK5FAX3H","created_at":"2026-07-05T09:44:46.911992+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZVWLL6K","created_at":"2026-07-05T09:44:46.911992+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.18563","citing_title":"Readers make targeted regressions to plausible errors in reanalysis of \"noisy-channel garden-path\" sentences","ref_index":58,"is_internal_anchor":false},{"citing_arxiv_id":"2509.13220","citing_title":"Dynamic or Systematic? Bayesian model selection between dark energy and supernova biases","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2510.12916","citing_title":"Efficient Inference for Coupled Hidden Markov Models in Continuous Time and Discrete Space","ref_index":17,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR","json":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR.json","graph_json":"https://pith.science/api/pith-number/UZVWLL6KEK5FAX3HPOUVUBJ7VR/graph.json","events_json":"https://pith.science/api/pith-number/UZVWLL6KEK5FAX3HPOUVUBJ7VR/events.json","paper":"https://pith.science/paper/UZVWLL6K"},"agent_actions":{"view_html":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR","download_json":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR.json","view_paper":"https://pith.science/paper/UZVWLL6K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.04797&json=true","fetch_graph":"https://pith.science/api/pith-number/UZVWLL6KEK5FAX3HPOUVUBJ7VR/graph.json","fetch_events":"https://pith.science/api/pith-number/UZVWLL6KEK5FAX3HPOUVUBJ7VR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR/action/storage_attestation","attest_author":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR/action/author_attestation","sign_citation":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR/action/citation_signature","submit_replication":"https://pith.science/pith/UZVWLL6KEK5FAX3HPOUVUBJ7VR/action/replication_record"}},"created_at":"2026-07-05T09:44:46.911992+00:00","updated_at":"2026-07-05T09:44:46.911992+00:00"}