{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:ME7PZTOWRUFFUPDLAC3NHTRSKR","short_pith_number":"pith:ME7PZTOW","schema_version":"1.0","canonical_sha256":"613efccdd68d0a5a3c6b00b6d3ce325472864b7a47aa2046305e64dd65464766","source":{"kind":"arxiv","id":"1611.00783","version":5},"attestation_state":"computed","paper":{"title":"Preserving Randomness for Adaptive Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam R. Klivans, William M. Hoza","submitted_at":"2016-11-02T20:06:31Z","abstract_excerpt":"Suppose $\\mathsf{Est}$ is a randomized estimation algorithm that uses $n$ random bits and outputs values in $\\mathbb{R}^d$. We show how to execute $\\mathsf{Est}$ on $k$ adaptively chosen inputs using only $n + O(k \\log(d + 1))$ random bits instead of the trivial $nk$ (at the cost of mild increases in the error and failure probability). Our algorithm combines a variant of the INW pseudorandom generator (STOC '94) with a new scheme for shifting and rounding the outputs of $\\mathsf{Est}$. We prove that modifying the outputs of $\\mathsf{Est}$ is necessary in this setting, and furthermore, our algo"},"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":"1611.00783","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-11-02T20:06:31Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6287cc1f9e0116f84f19b45af46db640ffdeba1e0ba3ec96ecd620402dee3afa","abstract_canon_sha256":"e764079881cf9dbfbb313e13a6c41438110adf2e28e47f5a5af6dd01d81c6114"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:13:22.195106Z","signature_b64":"v8uDWSH0WFP43lrZ2f98mybi972qu9hWesloUBZbcFsvHSviPoTXwkct+UkcxM8a3fcooWSrfl3a9ZmcMMmjBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"613efccdd68d0a5a3c6b00b6d3ce325472864b7a47aa2046305e64dd65464766","last_reissued_at":"2026-05-18T00:13:22.194409Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:13:22.194409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Preserving Randomness for Adaptive Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Adam R. Klivans, William M. Hoza","submitted_at":"2016-11-02T20:06:31Z","abstract_excerpt":"Suppose $\\mathsf{Est}$ is a randomized estimation algorithm that uses $n$ random bits and outputs values in $\\mathbb{R}^d$. We show how to execute $\\mathsf{Est}$ on $k$ adaptively chosen inputs using only $n + O(k \\log(d + 1))$ random bits instead of the trivial $nk$ (at the cost of mild increases in the error and failure probability). Our algorithm combines a variant of the INW pseudorandom generator (STOC '94) with a new scheme for shifting and rounding the outputs of $\\mathsf{Est}$. We prove that modifying the outputs of $\\mathsf{Est}$ is necessary in this setting, and furthermore, our algo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.00783","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":"1611.00783","created_at":"2026-05-18T00:13:22.194534+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.00783v5","created_at":"2026-05-18T00:13:22.194534+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.00783","created_at":"2026-05-18T00:13:22.194534+00:00"},{"alias_kind":"pith_short_12","alias_value":"ME7PZTOWRUFF","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_16","alias_value":"ME7PZTOWRUFFUPDL","created_at":"2026-05-18T12:30:32.724797+00:00"},{"alias_kind":"pith_short_8","alias_value":"ME7PZTOW","created_at":"2026-05-18T12:30:32.724797+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/ME7PZTOWRUFFUPDLAC3NHTRSKR","json":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR.json","graph_json":"https://pith.science/api/pith-number/ME7PZTOWRUFFUPDLAC3NHTRSKR/graph.json","events_json":"https://pith.science/api/pith-number/ME7PZTOWRUFFUPDLAC3NHTRSKR/events.json","paper":"https://pith.science/paper/ME7PZTOW"},"agent_actions":{"view_html":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR","download_json":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR.json","view_paper":"https://pith.science/paper/ME7PZTOW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.00783&json=true","fetch_graph":"https://pith.science/api/pith-number/ME7PZTOWRUFFUPDLAC3NHTRSKR/graph.json","fetch_events":"https://pith.science/api/pith-number/ME7PZTOWRUFFUPDLAC3NHTRSKR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR/action/storage_attestation","attest_author":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR/action/author_attestation","sign_citation":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR/action/citation_signature","submit_replication":"https://pith.science/pith/ME7PZTOWRUFFUPDLAC3NHTRSKR/action/replication_record"}},"created_at":"2026-05-18T00:13:22.194534+00:00","updated_at":"2026-05-18T00:13:22.194534+00:00"}