{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:DEHMYC4MKM2W2ERDI4TVLO36DW","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9a576bb8c546297262d42d87b938105ab7e353e3051e6c0f75926b93a1c0b9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-13T03:54:52Z","title_canon_sha256":"76f317a8dded13600925c4ca80337b2dad5f4591848749b601f95f08e73c9965"},"schema_version":"1.0","source":{"id":"1609.03668","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.03668","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"arxiv_version","alias_value":"1609.03668v3","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.03668","created_at":"2026-05-18T00:51:25Z"},{"alias_kind":"pith_short_12","alias_value":"DEHMYC4MKM2W","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"DEHMYC4MKM2W2ERD","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"DEHMYC4M","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:5fa27e8c30b6eb05d3a1d1ad706f20933c018b8d7d4b5e8a7789c5cbe5deb7e0","target":"graph","created_at":"2026-05-18T00:51:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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.","authors_text":"Ayumi Shinohara, Diptarama, Hideo Bannai, Kazuyuki Narisawa, Masatoshi Kurihara, Ryo Yoshinaka, Shunsuke Inenaga, Yohei Ueki, Yoshiaki Matsuoka","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-13T03:54:52Z","title":"Longest Common Subsequence in at Least $k$ Length Order-Isomorphic Substrings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.03668","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9b96800f727f8ddbb378bb88c4bd5b0441cb88f57989946934a6df19db81f297","target":"record","created_at":"2026-05-18T00:51:25Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9a576bb8c546297262d42d87b938105ab7e353e3051e6c0f75926b93a1c0b9df","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-09-13T03:54:52Z","title_canon_sha256":"76f317a8dded13600925c4ca80337b2dad5f4591848749b601f95f08e73c9965"},"schema_version":"1.0","source":{"id":"1609.03668","kind":"arxiv","version":3}},"canonical_sha256":"190ecc0b8c53356d1223472755bb7e1da071bf82680cf2ba8b401bdd053919ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"190ecc0b8c53356d1223472755bb7e1da071bf82680cf2ba8b401bdd053919ae","first_computed_at":"2026-05-18T00:51:25.327115Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:51:25.327115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"fJ+iIbS9wg9Ikh7rGY6lnSM5DgafhAmvaRaAk/SI17zcPLpgmunjE3sjSdIMv9JjKm7IbukiwYF51x01VOgoAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:51:25.327658Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.03668","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9b96800f727f8ddbb378bb88c4bd5b0441cb88f57989946934a6df19db81f297","sha256:5fa27e8c30b6eb05d3a1d1ad706f20933c018b8d7d4b5e8a7789c5cbe5deb7e0"],"state_sha256":"813f211eff4762bf9e111c5a37e1ce5f6caca388bf4df01aa3150be12f69739b"}