{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:JOFJRR3WUPSW3BTVWNDGWTMNVG","short_pith_number":"pith:JOFJRR3W","schema_version":"1.0","canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","source":{"kind":"arxiv","id":"1505.06529","version":1},"attestation_state":"computed","paper":{"title":"An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2015-05-25T03:13:32Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constraints $P=\\{P_1,\\cdots,P_d\\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ including each of constraint string in $P$ as a substring and the length of $Z$ is maximized. A new dynamic programming solution to this problem is presented in this paper. The correctness of the new algorithm is proved. The time complexity of our algorithm is $O(d2^dnmr)$. In"},"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":"1505.06529","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2015-05-25T03:13:32Z","cross_cats_sorted":[],"title_canon_sha256":"8607dbf909c8af4929e41c8faef0f651c7ec31342eba2260e7bfa848bfb1a669","abstract_canon_sha256":"d67d1f2a3be2832a9c203476ff0be2c61152b4bbfd05c38bbf9348bcbe33a7df"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:03:44.736999Z","signature_b64":"h0EavrBmSUmq+O+awHGdmkNHK4tX9FW8eI1Q7CBpgcL7ick2eaBY1wb3CuTM8Xp+VDa7ffcnx2gqI/fIaY1XBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","last_reissued_at":"2026-05-18T02:03:44.736443Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:03:44.736443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2015-05-25T03:13:32Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constraints $P=\\{P_1,\\cdots,P_d\\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ including each of constraint string in $P$ as a substring and the length of $Z$ is maximized. A new dynamic programming solution to this problem is presented in this paper. The correctness of the new algorithm is proved. The time complexity of our algorithm is $O(d2^dnmr)$. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06529","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":"1505.06529","created_at":"2026-05-18T02:03:44.736552+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06529v1","created_at":"2026-05-18T02:03:44.736552+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06529","created_at":"2026-05-18T02:03:44.736552+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOFJRR3WUPSW","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOFJRR3WUPSW3BTV","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOFJRR3W","created_at":"2026-05-18T12:29:27.538025+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/JOFJRR3WUPSW3BTVWNDGWTMNVG","json":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG.json","graph_json":"https://pith.science/api/pith-number/JOFJRR3WUPSW3BTVWNDGWTMNVG/graph.json","events_json":"https://pith.science/api/pith-number/JOFJRR3WUPSW3BTVWNDGWTMNVG/events.json","paper":"https://pith.science/paper/JOFJRR3W"},"agent_actions":{"view_html":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG","download_json":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG.json","view_paper":"https://pith.science/paper/JOFJRR3W","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06529&json=true","fetch_graph":"https://pith.science/api/pith-number/JOFJRR3WUPSW3BTVWNDGWTMNVG/graph.json","fetch_events":"https://pith.science/api/pith-number/JOFJRR3WUPSW3BTVWNDGWTMNVG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/action/storage_attestation","attest_author":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/action/author_attestation","sign_citation":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/action/citation_signature","submit_replication":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/action/replication_record"}},"created_at":"2026-05-18T02:03:44.736552+00:00","updated_at":"2026-05-18T02:03:44.736552+00:00"}