{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:VL63IJYKQQL25YNQECG4UGQGLP","short_pith_number":"pith:VL63IJYK","canonical_record":{"source":{"id":"1301.0561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"9261c92eabd893c7065bcc42fa6521aafaab6e967d650bdc06643351f12edfcf","abstract_canon_sha256":"b2b9699774815e1e3022fee19782a00204eb6d9d621715e6aaac049e2cff8b80"},"schema_version":"1.0"},"canonical_sha256":"aafdb4270a8417aee1b0208dca1a065bf541fd281f8022b8fd14c9dfb67a6457","source":{"kind":"arxiv","id":"1301.0561","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0561","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0561v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0561","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"VL63IJYKQQL2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VL63IJYKQQL25YNQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VL63IJYK","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:VL63IJYKQQL25YNQECG4UGQGLP","target":"record","payload":{"canonical_record":{"source":{"id":"1301.0561","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:46Z","cross_cats_sorted":[],"title_canon_sha256":"9261c92eabd893c7065bcc42fa6521aafaab6e967d650bdc06643351f12edfcf","abstract_canon_sha256":"b2b9699774815e1e3022fee19782a00204eb6d9d621715e6aaac049e2cff8b80"},"schema_version":"1.0"},"canonical_sha256":"aafdb4270a8417aee1b0208dca1a065bf541fd281f8022b8fd14c9dfb67a6457","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:18.544401Z","signature_b64":"cdw3r45uDP0nZo8Gry8VsUmwFDTWhwrN1k3qVP/55E3PgwMmvDD2HIMKHIs7f2Ik2rU9xXN8JjpMjaFvjXffDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aafdb4270a8417aee1b0208dca1a065bf541fd281f8022b8fd14c9dfb67a6457","last_reissued_at":"2026-05-18T03:37:18.543885Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:18.543885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1301.0561","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iJ01N+bE42Y1iIqWMhDAxu85NN6XgEOyqqyXxVsi5b1WSw+15SNzUurX2BHrcgism8fpln1dNxZWrN95OvtzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:06.228065Z"},"content_sha256":"1286865b36c0dcce36baacaf8b0cfc468acb5c283888e469d6a22f98e57018c4","schema_version":"1.0","event_id":"sha256:1286865b36c0dcce36baacaf8b0cfc468acb5c283888e469d6a22f98e57018c4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:VL63IJYKQQL25YNQECG4UGQGLP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Optimal Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Christopher Meek, David Maxwell Chickering","submitted_at":"2012-12-12T15:55:46Z","abstract_excerpt":"In this paper, we derive optimality results for greedy Bayesian-network search algorithms that perform single-edge modifications at each step and use asymptotically consistent scoring criteria. Our results extend those of Meek (1997) and Chickering (2002), who demonstrate that in the limit of large datasets, if the generative distribution is perfect with respect to a DAG defined over the observable variables, such search algorithms will identify this optimal (i.e. generative) DAG model. We relax their assumption about the generative distribution, and assume only that this distribution satisfie"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0561","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:37:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tJUHB1BcRFy7NjWKr0P1pOZ5QwO/H7TTx3Dsp32EkYCaLWH7GDuXnbzNUd3+q8Uht9RISl8pGxyrR/BFZfRSBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T02:17:06.228428Z"},"content_sha256":"273fcff67d543e1146b68322c352691fe7006e6d571b52627565e7e78374d6cb","schema_version":"1.0","event_id":"sha256:273fcff67d543e1146b68322c352691fe7006e6d571b52627565e7e78374d6cb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VL63IJYKQQL25YNQECG4UGQGLP/bundle.json","state_url":"https://pith.science/pith/VL63IJYKQQL25YNQECG4UGQGLP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VL63IJYKQQL25YNQECG4UGQGLP/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-30T02:17:06Z","links":{"resolver":"https://pith.science/pith/VL63IJYKQQL25YNQECG4UGQGLP","bundle":"https://pith.science/pith/VL63IJYKQQL25YNQECG4UGQGLP/bundle.json","state":"https://pith.science/pith/VL63IJYKQQL25YNQECG4UGQGLP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VL63IJYKQQL25YNQECG4UGQGLP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:VL63IJYKQQL25YNQECG4UGQGLP","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":"b2b9699774815e1e3022fee19782a00204eb6d9d621715e6aaac049e2cff8b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:46Z","title_canon_sha256":"9261c92eabd893c7065bcc42fa6521aafaab6e967d650bdc06643351f12edfcf"},"schema_version":"1.0","source":{"id":"1301.0561","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1301.0561","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"arxiv_version","alias_value":"1301.0561v1","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0561","created_at":"2026-05-18T03:37:18Z"},{"alias_kind":"pith_short_12","alias_value":"VL63IJYKQQL2","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"VL63IJYKQQL25YNQ","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"VL63IJYK","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:273fcff67d543e1146b68322c352691fe7006e6d571b52627565e7e78374d6cb","target":"graph","created_at":"2026-05-18T03:37:18Z","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 this paper, we derive optimality results for greedy Bayesian-network search algorithms that perform single-edge modifications at each step and use asymptotically consistent scoring criteria. Our results extend those of Meek (1997) and Chickering (2002), who demonstrate that in the limit of large datasets, if the generative distribution is perfect with respect to a DAG defined over the observable variables, such search algorithms will identify this optimal (i.e. generative) DAG model. We relax their assumption about the generative distribution, and assume only that this distribution satisfie","authors_text":"Christopher Meek, David Maxwell Chickering","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:46Z","title":"Finding Optimal Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0561","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:1286865b36c0dcce36baacaf8b0cfc468acb5c283888e469d6a22f98e57018c4","target":"record","created_at":"2026-05-18T03:37:18Z","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":"b2b9699774815e1e3022fee19782a00204eb6d9d621715e6aaac049e2cff8b80","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-12-12T15:55:46Z","title_canon_sha256":"9261c92eabd893c7065bcc42fa6521aafaab6e967d650bdc06643351f12edfcf"},"schema_version":"1.0","source":{"id":"1301.0561","kind":"arxiv","version":1}},"canonical_sha256":"aafdb4270a8417aee1b0208dca1a065bf541fd281f8022b8fd14c9dfb67a6457","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"aafdb4270a8417aee1b0208dca1a065bf541fd281f8022b8fd14c9dfb67a6457","first_computed_at":"2026-05-18T03:37:18.543885Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:18.543885Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cdw3r45uDP0nZo8Gry8VsUmwFDTWhwrN1k3qVP/55E3PgwMmvDD2HIMKHIs7f2Ik2rU9xXN8JjpMjaFvjXffDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:18.544401Z","signed_message":"canonical_sha256_bytes"},"source_id":"1301.0561","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1286865b36c0dcce36baacaf8b0cfc468acb5c283888e469d6a22f98e57018c4","sha256:273fcff67d543e1146b68322c352691fe7006e6d571b52627565e7e78374d6cb"],"state_sha256":"555b17e05aa78e0c4e73853204166d1ff4c2b74a310b37b4a0f74e9cc43cb080"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ucvOEl+pTnQ3d0zEcKjHZbMTyZFleK4SkRLcjGGg6YlhY2yjiYWDE+jELa9l+9TD+0oBgDayb7Z3G3NocghqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T02:17:06.230895Z","bundle_sha256":"c450e818fb4cccdd6c0ce5f4ae4fd63f102cf8afbbd0dcb74923bb41db2e9b3b"}}