{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:ITY74W34U3CAVKEXKSVZ2SJBRZ","short_pith_number":"pith:ITY74W34","canonical_record":{"source":{"id":"1207.1429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-04T16:31:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"54fbb82fbb808d41a44592afed43f6233def161c2c62af23659aab03342ab732","abstract_canon_sha256":"22a186b80a2b7cb8fe8d109ee521e91c7ed7f1fd4220e0a1f0e5224aae401ab0"},"schema_version":"1.0"},"canonical_sha256":"44f1fe5b7ca6c40aa89754ab9d49218e7962de0e035f8cafa2162d0673cc3683","source":{"kind":"arxiv","id":"1207.1429","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1429","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1429v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1429","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"ITY74W34U3CA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ITY74W34U3CAVKEX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ITY74W34","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:ITY74W34U3CAVKEXKSVZ2SJBRZ","target":"record","payload":{"canonical_record":{"source":{"id":"1207.1429","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-04T16:31:04Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"54fbb82fbb808d41a44592afed43f6233def161c2c62af23659aab03342ab732","abstract_canon_sha256":"22a186b80a2b7cb8fe8d109ee521e91c7ed7f1fd4220e0a1f0e5224aae401ab0"},"schema_version":"1.0"},"canonical_sha256":"44f1fe5b7ca6c40aa89754ab9d49218e7962de0e035f8cafa2162d0673cc3683","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:51:37.090261Z","signature_b64":"gj6J4vfSw5P2soYKtSVmeJHaJuiRfdKC0G3+l4jLd6xkNVLLZNZsvKEqJPikBZUjX4eimJAu53jTFP/7ax1nAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44f1fe5b7ca6c40aa89754ab9d49218e7962de0e035f8cafa2162d0673cc3683","last_reissued_at":"2026-05-18T03:51:37.089821Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:51:37.089821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1207.1429","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PXxiOpGLR0nqGzBq8KuZDH5j0zpXG56VBxbwztK5h7kYL6z1e9Q5MNQArgncr4sXbW01FMSOraXEIykvfZsZDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:34:30.238930Z"},"content_sha256":"7c5f03e7d16ed2d412ef5fb848e7741e2196facd9b35f537d97035b9439c0439","schema_version":"1.0","event_id":"sha256:7c5f03e7d16ed2d412ef5fb848e7741e2196facd9b35f537d97035b9439c0439"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:ITY74W34U3CAVKEXKSVZ2SJBRZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ordering-Based Search: A Simple and Effective Algorithm for 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":"Daphne Koller, Marc Teyssier","submitted_at":"2012-07-04T16:31:04Z","abstract_excerpt":"One of the basic tasks for Bayesian networks (BNs) is that of learning a network structure from data. The BN-learning problem is NP-hard, so the standard solution is heuristic search. Many approaches have been proposed for this task, but only a very small number outperform the baseline of greedy hill-climbing with tabu lists; moreover, many of the proposed algorithms are quite complex and hard to implement. In this paper, we propose a very simple and easy-to-implement method for addressing this task. Our approach is based on the well-known fact that the best network (of bounded in-degree) cons"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1429","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:51:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBNgvUFRHrecHi6u9lYC/UBOJ2T8BrXW+mZBmiw/EYYft5unkwzvNLs0zo/DaCOibmCKqyTm9XaFI0agQTjOAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T15:34:30.239638Z"},"content_sha256":"353c9301910332f53da813c7640e62621dbe4a49d29e6e140717d11eceb9b2bc","schema_version":"1.0","event_id":"sha256:353c9301910332f53da813c7640e62621dbe4a49d29e6e140717d11eceb9b2bc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/bundle.json","state_url":"https://pith.science/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/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-06T15:34:30Z","links":{"resolver":"https://pith.science/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ","bundle":"https://pith.science/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/bundle.json","state":"https://pith.science/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ITY74W34U3CAVKEXKSVZ2SJBRZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:ITY74W34U3CAVKEXKSVZ2SJBRZ","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":"22a186b80a2b7cb8fe8d109ee521e91c7ed7f1fd4220e0a1f0e5224aae401ab0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-04T16:31:04Z","title_canon_sha256":"54fbb82fbb808d41a44592afed43f6233def161c2c62af23659aab03342ab732"},"schema_version":"1.0","source":{"id":"1207.1429","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1207.1429","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"arxiv_version","alias_value":"1207.1429v1","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1207.1429","created_at":"2026-05-18T03:51:37Z"},{"alias_kind":"pith_short_12","alias_value":"ITY74W34U3CA","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"ITY74W34U3CAVKEX","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"ITY74W34","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:353c9301910332f53da813c7640e62621dbe4a49d29e6e140717d11eceb9b2bc","target":"graph","created_at":"2026-05-18T03:51:37Z","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":"One of the basic tasks for Bayesian networks (BNs) is that of learning a network structure from data. The BN-learning problem is NP-hard, so the standard solution is heuristic search. Many approaches have been proposed for this task, but only a very small number outperform the baseline of greedy hill-climbing with tabu lists; moreover, many of the proposed algorithms are quite complex and hard to implement. In this paper, we propose a very simple and easy-to-implement method for addressing this task. Our approach is based on the well-known fact that the best network (of bounded in-degree) cons","authors_text":"Daphne Koller, Marc Teyssier","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-04T16:31:04Z","title":"Ordering-Based Search: A Simple and Effective Algorithm for Learning Bayesian Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1207.1429","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:7c5f03e7d16ed2d412ef5fb848e7741e2196facd9b35f537d97035b9439c0439","target":"record","created_at":"2026-05-18T03:51:37Z","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":"22a186b80a2b7cb8fe8d109ee521e91c7ed7f1fd4220e0a1f0e5224aae401ab0","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-07-04T16:31:04Z","title_canon_sha256":"54fbb82fbb808d41a44592afed43f6233def161c2c62af23659aab03342ab732"},"schema_version":"1.0","source":{"id":"1207.1429","kind":"arxiv","version":1}},"canonical_sha256":"44f1fe5b7ca6c40aa89754ab9d49218e7962de0e035f8cafa2162d0673cc3683","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"44f1fe5b7ca6c40aa89754ab9d49218e7962de0e035f8cafa2162d0673cc3683","first_computed_at":"2026-05-18T03:51:37.089821Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:51:37.089821Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gj6J4vfSw5P2soYKtSVmeJHaJuiRfdKC0G3+l4jLd6xkNVLLZNZsvKEqJPikBZUjX4eimJAu53jTFP/7ax1nAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:51:37.090261Z","signed_message":"canonical_sha256_bytes"},"source_id":"1207.1429","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7c5f03e7d16ed2d412ef5fb848e7741e2196facd9b35f537d97035b9439c0439","sha256:353c9301910332f53da813c7640e62621dbe4a49d29e6e140717d11eceb9b2bc"],"state_sha256":"b1c4fca81e26668986fa1d66dbaae0507e9227141eb5bed3fc22058db626e9bc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yCZwEpu4/bMWyGQTqHdy5XWzOT/r/SBMIj168qTP8BMas8GUcgxAGvyCCXmtcFqHAhQbcT3MIQx9YnPFt6P1Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T15:34:30.243326Z","bundle_sha256":"7370c42af0294816f4f83a890d8b779bce8981f14ef79b793494befdcbd88a9f"}}