{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:FERIEQJ32VDNFPJOBOIP5O6VJH","short_pith_number":"pith:FERIEQJ3","schema_version":"1.0","canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","source":{"kind":"arxiv","id":"1205.6218","version":3},"attestation_state":"computed","paper":{"title":"Optimal epsilon-biased sets with just a little randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Alexander Russell, Cristopher Moore","submitted_at":"2012-05-28T21:02:50Z","abstract_excerpt":"Subsets of F_2^n that are eps-biased, meaning that the parity of any set of bits is even or odd with probability eps close to 1/2, are powerful tools for derandomization. A simple randomized construction shows that such sets exist of size O(n/eps^2), and known deterministic constructions achieve sets of size O(n/eps^3), O(n^2/eps^2), and O((n/eps^2)^{5/4}). Rather than derandomizing these sets completely in exchange for making them larger, we attempt a partial derandomization while keeping them small, constructing sets of size O(n/eps^2) with as few random bits as possible. The naive randomize"},"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":"1205.6218","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-28T21:02:50Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"757ac129b5e878adee256a60284f69e9542867d892b1b181ef015522964130ac","abstract_canon_sha256":"b9a96157eca34d3a71481f3df244af6cfd460839a23388d1691f23bf70384ab3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.842250Z","signature_b64":"9si9XoOjzG42iIDTFsSOjcGhtr6ZOUVxBWgWovH21rrueq8FLHtbU6GCL5pfXmC7AEBZ/2DyvMTOa7dLYw6oDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","last_reissued_at":"2026-05-18T03:27:42.841693Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.841693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal epsilon-biased sets with just a little randomness","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Alexander Russell, Cristopher Moore","submitted_at":"2012-05-28T21:02:50Z","abstract_excerpt":"Subsets of F_2^n that are eps-biased, meaning that the parity of any set of bits is even or odd with probability eps close to 1/2, are powerful tools for derandomization. A simple randomized construction shows that such sets exist of size O(n/eps^2), and known deterministic constructions achieve sets of size O(n/eps^3), O(n^2/eps^2), and O((n/eps^2)^{5/4}). Rather than derandomizing these sets completely in exchange for making them larger, we attempt a partial derandomization while keeping them small, constructing sets of size O(n/eps^2) with as few random bits as possible. The naive randomize"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6218","kind":"arxiv","version":3},"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":"1205.6218","created_at":"2026-05-18T03:27:42.841772+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.6218v3","created_at":"2026-05-18T03:27:42.841772+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6218","created_at":"2026-05-18T03:27:42.841772+00:00"},{"alias_kind":"pith_short_12","alias_value":"FERIEQJ32VDN","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"FERIEQJ32VDNFPJO","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"FERIEQJ3","created_at":"2026-05-18T12:27:06.952714+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/FERIEQJ32VDNFPJOBOIP5O6VJH","json":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH.json","graph_json":"https://pith.science/api/pith-number/FERIEQJ32VDNFPJOBOIP5O6VJH/graph.json","events_json":"https://pith.science/api/pith-number/FERIEQJ32VDNFPJOBOIP5O6VJH/events.json","paper":"https://pith.science/paper/FERIEQJ3"},"agent_actions":{"view_html":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH","download_json":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH.json","view_paper":"https://pith.science/paper/FERIEQJ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.6218&json=true","fetch_graph":"https://pith.science/api/pith-number/FERIEQJ32VDNFPJOBOIP5O6VJH/graph.json","fetch_events":"https://pith.science/api/pith-number/FERIEQJ32VDNFPJOBOIP5O6VJH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/action/storage_attestation","attest_author":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/action/author_attestation","sign_citation":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/action/citation_signature","submit_replication":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/action/replication_record"}},"created_at":"2026-05-18T03:27:42.841772+00:00","updated_at":"2026-05-18T03:27:42.841772+00:00"}