{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2002:3SEWFX5KXVTS2RR6NGHWDOD2XE","short_pith_number":"pith:3SEWFX5K","schema_version":"1.0","canonical_sha256":"dc8962dfaabd672d463e698f61b87ab9142abc62d363f524bcb1446b0f3afdd9","source":{"kind":"arxiv","id":"quant-ph/0202066","version":1},"attestation_state":"computed","paper":{"title":"Quantum DNF Learnability Revisited","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christino Tamon, Jeffrey C. Jackson, Tomoyuki Yamakami","submitted_at":"2002-02-12T17:29:08Z","abstract_excerpt":"We describe a quantum PAC learning algorithm for DNF formulae under the uniform distribution with a query complexity of $\\tilde{O}(s^{3}/\\epsilon + s^{2}/\\epsilon^{2})$, where $s$ is the size of DNF formula and $\\epsilon$ is the PAC error accuracy. If $s$ and $1/\\epsilon$ are comparable, this gives a modest improvement over a previously known classical query complexity of $\\tilde{O}(ns^{2}/\\epsilon^{2})$. We also show a lower bound of $\\Omega(s\\log n/n)$ on the query complexity of any quantum PAC algorithm for learning a DNF of size $s$ with $n$ inputs under the uniform distribution."},"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":"quant-ph/0202066","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"quant-ph","submitted_at":"2002-02-12T17:29:08Z","cross_cats_sorted":[],"title_canon_sha256":"07b40c06ec0b6bf4edf98faf56a729a49ca8c5ab13d75f7b28c6b9371bc1fe1f","abstract_canon_sha256":"46abdd2e80b9b58d19ae50e63f9dcdca3d67a0a0e0cc53a075862978436bb7fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:11:18.205751Z","signature_b64":"IiZ819kwkWzvmqSctV/qDAeeB4EUneTAAoGL5qva6RyfzD+tQ4OtKgCXqwkb7jcKJZ4j/eVxnxqtPJUFsu4WAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dc8962dfaabd672d463e698f61b87ab9142abc62d363f524bcb1446b0f3afdd9","last_reissued_at":"2026-05-18T04:11:18.205164Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:11:18.205164Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum DNF Learnability Revisited","license":"","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Christino Tamon, Jeffrey C. Jackson, Tomoyuki Yamakami","submitted_at":"2002-02-12T17:29:08Z","abstract_excerpt":"We describe a quantum PAC learning algorithm for DNF formulae under the uniform distribution with a query complexity of $\\tilde{O}(s^{3}/\\epsilon + s^{2}/\\epsilon^{2})$, where $s$ is the size of DNF formula and $\\epsilon$ is the PAC error accuracy. If $s$ and $1/\\epsilon$ are comparable, this gives a modest improvement over a previously known classical query complexity of $\\tilde{O}(ns^{2}/\\epsilon^{2})$. We also show a lower bound of $\\Omega(s\\log n/n)$ on the query complexity of any quantum PAC algorithm for learning a DNF of size $s$ with $n$ inputs under the uniform distribution."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"quant-ph/0202066","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":"quant-ph/0202066","created_at":"2026-05-18T04:11:18.205225+00:00"},{"alias_kind":"arxiv_version","alias_value":"quant-ph/0202066v1","created_at":"2026-05-18T04:11:18.205225+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.quant-ph/0202066","created_at":"2026-05-18T04:11:18.205225+00:00"},{"alias_kind":"pith_short_12","alias_value":"3SEWFX5KXVTS","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3SEWFX5KXVTS2RR6","created_at":"2026-05-18T12:25:50.845339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3SEWFX5K","created_at":"2026-05-18T12:25:50.845339+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/3SEWFX5KXVTS2RR6NGHWDOD2XE","json":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE.json","graph_json":"https://pith.science/api/pith-number/3SEWFX5KXVTS2RR6NGHWDOD2XE/graph.json","events_json":"https://pith.science/api/pith-number/3SEWFX5KXVTS2RR6NGHWDOD2XE/events.json","paper":"https://pith.science/paper/3SEWFX5K"},"agent_actions":{"view_html":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE","download_json":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE.json","view_paper":"https://pith.science/paper/3SEWFX5K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=quant-ph/0202066&json=true","fetch_graph":"https://pith.science/api/pith-number/3SEWFX5KXVTS2RR6NGHWDOD2XE/graph.json","fetch_events":"https://pith.science/api/pith-number/3SEWFX5KXVTS2RR6NGHWDOD2XE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE/action/storage_attestation","attest_author":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE/action/author_attestation","sign_citation":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE/action/citation_signature","submit_replication":"https://pith.science/pith/3SEWFX5KXVTS2RR6NGHWDOD2XE/action/replication_record"}},"created_at":"2026-05-18T04:11:18.205225+00:00","updated_at":"2026-05-18T04:11:18.205225+00:00"}