{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:2YIIKRCOC3SBJPLTLY7US5Y366","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":"615d09da9d230d79d5f41d15100864ea01f725a16ce87ddcd8a079138b67bb7b","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"3aeae3dd50047bfaa434767322afeca0f03839f58ae4600b36fa4c17d66d9bc0"},"schema_version":"1.0","source":{"id":"1203.3501","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.3501","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"arxiv_version","alias_value":"1203.3501v1","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3501","created_at":"2026-05-18T04:00:00Z"},{"alias_kind":"pith_short_12","alias_value":"2YIIKRCOC3SB","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"2YIIKRCOC3SBJPLT","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"2YIIKRCO","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:923ac9c004024b24639645aa86709a534ecd8eac1d444aede76d7b27b65f1b1b","target":"graph","created_at":"2026-05-18T04:00:00Z","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":"Bayesian structure learning is the NP-hard problem of discovering a Bayesian network that optimally represents a given set of training data. In this paper we study the computational worst-case complexity of exact Bayesian structure learning under graph theoretic restrictions on the super-structure. The super-structure (a concept introduced by Perrier, Imoto, and Miyano, JMLR 2008) is an undirected graph that contains as subgraphs the skeletons of solution networks. Our results apply to several variants of score-based Bayesian structure learning where the score of a network decomposes into loca","authors_text":"Sebastian Ordyniak, Stefan Szeider","cross_cats":["cs.DS","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title":"Algorithms and Complexity Results for Exact Bayesian Structure Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3501","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:b118ea40ea55855d2bf23f03073c558a9ee6375f6f15b8d4850478b818b763f9","target":"record","created_at":"2026-05-18T04:00:00Z","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":"615d09da9d230d79d5f41d15100864ea01f725a16ce87ddcd8a079138b67bb7b","cross_cats_sorted":["cs.DS","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-03-15T11:17:56Z","title_canon_sha256":"3aeae3dd50047bfaa434767322afeca0f03839f58ae4600b36fa4c17d66d9bc0"},"schema_version":"1.0","source":{"id":"1203.3501","kind":"arxiv","version":1}},"canonical_sha256":"d61085444e16e414bd735e3f49771bf7b244aa0454d96d0b3c25ec5090c54a98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d61085444e16e414bd735e3f49771bf7b244aa0454d96d0b3c25ec5090c54a98","first_computed_at":"2026-05-18T04:00:00.182989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:00:00.182989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"5vD7HmdCVIQRSzSMK6ZIPQ8+PQ/b6C5WuGXw3MORdTCUeebjXa2s0qDj1FTacJpYY9qePHzHoU7qn1X8P2aOAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:00:00.183884Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.3501","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b118ea40ea55855d2bf23f03073c558a9ee6375f6f15b8d4850478b818b763f9","sha256:923ac9c004024b24639645aa86709a534ecd8eac1d444aede76d7b27b65f1b1b"],"state_sha256":"a755019ddc984d2060b91386361cbe7c72ab5384e3e4e545ba270cb121f79c7c"}