{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2008:CCJMVSMWQS3WRSM63EKWF53US5","short_pith_number":"pith:CCJMVSMW","canonical_record":{"source":{"id":"0811.0416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:01:32Z","cross_cats_sorted":[],"title_canon_sha256":"9583df9494957e70061fc6fd5df7de762cdc5b665baa74f400c4ee107f0a6927","abstract_canon_sha256":"f5245035d1cd198f5e19ca8f4284820eefb8c250b90a48c8a02a47302f971c69"},"schema_version":"1.0"},"canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","source":{"kind":"arxiv","id":"0811.0416","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0416","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0416v1","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0416","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"CCJMVSMWQS3W","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"CCJMVSMWQS3WRSM6","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"CCJMVSMW","created_at":"2026-07-04T15:15:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2008:CCJMVSMWQS3WRSM63EKWF53US5","target":"record","payload":{"canonical_record":{"source":{"id":"0811.0416","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:01:32Z","cross_cats_sorted":[],"title_canon_sha256":"9583df9494957e70061fc6fd5df7de762cdc5b665baa74f400c4ee107f0a6927","abstract_canon_sha256":"f5245035d1cd198f5e19ca8f4284820eefb8c250b90a48c8a02a47302f971c69"},"schema_version":"1.0"},"canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:15:43.621858Z","signature_b64":"Vtv1ktlT6KgxHTrq289o9czLK/O4NN/8Xj0k0X+vnbKVP1VaP7hLHNKEgn5y8g5epWQe6WfGZIuXA8k63PxCCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","last_reissued_at":"2026-07-04T15:15:43.621486Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:15:43.621486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0811.0416","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-07-04T15:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AKYoBLNTurXncdC3vC072oX6rFKMVlnqrOzg0NLi5t73wgbV6HLK4uhJ5YVJb0+Tf8vuc7LhRRP/MrifgierBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:41:15.938014Z"},"content_sha256":"9d208d019990b056490d2c1fe065ddfbc46b0ce6e3730cbee609306789a1234f","schema_version":"1.0","event_id":"sha256:9d208d019990b056490d2c1fe065ddfbc46b0ce6e3730cbee609306789a1234f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2008:CCJMVSMWQS3WRSM63EKWF53US5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Training a Binary Classifier with the Quantum Adiabatic Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Geordie Rose, Hartmut Neven, Vasil S. Denchev, William G. Macready","submitted_at":"2008-11-04T20:01:32Z","abstract_excerpt":"This paper describes how to make the problem of binary classification amenable to quantum computing. A formulation is employed in which the binary classifier is constructed as a thresholded linear superposition of a set of weak classifiers. The weights in the superposition are optimized in a learning process that strives to minimize the training error as well as the number of weak classifiers used. No efficient solution to this problem is known. To bring it into a format that allows the application of adiabatic quantum computing (AQC), we first show that the bit-precision with which the weight"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0416","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0811.0416/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-04T15:15:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8f//Iz4iKwp38BZGeKEr55GvbfN2Ts5EKbSUpahmB0iLh6gqb+IT/5QvTWikWGYtmB9xyHFiRkgBmX/VC83oCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T22:41:15.938546Z"},"content_sha256":"13962c866e6e89f64321f136f97a05cbb05e52f37aad110ca5d614e16be93268","schema_version":"1.0","event_id":"sha256:13962c866e6e89f64321f136f97a05cbb05e52f37aad110ca5d614e16be93268"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/bundle.json","state_url":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CCJMVSMWQS3WRSM63EKWF53US5/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-08-15T22:41:15Z","links":{"resolver":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5","bundle":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/bundle.json","state":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CCJMVSMWQS3WRSM63EKWF53US5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2008:CCJMVSMWQS3WRSM63EKWF53US5","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":"f5245035d1cd198f5e19ca8f4284820eefb8c250b90a48c8a02a47302f971c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:01:32Z","title_canon_sha256":"9583df9494957e70061fc6fd5df7de762cdc5b665baa74f400c4ee107f0a6927"},"schema_version":"1.0","source":{"id":"0811.0416","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0811.0416","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"arxiv_version","alias_value":"0811.0416v1","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0416","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_12","alias_value":"CCJMVSMWQS3W","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_16","alias_value":"CCJMVSMWQS3WRSM6","created_at":"2026-07-04T15:15:43Z"},{"alias_kind":"pith_short_8","alias_value":"CCJMVSMW","created_at":"2026-07-04T15:15:43Z"}],"graph_snapshots":[{"event_id":"sha256:13962c866e6e89f64321f136f97a05cbb05e52f37aad110ca5d614e16be93268","target":"graph","created_at":"2026-07-04T15:15:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0811.0416/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This paper describes how to make the problem of binary classification amenable to quantum computing. A formulation is employed in which the binary classifier is constructed as a thresholded linear superposition of a set of weak classifiers. The weights in the superposition are optimized in a learning process that strives to minimize the training error as well as the number of weak classifiers used. No efficient solution to this problem is known. To bring it into a format that allows the application of adiabatic quantum computing (AQC), we first show that the bit-precision with which the weight","authors_text":"Geordie Rose, Hartmut Neven, Vasil S. Denchev, William G. Macready","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:01:32Z","title":"Training a Binary Classifier with the Quantum Adiabatic Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0811.0416","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:9d208d019990b056490d2c1fe065ddfbc46b0ce6e3730cbee609306789a1234f","target":"record","created_at":"2026-07-04T15:15:43Z","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":"f5245035d1cd198f5e19ca8f4284820eefb8c250b90a48c8a02a47302f971c69","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2008-11-04T20:01:32Z","title_canon_sha256":"9583df9494957e70061fc6fd5df7de762cdc5b665baa74f400c4ee107f0a6927"},"schema_version":"1.0","source":{"id":"0811.0416","kind":"arxiv","version":1}},"canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","first_computed_at":"2026-07-04T15:15:43.621486Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:15:43.621486Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Vtv1ktlT6KgxHTrq289o9czLK/O4NN/8Xj0k0X+vnbKVP1VaP7hLHNKEgn5y8g5epWQe6WfGZIuXA8k63PxCCw==","signature_status":"signed_v1","signed_at":"2026-07-04T15:15:43.621858Z","signed_message":"canonical_sha256_bytes"},"source_id":"0811.0416","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d208d019990b056490d2c1fe065ddfbc46b0ce6e3730cbee609306789a1234f","sha256:13962c866e6e89f64321f136f97a05cbb05e52f37aad110ca5d614e16be93268"],"state_sha256":"d25ca4ddb2a65e12361a68d13775846ce1ec1d6ab829cb5ec170767fe490400e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKHbULOP8mGaFLubY/1+atWTFphdxxlGPFcqNFyQHRmAzPv6rcQEv/IlvT+4SgI/PwJ+0WlzpkGWa8fBWo1ZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T22:41:15.943802Z","bundle_sha256":"4095028ada321b278abdda5e0bf7210ee695996b4487b655068aa6a4336acf5b"}}