{"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"}