{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:CDMGYWAQD646YKRXCK2S5MXDYX","short_pith_number":"pith:CDMGYWAQ","schema_version":"1.0","canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","source":{"kind":"arxiv","id":"1001.1565","version":3},"attestation_state":"computed","paper":{"title":"Random Access to Grammar Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Kunihiko Sadakane, Oren Weimann, Philip Bille, Rajeev Raman, Srinivasa Rao Satti","submitted_at":"2010-01-11T20:29:41Z","abstract_excerpt":"Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes. In this paper, we present a novel grammar representation that allows efficient random access to any character or substring without decompressing the string.\n  Let $S$ be a string of length $N$ compressed into a context-free grammar $\\mathcal{S}$ of size $n$. We present two representations of $\\mathcal{S}$ achieving $O(\\log N)$ random access time, and either $O(n\\cdot \\alpha_k(n))$ construction ti"},"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":"1001.1565","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-11T20:29:41Z","cross_cats_sorted":[],"title_canon_sha256":"cea52a8c206cc6fedaa779fe561787dac956ba6c15670cd7971bb825733ab91f","abstract_canon_sha256":"e54853260cadfbfa4e0b8ae018f57c74d9ae8481aef98c172fff32ed92141104"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:08:38.703733Z","signature_b64":"tJowgkmyMIqV1uY/XzvvbYN9Ft/ajUjHDnRdzFBdAD+ujztQD+kahPP8nyuNbw1eL9sAN0fua7ro2Kpsxk9YDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","last_reissued_at":"2026-05-18T03:08:38.703334Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:08:38.703334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Random Access to Grammar Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gad M. Landau, Kunihiko Sadakane, Oren Weimann, Philip Bille, Rajeev Raman, Srinivasa Rao Satti","submitted_at":"2010-01-11T20:29:41Z","abstract_excerpt":"Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular compression schemes. In this paper, we present a novel grammar representation that allows efficient random access to any character or substring without decompressing the string.\n  Let $S$ be a string of length $N$ compressed into a context-free grammar $\\mathcal{S}$ of size $n$. We present two representations of $\\mathcal{S}$ achieving $O(\\log N)$ random access time, and either $O(n\\cdot \\alpha_k(n))$ construction ti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1565","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":"1001.1565","created_at":"2026-05-18T03:08:38.703388+00:00"},{"alias_kind":"arxiv_version","alias_value":"1001.1565v3","created_at":"2026-05-18T03:08:38.703388+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1565","created_at":"2026-05-18T03:08:38.703388+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDMGYWAQD646","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDMGYWAQD646YKRX","created_at":"2026-05-18T12:26:05.355336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDMGYWAQ","created_at":"2026-05-18T12:26:05.355336+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/CDMGYWAQD646YKRXCK2S5MXDYX","json":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX.json","graph_json":"https://pith.science/api/pith-number/CDMGYWAQD646YKRXCK2S5MXDYX/graph.json","events_json":"https://pith.science/api/pith-number/CDMGYWAQD646YKRXCK2S5MXDYX/events.json","paper":"https://pith.science/paper/CDMGYWAQ"},"agent_actions":{"view_html":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX","download_json":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX.json","view_paper":"https://pith.science/paper/CDMGYWAQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1001.1565&json=true","fetch_graph":"https://pith.science/api/pith-number/CDMGYWAQD646YKRXCK2S5MXDYX/graph.json","fetch_events":"https://pith.science/api/pith-number/CDMGYWAQD646YKRXCK2S5MXDYX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/action/storage_attestation","attest_author":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/action/author_attestation","sign_citation":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/action/citation_signature","submit_replication":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/action/replication_record"}},"created_at":"2026-05-18T03:08:38.703388+00:00","updated_at":"2026-05-18T03:08:38.703388+00:00"}