{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:SDGLBDQIZAVTB7Y6QWVPHW3VCP","short_pith_number":"pith:SDGLBDQI","canonical_record":{"source":{"id":"1302.3567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:13:03Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"60bf2f07dee1bb10bc8d592b9e2391eea1ea3a66aa69d3738f63af532567b890","abstract_canon_sha256":"2ee54268ad67f02ad764e659fc4f5148a92c912f656a6f12bcc0208ef718ebc3"},"schema_version":"1.0"},"canonical_sha256":"90ccb08e08c82b30ff1e85aaf3db7513cd6dd4f789677186432a0b1fdf5bde22","source":{"kind":"arxiv","id":"1302.3567","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3567","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3567v2","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3567","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"SDGLBDQIZAVT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SDGLBDQIZAVTB7Y6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SDGLBDQI","created_at":"2026-05-18T12:27:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:SDGLBDQIZAVTB7Y6QWVPHW3VCP","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3567","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:13:03Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"60bf2f07dee1bb10bc8d592b9e2391eea1ea3a66aa69d3738f63af532567b890","abstract_canon_sha256":"2ee54268ad67f02ad764e659fc4f5148a92c912f656a6f12bcc0208ef718ebc3"},"schema_version":"1.0"},"canonical_sha256":"90ccb08e08c82b30ff1e85aaf3db7513cd6dd4f789677186432a0b1fdf5bde22","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:07:32.392960Z","signature_b64":"SDEucwnbcQmZ+OywdPDapM6FVSCMsMFkODDT0pyD1TCsfoOVsIoXg10EuxP78lRhl0ug63bDejMxT/9+UwEJBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90ccb08e08c82b30ff1e85aaf3db7513cd6dd4f789677186432a0b1fdf5bde22","last_reissued_at":"2026-05-18T02:07:32.392295Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:07:32.392295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3567","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-18T02:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LKDIKa/E+Ul7RjnppF8R4AuPnkBEZ5PrigN1c3LXTnRUqGDSiZZlSQI3rX5wf+b9Wc1ozqpNFSPKkBHIY+sGBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:44:18.914292Z"},"content_sha256":"34e91f0b5cb99f7e0378714c35e3817ed2512dd5b8855e593d2cb681d7dd4fca","schema_version":"1.0","event_id":"sha256:34e91f0b5cb99f7e0378714c35e3817ed2512dd5b8855e593d2cb681d7dd4fca"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:SDGLBDQIZAVTB7Y6QWVPHW3VCP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"David Heckerman, David Maxwell Chickering","submitted_at":"2013-02-13T14:13:03Z","abstract_excerpt":"We discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomplete data given a Bayesian network. We consider the Laplace approximation and the less accurate but more efficient BIC/MDL approximation. We also consider approximations proposed by Draper (1993) and Cheeseman and Stutz (1995). These approximations are as efficient as BIC/MDL, but their accuracy has not been studied in any depth. We compare the accuracy of these approximations under the assumption that the Laplace app"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3567","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-18T02:07:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ejfBOSENbgspbpfSQHqZAzlBamiz4ET2PWRPtFvW3+v37bXOISF8v6GNvCRbTc+0pWdmVE63hhwWLoCB+aaFDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T15:44:18.915119Z"},"content_sha256":"13edc98d17ab3bf8af5a954f236c560dac1e21c85face52e415a830b36b6212f","schema_version":"1.0","event_id":"sha256:13edc98d17ab3bf8af5a954f236c560dac1e21c85face52e415a830b36b6212f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/bundle.json","state_url":"https://pith.science/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/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-30T15:44:18Z","links":{"resolver":"https://pith.science/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP","bundle":"https://pith.science/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/bundle.json","state":"https://pith.science/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SDGLBDQIZAVTB7Y6QWVPHW3VCP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:SDGLBDQIZAVTB7Y6QWVPHW3VCP","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":"2ee54268ad67f02ad764e659fc4f5148a92c912f656a6f12bcc0208ef718ebc3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:13:03Z","title_canon_sha256":"60bf2f07dee1bb10bc8d592b9e2391eea1ea3a66aa69d3738f63af532567b890"},"schema_version":"1.0","source":{"id":"1302.3567","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3567","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3567v2","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3567","created_at":"2026-05-18T02:07:32Z"},{"alias_kind":"pith_short_12","alias_value":"SDGLBDQIZAVT","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_16","alias_value":"SDGLBDQIZAVTB7Y6","created_at":"2026-05-18T12:27:59Z"},{"alias_kind":"pith_short_8","alias_value":"SDGLBDQI","created_at":"2026-05-18T12:27:59Z"}],"graph_snapshots":[{"event_id":"sha256:13edc98d17ab3bf8af5a954f236c560dac1e21c85face52e415a830b36b6212f","target":"graph","created_at":"2026-05-18T02:07:32Z","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 discuss Bayesian methods for learning Bayesian networks when data sets are incomplete. In particular, we examine asymptotic approximations for the marginal likelihood of incomplete data given a Bayesian network. We consider the Laplace approximation and the less accurate but more efficient BIC/MDL approximation. We also consider approximations proposed by Draper (1993) and Cheeseman and Stutz (1995). These approximations are as efficient as BIC/MDL, but their accuracy has not been studied in any depth. We compare the accuracy of these approximations under the assumption that the Laplace app","authors_text":"David Heckerman, David Maxwell Chickering","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:13:03Z","title":"Efficient Approximations for the Marginal Likelihood of Incomplete Data Given a Bayesian Network"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3567","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:34e91f0b5cb99f7e0378714c35e3817ed2512dd5b8855e593d2cb681d7dd4fca","target":"record","created_at":"2026-05-18T02:07:32Z","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":"2ee54268ad67f02ad764e659fc4f5148a92c912f656a6f12bcc0208ef718ebc3","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:13:03Z","title_canon_sha256":"60bf2f07dee1bb10bc8d592b9e2391eea1ea3a66aa69d3738f63af532567b890"},"schema_version":"1.0","source":{"id":"1302.3567","kind":"arxiv","version":2}},"canonical_sha256":"90ccb08e08c82b30ff1e85aaf3db7513cd6dd4f789677186432a0b1fdf5bde22","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"90ccb08e08c82b30ff1e85aaf3db7513cd6dd4f789677186432a0b1fdf5bde22","first_computed_at":"2026-05-18T02:07:32.392295Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:07:32.392295Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SDEucwnbcQmZ+OywdPDapM6FVSCMsMFkODDT0pyD1TCsfoOVsIoXg10EuxP78lRhl0ug63bDejMxT/9+UwEJBw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:07:32.392960Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3567","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:34e91f0b5cb99f7e0378714c35e3817ed2512dd5b8855e593d2cb681d7dd4fca","sha256:13edc98d17ab3bf8af5a954f236c560dac1e21c85face52e415a830b36b6212f"],"state_sha256":"b00617966773a3a2958f8153ce2d27783f544d6f56fbe3362848a4114b903a87"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3BTSY907aQul2rfVr/YYMdl6jNx7YmopQIejhVxnjOJwPn2WqiUSutAfnetZdJLbDKejw4pNIDG3WfpncMDMAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T15:44:18.918828Z","bundle_sha256":"c187017106ad19d1a6e9b2091149ad69a9c9904513eb70c3a1a90431c64226f3"}}