{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:FERIEQJ32VDNFPJOBOIP5O6VJH","short_pith_number":"pith:FERIEQJ3","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"},"canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","source":{"kind":"arxiv","id":"1205.6218","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6218","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6218v3","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6218","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"FERIEQJ32VDN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FERIEQJ32VDNFPJO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FERIEQJ3","created_at":"2026-05-18T12:27:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:FERIEQJ32VDNFPJOBOIP5O6VJH","target":"record","payload":{"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"},"canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","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"},"source_kind":"arxiv","source_id":"1205.6218","source_version":3,"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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I8zBXBnKA83eG56IoGQz5ArOsj4Op+bXmbpywm+rDuwCH2fEyppUPgKAVF+iV0kQNxKLSzu7qiX60y5E+lj0Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:52:04.838755Z"},"content_sha256":"2df638c885a42f3ece00be0e50b44b75bd9f13277ff69e9521bad7b02eae314b","schema_version":"1.0","event_id":"sha256:2df638c885a42f3ece00be0e50b44b75bd9f13277ff69e9521bad7b02eae314b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:FERIEQJ32VDNFPJOBOIP5O6VJH","target":"graph","payload":{"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"},"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-18T03:27:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ArAf6vumyr6eRN1NsMCLOy1Mbd+i/TyCGOSHeMNB4x1bDZwxLmkXgHXhI78ut+jMckXkDtEGz5LhzFpZYwKcBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T05:52:04.839103Z"},"content_sha256":"748e15ea0616b91f98492a038befe0e997d6024d54c82540afad7306ba15b0cf","schema_version":"1.0","event_id":"sha256:748e15ea0616b91f98492a038befe0e997d6024d54c82540afad7306ba15b0cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/bundle.json","state_url":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/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-20T05:52:04Z","links":{"resolver":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH","bundle":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/bundle.json","state":"https://pith.science/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FERIEQJ32VDNFPJOBOIP5O6VJH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:FERIEQJ32VDNFPJOBOIP5O6VJH","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":"b9a96157eca34d3a71481f3df244af6cfd460839a23388d1691f23bf70384ab3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-28T21:02:50Z","title_canon_sha256":"757ac129b5e878adee256a60284f69e9542867d892b1b181ef015522964130ac"},"schema_version":"1.0","source":{"id":"1205.6218","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1205.6218","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"arxiv_version","alias_value":"1205.6218v3","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.6218","created_at":"2026-05-18T03:27:42Z"},{"alias_kind":"pith_short_12","alias_value":"FERIEQJ32VDN","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_16","alias_value":"FERIEQJ32VDNFPJO","created_at":"2026-05-18T12:27:06Z"},{"alias_kind":"pith_short_8","alias_value":"FERIEQJ3","created_at":"2026-05-18T12:27:06Z"}],"graph_snapshots":[{"event_id":"sha256:748e15ea0616b91f98492a038befe0e997d6024d54c82540afad7306ba15b0cf","target":"graph","created_at":"2026-05-18T03:27:42Z","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":"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","authors_text":"Alexander Russell, Cristopher Moore","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-28T21:02:50Z","title":"Optimal epsilon-biased sets with just a little randomness"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.6218","kind":"arxiv","version":3},"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:2df638c885a42f3ece00be0e50b44b75bd9f13277ff69e9521bad7b02eae314b","target":"record","created_at":"2026-05-18T03:27:42Z","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":"b9a96157eca34d3a71481f3df244af6cfd460839a23388d1691f23bf70384ab3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-05-28T21:02:50Z","title_canon_sha256":"757ac129b5e878adee256a60284f69e9542867d892b1b181ef015522964130ac"},"schema_version":"1.0","source":{"id":"1205.6218","kind":"arxiv","version":3}},"canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"292282413bd546d2bd2e0b90febbd549d8e31076a388a7978827504c0cd9d8d9","first_computed_at":"2026-05-18T03:27:42.841693Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:42.841693Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9si9XoOjzG42iIDTFsSOjcGhtr6ZOUVxBWgWovH21rrueq8FLHtbU6GCL5pfXmC7AEBZ/2DyvMTOa7dLYw6oDw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:42.842250Z","signed_message":"canonical_sha256_bytes"},"source_id":"1205.6218","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2df638c885a42f3ece00be0e50b44b75bd9f13277ff69e9521bad7b02eae314b","sha256:748e15ea0616b91f98492a038befe0e997d6024d54c82540afad7306ba15b0cf"],"state_sha256":"a3cde71865d8dd687c7ca968121f26cdb885020cbc9b90e96a6e36d4a93823a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VgKZFgL5UTcr2WGfnG0wU+2wjnbiAND5nHc7Okig2nDTbEoYM9uTfYg4KdIgcvt0OBLPCYGkJCik9KelDkvTDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T05:52:04.841044Z","bundle_sha256":"58b5222f9d8c991a93d795451feb4759de5ff472de3cf2ae4de6d212034442b2"}}