{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:NNPZU4FQLRNHYYCA3EG22Y357O","short_pith_number":"pith:NNPZU4FQ","schema_version":"1.0","canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","source":{"kind":"arxiv","id":"1303.1872","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2013-03-08T02:15:59Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constrains $P=\\{P_1,...,P_d\\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ excluding each of constrain string in $P$ as a substring and the length of $Z$ is maximized. The problem was declared to be NP-hard\\cite{1}, but we finally found that this is not true. A new dynamic programming solution for this problem is presented in this paper. The correctness o"},"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":"1303.1872","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-08T02:15:59Z","cross_cats_sorted":[],"title_canon_sha256":"1bdadcbaee6b87a4c88214014ba20d76dd0ea149c3ffe1140ce4df2ab4510a4c","abstract_canon_sha256":"c5872d22b4df688088eceaa5b6d1d24d0cbcac1c0e4f6917e354b0f02df5fa6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:31:32.078707Z","signature_b64":"C6VKCqb4a/40JWdwnrTBORF7r6ekpMR0lBeVaT0y9pzNi4bAbRekLsD5oNJQjXktjexFHCvlkjoPM+2hYlv7Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","last_reissued_at":"2026-05-18T03:31:32.077931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:31:32.077931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","submitted_at":"2013-03-08T02:15:59Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constrains $P=\\{P_1,...,P_d\\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ excluding each of constrain string in $P$ as a substring and the length of $Z$ is maximized. The problem was declared to be NP-hard\\cite{1}, but we finally found that this is not true. A new dynamic programming solution for this problem is presented in this paper. The correctness o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1872","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":"1303.1872","created_at":"2026-05-18T03:31:32.078066+00:00"},{"alias_kind":"arxiv_version","alias_value":"1303.1872v1","created_at":"2026-05-18T03:31:32.078066+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1872","created_at":"2026-05-18T03:31:32.078066+00:00"},{"alias_kind":"pith_short_12","alias_value":"NNPZU4FQLRNH","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_16","alias_value":"NNPZU4FQLRNHYYCA","created_at":"2026-05-18T12:27:52.871228+00:00"},{"alias_kind":"pith_short_8","alias_value":"NNPZU4FQ","created_at":"2026-05-18T12:27:52.871228+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/NNPZU4FQLRNHYYCA3EG22Y357O","json":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O.json","graph_json":"https://pith.science/api/pith-number/NNPZU4FQLRNHYYCA3EG22Y357O/graph.json","events_json":"https://pith.science/api/pith-number/NNPZU4FQLRNHYYCA3EG22Y357O/events.json","paper":"https://pith.science/paper/NNPZU4FQ"},"agent_actions":{"view_html":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O","download_json":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O.json","view_paper":"https://pith.science/paper/NNPZU4FQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1303.1872&json=true","fetch_graph":"https://pith.science/api/pith-number/NNPZU4FQLRNHYYCA3EG22Y357O/graph.json","fetch_events":"https://pith.science/api/pith-number/NNPZU4FQLRNHYYCA3EG22Y357O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/action/storage_attestation","attest_author":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/action/author_attestation","sign_citation":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/action/citation_signature","submit_replication":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/action/replication_record"}},"created_at":"2026-05-18T03:31:32.078066+00:00","updated_at":"2026-05-18T03:31:32.078066+00:00"}