{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:PZP7LPCKF2R2DA3FTXKNKIFYRS","short_pith_number":"pith:PZP7LPCK","schema_version":"1.0","canonical_sha256":"7e5ff5bc4a2ea3a183659dd4d520b88cac3532da978ab625b66b54e4480f8297","source":{"kind":"arxiv","id":"1808.05497","version":3},"attestation_state":"computed","paper":{"title":"Perfect $L_p$ Sampling in a Data Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram","submitted_at":"2018-08-16T14:00:44Z","abstract_excerpt":"In this paper, we resolve the one-pass space complexity of $L_p$ sampling for $p \\in (0,2)$. Given a stream of updates (insertions and deletions) to the coordinates of an underlying vector $f \\in \\mathbb{R}^n$, a perfect $L_p$ sampler must output an index $i$ with probability $|f_i|^p/\\|f\\|_p^p$, and is allowed to fail with some probability $\\delta$. So far, for $p > 0$ no algorithm has been shown to solve the problem exactly using $\\text{poly}( \\log n)$-bits of space. In 2010, Monemizadeh and Woodruff introduced an approximate $L_p$ sampler, which outputs $i$ with probability $(1 \\pm \\nu)|f_i"},"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":"1808.05497","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-08-16T14:00:44Z","cross_cats_sorted":[],"title_canon_sha256":"4116d2b193ea762f37bbeca22d3383cee546f7937737d93efdc78ce17cf40a97","abstract_canon_sha256":"a52076d842add85cde300d28738db105cc31d9c8ad3c37c777e7f87f89df803c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:18:04.856926Z","signature_b64":"2xUvnIxrlzGk7GWIceac74yVi8ITgvCxogxebk92Q4jzQ1pHWngRd3we8NnuG/xlqEvV10cJIFolpqVk6ALNBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7e5ff5bc4a2ea3a183659dd4d520b88cac3532da978ab625b66b54e4480f8297","last_reissued_at":"2026-07-05T00:18:04.856542Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:18:04.856542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect $L_p$ Sampling in a Data Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Rajesh Jayaram","submitted_at":"2018-08-16T14:00:44Z","abstract_excerpt":"In this paper, we resolve the one-pass space complexity of $L_p$ sampling for $p \\in (0,2)$. Given a stream of updates (insertions and deletions) to the coordinates of an underlying vector $f \\in \\mathbb{R}^n$, a perfect $L_p$ sampler must output an index $i$ with probability $|f_i|^p/\\|f\\|_p^p$, and is allowed to fail with some probability $\\delta$. So far, for $p > 0$ no algorithm has been shown to solve the problem exactly using $\\text{poly}( \\log n)$-bits of space. In 2010, Monemizadeh and Woodruff introduced an approximate $L_p$ sampler, which outputs $i$ with probability $(1 \\pm \\nu)|f_i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1808.05497","kind":"arxiv","version":3},"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/1808.05497/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":"1808.05497","created_at":"2026-07-05T00:18:04.856598+00:00"},{"alias_kind":"arxiv_version","alias_value":"1808.05497v3","created_at":"2026-07-05T00:18:04.856598+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1808.05497","created_at":"2026-07-05T00:18:04.856598+00:00"},{"alias_kind":"pith_short_12","alias_value":"PZP7LPCKF2R2","created_at":"2026-07-05T00:18:04.856598+00:00"},{"alias_kind":"pith_short_16","alias_value":"PZP7LPCKF2R2DA3F","created_at":"2026-07-05T00:18:04.856598+00:00"},{"alias_kind":"pith_short_8","alias_value":"PZP7LPCK","created_at":"2026-07-05T00:18:04.856598+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/PZP7LPCKF2R2DA3FTXKNKIFYRS","json":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS.json","graph_json":"https://pith.science/api/pith-number/PZP7LPCKF2R2DA3FTXKNKIFYRS/graph.json","events_json":"https://pith.science/api/pith-number/PZP7LPCKF2R2DA3FTXKNKIFYRS/events.json","paper":"https://pith.science/paper/PZP7LPCK"},"agent_actions":{"view_html":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS","download_json":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS.json","view_paper":"https://pith.science/paper/PZP7LPCK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1808.05497&json=true","fetch_graph":"https://pith.science/api/pith-number/PZP7LPCKF2R2DA3FTXKNKIFYRS/graph.json","fetch_events":"https://pith.science/api/pith-number/PZP7LPCKF2R2DA3FTXKNKIFYRS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS/action/storage_attestation","attest_author":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS/action/author_attestation","sign_citation":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS/action/citation_signature","submit_replication":"https://pith.science/pith/PZP7LPCKF2R2DA3FTXKNKIFYRS/action/replication_record"}},"created_at":"2026-07-05T00:18:04.856598+00:00","updated_at":"2026-07-05T00:18:04.856598+00:00"}