{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG","short_pith_number":"pith:F6WHY6PW","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"},"canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","source":{"kind":"arxiv","id":"1508.05553","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05553","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05553v1","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05553","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"F6WHY6PWAH4N","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6WHY6PWAH4NT2XY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6WHY6PW","created_at":"2026-05-18T12:29:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG","target":"record","payload":{"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"},"canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","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"},"source_kind":"arxiv","source_id":"1508.05553","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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FJJax1DNhOwj60B9clM/o5so2IeICO9DH2OnhmzqsUOsJ+aWpVvvWhsBkwnZyTTSEZEM6DNP5ls/drI4TNunBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:45:45.699052Z"},"content_sha256":"2d5aaeba1a6ec1451604c31a82cdaa3d2a9fd40fde347b3d731cf2f303154d64","schema_version":"1.0","event_id":"sha256:2d5aaeba1a6ec1451604c31a82cdaa3d2a9fd40fde347b3d731cf2f303154d64"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG","target":"graph","payload":{"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"},"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:34:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1U4RBFj31Qd4vDga55FvV8AXu7JJyb8C3By+6WDS6z6p3wwsn/71kP41OhGXVozIqwnkv435Lp4/gZcf2EJlBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:45:45.699776Z"},"content_sha256":"ff7624436a434f565c459aa4ad323a4d692ae13354fb6791fc90b745ca54182e","schema_version":"1.0","event_id":"sha256:ff7624436a434f565c459aa4ad323a4d692ae13354fb6791fc90b745ca54182e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/bundle.json","state_url":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/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-06T22:45:45Z","links":{"resolver":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG","bundle":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/bundle.json","state":"https://pith.science/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F6WHY6PWAH4NT2XYM5DAJU4SZG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:F6WHY6PWAH4NT2XYM5DAJU4SZG","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":"9581ce2cdfadc8fdb030e97a1562aefcc740b0370a06b1a1c3535ff7e8e5a9b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T00:56:03Z","title_canon_sha256":"b28943b70ea2f1849d92c0aedd324eb4d316db74c14c8aefd154a2ea976a60dd"},"schema_version":"1.0","source":{"id":"1508.05553","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1508.05553","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"arxiv_version","alias_value":"1508.05553v1","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.05553","created_at":"2026-05-18T01:34:52Z"},{"alias_kind":"pith_short_12","alias_value":"F6WHY6PWAH4N","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_16","alias_value":"F6WHY6PWAH4NT2XY","created_at":"2026-05-18T12:29:19Z"},{"alias_kind":"pith_short_8","alias_value":"F6WHY6PW","created_at":"2026-05-18T12:29:19Z"}],"graph_snapshots":[{"event_id":"sha256:ff7624436a434f565c459aa4ad323a4d692ae13354fb6791fc90b745ca54182e","target":"graph","created_at":"2026-05-18T01:34:52Z","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 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 ","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-08-23T00:56:03Z","title":"A Practical O(R\\log\\log n+n) time Algorithm for Computing the Longest Common Subsequence"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.05553","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:2d5aaeba1a6ec1451604c31a82cdaa3d2a9fd40fde347b3d731cf2f303154d64","target":"record","created_at":"2026-05-18T01:34:52Z","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":"9581ce2cdfadc8fdb030e97a1562aefcc740b0370a06b1a1c3535ff7e8e5a9b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-08-23T00:56:03Z","title_canon_sha256":"b28943b70ea2f1849d92c0aedd324eb4d316db74c14c8aefd154a2ea976a60dd"},"schema_version":"1.0","source":{"id":"1508.05553","kind":"arxiv","version":1}},"canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2fac7c79f601f8d9eaf8674604d392c990ce8d5532774ffe3a0c454431cb3455","first_computed_at":"2026-05-18T01:34:52.219652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:34:52.219652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4C6IuFTq5P+5xifVkXXb3HoeKW/yLQikFuyBcdCBjBN+Dm5+cC18XXOSkcKmW7SePsnOBDzJueATS6fzlJruAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:34:52.220345Z","signed_message":"canonical_sha256_bytes"},"source_id":"1508.05553","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2d5aaeba1a6ec1451604c31a82cdaa3d2a9fd40fde347b3d731cf2f303154d64","sha256:ff7624436a434f565c459aa4ad323a4d692ae13354fb6791fc90b745ca54182e"],"state_sha256":"aa7fe0d6224a6caddabef7b8a151bc0f21a1896408d4abd0b48cc47c8fff485b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RtZcrSxn5YKTkx1aVsZMhdj+oNzn6RPabtkG92S4rDYxgxIa7lLleeWsM0CXA3iJj2ucxPHmSOiqsHqhDfhEDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:45:45.703451Z","bundle_sha256":"b0592ae22145fd05138e05ccffdb6ffa70ee8ed406a654cea1d2b663dbe7b02c"}}