{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:QHJ7BWMOOBR3OTJJSGEPT7UBGU","short_pith_number":"pith:QHJ7BWMO","schema_version":"1.0","canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","source":{"kind":"arxiv","id":"1506.00063","version":1},"attestation_state":"computed","paper":{"title":"An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem","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":"2015-05-30T03:14:38Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length $s$ must be included as a substring and the other constraining sequence of length $t$ must be excluded as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and the given two constraining sequences of length $s$ and $t$, we present an $O(nmst)$ time dynamic programming algorithm for solving the new generalized longest common subsequence problem. The time complexity can be reduced fu"},"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":"1506.00063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-30T03:14:38Z","cross_cats_sorted":[],"title_canon_sha256":"5db4e43ce8d08836beb6994fc56872eca046b7fc6231821590067b517758d3cf","abstract_canon_sha256":"6827fcdee6444c1372de3754fe967ec54b1d1bd1726898adcfa8df21aa79e349"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:59:55.581279Z","signature_b64":"w934vGpnlhtkQJAQTdbJqd8H2NtiSJzJOErmYuWa+DSn6AKVZA80+iwpH8M8TSDUS9Bx8IBa5BoanwPNOjL7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","last_reissued_at":"2026-05-18T01:59:55.580807Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:59:55.580807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem","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":"2015-05-30T03:14:38Z","abstract_excerpt":"In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length $s$ must be included as a substring and the other constraining sequence of length $t$ must be excluded as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and the given two constraining sequences of length $s$ and $t$, we present an $O(nmst)$ time dynamic programming algorithm for solving the new generalized longest common subsequence problem. The time complexity can be reduced fu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00063","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":"1506.00063","created_at":"2026-05-18T01:59:55.580883+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.00063v1","created_at":"2026-05-18T01:59:55.580883+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00063","created_at":"2026-05-18T01:59:55.580883+00:00"},{"alias_kind":"pith_short_12","alias_value":"QHJ7BWMOOBR3","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_16","alias_value":"QHJ7BWMOOBR3OTJJ","created_at":"2026-05-18T12:29:37.295048+00:00"},{"alias_kind":"pith_short_8","alias_value":"QHJ7BWMO","created_at":"2026-05-18T12:29:37.295048+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/QHJ7BWMOOBR3OTJJSGEPT7UBGU","json":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU.json","graph_json":"https://pith.science/api/pith-number/QHJ7BWMOOBR3OTJJSGEPT7UBGU/graph.json","events_json":"https://pith.science/api/pith-number/QHJ7BWMOOBR3OTJJSGEPT7UBGU/events.json","paper":"https://pith.science/paper/QHJ7BWMO"},"agent_actions":{"view_html":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU","download_json":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU.json","view_paper":"https://pith.science/paper/QHJ7BWMO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.00063&json=true","fetch_graph":"https://pith.science/api/pith-number/QHJ7BWMOOBR3OTJJSGEPT7UBGU/graph.json","fetch_events":"https://pith.science/api/pith-number/QHJ7BWMOOBR3OTJJSGEPT7UBGU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/action/storage_attestation","attest_author":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/action/author_attestation","sign_citation":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/action/citation_signature","submit_replication":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/action/replication_record"}},"created_at":"2026-05-18T01:59:55.580883+00:00","updated_at":"2026-05-18T01:59:55.580883+00:00"}