{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:WIKXKSC352FUG3IA4D4AILUMNF","short_pith_number":"pith:WIKXKSC3","schema_version":"1.0","canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","source":{"kind":"arxiv","id":"1206.3236","version":1},"attestation_state":"computed","paper":{"title":"Learning Inclusion-Optimal Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Louis Wehenkel, Vincent Auvray","submitted_at":"2012-06-13T14:17:24Z","abstract_excerpt":"Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algorithm to learn the chordal structure of a probabilistic model from data. The algorithm is a greedy hill-climbing search algorithm that uses the inclusion boundary neighborhood over chordal graphs. In the limit of a large sample size and under appropriate hypotheses on the scoring criterion, we prove that the algorithm will find a structure that is inclusion-optimal when the dependency model of the data-generating dist"},"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.3236","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:17:24Z","cross_cats_sorted":["cs.DS","stat.ML"],"title_canon_sha256":"6a453a781d326ef60f4ff5e993ba7069429539288b57276f6cedacc4489412f8","abstract_canon_sha256":"f7fe597032d85ae56177418c8d67a7f4adca43fec5ce16887d50ef6111f29915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:53:31.142014Z","signature_b64":"JPZ9wHMTvtHjGnw+8ZC/iZby28ymdRHDMsvQ5q4jsuUAvM5wYFVg2pTSN8KSK9ECO03HNZY5eFbqC6SGp8IWBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","last_reissued_at":"2026-05-18T03:53:31.141356Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:53:31.141356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Inclusion-Optimal Chordal Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","stat.ML"],"primary_cat":"cs.LG","authors_text":"Louis Wehenkel, Vincent Auvray","submitted_at":"2012-06-13T14:17:24Z","abstract_excerpt":"Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algorithm to learn the chordal structure of a probabilistic model from data. The algorithm is a greedy hill-climbing search algorithm that uses the inclusion boundary neighborhood over chordal graphs. In the limit of a large sample size and under appropriate hypotheses on the scoring criterion, we prove that the algorithm will find a structure that is inclusion-optimal when the dependency model of the data-generating dist"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3236","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.3236","created_at":"2026-05-18T03:53:31.141466+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.3236v1","created_at":"2026-05-18T03:53:31.141466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3236","created_at":"2026-05-18T03:53:31.141466+00:00"},{"alias_kind":"pith_short_12","alias_value":"WIKXKSC352FU","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"WIKXKSC352FUG3IA","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"WIKXKSC3","created_at":"2026-05-18T12:27:25.539911+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/WIKXKSC352FUG3IA4D4AILUMNF","json":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF.json","graph_json":"https://pith.science/api/pith-number/WIKXKSC352FUG3IA4D4AILUMNF/graph.json","events_json":"https://pith.science/api/pith-number/WIKXKSC352FUG3IA4D4AILUMNF/events.json","paper":"https://pith.science/paper/WIKXKSC3"},"agent_actions":{"view_html":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF","download_json":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF.json","view_paper":"https://pith.science/paper/WIKXKSC3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.3236&json=true","fetch_graph":"https://pith.science/api/pith-number/WIKXKSC352FUG3IA4D4AILUMNF/graph.json","fetch_events":"https://pith.science/api/pith-number/WIKXKSC352FUG3IA4D4AILUMNF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/action/storage_attestation","attest_author":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/action/author_attestation","sign_citation":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/action/citation_signature","submit_replication":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/action/replication_record"}},"created_at":"2026-05-18T03:53:31.141466+00:00","updated_at":"2026-05-18T03:53:31.141466+00:00"}