{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:5HU533KDFICMIP2OP5GS4EQRGV","short_pith_number":"pith:5HU533KD","canonical_record":{"source":{"id":"1303.1495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"977003ea968a8f2252b7a5dd16e4988623fc6c1f658c1e8eb341e9ae928bdcac","abstract_canon_sha256":"bd6e5766d57d91135bd8ea61577c49747d47dfb8aac82b50c32ebbbd744a9186"},"schema_version":"1.0"},"canonical_sha256":"e9e9dded432a04c43f4e7f4d2e121135441652a336dc5d59272cbbfd2fc3daa9","source":{"kind":"arxiv","id":"1303.1495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1495","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1495v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1495","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"5HU533KDFICM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5HU533KDFICMIP2O","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5HU533KD","created_at":"2026-05-18T12:27:34Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:5HU533KDFICMIP2OP5GS4EQRGV","target":"record","payload":{"canonical_record":{"source":{"id":"1303.1495","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:18Z","cross_cats_sorted":[],"title_canon_sha256":"977003ea968a8f2252b7a5dd16e4988623fc6c1f658c1e8eb341e9ae928bdcac","abstract_canon_sha256":"bd6e5766d57d91135bd8ea61577c49747d47dfb8aac82b50c32ebbbd744a9186"},"schema_version":"1.0"},"canonical_sha256":"e9e9dded432a04c43f4e7f4d2e121135441652a336dc5d59272cbbfd2fc3daa9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:42.562488Z","signature_b64":"wzkU1L/tLcCukMptzzWwJsgG2Ix64ZW0leiQMJrAtmnIveqQ3QgRfqCNPMlrTzmGcCpNFl0ysygWnqjKc+48Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e9e9dded432a04c43f4e7f4d2e121135441652a336dc5d59272cbbfd2fc3daa9","last_reissued_at":"2026-05-18T03:31:42.561966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:42.561966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1303.1495","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:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DIt9Bw/Qxd7XGaRbxI5fNIHvI5E113YOs/JjrMh/1OZJK+wuSydgUvnCq7O0IEaMppuweOaLj6LvDaZFXO8wDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:43:03.493041Z"},"content_sha256":"cdcaf1c6a64afbc70c487d3a88b5fe4af053f0ce9d3fbe1e3c60786ee749e613","schema_version":"1.0","event_id":"sha256:cdcaf1c6a64afbc70c487d3a88b5fe4af053f0ce9d3fbe1e3c60786ee749e613"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:5HU533KDFICMIP2OP5GS4EQRGV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An efficient approach for finding the MPE in belief networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Bruce D'Ambrosio, Zhaoyu Li","submitted_at":"2013-03-06T14:22:18Z","abstract_excerpt":"Given a belief network with evidence, the task of finding the I most probable explanations (MPE) in the belief network is that of identifying and ordering the I most probable instantiations of the non-evidence nodes of the belief network.  Although many approaches have been proposed for solving this problem, most work only for restricted topologies (i.e., singly connected belief networks).  In this paper, we will present a new approach for finding I MPEs in an arbitrary belief network.  First, we will present an algorithm for finding the MPE in a belief network.  Then, we will present a linear"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1495","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:31:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/0u7x22QoPJjKsBXxUaXmCz8zO1fcoJJukzdUeRWosXpaTW7UU7ScCMjykRNeewQtEUK/hZ7e4681wNSxyjACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T21:43:03.493703Z"},"content_sha256":"61f67233ee48f5334ee3848fd50d760c0b4cab04081a0762fbcebd1fde11703e","schema_version":"1.0","event_id":"sha256:61f67233ee48f5334ee3848fd50d760c0b4cab04081a0762fbcebd1fde11703e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5HU533KDFICMIP2OP5GS4EQRGV/bundle.json","state_url":"https://pith.science/pith/5HU533KDFICMIP2OP5GS4EQRGV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5HU533KDFICMIP2OP5GS4EQRGV/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-22T21:43:03Z","links":{"resolver":"https://pith.science/pith/5HU533KDFICMIP2OP5GS4EQRGV","bundle":"https://pith.science/pith/5HU533KDFICMIP2OP5GS4EQRGV/bundle.json","state":"https://pith.science/pith/5HU533KDFICMIP2OP5GS4EQRGV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5HU533KDFICMIP2OP5GS4EQRGV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:5HU533KDFICMIP2OP5GS4EQRGV","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":"bd6e5766d57d91135bd8ea61577c49747d47dfb8aac82b50c32ebbbd744a9186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:18Z","title_canon_sha256":"977003ea968a8f2252b7a5dd16e4988623fc6c1f658c1e8eb341e9ae928bdcac"},"schema_version":"1.0","source":{"id":"1303.1495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1495","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1495v1","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1495","created_at":"2026-05-18T03:31:42Z"},{"alias_kind":"pith_short_12","alias_value":"5HU533KDFICM","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_16","alias_value":"5HU533KDFICMIP2O","created_at":"2026-05-18T12:27:34Z"},{"alias_kind":"pith_short_8","alias_value":"5HU533KD","created_at":"2026-05-18T12:27:34Z"}],"graph_snapshots":[{"event_id":"sha256:61f67233ee48f5334ee3848fd50d760c0b4cab04081a0762fbcebd1fde11703e","target":"graph","created_at":"2026-05-18T03:31:42Z","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":"Given a belief network with evidence, the task of finding the I most probable explanations (MPE) in the belief network is that of identifying and ordering the I most probable instantiations of the non-evidence nodes of the belief network.  Although many approaches have been proposed for solving this problem, most work only for restricted topologies (i.e., singly connected belief networks).  In this paper, we will present a new approach for finding I MPEs in an arbitrary belief network.  First, we will present an algorithm for finding the MPE in a belief network.  Then, we will present a linear","authors_text":"Bruce D'Ambrosio, Zhaoyu Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:18Z","title":"An efficient approach for finding the MPE in belief networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1495","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:cdcaf1c6a64afbc70c487d3a88b5fe4af053f0ce9d3fbe1e3c60786ee749e613","target":"record","created_at":"2026-05-18T03:31:42Z","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":"bd6e5766d57d91135bd8ea61577c49747d47dfb8aac82b50c32ebbbd744a9186","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2013-03-06T14:22:18Z","title_canon_sha256":"977003ea968a8f2252b7a5dd16e4988623fc6c1f658c1e8eb341e9ae928bdcac"},"schema_version":"1.0","source":{"id":"1303.1495","kind":"arxiv","version":1}},"canonical_sha256":"e9e9dded432a04c43f4e7f4d2e121135441652a336dc5d59272cbbfd2fc3daa9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e9e9dded432a04c43f4e7f4d2e121135441652a336dc5d59272cbbfd2fc3daa9","first_computed_at":"2026-05-18T03:31:42.561966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:42.561966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wzkU1L/tLcCukMptzzWwJsgG2Ix64ZW0leiQMJrAtmnIveqQ3QgRfqCNPMlrTzmGcCpNFl0ysygWnqjKc+48Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:42.562488Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cdcaf1c6a64afbc70c487d3a88b5fe4af053f0ce9d3fbe1e3c60786ee749e613","sha256:61f67233ee48f5334ee3848fd50d760c0b4cab04081a0762fbcebd1fde11703e"],"state_sha256":"346e9df3bac6443370cd11cc0a51ecdc08caea98e13fe5ad196412b3a9878ea7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2kiSWWXiZTeG50L1jOxIehTWXLl7QURCr92oXKGZbjxTFEMOjNU6uudYoAyv3rW2Cg+om1r8aUEPsSR4ZbX0Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T21:43:03.497784Z","bundle_sha256":"d63ba2b8956c3a724ae8cd1b22372775f17a6e169b1802ec59c5862a80c59500"}}