{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NXA4PQQPNZRLFUBKFZYNOAAFXS","short_pith_number":"pith:NXA4PQQP","canonical_record":{"source":{"id":"1302.4965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:06Z","cross_cats_sorted":[],"title_canon_sha256":"7c32011e6692c0621c7c78fc01e5265c9ae759f5622af9e340c3aa7cb2f9e145","abstract_canon_sha256":"fd75d161940b1e505d9dec464844fe62146325e40d76ef182eec7eabc2a225ca"},"schema_version":"1.0"},"canonical_sha256":"6dc1c7c20f6e62b2d02a2e70d70005bcb2b63f9206d4185cbda97dc05e9f33b0","source":{"kind":"arxiv","id":"1302.4965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4965","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4965v1","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4965","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"NXA4PQQPNZRL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXA4PQQPNZRLFUBK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXA4PQQP","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NXA4PQQPNZRLFUBKFZYNOAAFXS","target":"record","payload":{"canonical_record":{"source":{"id":"1302.4965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:06Z","cross_cats_sorted":[],"title_canon_sha256":"7c32011e6692c0621c7c78fc01e5265c9ae759f5622af9e340c3aa7cb2f9e145","abstract_canon_sha256":"fd75d161940b1e505d9dec464844fe62146325e40d76ef182eec7eabc2a225ca"},"schema_version":"1.0"},"canonical_sha256":"6dc1c7c20f6e62b2d02a2e70d70005bcb2b63f9206d4185cbda97dc05e9f33b0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:52.199742Z","signature_b64":"BVrN4AILg3/rHifLtlzOhAUu436uZF87IkT1WERX7nnoPzMIF99f8x0WNRpIL2RN3CXaRbE6/R/8A0LTzdL3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc1c7c20f6e62b2d02a2e70d70005bcb2b63f9206d4185cbda97dc05e9f33b0","last_reissued_at":"2026-05-18T00:56:52.199273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:52.199273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.4965","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:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"r2S8v0a10zviDKfMHyKeRTzFKngvcnjHF9/LJ6TXHNKQeHCTmR4qLwBWMG5NfkczcjE23ZK7tLe8RuHVhJOxCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:10.817281Z"},"content_sha256":"f2de519efeecc743e6d8f5c10e55bab7670c3f46eba44088da9d9480501053ec","schema_version":"1.0","event_id":"sha256:f2de519efeecc743e6d8f5c10e55bab7670c3f46eba44088da9d9480501053ec"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NXA4PQQPNZRLFUBKFZYNOAAFXS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stochastic Simulation Algorithms for Dynamic Probabilistic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Daphne Koller, Keiji Kanazawa, Stuart Russell","submitted_at":"2013-02-20T15:22:06Z","abstract_excerpt":"Stochastic simulation algorithms such as likelihood weighting often give fast, accurate approximations to posterior probabilities in probabilistic networks, and are the methods of choice for very large networks.  Unfortunately, the special characteristics of dynamic probabilistic networks (DPNs), which are used to represent stochastic temporal processes, mean that standard simulation algorithms perform very poorly.  In essence, the simulation trials diverge further and further from reality as the process is observed over time.  In this paper, we present simulation algorithms that use the evide"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4965","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:56:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2XT3jOmNJ1AsbqlYtQlAe3hOFYaMazHmeeE05udtUUzQJKmGpPhQWX24vTHOoys8O8YzDYbShwTPCGV+35MSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T11:13:10.817996Z"},"content_sha256":"b9bea2d58624d19ac7c4f38d2f9b2e75f4a1d6e69abc4d00a4519b25f79a640e","schema_version":"1.0","event_id":"sha256:b9bea2d58624d19ac7c4f38d2f9b2e75f4a1d6e69abc4d00a4519b25f79a640e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/bundle.json","state_url":"https://pith.science/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/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-06T11:13:10Z","links":{"resolver":"https://pith.science/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS","bundle":"https://pith.science/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/bundle.json","state":"https://pith.science/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXA4PQQPNZRLFUBKFZYNOAAFXS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NXA4PQQPNZRLFUBKFZYNOAAFXS","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":"fd75d161940b1e505d9dec464844fe62146325e40d76ef182eec7eabc2a225ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:06Z","title_canon_sha256":"7c32011e6692c0621c7c78fc01e5265c9ae759f5622af9e340c3aa7cb2f9e145"},"schema_version":"1.0","source":{"id":"1302.4965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.4965","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"arxiv_version","alias_value":"1302.4965v1","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.4965","created_at":"2026-05-18T00:56:52Z"},{"alias_kind":"pith_short_12","alias_value":"NXA4PQQPNZRL","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NXA4PQQPNZRLFUBK","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NXA4PQQP","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:b9bea2d58624d19ac7c4f38d2f9b2e75f4a1d6e69abc4d00a4519b25f79a640e","target":"graph","created_at":"2026-05-18T00:56:52Z","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":"Stochastic simulation algorithms such as likelihood weighting often give fast, accurate approximations to posterior probabilities in probabilistic networks, and are the methods of choice for very large networks.  Unfortunately, the special characteristics of dynamic probabilistic networks (DPNs), which are used to represent stochastic temporal processes, mean that standard simulation algorithms perform very poorly.  In essence, the simulation trials diverge further and further from reality as the process is observed over time.  In this paper, we present simulation algorithms that use the evide","authors_text":"Daphne Koller, Keiji Kanazawa, Stuart Russell","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:06Z","title":"Stochastic Simulation Algorithms for Dynamic Probabilistic Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.4965","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:f2de519efeecc743e6d8f5c10e55bab7670c3f46eba44088da9d9480501053ec","target":"record","created_at":"2026-05-18T00:56:52Z","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":"fd75d161940b1e505d9dec464844fe62146325e40d76ef182eec7eabc2a225ca","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-02-20T15:22:06Z","title_canon_sha256":"7c32011e6692c0621c7c78fc01e5265c9ae759f5622af9e340c3aa7cb2f9e145"},"schema_version":"1.0","source":{"id":"1302.4965","kind":"arxiv","version":1}},"canonical_sha256":"6dc1c7c20f6e62b2d02a2e70d70005bcb2b63f9206d4185cbda97dc05e9f33b0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dc1c7c20f6e62b2d02a2e70d70005bcb2b63f9206d4185cbda97dc05e9f33b0","first_computed_at":"2026-05-18T00:56:52.199273Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:56:52.199273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BVrN4AILg3/rHifLtlzOhAUu436uZF87IkT1WERX7nnoPzMIF99f8x0WNRpIL2RN3CXaRbE6/R/8A0LTzdL3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:56:52.199742Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.4965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f2de519efeecc743e6d8f5c10e55bab7670c3f46eba44088da9d9480501053ec","sha256:b9bea2d58624d19ac7c4f38d2f9b2e75f4a1d6e69abc4d00a4519b25f79a640e"],"state_sha256":"cccc05ac59f889cd92f94ba9c194459d156166221f08e08ef2d6236d5e1ab3f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XpvuTdS5VoRasNNAmruojjrlP02GnOqcZ29UuKJYHTmSqsxKHWJYyRo/ShK3/U1bqJ0QUwWCKyQ9T+XCjQrhCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T11:13:10.822211Z","bundle_sha256":"3df7fe6926f08b0dbd68ae2e9e009943a2eafec6dafbaa04f0094c6222bd23a5"}}