{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:4TRS3NSLJF7COAOMPTWEZOMKTT","short_pith_number":"pith:4TRS3NSL","canonical_record":{"source":{"id":"1811.05039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-12T23:19:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5f079b739688da8df5f10eb3506ebf4863a2089bd4c62e679f324ed8b66a56bc","abstract_canon_sha256":"a0b2a692ceff52a4fb4e46b74f528f5010f00fcabc9f22e173aab36af62bf905"},"schema_version":"1.0"},"canonical_sha256":"e4e32db64b497e2701cc7cec4cb98a9cf66cc4b489f8addc70d1124d2f3affa2","source":{"kind":"arxiv","id":"1811.05039","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05039","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05039v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05039","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"4TRS3NSLJF7C","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TRS3NSLJF7COAOM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TRS3NSL","created_at":"2026-05-18T12:32:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:4TRS3NSLJF7COAOMPTWEZOMKTT","target":"record","payload":{"canonical_record":{"source":{"id":"1811.05039","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-12T23:19:51Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"5f079b739688da8df5f10eb3506ebf4863a2089bd4c62e679f324ed8b66a56bc","abstract_canon_sha256":"a0b2a692ceff52a4fb4e46b74f528f5010f00fcabc9f22e173aab36af62bf905"},"schema_version":"1.0"},"canonical_sha256":"e4e32db64b497e2701cc7cec4cb98a9cf66cc4b489f8addc70d1124d2f3affa2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.386432Z","signature_b64":"o9MqOLBn8/c7BSlYlCeZPGUEXp0JsFU4XPCmOgUebMm8HssaVM+Va64Tw8ZviEbghtVe7EeysmEluDKtLj+5CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4e32db64b497e2701cc7cec4cb98a9cf66cc4b489f8addc70d1124d2f3affa2","last_reissued_at":"2026-05-18T00:01:01.385861Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.385861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.05039","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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t8+OAx4jQoTOvV09b5jErX+5RIQYh47wITJE//jV1g2OA1BBTBfjQ/wxKqMRAxFWg/jNP1aVqGVT0rpNlJJeAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:59:29.312800Z"},"content_sha256":"13da6e89290da77d60197dc8c1c75c6eb569d1b209683a4f0278791d7a21e173","schema_version":"1.0","event_id":"sha256:13da6e89290da77d60197dc8c1c75c6eb569d1b209683a4f0278791d7a21e173"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:4TRS3NSLJF7COAOMPTWEZOMKTT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding All Bayesian Network Structures within a Factor of Optimal","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"cs.AI","authors_text":"Charupriya Sharma, James Cussens, Peter van Beek, Zhenyu A. Liao","submitted_at":"2018-11-12T23:19:51Z","abstract_excerpt":"A Bayesian network is a widely used probabilistic graphical model with applications in knowledge discovery and prediction. Learning a Bayesian network (BN) from data can be cast as an optimization problem using the well-known score-and-search approach. However, selecting a single model (i.e., the best scoring BN) can be misleading or may not achieve the best possible accuracy. An alternative to committing to a single model is to perform some form of Bayesian or frequentist model averaging, where the space of possible BNs is sampled or enumerated in some fashion. Unfortunately, existing approac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05039","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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pjRUtsSijmGx3NX/AlHCiPR2gZ0NiOKw0uXVyAku3KiRvQ+D0jgm8nC+TgHpQ9LW9BkQO6ip9mF1sf5gVs2jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:59:29.313475Z"},"content_sha256":"276d3ce89544565883b4e64f16cd8d57e83293fc226eb0084f1d8f1b8e1e739b","schema_version":"1.0","event_id":"sha256:276d3ce89544565883b4e64f16cd8d57e83293fc226eb0084f1d8f1b8e1e739b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/bundle.json","state_url":"https://pith.science/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/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-11T23:59:29Z","links":{"resolver":"https://pith.science/pith/4TRS3NSLJF7COAOMPTWEZOMKTT","bundle":"https://pith.science/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/bundle.json","state":"https://pith.science/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4TRS3NSLJF7COAOMPTWEZOMKTT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:4TRS3NSLJF7COAOMPTWEZOMKTT","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":"a0b2a692ceff52a4fb4e46b74f528f5010f00fcabc9f22e173aab36af62bf905","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-12T23:19:51Z","title_canon_sha256":"5f079b739688da8df5f10eb3506ebf4863a2089bd4c62e679f324ed8b66a56bc"},"schema_version":"1.0","source":{"id":"1811.05039","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05039","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05039v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05039","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"4TRS3NSLJF7C","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_16","alias_value":"4TRS3NSLJF7COAOM","created_at":"2026-05-18T12:32:05Z"},{"alias_kind":"pith_short_8","alias_value":"4TRS3NSL","created_at":"2026-05-18T12:32:05Z"}],"graph_snapshots":[{"event_id":"sha256:276d3ce89544565883b4e64f16cd8d57e83293fc226eb0084f1d8f1b8e1e739b","target":"graph","created_at":"2026-05-18T00:01:01Z","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 Bayesian network is a widely used probabilistic graphical model with applications in knowledge discovery and prediction. Learning a Bayesian network (BN) from data can be cast as an optimization problem using the well-known score-and-search approach. However, selecting a single model (i.e., the best scoring BN) can be misleading or may not achieve the best possible accuracy. An alternative to committing to a single model is to perform some form of Bayesian or frequentist model averaging, where the space of possible BNs is sampled or enumerated in some fashion. Unfortunately, existing approac","authors_text":"Charupriya Sharma, James Cussens, Peter van Beek, Zhenyu A. Liao","cross_cats":["cs.LG","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-12T23:19:51Z","title":"Finding All Bayesian Network Structures within a Factor of Optimal"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05039","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:13da6e89290da77d60197dc8c1c75c6eb569d1b209683a4f0278791d7a21e173","target":"record","created_at":"2026-05-18T00:01:01Z","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":"a0b2a692ceff52a4fb4e46b74f528f5010f00fcabc9f22e173aab36af62bf905","cross_cats_sorted":["cs.LG","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2018-11-12T23:19:51Z","title_canon_sha256":"5f079b739688da8df5f10eb3506ebf4863a2089bd4c62e679f324ed8b66a56bc"},"schema_version":"1.0","source":{"id":"1811.05039","kind":"arxiv","version":1}},"canonical_sha256":"e4e32db64b497e2701cc7cec4cb98a9cf66cc4b489f8addc70d1124d2f3affa2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e4e32db64b497e2701cc7cec4cb98a9cf66cc4b489f8addc70d1124d2f3affa2","first_computed_at":"2026-05-18T00:01:01.385861Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:01.385861Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"o9MqOLBn8/c7BSlYlCeZPGUEXp0JsFU4XPCmOgUebMm8HssaVM+Va64Tw8ZviEbghtVe7EeysmEluDKtLj+5CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:01.386432Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05039","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13da6e89290da77d60197dc8c1c75c6eb569d1b209683a4f0278791d7a21e173","sha256:276d3ce89544565883b4e64f16cd8d57e83293fc226eb0084f1d8f1b8e1e739b"],"state_sha256":"5fe7312f40ede23664cac156d3290dd30d1bb548840cab7b554756923a9657f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+rHvcuiG6bcuA1FVxl3uBTZCOOriNvt8wFP63rSxPbRD91CF8/WjvS/UrC4tMG9ofwxEb4/ndx5kLwmLsfgdBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:59:29.317248Z","bundle_sha256":"b09af146847a0054d23a401b98685c0c244c36227131e18bd97cc5eccf517b49"}}