{"paper":{"title":"Rank-Select Indices Without Tears","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Tim Baumann, Torben Hagerup","submitted_at":"2017-09-07T17:53:44Z","abstract_excerpt":"A rank-select index for a sequence $B=(b_1,\\ldots,b_n)$ of $n$ bits is a data structure that, if provided with an operation to access $\\Theta(\\log n)$ arbitrary consecutive bits of $B$ in constant time (thus $B$ is stored outside of the data structure), can compute $\\mathit{rank}_B(j)=\\sum_{i=1}^j b_i$ for given $j\\in\\{0,\\ldots,n\\}$ and $\\mathit{select}_B(k)=\\min\\{j:\\mathit{rank}_B(j)\\ge k\\}$ for given $k\\in\\{1,\\ldots,\\sum_{i=1}^n b_i\\}$. We describe a new rank-select index that, like previous rank-select indices, occupies $O(n\\log\\log n/\\log n)$ bits and executes $\\mathit{rank}$ and $\\mathit{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.02377","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"}