{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:NOCZGVVAWKWENRQVE5NK5MHZMI","short_pith_number":"pith:NOCZGVVA","canonical_record":{"source":{"id":"1608.07734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-27T18:41:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3441e88a1100d45b14edde495bda73d839390b8d4bd77b0c5cceb614fd74d493","abstract_canon_sha256":"299b57da549e0247e0250451325c96d88f2d3218b2bb9b99909e7aa4dfb1aef9"},"schema_version":"1.0"},"canonical_sha256":"6b859356a0b2ac46c615275aaeb0f9622505729fc21aad9f6fea3b7d6fd0c550","source":{"kind":"arxiv","id":"1608.07734","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07734","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07734v2","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07734","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"NOCZGVVAWKWE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NOCZGVVAWKWENRQV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NOCZGVVA","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:NOCZGVVAWKWENRQVE5NK5MHZMI","target":"record","payload":{"canonical_record":{"source":{"id":"1608.07734","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-27T18:41:47Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"3441e88a1100d45b14edde495bda73d839390b8d4bd77b0c5cceb614fd74d493","abstract_canon_sha256":"299b57da549e0247e0250451325c96d88f2d3218b2bb9b99909e7aa4dfb1aef9"},"schema_version":"1.0"},"canonical_sha256":"6b859356a0b2ac46c615275aaeb0f9622505729fc21aad9f6fea3b7d6fd0c550","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:57.700107Z","signature_b64":"r6OlXQSVdgTLBTVJ3BtLpkqQRnCuCaiZZQMJNovo5Pp2xtxz8y2vKQJRZ4i5K7V+moPx9UhoTwFIrpf/ycgtDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b859356a0b2ac46c615275aaeb0f9622505729fc21aad9f6fea3b7d6fd0c550","last_reissued_at":"2026-05-18T00:55:57.699642Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:57.699642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.07734","source_version":2,"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:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vX/1B0HSwk7YUQtUKLvIzXaBm7tHLc6/pWFv8vzBoybtyDM4k2Fvw3XEpI3E0/oiT+OWpn4gu4ooF+td2dyoCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:04.067107Z"},"content_sha256":"bfe831bddaad7705309f3f77199356358c421a9edfc9e4d3554f9dc250d89cba","schema_version":"1.0","event_id":"sha256:bfe831bddaad7705309f3f77199356358c421a9edfc9e4d3554f9dc250d89cba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:NOCZGVVAWKWENRQVE5NK5MHZMI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Learning Bayesian Networks with Incomplete Data by Augmentation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.AI","authors_text":"Cassio P. de Campos, Tameem Adel","submitted_at":"2016-08-27T18:41:47Z","abstract_excerpt":"We present new algorithms for learning Bayesian networks from data with missing values using a data augmentation approach. An exact Bayesian network learning algorithm is obtained by recasting the problem into a standard Bayesian network learning problem without missing data. To the best of our knowledge, this is the first exact algorithm for this problem. As expected, the exact algorithm does not scale to large domains. We build on the exact method to create an approximate algorithm using a hill-climbing technique. This algorithm scales to large domains so long as a suitable standard structur"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07734","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":""},"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:55:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FSW75DhAvcRKcn6ADRssJGLnnG+faAweinr1n+hFuBXj0djscdDYJPx247Yhs886ut7ykGb2WjnK3pSmfcoBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T18:04:04.067617Z"},"content_sha256":"828e6b9776f982fb97c4501a711cb2bd81e194f00fb790c1424f9204f8318aff","schema_version":"1.0","event_id":"sha256:828e6b9776f982fb97c4501a711cb2bd81e194f00fb790c1424f9204f8318aff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/bundle.json","state_url":"https://pith.science/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/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-30T18:04:04Z","links":{"resolver":"https://pith.science/pith/NOCZGVVAWKWENRQVE5NK5MHZMI","bundle":"https://pith.science/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/bundle.json","state":"https://pith.science/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NOCZGVVAWKWENRQVE5NK5MHZMI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:NOCZGVVAWKWENRQVE5NK5MHZMI","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":"299b57da549e0247e0250451325c96d88f2d3218b2bb9b99909e7aa4dfb1aef9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-27T18:41:47Z","title_canon_sha256":"3441e88a1100d45b14edde495bda73d839390b8d4bd77b0c5cceb614fd74d493"},"schema_version":"1.0","source":{"id":"1608.07734","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.07734","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"arxiv_version","alias_value":"1608.07734v2","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.07734","created_at":"2026-05-18T00:55:57Z"},{"alias_kind":"pith_short_12","alias_value":"NOCZGVVAWKWE","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"NOCZGVVAWKWENRQV","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"NOCZGVVA","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:828e6b9776f982fb97c4501a711cb2bd81e194f00fb790c1424f9204f8318aff","target":"graph","created_at":"2026-05-18T00:55:57Z","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":"We present new algorithms for learning Bayesian networks from data with missing values using a data augmentation approach. An exact Bayesian network learning algorithm is obtained by recasting the problem into a standard Bayesian network learning problem without missing data. To the best of our knowledge, this is the first exact algorithm for this problem. As expected, the exact algorithm does not scale to large domains. We build on the exact method to create an approximate algorithm using a hill-climbing technique. This algorithm scales to large domains so long as a suitable standard structur","authors_text":"Cassio P. de Campos, Tameem Adel","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-27T18:41:47Z","title":"Learning Bayesian Networks with Incomplete Data by Augmentation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.07734","kind":"arxiv","version":2},"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:bfe831bddaad7705309f3f77199356358c421a9edfc9e4d3554f9dc250d89cba","target":"record","created_at":"2026-05-18T00:55:57Z","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":"299b57da549e0247e0250451325c96d88f2d3218b2bb9b99909e7aa4dfb1aef9","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-08-27T18:41:47Z","title_canon_sha256":"3441e88a1100d45b14edde495bda73d839390b8d4bd77b0c5cceb614fd74d493"},"schema_version":"1.0","source":{"id":"1608.07734","kind":"arxiv","version":2}},"canonical_sha256":"6b859356a0b2ac46c615275aaeb0f9622505729fc21aad9f6fea3b7d6fd0c550","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b859356a0b2ac46c615275aaeb0f9622505729fc21aad9f6fea3b7d6fd0c550","first_computed_at":"2026-05-18T00:55:57.699642Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:57.699642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6OlXQSVdgTLBTVJ3BtLpkqQRnCuCaiZZQMJNovo5Pp2xtxz8y2vKQJRZ4i5K7V+moPx9UhoTwFIrpf/ycgtDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:57.700107Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.07734","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bfe831bddaad7705309f3f77199356358c421a9edfc9e4d3554f9dc250d89cba","sha256:828e6b9776f982fb97c4501a711cb2bd81e194f00fb790c1424f9204f8318aff"],"state_sha256":"6ea95c2dcceb9700946aa4718e42ecb9a3d1a7efcf075d28f09b9327aac30ef1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+AwoA08ZNw4PRIxNpIG07LLUGcpqlH08Nj9Z9dtE3YRbx1inFlAqloVRSoMwYjYiBO20/00Dh/6B0jLLb6YgAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T18:04:04.071294Z","bundle_sha256":"8a26213837c4b20936a35effa4bc67ba27c042c1715a2332a8e28485192ce81f"}}