{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OSZVB77KBZYBF76L7TNLUJFOKN","short_pith_number":"pith:OSZVB77K","canonical_record":{"source":{"id":"1212.2500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:07:12Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9848f2b5f29f61790f0b24ea01fc30fe99f9a5e5eb41c1d78c232c4cc4d8888b","abstract_canon_sha256":"19f5bdf73dd06b719aee51ced18d548b75f7e2aee595121cb82011c8517c659d"},"schema_version":"1.0"},"canonical_sha256":"74b350ffea0e7012ffcbfcdaba24ae534916fa02817540ce75d54070ba1cbc06","source":{"kind":"arxiv","id":"1212.2500","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2500","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2500v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2500","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"OSZVB77KBZYB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OSZVB77KBZYBF76L","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OSZVB77K","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OSZVB77KBZYBF76L7TNLUJFOKN","target":"record","payload":{"canonical_record":{"source":{"id":"1212.2500","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:07:12Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"9848f2b5f29f61790f0b24ea01fc30fe99f9a5e5eb41c1d78c232c4cc4d8888b","abstract_canon_sha256":"19f5bdf73dd06b719aee51ced18d548b75f7e2aee595121cb82011c8517c659d"},"schema_version":"1.0"},"canonical_sha256":"74b350ffea0e7012ffcbfcdaba24ae534916fa02817540ce75d54070ba1cbc06","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:38:44.519700Z","signature_b64":"TREKKiiiBvivH1cuZ6dGp4jsaV/ICFlKcTo2Mi27gWpPut5z8V/Y6D0HhngblF24XbiCo3utSiTjLhO6sRnSAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74b350ffea0e7012ffcbfcdaba24ae534916fa02817540ce75d54070ba1cbc06","last_reissued_at":"2026-05-18T03:38:44.519070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:38:44.519070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.2500","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D4azC7THWxxv5cQns8KkrI0KGw08Chtr8vABf6uTd1ELaWSU1W/u6MDdE8QTFVloP2QbJRFl764NrrJpLEX2Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:55:19.796585Z"},"content_sha256":"b22a4358cece7eaa4bf6875bee213f65299de624f6daaa8cc88ef99e318817a7","schema_version":"1.0","event_id":"sha256:b22a4358cece7eaa4bf6875bee213f65299de624f6daaa8cc88ef99e318817a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OSZVB77KBZYBF76L7TNLUJFOKN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Local Optima in Learning Bayesian Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Jens D. Nielsen, Jose M. Pena, Tomas Kocka","submitted_at":"2012-10-19T15:07:12Z","abstract_excerpt":"This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES  asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported s"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2500","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:38:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UJEiYAiWwOr2KeY3pTONHZQ0OdG7aFb7HlhymLD8AyV1Bmn2YSWgEmspKrwR9T2znm9hwM+faokWn09FhhAzCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:55:19.796937Z"},"content_sha256":"9f160ad903c9aa2e06103d9abf64c623ab9e806c7f5d7102cbaa65dae740cee3","schema_version":"1.0","event_id":"sha256:9f160ad903c9aa2e06103d9abf64c623ab9e806c7f5d7102cbaa65dae740cee3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OSZVB77KBZYBF76L7TNLUJFOKN/bundle.json","state_url":"https://pith.science/pith/OSZVB77KBZYBF76L7TNLUJFOKN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OSZVB77KBZYBF76L7TNLUJFOKN/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-31T00:55:19Z","links":{"resolver":"https://pith.science/pith/OSZVB77KBZYBF76L7TNLUJFOKN","bundle":"https://pith.science/pith/OSZVB77KBZYBF76L7TNLUJFOKN/bundle.json","state":"https://pith.science/pith/OSZVB77KBZYBF76L7TNLUJFOKN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OSZVB77KBZYBF76L7TNLUJFOKN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OSZVB77KBZYBF76L7TNLUJFOKN","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":"19f5bdf73dd06b719aee51ced18d548b75f7e2aee595121cb82011c8517c659d","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:07:12Z","title_canon_sha256":"9848f2b5f29f61790f0b24ea01fc30fe99f9a5e5eb41c1d78c232c4cc4d8888b"},"schema_version":"1.0","source":{"id":"1212.2500","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.2500","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"arxiv_version","alias_value":"1212.2500v1","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2500","created_at":"2026-05-18T03:38:44Z"},{"alias_kind":"pith_short_12","alias_value":"OSZVB77KBZYB","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OSZVB77KBZYBF76L","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OSZVB77K","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:9f160ad903c9aa2e06103d9abf64c623ab9e806c7f5d7102cbaa65dae740cee3","target":"graph","created_at":"2026-05-18T03:38:44Z","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":"This paper proposes and evaluates the k-greedy equivalence search algorithm (KES) for learning Bayesian networks (BNs) from complete data. The main characteristic of KES is that it allows a trade-off between greediness and randomness, thus exploring different good local optima. When greediness is set at maximum, KES corresponds to the greedy equivalence search algorithm (GES). When greediness is kept at minimum, we prove that under mild assumptions KES  asymptotically returns any inclusion optimal BN with nonzero probability. Experimental results for both synthetic and real data are reported s","authors_text":"Jens D. Nielsen, Jose M. Pena, Tomas Kocka","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:07:12Z","title":"On Local Optima in Learning Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2500","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:b22a4358cece7eaa4bf6875bee213f65299de624f6daaa8cc88ef99e318817a7","target":"record","created_at":"2026-05-18T03:38:44Z","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":"19f5bdf73dd06b719aee51ced18d548b75f7e2aee595121cb82011c8517c659d","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-10-19T15:07:12Z","title_canon_sha256":"9848f2b5f29f61790f0b24ea01fc30fe99f9a5e5eb41c1d78c232c4cc4d8888b"},"schema_version":"1.0","source":{"id":"1212.2500","kind":"arxiv","version":1}},"canonical_sha256":"74b350ffea0e7012ffcbfcdaba24ae534916fa02817540ce75d54070ba1cbc06","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"74b350ffea0e7012ffcbfcdaba24ae534916fa02817540ce75d54070ba1cbc06","first_computed_at":"2026-05-18T03:38:44.519070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:38:44.519070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"TREKKiiiBvivH1cuZ6dGp4jsaV/ICFlKcTo2Mi27gWpPut5z8V/Y6D0HhngblF24XbiCo3utSiTjLhO6sRnSAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:38:44.519700Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.2500","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b22a4358cece7eaa4bf6875bee213f65299de624f6daaa8cc88ef99e318817a7","sha256:9f160ad903c9aa2e06103d9abf64c623ab9e806c7f5d7102cbaa65dae740cee3"],"state_sha256":"9f0cf6bb9870449219bd22b9ec2af23e184f1b3563224ddd7e1bbf249680642f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e5Cbwe2aHJEUps1sdbxQdL7ZxUFhuZIDse7pQAaVD+QOulgGkB3eFfz3dm6CjnuiOFEm9DVn5tQxXLSybcHtDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:55:19.799166Z","bundle_sha256":"0c64428464448905bc95804262ad86db71675f2509cd7c9f9058f72dd4611ee0"}}