{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:FORYXKHPBXXSDGIXJGURDR7VZO","short_pith_number":"pith:FORYXKHP","schema_version":"1.0","canonical_sha256":"2ba38ba8ef0def21991749a911c7f5cb8080e13dbc70194230b99e9ec18431d1","source":{"kind":"arxiv","id":"1504.04675","version":2},"attestation_state":"computed","paper":{"title":"Pseudorandomness for Read-Once, Constant-Depth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Salil Vadhan, Sitan Chen, Thomas Steinke","submitted_at":"2015-04-18T02:46:29Z","abstract_excerpt":"For Boolean functions computed by read-once, depth-$D$ circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\\tilde{O}(\\log^{D+1} n)$. The previous best seed length known for this model was $\\tilde{O}(\\log^{D+4} n)$, obtained by Trevisan and Xue (CCC `13) for all of $AC^0$ (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness introduced by Reingold, Steinke, and Vadhan (RANDOM `13) to show that the generator of Gopalan et al. (FOCS `12) fools read-once $AC^0$. To this end, we prove a new 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":"1504.04675","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2015-04-18T02:46:29Z","cross_cats_sorted":[],"title_canon_sha256":"e6dd84e64de56dff25a27474634dd03a94a55abf7448ab2d7dc9203b6de8dc14","abstract_canon_sha256":"bb043bfc9573e1a1c27e1b65edd85d7c2b980b0328410ba0062314423d971b39"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:43.515277Z","signature_b64":"RHCGGT+1WWyfXumsNbVJoglG5/yHkc+4n7WUtqjgzwEn+OGqCPLIdLsvLkbaT6miWMnnL6sDugn/xWYQ4mpWAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2ba38ba8ef0def21991749a911c7f5cb8080e13dbc70194230b99e9ec18431d1","last_reissued_at":"2026-05-18T01:32:43.514889Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:43.514889Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandomness for Read-Once, Constant-Depth Circuits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Salil Vadhan, Sitan Chen, Thomas Steinke","submitted_at":"2015-04-18T02:46:29Z","abstract_excerpt":"For Boolean functions computed by read-once, depth-$D$ circuits with unbounded fan-in over the de Morgan basis, we present an explicit pseudorandom generator with seed length $\\tilde{O}(\\log^{D+1} n)$. The previous best seed length known for this model was $\\tilde{O}(\\log^{D+4} n)$, obtained by Trevisan and Xue (CCC `13) for all of $AC^0$ (not just read-once). Our work makes use of Fourier analytic techniques for pseudorandomness introduced by Reingold, Steinke, and Vadhan (RANDOM `13) to show that the generator of Gopalan et al. (FOCS `12) fools read-once $AC^0$. To this end, we prove a new F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.04675","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":"1504.04675","created_at":"2026-05-18T01:32:43.514947+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.04675v2","created_at":"2026-05-18T01:32:43.514947+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.04675","created_at":"2026-05-18T01:32:43.514947+00:00"},{"alias_kind":"pith_short_12","alias_value":"FORYXKHPBXXS","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"FORYXKHPBXXSDGIX","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"FORYXKHP","created_at":"2026-05-18T12:29:19.899920+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/FORYXKHPBXXSDGIXJGURDR7VZO","json":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO.json","graph_json":"https://pith.science/api/pith-number/FORYXKHPBXXSDGIXJGURDR7VZO/graph.json","events_json":"https://pith.science/api/pith-number/FORYXKHPBXXSDGIXJGURDR7VZO/events.json","paper":"https://pith.science/paper/FORYXKHP"},"agent_actions":{"view_html":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO","download_json":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO.json","view_paper":"https://pith.science/paper/FORYXKHP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.04675&json=true","fetch_graph":"https://pith.science/api/pith-number/FORYXKHPBXXSDGIXJGURDR7VZO/graph.json","fetch_events":"https://pith.science/api/pith-number/FORYXKHPBXXSDGIXJGURDR7VZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO/action/storage_attestation","attest_author":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO/action/author_attestation","sign_citation":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO/action/citation_signature","submit_replication":"https://pith.science/pith/FORYXKHPBXXSDGIXJGURDR7VZO/action/replication_record"}},"created_at":"2026-05-18T01:32:43.514947+00:00","updated_at":"2026-05-18T01:32:43.514947+00:00"}