{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:Y3KA3Y53E7MIZHZPYACCEWIFQP","short_pith_number":"pith:Y3KA3Y53","canonical_record":{"source":{"id":"1206.5251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"5fbcfe6fa0f02fbdd5c5ff40c036e0f2e8a212f97853f0daffe23c4844990295","abstract_canon_sha256":"1f795ac861f4a02cab43206a4c60fe44adb5d34212f37acaf3952bf1e34d3a16"},"schema_version":"1.0"},"canonical_sha256":"c6d40de3bb27d88c9f2fc00422590583c144cfe10563611272564640788fd090","source":{"kind":"arxiv","id":"1206.5251","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5251","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5251v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5251","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y3KA3Y53E7MI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y3KA3Y53E7MIZHZP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y3KA3Y53","created_at":"2026-05-18T12:27:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:Y3KA3Y53E7MIZHZPYACCEWIFQP","target":"record","payload":{"canonical_record":{"source":{"id":"1206.5251","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"5fbcfe6fa0f02fbdd5c5ff40c036e0f2e8a212f97853f0daffe23c4844990295","abstract_canon_sha256":"1f795ac861f4a02cab43206a4c60fe44adb5d34212f37acaf3952bf1e34d3a16"},"schema_version":"1.0"},"canonical_sha256":"c6d40de3bb27d88c9f2fc00422590583c144cfe10563611272564640788fd090","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.910506Z","signature_b64":"nvGJXPetvOWoziI/SzrLSuFoS1Rk9xmg4nO7x4BqLtL4mG4w1t4yHDCmIhjEevxfyVu0zrln69biJLUaURA5Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6d40de3bb27d88c9f2fc00422590583c144cfe10563611272564640788fd090","last_reissued_at":"2026-05-18T03:52:40.909791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.909791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.5251","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C7UARr3m0UmAtM3Zi2/0/r25SjTfvhzfh1YCT/ULXMEWPTCCrolgQwvoJDxJp+LvzfXkcRZo6da57wtM9CNZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:43:08.191830Z"},"content_sha256":"1dd44fdabd00cd3b30b845adf581a2fbf0458344e50ab7dd48e1545689dca156","schema_version":"1.0","event_id":"sha256:1dd44fdabd00cd3b30b845adf581a2fbf0458344e50ab7dd48e1545689dca156"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:Y3KA3Y53E7MIZHZPYACCEWIFQP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Adnan Darwiche, Arthur Choi, Mark Chavira","submitted_at":"2012-06-20T14:56:19Z","abstract_excerpt":"We formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and practical implications. First, we show that branchand- bound search algorithms that use minibucket bounds may operate in a drastically reduced search space. Second, we show that the proposed formulation inspires new minibucket heuristics and allows us to analyze existing heuristics from a new perspective. Finally, we show that this new formulation allows mini"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5251","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:52:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mbz30f2o3GYEulqNu4bYWovHJwlYFet+UWN81j/kD/lcZT7oDFBryEW5kDzIi4C3HTwE+8locNZJiYwrj/7zBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T22:43:08.192545Z"},"content_sha256":"aece061909b66f5b948678fbc1556a4839350bbcd1739f485bce6fbf36945e09","schema_version":"1.0","event_id":"sha256:aece061909b66f5b948678fbc1556a4839350bbcd1739f485bce6fbf36945e09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/bundle.json","state_url":"https://pith.science/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/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-07T22:43:08Z","links":{"resolver":"https://pith.science/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP","bundle":"https://pith.science/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/bundle.json","state":"https://pith.science/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y3KA3Y53E7MIZHZPYACCEWIFQP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:Y3KA3Y53E7MIZHZPYACCEWIFQP","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":"1f795ac861f4a02cab43206a4c60fe44adb5d34212f37acaf3952bf1e34d3a16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:56:19Z","title_canon_sha256":"5fbcfe6fa0f02fbdd5c5ff40c036e0f2e8a212f97853f0daffe23c4844990295"},"schema_version":"1.0","source":{"id":"1206.5251","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.5251","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"arxiv_version","alias_value":"1206.5251v1","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5251","created_at":"2026-05-18T03:52:40Z"},{"alias_kind":"pith_short_12","alias_value":"Y3KA3Y53E7MI","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_16","alias_value":"Y3KA3Y53E7MIZHZP","created_at":"2026-05-18T12:27:27Z"},{"alias_kind":"pith_short_8","alias_value":"Y3KA3Y53","created_at":"2026-05-18T12:27:27Z"}],"graph_snapshots":[{"event_id":"sha256:aece061909b66f5b948678fbc1556a4839350bbcd1739f485bce6fbf36945e09","target":"graph","created_at":"2026-05-18T03:52:40Z","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 formulate in this paper the mini-bucket algorithm for approximate inference in terms of exact inference on an approximate model produced by splitting nodes in a Bayesian network. The new formulation leads to a number of theoretical and practical implications. First, we show that branchand- bound search algorithms that use minibucket bounds may operate in a drastically reduced search space. Second, we show that the proposed formulation inspires new minibucket heuristics and allows us to analyze existing heuristics from a new perspective. Finally, we show that this new formulation allows mini","authors_text":"Adnan Darwiche, Arthur Choi, Mark Chavira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:56:19Z","title":"Node Splitting: A Scheme for Generating Upper Bounds in Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5251","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:1dd44fdabd00cd3b30b845adf581a2fbf0458344e50ab7dd48e1545689dca156","target":"record","created_at":"2026-05-18T03:52:40Z","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":"1f795ac861f4a02cab43206a4c60fe44adb5d34212f37acaf3952bf1e34d3a16","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T14:56:19Z","title_canon_sha256":"5fbcfe6fa0f02fbdd5c5ff40c036e0f2e8a212f97853f0daffe23c4844990295"},"schema_version":"1.0","source":{"id":"1206.5251","kind":"arxiv","version":1}},"canonical_sha256":"c6d40de3bb27d88c9f2fc00422590583c144cfe10563611272564640788fd090","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6d40de3bb27d88c9f2fc00422590583c144cfe10563611272564640788fd090","first_computed_at":"2026-05-18T03:52:40.909791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:40.909791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nvGJXPetvOWoziI/SzrLSuFoS1Rk9xmg4nO7x4BqLtL4mG4w1t4yHDCmIhjEevxfyVu0zrln69biJLUaURA5Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:40.910506Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.5251","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1dd44fdabd00cd3b30b845adf581a2fbf0458344e50ab7dd48e1545689dca156","sha256:aece061909b66f5b948678fbc1556a4839350bbcd1739f485bce6fbf36945e09"],"state_sha256":"460f4237c231f5caec64b98930087867952470329863484c3dafba5b35fe5542"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jLrGj5k41Y6Cn1UUQxSjwESMqwukl/DEMN2Zk9t60okG3Iubn7wYjUAddO2sIzcADsbqfXHQQwTDDF4e+An7CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T22:43:08.196181Z","bundle_sha256":"36ed0d367869408c757bd5a940e63b974f538896ec249beb61d1d0039444ee19"}}