{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG","short_pith_number":"pith:F6WHY6PW","schema_version":"1.0","canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","source":{"kind":"arxiv","id":"1508.05553","version":1},"attestation_state":"computed","paper":{"title":"A Practical O(R\\log\\log n+n) time Algorithm for Computing the Longest Common Subsequence","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-08-23T00:56:03Z","abstract_excerpt":"In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new improved algorithms. We first reformulate the problem in a very succinct form. The problem LCS is abstracted to an abstract data type DS on an ordered positive integer set with a special operation Update(S,x). For the two input sequences X and Y of equal length n, the first improved algorithm uses a van Emde Boas tree for DS and its time and space complexities are O(R\\log\\log n+n) and O(R), where R is the number of "},"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":"1508.05553","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T00:56:03Z","cross_cats_sorted":[],"title_canon_sha256":"b28943b70ea2f1849d92c0aedd324eb4d316db74c14c8aefd154a2ea976a60dd","abstract_canon_sha256":"9581ce2cdfadc8fdb030e97a1562aefcc740b0370a06b1a1c3535ff7e8e5a9b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:52.220345Z","signature_b64":"4C6IuFTq5P+5xifVkXXb3HoeKW/yLQikFuyBcdCBjBN+Dm5+cC18XXOSkcKmW7SePsnOBDzJueATS6fzlJruAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","last_reissued_at":"2026-05-18T01:34:52.219652Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:52.219652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Practical O(R\\log\\log n+n) time Algorithm for Computing the Longest Common Subsequence","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-08-23T00:56:03Z","abstract_excerpt":"In this paper, we revisit the much studied LCS problem for two given sequences. Based on the algorithm of Iliopoulos and Rahman for solving the LCS problem, we have suggested 3 new improved algorithms. We first reformulate the problem in a very succinct form. The problem LCS is abstracted to an abstract data type DS on an ordered positive integer set with a special operation Update(S,x). For the two input sequences X and Y of equal length n, the first improved algorithm uses a van Emde Boas tree for DS and its time and space complexities are O(R\\log\\log n+n) and O(R), where R is the number of "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05553","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":"1508.05553","created_at":"2026-05-18T01:34:52.219756+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.05553v1","created_at":"2026-05-18T01:34:52.219756+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05553","created_at":"2026-05-18T01:34:52.219756+00:00"},{"alias_kind":"pith_short_12","alias_value":"F6WHY6PWAH4N","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_16","alias_value":"F6WHY6PWAH4NT2XY","created_at":"2026-05-18T12:29:19.899920+00:00"},{"alias_kind":"pith_short_8","alias_value":"F6WHY6PW","created_at":"2026-05-18T12:29:19.899920+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/F6WHY6PWAH4NT2XYM5DAJU4SZG","json":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG.json","graph_json":"https://pith.science/api/pith-number/F6WHY6PWAH4NT2XYM5DAJU4SZG/graph.json","events_json":"https://pith.science/api/pith-number/F6WHY6PWAH4NT2XYM5DAJU4SZG/events.json","paper":"https://pith.science/paper/F6WHY6PW"},"agent_actions":{"view_html":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG","download_json":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG.json","view_paper":"https://pith.science/paper/F6WHY6PW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.05553&json=true","fetch_graph":"https://pith.science/api/pith-number/F6WHY6PWAH4NT2XYM5DAJU4SZG/graph.json","fetch_events":"https://pith.science/api/pith-number/F6WHY6PWAH4NT2XYM5DAJU4SZG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/action/storage_attestation","attest_author":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/action/author_attestation","sign_citation":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/action/citation_signature","submit_replication":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/action/replication_record"}},"created_at":"2026-05-18T01:34:52.219756+00:00","updated_at":"2026-05-18T01:34:52.219756+00:00"}