{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LL2H242GVAMNQ4JCPF7LDHBBIZ","short_pith_number":"pith:LL2H242G","schema_version":"1.0","canonical_sha256":"5af47d7346a818d87122797eb19c21466f3c36c242a03325c07f30ca045b6fca","source":{"kind":"arxiv","id":"1507.06866","version":1},"attestation_state":"computed","paper":{"title":"Compressed Data Structures for Dynamic Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Yakov Nekrich","submitted_at":"2015-07-24T14:57:18Z","abstract_excerpt":"We consider the problem of storing a dynamic string $S$ over an alphabet $\\Sigma=\\{\\,1,\\ldots,\\sigma\\,\\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\\mathrm{access}(i,S)$ returns the $i$-th symbol in $S$, $\\mathrm{rank}_a(i,S)$ counts how many times a symbol $a$ occurs among the first $i$ positions in $S$, and $\\mathrm{select}_a(i,S)$ finds the position where a symbol $a$ occurs for the $i$-th time. We present the first fully-dynamic data structure for arbitrarily large alphabets that achieves optimal query times "},"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":"1507.06866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-07-24T14:57:18Z","cross_cats_sorted":[],"title_canon_sha256":"4f6ff1100b6868c85ecc275d3e576a5319bc75fb294e71ddfdc28074605418c5","abstract_canon_sha256":"45386821885c22a799b4e1e7243c15169b334a523b9bf9a128767779523b7a9c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:21.833149Z","signature_b64":"1AL4TvulEb0G1q+EwbUx9+FaNFzZrq3UNeizRemGuFglE6tJ1sP+GA8CWWx7iYzNicFVHpPN0PpN+ZzPkVQwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5af47d7346a818d87122797eb19c21466f3c36c242a03325c07f30ca045b6fca","last_reissued_at":"2026-05-18T01:36:21.832485Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:21.832485Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Compressed Data Structures for Dynamic Sequences","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"J. Ian Munro, Yakov Nekrich","submitted_at":"2015-07-24T14:57:18Z","abstract_excerpt":"We consider the problem of storing a dynamic string $S$ over an alphabet $\\Sigma=\\{\\,1,\\ldots,\\sigma\\,\\}$ in compressed form. Our representation supports insertions and deletions of symbols and answers three fundamental queries: $\\mathrm{access}(i,S)$ returns the $i$-th symbol in $S$, $\\mathrm{rank}_a(i,S)$ counts how many times a symbol $a$ occurs among the first $i$ positions in $S$, and $\\mathrm{select}_a(i,S)$ finds the position where a symbol $a$ occurs for the $i$-th time. We present the first fully-dynamic data structure for arbitrarily large alphabets that achieves optimal query times "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.06866","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":"1507.06866","created_at":"2026-05-18T01:36:21.832581+00:00"},{"alias_kind":"arxiv_version","alias_value":"1507.06866v1","created_at":"2026-05-18T01:36:21.832581+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.06866","created_at":"2026-05-18T01:36:21.832581+00:00"},{"alias_kind":"pith_short_12","alias_value":"LL2H242GVAMN","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LL2H242GVAMNQ4JC","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LL2H242G","created_at":"2026-05-18T12:29:29.992203+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/LL2H242GVAMNQ4JCPF7LDHBBIZ","json":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ.json","graph_json":"https://pith.science/api/pith-number/LL2H242GVAMNQ4JCPF7LDHBBIZ/graph.json","events_json":"https://pith.science/api/pith-number/LL2H242GVAMNQ4JCPF7LDHBBIZ/events.json","paper":"https://pith.science/paper/LL2H242G"},"agent_actions":{"view_html":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ","download_json":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ.json","view_paper":"https://pith.science/paper/LL2H242G","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1507.06866&json=true","fetch_graph":"https://pith.science/api/pith-number/LL2H242GVAMNQ4JCPF7LDHBBIZ/graph.json","fetch_events":"https://pith.science/api/pith-number/LL2H242GVAMNQ4JCPF7LDHBBIZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ/action/storage_attestation","attest_author":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ/action/author_attestation","sign_citation":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ/action/citation_signature","submit_replication":"https://pith.science/pith/LL2H242GVAMNQ4JCPF7LDHBBIZ/action/replication_record"}},"created_at":"2026-05-18T01:36:21.832581+00:00","updated_at":"2026-05-18T01:36:21.832581+00:00"}