{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:AORILNJLMFRBGS6QKRIEAY5YSS","short_pith_number":"pith:AORILNJL","schema_version":"1.0","canonical_sha256":"03a285b52b6162134bd054504063b89496846e68c0b8fccc9d5d67985850c2bb","source":{"kind":"arxiv","id":"1409.1694","version":2},"attestation_state":"computed","paper":{"title":"Longest common substrings with k mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Esko Ukkonen, Kassian Kobert, Tomas Flouri","submitted_at":"2014-09-05T08:57:02Z","abstract_excerpt":"The longest common substring with $k$-mismatches problem is to find, given two strings $S_1$ and $S_2$, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance between $A_1$ and $A_2$ is $\\le k$. We introduce a practical $O(nm)$ time and $O(1)$ space solution for this problem, where $n$ and $m$ are the lengths of $S_1$ and $S_2$, respectively. This algorithm can also be used to compute the matching statistics with $k$-mismatches of $S_1$ and $S_2$ in $O(nm)$ time and $O(m)$ space. Moreover, we also present a theoretical solution for the $k = 1$ case which runs in $"},"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":"1409.1694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-05T08:57:02Z","cross_cats_sorted":[],"title_canon_sha256":"98c1a9de5b33cec8c53a0dc6d373d8e6989309fd8931c9a8a319658c4b9d20f6","abstract_canon_sha256":"d57c34142b9cda52b3ac21535c2b6d81c13d5da3edc66cca33e6d0b534f388dd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:19:28.333664Z","signature_b64":"OWsXITxQjjCr6r2yLFRhkmEMisXvjdhOar2FibHyP5/5fzucd8B1w2Y6dOOwgrwXeBwbpsDoImI/R9P+zk6DDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03a285b52b6162134bd054504063b89496846e68c0b8fccc9d5d67985850c2bb","last_reissued_at":"2026-05-18T02:19:28.333027Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:19:28.333027Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest common substrings with k mismatches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Emanuele Giaquinta, Esko Ukkonen, Kassian Kobert, Tomas Flouri","submitted_at":"2014-09-05T08:57:02Z","abstract_excerpt":"The longest common substring with $k$-mismatches problem is to find, given two strings $S_1$ and $S_2$, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance between $A_1$ and $A_2$ is $\\le k$. We introduce a practical $O(nm)$ time and $O(1)$ space solution for this problem, where $n$ and $m$ are the lengths of $S_1$ and $S_2$, respectively. This algorithm can also be used to compute the matching statistics with $k$-mismatches of $S_1$ and $S_2$ in $O(nm)$ time and $O(m)$ space. Moreover, we also present a theoretical solution for the $k = 1$ case which runs in $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1694","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":"1409.1694","created_at":"2026-05-18T02:19:28.333110+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1694v2","created_at":"2026-05-18T02:19:28.333110+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1694","created_at":"2026-05-18T02:19:28.333110+00:00"},{"alias_kind":"pith_short_12","alias_value":"AORILNJLMFRB","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_16","alias_value":"AORILNJLMFRBGS6Q","created_at":"2026-05-18T12:28:19.803747+00:00"},{"alias_kind":"pith_short_8","alias_value":"AORILNJL","created_at":"2026-05-18T12:28:19.803747+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/AORILNJLMFRBGS6QKRIEAY5YSS","json":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS.json","graph_json":"https://pith.science/api/pith-number/AORILNJLMFRBGS6QKRIEAY5YSS/graph.json","events_json":"https://pith.science/api/pith-number/AORILNJLMFRBGS6QKRIEAY5YSS/events.json","paper":"https://pith.science/paper/AORILNJL"},"agent_actions":{"view_html":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS","download_json":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS.json","view_paper":"https://pith.science/paper/AORILNJL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1694&json=true","fetch_graph":"https://pith.science/api/pith-number/AORILNJLMFRBGS6QKRIEAY5YSS/graph.json","fetch_events":"https://pith.science/api/pith-number/AORILNJLMFRBGS6QKRIEAY5YSS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS/action/storage_attestation","attest_author":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS/action/author_attestation","sign_citation":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS/action/citation_signature","submit_replication":"https://pith.science/pith/AORILNJLMFRBGS6QKRIEAY5YSS/action/replication_record"}},"created_at":"2026-05-18T02:19:28.333110+00:00","updated_at":"2026-05-18T02:19:28.333110+00:00"}