{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:NNPZU4FQLRNHYYCA3EG22Y357O","short_pith_number":"pith:NNPZU4FQ","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"},"canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","source":{"kind":"arxiv","id":"1303.1872","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1872","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1872v1","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1872","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"NNPZU4FQLRNH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NNPZU4FQLRNHYYCA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NNPZU4FQ","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:NNPZU4FQLRNHYYCA3EG22Y357O","target":"record","payload":{"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"},"canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","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"},"source_kind":"arxiv","source_id":"1303.1872","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-18T03:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9JfV3pN2Hy3c4qWreniPvndwMVuHxpI+GV/zqcSahyQvjs/iGLhBa5ZozFDY/eo2KOsfxcZM7Te9CWxfMW8PBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:17:48.051298Z"},"content_sha256":"c88ee41f55327d758e2e765abf6b5932b1361284ffe835c4964fb929fccfb619","schema_version":"1.0","event_id":"sha256:c88ee41f55327d758e2e765abf6b5932b1361284ffe835c4964fb929fccfb619"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:NNPZU4FQLRNHYYCA3EG22Y357O","target":"graph","payload":{"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"},"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-18T03:31:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXvKwL5K2BRnFDM3WxSTvPUSR9n+Sh0Fl8TIiPqYJ1WIMDaf5+0UODJhswL0SptU8eU9+B++F05gr+j9R2RFBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T14:17:48.051661Z"},"content_sha256":"93916d9b61c37fa8e0eddb5db12917935fa5a67eb8950ebe4d36e4c85859b6c6","schema_version":"1.0","event_id":"sha256:93916d9b61c37fa8e0eddb5db12917935fa5a67eb8950ebe4d36e4c85859b6c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/bundle.json","state_url":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NNPZU4FQLRNHYYCA3EG22Y357O/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-07T14:17:48Z","links":{"resolver":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O","bundle":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/bundle.json","state":"https://pith.science/pith/NNPZU4FQLRNHYYCA3EG22Y357O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NNPZU4FQLRNHYYCA3EG22Y357O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:NNPZU4FQLRNHYYCA3EG22Y357O","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":"c5872d22b4df688088eceaa5b6d1d24d0cbcac1c0e4f6917e354b0f02df5fa6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-08T02:15:59Z","title_canon_sha256":"1bdadcbaee6b87a4c88214014ba20d76dd0ea149c3ffe1140ce4df2ab4510a4c"},"schema_version":"1.0","source":{"id":"1303.1872","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1303.1872","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"arxiv_version","alias_value":"1303.1872v1","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1303.1872","created_at":"2026-05-18T03:31:32Z"},{"alias_kind":"pith_short_12","alias_value":"NNPZU4FQLRNH","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"NNPZU4FQLRNHYYCA","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"NNPZU4FQ","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:93916d9b61c37fa8e0eddb5db12917935fa5a67eb8950ebe4d36e4c85859b6c6","target":"graph","created_at":"2026-05-18T03:31:32Z","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 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","authors_text":"Daxin Zhu, Lei Wang, Xiaodong Wang, Yingjie Wu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-08T02:15:59Z","title":"An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1303.1872","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:c88ee41f55327d758e2e765abf6b5932b1361284ffe835c4964fb929fccfb619","target":"record","created_at":"2026-05-18T03:31:32Z","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":"c5872d22b4df688088eceaa5b6d1d24d0cbcac1c0e4f6917e354b0f02df5fa6f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-03-08T02:15:59Z","title_canon_sha256":"1bdadcbaee6b87a4c88214014ba20d76dd0ea149c3ffe1140ce4df2ab4510a4c"},"schema_version":"1.0","source":{"id":"1303.1872","kind":"arxiv","version":1}},"canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6b5f9a70b05c5a7c6040d90dad637dfb911ed17f25f7f81dc9af72d1cc4d34a1","first_computed_at":"2026-05-18T03:31:32.077931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:31:32.077931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C6VKCqb4a/40JWdwnrTBORF7r6ekpMR0lBeVaT0y9pzNi4bAbRekLsD5oNJQjXktjexFHCvlkjoPM+2hYlv7Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:31:32.078707Z","signed_message":"canonical_sha256_bytes"},"source_id":"1303.1872","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c88ee41f55327d758e2e765abf6b5932b1361284ffe835c4964fb929fccfb619","sha256:93916d9b61c37fa8e0eddb5db12917935fa5a67eb8950ebe4d36e4c85859b6c6"],"state_sha256":"744210a8074854a433177345562221dc0d8b6f2ca7ad942a2120a40ee4a9b097"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqH/hLQhLd1ZYaVxM0jIsizRueu7D1RznMsy02tiXwS/HWu7QSiSwP1OPKct/zTze/hO4xzARQiwQ+qG7aMkCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T14:17:48.053573Z","bundle_sha256":"2b57052d9454bd7de8b0dcb91be76b6f53200cfca4eebf8424942ccead666ea1"}}