{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YB4XZYEVYNDMF5IXUHTUJ43KFS","short_pith_number":"pith:YB4XZYEV","canonical_record":{"source":{"id":"1502.02536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-02-09T16:15:31Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"39431b289ec86b748cecd80313ada019eebf86369b6795c3071269b8ef354c9c","abstract_canon_sha256":"26985a3d280c8c7d5a9e465317e4e11080bde74622f717de9e24f5df4105948b"},"schema_version":"1.0"},"canonical_sha256":"c0797ce095c346c2f517a1e744f36a2c9e342ca23d398713c7e1cdb229288b90","source":{"kind":"arxiv","id":"1502.02536","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02536","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02536v3","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02536","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"YB4XZYEVYNDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YB4XZYEVYNDMF5IX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YB4XZYEV","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YB4XZYEVYNDMF5IXUHTUJ43KFS","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02536","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-02-09T16:15:31Z","cross_cats_sorted":["stat.ME","stat.ML"],"title_canon_sha256":"39431b289ec86b748cecd80313ada019eebf86369b6795c3071269b8ef354c9c","abstract_canon_sha256":"26985a3d280c8c7d5a9e465317e4e11080bde74622f717de9e24f5df4105948b"},"schema_version":"1.0"},"canonical_sha256":"c0797ce095c346c2f517a1e744f36a2c9e342ca23d398713c7e1cdb229288b90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:33:24.183866Z","signature_b64":"co1WdP9eNiT1KD8q7HAynSeXGbeRYi0BJ2PEjWDnqpLj97tGuV9mNxHZFHLYemrhaw7SEWQIFIqGmM4zFxlnAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0797ce095c346c2f517a1e744f36a2c9e342ca23d398713c7e1cdb229288b90","last_reissued_at":"2026-05-18T01:33:24.183249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:33:24.183249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02536","source_version":3,"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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/VZ6oiko7AxxyIttjaM4FQnyhDuZXMEjpl3CX2n1lbNv7/oC0LV7Yl0YzJW9Wpvs/4XRKlxYTlTlVN8DSZpACA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:43.961892Z"},"content_sha256":"9bf1185604b3ffa7bc431861e6e95bb7a8e99ce7c53ee32e21e45bd65d3a3a29","schema_version":"1.0","event_id":"sha256:9bf1185604b3ffa7bc431861e6e95bb7a8e99ce7c53ee32e21e45bd65d3a3a29"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YB4XZYEVYNDMF5IXUHTUJ43KFS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nested Sequential Monte Carlo Methods","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML"],"primary_cat":"stat.CO","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","submitted_at":"2015-02-09T16:15:31Z","abstract_excerpt":"We propose nested sequential Monte Carlo (NSMC), a methodology to sample from sequences of probability distributions, even where the random variables are high-dimensional. NSMC generalises the SMC framework by requiring only approximate, properly weighted, samples from the SMC proposal distribution, while still resulting in a correct SMC algorithm. Furthermore, NSMC can in itself be used to produce such properly weighted samples. Consequently, one NSMC sampler can be used to construct an efficient high-dimensional proposal distribution for another NSMC sampler, and this nesting of the algorith"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02536","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":""},"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:33:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"deb6y3ToRVpxCH4knhH8P/lvyr51ZaF1zvtJkJ1qLg2Mc9YiFa3QMZjL+HXhE8dIa4/v/6rRlgjtV65x4FVYAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T02:57:43.962489Z"},"content_sha256":"5503d40cf8be4243d31ddbf64f6458b2781e49b2ac91a6cdaa4e62bc2bf3f0f0","schema_version":"1.0","event_id":"sha256:5503d40cf8be4243d31ddbf64f6458b2781e49b2ac91a6cdaa4e62bc2bf3f0f0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/bundle.json","state_url":"https://pith.science/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/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-11T02:57:43Z","links":{"resolver":"https://pith.science/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS","bundle":"https://pith.science/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/bundle.json","state":"https://pith.science/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YB4XZYEVYNDMF5IXUHTUJ43KFS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YB4XZYEVYNDMF5IXUHTUJ43KFS","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":"26985a3d280c8c7d5a9e465317e4e11080bde74622f717de9e24f5df4105948b","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-02-09T16:15:31Z","title_canon_sha256":"39431b289ec86b748cecd80313ada019eebf86369b6795c3071269b8ef354c9c"},"schema_version":"1.0","source":{"id":"1502.02536","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02536","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02536v3","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02536","created_at":"2026-05-18T01:33:24Z"},{"alias_kind":"pith_short_12","alias_value":"YB4XZYEVYNDM","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YB4XZYEVYNDMF5IX","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YB4XZYEV","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:5503d40cf8be4243d31ddbf64f6458b2781e49b2ac91a6cdaa4e62bc2bf3f0f0","target":"graph","created_at":"2026-05-18T01:33:24Z","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":"We propose nested sequential Monte Carlo (NSMC), a methodology to sample from sequences of probability distributions, even where the random variables are high-dimensional. NSMC generalises the SMC framework by requiring only approximate, properly weighted, samples from the SMC proposal distribution, while still resulting in a correct SMC algorithm. Furthermore, NSMC can in itself be used to produce such properly weighted samples. Consequently, one NSMC sampler can be used to construct an efficient high-dimensional proposal distribution for another NSMC sampler, and this nesting of the algorith","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","cross_cats":["stat.ME","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-02-09T16:15:31Z","title":"Nested Sequential Monte Carlo Methods"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02536","kind":"arxiv","version":3},"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:9bf1185604b3ffa7bc431861e6e95bb7a8e99ce7c53ee32e21e45bd65d3a3a29","target":"record","created_at":"2026-05-18T01:33:24Z","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":"26985a3d280c8c7d5a9e465317e4e11080bde74622f717de9e24f5df4105948b","cross_cats_sorted":["stat.ME","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2015-02-09T16:15:31Z","title_canon_sha256":"39431b289ec86b748cecd80313ada019eebf86369b6795c3071269b8ef354c9c"},"schema_version":"1.0","source":{"id":"1502.02536","kind":"arxiv","version":3}},"canonical_sha256":"c0797ce095c346c2f517a1e744f36a2c9e342ca23d398713c7e1cdb229288b90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0797ce095c346c2f517a1e744f36a2c9e342ca23d398713c7e1cdb229288b90","first_computed_at":"2026-05-18T01:33:24.183249Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:33:24.183249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"co1WdP9eNiT1KD8q7HAynSeXGbeRYi0BJ2PEjWDnqpLj97tGuV9mNxHZFHLYemrhaw7SEWQIFIqGmM4zFxlnAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:33:24.183866Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02536","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bf1185604b3ffa7bc431861e6e95bb7a8e99ce7c53ee32e21e45bd65d3a3a29","sha256:5503d40cf8be4243d31ddbf64f6458b2781e49b2ac91a6cdaa4e62bc2bf3f0f0"],"state_sha256":"b6e33efa0930cddad06feee928d51683d9e19153ee938764f1442ab8028af798"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PLLdfAjYUqqXdfTcAf/0nRzyp6Amnb8hNdVgrPi6TzAnkyeF4yCFjXrUzNTfoOwnIWO3y5jkarSSyNNgnv0zBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T02:57:43.966161Z","bundle_sha256":"5668302d5a4f01e460c0b262e12d9d3dfb1e3c99b5e60f8b278a04baa78ec7b6"}}