{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QHJ7BWMOOBR3OTJJSGEPT7UBGU","short_pith_number":"pith:QHJ7BWMO","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"},"canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","source":{"kind":"arxiv","id":"1506.00063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00063","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00063v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00063","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"QHJ7BWMOOBR3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QHJ7BWMOOBR3OTJJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QHJ7BWMO","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QHJ7BWMOOBR3OTJJSGEPT7UBGU","target":"record","payload":{"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"},"canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","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"},"source_kind":"arxiv","source_id":"1506.00063","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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"thdo7SMkjbp6re1CsoamXNe6T5JnE523nYQ/s4H6NFXv02gQaqFF56imHy1OL6Hgx22Qz3vHQwf93K0fwCCvDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:37:52.485792Z"},"content_sha256":"3cbc29fdbedb15625cee0e1592105ef4a112e1144ac3b2e1366753b84f5bf183","schema_version":"1.0","event_id":"sha256:3cbc29fdbedb15625cee0e1592105ef4a112e1144ac3b2e1366753b84f5bf183"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QHJ7BWMOOBR3OTJJSGEPT7UBGU","target":"graph","payload":{"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"},"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-18T01:59:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iXkpvUPTN9kwLsy/S2TbTHFcfyf/3JbmEJbwWT4V9b2xBVhOZB59E8JfS/A+dkJVqNE+Xbr2Fw5N8sFNRpWfDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T03:37:52.486145Z"},"content_sha256":"a5201f44283fad407468800e347bca8f7572c6c5e04dd54f69d14d713262768e","schema_version":"1.0","event_id":"sha256:a5201f44283fad407468800e347bca8f7572c6c5e04dd54f69d14d713262768e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/bundle.json","state_url":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/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-07T03:37:52Z","links":{"resolver":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU","bundle":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/bundle.json","state":"https://pith.science/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QHJ7BWMOOBR3OTJJSGEPT7UBGU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QHJ7BWMOOBR3OTJJSGEPT7UBGU","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":"6827fcdee6444c1372de3754fe967ec54b1d1bd1726898adcfa8df21aa79e349","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-30T03:14:38Z","title_canon_sha256":"5db4e43ce8d08836beb6994fc56872eca046b7fc6231821590067b517758d3cf"},"schema_version":"1.0","source":{"id":"1506.00063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.00063","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"arxiv_version","alias_value":"1506.00063v1","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.00063","created_at":"2026-05-18T01:59:55Z"},{"alias_kind":"pith_short_12","alias_value":"QHJ7BWMOOBR3","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QHJ7BWMOOBR3OTJJ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QHJ7BWMO","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:a5201f44283fad407468800e347bca8f7572c6c5e04dd54f69d14d713262768e","target":"graph","created_at":"2026-05-18T01:59:55Z","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, 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","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":"2015-05-30T03:14:38Z","title":"An Efficient Dynamic Programming Algorithm for STR-IC-SEQ-EC-LCS Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.00063","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:3cbc29fdbedb15625cee0e1592105ef4a112e1144ac3b2e1366753b84f5bf183","target":"record","created_at":"2026-05-18T01:59:55Z","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":"6827fcdee6444c1372de3754fe967ec54b1d1bd1726898adcfa8df21aa79e349","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-05-30T03:14:38Z","title_canon_sha256":"5db4e43ce8d08836beb6994fc56872eca046b7fc6231821590067b517758d3cf"},"schema_version":"1.0","source":{"id":"1506.00063","kind":"arxiv","version":1}},"canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"81d3f0d98e7063b74d299188f9fe81350408c12a98bc905f4113e6e1d7f4ad45","first_computed_at":"2026-05-18T01:59:55.580807Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:59:55.580807Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w934vGpnlhtkQJAQTdbJqd8H2NtiSJzJOErmYuWa+DSn6AKVZA80+iwpH8M8TSDUS9Bx8IBa5BoanwPNOjL7Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:59:55.581279Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.00063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cbc29fdbedb15625cee0e1592105ef4a112e1144ac3b2e1366753b84f5bf183","sha256:a5201f44283fad407468800e347bca8f7572c6c5e04dd54f69d14d713262768e"],"state_sha256":"252044a75ed084f39988462b40a1a50f33579cbc15b339edd5279df71ba5f244"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Et768ZuDLRrzjpRXkIZkpRomwxtwwIG/lJlhZT/jWJDbcAorCd1hNZJFo6U49NfI7C/3tx0dDVy/UnazPOfjAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T03:37:52.488286Z","bundle_sha256":"344f97aea0a389f68458c354c76b24b51e1ccc313247206f8c030cbeb41c0c4e"}}