{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:TZCCWEMSMJS3WOHMLNXUPZX7V6","short_pith_number":"pith:TZCCWEMS","schema_version":"1.0","canonical_sha256":"9e442b11926265bb38ec5b6f47e6ffaf82a2e38d5a78a96af07e0775b2e23ac8","source":{"kind":"arxiv","id":"1703.04954","version":1},"attestation_state":"computed","paper":{"title":"Faster STR-IC-LCS computation via RLE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Keita Kuboi, Masayuki Takeda, Shunsuke Inenaga, Yuta Fujishige","submitted_at":"2017-03-15T06:21:59Z","abstract_excerpt":"The constrained LCS problem asks one to find a longest common subsequence of two input strings $A$ and $B$ with some constraints. The STR-IC-LCS problem is a variant of the constrained LCS problem, where the solution must include a given constraint string $C$ as a substring. Given two strings $A$ and $B$ of respective lengths $M$ and $N$, and a constraint string $C$ of length at most $\\min\\{M, N\\}$, the best known algorithm for the STR-IC-LCS problem, proposed by Deorowicz~({\\em Inf. Process. Lett.}, 11:423--426, 2012), runs in $O(MN)$ time. In this work, we present an $O(mN + nM)$-time soluti"},"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":"1703.04954","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-15T06:21:59Z","cross_cats_sorted":[],"title_canon_sha256":"48d6e8bdcea5c50919fb3df7254a769007825d3a3be5371a11c28a98123c4c50","abstract_canon_sha256":"cabdc306f2ec749e3fb8d642b7b88a3aa5be45901a6db408af7e3b5121cb8218"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:38.745660Z","signature_b64":"JhYAZh/f+c85whe2bY+wx9orfbQJyCrk1AtZFTRIc0h0OH16TAh5vvglhcmBeLiNpD52kFz+jWq+22FkDw/0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9e442b11926265bb38ec5b6f47e6ffaf82a2e38d5a78a96af07e0775b2e23ac8","last_reissued_at":"2026-05-18T00:48:38.744973Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:38.744973Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster STR-IC-LCS computation via RLE","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hideo Bannai, Keita Kuboi, Masayuki Takeda, Shunsuke Inenaga, Yuta Fujishige","submitted_at":"2017-03-15T06:21:59Z","abstract_excerpt":"The constrained LCS problem asks one to find a longest common subsequence of two input strings $A$ and $B$ with some constraints. The STR-IC-LCS problem is a variant of the constrained LCS problem, where the solution must include a given constraint string $C$ as a substring. Given two strings $A$ and $B$ of respective lengths $M$ and $N$, and a constraint string $C$ of length at most $\\min\\{M, N\\}$, the best known algorithm for the STR-IC-LCS problem, proposed by Deorowicz~({\\em Inf. Process. Lett.}, 11:423--426, 2012), runs in $O(MN)$ time. In this work, we present an $O(mN + nM)$-time soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.04954","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":"1703.04954","created_at":"2026-05-18T00:48:38.745074+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.04954v1","created_at":"2026-05-18T00:48:38.745074+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.04954","created_at":"2026-05-18T00:48:38.745074+00:00"},{"alias_kind":"pith_short_12","alias_value":"TZCCWEMSMJS3","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_16","alias_value":"TZCCWEMSMJS3WOHM","created_at":"2026-05-18T12:31:46.661854+00:00"},{"alias_kind":"pith_short_8","alias_value":"TZCCWEMS","created_at":"2026-05-18T12:31:46.661854+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/TZCCWEMSMJS3WOHMLNXUPZX7V6","json":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6.json","graph_json":"https://pith.science/api/pith-number/TZCCWEMSMJS3WOHMLNXUPZX7V6/graph.json","events_json":"https://pith.science/api/pith-number/TZCCWEMSMJS3WOHMLNXUPZX7V6/events.json","paper":"https://pith.science/paper/TZCCWEMS"},"agent_actions":{"view_html":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6","download_json":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6.json","view_paper":"https://pith.science/paper/TZCCWEMS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.04954&json=true","fetch_graph":"https://pith.science/api/pith-number/TZCCWEMSMJS3WOHMLNXUPZX7V6/graph.json","fetch_events":"https://pith.science/api/pith-number/TZCCWEMSMJS3WOHMLNXUPZX7V6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6/action/storage_attestation","attest_author":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6/action/author_attestation","sign_citation":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6/action/citation_signature","submit_replication":"https://pith.science/pith/TZCCWEMSMJS3WOHMLNXUPZX7V6/action/replication_record"}},"created_at":"2026-05-18T00:48:38.745074+00:00","updated_at":"2026-05-18T00:48:38.745074+00:00"}