{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:JOFJRR3WUPSW3BTVWNDGWTMNVG","short_pith_number":"pith:JOFJRR3W","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"},"canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","source":{"kind":"arxiv","id":"1505.06529","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06529","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06529v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06529","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JOFJRR3WUPSW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JOFJRR3WUPSW3BTV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JOFJRR3W","created_at":"2026-05-18T12:29:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:JOFJRR3WUPSW3BTVWNDGWTMNVG","target":"record","payload":{"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"},"canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","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"},"source_kind":"arxiv","source_id":"1505.06529","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1jiYamUjNLLyXVoiDcedPuz/IJsVKyOp3e45sR5GLsupakjk4ZGstxIMtfzwFahbmyAsDUtS+96OlPmMZk6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:20:10.957040Z"},"content_sha256":"868882f536b80c40ba4045a4a3e7648aaccf5f0d9b489d83f15a40156a5544cd","schema_version":"1.0","event_id":"sha256:868882f536b80c40ba4045a4a3e7648aaccf5f0d9b489d83f15a40156a5544cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:JOFJRR3WUPSW3BTVWNDGWTMNVG","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RuK/veAnxT0YrJ6d60PBzEpD9B47PTxRHQrAq58zzGds0d8H4DIcfHjiBrEW5tErWq2vKH0SnifeJl1ON9UhCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T01:20:10.957749Z"},"content_sha256":"96f72d6cf0d8f6fcbf27862daea2f5439e3fa1e0a45f67213a0a21b399b7606f","schema_version":"1.0","event_id":"sha256:96f72d6cf0d8f6fcbf27862daea2f5439e3fa1e0a45f67213a0a21b399b7606f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/bundle.json","state_url":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-07T01:20:10Z","links":{"resolver":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG","bundle":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/bundle.json","state":"https://pith.science/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JOFJRR3WUPSW3BTVWNDGWTMNVG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:JOFJRR3WUPSW3BTVWNDGWTMNVG","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":"d67d1f2a3be2832a9c203476ff0be2c61152b4bbfd05c38bbf9348bcbe33a7df","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2015-05-25T03:13:32Z","title_canon_sha256":"8607dbf909c8af4929e41c8faef0f651c7ec31342eba2260e7bfa848bfb1a669"},"schema_version":"1.0","source":{"id":"1505.06529","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06529","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06529v1","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06529","created_at":"2026-05-18T02:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"JOFJRR3WUPSW","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_16","alias_value":"JOFJRR3WUPSW3BTV","created_at":"2026-05-18T12:29:27Z"},{"alias_kind":"pith_short_8","alias_value":"JOFJRR3W","created_at":"2026-05-18T12:29:27Z"}],"graph_snapshots":[{"event_id":"sha256:96f72d6cf0d8f6fcbf27862daea2f5439e3fa1e0a45f67213a0a21b399b7606f","target":"graph","created_at":"2026-05-18T02:03:44Z","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":"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","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2015-05-25T03:13:32Z","title":"An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06529","kind":"arxiv","version":1},"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:868882f536b80c40ba4045a4a3e7648aaccf5f0d9b489d83f15a40156a5544cd","target":"record","created_at":"2026-05-18T02:03:44Z","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":"d67d1f2a3be2832a9c203476ff0be2c61152b4bbfd05c38bbf9348bcbe33a7df","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2015-05-25T03:13:32Z","title_canon_sha256":"8607dbf909c8af4929e41c8faef0f651c7ec31342eba2260e7bfa848bfb1a669"},"schema_version":"1.0","source":{"id":"1505.06529","kind":"arxiv","version":1}},"canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4b8a98c776a3e56d8675b3466b4d8da9821c4eadf71952fa9005e8463bf2d546","first_computed_at":"2026-05-18T02:03:44.736443Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:03:44.736443Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h0EavrBmSUmq+O+awHGdmkNHK4tX9FW8eI1Q7CBpgcL7ick2eaBY1wb3CuTM8Xp+VDa7ffcnx2gqI/fIaY1XBg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:03:44.736999Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06529","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:868882f536b80c40ba4045a4a3e7648aaccf5f0d9b489d83f15a40156a5544cd","sha256:96f72d6cf0d8f6fcbf27862daea2f5439e3fa1e0a45f67213a0a21b399b7606f"],"state_sha256":"1237467b951b81c01612c38b84a4f97d0ef400524f89e3f09c6afd2ff72c3252"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRtZNkwKGIMcJ3Rz1sFGPw+MVcpWjtMIxl6hfxrillBvERRIdUDUGszFcTTvDAouBlNiRX8VvNoTpxDUjICwCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T01:20:10.961478Z","bundle_sha256":"27570f55f8e46464ce78395e6389cdb143755e753e575891a82b66cc1d085f8e"}}