{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:TJETZXNVSOPG5VYXOKDT2ICO6M","short_pith_number":"pith:TJETZXNV","schema_version":"1.0","canonical_sha256":"9a493cddb5939e6ed71772873d204ef324ab309d9dd7cec6844fbf87aab0ee69","source":{"kind":"arxiv","id":"1503.02286","version":1},"attestation_state":"computed","paper":{"title":"Three-Source Extractors for Polylogarithmic Min-Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Xin Li","submitted_at":"2015-03-08T15:25:15Z","abstract_excerpt":"We continue the study of constructing explicit extractors for independent general weak random sources. The ultimate goal is to give a construction that matches what is given by the probabilistic method --- an extractor for two independent $n$-bit weak random sources with min-entropy as small as $\\log n+O(1)$. Previously, the best known result in the two-source case is an extractor by Bourgain \\cite{Bourgain05}, which works for min-entropy $0.49n$; and the best known result in the general case is an earlier work of the author \\cite{Li13b}, which gives an extractor for a constant number of indep"},"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":"1503.02286","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-03-08T15:25:15Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"cc196cb442647f727d85c2f47bec3df7142ee923fa9b5f45cd6379b2be666e65","abstract_canon_sha256":"814465a1cc8e922fa5f5ffdd839f6025b928d8495a6998edaa9f8c5578002653"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:25.428216Z","signature_b64":"EK0GJ93HaxgJnTypMxesUThQ57tyvVsjrmw1N/PxB+X7MbWAnXkR4yjTiwXoHqp/nUNsRmEDvJ4FQcHY9dKlAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a493cddb5939e6ed71772873d204ef324ab309d9dd7cec6844fbf87aab0ee69","last_reissued_at":"2026-05-18T02:25:25.427842Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:25.427842Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Three-Source Extractors for Polylogarithmic Min-Entropy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CC","authors_text":"Xin Li","submitted_at":"2015-03-08T15:25:15Z","abstract_excerpt":"We continue the study of constructing explicit extractors for independent general weak random sources. The ultimate goal is to give a construction that matches what is given by the probabilistic method --- an extractor for two independent $n$-bit weak random sources with min-entropy as small as $\\log n+O(1)$. Previously, the best known result in the two-source case is an extractor by Bourgain \\cite{Bourgain05}, which works for min-entropy $0.49n$; and the best known result in the general case is an earlier work of the author \\cite{Li13b}, which gives an extractor for a constant number of indep"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.02286","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":"1503.02286","created_at":"2026-05-18T02:25:25.427900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.02286v1","created_at":"2026-05-18T02:25:25.427900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.02286","created_at":"2026-05-18T02:25:25.427900+00:00"},{"alias_kind":"pith_short_12","alias_value":"TJETZXNVSOPG","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"TJETZXNVSOPG5VYX","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"TJETZXNV","created_at":"2026-05-18T12:29:42.218222+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2404.11283","citing_title":"A robust and composable device-independent protocol for oblivious transfer using (fully) untrusted quantum devices in the bounded storage model","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M","json":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M.json","graph_json":"https://pith.science/api/pith-number/TJETZXNVSOPG5VYXOKDT2ICO6M/graph.json","events_json":"https://pith.science/api/pith-number/TJETZXNVSOPG5VYXOKDT2ICO6M/events.json","paper":"https://pith.science/paper/TJETZXNV"},"agent_actions":{"view_html":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M","download_json":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M.json","view_paper":"https://pith.science/paper/TJETZXNV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.02286&json=true","fetch_graph":"https://pith.science/api/pith-number/TJETZXNVSOPG5VYXOKDT2ICO6M/graph.json","fetch_events":"https://pith.science/api/pith-number/TJETZXNVSOPG5VYXOKDT2ICO6M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M/action/storage_attestation","attest_author":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M/action/author_attestation","sign_citation":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M/action/citation_signature","submit_replication":"https://pith.science/pith/TJETZXNVSOPG5VYXOKDT2ICO6M/action/replication_record"}},"created_at":"2026-05-18T02:25:25.427900+00:00","updated_at":"2026-05-18T02:25:25.427900+00:00"}