{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:SXJUGBSRKEWNLZND6IVYCCHDOC","short_pith_number":"pith:SXJUGBSR","schema_version":"1.0","canonical_sha256":"95d3430651512cd5e5a3f22b8108e37093bc4af8607d4b9000dd56611eb61b9e","source":{"kind":"arxiv","id":"2304.06853","version":2},"attestation_state":"computed","paper":{"title":"Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Mikkel Thorup, Praneeth Kacham, Rasmus Pagh","submitted_at":"2023-04-13T22:44:22Z","abstract_excerpt":"We revisit Nisan's classical pseudorandom generator (PRG) for space-bounded computation (STOC 1990) and its applications in streaming algorithms. We describe a new generator, HashPRG, that can be thought of as a symmetric version of Nisan's generator over larger alphabets. Our generator allows a trade-off between seed length and the time needed to compute a given block of the generator's output. HashPRG can be used to obtain derandomizations with much better update time and \\emph{without sacrificing space} for a large number of data stream algorithms, such as $F_p$ estimation in the parameter "},"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":"2304.06853","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2023-04-13T22:44:22Z","cross_cats_sorted":[],"title_canon_sha256":"86d23bcb566fa50379d3490ba1aca0abfcdf4d057a21be9ac55f2894bacdf173","abstract_canon_sha256":"6d5f537d46d0287f334237534b00d36885b1d5b89ef9ec31b75b97acfc6ede23"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:30:02.430484Z","signature_b64":"DRHtazWOm8IdJ73CEtINfDvSjcJWDAkE9r4CAJokocDxIKLC71gPAew/8ouHlYZ4yZH5gGRGc+7PdXvvj6rKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95d3430651512cd5e5a3f22b8108e37093bc4af8607d4b9000dd56611eb61b9e","last_reissued_at":"2026-07-05T07:30:02.429987Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:30:02.429987Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Mikkel Thorup, Praneeth Kacham, Rasmus Pagh","submitted_at":"2023-04-13T22:44:22Z","abstract_excerpt":"We revisit Nisan's classical pseudorandom generator (PRG) for space-bounded computation (STOC 1990) and its applications in streaming algorithms. We describe a new generator, HashPRG, that can be thought of as a symmetric version of Nisan's generator over larger alphabets. Our generator allows a trade-off between seed length and the time needed to compute a given block of the generator's output. HashPRG can be used to obtain derandomizations with much better update time and \\emph{without sacrificing space} for a large number of data stream algorithms, such as $F_p$ estimation in the parameter "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.06853","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2304.06853/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2304.06853","created_at":"2026-07-05T07:30:02.430048+00:00"},{"alias_kind":"arxiv_version","alias_value":"2304.06853v2","created_at":"2026-07-05T07:30:02.430048+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.06853","created_at":"2026-07-05T07:30:02.430048+00:00"},{"alias_kind":"pith_short_12","alias_value":"SXJUGBSRKEWN","created_at":"2026-07-05T07:30:02.430048+00:00"},{"alias_kind":"pith_short_16","alias_value":"SXJUGBSRKEWNLZND","created_at":"2026-07-05T07:30:02.430048+00:00"},{"alias_kind":"pith_short_8","alias_value":"SXJUGBSR","created_at":"2026-07-05T07:30:02.430048+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/SXJUGBSRKEWNLZND6IVYCCHDOC","json":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC.json","graph_json":"https://pith.science/api/pith-number/SXJUGBSRKEWNLZND6IVYCCHDOC/graph.json","events_json":"https://pith.science/api/pith-number/SXJUGBSRKEWNLZND6IVYCCHDOC/events.json","paper":"https://pith.science/paper/SXJUGBSR"},"agent_actions":{"view_html":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC","download_json":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC.json","view_paper":"https://pith.science/paper/SXJUGBSR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2304.06853&json=true","fetch_graph":"https://pith.science/api/pith-number/SXJUGBSRKEWNLZND6IVYCCHDOC/graph.json","fetch_events":"https://pith.science/api/pith-number/SXJUGBSRKEWNLZND6IVYCCHDOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC/action/storage_attestation","attest_author":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC/action/author_attestation","sign_citation":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC/action/citation_signature","submit_replication":"https://pith.science/pith/SXJUGBSRKEWNLZND6IVYCCHDOC/action/replication_record"}},"created_at":"2026-07-05T07:30:02.430048+00:00","updated_at":"2026-07-05T07:30:02.430048+00:00"}