{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4T52DPMBF3EMQXEDR5PSG37XTI","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":"4bbd236308f5cc2c740591652d291b762d0963bbaa6a4cf7a1aab997f1e59553","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:55:57Z","title_canon_sha256":"2668a6779d0911019747a55594d2b8d11d8aa7d644c56a9f39c0a119b435ce0c"},"schema_version":"1.0","source":{"id":"1210.4913","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4913","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4913v1","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4913","created_at":"2026-05-18T03:42:54Z"},{"alias_kind":"pith_short_12","alias_value":"4T52DPMBF3EM","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4T52DPMBF3EMQXED","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4T52DPMB","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:acc7af3e282164575c846ec17a30d3df246bc3ffc3bf687c02ef63d21d6780ad","target":"graph","created_at":"2026-05-18T03:42:54Z","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":"Recently two search algorithms, A* and breadth-first branch and bound (BFBnB), were developed based on a simple admissible heuristic for learning Bayesian network structures that optimize a scoring function. The heuristic represents a relaxation of the learning problem such that each variable chooses optimal parents independently. As a result, the heuristic may contain many directed cycles and result in a loose bound. This paper introduces an improved admissible heuristic that tries to avoid directed cycles within small groups of variables. A sparse representation is also introduced to store o","authors_text":"Brandon Malone, Changhe Yuan","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:55:57Z","title":"An Improved Admissible Heuristic for Learning Optimal Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4913","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:013b9db36feafc727e37d339076fd9434d7750e7374be8accf139e0534046118","target":"record","created_at":"2026-05-18T03:42:54Z","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":"4bbd236308f5cc2c740591652d291b762d0963bbaa6a4cf7a1aab997f1e59553","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:55:57Z","title_canon_sha256":"2668a6779d0911019747a55594d2b8d11d8aa7d644c56a9f39c0a119b435ce0c"},"schema_version":"1.0","source":{"id":"1210.4913","kind":"arxiv","version":1}},"canonical_sha256":"e4fba1bd812ec8c85c838f5f236ff79a2ccd01c11412cb8ae6f4276681249b9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4fba1bd812ec8c85c838f5f236ff79a2ccd01c11412cb8ae6f4276681249b9d","first_computed_at":"2026-05-18T03:42:54.944715Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:54.944715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Eo8EDWGraiJCFPcoS7LjkfkfFiVg22+Z8QoC+4fzX2GcLiAEz2mjk8farX++7fdotHqFEzEwnFttEf6IqoAnBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:54.945525Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4913","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:013b9db36feafc727e37d339076fd9434d7750e7374be8accf139e0534046118","sha256:acc7af3e282164575c846ec17a30d3df246bc3ffc3bf687c02ef63d21d6780ad"],"state_sha256":"11f1d4c3503984e94277bd197c5698fa6c06598bf21adf8f4e708cc968c36b32"}