{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:5EFV4D36OMN3W6LCDTKTWQG3WC","short_pith_number":"pith:5EFV4D36","schema_version":"1.0","canonical_sha256":"e90b5e0f7e731bbb79621cd53b40dbb0a077147ac819de6887f39ff1e31e94fb","source":{"kind":"arxiv","id":"1012.4889","version":1},"attestation_state":"computed","paper":{"title":"Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.DS","authors_text":"G\\'abor Tardos, Hossein Jowhari, Mert Sa\\u{g}lam","submitted_at":"2010-12-22T06:55:58Z","abstract_excerpt":"In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \\in R^n, a perfect Lp sampler outputs the i-th coordinate with probability |x_i|^p/||x||_p^p. In SODA 2010, Monemizadeh and Woodruff showed polylog space upper bounds for approximate Lp-samplers and demonstrated various applications of them. Very recently, Andoni, Krauthgamer and Onak improved the upper bounds and gave a O(\\epsilon^{-p} log^3 n) space \\epsilon relative error and constant failure rate Lp-sampler for p \\in [1,2]. "},"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":"1012.4889","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T06:55:58Z","cross_cats_sorted":["cs.CC","cs.DB"],"title_canon_sha256":"46ace062c0201b0c2de4836f0b69b4a686d06a50b926abe36fd25c4f71a9c93a","abstract_canon_sha256":"5f159fb12c9dd94e93943f3fd89e2fc0a1eb6b79252aae3aef23009a9b871cfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:45.037922Z","signature_b64":"P9gKlWTdSV5J8cF1uU1jVATtcnonD8Oed5myPdsxb3tDsziUKrod/fGFPTaFyU8GEEQ/Rgbxt1bm2yHK4H5TBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e90b5e0f7e731bbb79621cd53b40dbb0a077147ac819de6887f39ff1e31e94fb","last_reissued_at":"2026-05-18T04:32:45.037222Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:45.037222Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds for Lp Samplers, Finding Duplicates in Streams, and Related Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.DB"],"primary_cat":"cs.DS","authors_text":"G\\'abor Tardos, Hossein Jowhari, Mert Sa\\u{g}lam","submitted_at":"2010-12-22T06:55:58Z","abstract_excerpt":"In this paper, we present near-optimal space bounds for Lp-samplers. Given a stream of updates (additions and subtraction) to the coordinates of an underlying vector x \\in R^n, a perfect Lp sampler outputs the i-th coordinate with probability |x_i|^p/||x||_p^p. In SODA 2010, Monemizadeh and Woodruff showed polylog space upper bounds for approximate Lp-samplers and demonstrated various applications of them. Very recently, Andoni, Krauthgamer and Onak improved the upper bounds and gave a O(\\epsilon^{-p} log^3 n) space \\epsilon relative error and constant failure rate Lp-sampler for p \\in [1,2]. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4889","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":""},"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":"1012.4889","created_at":"2026-05-18T04:32:45.037340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4889v1","created_at":"2026-05-18T04:32:45.037340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4889","created_at":"2026-05-18T04:32:45.037340+00:00"},{"alias_kind":"pith_short_12","alias_value":"5EFV4D36OMN3","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"5EFV4D36OMN3W6LC","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"5EFV4D36","created_at":"2026-05-18T12:26:04.259169+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/5EFV4D36OMN3W6LCDTKTWQG3WC","json":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC.json","graph_json":"https://pith.science/api/pith-number/5EFV4D36OMN3W6LCDTKTWQG3WC/graph.json","events_json":"https://pith.science/api/pith-number/5EFV4D36OMN3W6LCDTKTWQG3WC/events.json","paper":"https://pith.science/paper/5EFV4D36"},"agent_actions":{"view_html":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC","download_json":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC.json","view_paper":"https://pith.science/paper/5EFV4D36","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4889&json=true","fetch_graph":"https://pith.science/api/pith-number/5EFV4D36OMN3W6LCDTKTWQG3WC/graph.json","fetch_events":"https://pith.science/api/pith-number/5EFV4D36OMN3W6LCDTKTWQG3WC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC/action/storage_attestation","attest_author":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC/action/author_attestation","sign_citation":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC/action/citation_signature","submit_replication":"https://pith.science/pith/5EFV4D36OMN3W6LCDTKTWQG3WC/action/replication_record"}},"created_at":"2026-05-18T04:32:45.037340+00:00","updated_at":"2026-05-18T04:32:45.037340+00:00"}