{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:576EXHOVP666C4SA7DUX7RBBI3","short_pith_number":"pith:576EXHOV","canonical_record":{"source":{"id":"1304.1526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"7e9df1481ff408aafd019ffa74a59561a23627908c4b78f373e77ebcc2dc78a5","abstract_canon_sha256":"b982202022c74f0d582a7765d00c3720f3311346d962a9508eb75c0b6777d907"},"schema_version":"1.0"},"canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","source":{"kind":"arxiv","id":"1304.1526","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1526","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1526v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1526","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"576EXHOVP666","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"576EXHOVP666C4SA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"576EXHOV","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:576EXHOVP666C4SA7DUX7RBBI3","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1526","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","cross_cats_sorted":[],"title_canon_sha256":"7e9df1481ff408aafd019ffa74a59561a23627908c4b78f373e77ebcc2dc78a5","abstract_canon_sha256":"b982202022c74f0d582a7765d00c3720f3311346d962a9508eb75c0b6777d907"},"schema_version":"1.0"},"canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:55.505487Z","signature_b64":"2S++f7kuxM0pt3AlHdxyqgyg6U5aTcFfT5rvrwrPVmDMM5ugNn0P1SMode0GHKll2FXD5Hj7txMQjbDYYcYXAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","last_reissued_at":"2026-05-18T03:28:55.505025Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:55.505025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1526","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-18T03:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RbdYfVtOW66+q1pNjLKw2NnsNqjnnXnwdm2piuIL++dy4kuMRm1Oh1CIJjxI9uSlZ+aL6L2G34bB9OKlWF6fCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:22.250803Z"},"content_sha256":"f125eaa6e79ceee434a29512d93fcdc023fd69d8365cc6a17da752fb9956d31e","schema_version":"1.0","event_id":"sha256:f125eaa6e79ceee434a29512d93fcdc023fd69d8365cc6a17da752fb9956d31e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:576EXHOVP666C4SA7DUX7RBBI3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulation Approaches to General Probabilistic Inference on Belief Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Mark Alan Peot, Ross D. Shachter","submitted_at":"2013-03-27T19:40:16Z","abstract_excerpt":"A number of algorithms have been developed to solve probabilistic inference problems on belief networks.  These algorithms can be divided into two main groups: exact techniques which exploit the conditional independence revealed when the graph structure is relatively sparse, and probabilistic sampling techniques which exploit the \"conductance\" of an embedded Markov chain when the conditional probabilities have non-extreme values.  In this paper, we investigate a family of \"forward\" Monte Carlo sampling techniques similar to Logic Sampling [Henrion, 1988] which appear to perform well even in so"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1526","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-18T03:28:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nLCZfnBxw04A9TYaQarA25AYsvpSwM+L7vVm6ie92LftwV7kksFyEmZsmZ8Hh/zLvV1/JQB5miRc8tl0IN4eDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T05:03:22.251146Z"},"content_sha256":"06d172a847c4d0dd922246c5494e97346ed229243595df889547171aaa96c405","schema_version":"1.0","event_id":"sha256:06d172a847c4d0dd922246c5494e97346ed229243595df889547171aaa96c405"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/bundle.json","state_url":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/576EXHOVP666C4SA7DUX7RBBI3/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-02T05:03:22Z","links":{"resolver":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3","bundle":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/bundle.json","state":"https://pith.science/pith/576EXHOVP666C4SA7DUX7RBBI3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/576EXHOVP666C4SA7DUX7RBBI3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:576EXHOVP666C4SA7DUX7RBBI3","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":"b982202022c74f0d582a7765d00c3720f3311346d962a9508eb75c0b6777d907","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","title_canon_sha256":"7e9df1481ff408aafd019ffa74a59561a23627908c4b78f373e77ebcc2dc78a5"},"schema_version":"1.0","source":{"id":"1304.1526","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1526","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1526v1","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1526","created_at":"2026-05-18T03:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"576EXHOVP666","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"576EXHOVP666C4SA","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"576EXHOV","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:06d172a847c4d0dd922246c5494e97346ed229243595df889547171aaa96c405","target":"graph","created_at":"2026-05-18T03:28:55Z","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":"A number of algorithms have been developed to solve probabilistic inference problems on belief networks.  These algorithms can be divided into two main groups: exact techniques which exploit the conditional independence revealed when the graph structure is relatively sparse, and probabilistic sampling techniques which exploit the \"conductance\" of an embedded Markov chain when the conditional probabilities have non-extreme values.  In this paper, we investigate a family of \"forward\" Monte Carlo sampling techniques similar to Logic Sampling [Henrion, 1988] which appear to perform well even in so","authors_text":"Mark Alan Peot, Ross D. Shachter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","title":"Simulation Approaches to General Probabilistic Inference on Belief Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1526","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:f125eaa6e79ceee434a29512d93fcdc023fd69d8365cc6a17da752fb9956d31e","target":"record","created_at":"2026-05-18T03:28:55Z","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":"b982202022c74f0d582a7765d00c3720f3311346d962a9508eb75c0b6777d907","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-27T19:40:16Z","title_canon_sha256":"7e9df1481ff408aafd019ffa74a59561a23627908c4b78f373e77ebcc2dc78a5"},"schema_version":"1.0","source":{"id":"1304.1526","kind":"arxiv","version":1}},"canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"effc4b9dd57fbde17240f8e97fc42146d26bdb037c2aabb1ced898ecbf638242","first_computed_at":"2026-05-18T03:28:55.505025Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:55.505025Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2S++f7kuxM0pt3AlHdxyqgyg6U5aTcFfT5rvrwrPVmDMM5ugNn0P1SMode0GHKll2FXD5Hj7txMQjbDYYcYXAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:55.505487Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1526","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f125eaa6e79ceee434a29512d93fcdc023fd69d8365cc6a17da752fb9956d31e","sha256:06d172a847c4d0dd922246c5494e97346ed229243595df889547171aaa96c405"],"state_sha256":"5fa3735416fe01d4ced8981a3231e5492b3695fedb5cfede4a72cb93b72c5171"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PTn6jm+kn1gXXhVRhuwVmK7S4KGOe61f8QkjjJSNpvYGMpbhiGrg4zbDv2a+CSLlrZv+3GL9DCcY9mNeD2w3Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T05:03:22.253162Z","bundle_sha256":"e019cd2fe4c9851636b143f6dba6bb54a87088d7adbd298165ceadba9db9a44a"}}