{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y2BOGJBF3SVVJB2FPZSYI5IECM","short_pith_number":"pith:Y2BOGJBF","schema_version":"1.0","canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","source":{"kind":"arxiv","id":"1605.04194","version":2},"attestation_state":"computed","paper":{"title":"Quantum-Proof Extractors: Optimal up to Constant Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gil Cohen, Kai-Min Chung, Thomas Vidick, Xiaodi Wu","submitted_at":"2016-05-13T14:42:05Z","abstract_excerpt":"We give the first construction of a family of quantum-proof extractors that has optimal seed length dependence $O(\\log(n/\\varepsilon))$ on the input length $n$ and error $\\varepsilon$. Our extractors support any min-entropy $k=\\Omega(\\log{n} + \\log^{1+\\alpha}(1/\\varepsilon))$ and extract $m=(1-\\alpha)k$ bits that are $\\varepsilon$-close to uniform, for any desired constant $\\alpha > 0$. Previous constructions had a quadratically worse seed length or were restricted to very large input min-entropy or very few output bits.\n  Our result is based on a generic reduction showing that any strong clas"},"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":"1605.04194","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-13T14:42:05Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"70f4bbb5f15a6bd834f06794f72cafd7d579d54920bc911b0e2a6eb3c6cb2a0e","abstract_canon_sha256":"5de2280d8b20a35872e81f25b0c3fe1364318fb2c5e9e7445ebfcf24884d31af"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:14.358775Z","signature_b64":"BVvTjl/uCKwXt2VcpjdkoPxU3UTRyMDKOlBszQvyrW57x0iGHfSfzvfqob1rTnZ1TA3Qrg/BGEEXsXrn3qLVCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","last_reissued_at":"2026-05-18T01:10:14.358255Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:14.358255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum-Proof Extractors: Optimal up to Constant Factors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Gil Cohen, Kai-Min Chung, Thomas Vidick, Xiaodi Wu","submitted_at":"2016-05-13T14:42:05Z","abstract_excerpt":"We give the first construction of a family of quantum-proof extractors that has optimal seed length dependence $O(\\log(n/\\varepsilon))$ on the input length $n$ and error $\\varepsilon$. Our extractors support any min-entropy $k=\\Omega(\\log{n} + \\log^{1+\\alpha}(1/\\varepsilon))$ and extract $m=(1-\\alpha)k$ bits that are $\\varepsilon$-close to uniform, for any desired constant $\\alpha > 0$. Previous constructions had a quadratically worse seed length or were restricted to very large input min-entropy or very few output bits.\n  Our result is based on a generic reduction showing that any strong clas"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04194","kind":"arxiv","version":2},"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":"1605.04194","created_at":"2026-05-18T01:10:14.358327+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.04194v2","created_at":"2026-05-18T01:10:14.358327+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04194","created_at":"2026-05-18T01:10:14.358327+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2BOGJBF3SVV","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2BOGJBF3SVVJB2F","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2BOGJBF","created_at":"2026-05-18T12:30:51.357362+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/Y2BOGJBF3SVVJB2FPZSYI5IECM","json":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM.json","graph_json":"https://pith.science/api/pith-number/Y2BOGJBF3SVVJB2FPZSYI5IECM/graph.json","events_json":"https://pith.science/api/pith-number/Y2BOGJBF3SVVJB2FPZSYI5IECM/events.json","paper":"https://pith.science/paper/Y2BOGJBF"},"agent_actions":{"view_html":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM","download_json":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM.json","view_paper":"https://pith.science/paper/Y2BOGJBF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.04194&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2BOGJBF3SVVJB2FPZSYI5IECM/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2BOGJBF3SVVJB2FPZSYI5IECM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/action/storage_attestation","attest_author":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/action/author_attestation","sign_citation":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/action/citation_signature","submit_replication":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/action/replication_record"}},"created_at":"2026-05-18T01:10:14.358327+00:00","updated_at":"2026-05-18T01:10:14.358327+00:00"}