{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4G676YWCX7KK7AK7K54XYYS4PI","short_pith_number":"pith:4G676YWC","schema_version":"1.0","canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","source":{"kind":"arxiv","id":"1408.3093","version":2},"attestation_state":"computed","paper":{"title":"Rank, select and access in grammar-compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei","submitted_at":"2014-08-13T19:18:36Z","abstract_excerpt":"Given a string $S$ of length $N$ on a fixed alphabet of $\\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$. In this paper we describe data structures to support the following operations on a grammar-compressed string: $\\mbox{rank}_c(S,i)$ (return the number of occurrences of symbol $c$ before position $i$ in $S$); $\\mbox{select}_c(S,i)$ (return the position of the $i$th occurrence of $c$ in $S$); and $\\mbox{access}(S,i,j)$ (return substring $S[i,j]$). For rank and select we describe data structures of size $O(n\\sigma\\log N)$ b"},"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":"1408.3093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"7827504d5382dfab5fee5e7983909b8227e60ae2de52724574d93b5aa26a6d15","abstract_canon_sha256":"1c22efd0432082839872a57f0058e41d46ed13d078fa6f244013dcd9dd73dbc0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:13.803541Z","signature_b64":"tb89v4sBlYBjN8hadaslp1iudy2+GPC14tB1iTFnCq45zcxKKvFyslT3vJDaBrfqO4xqGPACbewrOu7BYfALCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","last_reissued_at":"2026-05-18T02:45:13.802943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:13.802943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rank, select and access in grammar-compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei","submitted_at":"2014-08-13T19:18:36Z","abstract_excerpt":"Given a string $S$ of length $N$ on a fixed alphabet of $\\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$. In this paper we describe data structures to support the following operations on a grammar-compressed string: $\\mbox{rank}_c(S,i)$ (return the number of occurrences of symbol $c$ before position $i$ in $S$); $\\mbox{select}_c(S,i)$ (return the position of the $i$th occurrence of $c$ in $S$); and $\\mbox{access}(S,i,j)$ (return substring $S[i,j]$). For rank and select we describe data structures of size $O(n\\sigma\\log N)$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3093","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1408.3093","created_at":"2026-05-18T02:45:13.803024+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.3093v2","created_at":"2026-05-18T02:45:13.803024+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3093","created_at":"2026-05-18T02:45:13.803024+00:00"},{"alias_kind":"pith_short_12","alias_value":"4G676YWCX7KK","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4G676YWCX7KK7AK7","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4G676YWC","created_at":"2026-05-18T12:28:14.216126+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/4G676YWCX7KK7AK7K54XYYS4PI","json":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI.json","graph_json":"https://pith.science/api/pith-number/4G676YWCX7KK7AK7K54XYYS4PI/graph.json","events_json":"https://pith.science/api/pith-number/4G676YWCX7KK7AK7K54XYYS4PI/events.json","paper":"https://pith.science/paper/4G676YWC"},"agent_actions":{"view_html":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI","download_json":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI.json","view_paper":"https://pith.science/paper/4G676YWC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.3093&json=true","fetch_graph":"https://pith.science/api/pith-number/4G676YWCX7KK7AK7K54XYYS4PI/graph.json","fetch_events":"https://pith.science/api/pith-number/4G676YWCX7KK7AK7K54XYYS4PI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/action/storage_attestation","attest_author":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/action/author_attestation","sign_citation":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/action/citation_signature","submit_replication":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/action/replication_record"}},"created_at":"2026-05-18T02:45:13.803024+00:00","updated_at":"2026-05-18T02:45:13.803024+00:00"}