{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:V45WBC2JCCTV5P7CH5DMTS5HUX","short_pith_number":"pith:V45WBC2J","schema_version":"1.0","canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","source":{"kind":"arxiv","id":"1705.07279","version":3},"attestation_state":"computed","paper":{"title":"Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Filip Paveti\\'c, Goran \\v{Z}u\\v{z}i\\'c, Gustav Matula, Ivan Katani\\'c, Mile \\v{S}iki\\'c","submitted_at":"2017-05-20T08:32:12Z","abstract_excerpt":"Longest Common Subsequence ($LCS$) deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a practical observation that considering single characters is often too simplistic. Therefore, recent works introduce the variants of $LCS$ based on shared substrings of length exactly or at least $k$ ($LCS_k$ and $LCS_{k+}$ respectively). The main drawback of the state-of-the-art algorithms for computing $LCS_k$ and $LCS_{k+}$ is that they work well only in a limited setting: they either solve the average case well w"},"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":"1705.07279","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"d64c8edb9effbb11ed82edbcaee53ce3ed215123f46914387f85401976697286","abstract_canon_sha256":"970a3763f7440101a93f2d7efc6f3675c532da68919664bfd1aa8aa53a95ec6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.548779Z","signature_b64":"HqUHOM9XnRBiQ2aamhVXgLvTfhO4rKENE+33063jwBpxtcR+yzzE/2PDi0snsHSMpGnwE0oT/+ooDqYg4hK2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","last_reissued_at":"2026-05-18T00:15:05.548144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.548144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Filip Paveti\\'c, Goran \\v{Z}u\\v{z}i\\'c, Gustav Matula, Ivan Katani\\'c, Mile \\v{S}iki\\'c","submitted_at":"2017-05-20T08:32:12Z","abstract_excerpt":"Longest Common Subsequence ($LCS$) deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a practical observation that considering single characters is often too simplistic. Therefore, recent works introduce the variants of $LCS$ based on shared substrings of length exactly or at least $k$ ($LCS_k$ and $LCS_{k+}$ respectively). The main drawback of the state-of-the-art algorithms for computing $LCS_k$ and $LCS_{k+}$ is that they work well only in a limited setting: they either solve the average case well w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07279","kind":"arxiv","version":3},"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":"1705.07279","created_at":"2026-05-18T00:15:05.548249+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.07279v3","created_at":"2026-05-18T00:15:05.548249+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07279","created_at":"2026-05-18T00:15:05.548249+00:00"},{"alias_kind":"pith_short_12","alias_value":"V45WBC2JCCTV","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"V45WBC2JCCTV5P7C","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"V45WBC2J","created_at":"2026-05-18T12:31:49.984773+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/V45WBC2JCCTV5P7CH5DMTS5HUX","json":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX.json","graph_json":"https://pith.science/api/pith-number/V45WBC2JCCTV5P7CH5DMTS5HUX/graph.json","events_json":"https://pith.science/api/pith-number/V45WBC2JCCTV5P7CH5DMTS5HUX/events.json","paper":"https://pith.science/paper/V45WBC2J"},"agent_actions":{"view_html":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX","download_json":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX.json","view_paper":"https://pith.science/paper/V45WBC2J","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.07279&json=true","fetch_graph":"https://pith.science/api/pith-number/V45WBC2JCCTV5P7CH5DMTS5HUX/graph.json","fetch_events":"https://pith.science/api/pith-number/V45WBC2JCCTV5P7CH5DMTS5HUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/action/storage_attestation","attest_author":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/action/author_attestation","sign_citation":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/action/citation_signature","submit_replication":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/action/replication_record"}},"created_at":"2026-05-18T00:15:05.548249+00:00","updated_at":"2026-05-18T00:15:05.548249+00:00"}