{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:WIKXKSC352FUG3IA4D4AILUMNF","short_pith_number":"pith:WIKXKSC3","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"},"canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","source":{"kind":"arxiv","id":"1206.3236","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3236","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3236v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3236","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"WIKXKSC352FU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WIKXKSC352FUG3IA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WIKXKSC3","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:WIKXKSC352FUG3IA4D4AILUMNF","target":"record","payload":{"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"},"canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","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"},"source_kind":"arxiv","source_id":"1206.3236","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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TortQpWHR5JXWqVYPjlpidWltRHTBTSlIXdYOzIjwejq0eXesEDv7nyppYQRZqkdkFLay57xsuvjSbscMWoVAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:59:51.979753Z"},"content_sha256":"edbeed5c3db28c6d9e5967c59392838e2e824f9fb3bba6cd3d037014d74e9ae6","schema_version":"1.0","event_id":"sha256:edbeed5c3db28c6d9e5967c59392838e2e824f9fb3bba6cd3d037014d74e9ae6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:WIKXKSC352FUG3IA4D4AILUMNF","target":"graph","payload":{"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"},"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:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TEs13LbCKkzuO44eeKxRoXB7rAM3hmr7iT4RZQ4GxU0vr+M6xH8MOTIEED9HGNzFy7+4LhyclUsfN384GLQMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T12:59:51.980099Z"},"content_sha256":"baaa2ebe6fe1442a4a9aab604d01fd79fd351afa3340aee6b7e433925b5955ae","schema_version":"1.0","event_id":"sha256:baaa2ebe6fe1442a4a9aab604d01fd79fd351afa3340aee6b7e433925b5955ae"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/bundle.json","state_url":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIKXKSC352FUG3IA4D4AILUMNF/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-06-22T12:59:51Z","links":{"resolver":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF","bundle":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/bundle.json","state":"https://pith.science/pith/WIKXKSC352FUG3IA4D4AILUMNF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIKXKSC352FUG3IA4D4AILUMNF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:WIKXKSC352FUG3IA4D4AILUMNF","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":"f7fe597032d85ae56177418c8d67a7f4adca43fec5ce16887d50ef6111f29915","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:17:24Z","title_canon_sha256":"6a453a781d326ef60f4ff5e993ba7069429539288b57276f6cedacc4489412f8"},"schema_version":"1.0","source":{"id":"1206.3236","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.3236","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1206.3236v1","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.3236","created_at":"2026-05-18T03:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"WIKXKSC352FU","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"WIKXKSC352FUG3IA","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"WIKXKSC3","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:baaa2ebe6fe1442a4a9aab604d01fd79fd351afa3340aee6b7e433925b5955ae","target":"graph","created_at":"2026-05-18T03:53:31Z","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":"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","authors_text":"Louis Wehenkel, Vincent Auvray","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:17:24Z","title":"Learning Inclusion-Optimal Chordal Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.3236","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:edbeed5c3db28c6d9e5967c59392838e2e824f9fb3bba6cd3d037014d74e9ae6","target":"record","created_at":"2026-05-18T03:53:31Z","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":"f7fe597032d85ae56177418c8d67a7f4adca43fec5ce16887d50ef6111f29915","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-06-13T14:17:24Z","title_canon_sha256":"6a453a781d326ef60f4ff5e993ba7069429539288b57276f6cedacc4489412f8"},"schema_version":"1.0","source":{"id":"1206.3236","kind":"arxiv","version":1}},"canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b21575485bee8b436d00e0f8042e8c6958e8b90ccfe79fe8e6d0b55c9646df6c","first_computed_at":"2026-05-18T03:53:31.141356Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:53:31.141356Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JPZ9wHMTvtHjGnw+8ZC/iZby28ymdRHDMsvQ5q4jsuUAvM5wYFVg2pTSN8KSK9ECO03HNZY5eFbqC6SGp8IWBw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:53:31.142014Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.3236","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:edbeed5c3db28c6d9e5967c59392838e2e824f9fb3bba6cd3d037014d74e9ae6","sha256:baaa2ebe6fe1442a4a9aab604d01fd79fd351afa3340aee6b7e433925b5955ae"],"state_sha256":"ad638a4c0522d46cf245a27cfea2f46a6847e6a292039caced806428f06b1565"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OrEv2kRPBWOjJj8o9MdOfzSBdr9K9d432RijjSrSu0F6LbR6Sf6hIBUb+6EBlDQyNMAtzGkn3QEKBTNXcxa2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T12:59:51.982047Z","bundle_sha256":"2d86843482f5d409396bb4e1c399885f5143e7cf319f2dc3becd07b62253e91b"}}