{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WET2MZQUIRAH4IP7M2PUUZGHZA","short_pith_number":"pith:WET2MZQU","canonical_record":{"source":{"id":"1302.3579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:14:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b65bc18912ae32353d7e7e2452341602ff66e5d16963527bb5ee800c1294dccc","abstract_canon_sha256":"757c382da5e46c55b8cfaf13b56442e4ec9749400289a2ba13054a8b38d9dbd5"},"schema_version":"1.0"},"canonical_sha256":"b127a6661444407e21ff669f4a64c7c81a62d76d8d215e0e1618f1f659a412fd","source":{"kind":"arxiv","id":"1302.3579","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3579","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3579v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3579","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"WET2MZQUIRAH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WET2MZQUIRAH4IP7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WET2MZQU","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WET2MZQUIRAH4IP7M2PUUZGHZA","target":"record","payload":{"canonical_record":{"source":{"id":"1302.3579","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:14:13Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"b65bc18912ae32353d7e7e2452341602ff66e5d16963527bb5ee800c1294dccc","abstract_canon_sha256":"757c382da5e46c55b8cfaf13b56442e4ec9749400289a2ba13054a8b38d9dbd5"},"schema_version":"1.0"},"canonical_sha256":"b127a6661444407e21ff669f4a64c7c81a62d76d8d215e0e1618f1f659a412fd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:36.688996Z","signature_b64":"yIy9ezVp0MhF/8rP7oEyNfxQCs4KbtILNsSayv/z0CipUEkq51eDFAOyy7Gt89Ov9M7UZuewiup6MR+f/HuwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b127a6661444407e21ff669f4a64c7c81a62d76d8d215e0e1618f1f659a412fd","last_reissued_at":"2026-05-18T03:33:36.688228Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:36.688228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1302.3579","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/AT7gmjXBT1E8zC14shv99DjuvvStq9UDw/5Fo6dWXaJu4NMA7appn8m6NDC7Qt5/cY4kuBzcVwF1h8MQhIVAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:58:24.270196Z"},"content_sha256":"ba5d49dcc6261687115f2b151988d7d4face87b7901fd3c98c665c2f71e4e9d2","schema_version":"1.0","event_id":"sha256:ba5d49dcc6261687115f2b151988d7d4face87b7901fd3c98c665c2f71e4e9d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WET2MZQUIRAH4IP7M2PUUZGHZA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Sample Complexity of Learning Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Nir Friedman, Zohar Yakhini","submitted_at":"2013-02-13T14:14:13Z","abstract_excerpt":"In recent years there has been an increasing interest in learning Bayesian networks from data.  One of the most effective methods for learning such networks is based on the minimum description length (MDL) principle.  Previous work has shown that this learning procedure is asymptotically successful: with probability one, it will converge to the target distribution, given a sufficient number of samples.  However, the rate of this convergence has been hitherto unknown.  In this work we examine the sample complexity of MDL based learning procedures for Bayesian networks.  We show that the number "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3579","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:33:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fHS7RadQjMHaWRgek+kCb1wnCWRYwEx3INWwZmm6Co71GNhbbenrm1/yaTXxZg2QU0arZD8WKTkcS40I1AznCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T11:58:24.270559Z"},"content_sha256":"4682430099126b8cbfe24900b74b0df38ef100c9d648126512c1d93bcfca1399","schema_version":"1.0","event_id":"sha256:4682430099126b8cbfe24900b74b0df38ef100c9d648126512c1d93bcfca1399"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/bundle.json","state_url":"https://pith.science/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/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-30T11:58:24Z","links":{"resolver":"https://pith.science/pith/WET2MZQUIRAH4IP7M2PUUZGHZA","bundle":"https://pith.science/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/bundle.json","state":"https://pith.science/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WET2MZQUIRAH4IP7M2PUUZGHZA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WET2MZQUIRAH4IP7M2PUUZGHZA","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":"757c382da5e46c55b8cfaf13b56442e4ec9749400289a2ba13054a8b38d9dbd5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:14:13Z","title_canon_sha256":"b65bc18912ae32353d7e7e2452341602ff66e5d16963527bb5ee800c1294dccc"},"schema_version":"1.0","source":{"id":"1302.3579","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1302.3579","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"arxiv_version","alias_value":"1302.3579v1","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3579","created_at":"2026-05-18T03:33:36Z"},{"alias_kind":"pith_short_12","alias_value":"WET2MZQUIRAH","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WET2MZQUIRAH4IP7","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WET2MZQU","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:4682430099126b8cbfe24900b74b0df38ef100c9d648126512c1d93bcfca1399","target":"graph","created_at":"2026-05-18T03:33:36Z","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 an increasing interest in learning Bayesian networks from data.  One of the most effective methods for learning such networks is based on the minimum description length (MDL) principle.  Previous work has shown that this learning procedure is asymptotically successful: with probability one, it will converge to the target distribution, given a sufficient number of samples.  However, the rate of this convergence has been hitherto unknown.  In this work we examine the sample complexity of MDL based learning procedures for Bayesian networks.  We show that the number ","authors_text":"Nir Friedman, Zohar Yakhini","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:14:13Z","title":"On the Sample Complexity of Learning Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3579","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:ba5d49dcc6261687115f2b151988d7d4face87b7901fd3c98c665c2f71e4e9d2","target":"record","created_at":"2026-05-18T03:33:36Z","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":"757c382da5e46c55b8cfaf13b56442e4ec9749400289a2ba13054a8b38d9dbd5","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2013-02-13T14:14:13Z","title_canon_sha256":"b65bc18912ae32353d7e7e2452341602ff66e5d16963527bb5ee800c1294dccc"},"schema_version":"1.0","source":{"id":"1302.3579","kind":"arxiv","version":1}},"canonical_sha256":"b127a6661444407e21ff669f4a64c7c81a62d76d8d215e0e1618f1f659a412fd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b127a6661444407e21ff669f4a64c7c81a62d76d8d215e0e1618f1f659a412fd","first_computed_at":"2026-05-18T03:33:36.688228Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:36.688228Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yIy9ezVp0MhF/8rP7oEyNfxQCs4KbtILNsSayv/z0CipUEkq51eDFAOyy7Gt89Ov9M7UZuewiup6MR+f/HuwBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:36.688996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1302.3579","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ba5d49dcc6261687115f2b151988d7d4face87b7901fd3c98c665c2f71e4e9d2","sha256:4682430099126b8cbfe24900b74b0df38ef100c9d648126512c1d93bcfca1399"],"state_sha256":"91239a98abf34b2eef7408217be50897df73d215444869556c78361ab53ae82c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Pxzoh8FPd/UQDGLrJRtJMZP4Jv/sg5FCknp/yNg8VsPhTqhRRCwtXDygKDv9NnIBIko1F48dnx4RY/cA6IeqAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T11:58:24.272383Z","bundle_sha256":"1b51448c32046bdbd9c0ad9e5ccb3e57ef5d63e3f3ad4a6223b3106a350cf4f5"}}