{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:DWKE3PMBORWPVJS2WZFAGPW2O3","short_pith_number":"pith:DWKE3PMB","schema_version":"1.0","canonical_sha256":"1d944dbd81746cfaa65ab64a033eda76c4443b65ee9ea2aba135cf64d3c6080f","source":{"kind":"arxiv","id":"1511.00661","version":1},"attestation_state":"computed","paper":{"title":"Beating CountSketch for Heavy Hitters in Insertion Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Nikita Ivkin, Stephen R. Chestnut, Vladimir Braverman","submitted_at":"2015-11-02T20:03:39Z","abstract_excerpt":"Given a stream $p_1, \\ldots, p_m$ of items from a universe $\\mathcal{U}$, which, without loss of generality we identify with the set of integers $\\{1, 2, \\ldots, n\\}$, we consider the problem of returning all $\\ell_2$-heavy hitters, i.e., those items $j$ for which $f_j \\geq \\epsilon \\sqrt{F_2}$, where $f_j$ is the number of occurrences of item $j$ in the stream, and $F_2 = \\sum_{i \\in [n]} f_i^2$. Such a guarantee is considerably stronger than the $\\ell_1$-guarantee, which finds those $j$ for which $f_j \\geq \\epsilon m$. In 2002, Charikar, Chen, and Farach-Colton suggested the {\\sf CountSketch"},"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":"1511.00661","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-11-02T20:03:39Z","cross_cats_sorted":[],"title_canon_sha256":"9fb8d443f9177d42c83d810c6b54e9ee787614b6b1b9bd9d28be7389c9533e62","abstract_canon_sha256":"e8ed1146e1381c5c2719691347ffc1f33a1be95871a86ca265e0dab575e169fe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:28:06.913810Z","signature_b64":"NuJHszYkFSjrKDnek+SyCWc54xIkk8ICH9RHEFgMwDmDRVpBjJz2LjznWIcaS51XBQ9uH6QgCVaAtiY50R5KDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d944dbd81746cfaa65ab64a033eda76c4443b65ee9ea2aba135cf64d3c6080f","last_reissued_at":"2026-05-18T01:28:06.913090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:28:06.913090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating CountSketch for Heavy Hitters in Insertion Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Nikita Ivkin, Stephen R. Chestnut, Vladimir Braverman","submitted_at":"2015-11-02T20:03:39Z","abstract_excerpt":"Given a stream $p_1, \\ldots, p_m$ of items from a universe $\\mathcal{U}$, which, without loss of generality we identify with the set of integers $\\{1, 2, \\ldots, n\\}$, we consider the problem of returning all $\\ell_2$-heavy hitters, i.e., those items $j$ for which $f_j \\geq \\epsilon \\sqrt{F_2}$, where $f_j$ is the number of occurrences of item $j$ in the stream, and $F_2 = \\sum_{i \\in [n]} f_i^2$. Such a guarantee is considerably stronger than the $\\ell_1$-guarantee, which finds those $j$ for which $f_j \\geq \\epsilon m$. In 2002, Charikar, Chen, and Farach-Colton suggested the {\\sf CountSketch"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.00661","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":"1511.00661","created_at":"2026-05-18T01:28:06.913216+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.00661v1","created_at":"2026-05-18T01:28:06.913216+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.00661","created_at":"2026-05-18T01:28:06.913216+00:00"},{"alias_kind":"pith_short_12","alias_value":"DWKE3PMBORWP","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_16","alias_value":"DWKE3PMBORWPVJS2","created_at":"2026-05-18T12:29:17.054201+00:00"},{"alias_kind":"pith_short_8","alias_value":"DWKE3PMB","created_at":"2026-05-18T12:29:17.054201+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/DWKE3PMBORWPVJS2WZFAGPW2O3","json":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3.json","graph_json":"https://pith.science/api/pith-number/DWKE3PMBORWPVJS2WZFAGPW2O3/graph.json","events_json":"https://pith.science/api/pith-number/DWKE3PMBORWPVJS2WZFAGPW2O3/events.json","paper":"https://pith.science/paper/DWKE3PMB"},"agent_actions":{"view_html":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3","download_json":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3.json","view_paper":"https://pith.science/paper/DWKE3PMB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.00661&json=true","fetch_graph":"https://pith.science/api/pith-number/DWKE3PMBORWPVJS2WZFAGPW2O3/graph.json","fetch_events":"https://pith.science/api/pith-number/DWKE3PMBORWPVJS2WZFAGPW2O3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3/action/storage_attestation","attest_author":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3/action/author_attestation","sign_citation":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3/action/citation_signature","submit_replication":"https://pith.science/pith/DWKE3PMBORWPVJS2WZFAGPW2O3/action/replication_record"}},"created_at":"2026-05-18T01:28:06.913216+00:00","updated_at":"2026-05-18T01:28:06.913216+00:00"}