{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:SKY6337U7DVW4JJJM4QJLUEIPI","short_pith_number":"pith:SKY6337U","schema_version":"1.0","canonical_sha256":"92b1edeff4f8eb6e2529672095d0887a3cf9635023565f38fba8ef2a15132256","source":{"kind":"arxiv","id":"2112.00398","version":2},"attestation_state":"computed","paper":{"title":"Effective and efficient structure learning with pruning and model averaging strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anthony C. Constantinou, Kiattikun Chobtham, Neville K. Kitson, Yang Liu, Zhigao Guo","submitted_at":"2021-12-01T10:35:34Z","abstract_excerpt":"Learning the structure of a Bayesian Network (BN) with score-based solutions involves exploring the search space of possible graphs and moving towards the graph that maximises a given objective function. Some algorithms offer exact solutions that guarantee to return the graph with the highest objective score, while others offer approximate solutions in exchange for reduced computational complexity. This paper describes an approximate BN structure learning algorithm, which we call Model Averaging Hill-Climbing (MAHC), that combines two novel strategies with hill-climbing search. The algorithm s"},"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":"2112.00398","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2021-12-01T10:35:34Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"a3bf904a85f17c99fb9f5ea85cb599ca512a2405336a4d28323d4aabc933749a","abstract_canon_sha256":"8c9b062ea8de63d838da60a459adf8ea69acd060fc16bcc842acd72e8e986b68"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:19:04.360925Z","signature_b64":"bh3IyP3FbbdD+5u1OPOHP6Fy4zciuYimZIhAEvdtXuapnpfZf/WVHKV3L+JU9HX+lyrhRVjjHiRvYHkLu2BABA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"92b1edeff4f8eb6e2529672095d0887a3cf9635023565f38fba8ef2a15132256","last_reissued_at":"2026-07-05T04:19:04.360438Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:19:04.360438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Effective and efficient structure learning with pruning and model averaging strategies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Anthony C. Constantinou, Kiattikun Chobtham, Neville K. Kitson, Yang Liu, Zhigao Guo","submitted_at":"2021-12-01T10:35:34Z","abstract_excerpt":"Learning the structure of a Bayesian Network (BN) with score-based solutions involves exploring the search space of possible graphs and moving towards the graph that maximises a given objective function. Some algorithms offer exact solutions that guarantee to return the graph with the highest objective score, while others offer approximate solutions in exchange for reduced computational complexity. This paper describes an approximate BN structure learning algorithm, which we call Model Averaging Hill-Climbing (MAHC), that combines two novel strategies with hill-climbing search. The algorithm s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2112.00398","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2112.00398/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2112.00398","created_at":"2026-07-05T04:19:04.360492+00:00"},{"alias_kind":"arxiv_version","alias_value":"2112.00398v2","created_at":"2026-07-05T04:19:04.360492+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2112.00398","created_at":"2026-07-05T04:19:04.360492+00:00"},{"alias_kind":"pith_short_12","alias_value":"SKY6337U7DVW","created_at":"2026-07-05T04:19:04.360492+00:00"},{"alias_kind":"pith_short_16","alias_value":"SKY6337U7DVW4JJJ","created_at":"2026-07-05T04:19:04.360492+00:00"},{"alias_kind":"pith_short_8","alias_value":"SKY6337U","created_at":"2026-07-05T04:19:04.360492+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/SKY6337U7DVW4JJJM4QJLUEIPI","json":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI.json","graph_json":"https://pith.science/api/pith-number/SKY6337U7DVW4JJJM4QJLUEIPI/graph.json","events_json":"https://pith.science/api/pith-number/SKY6337U7DVW4JJJM4QJLUEIPI/events.json","paper":"https://pith.science/paper/SKY6337U"},"agent_actions":{"view_html":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI","download_json":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI.json","view_paper":"https://pith.science/paper/SKY6337U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2112.00398&json=true","fetch_graph":"https://pith.science/api/pith-number/SKY6337U7DVW4JJJM4QJLUEIPI/graph.json","fetch_events":"https://pith.science/api/pith-number/SKY6337U7DVW4JJJM4QJLUEIPI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI/action/storage_attestation","attest_author":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI/action/author_attestation","sign_citation":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI/action/citation_signature","submit_replication":"https://pith.science/pith/SKY6337U7DVW4JJJM4QJLUEIPI/action/replication_record"}},"created_at":"2026-07-05T04:19:04.360492+00:00","updated_at":"2026-07-05T04:19:04.360492+00:00"}