{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:7QWS242X4XSSWWT6GXLEPPFUXT","short_pith_number":"pith:7QWS242X","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"},"canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","source":{"kind":"arxiv","id":"1412.7550","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7550","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7550v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7550","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"7QWS242X4XSS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7QWS242X4XSSWWT6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7QWS242X","created_at":"2026-05-18T12:28:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:7QWS242X4XSSWWT6GXLEPPFUXT","target":"record","payload":{"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"},"canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","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"},"source_kind":"arxiv","source_id":"1412.7550","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/F8WSj3xVF82XXkkTgGqb5rJIQEzM5IG1g2p2MmOrs7TivQtiE4pBmT2g53pK5gycn/X4WfGIwzf1NWohvRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:03:32.427000Z"},"content_sha256":"fc1ff4e7c3e24ba420fc5c4a2bf59540a0468ac17da4eac8612eab13aa3a71b7","schema_version":"1.0","event_id":"sha256:fc1ff4e7c3e24ba420fc5c4a2bf59540a0468ac17da4eac8612eab13aa3a71b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:7QWS242X4XSSWWT6GXLEPPFUXT","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tUuYgC25kSmcUqpUhcJyctVa5CiRpUp7iFY0IbTcSsy0xkcl1ewSz+V0JwQkEcAqDwwbXcSuG5RXWtSZ8JOvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T10:03:32.427624Z"},"content_sha256":"1ccfeead6063f7b745bab2cf0260c65bad4faa9985788b353ee346c9672fb485","schema_version":"1.0","event_id":"sha256:1ccfeead6063f7b745bab2cf0260c65bad4faa9985788b353ee346c9672fb485"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/bundle.json","state_url":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7QWS242X4XSSWWT6GXLEPPFUXT/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T10:03:32Z","links":{"resolver":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT","bundle":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/bundle.json","state":"https://pith.science/pith/7QWS242X4XSSWWT6GXLEPPFUXT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7QWS242X4XSSWWT6GXLEPPFUXT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:7QWS242X4XSSWWT6GXLEPPFUXT","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"dcdf98480679eedf857dc79c978ab258989c380cb1af4d0263af41d7f7017537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-23T21:25:24Z","title_canon_sha256":"be16d634e657cab04cb74e2f787aae1f355c2f7968768b1e5b512664c2b0547a"},"schema_version":"1.0","source":{"id":"1412.7550","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1412.7550","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1412.7550v1","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.7550","created_at":"2026-05-18T02:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"7QWS242X4XSS","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_16","alias_value":"7QWS242X4XSSWWT6","created_at":"2026-05-18T12:28:19Z"},{"alias_kind":"pith_short_8","alias_value":"7QWS242X","created_at":"2026-05-18T12:28:19Z"}],"graph_snapshots":[{"event_id":"sha256:1ccfeead6063f7b745bab2cf0260c65bad4faa9985788b353ee346c9672fb485","target":"graph","created_at":"2026-05-18T02:30:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Jimmy Olsson, Johan Westerborn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-23T21:25:24Z","title":"Efficient particle-based online smoothing in general hidden Markov models: the PaRIS algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.7550","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:fc1ff4e7c3e24ba420fc5c4a2bf59540a0468ac17da4eac8612eab13aa3a71b7","target":"record","created_at":"2026-05-18T02:30:33Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"dcdf98480679eedf857dc79c978ab258989c380cb1af4d0263af41d7f7017537","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2014-12-23T21:25:24Z","title_canon_sha256":"be16d634e657cab04cb74e2f787aae1f355c2f7968768b1e5b512664c2b0547a"},"schema_version":"1.0","source":{"id":"1412.7550","kind":"arxiv","version":1}},"canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc2d2d7357e5e52b5a7e35d647bcb4bcefe79fadfa3d9ec124705732c5deebe7","first_computed_at":"2026-05-18T02:30:33.528734Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:30:33.528734Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Jz41RUgTtLkFW1QufbkxKT1ZfBY+bgDt5saThyZs71dLVn3zBjgYZjAjBVE8Rjg1DcW91grBKJcfU+0oaLqQCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:30:33.529225Z","signed_message":"canonical_sha256_bytes"},"source_id":"1412.7550","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc1ff4e7c3e24ba420fc5c4a2bf59540a0468ac17da4eac8612eab13aa3a71b7","sha256:1ccfeead6063f7b745bab2cf0260c65bad4faa9985788b353ee346c9672fb485"],"state_sha256":"ca94b89a65a394fa03329f6a4cecfb703192ccbc9aa45da819f55377193dd1f4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n/aSVh7xarhq1Vra6X5BKD7ixdPoBou4Mtqfhd7Io4nzyj8+om1fHfMudea/HgOk9wePfUwtOFOq9Hdny9AyCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T10:03:32.432850Z","bundle_sha256":"e90120d87d1da4708c4b8a383ad2980d8b3d49db37b7979051ff69c244149baf"}}