{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2CY3GRFC7WXQUJIWGRA2NHYX3P","short_pith_number":"pith:2CY3GRFC","schema_version":"1.0","canonical_sha256":"d0b1b344a2fdaf0a25163441a69f17dbe0d5a94802c23083b57222cff640f752","source":{"kind":"arxiv","id":"1905.01254","version":1},"attestation_state":"computed","paper":{"title":"RLE edit distance in near optimal time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel P. Martin, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski, Rapha\\\"el Clifford, Tomasz Kociumaka","submitted_at":"2019-05-03T16:19:31Z","abstract_excerpt":"We show that the edit distance between two run-length encoded strings of compressed lengths $m$ and $n$ respectively, can be computed in $\\mathcal{O}(mn\\log(mn))$ time. This improves the previous record by a factor of $\\mathcal{O}(n/\\log(mn))$. The running time of our algorithm is within subpolynomial factors of being optimal, subject to the standard SETH-hardness assumption. This effectively closes a line of algorithmic research first started in 1993."},"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":"1905.01254","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-03T16:19:31Z","cross_cats_sorted":[],"title_canon_sha256":"1b130f3b19f5d6f1b12d7f0a7d0b42c0454b5e0ef8edff23e20286571b73826a","abstract_canon_sha256":"4596b808b8cb142579b2556f0bdc8372be413d0aa2b51c5f8a0ddde8ff7d2083"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:06.403612Z","signature_b64":"jSjnxE1kijwwMEY/mmLS6gv0OZ/z/PyooQ7zOe4zf6yaiHDdzte1Frts/u71BH2ZtsrDi5eDmWgrqT4n/Th/AQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0b1b344a2fdaf0a25163441a69f17dbe0d5a94802c23083b57222cff640f752","last_reissued_at":"2026-05-17T23:47:06.402926Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:06.402926Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"RLE edit distance in near optimal time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daniel P. Martin, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski, Rapha\\\"el Clifford, Tomasz Kociumaka","submitted_at":"2019-05-03T16:19:31Z","abstract_excerpt":"We show that the edit distance between two run-length encoded strings of compressed lengths $m$ and $n$ respectively, can be computed in $\\mathcal{O}(mn\\log(mn))$ time. This improves the previous record by a factor of $\\mathcal{O}(n/\\log(mn))$. The running time of our algorithm is within subpolynomial factors of being optimal, subject to the standard SETH-hardness assumption. This effectively closes a line of algorithmic research first started in 1993."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.01254","kind":"arxiv","version":1},"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":"1905.01254","created_at":"2026-05-17T23:47:06.403032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.01254v1","created_at":"2026-05-17T23:47:06.403032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.01254","created_at":"2026-05-17T23:47:06.403032+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CY3GRFC7WXQ","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CY3GRFC7WXQUJIW","created_at":"2026-05-18T12:33:07.085635+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CY3GRFC","created_at":"2026-05-18T12:33:07.085635+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/2CY3GRFC7WXQUJIWGRA2NHYX3P","json":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P.json","graph_json":"https://pith.science/api/pith-number/2CY3GRFC7WXQUJIWGRA2NHYX3P/graph.json","events_json":"https://pith.science/api/pith-number/2CY3GRFC7WXQUJIWGRA2NHYX3P/events.json","paper":"https://pith.science/paper/2CY3GRFC"},"agent_actions":{"view_html":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P","download_json":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P.json","view_paper":"https://pith.science/paper/2CY3GRFC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.01254&json=true","fetch_graph":"https://pith.science/api/pith-number/2CY3GRFC7WXQUJIWGRA2NHYX3P/graph.json","fetch_events":"https://pith.science/api/pith-number/2CY3GRFC7WXQUJIWGRA2NHYX3P/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P/action/storage_attestation","attest_author":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P/action/author_attestation","sign_citation":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P/action/citation_signature","submit_replication":"https://pith.science/pith/2CY3GRFC7WXQUJIWGRA2NHYX3P/action/replication_record"}},"created_at":"2026-05-17T23:47:06.403032+00:00","updated_at":"2026-05-17T23:47:06.403032+00:00"}