{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:5TNKZ7XP3SF4X6OHTPNKQMRSE6","short_pith_number":"pith:5TNKZ7XP","canonical_record":{"source":{"id":"1109.3954","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-19T07:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"a240b96b80ca57642e170c2dcec0eabfb4690ddef6f975760ae2869db28b091c","abstract_canon_sha256":"03a868ce1bf3e71df32f6f3c0d80bc16e2b07782143b881c562f6833dfdc4506"},"schema_version":"1.0"},"canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","source":{"kind":"arxiv","id":"1109.3954","version":6},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3954","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3954v6","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3954","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"5TNKZ7XP3SF4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TNKZ7XP3SF4X6OH","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TNKZ7XP","created_at":"2026-05-18T12:26:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:5TNKZ7XP3SF4X6OHTPNKQMRSE6","target":"record","payload":{"canonical_record":{"source":{"id":"1109.3954","kind":"arxiv","version":6},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-19T07:10:06Z","cross_cats_sorted":[],"title_canon_sha256":"a240b96b80ca57642e170c2dcec0eabfb4690ddef6f975760ae2869db28b091c","abstract_canon_sha256":"03a868ce1bf3e71df32f6f3c0d80bc16e2b07782143b881c562f6833dfdc4506"},"schema_version":"1.0"},"canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:36.263669Z","signature_b64":"sq5BgTV4nFjf/3w19eWK2tZjfwZdhkOyPSWdk36EhLeeyeNHO6RMW+VVx04B/hjClt+4fnqc6FaidmjApeIFBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","last_reissued_at":"2026-05-18T03:44:36.262914Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:36.262914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1109.3954","source_version":6,"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:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gWdro/lcEvg5kumrRGfSsUJgu52+KgfB01po6M7BitcROoNB2NLr09a1kf3FCo1KA4dJC0bDyAtBq2KYoHAWCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:18:51.118531Z"},"content_sha256":"94bf57298e4989e81eead8a39a2414c22045ec63eaf64ae4bc99e72db86694de","schema_version":"1.0","event_id":"sha256:94bf57298e4989e81eead8a39a2414c22045ec63eaf64ae4bc99e72db86694de"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:5TNKZ7XP3SF4X6OHTPNKQMRSE6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Faster Grammar-Based Self-Index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Juha K\\\"arkk\\\"ainen, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie, Yakov Nekrich","submitted_at":"2011-09-19T07:10:06Z","abstract_excerpt":"To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on grammars. In this paper we show how, given a straight-line program with $r$ rules for a string (S [1..n]) whose LZ77 parse consists of $z$ phrases, we can store a self-index for $S$ in $\\Oh{r + z \\log \\log n}$ space such that, given a pattern (P [1..m]), we can list the $\\occ$ occurrences of $P$ in $S$ in $\\Oh{m^2 + \\occ \\log \\log n}$ time. If the straight-line program is balanced and we accept a small probability of building a faulty index, then we can reduce the $\\Oh"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3954","kind":"arxiv","version":6},"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:44:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8zPl5mf5FzP0SMdRndPsSKB16JegmPdnfc+uWS2E5tVPAujeUPSkstgna1zXh1+rwTV/FKaN8Wz5V7pT5U17Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T23:18:51.118992Z"},"content_sha256":"d668e31ab61b928b74c33fdf631a224235272e6a3cf9ea0d380e4bcfebbf6533","schema_version":"1.0","event_id":"sha256:d668e31ab61b928b74c33fdf631a224235272e6a3cf9ea0d380e4bcfebbf6533"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/bundle.json","state_url":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/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-26T23:18:51Z","links":{"resolver":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6","bundle":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/bundle.json","state":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:5TNKZ7XP3SF4X6OHTPNKQMRSE6","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":"03a868ce1bf3e71df32f6f3c0d80bc16e2b07782143b881c562f6833dfdc4506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-19T07:10:06Z","title_canon_sha256":"a240b96b80ca57642e170c2dcec0eabfb4690ddef6f975760ae2869db28b091c"},"schema_version":"1.0","source":{"id":"1109.3954","kind":"arxiv","version":6}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.3954","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"arxiv_version","alias_value":"1109.3954v6","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3954","created_at":"2026-05-18T03:44:36Z"},{"alias_kind":"pith_short_12","alias_value":"5TNKZ7XP3SF4","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_16","alias_value":"5TNKZ7XP3SF4X6OH","created_at":"2026-05-18T12:26:20Z"},{"alias_kind":"pith_short_8","alias_value":"5TNKZ7XP","created_at":"2026-05-18T12:26:20Z"}],"graph_snapshots":[{"event_id":"sha256:d668e31ab61b928b74c33fdf631a224235272e6a3cf9ea0d380e4bcfebbf6533","target":"graph","created_at":"2026-05-18T03:44:36Z","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":"To store and search genomic databases efficiently, researchers have recently started building compressed self-indexes based on grammars. In this paper we show how, given a straight-line program with $r$ rules for a string (S [1..n]) whose LZ77 parse consists of $z$ phrases, we can store a self-index for $S$ in $\\Oh{r + z \\log \\log n}$ space such that, given a pattern (P [1..m]), we can list the $\\occ$ occurrences of $P$ in $S$ in $\\Oh{m^2 + \\occ \\log \\log n}$ time. If the straight-line program is balanced and we accept a small probability of building a faulty index, then we can reduce the $\\Oh","authors_text":"Juha K\\\"arkk\\\"ainen, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie, Yakov Nekrich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-19T07:10:06Z","title":"A Faster Grammar-Based Self-Index"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3954","kind":"arxiv","version":6},"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:94bf57298e4989e81eead8a39a2414c22045ec63eaf64ae4bc99e72db86694de","target":"record","created_at":"2026-05-18T03:44:36Z","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":"03a868ce1bf3e71df32f6f3c0d80bc16e2b07782143b881c562f6833dfdc4506","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-19T07:10:06Z","title_canon_sha256":"a240b96b80ca57642e170c2dcec0eabfb4690ddef6f975760ae2869db28b091c"},"schema_version":"1.0","source":{"id":"1109.3954","kind":"arxiv","version":6}},"canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","first_computed_at":"2026-05-18T03:44:36.262914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:36.262914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sq5BgTV4nFjf/3w19eWK2tZjfwZdhkOyPSWdk36EhLeeyeNHO6RMW+VVx04B/hjClt+4fnqc6FaidmjApeIFBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:36.263669Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.3954","source_kind":"arxiv","source_version":6}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:94bf57298e4989e81eead8a39a2414c22045ec63eaf64ae4bc99e72db86694de","sha256:d668e31ab61b928b74c33fdf631a224235272e6a3cf9ea0d380e4bcfebbf6533"],"state_sha256":"3db390a0bf2be389b778a74f75b58db34e1c4c9f4c69caa4d1e4fbea5fb4e078"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mHfwvj5KLZumLlkRvPvB04ASWMru7JcqCdhCV2BTcFVPqaMvNrPPlC9rKLj9s/qJS0aTkvmicUPPlbWb8/tNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T23:18:51.121994Z","bundle_sha256":"1725789d4c7e2c3b3bf4ce7a4c3ca52784fb3f82af98b486a29c7e3684353232"}}