{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HU2E6BW7NUEC3NJEIZWMNMM26I","short_pith_number":"pith:HU2E6BW7","canonical_record":{"source":{"id":"1301.7373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:03:37Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"bf17b9ac74b8d0e20ea05a95ee0d51968bc093ff0bfc499c3e4994ab753a069c","abstract_canon_sha256":"b0dcf6109556d053bc7fb54175ebfd114eb3afb6717765b7e51fff79aa466414"},"schema_version":"1.0"},"canonical_sha256":"3d344f06df6d082db524466cc6b19af20e78529a7de7146aa0227ec0f1b1ebcb","source":{"kind":"arxiv","id":"1301.7373","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7373","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7373v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7373","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"HU2E6BW7NUEC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HU2E6BW7NUEC3NJE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HU2E6BW7","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HU2E6BW7NUEC3NJEIZWMNMM26I","target":"record","payload":{"canonical_record":{"source":{"id":"1301.7373","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:03:37Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"bf17b9ac74b8d0e20ea05a95ee0d51968bc093ff0bfc499c3e4994ab753a069c","abstract_canon_sha256":"b0dcf6109556d053bc7fb54175ebfd114eb3afb6717765b7e51fff79aa466414"},"schema_version":"1.0"},"canonical_sha256":"3d344f06df6d082db524466cc6b19af20e78529a7de7146aa0227ec0f1b1ebcb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:35:00.244926Z","signature_b64":"HQoKVXXii3nCrBtawCHJzKqg7y4HXemv7NRbW/VBCLnmCKDmfQ9XqNr2vJvizX3IxHY8cy1C6Us3hPCYBAzQCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3d344f06df6d082db524466cc6b19af20e78529a7de7146aa0227ec0f1b1ebcb","last_reissued_at":"2026-05-18T03:35:00.244270Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:35:00.244270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.7373","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vhiSZuQX7pi+SN2SZjbwGZ5e2bWAA8o3Ty9mqgHb9RsSVMevjvFlL3TDuE9mlsATAXycYd1Y9RY1Qj1u4SsBDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:25:54.050388Z"},"content_sha256":"9df5cc59cf924cd4a84c618693c68d2702fd590e5ca94ee7083852ddb4e3693a","schema_version":"1.0","event_id":"sha256:9df5cc59cf924cd4a84c618693c68d2702fd590e5ca94ee7083852ddb4e3693a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HU2E6BW7NUEC3NJEIZWMNMM26I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Bayesian Structural EM Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Nir Friedman","submitted_at":"2013-01-30T15:03:37Z","abstract_excerpt":"In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a belief network from incomplete data- that is, in the presence of missing values or hidden variables. In a recent paper, I introduced an algorithm called Structural EM that combines the standard Expectation Maximization (EM) algorithm, which optimizes parameters, with structure search for model selection. That algorithm learns networks based on penalized likelihood scores, which include the BIC/MDL score and various approx"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7373","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:35:00Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tpUrGhAG1aeETRhbykV/KjZE3s2TNUNZ6RS6U0cLdhOMSYf1+cgZVh1Q7TeWJFrZ4pNZqLxSMi9CfMOXB4ecDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:25:54.050777Z"},"content_sha256":"31aa4e869abde3becf11dbec180fc7012ba1632788c243ba354f8cf2b7b8262f","schema_version":"1.0","event_id":"sha256:31aa4e869abde3becf11dbec180fc7012ba1632788c243ba354f8cf2b7b8262f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/bundle.json","state_url":"https://pith.science/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/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-26T21:25:54Z","links":{"resolver":"https://pith.science/pith/HU2E6BW7NUEC3NJEIZWMNMM26I","bundle":"https://pith.science/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/bundle.json","state":"https://pith.science/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HU2E6BW7NUEC3NJEIZWMNMM26I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HU2E6BW7NUEC3NJEIZWMNMM26I","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":"b0dcf6109556d053bc7fb54175ebfd114eb3afb6717765b7e51fff79aa466414","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:03:37Z","title_canon_sha256":"bf17b9ac74b8d0e20ea05a95ee0d51968bc093ff0bfc499c3e4994ab753a069c"},"schema_version":"1.0","source":{"id":"1301.7373","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.7373","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"arxiv_version","alias_value":"1301.7373v1","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.7373","created_at":"2026-05-18T03:35:00Z"},{"alias_kind":"pith_short_12","alias_value":"HU2E6BW7NUEC","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HU2E6BW7NUEC3NJE","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HU2E6BW7","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:31aa4e869abde3becf11dbec180fc7012ba1632788c243ba354f8cf2b7b8262f","target":"graph","created_at":"2026-05-18T03:35:00Z","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":"In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a belief network from incomplete data- that is, in the presence of missing values or hidden variables. In a recent paper, I introduced an algorithm called Structural EM that combines the standard Expectation Maximization (EM) algorithm, which optimizes parameters, with structure search for model selection. That algorithm learns networks based on penalized likelihood scores, which include the BIC/MDL score and various approx","authors_text":"Nir Friedman","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:03:37Z","title":"The Bayesian Structural EM Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.7373","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:9df5cc59cf924cd4a84c618693c68d2702fd590e5ca94ee7083852ddb4e3693a","target":"record","created_at":"2026-05-18T03:35:00Z","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":"b0dcf6109556d053bc7fb54175ebfd114eb3afb6717765b7e51fff79aa466414","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-01-30T15:03:37Z","title_canon_sha256":"bf17b9ac74b8d0e20ea05a95ee0d51968bc093ff0bfc499c3e4994ab753a069c"},"schema_version":"1.0","source":{"id":"1301.7373","kind":"arxiv","version":1}},"canonical_sha256":"3d344f06df6d082db524466cc6b19af20e78529a7de7146aa0227ec0f1b1ebcb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3d344f06df6d082db524466cc6b19af20e78529a7de7146aa0227ec0f1b1ebcb","first_computed_at":"2026-05-18T03:35:00.244270Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:35:00.244270Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HQoKVXXii3nCrBtawCHJzKqg7y4HXemv7NRbW/VBCLnmCKDmfQ9XqNr2vJvizX3IxHY8cy1C6Us3hPCYBAzQCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:35:00.244926Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.7373","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9df5cc59cf924cd4a84c618693c68d2702fd590e5ca94ee7083852ddb4e3693a","sha256:31aa4e869abde3becf11dbec180fc7012ba1632788c243ba354f8cf2b7b8262f"],"state_sha256":"c232b56a48816cbd9a33ca786637c7f0895a98cd20147f1684b826b5c4d59847"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qMiYOMQNufXdYP5Kblub2y+Xsj7H5b8o35B3+9g8cDIQH+Yz21C3EeRfqb3iEzseAz4OO02dz5Qa6HXGBNdiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:25:54.053539Z","bundle_sha256":"1c0f515042dee1d6860cc7d661c8748d1000a0d9ebdfb103cda590063473ebfe"}}