{"paper":{"title":"Approximately Minwise Independence with Twisted Tabulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Mikkel Thorup, S{\\o}ren Dahlgaard","submitted_at":"2014-04-27T07:59:38Z","abstract_excerpt":"A random hash function $h$ is $\\varepsilon$-minwise if for any set $S$, $|S|=n$, and element $x\\in S$, $\\Pr[h(x)=\\min h(S)]=(1\\pm\\varepsilon)/n$. Minwise hash functions with low bias $\\varepsilon$ have widespread applications within similarity estimation.\n  Hashing from a universe $[u]$, the twisted tabulation hashing of P\\v{a}tra\\c{s}cu and Thorup [SODA'13] makes $c=O(1)$ lookups in tables of size $u^{1/c}$. Twisted tabulation was invented to get good concentration for hashing based sampling. Here we show that twisted tabulation yields $\\tilde O(1/u^{1/c})$-minwise hashing.\n  In the classic i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.6724","kind":"arxiv","version":2},"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"}