{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:YAE755HOKOULRGUN3HICWPYUMJ","short_pith_number":"pith:YAE755HO","schema_version":"1.0","canonical_sha256":"c009fef4ee53a8b89a8dd9d02b3f146271c1a64cd398e79d9424ef2f1ce80e4a","source":{"kind":"arxiv","id":"1602.04799","version":1},"attestation_state":"computed","paper":{"title":"Quantum Perceptron Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta M Svore, Nathan Wiebe","submitted_at":"2016-02-15T20:45:35Z","abstract_excerpt":"We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points $N$, namely $O(\\sqrt{N})$. The second algorithm illustrates how the classical mistake bound of $O(\\frac{1}{\\gamma^2})$ can be further improved to $O(\\frac{1}{\\sqrt{\\gamma}})$ through quantum means, where $\\gamma$ denotes the margin."},"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":"1602.04799","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-02-15T20:45:35Z","cross_cats_sorted":["cs.LG","stat.ML"],"title_canon_sha256":"91817f1a66afd8aaae8dc381dedb768aa8d154cbf2d748b09f023d2e0a03ad3b","abstract_canon_sha256":"fef71b0e9264e837cbafdba6a559b3e477eab7f082a8ca45bfa5134a62b91845"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:22.673243Z","signature_b64":"qHPkOwVYCnmi2MRM/i+FT5MHgnuFsoP9R6dpny1uFamv6Fe6miKZcLdBgT+7DJk4yLESYWddmQVcSpTp4K6sCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c009fef4ee53a8b89a8dd9d02b3f146271c1a64cd398e79d9424ef2f1ce80e4a","last_reissued_at":"2026-05-18T01:20:22.672546Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:22.672546Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Perceptron Models","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG","stat.ML"],"primary_cat":"quant-ph","authors_text":"Ashish Kapoor, Krysta M Svore, Nathan Wiebe","submitted_at":"2016-02-15T20:45:35Z","abstract_excerpt":"We demonstrate how quantum computation can provide non-trivial improvements in the computational and statistical complexity of the perceptron model. We develop two quantum algorithms for perceptron learning. The first algorithm exploits quantum information processing to determine a separating hyperplane using a number of steps sublinear in the number of data points $N$, namely $O(\\sqrt{N})$. The second algorithm illustrates how the classical mistake bound of $O(\\frac{1}{\\gamma^2})$ can be further improved to $O(\\frac{1}{\\sqrt{\\gamma}})$ through quantum means, where $\\gamma$ denotes the margin."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04799","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":"1602.04799","created_at":"2026-05-18T01:20:22.672648+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04799v1","created_at":"2026-05-18T01:20:22.672648+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04799","created_at":"2026-05-18T01:20:22.672648+00:00"},{"alias_kind":"pith_short_12","alias_value":"YAE755HOKOUL","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_16","alias_value":"YAE755HOKOULRGUN","created_at":"2026-05-18T12:30:53.716459+00:00"},{"alias_kind":"pith_short_8","alias_value":"YAE755HO","created_at":"2026-05-18T12:30:53.716459+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/YAE755HOKOULRGUN3HICWPYUMJ","json":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ.json","graph_json":"https://pith.science/api/pith-number/YAE755HOKOULRGUN3HICWPYUMJ/graph.json","events_json":"https://pith.science/api/pith-number/YAE755HOKOULRGUN3HICWPYUMJ/events.json","paper":"https://pith.science/paper/YAE755HO"},"agent_actions":{"view_html":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ","download_json":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ.json","view_paper":"https://pith.science/paper/YAE755HO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04799&json=true","fetch_graph":"https://pith.science/api/pith-number/YAE755HOKOULRGUN3HICWPYUMJ/graph.json","fetch_events":"https://pith.science/api/pith-number/YAE755HOKOULRGUN3HICWPYUMJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ/action/storage_attestation","attest_author":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ/action/author_attestation","sign_citation":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ/action/citation_signature","submit_replication":"https://pith.science/pith/YAE755HOKOULRGUN3HICWPYUMJ/action/replication_record"}},"created_at":"2026-05-18T01:20:22.672648+00:00","updated_at":"2026-05-18T01:20:22.672648+00:00"}