{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:7QWS242X4XSSWWT6GXLEPPFUXT","short_pith_number":"pith:7QWS242X","schema_version":"1.0","canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","source":{"kind":"arxiv","id":"1412.7550","version":1},"attestation_state":"computed","paper":{"title":"Efficient particle-based online smoothing in general hidden Markov models: the PaRIS algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jimmy Olsson, Johan Westerborn","submitted_at":"2014-12-23T21:25:24Z","abstract_excerpt":"This paper presents a novel algorithm, the particle-based, rapid incremental smoother (PaRIS), for efficient online approximation of smoothed expectations of additive state functionals in general hidden Markov models. The algorithm, which has a linear computational complexity under weak assumptions and very limited memory requirements, is furnished with a number of convergence results, including a central limit theorem. An interesting feature of PaRIS, which samples on-the-fly from the retrospective dynamics induced by the particle filter, is that it requires two or more backward draws per par"},"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":"1412.7550","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-23T21:25:24Z","cross_cats_sorted":[],"title_canon_sha256":"be16d634e657cab04cb74e2f787aae1f355c2f7968768b1e5b512664c2b0547a","abstract_canon_sha256":"dcdf98480679eedf857dc79c978ab258989c380cb1af4d0263af41d7f7017537"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:33.529225Z","signature_b64":"Jz41RUgTtLkFW1QufbkxKT1ZfBY+bgDt5saThyZs71dLVn3zBjgYZjAjBVE8Rjg1DcW91grBKJcfU+0oaLqQCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","last_reissued_at":"2026-05-18T02:30:33.528734Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:33.528734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient particle-based online smoothing in general hidden Markov models: the PaRIS algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"stat.CO","authors_text":"Jimmy Olsson, Johan Westerborn","submitted_at":"2014-12-23T21:25:24Z","abstract_excerpt":"This paper presents a novel algorithm, the particle-based, rapid incremental smoother (PaRIS), for efficient online approximation of smoothed expectations of additive state functionals in general hidden Markov models. The algorithm, which has a linear computational complexity under weak assumptions and very limited memory requirements, is furnished with a number of convergence results, including a central limit theorem. An interesting feature of PaRIS, which samples on-the-fly from the retrospective dynamics induced by the particle filter, is that it requires two or more backward draws per par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7550","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":"1412.7550","created_at":"2026-05-18T02:30:33.528812+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.7550v1","created_at":"2026-05-18T02:30:33.528812+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7550","created_at":"2026-05-18T02:30:33.528812+00:00"},{"alias_kind":"pith_short_12","alias_value":"7QWS242X4XSS","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"7QWS242X4XSSWWT6","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"7QWS242X","created_at":"2026-05-18T12:28:19.803747+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/7QWS242X4XSSWWT6GXLEPPFUXT","json":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT.json","graph_json":"https://pith.science/api/pith-number/7QWS242X4XSSWWT6GXLEPPFUXT/graph.json","events_json":"https://pith.science/api/pith-number/7QWS242X4XSSWWT6GXLEPPFUXT/events.json","paper":"https://pith.science/paper/7QWS242X"},"agent_actions":{"view_html":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT","download_json":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT.json","view_paper":"https://pith.science/paper/7QWS242X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.7550&json=true","fetch_graph":"https://pith.science/api/pith-number/7QWS242X4XSSWWT6GXLEPPFUXT/graph.json","fetch_events":"https://pith.science/api/pith-number/7QWS242X4XSSWWT6GXLEPPFUXT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/action/storage_attestation","attest_author":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/action/author_attestation","sign_citation":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/action/citation_signature","submit_replication":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/action/replication_record"}},"created_at":"2026-05-18T02:30:33.528812+00:00","updated_at":"2026-05-18T02:30:33.528812+00:00"}