{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:VKOU56JU57MXTXX5JRZSBHWSZY","short_pith_number":"pith:VKOU56JU","schema_version":"1.0","canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","source":{"kind":"arxiv","id":"1109.2930","version":4},"attestation_state":"computed","paper":{"title":"Faster Approximate Pattern Matching in Compressed Repetitive Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Hoobin, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie","submitted_at":"2011-09-13T21:10:01Z","abstract_excerpt":"Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the underlying string(s). Bille et al. (2011) recently showed how, given a straight-line program with $r$ rules for a string $s$ of length $n$, we can build an $\\Oh{r}$-word data structure that allows us to extract any substring of length $m$ in $\\Oh{\\log n + m}$ time. They also showed how, given a pattern $p$ of length $m$ and an edit distance (k \\leq m), their dat"},"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.2930","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-13T21:10:01Z","cross_cats_sorted":[],"title_canon_sha256":"7fd74c950267adc1bdf0eccbd58f15ced7c5b97e1a63175e0a49ff6184fd099f","abstract_canon_sha256":"1173f0cc0c6e8b2a3316b61f098d1536a629d552229f62c55024119a8cefdcf5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:56.533648Z","signature_b64":"F6fj67YiBxiJVDLkVrH1aATzj5MaDhHT9RvFxYenq+/LYAZZbPjO43WhjwSSNCz1jPnc9McyvlqyFkbflQecDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"aa9d4ef934efd979defd4c73209ed2ce156c1c06210cdab2c2fa155f8a040e27","last_reissued_at":"2026-05-18T03:41:56.532992Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:56.532992Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Approximate Pattern Matching in Compressed Repetitive Texts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Christopher Hoobin, Pawe{\\l} Gawrychowski, Simon J. Puglisi, Travis Gagie","submitted_at":"2011-09-13T21:10:01Z","abstract_excerpt":"Motivated by the imminent growth of massive, highly redundant genomic databases, we study the problem of compressing a string database while simultaneously supporting fast random access, substring extraction and pattern matching to the underlying string(s). Bille et al. (2011) recently showed how, given a straight-line program with $r$ rules for a string $s$ of length $n$, we can build an $\\Oh{r}$-word data structure that allows us to extract any substring of length $m$ in $\\Oh{\\log n + m}$ time. They also showed how, given a pattern $p$ of length $m$ and an edit distance (k \\leq m), their dat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2930","kind":"arxiv","version":4},"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.2930","created_at":"2026-05-18T03:41:56.533089+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2930v4","created_at":"2026-05-18T03:41:56.533089+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2930","created_at":"2026-05-18T03:41:56.533089+00:00"},{"alias_kind":"pith_short_12","alias_value":"VKOU56JU57MX","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_16","alias_value":"VKOU56JU57MXTXX5","created_at":"2026-05-18T12:26:44.992195+00:00"},{"alias_kind":"pith_short_8","alias_value":"VKOU56JU","created_at":"2026-05-18T12:26:44.992195+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/VKOU56JU57MXTXX5JRZSBHWSZY","json":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY.json","graph_json":"https://pith.science/api/pith-number/VKOU56JU57MXTXX5JRZSBHWSZY/graph.json","events_json":"https://pith.science/api/pith-number/VKOU56JU57MXTXX5JRZSBHWSZY/events.json","paper":"https://pith.science/paper/VKOU56JU"},"agent_actions":{"view_html":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY","download_json":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY.json","view_paper":"https://pith.science/paper/VKOU56JU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2930&json=true","fetch_graph":"https://pith.science/api/pith-number/VKOU56JU57MXTXX5JRZSBHWSZY/graph.json","fetch_events":"https://pith.science/api/pith-number/VKOU56JU57MXTXX5JRZSBHWSZY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/action/storage_attestation","attest_author":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/action/author_attestation","sign_citation":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/action/citation_signature","submit_replication":"https://pith.science/pith/VKOU56JU57MXTXX5JRZSBHWSZY/action/replication_record"}},"created_at":"2026-05-18T03:41:56.533089+00:00","updated_at":"2026-05-18T03:41:56.533089+00:00"}