{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:CBSVQBNXC3ANC7VP5WK5JDKRNR","short_pith_number":"pith:CBSVQBNX","canonical_record":{"source":{"id":"1708.00689","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T10:30:21Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"0762f7f0937ff58d7f5036c4eb040a5946e2db655e10cd427b7932ce6609046d","abstract_canon_sha256":"0bd665e600363e1b6811170f4386556e7e93241c59665fc5ef90a09185e8a32a"},"schema_version":"1.0"},"canonical_sha256":"10655805b716c0d17eafed95d48d516c466ab8aedb571764145433ff46451a6b","source":{"kind":"arxiv","id":"1708.00689","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00689","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00689v5","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00689","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"CBSVQBNXC3AN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CBSVQBNXC3ANC7VP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CBSVQBNX","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:CBSVQBNXC3ANC7VP5WK5JDKRNR","target":"record","payload":{"canonical_record":{"source":{"id":"1708.00689","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T10:30:21Z","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"title_canon_sha256":"0762f7f0937ff58d7f5036c4eb040a5946e2db655e10cd427b7932ce6609046d","abstract_canon_sha256":"0bd665e600363e1b6811170f4386556e7e93241c59665fc5ef90a09185e8a32a"},"schema_version":"1.0"},"canonical_sha256":"10655805b716c0d17eafed95d48d516c466ab8aedb571764145433ff46451a6b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:31.221412Z","signature_b64":"hj4NYHw+YKusw0yCZjlhJDBKgPEv4B0N4PshH2uPuRlTZ1EvckBCcsVd+jBtkmfEIzrElD3K5dcTzeOtZyZNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10655805b716c0d17eafed95d48d516c466ab8aedb571764145433ff46451a6b","last_reissued_at":"2026-05-17T23:58:31.220742Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:31.220742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.00689","source_version":5,"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dgumpd4SIdfPQYFy2hjZ+p6dUwFXDZEB7+kzigU3dtz3YL8Z3fwnYMZtwb8FsSbfNPLCl38j/MB3WpVIZc9iAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:19:27.418416Z"},"content_sha256":"2307e8a41d8fae49daa77d51081ac550d97cbb5dc2279691b3d140c933c6545b","schema_version":"1.0","event_id":"sha256:2307e8a41d8fae49daa77d51081ac550d97cbb5dc2279691b3d140c933c6545b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:CBSVQBNXC3ANC7VP5WK5JDKRNR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dirichlet Bayesian Network Scores and the Maximum Relative Entropy Principle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ME","stat.ML","stat.TH"],"primary_cat":"math.ST","authors_text":"Marco Scutari","submitted_at":"2017-08-02T10:30:21Z","abstract_excerpt":"A classic approach for learning Bayesian networks from data is to identify a maximum a posteriori (MAP) network structure. In the case of discrete Bayesian networks, MAP networks are selected by maximising one of several possible Bayesian Dirichlet (BD) scores; the most famous is the Bayesian Dirichlet equivalent uniform (BDeu) score from Heckerman et al (1995). The key properties of BDeu arise from its uniform prior over the parameters of each local distribution in the network, which makes structure learning computationally efficient; it does not require the elicitation of prior knowledge fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00689","kind":"arxiv","version":5},"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-17T23:58:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9bwPtW4NkryQUIzYOM5/vnoKi3FLCxZ+IfRUdVeFDrABY/jEGGsfKdT89IWIFUdzIAKEBSXTkEvcxALL3EXuBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T17:19:27.418771Z"},"content_sha256":"40943c4eb3f17b8efe824ea03738b4371afe3e2b29900c38dcd56e5db1ab34ff","schema_version":"1.0","event_id":"sha256:40943c4eb3f17b8efe824ea03738b4371afe3e2b29900c38dcd56e5db1ab34ff"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/bundle.json","state_url":"https://pith.science/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/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-03T17:19:27Z","links":{"resolver":"https://pith.science/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR","bundle":"https://pith.science/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/bundle.json","state":"https://pith.science/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CBSVQBNXC3ANC7VP5WK5JDKRNR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:CBSVQBNXC3ANC7VP5WK5JDKRNR","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":"0bd665e600363e1b6811170f4386556e7e93241c59665fc5ef90a09185e8a32a","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T10:30:21Z","title_canon_sha256":"0762f7f0937ff58d7f5036c4eb040a5946e2db655e10cd427b7932ce6609046d"},"schema_version":"1.0","source":{"id":"1708.00689","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.00689","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"arxiv_version","alias_value":"1708.00689v5","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.00689","created_at":"2026-05-17T23:58:31Z"},{"alias_kind":"pith_short_12","alias_value":"CBSVQBNXC3AN","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"CBSVQBNXC3ANC7VP","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"CBSVQBNX","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:40943c4eb3f17b8efe824ea03738b4371afe3e2b29900c38dcd56e5db1ab34ff","target":"graph","created_at":"2026-05-17T23:58:31Z","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":"A classic approach for learning Bayesian networks from data is to identify a maximum a posteriori (MAP) network structure. In the case of discrete Bayesian networks, MAP networks are selected by maximising one of several possible Bayesian Dirichlet (BD) scores; the most famous is the Bayesian Dirichlet equivalent uniform (BDeu) score from Heckerman et al (1995). The key properties of BDeu arise from its uniform prior over the parameters of each local distribution in the network, which makes structure learning computationally efficient; it does not require the elicitation of prior knowledge fro","authors_text":"Marco Scutari","cross_cats":["stat.ME","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T10:30:21Z","title":"Dirichlet Bayesian Network Scores and the Maximum Relative Entropy Principle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.00689","kind":"arxiv","version":5},"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:2307e8a41d8fae49daa77d51081ac550d97cbb5dc2279691b3d140c933c6545b","target":"record","created_at":"2026-05-17T23:58:31Z","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":"0bd665e600363e1b6811170f4386556e7e93241c59665fc5ef90a09185e8a32a","cross_cats_sorted":["stat.ME","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2017-08-02T10:30:21Z","title_canon_sha256":"0762f7f0937ff58d7f5036c4eb040a5946e2db655e10cd427b7932ce6609046d"},"schema_version":"1.0","source":{"id":"1708.00689","kind":"arxiv","version":5}},"canonical_sha256":"10655805b716c0d17eafed95d48d516c466ab8aedb571764145433ff46451a6b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10655805b716c0d17eafed95d48d516c466ab8aedb571764145433ff46451a6b","first_computed_at":"2026-05-17T23:58:31.220742Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:31.220742Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hj4NYHw+YKusw0yCZjlhJDBKgPEv4B0N4PshH2uPuRlTZ1EvckBCcsVd+jBtkmfEIzrElD3K5dcTzeOtZyZNDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:31.221412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.00689","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2307e8a41d8fae49daa77d51081ac550d97cbb5dc2279691b3d140c933c6545b","sha256:40943c4eb3f17b8efe824ea03738b4371afe3e2b29900c38dcd56e5db1ab34ff"],"state_sha256":"254eca357caf5756002cef30360cf270c26b2ec7f73c5c45e7df1cf4ea71899a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wq2dJCQJQucKz8+Vyt6xXDX5egIwLSj1Jn0Dg4GYfpdMqV7rK7GHV0yygzSS7A1CwjZHEMGh6tyPn5/P9bKUBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T17:19:27.420858Z","bundle_sha256":"ba9abd1b9cd3c868dcba9a664f78fa076255ed79780d214ad324fb9e64cb7622"}}