{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:6M6CTFHL4C6CD5WBEVLZXPX32C","short_pith_number":"pith:6M6CTFHL","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"},"canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","source":{"kind":"arxiv","id":"1308.6509","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6509","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6509v2","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6509","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"6M6CTFHL4C6C","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6M6CTFHL4C6CD5WB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6M6CTFHL","created_at":"2026-05-18T12:27:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:6M6CTFHL4C6CD5WBEVLZXPX32C","target":"record","payload":{"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"},"canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","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"},"source_kind":"arxiv","source_id":"1308.6509","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-18T03:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"13FMIjyU/s6u0//yewimre3UtGKYfRIsEPVsQ9ULJtAEM1wxvTwnW2Kij8JFMYVz81I14SjkrW/iT63/EX2mBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:19:46.543294Z"},"content_sha256":"4d12d7f8dbad8034eb3a9b0e32f687cd20bf3afeec3e7b60cb030ea89008ff95","schema_version":"1.0","event_id":"sha256:4d12d7f8dbad8034eb3a9b0e32f687cd20bf3afeec3e7b60cb030ea89008ff95"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:6M6CTFHL4C6CD5WBEVLZXPX32C","target":"graph","payload":{"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"},"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:12:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UM16wZLNWWp4dplAZzlJYvibKDDNYYm2RKe+z2AqmLQVgYw3z2fcC5buqMITw2V3qwliU3Xhb1pi7uAf1H55BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T16:19:46.543658Z"},"content_sha256":"db5fdddd92ae1906ba3b35a09d977b4b72d9cad5430f017899a7d39f3a0e533d","schema_version":"1.0","event_id":"sha256:db5fdddd92ae1906ba3b35a09d977b4b72d9cad5430f017899a7d39f3a0e533d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/bundle.json","state_url":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/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-04T16:19:46Z","links":{"resolver":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C","bundle":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/bundle.json","state":"https://pith.science/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6M6CTFHL4C6CD5WBEVLZXPX32C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:6M6CTFHL4C6CD5WBEVLZXPX32C","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":"8f7fc979ff294adff15b8e0fb47eb3410f6d0364583fab2b80c95944c698095b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-29T16:16:45Z","title_canon_sha256":"86d5d3ce3089c826dd0b5a03ae87c65c944c397b2b704dbb43435df0bf8d2fca"},"schema_version":"1.0","source":{"id":"1308.6509","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.6509","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1308.6509v2","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.6509","created_at":"2026-05-18T03:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"6M6CTFHL4C6C","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"6M6CTFHL4C6CD5WB","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"6M6CTFHL","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:db5fdddd92ae1906ba3b35a09d977b4b72d9cad5430f017899a7d39f3a0e533d","target":"graph","created_at":"2026-05-18T03:12:47Z","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 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","authors_text":"Damian Straszak, Pawel Gawrychowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-29T16:16:45Z","title":"Beating O(nm) in approximate LZW-compressed pattern matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.6509","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:4d12d7f8dbad8034eb3a9b0e32f687cd20bf3afeec3e7b60cb030ea89008ff95","target":"record","created_at":"2026-05-18T03:12:47Z","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":"8f7fc979ff294adff15b8e0fb47eb3410f6d0364583fab2b80c95944c698095b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-29T16:16:45Z","title_canon_sha256":"86d5d3ce3089c826dd0b5a03ae87c65c944c397b2b704dbb43435df0bf8d2fca"},"schema_version":"1.0","source":{"id":"1308.6509","kind":"arxiv","version":2}},"canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f33c2994ebe0bc21f6c125579bbefbd098bca9e140a37ac780397490492a839b","first_computed_at":"2026-05-18T03:12:47.917502Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:47.917502Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"E+QJeLflranwB6L+REw1vjkfErQUHAMMNWx6s4Ekb/Sb7zFGu9YSrFQtKG3L9QQlthVLfpNu5WdWmhLJWNswCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:47.918162Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.6509","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4d12d7f8dbad8034eb3a9b0e32f687cd20bf3afeec3e7b60cb030ea89008ff95","sha256:db5fdddd92ae1906ba3b35a09d977b4b72d9cad5430f017899a7d39f3a0e533d"],"state_sha256":"e70b0811fbcb81a87888de25217314720b3d3ddfc08c44095dd770a2a396f1c3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jeXZk0B79eX2XJgx55/4dv2QHtrO+4/uwIrXrj0biGBC4mPIbp6fdj9Ti49pV9ZIkqN0emC+MmCPpYlyqcn+BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T16:19:46.545574Z","bundle_sha256":"8382c0e172add179e9f564b90bfd003cb2ea0f0b76179970da7104cd94a0e78d"}}