{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:VP3LHP3ZQAZB3TODTREGJ3DKMV","short_pith_number":"pith:VP3LHP3Z","canonical_record":{"source":{"id":"1605.04071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-13T07:27:03Z","cross_cats_sorted":[],"title_canon_sha256":"89f4efdea86d9726b94eba0df7bd47913ac1deddf9d8b9c63f30b10869e87b25","abstract_canon_sha256":"991080aa5014fd3e7f80e5eb3b720498aa2f4fd21319d84327eedb5504c4b834"},"schema_version":"1.0"},"canonical_sha256":"abf6b3bf7980321dcdc39c4864ec6a6550beed2341b5c6505e4dbee76e1b70e5","source":{"kind":"arxiv","id":"1605.04071","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04071","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04071v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04071","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"VP3LHP3ZQAZB","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VP3LHP3ZQAZB3TOD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VP3LHP3Z","created_at":"2026-05-18T12:30:48Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:VP3LHP3ZQAZB3TODTREGJ3DKMV","target":"record","payload":{"canonical_record":{"source":{"id":"1605.04071","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-13T07:27:03Z","cross_cats_sorted":[],"title_canon_sha256":"89f4efdea86d9726b94eba0df7bd47913ac1deddf9d8b9c63f30b10869e87b25","abstract_canon_sha256":"991080aa5014fd3e7f80e5eb3b720498aa2f4fd21319d84327eedb5504c4b834"},"schema_version":"1.0"},"canonical_sha256":"abf6b3bf7980321dcdc39c4864ec6a6550beed2341b5c6505e4dbee76e1b70e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:47.729996Z","signature_b64":"x0PXdyR1c0EqFVgB8iACqEB01t3siZD0VQnLkITVvb1cTB80jSsCG62T8vyYBK/TRtj5PzTYLaI3n3ktNXIXCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"abf6b3bf7980321dcdc39c4864ec6a6550beed2341b5c6505e4dbee76e1b70e5","last_reissued_at":"2026-05-18T00:54:47.729505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:47.729505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1605.04071","source_version":2,"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:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ajSeiH3VVplw9zPa8wkOtklBN+fvgU86q/vr1yk2BaLQgIEw5c5cUJdKgFEXi9PIp0LomVUsZ0w1WSfuvbKPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:57:11.955185Z"},"content_sha256":"5992502d3072a50b393d0ef3791ff8d775654d5a5a53994ad8924df4940cc2e2","schema_version":"1.0","event_id":"sha256:5992502d3072a50b393d0ef3791ff8d775654d5a5a53994ad8924df4940cc2e2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:VP3LHP3ZQAZB3TODTREGJ3DKMV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"James Cussens, Janne H. Korhonen, Mark Bartlett, Matti J\\\"arvisalo","submitted_at":"2016-05-13T07:27:03Z","abstract_excerpt":"The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithmic advances in structure learning for Bayesian networks---arguably the most central class of graphical models---especially in what is known as the score-based setting. A successful generic approach to optimal Bayesian network structure learning (BNSL), based on integer programming (IP), is implemented in the GOBNILP system. Despite the recent algorithmic advances, current understanding of foundational aspects underly"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04071","kind":"arxiv","version":2},"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:54:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MCcHaWNCAEIbAq8u6g4R9CVdqvqH/hvBhQcnmmMtFkhDsDQ7cF7fY1p64wg5iWSsLw4A91/q4M+2Rx6uQhvUCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T10:57:11.955548Z"},"content_sha256":"275cbad00844f876e6c529cb488fd74801cd83eee474b63c571b20b0310c835a","schema_version":"1.0","event_id":"sha256:275cbad00844f876e6c529cb488fd74801cd83eee474b63c571b20b0310c835a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/bundle.json","state_url":"https://pith.science/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/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-02T10:57:11Z","links":{"resolver":"https://pith.science/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV","bundle":"https://pith.science/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/bundle.json","state":"https://pith.science/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VP3LHP3ZQAZB3TODTREGJ3DKMV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:VP3LHP3ZQAZB3TODTREGJ3DKMV","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":"991080aa5014fd3e7f80e5eb3b720498aa2f4fd21319d84327eedb5504c4b834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-13T07:27:03Z","title_canon_sha256":"89f4efdea86d9726b94eba0df7bd47913ac1deddf9d8b9c63f30b10869e87b25"},"schema_version":"1.0","source":{"id":"1605.04071","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04071","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04071v2","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04071","created_at":"2026-05-18T00:54:47Z"},{"alias_kind":"pith_short_12","alias_value":"VP3LHP3ZQAZB","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_16","alias_value":"VP3LHP3ZQAZB3TOD","created_at":"2026-05-18T12:30:48Z"},{"alias_kind":"pith_short_8","alias_value":"VP3LHP3Z","created_at":"2026-05-18T12:30:48Z"}],"graph_snapshots":[{"event_id":"sha256:275cbad00844f876e6c529cb488fd74801cd83eee474b63c571b20b0310c835a","target":"graph","created_at":"2026-05-18T00:54:47Z","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":"The challenging task of learning structures of probabilistic graphical models is an important problem within modern AI research. Recent years have witnessed several major algorithmic advances in structure learning for Bayesian networks---arguably the most central class of graphical models---especially in what is known as the score-based setting. A successful generic approach to optimal Bayesian network structure learning (BNSL), based on integer programming (IP), is implemented in the GOBNILP system. Despite the recent algorithmic advances, current understanding of foundational aspects underly","authors_text":"James Cussens, Janne H. Korhonen, Mark Bartlett, Matti J\\\"arvisalo","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-13T07:27:03Z","title":"Bayesian Network Structure Learning with Integer Programming: Polytopes, Facets, and Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04071","kind":"arxiv","version":2},"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:5992502d3072a50b393d0ef3791ff8d775654d5a5a53994ad8924df4940cc2e2","target":"record","created_at":"2026-05-18T00:54:47Z","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":"991080aa5014fd3e7f80e5eb3b720498aa2f4fd21319d84327eedb5504c4b834","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2016-05-13T07:27:03Z","title_canon_sha256":"89f4efdea86d9726b94eba0df7bd47913ac1deddf9d8b9c63f30b10869e87b25"},"schema_version":"1.0","source":{"id":"1605.04071","kind":"arxiv","version":2}},"canonical_sha256":"abf6b3bf7980321dcdc39c4864ec6a6550beed2341b5c6505e4dbee76e1b70e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"abf6b3bf7980321dcdc39c4864ec6a6550beed2341b5c6505e4dbee76e1b70e5","first_computed_at":"2026-05-18T00:54:47.729505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:47.729505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x0PXdyR1c0EqFVgB8iACqEB01t3siZD0VQnLkITVvb1cTB80jSsCG62T8vyYBK/TRtj5PzTYLaI3n3ktNXIXCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:47.729996Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04071","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5992502d3072a50b393d0ef3791ff8d775654d5a5a53994ad8924df4940cc2e2","sha256:275cbad00844f876e6c529cb488fd74801cd83eee474b63c571b20b0310c835a"],"state_sha256":"b6369c5e3607759e27c40b012a0d9aa87d6b47e7783c13424055fbfc8e89e10c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9D7BbKbTeIueLqg9F6U3hdc1oaLcVTNJHML1pxEG0Ce2IsxNm0f8ZJh7H1b1tHXwhafsoDmOtFiDCyTrPBrwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T10:57:11.957472Z","bundle_sha256":"7c2a89906589bbd2d08f562941ecf477174a6c9c2aedf2e3349ddfffbaf88d1d"}}