{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:VVZGQ2KGUT47UPZIGPETWZPUGK","short_pith_number":"pith:VVZGQ2KG","schema_version":"1.0","canonical_sha256":"ad72686946a4f9fa3f2833c93b65f432a0d1eb4102cb89c18dd01552f841ad2f","source":{"kind":"arxiv","id":"2108.12017","version":1},"attestation_state":"computed","paper":{"title":"Truly Perfect Samplers for Data Streams and Sliding Windows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram, Samson Zhou","submitted_at":"2021-08-26T19:58:33Z","abstract_excerpt":"In the $G$-sampling problem, the goal is to output an index $i$ of a vector $f \\in\\mathbb{R}^n$, such that for all coordinates $j \\in [n]$, \\[\\textbf{Pr}[i=j] = (1 \\pm \\epsilon) \\frac{G(f_j)}{\\sum_{k\\in[n]} G(f_k)} + \\gamma,\\] where $G:\\mathbb{R} \\to \\mathbb{R}_{\\geq 0}$ is some non-negative function. If $\\epsilon = 0$ and $\\gamma = 1/\\text{poly}(n)$, the sampler is called perfect. In the data stream model, $f$ is defined implicitly by a sequence of updates to its coordinates, and the goal is to design such a sampler in small space. Jayaram and Woodruff (FOCS 2018) gave the first perfect $L_p$"},"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":"2108.12017","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2021-08-26T19:58:33Z","cross_cats_sorted":[],"title_canon_sha256":"214b096ede9d429ea88843df084ea2f0b541d1135cd73b47d8b5984698266168","abstract_canon_sha256":"0b79da64b4a1e6825ea741c2a37290cb98b83c44ccc6eaaca9a3e33b13a07e70"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:09:20.918853Z","signature_b64":"Leci/R0ndyGnsrRrm3QGutpDdbDU5OxvHnv9hzVVtaPT1chh0+00ThCczUSs6mZlL6lNccYJ6tAM2Q5hBhQyDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad72686946a4f9fa3f2833c93b65f432a0d1eb4102cb89c18dd01552f841ad2f","last_reissued_at":"2026-07-05T03:09:20.918396Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:09:20.918396Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Truly Perfect Samplers for Data Streams and Sliding Windows","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram, Samson Zhou","submitted_at":"2021-08-26T19:58:33Z","abstract_excerpt":"In the $G$-sampling problem, the goal is to output an index $i$ of a vector $f \\in\\mathbb{R}^n$, such that for all coordinates $j \\in [n]$, \\[\\textbf{Pr}[i=j] = (1 \\pm \\epsilon) \\frac{G(f_j)}{\\sum_{k\\in[n]} G(f_k)} + \\gamma,\\] where $G:\\mathbb{R} \\to \\mathbb{R}_{\\geq 0}$ is some non-negative function. If $\\epsilon = 0$ and $\\gamma = 1/\\text{poly}(n)$, the sampler is called perfect. In the data stream model, $f$ is defined implicitly by a sequence of updates to its coordinates, and the goal is to design such a sampler in small space. Jayaram and Woodruff (FOCS 2018) gave the first perfect $L_p$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.12017","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2108.12017/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":"2108.12017","created_at":"2026-07-05T03:09:20.918453+00:00"},{"alias_kind":"arxiv_version","alias_value":"2108.12017v1","created_at":"2026-07-05T03:09:20.918453+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.12017","created_at":"2026-07-05T03:09:20.918453+00:00"},{"alias_kind":"pith_short_12","alias_value":"VVZGQ2KGUT47","created_at":"2026-07-05T03:09:20.918453+00:00"},{"alias_kind":"pith_short_16","alias_value":"VVZGQ2KGUT47UPZI","created_at":"2026-07-05T03:09:20.918453+00:00"},{"alias_kind":"pith_short_8","alias_value":"VVZGQ2KG","created_at":"2026-07-05T03:09:20.918453+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/VVZGQ2KGUT47UPZIGPETWZPUGK","json":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK.json","graph_json":"https://pith.science/api/pith-number/VVZGQ2KGUT47UPZIGPETWZPUGK/graph.json","events_json":"https://pith.science/api/pith-number/VVZGQ2KGUT47UPZIGPETWZPUGK/events.json","paper":"https://pith.science/paper/VVZGQ2KG"},"agent_actions":{"view_html":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK","download_json":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK.json","view_paper":"https://pith.science/paper/VVZGQ2KG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2108.12017&json=true","fetch_graph":"https://pith.science/api/pith-number/VVZGQ2KGUT47UPZIGPETWZPUGK/graph.json","fetch_events":"https://pith.science/api/pith-number/VVZGQ2KGUT47UPZIGPETWZPUGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK/action/storage_attestation","attest_author":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK/action/author_attestation","sign_citation":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK/action/citation_signature","submit_replication":"https://pith.science/pith/VVZGQ2KGUT47UPZIGPETWZPUGK/action/replication_record"}},"created_at":"2026-07-05T03:09:20.918453+00:00","updated_at":"2026-07-05T03:09:20.918453+00:00"}