{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:3AVW25QWDIHASHMO66HNE66LE5","short_pith_number":"pith:3AVW25QW","canonical_record":{"source":{"id":"1301.2265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"d81028c11561b0d69a5a924647eea4b209f78d70b231d94298eed7a9c0745d7c","abstract_canon_sha256":"feec3ca6a1423199a82ef3ec8ef5c8ffcfc96232a43b73f222ce0d82f58d8a25"},"schema_version":"1.0"},"canonical_sha256":"d82b6d76161a0e091d8ef78ed27bcb275c7bab3f3c93a12f325ec93f570e94c0","source":{"kind":"arxiv","id":"1301.2265","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2265","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2265v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2265","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"3AVW25QWDIHA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3AVW25QWDIHASHMO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3AVW25QW","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:3AVW25QWDIHASHMO66HNE66LE5","target":"record","payload":{"canonical_record":{"source":{"id":"1301.2265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:13Z","cross_cats_sorted":[],"title_canon_sha256":"d81028c11561b0d69a5a924647eea4b209f78d70b231d94298eed7a9c0745d7c","abstract_canon_sha256":"feec3ca6a1423199a82ef3ec8ef5c8ffcfc96232a43b73f222ce0d82f58d8a25"},"schema_version":"1.0"},"canonical_sha256":"d82b6d76161a0e091d8ef78ed27bcb275c7bab3f3c93a12f325ec93f570e94c0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:45.765082Z","signature_b64":"ODfwAJIyaDb7ZqoOxDPB8wOCJ/1qeQhOvth+bmj84eBzApqx1cHyDdQc96+PxKVdS9YIZ3gIQykg+gGIcD9oAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d82b6d76161a0e091d8ef78ed27bcb275c7bab3f3c93a12f325ec93f570e94c0","last_reissued_at":"2026-05-18T03:36:45.764284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:45.764284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.2265","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:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lvd+gL4rQXlj14SEsYU92iurYToe8hpyOg+LcuFMr7cQ632KXhHR6SQ5Rj1a2wmxd7pI5h911F8SIy+z5WQyAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:50.911628Z"},"content_sha256":"83c997d0d5f47f2a2686d9b65f57a7f1e8031b53f85ae5798a7cd473cd816fad","schema_version":"1.0","event_id":"sha256:83c997d0d5f47f2a2686d9b65f57a7f1e8031b53f85ae5798a7cd473cd816fad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:3AVW25QWDIHASHMO66HNE66LE5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Hybrid Processing of Beliefs and Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"David Ephraim Larkin, Rina Dechter","submitted_at":"2013-01-10T16:23:13Z","abstract_excerpt":"This paper explores algorithms for processing probabilistic and deterministic information when the former is represented as a belief network and the latter as  a set of boolean clauses. The motivating tasks are 1. evaluating beliefs networks having a large number of deterministic  relationships and2. evaluating probabilities of complex boolean querie over a belief network.  We propose a parameterized  family of  variable elimination algorithms that exploit both types  of information, and that allows varying levels of  constraint propagation inferences.  The complexity of the scheme is  control"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2265","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:36:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4KG7nNZdclugoqu0SmSuCCDSH8Gq6/213E0/bWoVAUmMUt2GW51qy6HG/pV4NnstJTAlqiCCjR0e/CKK66/qCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T05:08:50.912363Z"},"content_sha256":"d616de4c5303ad553a3878d609e1a5fda524cdcd373d36010fe8781790480d7c","schema_version":"1.0","event_id":"sha256:d616de4c5303ad553a3878d609e1a5fda524cdcd373d36010fe8781790480d7c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AVW25QWDIHASHMO66HNE66LE5/bundle.json","state_url":"https://pith.science/pith/3AVW25QWDIHASHMO66HNE66LE5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AVW25QWDIHASHMO66HNE66LE5/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-05-31T05:08:50Z","links":{"resolver":"https://pith.science/pith/3AVW25QWDIHASHMO66HNE66LE5","bundle":"https://pith.science/pith/3AVW25QWDIHASHMO66HNE66LE5/bundle.json","state":"https://pith.science/pith/3AVW25QWDIHASHMO66HNE66LE5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AVW25QWDIHASHMO66HNE66LE5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:3AVW25QWDIHASHMO66HNE66LE5","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":"feec3ca6a1423199a82ef3ec8ef5c8ffcfc96232a43b73f222ce0d82f58d8a25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:13Z","title_canon_sha256":"d81028c11561b0d69a5a924647eea4b209f78d70b231d94298eed7a9c0745d7c"},"schema_version":"1.0","source":{"id":"1301.2265","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.2265","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"arxiv_version","alias_value":"1301.2265v1","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.2265","created_at":"2026-05-18T03:36:45Z"},{"alias_kind":"pith_short_12","alias_value":"3AVW25QWDIHA","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"3AVW25QWDIHASHMO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"3AVW25QW","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:d616de4c5303ad553a3878d609e1a5fda524cdcd373d36010fe8781790480d7c","target":"graph","created_at":"2026-05-18T03:36:45Z","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":"This paper explores algorithms for processing probabilistic and deterministic information when the former is represented as a belief network and the latter as  a set of boolean clauses. The motivating tasks are 1. evaluating beliefs networks having a large number of deterministic  relationships and2. evaluating probabilities of complex boolean querie over a belief network.  We propose a parameterized  family of  variable elimination algorithms that exploit both types  of information, and that allows varying levels of  constraint propagation inferences.  The complexity of the scheme is  control","authors_text":"David Ephraim Larkin, Rina Dechter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:13Z","title":"Hybrid Processing of Beliefs and Constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.2265","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:83c997d0d5f47f2a2686d9b65f57a7f1e8031b53f85ae5798a7cd473cd816fad","target":"record","created_at":"2026-05-18T03:36:45Z","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":"feec3ca6a1423199a82ef3ec8ef5c8ffcfc96232a43b73f222ce0d82f58d8a25","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-01-10T16:23:13Z","title_canon_sha256":"d81028c11561b0d69a5a924647eea4b209f78d70b231d94298eed7a9c0745d7c"},"schema_version":"1.0","source":{"id":"1301.2265","kind":"arxiv","version":1}},"canonical_sha256":"d82b6d76161a0e091d8ef78ed27bcb275c7bab3f3c93a12f325ec93f570e94c0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d82b6d76161a0e091d8ef78ed27bcb275c7bab3f3c93a12f325ec93f570e94c0","first_computed_at":"2026-05-18T03:36:45.764284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:36:45.764284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODfwAJIyaDb7ZqoOxDPB8wOCJ/1qeQhOvth+bmj84eBzApqx1cHyDdQc96+PxKVdS9YIZ3gIQykg+gGIcD9oAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:36:45.765082Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.2265","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83c997d0d5f47f2a2686d9b65f57a7f1e8031b53f85ae5798a7cd473cd816fad","sha256:d616de4c5303ad553a3878d609e1a5fda524cdcd373d36010fe8781790480d7c"],"state_sha256":"e46951d8d4e235f68a50aea4b973b8dcdab93ffa4deaa7977ed5da638e1c15b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DGXL7Tiifa2Bsprgf6cWCnS09QUhIgH07l49KzQR9KbmaP9VKZI2rH27v0Dn3xPdJoBC79Yby7E6BubVCR35Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T05:08:50.916080Z","bundle_sha256":"6df06f86174fba78bb27e5bafa05a6a200a704b778f22d6d8a1b9e32a4fdbd1c"}}