{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC","short_pith_number":"pith:QXIDBM5S","schema_version":"1.0","canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","source":{"kind":"arxiv","id":"1311.4552","version":1},"attestation_state":"computed","paper":{"title":"Efficient algorithms for the longest common subsequence in $k$-length substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2013-11-18T21:02:38Z","abstract_excerpt":"Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols from two sequences $A$ and $B$ are replaced with matching non-overlapping substrings of length $k$ from $A$ and $B$. We propose several algorithms for LCS$k$, being non-trivial incarnations of the major concepts known from LCS research (dynamic programming, sparse dynamic programming, tabulation). Our algorithms make use of a linear-time and linear-space preprocessing finding "},"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":"1311.4552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662","abstract_canon_sha256":"91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.989912Z","signature_b64":"4jelHfbGn1zG/aLjyCeVpoZbYY2McRZ0msp3RRu/9kPrNzj/BhE+px0mmNo7pvcJ1h2B/rLQnQjx7wMAxRAUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","last_reissued_at":"2026-05-18T03:06:43.989407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.989407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient algorithms for the longest common subsequence in $k$-length substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2013-11-18T21:02:38Z","abstract_excerpt":"Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols from two sequences $A$ and $B$ are replaced with matching non-overlapping substrings of length $k$ from $A$ and $B$. We propose several algorithms for LCS$k$, being non-trivial incarnations of the major concepts known from LCS research (dynamic programming, sparse dynamic programming, tabulation). Our algorithms make use of a linear-time and linear-space preprocessing finding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4552","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":"1311.4552","created_at":"2026-05-18T03:06:43.989470+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.4552v1","created_at":"2026-05-18T03:06:43.989470+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4552","created_at":"2026-05-18T03:06:43.989470+00:00"},{"alias_kind":"pith_short_12","alias_value":"QXIDBM5S3J2M","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_16","alias_value":"QXIDBM5S3J2MALSH","created_at":"2026-05-18T12:27:57.521954+00:00"},{"alias_kind":"pith_short_8","alias_value":"QXIDBM5S","created_at":"2026-05-18T12:27:57.521954+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/QXIDBM5S3J2MALSHUWRU3TIJMC","json":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC.json","graph_json":"https://pith.science/api/pith-number/QXIDBM5S3J2MALSHUWRU3TIJMC/graph.json","events_json":"https://pith.science/api/pith-number/QXIDBM5S3J2MALSHUWRU3TIJMC/events.json","paper":"https://pith.science/paper/QXIDBM5S"},"agent_actions":{"view_html":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC","download_json":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC.json","view_paper":"https://pith.science/paper/QXIDBM5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.4552&json=true","fetch_graph":"https://pith.science/api/pith-number/QXIDBM5S3J2MALSHUWRU3TIJMC/graph.json","fetch_events":"https://pith.science/api/pith-number/QXIDBM5S3J2MALSHUWRU3TIJMC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/action/storage_attestation","attest_author":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/action/author_attestation","sign_citation":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/action/citation_signature","submit_replication":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/action/replication_record"}},"created_at":"2026-05-18T03:06:43.989470+00:00","updated_at":"2026-05-18T03:06:43.989470+00:00"}