{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:V5SHNXQJW6OZ7RRDF26A4G3M6B","short_pith_number":"pith:V5SHNXQJ","schema_version":"1.0","canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","source":{"kind":"arxiv","id":"1306.3004","version":2},"attestation_state":"computed","paper":{"title":"Pseudorandomness for Regular Branching Programs via Fourier Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Omer Reingold, Salil Vadhan, Thomas Steinke","submitted_at":"2013-06-13T01:41:14Z","abstract_excerpt":"We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of $s^{1/2+o(1)}$ for arbitrary branching programs of size $s$). Our techniques also give seed length $n^{1/2+o(1)}$ for general oblivious, read-once bra"},"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":"1306.3004","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2013-06-13T01:41:14Z","cross_cats_sorted":[],"title_canon_sha256":"a60ff9cdaf8ceea1135b46835a4e069a33a338f59c629e9eb5c994759a59dd66","abstract_canon_sha256":"5ae2f50fffa09f758c3331d2c589b5362865ca6a27408d0dcef999e80750f698"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:20:22.089066Z","signature_b64":"rRHJRWzEKKxw5FvpAm/8XiL9eFH+xC+gmfRiKc8ZcaKxrrRbx2Gosa3kARonnRgAt/rqekXM3uO8kzYnMOJNCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af6476de09b79d9fc6232ebc0e1b6cf063c6b9ae1fb19105b6e21221c339a250","last_reissued_at":"2026-05-18T03:20:22.088364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:20:22.088364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandomness for Regular Branching Programs via Fourier Analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Omer Reingold, Salil Vadhan, Thomas Steinke","submitted_at":"2013-06-13T01:41:14Z","abstract_excerpt":"We present an explicit pseudorandom generator for oblivious, read-once, permutation branching programs of constant width that can read their input bits in any order. The seed length is $O(\\log^2 n)$, where $n$ is the length of the branching program. The previous best seed length known for this model was $n^{1/2+o(1)}$, which follows as a special case of a generator due to Impagliazzo, Meka, and Zuckerman (FOCS 2012) (which gives a seed length of $s^{1/2+o(1)}$ for arbitrary branching programs of size $s$). Our techniques also give seed length $n^{1/2+o(1)}$ for general oblivious, read-once bra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3004","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1306.3004","created_at":"2026-05-18T03:20:22.088463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1306.3004v2","created_at":"2026-05-18T03:20:22.088463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3004","created_at":"2026-05-18T03:20:22.088463+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5SHNXQJW6OZ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5SHNXQJW6OZ7RRD","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5SHNXQJ","created_at":"2026-05-18T12:28:04.890932+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/V5SHNXQJW6OZ7RRDF26A4G3M6B","json":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B.json","graph_json":"https://pith.science/api/pith-number/V5SHNXQJW6OZ7RRDF26A4G3M6B/graph.json","events_json":"https://pith.science/api/pith-number/V5SHNXQJW6OZ7RRDF26A4G3M6B/events.json","paper":"https://pith.science/paper/V5SHNXQJ"},"agent_actions":{"view_html":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B","download_json":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B.json","view_paper":"https://pith.science/paper/V5SHNXQJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1306.3004&json=true","fetch_graph":"https://pith.science/api/pith-number/V5SHNXQJW6OZ7RRDF26A4G3M6B/graph.json","fetch_events":"https://pith.science/api/pith-number/V5SHNXQJW6OZ7RRDF26A4G3M6B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/action/storage_attestation","attest_author":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/action/author_attestation","sign_citation":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/action/citation_signature","submit_replication":"https://pith.science/pith/V5SHNXQJW6OZ7RRDF26A4G3M6B/action/replication_record"}},"created_at":"2026-05-18T03:20:22.088463+00:00","updated_at":"2026-05-18T03:20:22.088463+00:00"}