{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:5TNKZ7XP3SF4X6OHTPNKQMRSE6","short_pith_number":"pith:5TNKZ7XP","schema_version":"1.0","canonical_sha256":"ecdaacfeefdc8bcbf9c79bdaa832322793bce957a71be7bd631408dc88075b07","source":{"kind":"arxiv","id":"1109.3954","version":6},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.3954","created_at":"2026-05-18T03:44:36.263031+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3954v6","created_at":"2026-05-18T03:44:36.263031+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3954","created_at":"2026-05-18T03:44:36.263031+00:00"},{"alias_kind":"pith_short_12","alias_value":"5TNKZ7XP3SF4","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_16","alias_value":"5TNKZ7XP3SF4X6OH","created_at":"2026-05-18T12:26:20.644004+00:00"},{"alias_kind":"pith_short_8","alias_value":"5TNKZ7XP","created_at":"2026-05-18T12:26:20.644004+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6","json":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6.json","graph_json":"https://pith.science/api/pith-number/5TNKZ7XP3SF4X6OHTPNKQMRSE6/graph.json","events_json":"https://pith.science/api/pith-number/5TNKZ7XP3SF4X6OHTPNKQMRSE6/events.json","paper":"https://pith.science/paper/5TNKZ7XP"},"agent_actions":{"view_html":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6","download_json":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6.json","view_paper":"https://pith.science/paper/5TNKZ7XP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3954&json=true","fetch_graph":"https://pith.science/api/pith-number/5TNKZ7XP3SF4X6OHTPNKQMRSE6/graph.json","fetch_events":"https://pith.science/api/pith-number/5TNKZ7XP3SF4X6OHTPNKQMRSE6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/action/storage_attestation","attest_author":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/action/author_attestation","sign_citation":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/action/citation_signature","submit_replication":"https://pith.science/pith/5TNKZ7XP3SF4X6OHTPNKQMRSE6/action/replication_record"}},"created_at":"2026-05-18T03:44:36.263031+00:00","updated_at":"2026-05-18T03:44:36.263031+00:00"}