{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:6M6CTFHL4C6CD5WBEVLZXPX32C","short_pith_number":"pith:6M6CTFHL","schema_version":"1.0","canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","source":{"kind":"arxiv","id":"1308.6509","version":2},"attestation_state":"computed","paper":{"title":"Beating O(nm) in approximate LZW-compressed pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Pawel Gawrychowski","submitted_at":"2013-08-29T16:16:45Z","abstract_excerpt":"Given an LZW/LZ78 compressed text, we want to find an approximate occurrence of a given pattern of length m. The goal is to achieve time complexity depending on the size n of the compressed representation of the text instead of its length. We consider two specific definitions of approximate matching, namely the Hamming distance and the edit distance, and show how to achieve O(nm^0.5k^2) and O(nm^0.5k^3) running time, respectively, where k is the bound on the distance. Both algorithms use just linear space. Even for very small values of k, the best previously known solutions required O(nm) time"},"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":"1308.6509","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-29T16:16:45Z","cross_cats_sorted":[],"title_canon_sha256":"86d5d3ce3089c826dd0b5a03ae87c65c944c397b2b704dbb43435df0bf8d2fca","abstract_canon_sha256":"8f7fc979ff294adff15b8e0fb47eb3410f6d0364583fab2b80c95944c698095b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:47.918162Z","signature_b64":"E+QJeLflranwB6L+REw1vjkfErQUHAMMNWx6s4Ekb/Sb7zFGu9YSrFQtKG3L9QQlthVLfpNu5WdWmhLJWNswCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","last_reissued_at":"2026-05-18T03:12:47.917502Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:47.917502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Beating O(nm) in approximate LZW-compressed pattern matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Damian Straszak, Pawel Gawrychowski","submitted_at":"2013-08-29T16:16:45Z","abstract_excerpt":"Given an LZW/LZ78 compressed text, we want to find an approximate occurrence of a given pattern of length m. The goal is to achieve time complexity depending on the size n of the compressed representation of the text instead of its length. We consider two specific definitions of approximate matching, namely the Hamming distance and the edit distance, and show how to achieve O(nm^0.5k^2) and O(nm^0.5k^3) running time, respectively, where k is the bound on the distance. Both algorithms use just linear space. Even for very small values of k, the best previously known solutions required O(nm) time"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6509","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1308.6509","created_at":"2026-05-18T03:12:47.917609+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.6509v2","created_at":"2026-05-18T03:12:47.917609+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6509","created_at":"2026-05-18T03:12:47.917609+00:00"},{"alias_kind":"pith_short_12","alias_value":"6M6CTFHL4C6C","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"6M6CTFHL4C6CD5WB","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"6M6CTFHL","created_at":"2026-05-18T12:27:36.564083+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/6M6CTFHL4C6CD5WBEVLZXPX32C","json":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C.json","graph_json":"https://pith.science/api/pith-number/6M6CTFHL4C6CD5WBEVLZXPX32C/graph.json","events_json":"https://pith.science/api/pith-number/6M6CTFHL4C6CD5WBEVLZXPX32C/events.json","paper":"https://pith.science/paper/6M6CTFHL"},"agent_actions":{"view_html":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C","download_json":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C.json","view_paper":"https://pith.science/paper/6M6CTFHL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.6509&json=true","fetch_graph":"https://pith.science/api/pith-number/6M6CTFHL4C6CD5WBEVLZXPX32C/graph.json","fetch_events":"https://pith.science/api/pith-number/6M6CTFHL4C6CD5WBEVLZXPX32C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/action/storage_attestation","attest_author":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/action/author_attestation","sign_citation":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/action/citation_signature","submit_replication":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/action/replication_record"}},"created_at":"2026-05-18T03:12:47.917609+00:00","updated_at":"2026-05-18T03:12:47.917609+00:00"}