{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:IDUKBLSDIBKJ6XZW4YSCDHENHA","short_pith_number":"pith:IDUKBLSD","canonical_record":{"source":{"id":"1612.09162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-29T14:58:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6a6cb2e4f5c82aa3255bcbcb8f36ee33b8f569a317fbe7588586d30231aced2c","abstract_canon_sha256":"f06b86d708e6261724eca79bb8c4b3f4184da8faacd7bf8c8d6e4df5d1497330"},"schema_version":"1.0"},"canonical_sha256":"40e8a0ae4340549f5f36e624219c8d38171c31414fcc2dcba77f30dd13f19e4c","source":{"kind":"arxiv","id":"1612.09162","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09162","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09162v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09162","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"IDUKBLSDIBKJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDUKBLSDIBKJ6XZW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDUKBLSD","created_at":"2026-05-18T12:30:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:IDUKBLSDIBKJ6XZW4YSCDHENHA","target":"record","payload":{"canonical_record":{"source":{"id":"1612.09162","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-29T14:58:55Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"6a6cb2e4f5c82aa3255bcbcb8f36ee33b8f569a317fbe7588586d30231aced2c","abstract_canon_sha256":"f06b86d708e6261724eca79bb8c4b3f4184da8faacd7bf8c8d6e4df5d1497330"},"schema_version":"1.0"},"canonical_sha256":"40e8a0ae4340549f5f36e624219c8d38171c31414fcc2dcba77f30dd13f19e4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:46.337186Z","signature_b64":"g3OYpmxmVEVhC7cOdmzlXFXzlEPiKd/0AySwrF6654dTaxiTO/EcDi9KIYgTXqfW3DS4OjLXqIk0YW2C9xeXDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40e8a0ae4340549f5f36e624219c8d38171c31414fcc2dcba77f30dd13f19e4c","last_reissued_at":"2026-05-18T00:53:46.336636Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:46.336636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1612.09162","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RF9mTTgnuHXDalIOKCWLXK5m2dACqwC7EWj0rx9umv+Ur/9a0oNx1FqkFAUsOmgZfXeFaYUyjKRjzwYzdcGxDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:43:34.084521Z"},"content_sha256":"c11fee589030ad9c74686df940638c793038ab73a827043644e4f91dae6df6b9","schema_version":"1.0","event_id":"sha256:c11fee589030ad9c74686df940638c793038ab73a827043644e4f91dae6df6b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:IDUKBLSDIBKJ6XZW4YSCDHENHA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"High-dimensional Filtering using Nested Sequential Monte Carlo","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"stat.CO","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","submitted_at":"2016-12-29T14:58:55Z","abstract_excerpt":"Sequential Monte Carlo (SMC) methods comprise one of the most successful approaches to approximate Bayesian filtering. However, SMC without good proposal distributions struggle in high dimensions. We propose nested sequential Monte Carlo (NSMC), a methodology that generalises the SMC framework by requiring only approximate, properly weighted, samples from the SMC proposal distribution, while still resulting in a correct SMC algorithm. This way we can exactly approximate the locally optimal proposal, and extend the class of models for which we can perform efficient inference using SMC. We show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09162","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-18T00:53:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SYEoc8QTT6+42DgOjQyLF40cc//PxXplrvBfozEP/zTrErmc452vWy9DMa0PuFv4wZWp1ryY49b1VMmCpUSRBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T01:43:34.084911Z"},"content_sha256":"2e37874679b75ff5604c6bc454b0024a08968b803e18f7f9156d476ec124a9bb","schema_version":"1.0","event_id":"sha256:2e37874679b75ff5604c6bc454b0024a08968b803e18f7f9156d476ec124a9bb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/bundle.json","state_url":"https://pith.science/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/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-11T01:43:34Z","links":{"resolver":"https://pith.science/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA","bundle":"https://pith.science/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/bundle.json","state":"https://pith.science/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IDUKBLSDIBKJ6XZW4YSCDHENHA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:IDUKBLSDIBKJ6XZW4YSCDHENHA","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":"f06b86d708e6261724eca79bb8c4b3f4184da8faacd7bf8c8d6e4df5d1497330","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-29T14:58:55Z","title_canon_sha256":"6a6cb2e4f5c82aa3255bcbcb8f36ee33b8f569a317fbe7588586d30231aced2c"},"schema_version":"1.0","source":{"id":"1612.09162","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.09162","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"arxiv_version","alias_value":"1612.09162v1","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.09162","created_at":"2026-05-18T00:53:46Z"},{"alias_kind":"pith_short_12","alias_value":"IDUKBLSDIBKJ","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_16","alias_value":"IDUKBLSDIBKJ6XZW","created_at":"2026-05-18T12:30:22Z"},{"alias_kind":"pith_short_8","alias_value":"IDUKBLSD","created_at":"2026-05-18T12:30:22Z"}],"graph_snapshots":[{"event_id":"sha256:2e37874679b75ff5604c6bc454b0024a08968b803e18f7f9156d476ec124a9bb","target":"graph","created_at":"2026-05-18T00:53:46Z","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":"Sequential Monte Carlo (SMC) methods comprise one of the most successful approaches to approximate Bayesian filtering. However, SMC without good proposal distributions struggle in high dimensions. We propose nested sequential Monte Carlo (NSMC), a methodology that generalises the SMC framework by requiring only approximate, properly weighted, samples from the SMC proposal distribution, while still resulting in a correct SMC algorithm. This way we can exactly approximate the locally optimal proposal, and extend the class of models for which we can perform efficient inference using SMC. We show ","authors_text":"Christian A. Naesseth, Fredrik Lindsten, Thomas B. Sch\\\"on","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-29T14:58:55Z","title":"High-dimensional Filtering using Nested Sequential Monte Carlo"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.09162","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:c11fee589030ad9c74686df940638c793038ab73a827043644e4f91dae6df6b9","target":"record","created_at":"2026-05-18T00:53:46Z","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":"f06b86d708e6261724eca79bb8c4b3f4184da8faacd7bf8c8d6e4df5d1497330","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.CO","submitted_at":"2016-12-29T14:58:55Z","title_canon_sha256":"6a6cb2e4f5c82aa3255bcbcb8f36ee33b8f569a317fbe7588586d30231aced2c"},"schema_version":"1.0","source":{"id":"1612.09162","kind":"arxiv","version":1}},"canonical_sha256":"40e8a0ae4340549f5f36e624219c8d38171c31414fcc2dcba77f30dd13f19e4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40e8a0ae4340549f5f36e624219c8d38171c31414fcc2dcba77f30dd13f19e4c","first_computed_at":"2026-05-18T00:53:46.336636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:46.336636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"g3OYpmxmVEVhC7cOdmzlXFXzlEPiKd/0AySwrF6654dTaxiTO/EcDi9KIYgTXqfW3DS4OjLXqIk0YW2C9xeXDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:46.337186Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.09162","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c11fee589030ad9c74686df940638c793038ab73a827043644e4f91dae6df6b9","sha256:2e37874679b75ff5604c6bc454b0024a08968b803e18f7f9156d476ec124a9bb"],"state_sha256":"35878aeffad272faaca1acf04c93d4ac20cd9649ba748901c7d2c459bdb5d942"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r1btHsQMXcb3wzpyPmMyCB/jwfxhCVNA9HR/AUoYXfG6cb6zFAf2To+6MweXuETU/00qocFT78PVqRDghmk/CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T01:43:34.087893Z","bundle_sha256":"336f2836cf9e2e0f990d4014a2eaabef2c903019212a6a52b9bbe45874ed2dc4"}}