{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4G676YWCX7KK7AK7K54XYYS4PI","short_pith_number":"pith:4G676YWC","canonical_record":{"source":{"id":"1408.3093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"7827504d5382dfab5fee5e7983909b8227e60ae2de52724574d93b5aa26a6d15","abstract_canon_sha256":"1c22efd0432082839872a57f0058e41d46ed13d078fa6f244013dcd9dd73dbc0"},"schema_version":"1.0"},"canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","source":{"kind":"arxiv","id":"1408.3093","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3093","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3093v2","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3093","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"4G676YWCX7KK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G676YWCX7KK7AK7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G676YWC","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4G676YWCX7KK7AK7K54XYYS4PI","target":"record","payload":{"canonical_record":{"source":{"id":"1408.3093","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","cross_cats_sorted":[],"title_canon_sha256":"7827504d5382dfab5fee5e7983909b8227e60ae2de52724574d93b5aa26a6d15","abstract_canon_sha256":"1c22efd0432082839872a57f0058e41d46ed13d078fa6f244013dcd9dd73dbc0"},"schema_version":"1.0"},"canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:13.803541Z","signature_b64":"tb89v4sBlYBjN8hadaslp1iudy2+GPC14tB1iTFnCq45zcxKKvFyslT3vJDaBrfqO4xqGPACbewrOu7BYfALCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","last_reissued_at":"2026-05-18T02:45:13.802943Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:13.802943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.3093","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-18T02:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ga5XXP8+jF+c5GglB9q2y0DQ9HNRHtiC92q2ht94lblh7u0rrrnM7DLucJLx65+QxEN9DbMNmES3MlCNBhrrCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:18:58.279908Z"},"content_sha256":"eead0e455933123259a0509aeee27e11cd7ebdb3d9273a1e1ae64ff4eca3fb1b","schema_version":"1.0","event_id":"sha256:eead0e455933123259a0509aeee27e11cd7ebdb3d9273a1e1ae64ff4eca3fb1b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4G676YWCX7KK7AK7K54XYYS4PI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rank, select and access in grammar-compressed strings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei","submitted_at":"2014-08-13T19:18:36Z","abstract_excerpt":"Given a string $S$ of length $N$ on a fixed alphabet of $\\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$. In this paper we describe data structures to support the following operations on a grammar-compressed string: $\\mbox{rank}_c(S,i)$ (return the number of occurrences of symbol $c$ before position $i$ in $S$); $\\mbox{select}_c(S,i)$ (return the position of the $i$th occurrence of $c$ in $S$); and $\\mbox{access}(S,i,j)$ (return substring $S[i,j]$). For rank and select we describe data structures of size $O(n\\sigma\\log N)$ b"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3093","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-18T02:45:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Grq1rcc9SEF34X6fWjmmZZ/BPDvzIPL+hnQ7tPNdW5vFt92aqhZUJT19IgAyUar3AiDJADmTVyHHVaAdAjatDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T08:18:58.280263Z"},"content_sha256":"e5e026692dbb9349ac7f78561aaf9d4330dd8148e0381f8c3af1428c283c3087","schema_version":"1.0","event_id":"sha256:e5e026692dbb9349ac7f78561aaf9d4330dd8148e0381f8c3af1428c283c3087"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/bundle.json","state_url":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4G676YWCX7KK7AK7K54XYYS4PI/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-06-03T08:18:58Z","links":{"resolver":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI","bundle":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/bundle.json","state":"https://pith.science/pith/4G676YWCX7KK7AK7K54XYYS4PI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4G676YWCX7KK7AK7K54XYYS4PI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4G676YWCX7KK7AK7K54XYYS4PI","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":"1c22efd0432082839872a57f0058e41d46ed13d078fa6f244013dcd9dd73dbc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","title_canon_sha256":"7827504d5382dfab5fee5e7983909b8227e60ae2de52724574d93b5aa26a6d15"},"schema_version":"1.0","source":{"id":"1408.3093","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.3093","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"arxiv_version","alias_value":"1408.3093v2","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.3093","created_at":"2026-05-18T02:45:13Z"},{"alias_kind":"pith_short_12","alias_value":"4G676YWCX7KK","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4G676YWCX7KK7AK7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4G676YWC","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:e5e026692dbb9349ac7f78561aaf9d4330dd8148e0381f8c3af1428c283c3087","target":"graph","created_at":"2026-05-18T02:45:13Z","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":"Given a string $S$ of length $N$ on a fixed alphabet of $\\sigma$ symbols, a grammar compressor produces a context-free grammar $G$ of size $n$ that generates $S$ and only $S$. In this paper we describe data structures to support the following operations on a grammar-compressed string: $\\mbox{rank}_c(S,i)$ (return the number of occurrences of symbol $c$ before position $i$ in $S$); $\\mbox{select}_c(S,i)$ (return the position of the $i$th occurrence of $c$ in $S$); and $\\mbox{access}(S,i,j)$ (return substring $S[i,j]$). For rank and select we describe data structures of size $O(n\\sigma\\log N)$ b","authors_text":"Djamal Belazzougui, Simon J. Puglisi, Yasuo Tabei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","title":"Rank, select and access in grammar-compressed strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.3093","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:eead0e455933123259a0509aeee27e11cd7ebdb3d9273a1e1ae64ff4eca3fb1b","target":"record","created_at":"2026-05-18T02:45:13Z","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":"1c22efd0432082839872a57f0058e41d46ed13d078fa6f244013dcd9dd73dbc0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-13T19:18:36Z","title_canon_sha256":"7827504d5382dfab5fee5e7983909b8227e60ae2de52724574d93b5aa26a6d15"},"schema_version":"1.0","source":{"id":"1408.3093","kind":"arxiv","version":2}},"canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1bdff62c2bfd4af815f57797c625c7a1cadc80ccd75c6cbc38ecc6be30d3132","first_computed_at":"2026-05-18T02:45:13.802943Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:13.802943Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tb89v4sBlYBjN8hadaslp1iudy2+GPC14tB1iTFnCq45zcxKKvFyslT3vJDaBrfqO4xqGPACbewrOu7BYfALCw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:13.803541Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.3093","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eead0e455933123259a0509aeee27e11cd7ebdb3d9273a1e1ae64ff4eca3fb1b","sha256:e5e026692dbb9349ac7f78561aaf9d4330dd8148e0381f8c3af1428c283c3087"],"state_sha256":"2d1fb2eea4b728ecf70add621db908d401191e234f065baf64702709e66bcf83"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tz04fihkCcxQi2827BEu9KH7XMLXcRGdHDyIexCk+miB3hwgmb2ulVsOewQ0xXAVgK/cHdO9bhXWthQQCLzxDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T08:18:58.282383Z","bundle_sha256":"a63cd7cf9a57c8e72d36959af8f1cb5ae7c1241f7b5999e5fb45700ab7a79272"}}