{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:V5AVCEQSXVPX6W47P6K5I6B3QI","short_pith_number":"pith:V5AVCEQS","schema_version":"1.0","canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","source":{"kind":"arxiv","id":"1410.4701","version":4},"attestation_state":"computed","paper":{"title":"Optimal Time Random Access to Grammar-Compressed Strings in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick Hagge Cording","submitted_at":"2014-10-17T11:59:45Z","abstract_excerpt":"The random access problem for compressed strings is to build a data structure that efficiently supports accessing the character in position $i$ of a string given in compressed form. Given a grammar of size $n$ compressing a string of size $N$, we present a data structure using $O(n\\Delta \\log_\\Delta \\frac N n \\log N)$ bits of space that supports accessing position $i$ in $O(\\log_\\Delta N)$ time for $\\Delta \\leq \\log^{O(1)} N$. The query time is optimal for polynomially compressible strings, i.e., when $n=O(N^{1-\\epsilon})$."},"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":"1410.4701","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T11:59:45Z","cross_cats_sorted":[],"title_canon_sha256":"003015b0084fda82c0eb7b6c9dca85518926864b0141150ccda15ef835802ba5","abstract_canon_sha256":"87da05781a87895ae1c8a7e46707a98bd0da7147ef349005b9f1d57e457d23f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:47.491439Z","signature_b64":"oFFck6wtpQ6aQPHxyQyZC5SplArjPkrzi9Un1jZ0WM+Ri3RxFgJrGVcl9gPfh4ij6mK9YjZGVXyObLOziymODw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","last_reissued_at":"2026-05-18T02:28:47.490947Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:47.490947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimal Time Random Access to Grammar-Compressed Strings in Small Space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Patrick Hagge Cording","submitted_at":"2014-10-17T11:59:45Z","abstract_excerpt":"The random access problem for compressed strings is to build a data structure that efficiently supports accessing the character in position $i$ of a string given in compressed form. Given a grammar of size $n$ compressing a string of size $N$, we present a data structure using $O(n\\Delta \\log_\\Delta \\frac N n \\log N)$ bits of space that supports accessing position $i$ in $O(\\log_\\Delta N)$ time for $\\Delta \\leq \\log^{O(1)} N$. The query time is optimal for polynomially compressible strings, i.e., when $n=O(N^{1-\\epsilon})$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4701","kind":"arxiv","version":4},"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":"1410.4701","created_at":"2026-05-18T02:28:47.491007+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.4701v4","created_at":"2026-05-18T02:28:47.491007+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4701","created_at":"2026-05-18T02:28:47.491007+00:00"},{"alias_kind":"pith_short_12","alias_value":"V5AVCEQSXVPX","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_16","alias_value":"V5AVCEQSXVPX6W47","created_at":"2026-05-18T12:28:52.271510+00:00"},{"alias_kind":"pith_short_8","alias_value":"V5AVCEQS","created_at":"2026-05-18T12:28:52.271510+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/V5AVCEQSXVPX6W47P6K5I6B3QI","json":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI.json","graph_json":"https://pith.science/api/pith-number/V5AVCEQSXVPX6W47P6K5I6B3QI/graph.json","events_json":"https://pith.science/api/pith-number/V5AVCEQSXVPX6W47P6K5I6B3QI/events.json","paper":"https://pith.science/paper/V5AVCEQS"},"agent_actions":{"view_html":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI","download_json":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI.json","view_paper":"https://pith.science/paper/V5AVCEQS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.4701&json=true","fetch_graph":"https://pith.science/api/pith-number/V5AVCEQSXVPX6W47P6K5I6B3QI/graph.json","fetch_events":"https://pith.science/api/pith-number/V5AVCEQSXVPX6W47P6K5I6B3QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/action/storage_attestation","attest_author":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/action/author_attestation","sign_citation":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/action/citation_signature","submit_replication":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/action/replication_record"}},"created_at":"2026-05-18T02:28:47.491007+00:00","updated_at":"2026-05-18T02:28:47.491007+00:00"}