{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:Y2BOGJBF3SVVJB2FPZSYI5IECM","short_pith_number":"pith:Y2BOGJBF","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"},"canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","source":{"kind":"arxiv","id":"1605.04194","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04194","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04194v2","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04194","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"Y2BOGJBF3SVV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"Y2BOGJBF3SVVJB2F","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"Y2BOGJBF","created_at":"2026-05-18T12:30:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:Y2BOGJBF3SVVJB2FPZSYI5IECM","target":"record","payload":{"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"},"canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","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"},"source_kind":"arxiv","source_id":"1605.04194","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OdHgJlmeI2sVPDUm0zAlJkZhhFRrzYg2vnnS//8p7GR/IG9nR/X5bgELFRz+AS1j5Xi4E+2E2aZ23ZztunZ+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:47:17.973897Z"},"content_sha256":"cb7eb006e2d09cc15971b119d7dd03cc73de5b5c13698f73c8ed98dd448be2a4","schema_version":"1.0","event_id":"sha256:cb7eb006e2d09cc15971b119d7dd03cc73de5b5c13698f73c8ed98dd448be2a4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:Y2BOGJBF3SVVJB2FPZSYI5IECM","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:10:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"F/ekKYL80uqfHnvHLnCI6npJh53oCUzv9T5iAYcL6XrLYGCY82JV3D3B64N+hM6vl3jFG2L28IAX7rehzvmxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T09:47:17.974599Z"},"content_sha256":"40600f4ef1e0376946aa19415675f61765ba285d18920cce18eab65d2fc83adc","schema_version":"1.0","event_id":"sha256:40600f4ef1e0376946aa19415675f61765ba285d18920cce18eab65d2fc83adc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/bundle.json","state_url":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T09:47:17Z","links":{"resolver":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM","bundle":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/bundle.json","state":"https://pith.science/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2BOGJBF3SVVJB2FPZSYI5IECM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Y2BOGJBF3SVVJB2FPZSYI5IECM","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5de2280d8b20a35872e81f25b0c3fe1364318fb2c5e9e7445ebfcf24884d31af","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-13T14:42:05Z","title_canon_sha256":"70f4bbb5f15a6bd834f06794f72cafd7d579d54920bc911b0e2a6eb3c6cb2a0e"},"schema_version":"1.0","source":{"id":"1605.04194","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.04194","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"arxiv_version","alias_value":"1605.04194v2","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.04194","created_at":"2026-05-18T01:10:14Z"},{"alias_kind":"pith_short_12","alias_value":"Y2BOGJBF3SVV","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_16","alias_value":"Y2BOGJBF3SVVJB2F","created_at":"2026-05-18T12:30:51Z"},{"alias_kind":"pith_short_8","alias_value":"Y2BOGJBF","created_at":"2026-05-18T12:30:51Z"}],"graph_snapshots":[{"event_id":"sha256:40600f4ef1e0376946aa19415675f61765ba285d18920cce18eab65d2fc83adc","target":"graph","created_at":"2026-05-18T01:10:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Gil Cohen, Kai-Min Chung, Thomas Vidick, Xiaodi Wu","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-13T14:42:05Z","title":"Quantum-Proof Extractors: Optimal up to Constant Factors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.04194","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cb7eb006e2d09cc15971b119d7dd03cc73de5b5c13698f73c8ed98dd448be2a4","target":"record","created_at":"2026-05-18T01:10:14Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5de2280d8b20a35872e81f25b0c3fe1364318fb2c5e9e7445ebfcf24884d31af","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2016-05-13T14:42:05Z","title_canon_sha256":"70f4bbb5f15a6bd834f06794f72cafd7d579d54920bc911b0e2a6eb3c6cb2a0e"},"schema_version":"1.0","source":{"id":"1605.04194","kind":"arxiv","version":2}},"canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c682e32425dcab5487457e65847504131fd5b56f1e5400bf3a3e6a5efb520a5a","first_computed_at":"2026-05-18T01:10:14.358255Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:14.358255Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BVvTjl/uCKwXt2VcpjdkoPxU3UTRyMDKOlBszQvyrW57x0iGHfSfzvfqob1rTnZ1TA3Qrg/BGEEXsXrn3qLVCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:14.358775Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.04194","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb7eb006e2d09cc15971b119d7dd03cc73de5b5c13698f73c8ed98dd448be2a4","sha256:40600f4ef1e0376946aa19415675f61765ba285d18920cce18eab65d2fc83adc"],"state_sha256":"1b73d5662ce7a2790a84a6b83ff6d28174dcc70805985434521d261ff1628f6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2+oFllgBzpe6/T9saq+45Ac2pqWr/mZUed5r3PTzMSrYEgRxR0z++8nUbDJXGcwbt0OLefn3V9VyROQjeucRDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T09:47:17.978647Z","bundle_sha256":"ae57a7826b093de9c87229fdd906a8aeee3dd1b02cfc6a9e46affd7cc538cbab"}}