{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:W62N55LGEM33GQY654KA7WKMAO","short_pith_number":"pith:W62N55LG","canonical_record":{"source":{"id":"1206.6875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"955c4ac059fa86f51bf13b0a5fe67a60b78c506a52a402b38e5cbad128b7a7bd","abstract_canon_sha256":"61c094c40f12d0d660cb25aaa9a9afa64f7d725619bfbce3a06d59104fdb6332"},"schema_version":"1.0"},"canonical_sha256":"b7b4def5662337b3431eef140fd94c039139665a709b922d8ce29096d4afee66","source":{"kind":"arxiv","id":"1206.6875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6875","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6875v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6875","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"W62N55LGEM33","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W62N55LGEM33GQY6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W62N55LG","created_at":"2026-05-18T12:27:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:W62N55LGEM33GQY654KA7WKMAO","target":"record","payload":{"canonical_record":{"source":{"id":"1206.6875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:30:42Z","cross_cats_sorted":[],"title_canon_sha256":"955c4ac059fa86f51bf13b0a5fe67a60b78c506a52a402b38e5cbad128b7a7bd","abstract_canon_sha256":"61c094c40f12d0d660cb25aaa9a9afa64f7d725619bfbce3a06d59104fdb6332"},"schema_version":"1.0"},"canonical_sha256":"b7b4def5662337b3431eef140fd94c039139665a709b922d8ce29096d4afee66","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:52:15.308417Z","signature_b64":"ioTwZN9GDyJ0QpAFgQ7EElcCLUojObbSm+Td0tUslD1hjw/W/262nXSKGAr+zpa0Yw9q7tlY1K66wM7gxQlqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b7b4def5662337b3431eef140fd94c039139665a709b922d8ce29096d4afee66","last_reissued_at":"2026-05-18T03:52:15.307721Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:52:15.307721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1206.6875","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1TeirIukbcnQUiypHIC+i912892g4dPqaCvx1bigjZExnBQRadtUkltrdnwLX1/ZzIoH+wF01cn7733kc3ncDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:41:37.024787Z"},"content_sha256":"8c5327a133e738fb83ddf101af432a5d6d05008c89295d578135f4a60684d084","schema_version":"1.0","event_id":"sha256:8c5327a133e738fb83ddf101af432a5d6d05008c89295d578135f4a60684d084"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:W62N55LGEM33GQY654KA7WKMAO","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A simple approach for finding the globally optimal Bayesian network structure","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Petri Myllymaki, Tomi Silander","submitted_at":"2012-06-27T16:30:42Z","abstract_excerpt":"We study the problem of learning the best Bayesian network structure with respect to a decomposable score such as BDe, BIC or AIC. This problem is known to be NP-hard, which means that solving it becomes quickly infeasible as the number of variables increases. Nevertheless, in this paper we show that it is possible to learn the best Bayesian network structure with over 30 variables, which covers many practically interesting cases. Our algorithm is less complicated and more efficient than the techniques presented earlier. It can be easily parallelized, and offers a possibility for efficient exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6875","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:52:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QH8FVAxZBlLc/4hV0E14t1ugVnhxss45aXuJ3j7lkBcd4G3Z7BuG3HkbiCYut8aZMiblGqHDCHZX8ltumkGFCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T13:41:37.025123Z"},"content_sha256":"16cce8d9f88f9589c7100259290e806e6f222b6e8bf74dc5978b65430fb6a4f5","schema_version":"1.0","event_id":"sha256:16cce8d9f88f9589c7100259290e806e6f222b6e8bf74dc5978b65430fb6a4f5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/W62N55LGEM33GQY654KA7WKMAO/bundle.json","state_url":"https://pith.science/pith/W62N55LGEM33GQY654KA7WKMAO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/W62N55LGEM33GQY654KA7WKMAO/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-27T13:41:37Z","links":{"resolver":"https://pith.science/pith/W62N55LGEM33GQY654KA7WKMAO","bundle":"https://pith.science/pith/W62N55LGEM33GQY654KA7WKMAO/bundle.json","state":"https://pith.science/pith/W62N55LGEM33GQY654KA7WKMAO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/W62N55LGEM33GQY654KA7WKMAO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:W62N55LGEM33GQY654KA7WKMAO","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":"61c094c40f12d0d660cb25aaa9a9afa64f7d725619bfbce3a06d59104fdb6332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:30:42Z","title_canon_sha256":"955c4ac059fa86f51bf13b0a5fe67a60b78c506a52a402b38e5cbad128b7a7bd"},"schema_version":"1.0","source":{"id":"1206.6875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1206.6875","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"arxiv_version","alias_value":"1206.6875v1","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.6875","created_at":"2026-05-18T03:52:15Z"},{"alias_kind":"pith_short_12","alias_value":"W62N55LGEM33","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_16","alias_value":"W62N55LGEM33GQY6","created_at":"2026-05-18T12:27:25Z"},{"alias_kind":"pith_short_8","alias_value":"W62N55LG","created_at":"2026-05-18T12:27:25Z"}],"graph_snapshots":[{"event_id":"sha256:16cce8d9f88f9589c7100259290e806e6f222b6e8bf74dc5978b65430fb6a4f5","target":"graph","created_at":"2026-05-18T03:52:15Z","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":"We study the problem of learning the best Bayesian network structure with respect to a decomposable score such as BDe, BIC or AIC. This problem is known to be NP-hard, which means that solving it becomes quickly infeasible as the number of variables increases. Nevertheless, in this paper we show that it is possible to learn the best Bayesian network structure with over 30 variables, which covers many practically interesting cases. Our algorithm is less complicated and more efficient than the techniques presented earlier. It can be easily parallelized, and offers a possibility for efficient exp","authors_text":"Petri Myllymaki, Tomi Silander","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:30:42Z","title":"A simple approach for finding the globally optimal Bayesian network structure"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.6875","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:8c5327a133e738fb83ddf101af432a5d6d05008c89295d578135f4a60684d084","target":"record","created_at":"2026-05-18T03:52:15Z","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":"61c094c40f12d0d660cb25aaa9a9afa64f7d725619bfbce3a06d59104fdb6332","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2012-06-27T16:30:42Z","title_canon_sha256":"955c4ac059fa86f51bf13b0a5fe67a60b78c506a52a402b38e5cbad128b7a7bd"},"schema_version":"1.0","source":{"id":"1206.6875","kind":"arxiv","version":1}},"canonical_sha256":"b7b4def5662337b3431eef140fd94c039139665a709b922d8ce29096d4afee66","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b7b4def5662337b3431eef140fd94c039139665a709b922d8ce29096d4afee66","first_computed_at":"2026-05-18T03:52:15.307721Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:52:15.307721Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ioTwZN9GDyJ0QpAFgQ7EElcCLUojObbSm+Td0tUslD1hjw/W/262nXSKGAr+zpa0Yw9q7tlY1K66wM7gxQlqBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:52:15.308417Z","signed_message":"canonical_sha256_bytes"},"source_id":"1206.6875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c5327a133e738fb83ddf101af432a5d6d05008c89295d578135f4a60684d084","sha256:16cce8d9f88f9589c7100259290e806e6f222b6e8bf74dc5978b65430fb6a4f5"],"state_sha256":"094e4572eb968345f10e0169798e11d8ea8e838336ad5a20710037a69c264271"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kkXp6CGPy9bhB/lPhSs9Hj4OrYxhdcV5EUPaLn5N37doPmXMzYkkxj6AcNN8EYllJPt4LYu4xsjarJVC1FiXCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T13:41:37.027001Z","bundle_sha256":"682f291d385d3f926b2f1330613271cab851c28df9464824272abe754e8b0243"}}