{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:47DALRRVKQDZKLLV6WXJGOBZOB","short_pith_number":"pith:47DALRRV","canonical_record":{"source":{"id":"1407.3897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-15T07:22:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2dd805ed641a630d5c15562703b28e30b2f25041065842a8e6cd4d6b84347b69","abstract_canon_sha256":"f3531248972c672b8e8ee903329b94bef9e357cf0bec4f20ebc60100f16542cc"},"schema_version":"1.0"},"canonical_sha256":"e7c605c6355407952d75f5ae933839705059e3eef8b9a134a17403786b312211","source":{"kind":"arxiv","id":"1407.3897","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3897","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3897v2","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3897","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"47DALRRVKQDZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"47DALRRVKQDZKLLV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"47DALRRV","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:47DALRRVKQDZKLLV6WXJGOBZOB","target":"record","payload":{"canonical_record":{"source":{"id":"1407.3897","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-15T07:22:13Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"2dd805ed641a630d5c15562703b28e30b2f25041065842a8e6cd4d6b84347b69","abstract_canon_sha256":"f3531248972c672b8e8ee903329b94bef9e357cf0bec4f20ebc60100f16542cc"},"schema_version":"1.0"},"canonical_sha256":"e7c605c6355407952d75f5ae933839705059e3eef8b9a134a17403786b312211","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:51.531804Z","signature_b64":"SzgUuJmdjmxLvpCGAZVLugfwYREZvQzNNwKw4wqAJEKESdxzUfbZwJJBGhByJF0notezH220Fy16ybpaKqvQAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7c605c6355407952d75f5ae933839705059e3eef8b9a134a17403786b312211","last_reissued_at":"2026-05-18T02:26:51.531406Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:51.531406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1407.3897","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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+P8rSGlNTxcD5BuZTXJ7uBDkEwAzDCGE1W8Fwe6xWteMhIacCtb2N/4uWW7+y7ZJCWt63jIeIiYy2PhTcveXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:46:35.953987Z"},"content_sha256":"cab93fa20a40e0ed45adad8dfe28a066e427c0b7e125d32f0ce71ad85c65c5a1","schema_version":"1.0","event_id":"sha256:cab93fa20a40e0ed45adad8dfe28a066e427c0b7e125d32f0ce71ad85c65c5a1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:47DALRRVKQDZKLLV6WXJGOBZOB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bayesian Network Structure Learning Using Quantum Annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Alan Aspuru-Guzik, Alejandro Perdomo-Ortiz, Bryan O'Gorman, Ryan Babbush, Vadim Smelyanskiy","submitted_at":"2014-07-15T07:22:13Z","abstract_excerpt":"We introduce a method for the problem of learning the structure of a Bayesian network using the quantum adiabatic algorithm. We do so by introducing an efficient reformulation of a standard posterior-probability scoring function on graphs as a pseudo-Boolean function, which is equivalent to a system of 2-body Ising spins, as well as suitable penalty terms for enforcing the constraints necessary for the reformulation; our proposed method requires $\\mathcal O(n^2)$ qubits for $n$ Bayesian network variables. Furthermore, we prove lower bounds on the necessary weighting of these penalty terms. The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3897","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-18T02:26:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"guasn/W+9a/5axclgaRtff+q59+BUF0aqbrfRmlFYStvGlc0m/96f5rHCxa/K/PIEgo21Qs4HrIikmLw8aI5CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-18T19:46:35.954543Z"},"content_sha256":"86df06a809a97de9371b4297b0dec50696edfbdb3fd887747ee1f5a104d1d40a","schema_version":"1.0","event_id":"sha256:86df06a809a97de9371b4297b0dec50696edfbdb3fd887747ee1f5a104d1d40a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/47DALRRVKQDZKLLV6WXJGOBZOB/bundle.json","state_url":"https://pith.science/pith/47DALRRVKQDZKLLV6WXJGOBZOB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/47DALRRVKQDZKLLV6WXJGOBZOB/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-05-18T19:46:35Z","links":{"resolver":"https://pith.science/pith/47DALRRVKQDZKLLV6WXJGOBZOB","bundle":"https://pith.science/pith/47DALRRVKQDZKLLV6WXJGOBZOB/bundle.json","state":"https://pith.science/pith/47DALRRVKQDZKLLV6WXJGOBZOB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/47DALRRVKQDZKLLV6WXJGOBZOB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:47DALRRVKQDZKLLV6WXJGOBZOB","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":"f3531248972c672b8e8ee903329b94bef9e357cf0bec4f20ebc60100f16542cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-15T07:22:13Z","title_canon_sha256":"2dd805ed641a630d5c15562703b28e30b2f25041065842a8e6cd4d6b84347b69"},"schema_version":"1.0","source":{"id":"1407.3897","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1407.3897","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"arxiv_version","alias_value":"1407.3897v2","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.3897","created_at":"2026-05-18T02:26:51Z"},{"alias_kind":"pith_short_12","alias_value":"47DALRRVKQDZ","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"47DALRRVKQDZKLLV","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"47DALRRV","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:86df06a809a97de9371b4297b0dec50696edfbdb3fd887747ee1f5a104d1d40a","target":"graph","created_at":"2026-05-18T02:26:51Z","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 introduce a method for the problem of learning the structure of a Bayesian network using the quantum adiabatic algorithm. We do so by introducing an efficient reformulation of a standard posterior-probability scoring function on graphs as a pseudo-Boolean function, which is equivalent to a system of 2-body Ising spins, as well as suitable penalty terms for enforcing the constraints necessary for the reformulation; our proposed method requires $\\mathcal O(n^2)$ qubits for $n$ Bayesian network variables. Furthermore, we prove lower bounds on the necessary weighting of these penalty terms. The","authors_text":"Alan Aspuru-Guzik, Alejandro Perdomo-Ortiz, Bryan O'Gorman, Ryan Babbush, Vadim Smelyanskiy","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-15T07:22:13Z","title":"Bayesian Network Structure Learning Using Quantum Annealing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.3897","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:cab93fa20a40e0ed45adad8dfe28a066e427c0b7e125d32f0ce71ad85c65c5a1","target":"record","created_at":"2026-05-18T02:26:51Z","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":"f3531248972c672b8e8ee903329b94bef9e357cf0bec4f20ebc60100f16542cc","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-07-15T07:22:13Z","title_canon_sha256":"2dd805ed641a630d5c15562703b28e30b2f25041065842a8e6cd4d6b84347b69"},"schema_version":"1.0","source":{"id":"1407.3897","kind":"arxiv","version":2}},"canonical_sha256":"e7c605c6355407952d75f5ae933839705059e3eef8b9a134a17403786b312211","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7c605c6355407952d75f5ae933839705059e3eef8b9a134a17403786b312211","first_computed_at":"2026-05-18T02:26:51.531406Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:26:51.531406Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SzgUuJmdjmxLvpCGAZVLugfwYREZvQzNNwKw4wqAJEKESdxzUfbZwJJBGhByJF0notezH220Fy16ybpaKqvQAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:26:51.531804Z","signed_message":"canonical_sha256_bytes"},"source_id":"1407.3897","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cab93fa20a40e0ed45adad8dfe28a066e427c0b7e125d32f0ce71ad85c65c5a1","sha256:86df06a809a97de9371b4297b0dec50696edfbdb3fd887747ee1f5a104d1d40a"],"state_sha256":"25c669e32e7ea83f0d2092e416f363d6c02ca553d05b9112745d0d79a48f1392"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T6NcddOq772FenIdJgaxGdoTG74cE0M3Fb+hi8Fy4cH1HRRfZ23ERJ/BDvhhOGjpcFazZgI4sEokS3VJEbqvBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-18T19:46:35.956367Z","bundle_sha256":"5b6e46d6dbdce9000b0ddd9d8edd103a0bd62aabd70e8f600ae664f4a03c5456"}}