{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2008:CCJMVSMWQS3WRSM63EKWF53US5","short_pith_number":"pith:CCJMVSMW","schema_version":"1.0","canonical_sha256":"1092cac99684b768c99ed91562f7749770dc944f84685b2c3e7a8ff7054fb92a","source":{"kind":"arxiv","id":"0811.0416","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0811.0416","created_at":"2026-07-04T15:15:43.621536+00:00"},{"alias_kind":"arxiv_version","alias_value":"0811.0416v1","created_at":"2026-07-04T15:15:43.621536+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0811.0416","created_at":"2026-07-04T15:15:43.621536+00:00"},{"alias_kind":"pith_short_12","alias_value":"CCJMVSMWQS3W","created_at":"2026-07-04T15:15:43.621536+00:00"},{"alias_kind":"pith_short_16","alias_value":"CCJMVSMWQS3WRSM6","created_at":"2026-07-04T15:15:43.621536+00:00"},{"alias_kind":"pith_short_8","alias_value":"CCJMVSMW","created_at":"2026-07-04T15:15:43.621536+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.10237","citing_title":"Quantum-Annealing Enhanced Machine Learning for Interpretable Phase Classification of High-Entropy Alloys","ref_index":348,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5","json":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5.json","graph_json":"https://pith.science/api/pith-number/CCJMVSMWQS3WRSM63EKWF53US5/graph.json","events_json":"https://pith.science/api/pith-number/CCJMVSMWQS3WRSM63EKWF53US5/events.json","paper":"https://pith.science/paper/CCJMVSMW"},"agent_actions":{"view_html":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5","download_json":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5.json","view_paper":"https://pith.science/paper/CCJMVSMW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0811.0416&json=true","fetch_graph":"https://pith.science/api/pith-number/CCJMVSMWQS3WRSM63EKWF53US5/graph.json","fetch_events":"https://pith.science/api/pith-number/CCJMVSMWQS3WRSM63EKWF53US5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/action/storage_attestation","attest_author":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/action/author_attestation","sign_citation":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/action/citation_signature","submit_replication":"https://pith.science/pith/CCJMVSMWQS3WRSM63EKWF53US5/action/replication_record"}},"created_at":"2026-07-04T15:15:43.621536+00:00","updated_at":"2026-07-04T15:15:43.621536+00:00"}