{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YYTHMKBHCJA3BDYQSCGDJ7UL7F","short_pith_number":"pith:YYTHMKBH","schema_version":"1.0","canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","source":{"kind":"arxiv","id":"1802.06369","version":1},"attestation_state":"computed","paper":{"title":"Linear-Time Algorithm for Long LCF with $k$ Mismatches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Panagiotis Charalampopoulos, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2018-02-18T13:04:21Z","abstract_excerpt":"In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their Hamming distance is at most $k$. Thankachan et al. show that this problem can be solved in $\\mathcal{O}(n \\log^k n)$ time and $\\mathcal{O}(n)$ space for constant $k$. We consider the LCF$_k$($\\ell$) problem in which we assume that the sought factors have length at least $\\ell$, and the LCF$_k$($\\ell$) problem for $\\ell=\\Omega(\\log^{2k+2} n)$, which we call the Lon"},"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":"1802.06369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"67e0ba8560a84d0c626c2dd76fb85c9d0634efc4846f1ae1ddc01149afd4b671","abstract_canon_sha256":"d2179a2feb10d9db0f7767f132445a590156a46ea9f8c6dbef2ced9eb03b4e81"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.450765Z","signature_b64":"iyLD3+cCZukO3LxNhbUNXhIpRoX7O3WPEszBQbThjlxz3l4lJi8c37rG3DWvX9RjnG9AEykVVtOfgUP53D5kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","last_reissued_at":"2026-05-18T00:23:03.450261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.450261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear-Time Algorithm for Long LCF with $k$ Mismatches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Panagiotis Charalampopoulos, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2018-02-18T13:04:21Z","abstract_excerpt":"In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their Hamming distance is at most $k$. Thankachan et al. show that this problem can be solved in $\\mathcal{O}(n \\log^k n)$ time and $\\mathcal{O}(n)$ space for constant $k$. We consider the LCF$_k$($\\ell$) problem in which we assume that the sought factors have length at least $\\ell$, and the LCF$_k$($\\ell$) problem for $\\ell=\\Omega(\\log^{2k+2} n)$, which we call the Lon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06369","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":"1802.06369","created_at":"2026-05-18T00:23:03.450330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.06369v1","created_at":"2026-05-18T00:23:03.450330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06369","created_at":"2026-05-18T00:23:03.450330+00:00"},{"alias_kind":"pith_short_12","alias_value":"YYTHMKBHCJA3","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YYTHMKBHCJA3BDYQ","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YYTHMKBH","created_at":"2026-05-18T12:33:04.347982+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/YYTHMKBHCJA3BDYQSCGDJ7UL7F","json":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F.json","graph_json":"https://pith.science/api/pith-number/YYTHMKBHCJA3BDYQSCGDJ7UL7F/graph.json","events_json":"https://pith.science/api/pith-number/YYTHMKBHCJA3BDYQSCGDJ7UL7F/events.json","paper":"https://pith.science/paper/YYTHMKBH"},"agent_actions":{"view_html":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F","download_json":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F.json","view_paper":"https://pith.science/paper/YYTHMKBH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.06369&json=true","fetch_graph":"https://pith.science/api/pith-number/YYTHMKBHCJA3BDYQSCGDJ7UL7F/graph.json","fetch_events":"https://pith.science/api/pith-number/YYTHMKBHCJA3BDYQSCGDJ7UL7F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/action/storage_attestation","attest_author":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/action/author_attestation","sign_citation":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/action/citation_signature","submit_replication":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/action/replication_record"}},"created_at":"2026-05-18T00:23:03.450330+00:00","updated_at":"2026-05-18T00:23:03.450330+00:00"}