{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:URAO5ALEEQOYVPZP27TIVJG4WO","short_pith_number":"pith:URAO5ALE","schema_version":"1.0","canonical_sha256":"a440ee8164241d8abf2fd7e68aa4dcb3abd417e1e4b06e18e6295433913eabb5","source":{"kind":"arxiv","id":"1806.04256","version":1},"attestation_state":"computed","paper":{"title":"Pseudorandom Generators for Width-3 Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Omer Reingold, Raghu Meka","submitted_at":"2018-06-11T22:06:09Z","abstract_excerpt":"We construct pseudorandom generators of seed length $\\tilde{O}(\\log(n)\\cdot \\log(1/\\epsilon))$ that $\\epsilon$-fool ordered read-once branching programs (ROBPs) of width $3$ and length $n$. For unordered ROBPs, we construct pseudorandom generators with seed length $\\tilde{O}(\\log(n) \\cdot \\mathrm{poly}(1/\\epsilon))$. This is the first improvement for pseudorandom generators fooling width $3$ ROBPs since the work of Nisan [Combinatorica, 1992].\n  Our constructions are based on the `iterated milder restrictions' approach of Gopalan et al. [FOCS, 2012] (which further extends the Ajtai-Wigderson f"},"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":"1806.04256","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-06-11T22:06:09Z","cross_cats_sorted":[],"title_canon_sha256":"a17fe6c5e698fd385eb0eec71628307d7aeff54175e486d18593d0886a8faa3f","abstract_canon_sha256":"926508c61c861d34cd159fca061c7354f6981ce373cd7c0029b4fe91e7bdef8b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:36.094741Z","signature_b64":"k/m+zbKLxpHzdvnLZtU/0nxU+rLKGMmhEyGgBZDnOtLYvVTJGF3JrfZRxAaqxabSY5xeLxJybLV6/QGLAkCRDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a440ee8164241d8abf2fd7e68aa4dcb3abd417e1e4b06e18e6295433913eabb5","last_reissued_at":"2026-05-18T00:13:36.094100Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:36.094100Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandom Generators for Width-3 Branching Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Avishay Tal, Omer Reingold, Raghu Meka","submitted_at":"2018-06-11T22:06:09Z","abstract_excerpt":"We construct pseudorandom generators of seed length $\\tilde{O}(\\log(n)\\cdot \\log(1/\\epsilon))$ that $\\epsilon$-fool ordered read-once branching programs (ROBPs) of width $3$ and length $n$. For unordered ROBPs, we construct pseudorandom generators with seed length $\\tilde{O}(\\log(n) \\cdot \\mathrm{poly}(1/\\epsilon))$. This is the first improvement for pseudorandom generators fooling width $3$ ROBPs since the work of Nisan [Combinatorica, 1992].\n  Our constructions are based on the `iterated milder restrictions' approach of Gopalan et al. [FOCS, 2012] (which further extends the Ajtai-Wigderson f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.04256","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":"1806.04256","created_at":"2026-05-18T00:13:36.094185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.04256v1","created_at":"2026-05-18T00:13:36.094185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.04256","created_at":"2026-05-18T00:13:36.094185+00:00"},{"alias_kind":"pith_short_12","alias_value":"URAO5ALEEQOY","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"URAO5ALEEQOYVPZP","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"URAO5ALE","created_at":"2026-05-18T12:32:56.356000+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/URAO5ALEEQOYVPZP27TIVJG4WO","json":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO.json","graph_json":"https://pith.science/api/pith-number/URAO5ALEEQOYVPZP27TIVJG4WO/graph.json","events_json":"https://pith.science/api/pith-number/URAO5ALEEQOYVPZP27TIVJG4WO/events.json","paper":"https://pith.science/paper/URAO5ALE"},"agent_actions":{"view_html":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO","download_json":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO.json","view_paper":"https://pith.science/paper/URAO5ALE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.04256&json=true","fetch_graph":"https://pith.science/api/pith-number/URAO5ALEEQOYVPZP27TIVJG4WO/graph.json","fetch_events":"https://pith.science/api/pith-number/URAO5ALEEQOYVPZP27TIVJG4WO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO/action/storage_attestation","attest_author":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO/action/author_attestation","sign_citation":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO/action/citation_signature","submit_replication":"https://pith.science/pith/URAO5ALEEQOYVPZP27TIVJG4WO/action/replication_record"}},"created_at":"2026-05-18T00:13:36.094185+00:00","updated_at":"2026-05-18T00:13:36.094185+00:00"}