{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:6LQBJRBAHUTZS346TKCDKEYLH7","short_pith_number":"pith:6LQBJRBA","canonical_record":{"source":{"id":"1504.05715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-22T10:13:51Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"ab526b7a63e6d74faa125c7c5cc67f49611c0cf8e31d9e46ffa832b111955f9b","abstract_canon_sha256":"ad1522270272e56cd8c376ea7751c2ab3828fc06ed8790b364b787537f8d9b6c"},"schema_version":"1.0"},"canonical_sha256":"f2e014c4203d27996f9e9a8435130b3fd12cee02a372a97050bbbe31be24db8e","source":{"kind":"arxiv","id":"1504.05715","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05715","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05715v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05715","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"6LQBJRBAHUTZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6LQBJRBAHUTZS346","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6LQBJRBA","created_at":"2026-05-18T12:29:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:6LQBJRBAHUTZS346TKCDKEYLH7","target":"record","payload":{"canonical_record":{"source":{"id":"1504.05715","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-22T10:13:51Z","cross_cats_sorted":["stat.AP"],"title_canon_sha256":"ab526b7a63e6d74faa125c7c5cc67f49611c0cf8e31d9e46ffa832b111955f9b","abstract_canon_sha256":"ad1522270272e56cd8c376ea7751c2ab3828fc06ed8790b364b787537f8d9b6c"},"schema_version":"1.0"},"canonical_sha256":"f2e014c4203d27996f9e9a8435130b3fd12cee02a372a97050bbbe31be24db8e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:50.799336Z","signature_b64":"A4v4OpGp0+0RdZk+RbVtPH/FU1BKUqWda+FFWDVt9AMEoY1Vx4m2Ypl0YKFw2wkHoWlZcy6yHwXb0ROFZFo3Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2e014c4203d27996f9e9a8435130b3fd12cee02a372a97050bbbe31be24db8e","last_reissued_at":"2026-05-18T01:16:50.798553Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:50.798553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.05715","source_version":2,"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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Wj39YZZzzF6msxxhORJfso8/QixELzuUOHA4ifgCl01OrDLM8iJiP4QWaXUHb5Kditb2mAporeqvroXX2MVuDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:58:21.197399Z"},"content_sha256":"47b7e8314f0d5cd066002ff759133c69f9595bf4aea9bfb08ab4956ac8de1477","schema_version":"1.0","event_id":"sha256:47b7e8314f0d5cd066002ff759133c69f9595bf4aea9bfb08ab4956ac8de1477"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:6LQBJRBAHUTZS346TKCDKEYLH7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Langevin and Hamiltonian based Sequential MCMC for Efficient Bayesian Filtering in High-dimensional Spaces","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.AP"],"primary_cat":"stat.CO","authors_text":"Francois Septier, Gareth W. Peters","submitted_at":"2015-04-22T10:13:51Z","abstract_excerpt":"Nonlinear non-Gaussian state-space models arise in numerous applications in statistics and signal processing. In this context, one of the most successful and popular approximation techniques is the Sequential Monte Carlo (SMC) algorithm, also known as particle filtering. Nevertheless, this method tends to be inefficient when applied to high dimensional problems. In this paper, we focus on another class of sequential inference methods, namely the Sequential Markov Chain Monte Carlo (SMCMC) techniques, which represent a promising alternative to SMC methods. After providing a unifying framework f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05715","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"},"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-18T01:16:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jwNzl26W0BROCKYuHaeatnHm1G0gwgahkcAprtFnWNpXRqtBqEdR4GrNkPDJCnIXj7dloybrMfYEOmASHGKpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T00:58:21.198064Z"},"content_sha256":"34af86741a24abea5861fc00801e3b3a75b0b1eeea218e463615cfb77d596b0a","schema_version":"1.0","event_id":"sha256:34af86741a24abea5861fc00801e3b3a75b0b1eeea218e463615cfb77d596b0a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6LQBJRBAHUTZS346TKCDKEYLH7/bundle.json","state_url":"https://pith.science/pith/6LQBJRBAHUTZS346TKCDKEYLH7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6LQBJRBAHUTZS346TKCDKEYLH7/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-06-10T00:58:21Z","links":{"resolver":"https://pith.science/pith/6LQBJRBAHUTZS346TKCDKEYLH7","bundle":"https://pith.science/pith/6LQBJRBAHUTZS346TKCDKEYLH7/bundle.json","state":"https://pith.science/pith/6LQBJRBAHUTZS346TKCDKEYLH7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6LQBJRBAHUTZS346TKCDKEYLH7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:6LQBJRBAHUTZS346TKCDKEYLH7","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":"ad1522270272e56cd8c376ea7751c2ab3828fc06ed8790b364b787537f8d9b6c","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-22T10:13:51Z","title_canon_sha256":"ab526b7a63e6d74faa125c7c5cc67f49611c0cf8e31d9e46ffa832b111955f9b"},"schema_version":"1.0","source":{"id":"1504.05715","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.05715","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"arxiv_version","alias_value":"1504.05715v2","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.05715","created_at":"2026-05-18T01:16:50Z"},{"alias_kind":"pith_short_12","alias_value":"6LQBJRBAHUTZ","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_16","alias_value":"6LQBJRBAHUTZS346","created_at":"2026-05-18T12:29:07Z"},{"alias_kind":"pith_short_8","alias_value":"6LQBJRBA","created_at":"2026-05-18T12:29:07Z"}],"graph_snapshots":[{"event_id":"sha256:34af86741a24abea5861fc00801e3b3a75b0b1eeea218e463615cfb77d596b0a","target":"graph","created_at":"2026-05-18T01:16:50Z","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":"Nonlinear non-Gaussian state-space models arise in numerous applications in statistics and signal processing. In this context, one of the most successful and popular approximation techniques is the Sequential Monte Carlo (SMC) algorithm, also known as particle filtering. Nevertheless, this method tends to be inefficient when applied to high dimensional problems. In this paper, we focus on another class of sequential inference methods, namely the Sequential Markov Chain Monte Carlo (SMCMC) techniques, which represent a promising alternative to SMC methods. After providing a unifying framework f","authors_text":"Francois Septier, Gareth W. Peters","cross_cats":["stat.AP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-22T10:13:51Z","title":"Langevin and Hamiltonian based Sequential MCMC for Efficient Bayesian Filtering in High-dimensional Spaces"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.05715","kind":"arxiv","version":2},"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:47b7e8314f0d5cd066002ff759133c69f9595bf4aea9bfb08ab4956ac8de1477","target":"record","created_at":"2026-05-18T01:16:50Z","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":"ad1522270272e56cd8c376ea7751c2ab3828fc06ed8790b364b787537f8d9b6c","cross_cats_sorted":["stat.AP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-04-22T10:13:51Z","title_canon_sha256":"ab526b7a63e6d74faa125c7c5cc67f49611c0cf8e31d9e46ffa832b111955f9b"},"schema_version":"1.0","source":{"id":"1504.05715","kind":"arxiv","version":2}},"canonical_sha256":"f2e014c4203d27996f9e9a8435130b3fd12cee02a372a97050bbbe31be24db8e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2e014c4203d27996f9e9a8435130b3fd12cee02a372a97050bbbe31be24db8e","first_computed_at":"2026-05-18T01:16:50.798553Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:50.798553Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"A4v4OpGp0+0RdZk+RbVtPH/FU1BKUqWda+FFWDVt9AMEoY1Vx4m2Ypl0YKFw2wkHoWlZcy6yHwXb0ROFZFo3Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:50.799336Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.05715","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:47b7e8314f0d5cd066002ff759133c69f9595bf4aea9bfb08ab4956ac8de1477","sha256:34af86741a24abea5861fc00801e3b3a75b0b1eeea218e463615cfb77d596b0a"],"state_sha256":"c0790df5478889865a7449d07e59d415d426b7806d07938724e56433c769271e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/f4vTqKLStvvlsSZIEAMzIpMO448WPID0HwuITykUT15GhxUZOO01JfAVWSrbP5zOXXm8hVkRbBfN6an+PLUAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T00:58:21.203599Z","bundle_sha256":"053b7c490fbd05d9d908c24d8d9efc34336e40e44452d8b6ff3105e9d865959c"}}