{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:OI6A7UUAWWIJOU77YAR7OLPZYT","short_pith_number":"pith:OI6A7UUA","canonical_record":{"source":{"id":"1203.1080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-06T00:52:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"611bc70e0c026b8163f4195c618e00d5eb0f4d1d415a7f06ac4b864b627dcf79","abstract_canon_sha256":"4671e4ef121525c047a319de1acb2fdbb763aa38c35e3f98efa19e5285b56144"},"schema_version":"1.0"},"canonical_sha256":"723c0fd280b5909753ffc023f72df9c4e6ba8c1e6e575738ecdbfda8c83d1143","source":{"kind":"arxiv","id":"1203.1080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1080","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1080v2","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1080","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"OI6A7UUAWWIJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OI6A7UUAWWIJOU77","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OI6A7UUA","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:OI6A7UUAWWIJOU77YAR7OLPZYT","target":"record","payload":{"canonical_record":{"source":{"id":"1203.1080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-06T00:52:14Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"611bc70e0c026b8163f4195c618e00d5eb0f4d1d415a7f06ac4b864b627dcf79","abstract_canon_sha256":"4671e4ef121525c047a319de1acb2fdbb763aa38c35e3f98efa19e5285b56144"},"schema_version":"1.0"},"canonical_sha256":"723c0fd280b5909753ffc023f72df9c4e6ba8c1e6e575738ecdbfda8c83d1143","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:33.755981Z","signature_b64":"Kz9vcJ3xWwSzPvimbsdsJxiDt4hZ4DaJvYAjP8KCfZX/dQYKuBkFiNY22R+j5NqAEatajfT8F56S2aGOQ2CeCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"723c0fd280b5909753ffc023f72df9c4e6ba8c1e6e575738ecdbfda8c83d1143","last_reissued_at":"2026-05-18T03:56:33.755405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:33.755405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1203.1080","source_version":2,"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-18T03:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WOog4Fhy5tbvjJuB9HSeRXD2ougD9+PLFqj5GGffP3QpGPF0GzQwrqrtvCFyxW680LTTDY3AmLEbb6Hko+BhCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:20.872913Z"},"content_sha256":"7acc7a28024239f86b02d4bb669c1379e2bbd014791b904191e9a0e765310b13","schema_version":"1.0","event_id":"sha256:7acc7a28024239f86b02d4bb669c1379e2bbd014791b904191e9a0e765310b13"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:OI6A7UUAWWIJOU77YAR7OLPZYT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Elad Verbin, Shiteng Chen, Wei Yu","submitted_at":"2012-03-06T00:52:14Z","abstract_excerpt":"In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated by the recent paper of Bille et al. Let n be the size of a context-free grammar that derives a unique string s of length L. (Note that L might be exponential in n.) Bille et al. showed a data structure that uses space O(n) and allows to query for the i-th character of s using running time O(log L). Their data structure works on a word RAM with a word size o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1080","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"},"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-18T03:56:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cSuP5lEx8V+Slh0qY6j60Hfy6O2nuyWNfcyEIE2tlBSXGdiiBD8vzOSSsniGl9L/aKr/p9i93ep4n6BA15wqDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T16:35:20.873689Z"},"content_sha256":"ec95ed45f6b9d6daccc87224fb38788416f5b9cb3595942b5b9141be324e7079","schema_version":"1.0","event_id":"sha256:ec95ed45f6b9d6daccc87224fb38788416f5b9cb3595942b5b9141be324e7079"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/bundle.json","state_url":"https://pith.science/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/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-31T16:35:20Z","links":{"resolver":"https://pith.science/pith/OI6A7UUAWWIJOU77YAR7OLPZYT","bundle":"https://pith.science/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/bundle.json","state":"https://pith.science/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OI6A7UUAWWIJOU77YAR7OLPZYT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:OI6A7UUAWWIJOU77YAR7OLPZYT","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":"4671e4ef121525c047a319de1acb2fdbb763aa38c35e3f98efa19e5285b56144","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-06T00:52:14Z","title_canon_sha256":"611bc70e0c026b8163f4195c618e00d5eb0f4d1d415a7f06ac4b864b627dcf79"},"schema_version":"1.0","source":{"id":"1203.1080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1203.1080","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"arxiv_version","alias_value":"1203.1080v2","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.1080","created_at":"2026-05-18T03:56:33Z"},{"alias_kind":"pith_short_12","alias_value":"OI6A7UUAWWIJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"OI6A7UUAWWIJOU77","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"OI6A7UUA","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ec95ed45f6b9d6daccc87224fb38788416f5b9cb3595942b5b9141be324e7079","target":"graph","created_at":"2026-05-18T03:56:33Z","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":"In this paper we investigate the problem of building a static data structure that represents a string s using space close to its compressed size, and allows fast access to individual characters of s. This type of structures was investigated by the recent paper of Bille et al. Let n be the size of a context-free grammar that derives a unique string s of length L. (Note that L might be exponential in n.) Bille et al. showed a data structure that uses space O(n) and allows to query for the i-th character of s using running time O(log L). Their data structure works on a word RAM with a word size o","authors_text":"Elad Verbin, Shiteng Chen, Wei Yu","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-06T00:52:14Z","title":"Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.1080","kind":"arxiv","version":2},"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:7acc7a28024239f86b02d4bb669c1379e2bbd014791b904191e9a0e765310b13","target":"record","created_at":"2026-05-18T03:56:33Z","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":"4671e4ef121525c047a319de1acb2fdbb763aa38c35e3f98efa19e5285b56144","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2012-03-06T00:52:14Z","title_canon_sha256":"611bc70e0c026b8163f4195c618e00d5eb0f4d1d415a7f06ac4b864b627dcf79"},"schema_version":"1.0","source":{"id":"1203.1080","kind":"arxiv","version":2}},"canonical_sha256":"723c0fd280b5909753ffc023f72df9c4e6ba8c1e6e575738ecdbfda8c83d1143","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"723c0fd280b5909753ffc023f72df9c4e6ba8c1e6e575738ecdbfda8c83d1143","first_computed_at":"2026-05-18T03:56:33.755405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:56:33.755405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Kz9vcJ3xWwSzPvimbsdsJxiDt4hZ4DaJvYAjP8KCfZX/dQYKuBkFiNY22R+j5NqAEatajfT8F56S2aGOQ2CeCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:56:33.755981Z","signed_message":"canonical_sha256_bytes"},"source_id":"1203.1080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7acc7a28024239f86b02d4bb669c1379e2bbd014791b904191e9a0e765310b13","sha256:ec95ed45f6b9d6daccc87224fb38788416f5b9cb3595942b5b9141be324e7079"],"state_sha256":"b288b36a83e72dbe1d945513627fafcd82467b398f72538b450a728521d5b149"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pUWKzNhqZKkwKsA75iZuEe2m7YiHRhSKRvDZqXQ7f4BbDhr2etnyVgXngzC3sRbEmvW570qfTYrjbkeJK47KDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T16:35:20.879849Z","bundle_sha256":"237eadd9e9fa9a6aeb900b88d92270c90a970e74f94cd061479c312e0a6aff4f"}}