{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:AHG6N2FZ6PJSRI347N6FMHK4VO","short_pith_number":"pith:AHG6N2FZ","canonical_record":{"source":{"id":"1212.2505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"4e08372010769847b4fcea2f31a9530a1cbc73e59519cd004e864053e74ee810","abstract_canon_sha256":"4404cd91d449209b063fafacbe592077b75cf0205659b8d1f08358b8dab5adfd"},"schema_version":"1.0"},"canonical_sha256":"01cde6e8b9f3d328a37cfb7c561d5caba442a0ad38df2690045587868e0c3c7c","source":{"kind":"arxiv","id":"1212.2505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2505","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2505v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2505","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"AHG6N2FZ6PJS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AHG6N2FZ6PJSRI34","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AHG6N2FZ","created_at":"2026-05-18T12:26:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:AHG6N2FZ6PJSRI347N6FMHK4VO","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2505","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:47Z","cross_cats_sorted":[],"title_canon_sha256":"4e08372010769847b4fcea2f31a9530a1cbc73e59519cd004e864053e74ee810","abstract_canon_sha256":"4404cd91d449209b063fafacbe592077b75cf0205659b8d1f08358b8dab5adfd"},"schema_version":"1.0"},"canonical_sha256":"01cde6e8b9f3d328a37cfb7c561d5caba442a0ad38df2690045587868e0c3c7c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.472925Z","signature_b64":"fX1RiniUAzRabVzQCve7BsvrelYobagwI/DnlKndRMZV3ZA7LZyZ6f9Oq9WOgrKI9ODbmVkhM7pPfixZFJAfDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01cde6e8b9f3d328a37cfb7c561d5caba442a0ad38df2690045587868e0c3c7c","last_reissued_at":"2026-05-18T03:38:44.472279Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.472279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2505","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/CQ3CmWVWem+HS0GigtcA7sSngmw8OYkxvMsaditLWZ14IthkKlRzh1DEbdkDOeexy7rSCePG2fG4AA1YlSwBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:49.351737Z"},"content_sha256":"855d1a4e2af52102d7452f61e6be72afef9097c66aad85850ad133c3f3d48fa0","schema_version":"1.0","event_id":"sha256:855d1a4e2af52102d7452f61e6be72afef9097c66aad85850ad133c3f3d48fa0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:AHG6N2FZ6PJSRI347N6FMHK4VO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Systematic vs. Non-systematic Algorithms for Solving the MPE Task","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Kalev Kask, Radu Marinescu, Rina Dechter","submitted_at":"2012-10-19T15:06:47Z","abstract_excerpt":"The paper continues the study of partitioning based inference of heuristics     for search in the context of solving the Most Probable Explanation task in     Bayesian Networks. We compare two systematic Branch and Bound search     algorithms, BBBT (for which the heuristic information is constructed during     search and allows dynamic variable/value ordering) and its predecessor BBMB     (for which the heuristic information is pre-compiled), against a number of     popular local search algorithms for the MPE problem. We show empirically that,     when viewed as approximation schemes, BBBT/BBM"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2505","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TcjHGlREBKycWYPiBycC/gv1ZF/YqmFJZBZM8m/y0bZkL02oXF6S0N+ShCgfyYIP4Mbx+INGzGcEq61G1OE+AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T20:29:49.352087Z"},"content_sha256":"5c08a6521dbd870e53073a21de845347977b5d8f66f82e1f49d37392c36872b4","schema_version":"1.0","event_id":"sha256:5c08a6521dbd870e53073a21de845347977b5d8f66f82e1f49d37392c36872b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/bundle.json","state_url":"https://pith.science/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/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-30T20:29:49Z","links":{"resolver":"https://pith.science/pith/AHG6N2FZ6PJSRI347N6FMHK4VO","bundle":"https://pith.science/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/bundle.json","state":"https://pith.science/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AHG6N2FZ6PJSRI347N6FMHK4VO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:AHG6N2FZ6PJSRI347N6FMHK4VO","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":"4404cd91d449209b063fafacbe592077b75cf0205659b8d1f08358b8dab5adfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:47Z","title_canon_sha256":"4e08372010769847b4fcea2f31a9530a1cbc73e59519cd004e864053e74ee810"},"schema_version":"1.0","source":{"id":"1212.2505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2505","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2505v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2505","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"AHG6N2FZ6PJS","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_16","alias_value":"AHG6N2FZ6PJSRI34","created_at":"2026-05-18T12:26:58Z"},{"alias_kind":"pith_short_8","alias_value":"AHG6N2FZ","created_at":"2026-05-18T12:26:58Z"}],"graph_snapshots":[{"event_id":"sha256:5c08a6521dbd870e53073a21de845347977b5d8f66f82e1f49d37392c36872b4","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"The paper continues the study of partitioning based inference of heuristics     for search in the context of solving the Most Probable Explanation task in     Bayesian Networks. We compare two systematic Branch and Bound search     algorithms, BBBT (for which the heuristic information is constructed during     search and allows dynamic variable/value ordering) and its predecessor BBMB     (for which the heuristic information is pre-compiled), against a number of     popular local search algorithms for the MPE problem. We show empirically that,     when viewed as approximation schemes, BBBT/BBM","authors_text":"Kalev Kask, Radu Marinescu, Rina Dechter","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:47Z","title":"Systematic vs. Non-systematic Algorithms for Solving the MPE Task"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2505","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:855d1a4e2af52102d7452f61e6be72afef9097c66aad85850ad133c3f3d48fa0","target":"record","created_at":"2026-05-18T03:38:44Z","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":"4404cd91d449209b063fafacbe592077b75cf0205659b8d1f08358b8dab5adfd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-19T15:06:47Z","title_canon_sha256":"4e08372010769847b4fcea2f31a9530a1cbc73e59519cd004e864053e74ee810"},"schema_version":"1.0","source":{"id":"1212.2505","kind":"arxiv","version":1}},"canonical_sha256":"01cde6e8b9f3d328a37cfb7c561d5caba442a0ad38df2690045587868e0c3c7c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"01cde6e8b9f3d328a37cfb7c561d5caba442a0ad38df2690045587868e0c3c7c","first_computed_at":"2026-05-18T03:38:44.472279Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.472279Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fX1RiniUAzRabVzQCve7BsvrelYobagwI/DnlKndRMZV3ZA7LZyZ6f9Oq9WOgrKI9ODbmVkhM7pPfixZFJAfDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.472925Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:855d1a4e2af52102d7452f61e6be72afef9097c66aad85850ad133c3f3d48fa0","sha256:5c08a6521dbd870e53073a21de845347977b5d8f66f82e1f49d37392c36872b4"],"state_sha256":"a28a5d62412e84e99083c6eafb0b57cdf8e08f884f87af8219c3a6918816f2c0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Nk1OddvN8KcCdqid8We82jZ21ZhuUbIlm9Nchr422NDQZelpCGD93k6jfXB7e5WFqB5QLQc5EKzbTOAqDsNUAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T20:29:49.354302Z","bundle_sha256":"6659a0e009dcf0453c07e3890348e4833d6220bc0ade0efb28e254bdc81d4728"}}