{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:B7NVDLR3ON2NSCZ4WYHH4ZG76W","short_pith_number":"pith:B7NVDLR3","schema_version":"1.0","canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","source":{"kind":"arxiv","id":"1210.0049","version":1},"attestation_state":"computed","paper":{"title":"Better Pseudorandom Generators from Milder Pseudorandom Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Luca Trevisan, Omer Reingold, Parikshit Gopalan, Raghu Meka, Salil Vadhan","submitted_at":"2012-09-28T21:58:10Z","abstract_excerpt":"We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-length O(log (n/epsilon)) for error epsilon. Previously, only constructions with seed-length O(\\log^{3/2} n) or O(\\log^2 n) were known for these classes with polynomially small error.\n  The (pseudo)rando"},"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":"1210.0049","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-09-28T21:58:10Z","cross_cats_sorted":[],"title_canon_sha256":"ff7d20da5488968abbf89f7166b03a0b0c5abf474f31d376062c42522e6ea87e","abstract_canon_sha256":"4f149f62e8dae81a1885314bb809b3867e6fc0285e292d25fffbb30c4156edff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:23.458706Z","signature_b64":"FgrkXE62enoIB/kOmCSnyJeiATALpEq8fvHc6he/oq4JDLe5th7CHndysqzuijRbaRm1eX9//KF6FenNRwqOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0fdb51ae3b7374d90b3cb60e7e64dff590cc86741ff6cc143543816274118ee1","last_reissued_at":"2026-05-18T03:44:23.458197Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:23.458197Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Better Pseudorandom Generators from Milder Pseudorandom Restrictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Luca Trevisan, Omer Reingold, Parikshit Gopalan, Raghu Meka, Salil Vadhan","submitted_at":"2012-09-28T21:58:10Z","abstract_excerpt":"We present an iterative approach to constructing pseudorandom generators, based on the repeated application of mild pseudorandom restrictions. We use this template to construct pseudorandom generators for combinatorial rectangles and read-once CNFs and a hitting set generator for width-3 branching programs, all of which achieve near-optimal seed-length even in the low-error regime: We get seed-length O(log (n/epsilon)) for error epsilon. Previously, only constructions with seed-length O(\\log^{3/2} n) or O(\\log^2 n) were known for these classes with polynomially small error.\n  The (pseudo)rando"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0049","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":"1210.0049","created_at":"2026-05-18T03:44:23.458273+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0049v1","created_at":"2026-05-18T03:44:23.458273+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0049","created_at":"2026-05-18T03:44:23.458273+00:00"},{"alias_kind":"pith_short_12","alias_value":"B7NVDLR3ON2N","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_16","alias_value":"B7NVDLR3ON2NSCZ4","created_at":"2026-05-18T12:26:58.693483+00:00"},{"alias_kind":"pith_short_8","alias_value":"B7NVDLR3","created_at":"2026-05-18T12:26:58.693483+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/B7NVDLR3ON2NSCZ4WYHH4ZG76W","json":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W.json","graph_json":"https://pith.science/api/pith-number/B7NVDLR3ON2NSCZ4WYHH4ZG76W/graph.json","events_json":"https://pith.science/api/pith-number/B7NVDLR3ON2NSCZ4WYHH4ZG76W/events.json","paper":"https://pith.science/paper/B7NVDLR3"},"agent_actions":{"view_html":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W","download_json":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W.json","view_paper":"https://pith.science/paper/B7NVDLR3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0049&json=true","fetch_graph":"https://pith.science/api/pith-number/B7NVDLR3ON2NSCZ4WYHH4ZG76W/graph.json","fetch_events":"https://pith.science/api/pith-number/B7NVDLR3ON2NSCZ4WYHH4ZG76W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/action/storage_attestation","attest_author":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/action/author_attestation","sign_citation":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/action/citation_signature","submit_replication":"https://pith.science/pith/B7NVDLR3ON2NSCZ4WYHH4ZG76W/action/replication_record"}},"created_at":"2026-05-18T03:44:23.458273+00:00","updated_at":"2026-05-18T03:44:23.458273+00:00"}