{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:IDAQDWF4FEQTWRZGRL42VCFMZO","short_pith_number":"pith:IDAQDWF4","schema_version":"1.0","canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","source":{"kind":"arxiv","id":"1711.02910","version":3},"attestation_state":"computed","paper":{"title":"Run Compressed Rank/Select for Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dmitry Kosolobov, Jos\\'e Fuentes-Sep\\'ulveda, Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2017-11-08T12:01:47Z","abstract_excerpt":"Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\\{0,1,\\ldots,\\sigma{-}1\\}$ such that $2 \\le \\sigma \\le r$, we describe a data structure that, provided $r \\le n / \\log^{\\omega(1)} n$, stores the string in $r\\log\\frac{n\\sigma}{r} + o(r\\log\\frac{n\\sigma}{r})$ bits and supports select and access queries in $O(\\log\\frac{\\log(n/r)}{\\log\\log n})$ time and rank queries in $O(\\log\\frac{\\log(n\\sigma/r)}{\\log\\log n})$ time. We show that $r\\log\\frac{n(\\sigma-1)}{r} - O(\\log\\frac{n}{r})$ bits are necessary for any such data structure and, thus, our solution is succin"},"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":"1711.02910","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-08T12:01:47Z","cross_cats_sorted":[],"title_canon_sha256":"4db63b39f002cbe300a1f5a86831ac6c7d1996868ae09e66723baa5cacdefdee","abstract_canon_sha256":"784801f51d786c98d4c49a54d577c3051192076606db93e93dd6246bd91fc00a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:39.237359Z","signature_b64":"SN35I9uZZxy5lsrsGH0V1zEBOe+CUD5guINCuduvb146M5cUTieT0E6rVLY3ir4Wc4/p6Ea8T3u11LxIe3zKAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40c101d8bc29213b47268af9aa88accb982ed03f54b71e4a3052224a868f2a68","last_reissued_at":"2026-05-18T00:22:39.237001Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:39.237001Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Run Compressed Rank/Select for Large Alphabets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dmitry Kosolobov, Jos\\'e Fuentes-Sep\\'ulveda, Juha K\\\"arkk\\\"ainen, Simon J. Puglisi","submitted_at":"2017-11-08T12:01:47Z","abstract_excerpt":"Given a string of length $n$ that is composed of $r$ runs of letters from the alphabet $\\{0,1,\\ldots,\\sigma{-}1\\}$ such that $2 \\le \\sigma \\le r$, we describe a data structure that, provided $r \\le n / \\log^{\\omega(1)} n$, stores the string in $r\\log\\frac{n\\sigma}{r} + o(r\\log\\frac{n\\sigma}{r})$ bits and supports select and access queries in $O(\\log\\frac{\\log(n/r)}{\\log\\log n})$ time and rank queries in $O(\\log\\frac{\\log(n\\sigma/r)}{\\log\\log n})$ time. We show that $r\\log\\frac{n(\\sigma-1)}{r} - O(\\log\\frac{n}{r})$ bits are necessary for any such data structure and, thus, our solution is succin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02910","kind":"arxiv","version":3},"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":"1711.02910","created_at":"2026-05-18T00:22:39.237057+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02910v3","created_at":"2026-05-18T00:22:39.237057+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02910","created_at":"2026-05-18T00:22:39.237057+00:00"},{"alias_kind":"pith_short_12","alias_value":"IDAQDWF4FEQT","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_16","alias_value":"IDAQDWF4FEQTWRZG","created_at":"2026-05-18T12:31:21.493067+00:00"},{"alias_kind":"pith_short_8","alias_value":"IDAQDWF4","created_at":"2026-05-18T12:31:21.493067+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/IDAQDWF4FEQTWRZGRL42VCFMZO","json":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO.json","graph_json":"https://pith.science/api/pith-number/IDAQDWF4FEQTWRZGRL42VCFMZO/graph.json","events_json":"https://pith.science/api/pith-number/IDAQDWF4FEQTWRZGRL42VCFMZO/events.json","paper":"https://pith.science/paper/IDAQDWF4"},"agent_actions":{"view_html":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO","download_json":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO.json","view_paper":"https://pith.science/paper/IDAQDWF4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02910&json=true","fetch_graph":"https://pith.science/api/pith-number/IDAQDWF4FEQTWRZGRL42VCFMZO/graph.json","fetch_events":"https://pith.science/api/pith-number/IDAQDWF4FEQTWRZGRL42VCFMZO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/action/storage_attestation","attest_author":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/action/author_attestation","sign_citation":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/action/citation_signature","submit_replication":"https://pith.science/pith/IDAQDWF4FEQTWRZGRL42VCFMZO/action/replication_record"}},"created_at":"2026-05-18T00:22:39.237057+00:00","updated_at":"2026-05-18T00:22:39.237057+00:00"}