{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5DC4YPVXHCAWQQEITGC2YANYYJ","short_pith_number":"pith:5DC4YPVX","canonical_record":{"source":{"id":"1802.02468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T15:09:32Z","cross_cats_sorted":[],"title_canon_sha256":"48fd55ecd152307e6d7057088bcfa32701e7ddc5a8b15694d8568750d408d746","abstract_canon_sha256":"716fce66549aae4c548f99515920d1c08b4ac8bda9dccc76dccc3b2d74f63181"},"schema_version":"1.0"},"canonical_sha256":"e8c5cc3eb738816840889985ac01b8c2663d18e424c8172288bf0a184d7f4aa8","source":{"kind":"arxiv","id":"1802.02468","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02468","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02468v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02468","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"5DC4YPVXHCAW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5DC4YPVXHCAWQQEI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5DC4YPVX","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5DC4YPVXHCAWQQEITGC2YANYYJ","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02468","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T15:09:32Z","cross_cats_sorted":[],"title_canon_sha256":"48fd55ecd152307e6d7057088bcfa32701e7ddc5a8b15694d8568750d408d746","abstract_canon_sha256":"716fce66549aae4c548f99515920d1c08b4ac8bda9dccc76dccc3b2d74f63181"},"schema_version":"1.0"},"canonical_sha256":"e8c5cc3eb738816840889985ac01b8c2663d18e424c8172288bf0a184d7f4aa8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:08.189309Z","signature_b64":"luqrq3LQSEiXjbFg6K4Jcr+shZOJO5nVVef9VPdNuc0cCtdk9R2049YKp6IXQNIJuLd7AGjglcv00pChjpD9Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e8c5cc3eb738816840889985ac01b8c2663d18e424c8172288bf0a184d7f4aa8","last_reissued_at":"2026-05-18T00:24:08.188618Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:08.188618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02468","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-18T00:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5CfEYkWH0ixdNLkOVV0DhgkSuc/Db/dAXn3B8xX2F1LlEbTxyhK3R1iaH0xo7rd1K7rXxsIvfcc+H5NdtEvqAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:52:32.237770Z"},"content_sha256":"fc6b52e25fc3d8e8a99da61310a49b724785ed3081d1b1b7d481e4f738e311b1","schema_version":"1.0","event_id":"sha256:fc6b52e25fc3d8e8a99da61310a49b724785ed3081d1b1b7d481e4f738e311b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5DC4YPVXHCAWQQEITGC2YANYYJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Giorgio Corani, Jaemin Yoo, Marco Zaffalon, Mauro Scanagatta, U Kang","submitted_at":"2018-02-07T15:09:32Z","abstract_excerpt":"Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, which scales up to thousands of variables. Through extensive experiments we show that it consistently yields higher-scoring structures than its competitors on complete data sets. We then consider the problem of structure learning from incomplete data sets. This can be addressed by structural EM, which however is computationally very demanding. We thus adopt the novel k-MAX algorithm in the maximization step of structu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02468","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-18T00:24:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"My2PpAeVGhuEG9i/U9Ofpy39T2FzDaubi9v+Nc2OxCj45KkC7YSp6YnOgHDvJqtgCJbXC6/JbGG7WO5lQLGoCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T08:52:32.238158Z"},"content_sha256":"e6ffa6ff6dd8f190692a2fca6c4c303e2874eb5cfee6d705aae3fbad8c0fb89e","schema_version":"1.0","event_id":"sha256:e6ffa6ff6dd8f190692a2fca6c4c303e2874eb5cfee6d705aae3fbad8c0fb89e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/bundle.json","state_url":"https://pith.science/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/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-05-27T08:52:32Z","links":{"resolver":"https://pith.science/pith/5DC4YPVXHCAWQQEITGC2YANYYJ","bundle":"https://pith.science/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/bundle.json","state":"https://pith.science/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5DC4YPVXHCAWQQEITGC2YANYYJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5DC4YPVXHCAWQQEITGC2YANYYJ","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":"716fce66549aae4c548f99515920d1c08b4ac8bda9dccc76dccc3b2d74f63181","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T15:09:32Z","title_canon_sha256":"48fd55ecd152307e6d7057088bcfa32701e7ddc5a8b15694d8568750d408d746"},"schema_version":"1.0","source":{"id":"1802.02468","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02468","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02468v1","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02468","created_at":"2026-05-18T00:24:08Z"},{"alias_kind":"pith_short_12","alias_value":"5DC4YPVXHCAW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5DC4YPVXHCAWQQEI","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5DC4YPVX","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:e6ffa6ff6dd8f190692a2fca6c4c303e2874eb5cfee6d705aae3fbad8c0fb89e","target":"graph","created_at":"2026-05-18T00:24:08Z","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":"Learning a Bayesian networks with bounded treewidth is important for reducing the complexity of the inferences. We present a novel anytime algorithm (k-MAX) method for this task, which scales up to thousands of variables. Through extensive experiments we show that it consistently yields higher-scoring structures than its competitors on complete data sets. We then consider the problem of structure learning from incomplete data sets. This can be addressed by structural EM, which however is computationally very demanding. We thus adopt the novel k-MAX algorithm in the maximization step of structu","authors_text":"Giorgio Corani, Jaemin Yoo, Marco Zaffalon, Mauro Scanagatta, U Kang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T15:09:32Z","title":"Efficient Learning of Bounded-Treewidth Bayesian Networks from Complete and Incomplete Data Sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02468","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:fc6b52e25fc3d8e8a99da61310a49b724785ed3081d1b1b7d481e4f738e311b1","target":"record","created_at":"2026-05-18T00:24:08Z","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":"716fce66549aae4c548f99515920d1c08b4ac8bda9dccc76dccc3b2d74f63181","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.AI","submitted_at":"2018-02-07T15:09:32Z","title_canon_sha256":"48fd55ecd152307e6d7057088bcfa32701e7ddc5a8b15694d8568750d408d746"},"schema_version":"1.0","source":{"id":"1802.02468","kind":"arxiv","version":1}},"canonical_sha256":"e8c5cc3eb738816840889985ac01b8c2663d18e424c8172288bf0a184d7f4aa8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e8c5cc3eb738816840889985ac01b8c2663d18e424c8172288bf0a184d7f4aa8","first_computed_at":"2026-05-18T00:24:08.188618Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:08.188618Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"luqrq3LQSEiXjbFg6K4Jcr+shZOJO5nVVef9VPdNuc0cCtdk9R2049YKp6IXQNIJuLd7AGjglcv00pChjpD9Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:08.189309Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02468","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fc6b52e25fc3d8e8a99da61310a49b724785ed3081d1b1b7d481e4f738e311b1","sha256:e6ffa6ff6dd8f190692a2fca6c4c303e2874eb5cfee6d705aae3fbad8c0fb89e"],"state_sha256":"cf97fb8e03e75c78b96c53546fd01dc96545115cc72ba0724f2b997519f0ffcc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KkwV3ndSlCGnMeRxY1ecmbj7b55GKYwTuBwZkjFII9G7CI23tOLSE4dRJnXCaxpprsjC+HwJHVRgK8q243aKAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T08:52:32.240712Z","bundle_sha256":"f220e78af33938e5b793bcf3918a8f34cf1275134d54adb01458d438358f59de"}}