{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NV22I4G67675VLZ2NHNKEZ4VTU","short_pith_number":"pith:NV22I4G6","schema_version":"1.0","canonical_sha256":"6d75a470deffbfdaaf3a69daa267959d12d58e003b45f99005940e3a649705bf","source":{"kind":"arxiv","id":"2309.10887","version":1},"attestation_state":"computed","paper":{"title":"Provable Advantage in Quantum PAC Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sergii Strelchuk, Tom Gur, Wilfred Salmon","submitted_at":"2023-09-19T19:26:20Z","abstract_excerpt":"We revisit the problem of characterising the complexity of Quantum PAC learning, as introduced by Bshouty and Jackson [SIAM J. Comput. 1998, 28, 1136-1153]. Several quantum advantages have been demonstrated in this setting, however, none are generic: they apply to particular concept classes and typically only work when the distribution that generates the data is known. In the general case, it was recently shown by Arunachalam and de Wolf [JMLR, 19 (2018) 1-36] that quantum PAC learners can only achieve constant factor advantages over classical PAC learners.\n  We show that with a natural extens"},"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":"2309.10887","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-09-19T19:26:20Z","cross_cats_sorted":[],"title_canon_sha256":"039ebbd4e862b4e8ed69423b788d57e3d83d8ab07e1798f3ec7c39c3f09ce623","abstract_canon_sha256":"f363360484c0da5780ed739331f212c12c7fd8e35243847469d0efb959fcc648"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:52:28.050079Z","signature_b64":"Kz7jPYSZfgWBNoqIwvv5r0rN4hxxNen7HHeIABN7bO45jYwGtBLbC9Bs7F67u85IEHam46wiNWIirCznaZSrAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d75a470deffbfdaaf3a69daa267959d12d58e003b45f99005940e3a649705bf","last_reissued_at":"2026-07-05T06:52:28.049628Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:52:28.049628Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Provable Advantage in Quantum PAC Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sergii Strelchuk, Tom Gur, Wilfred Salmon","submitted_at":"2023-09-19T19:26:20Z","abstract_excerpt":"We revisit the problem of characterising the complexity of Quantum PAC learning, as introduced by Bshouty and Jackson [SIAM J. Comput. 1998, 28, 1136-1153]. Several quantum advantages have been demonstrated in this setting, however, none are generic: they apply to particular concept classes and typically only work when the distribution that generates the data is known. In the general case, it was recently shown by Arunachalam and de Wolf [JMLR, 19 (2018) 1-36] that quantum PAC learners can only achieve constant factor advantages over classical PAC learners.\n  We show that with a natural extens"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.10887","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/2309.10887/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":"2309.10887","created_at":"2026-07-05T06:52:28.049672+00:00"},{"alias_kind":"arxiv_version","alias_value":"2309.10887v1","created_at":"2026-07-05T06:52:28.049672+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.10887","created_at":"2026-07-05T06:52:28.049672+00:00"},{"alias_kind":"pith_short_12","alias_value":"NV22I4G67675","created_at":"2026-07-05T06:52:28.049672+00:00"},{"alias_kind":"pith_short_16","alias_value":"NV22I4G67675VLZ2","created_at":"2026-07-05T06:52:28.049672+00:00"},{"alias_kind":"pith_short_8","alias_value":"NV22I4G6","created_at":"2026-07-05T06:52:28.049672+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.07572","citing_title":"Analysis of the sample complexity for PAC-learning functions defined over quantum states","ref_index":12,"is_internal_anchor":true},{"citing_arxiv_id":"2604.25631","citing_title":"Local tensor-train surrogates for quantum learning models","ref_index":27,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU","json":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU.json","graph_json":"https://pith.science/api/pith-number/NV22I4G67675VLZ2NHNKEZ4VTU/graph.json","events_json":"https://pith.science/api/pith-number/NV22I4G67675VLZ2NHNKEZ4VTU/events.json","paper":"https://pith.science/paper/NV22I4G6"},"agent_actions":{"view_html":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU","download_json":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU.json","view_paper":"https://pith.science/paper/NV22I4G6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2309.10887&json=true","fetch_graph":"https://pith.science/api/pith-number/NV22I4G67675VLZ2NHNKEZ4VTU/graph.json","fetch_events":"https://pith.science/api/pith-number/NV22I4G67675VLZ2NHNKEZ4VTU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU/action/storage_attestation","attest_author":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU/action/author_attestation","sign_citation":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU/action/citation_signature","submit_replication":"https://pith.science/pith/NV22I4G67675VLZ2NHNKEZ4VTU/action/replication_record"}},"created_at":"2026-07-05T06:52:28.049672+00:00","updated_at":"2026-07-05T06:52:28.049672+00:00"}