{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:CDMGYWAQD646YKRXCK2S5MXDYX","short_pith_number":"pith:CDMGYWAQ","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"},"canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","source":{"kind":"arxiv","id":"1001.1565","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1565","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1565v3","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1565","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"pith_short_12","alias_value":"CDMGYWAQD646","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CDMGYWAQD646YKRX","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CDMGYWAQ","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:CDMGYWAQD646YKRXCK2S5MXDYX","target":"record","payload":{"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"},"canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","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"},"source_kind":"arxiv","source_id":"1001.1565","source_version":3,"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:08:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dVLNc/KJGY6ikY8JWCBbuMELnlMMfZY6vxXQw9lvEJyMkVKRVh00wPJrvXPKj2HQlfUqfLIqHaa0vjbda/tYDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:47:10.111748Z"},"content_sha256":"6a23ff029f812173a0a3708f2cdf283064fa72ba624757e0b8e81844e64cdb96","schema_version":"1.0","event_id":"sha256:6a23ff029f812173a0a3708f2cdf283064fa72ba624757e0b8e81844e64cdb96"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:CDMGYWAQD646YKRXCK2S5MXDYX","target":"graph","payload":{"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"},"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:08:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nflOHr4VIefZuLz2xk/4+b2iG73XZfGi86m79YMrBfV2KqO6cYz7NcDCykDITnW7dEikiUW0YTtyUWbAtnDzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:47:10.112225Z"},"content_sha256":"4ec211018febd81fa80b13e6369c2991d16e1e1e8c9f1bb5b59162d27089a0da","schema_version":"1.0","event_id":"sha256:4ec211018febd81fa80b13e6369c2991d16e1e1e8c9f1bb5b59162d27089a0da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/bundle.json","state_url":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CDMGYWAQD646YKRXCK2S5MXDYX/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-26T04:47:10Z","links":{"resolver":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX","bundle":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/bundle.json","state":"https://pith.science/pith/CDMGYWAQD646YKRXCK2S5MXDYX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CDMGYWAQD646YKRXCK2S5MXDYX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:CDMGYWAQD646YKRXCK2S5MXDYX","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":"e54853260cadfbfa4e0b8ae018f57c74d9ae8481aef98c172fff32ed92141104","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-11T20:29:41Z","title_canon_sha256":"cea52a8c206cc6fedaa779fe561787dac956ba6c15670cd7971bb825733ab91f"},"schema_version":"1.0","source":{"id":"1001.1565","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1001.1565","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"arxiv_version","alias_value":"1001.1565v3","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1001.1565","created_at":"2026-05-18T03:08:38Z"},{"alias_kind":"pith_short_12","alias_value":"CDMGYWAQD646","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"CDMGYWAQD646YKRX","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"CDMGYWAQ","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:4ec211018febd81fa80b13e6369c2991d16e1e1e8c9f1bb5b59162d27089a0da","target":"graph","created_at":"2026-05-18T03:08:38Z","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":"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","authors_text":"Gad M. Landau, Kunihiko Sadakane, Oren Weimann, Philip Bille, Rajeev Raman, Srinivasa Rao Satti","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-11T20:29:41Z","title":"Random Access to Grammar Compressed Strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1001.1565","kind":"arxiv","version":3},"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:6a23ff029f812173a0a3708f2cdf283064fa72ba624757e0b8e81844e64cdb96","target":"record","created_at":"2026-05-18T03:08:38Z","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":"e54853260cadfbfa4e0b8ae018f57c74d9ae8481aef98c172fff32ed92141104","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-01-11T20:29:41Z","title_canon_sha256":"cea52a8c206cc6fedaa779fe561787dac956ba6c15670cd7971bb825733ab91f"},"schema_version":"1.0","source":{"id":"1001.1565","kind":"arxiv","version":3}},"canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10d86c58101fb9ec2a3712b52eb2e3c5d5fe6b07cb8c65cb36b2b8d77dd48067","first_computed_at":"2026-05-18T03:08:38.703334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:08:38.703334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tJowgkmyMIqV1uY/XzvvbYN9Ft/ajUjHDnRdzFBdAD+ujztQD+kahPP8nyuNbw1eL9sAN0fua7ro2Kpsxk9YDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:08:38.703733Z","signed_message":"canonical_sha256_bytes"},"source_id":"1001.1565","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6a23ff029f812173a0a3708f2cdf283064fa72ba624757e0b8e81844e64cdb96","sha256:4ec211018febd81fa80b13e6369c2991d16e1e1e8c9f1bb5b59162d27089a0da"],"state_sha256":"c3a178bf2cb1915890a2022e21e6a045d9cca7f87c1f6444f6a583bea4eb030f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fbnAPUYj/iB5+irWq7rrv/bJ2Jbcp7dqfbDomwdxhuzhUpydVsJGFCYztXd6GgnV2TcSurtVs/q4I/RxbXaJBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:47:10.115958Z","bundle_sha256":"d987260e7b93180d7c6ccad5a0647672033cfd719f6428108ef167b2446f3e3d"}}