{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:V5AVCEQSXVPX6W47P6K5I6B3QI","short_pith_number":"pith:V5AVCEQS","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"},"canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","source":{"kind":"arxiv","id":"1410.4701","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4701","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4701v4","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4701","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"V5AVCEQSXVPX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V5AVCEQSXVPX6W47","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V5AVCEQS","created_at":"2026-05-18T12:28:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:V5AVCEQSXVPX6W47P6K5I6B3QI","target":"record","payload":{"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"},"canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","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"},"source_kind":"arxiv","source_id":"1410.4701","source_version":4,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EuRrPgkXRM/H5xaXCEWHVCwwxZe+K5gZ9Ie+ONPfEjmVJPeiiqKH/WvdkM5minBIcizI/0T26vIAMMHCgmn3CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:56:54.031955Z"},"content_sha256":"96b4429652322075233b000197a4fe24ce1d669006c2aab6728cb9a5ce1348a6","schema_version":"1.0","event_id":"sha256:96b4429652322075233b000197a4fe24ce1d669006c2aab6728cb9a5ce1348a6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:V5AVCEQSXVPX6W47P6K5I6B3QI","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:28:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jManaE+y7Ur31PEA4oIAlC0x5C68TydcK+Idju1D+dVLTqrbO4Uxk+K3dNtjOZQNGAUd08cl6iakLKnBfafJCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T05:56:54.032301Z"},"content_sha256":"0c33e04c58ea9b5476f2098b8513a7b7316b2d55aa0eafc28edaba617fe02826","schema_version":"1.0","event_id":"sha256:0c33e04c58ea9b5476f2098b8513a7b7316b2d55aa0eafc28edaba617fe02826"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/bundle.json","state_url":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-27T05:56:54Z","links":{"resolver":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI","bundle":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/bundle.json","state":"https://pith.science/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V5AVCEQSXVPX6W47P6K5I6B3QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:V5AVCEQSXVPX6W47P6K5I6B3QI","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"87da05781a87895ae1c8a7e46707a98bd0da7147ef349005b9f1d57e457d23f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T11:59:45Z","title_canon_sha256":"003015b0084fda82c0eb7b6c9dca85518926864b0141150ccda15ef835802ba5"},"schema_version":"1.0","source":{"id":"1410.4701","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1410.4701","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"arxiv_version","alias_value":"1410.4701v4","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.4701","created_at":"2026-05-18T02:28:47Z"},{"alias_kind":"pith_short_12","alias_value":"V5AVCEQSXVPX","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_16","alias_value":"V5AVCEQSXVPX6W47","created_at":"2026-05-18T12:28:52Z"},{"alias_kind":"pith_short_8","alias_value":"V5AVCEQS","created_at":"2026-05-18T12:28:52Z"}],"graph_snapshots":[{"event_id":"sha256:0c33e04c58ea9b5476f2098b8513a7b7316b2d55aa0eafc28edaba617fe02826","target":"graph","created_at":"2026-05-18T02:28:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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})$.","authors_text":"Patrick Hagge Cording","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T11:59:45Z","title":"Optimal Time Random Access to Grammar-Compressed Strings in Small Space"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.4701","kind":"arxiv","version":4},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:96b4429652322075233b000197a4fe24ce1d669006c2aab6728cb9a5ce1348a6","target":"record","created_at":"2026-05-18T02:28:47Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"87da05781a87895ae1c8a7e46707a98bd0da7147ef349005b9f1d57e457d23f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-10-17T11:59:45Z","title_canon_sha256":"003015b0084fda82c0eb7b6c9dca85518926864b0141150ccda15ef835802ba5"},"schema_version":"1.0","source":{"id":"1410.4701","kind":"arxiv","version":4}},"canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af41511212bd5f7f5b9f7f95d4783b822aebd01dd9aa27198ad73945cf022441","first_computed_at":"2026-05-18T02:28:47.490947Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:47.490947Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oFFck6wtpQ6aQPHxyQyZC5SplArjPkrzi9Un1jZ0WM+Ri3RxFgJrGVcl9gPfh4ij6mK9YjZGVXyObLOziymODw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:47.491439Z","signed_message":"canonical_sha256_bytes"},"source_id":"1410.4701","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:96b4429652322075233b000197a4fe24ce1d669006c2aab6728cb9a5ce1348a6","sha256:0c33e04c58ea9b5476f2098b8513a7b7316b2d55aa0eafc28edaba617fe02826"],"state_sha256":"b04bc0d5e91a2b214a706180a648587ac594f5de7f019b0d61de87a5d64e1694"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EpWXnZNpbByyPTfIwlSQS29RkWKtdAaG6n0nhNreGVDqQCKYUTXjz39Ee5DoXGbXielrulUikE64dC0cuYsEAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T05:56:54.034822Z","bundle_sha256":"3edaa2099906bf15bed1370b5eab731c6bcd08c1b218c72ee062b361a490e8bb"}}