{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4T52DPMBF3EMQXEDR5PSG37XTI","short_pith_number":"pith:4T52DPMB","schema_version":"1.0","canonical_sha256":"e4fba1bd812ec8c85c838f5f236ff79a2ccd01c11412cb8ae6f4276681249b9d","source":{"kind":"arxiv","id":"1210.4913","version":1},"attestation_state":"computed","paper":{"title":"An Improved Admissible Heuristic for Learning Optimal Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Brandon Malone, Changhe Yuan","submitted_at":"2012-10-16T17:55:57Z","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"},"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":"1210.4913","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-10-16T17:55:57Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"2668a6779d0911019747a55594d2b8d11d8aa7d644c56a9f39c0a119b435ce0c","abstract_canon_sha256":"4bbd236308f5cc2c740591652d291b762d0963bbaa6a4cf7a1aab997f1e59553"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:54.945525Z","signature_b64":"Eo8EDWGraiJCFPcoS7LjkfkfFiVg22+Z8QoC+4fzX2GcLiAEz2mjk8farX++7fdotHqFEzEwnFttEf6IqoAnBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4fba1bd812ec8c85c838f5f236ff79a2ccd01c11412cb8ae6f4276681249b9d","last_reissued_at":"2026-05-18T03:42:54.944715Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:54.944715Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Admissible Heuristic for Learning Optimal Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Brandon Malone, Changhe Yuan","submitted_at":"2012-10-16T17:55:57Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4913","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":"1210.4913","created_at":"2026-05-18T03:42:54.944886+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.4913v1","created_at":"2026-05-18T03:42:54.944886+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4913","created_at":"2026-05-18T03:42:54.944886+00:00"},{"alias_kind":"pith_short_12","alias_value":"4T52DPMBF3EM","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4T52DPMBF3EMQXED","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4T52DPMB","created_at":"2026-05-18T12:26:53.410803+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/4T52DPMBF3EMQXEDR5PSG37XTI","json":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI.json","graph_json":"https://pith.science/api/pith-number/4T52DPMBF3EMQXEDR5PSG37XTI/graph.json","events_json":"https://pith.science/api/pith-number/4T52DPMBF3EMQXEDR5PSG37XTI/events.json","paper":"https://pith.science/paper/4T52DPMB"},"agent_actions":{"view_html":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI","download_json":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI.json","view_paper":"https://pith.science/paper/4T52DPMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.4913&json=true","fetch_graph":"https://pith.science/api/pith-number/4T52DPMBF3EMQXEDR5PSG37XTI/graph.json","fetch_events":"https://pith.science/api/pith-number/4T52DPMBF3EMQXEDR5PSG37XTI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI/action/storage_attestation","attest_author":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI/action/author_attestation","sign_citation":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI/action/citation_signature","submit_replication":"https://pith.science/pith/4T52DPMBF3EMQXEDR5PSG37XTI/action/replication_record"}},"created_at":"2026-05-18T03:42:54.944886+00:00","updated_at":"2026-05-18T03:42:54.944886+00:00"}