{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GB5NAIA2ISKQWXSDEHEJKVWXJD","short_pith_number":"pith:GB5NAIA2","schema_version":"1.0","canonical_sha256":"307ad0201a44950b5e4321c89556d748c26dbd0c7c46bf509320f09fdae606e5","source":{"kind":"arxiv","id":"1902.00869","version":1},"attestation_state":"computed","paper":{"title":"Quantum Speedup in Adaptive Boosting of Binary Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Manhong Yung, Min-Hsiu Hsieh, Ximing Wang, YueChi Ma","submitted_at":"2019-02-03T10:22:33Z","abstract_excerpt":"In classical machine learning, a set of weak classifiers can be adaptively combined to form a strong classifier for improving the overall performance, a technique called adaptive boosting (or AdaBoost). However, constructing the strong classifier for a large data set is typically resource consuming. Here we propose a quantum extension of AdaBoost, demonstrating a quantum algorithm that can output the optimal strong classifier with a quadratic speedup in the number of queries of the weak classifiers. Our results also include a generalization of the standard AdaBoost to the cases where the outpu"},"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":"1902.00869","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-02-03T10:22:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"62f22d7665676caf07be4e3c98366ea5642f1ea86f04d66af564b532fb4c393a","abstract_canon_sha256":"1929827e5fae723736d0cd773a237a5c3e036dc90b02bf7e0245ffdda49bf4fb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:54:51.898140Z","signature_b64":"rS0/8rDFmhusspWznHLCjy3wEVkNa8aHjs4vP3uKwzHDPqvQCAA6iS2vF4xTeV5Xdsz9zcaCKTxSsZvmZOQMCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"307ad0201a44950b5e4321c89556d748c26dbd0c7c46bf509320f09fdae606e5","last_reissued_at":"2026-05-17T23:54:51.897432Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:54:51.897432Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Speedup in Adaptive Boosting of Binary Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"quant-ph","authors_text":"Manhong Yung, Min-Hsiu Hsieh, Ximing Wang, YueChi Ma","submitted_at":"2019-02-03T10:22:33Z","abstract_excerpt":"In classical machine learning, a set of weak classifiers can be adaptively combined to form a strong classifier for improving the overall performance, a technique called adaptive boosting (or AdaBoost). However, constructing the strong classifier for a large data set is typically resource consuming. Here we propose a quantum extension of AdaBoost, demonstrating a quantum algorithm that can output the optimal strong classifier with a quadratic speedup in the number of queries of the weak classifiers. Our results also include a generalization of the standard AdaBoost to the cases where the outpu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.00869","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1902.00869","created_at":"2026-05-17T23:54:51.897528+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.00869v1","created_at":"2026-05-17T23:54:51.897528+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.00869","created_at":"2026-05-17T23:54:51.897528+00:00"},{"alias_kind":"pith_short_12","alias_value":"GB5NAIA2ISKQ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GB5NAIA2ISKQWXSD","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GB5NAIA2","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD","json":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD.json","graph_json":"https://pith.science/api/pith-number/GB5NAIA2ISKQWXSDEHEJKVWXJD/graph.json","events_json":"https://pith.science/api/pith-number/GB5NAIA2ISKQWXSDEHEJKVWXJD/events.json","paper":"https://pith.science/paper/GB5NAIA2"},"agent_actions":{"view_html":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD","download_json":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD.json","view_paper":"https://pith.science/paper/GB5NAIA2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.00869&json=true","fetch_graph":"https://pith.science/api/pith-number/GB5NAIA2ISKQWXSDEHEJKVWXJD/graph.json","fetch_events":"https://pith.science/api/pith-number/GB5NAIA2ISKQWXSDEHEJKVWXJD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD/action/storage_attestation","attest_author":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD/action/author_attestation","sign_citation":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD/action/citation_signature","submit_replication":"https://pith.science/pith/GB5NAIA2ISKQWXSDEHEJKVWXJD/action/replication_record"}},"created_at":"2026-05-17T23:54:51.897528+00:00","updated_at":"2026-05-17T23:54:51.897528+00:00"}