{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:ABXXOR7NMC4JZNSZAINWMI3W4N","short_pith_number":"pith:ABXXOR7N","schema_version":"1.0","canonical_sha256":"006f7747ed60b89cb659021b662376e35f37dc14331a367f2f137fa4e957b2bf","source":{"kind":"arxiv","id":"1206.5268","version":1},"attestation_state":"computed","paper":{"title":"Best-First AND/OR Search for Most Probable Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Radu Marinescu, Rina Dechter","submitted_at":"2012-06-20T15:04:10Z","abstract_excerpt":"The paper evaluates the power of best-first search over AND/OR search spaces for solving the Most Probable Explanation (MPE) task in Bayesian networks. The main virtue of the AND/OR representation of the search space is its sensitivity to the structure of the problem, which can translate into significant time savings. In recent years depth-first AND/OR Branch-and- Bound algorithms were shown to be very effective when exploring such search spaces, especially when using caching. Since best-first strategies are known to be superior to depth-first when memory is utilized, exploring the best-first "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1206.5268","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-20T15:04:10Z","cross_cats_sorted":[],"title_canon_sha256":"57b502a34acf9cb22dc4af1f62a4e6867e413a2fc0d38072017f7360d7d2485d","abstract_canon_sha256":"2dfc9970bd6c86d9f6b194f907cabe2529653161e6f1dc689e0bfead933f0f10"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:40.724295Z","signature_b64":"fT3RepFO0jpwfJ4MlQY1PljH4Qie8cWuCm2Pt/Hu+r+GbDD4ATZkCNwRk7UI4VWoqRY0Rz8j3kkWJPiFdbZeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006f7747ed60b89cb659021b662376e35f37dc14331a367f2f137fa4e957b2bf","last_reissued_at":"2026-05-18T03:52:40.719902Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:40.719902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Best-First AND/OR Search for Most Probable Explanations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Radu Marinescu, Rina Dechter","submitted_at":"2012-06-20T15:04:10Z","abstract_excerpt":"The paper evaluates the power of best-first search over AND/OR search spaces for solving the Most Probable Explanation (MPE) task in Bayesian networks. The main virtue of the AND/OR representation of the search space is its sensitivity to the structure of the problem, which can translate into significant time savings. In recent years depth-first AND/OR Branch-and- Bound algorithms were shown to be very effective when exploring such search spaces, especially when using caching. Since best-first strategies are known to be superior to depth-first when memory is utilized, exploring the best-first "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5268","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5268","created_at":"2026-05-18T03:52:40.723349+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5268v1","created_at":"2026-05-18T03:52:40.723349+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5268","created_at":"2026-05-18T03:52:40.723349+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABXXOR7NMC4J","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABXXOR7NMC4JZNSZ","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABXXOR7N","created_at":"2026-05-18T12:26:58.693483+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N","json":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N.json","graph_json":"https://pith.science/api/pith-number/ABXXOR7NMC4JZNSZAINWMI3W4N/graph.json","events_json":"https://pith.science/api/pith-number/ABXXOR7NMC4JZNSZAINWMI3W4N/events.json","paper":"https://pith.science/paper/ABXXOR7N"},"agent_actions":{"view_html":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N","download_json":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N.json","view_paper":"https://pith.science/paper/ABXXOR7N","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5268&json=true","fetch_graph":"https://pith.science/api/pith-number/ABXXOR7NMC4JZNSZAINWMI3W4N/graph.json","fetch_events":"https://pith.science/api/pith-number/ABXXOR7NMC4JZNSZAINWMI3W4N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N/action/storage_attestation","attest_author":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N/action/author_attestation","sign_citation":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N/action/citation_signature","submit_replication":"https://pith.science/pith/ABXXOR7NMC4JZNSZAINWMI3W4N/action/replication_record"}},"created_at":"2026-05-18T03:52:40.723349+00:00","updated_at":"2026-05-18T03:52:40.723349+00:00"}