{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:UUP5XR2TVWJAG4NTFHIN4K43VO","short_pith_number":"pith:UUP5XR2T","schema_version":"1.0","canonical_sha256":"a51fdbc753ad920371b329d0de2b9bab81b106a29de4374a6d77ca7fec127cf1","source":{"kind":"arxiv","id":"0910.4122","version":5},"attestation_state":"computed","paper":{"title":"Pseudorandom Generators for Polynomial Threshold Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Zuckerman, Raghu Meka","submitted_at":"2009-10-21T15:48:00Z","abstract_excerpt":"We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no nontrivial constructions were known even for quadratic threshold functions and constant error eps. For the class of degree 1 threshold functions or halfspaces, we construct PRGs with much better dependence on the error parameter eps and obtain a PRG with seed-length O(log n + log^2(1/eps)). Previously, only PRGs with seed length O(log n log^2(1/eps)/eps^2) w"},"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":"0910.4122","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2009-10-21T15:48:00Z","cross_cats_sorted":[],"title_canon_sha256":"8e433975fe3ee24ee3358454f5570b4afa89455cac5f76c65017e36795e21c54","abstract_canon_sha256":"816a619a4995c49b828f6345b8a58525e242e6cee4dc752520ca83e198199ef2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:24:46.700581Z","signature_b64":"j2ggYTRimBJfQGb4NSM5JyW493YmamUffVekKItHQgKvNsTKqfdl9bbf1uMXjjdM/BGH4tMTdnw6v8VSPWaiDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a51fdbc753ad920371b329d0de2b9bab81b106a29de4374a6d77ca7fec127cf1","last_reissued_at":"2026-05-18T02:24:46.700115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:24:46.700115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandom Generators for Polynomial Threshold Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"David Zuckerman, Raghu Meka","submitted_at":"2009-10-21T15:48:00Z","abstract_excerpt":"We study the natural question of constructing pseudorandom generators (PRGs) for low-degree polynomial threshold functions (PTFs). We give a PRG with seed-length log n/eps^{O(d)} fooling degree d PTFs with error at most eps. Previously, no nontrivial constructions were known even for quadratic threshold functions and constant error eps. For the class of degree 1 threshold functions or halfspaces, we construct PRGs with much better dependence on the error parameter eps and obtain a PRG with seed-length O(log n + log^2(1/eps)). Previously, only PRGs with seed length O(log n log^2(1/eps)/eps^2) w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0910.4122","kind":"arxiv","version":5},"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":"0910.4122","created_at":"2026-05-18T02:24:46.700189+00:00"},{"alias_kind":"arxiv_version","alias_value":"0910.4122v5","created_at":"2026-05-18T02:24:46.700189+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0910.4122","created_at":"2026-05-18T02:24:46.700189+00:00"},{"alias_kind":"pith_short_12","alias_value":"UUP5XR2TVWJA","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_16","alias_value":"UUP5XR2TVWJAG4NT","created_at":"2026-05-18T12:26:02.257875+00:00"},{"alias_kind":"pith_short_8","alias_value":"UUP5XR2T","created_at":"2026-05-18T12:26:02.257875+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.19809","citing_title":"Deterministic Volume Estimation of Truncated Hypercubes","ref_index":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO","json":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO.json","graph_json":"https://pith.science/api/pith-number/UUP5XR2TVWJAG4NTFHIN4K43VO/graph.json","events_json":"https://pith.science/api/pith-number/UUP5XR2TVWJAG4NTFHIN4K43VO/events.json","paper":"https://pith.science/paper/UUP5XR2T"},"agent_actions":{"view_html":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO","download_json":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO.json","view_paper":"https://pith.science/paper/UUP5XR2T","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0910.4122&json=true","fetch_graph":"https://pith.science/api/pith-number/UUP5XR2TVWJAG4NTFHIN4K43VO/graph.json","fetch_events":"https://pith.science/api/pith-number/UUP5XR2TVWJAG4NTFHIN4K43VO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO/action/storage_attestation","attest_author":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO/action/author_attestation","sign_citation":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO/action/citation_signature","submit_replication":"https://pith.science/pith/UUP5XR2TVWJAG4NTFHIN4K43VO/action/replication_record"}},"created_at":"2026-05-18T02:24:46.700189+00:00","updated_at":"2026-05-18T02:24:46.700189+00:00"}