{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:DEHMYC4MKM2W2ERDI4TVLO36DW","short_pith_number":"pith:DEHMYC4M","schema_version":"1.0","canonical_sha256":"190ecc0b8c53356d1223472755bb7e1da071bf82680cf2ba8b401bdd053919ae","source":{"kind":"arxiv","id":"1609.03668","version":3},"attestation_state":"computed","paper":{"title":"Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Diptarama, Hideo Bannai, Kazuyuki Narisawa, Masatoshi Kurihara, Ryo Yoshinaka, Shunsuke Inenaga, Yohei Ueki, Yoshiaki Matsuoka","submitted_at":"2016-09-13T03:54:52Z","abstract_excerpt":"We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least $k$ length substrings. First, we show an $O(mn)$ time algorithm for the problem which gives a better worst-case running time than existing algorithms, where $m$ and $n$ are lengths of the input strings. Furthermore, we mainly consider the LCS in at least $k$ length order-isomorphic substrings problem. We show that the problem can also be solved in $O(mn)$ worst-case time by an easy-to-implement algorithm."},"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":"1609.03668","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-13T03:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"76f317a8dded13600925c4ca80337b2dad5f4591848749b601f95f08e73c9965","abstract_canon_sha256":"9a576bb8c546297262d42d87b938105ab7e353e3051e6c0f75926b93a1c0b9df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:25.327658Z","signature_b64":"fJ+iIbS9wg9Ikh7rGY6lnSM5DgafhAmvaRaAk/SI17zcPLpgmunjE3sjSdIMv9JjKm7IbukiwYF51x01VOgoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"190ecc0b8c53356d1223472755bb7e1da071bf82680cf2ba8b401bdd053919ae","last_reissued_at":"2026-05-18T00:51:25.327115Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:25.327115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ayumi Shinohara, Diptarama, Hideo Bannai, Kazuyuki Narisawa, Masatoshi Kurihara, Ryo Yoshinaka, Shunsuke Inenaga, Yohei Ueki, Yoshiaki Matsuoka","submitted_at":"2016-09-13T03:54:52Z","abstract_excerpt":"We consider the longest common subsequence (LCS) problem with the restriction that the common subsequence is required to consist of at least $k$ length substrings. First, we show an $O(mn)$ time algorithm for the problem which gives a better worst-case running time than existing algorithms, where $m$ and $n$ are lengths of the input strings. Furthermore, we mainly consider the LCS in at least $k$ length order-isomorphic substrings problem. We show that the problem can also be solved in $O(mn)$ worst-case time by an easy-to-implement algorithm."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03668","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":"1609.03668","created_at":"2026-05-18T00:51:25.327187+00:00"},{"alias_kind":"arxiv_version","alias_value":"1609.03668v3","created_at":"2026-05-18T00:51:25.327187+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03668","created_at":"2026-05-18T00:51:25.327187+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEHMYC4MKM2W","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEHMYC4MKM2W2ERD","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEHMYC4M","created_at":"2026-05-18T12:30:12.583610+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/DEHMYC4MKM2W2ERDI4TVLO36DW","json":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW.json","graph_json":"https://pith.science/api/pith-number/DEHMYC4MKM2W2ERDI4TVLO36DW/graph.json","events_json":"https://pith.science/api/pith-number/DEHMYC4MKM2W2ERDI4TVLO36DW/events.json","paper":"https://pith.science/paper/DEHMYC4M"},"agent_actions":{"view_html":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW","download_json":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW.json","view_paper":"https://pith.science/paper/DEHMYC4M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1609.03668&json=true","fetch_graph":"https://pith.science/api/pith-number/DEHMYC4MKM2W2ERDI4TVLO36DW/graph.json","fetch_events":"https://pith.science/api/pith-number/DEHMYC4MKM2W2ERDI4TVLO36DW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW/action/storage_attestation","attest_author":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW/action/author_attestation","sign_citation":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW/action/citation_signature","submit_replication":"https://pith.science/pith/DEHMYC4MKM2W2ERDI4TVLO36DW/action/replication_record"}},"created_at":"2026-05-18T00:51:25.327187+00:00","updated_at":"2026-05-18T00:51:25.327187+00:00"}