{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:V45WBC2JCCTV5P7CH5DMTS5HUX","short_pith_number":"pith:V45WBC2J","canonical_record":{"source":{"id":"1705.07279","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"d64c8edb9effbb11ed82edbcaee53ce3ed215123f46914387f85401976697286","abstract_canon_sha256":"970a3763f7440101a93f2d7efc6f3675c532da68919664bfd1aa8aa53a95ec6a"},"schema_version":"1.0"},"canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","source":{"kind":"arxiv","id":"1705.07279","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07279","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07279v3","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07279","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"V45WBC2JCCTV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V45WBC2JCCTV5P7C","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V45WBC2J","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:V45WBC2JCCTV5P7CH5DMTS5HUX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.07279","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","cross_cats_sorted":[],"title_canon_sha256":"d64c8edb9effbb11ed82edbcaee53ce3ed215123f46914387f85401976697286","abstract_canon_sha256":"970a3763f7440101a93f2d7efc6f3675c532da68919664bfd1aa8aa53a95ec6a"},"schema_version":"1.0"},"canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:05.548779Z","signature_b64":"HqUHOM9XnRBiQ2aamhVXgLvTfhO4rKENE+33063jwBpxtcR+yzzE/2PDi0snsHSMpGnwE0oT/+ooDqYg4hK2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","last_reissued_at":"2026-05-18T00:15:05.548144Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:05.548144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.07279","source_version":3,"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-18T00:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PPxex2/z+ePWkXu1wzNX+P43AmJho2obv8Ri/BwgXwavR8MVOQErnjbAklkckw4DC0r94X8FGrR4lh5vd+kpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:17.511015Z"},"content_sha256":"b723aeb272b1715fba0f01409b058fc426acb322e4ec3c749723aa5fcdd53b8f","schema_version":"1.0","event_id":"sha256:b723aeb272b1715fba0f01409b058fc426acb322e4ec3c749723aa5fcdd53b8f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:V45WBC2JCCTV5P7CH5DMTS5HUX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Filip Paveti\\'c, Goran \\v{Z}u\\v{z}i\\'c, Gustav Matula, Ivan Katani\\'c, Mile \\v{S}iki\\'c","submitted_at":"2017-05-20T08:32:12Z","abstract_excerpt":"Longest Common Subsequence ($LCS$) deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a practical observation that considering single characters is often too simplistic. Therefore, recent works introduce the variants of $LCS$ based on shared substrings of length exactly or at least $k$ ($LCS_k$ and $LCS_{k+}$ respectively). The main drawback of the state-of-the-art algorithms for computing $LCS_k$ and $LCS_{k+}$ is that they work well only in a limited setting: they either solve the average case well w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07279","kind":"arxiv","version":3},"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-18T00:15:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0ui6Rw2Vrsvid5/cs4ixUUra8QFb3ZLZ1UG57U15smtUu0XVmuityYUm7E+DB7/HzucnXe6ajFHQgTAbGHaSAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T23:14:17.513432Z"},"content_sha256":"dbb8c08a266e61125e1c312130acc3be1e0edd65c8e9d30f8da85f6aa6623464","schema_version":"1.0","event_id":"sha256:dbb8c08a266e61125e1c312130acc3be1e0edd65c8e9d30f8da85f6aa6623464"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/bundle.json","state_url":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/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-05-30T23:14:17Z","links":{"resolver":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX","bundle":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/bundle.json","state":"https://pith.science/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/V45WBC2JCCTV5P7CH5DMTS5HUX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:V45WBC2JCCTV5P7CH5DMTS5HUX","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":"970a3763f7440101a93f2d7efc6f3675c532da68919664bfd1aa8aa53a95ec6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","title_canon_sha256":"d64c8edb9effbb11ed82edbcaee53ce3ed215123f46914387f85401976697286"},"schema_version":"1.0","source":{"id":"1705.07279","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.07279","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"arxiv_version","alias_value":"1705.07279v3","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.07279","created_at":"2026-05-18T00:15:05Z"},{"alias_kind":"pith_short_12","alias_value":"V45WBC2JCCTV","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"V45WBC2JCCTV5P7C","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"V45WBC2J","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:dbb8c08a266e61125e1c312130acc3be1e0edd65c8e9d30f8da85f6aa6623464","target":"graph","created_at":"2026-05-18T00:15:05Z","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":"Longest Common Subsequence ($LCS$) deals with the problem of measuring similarity of two strings. While this problem has been analyzed for decades, the recent interest stems from a practical observation that considering single characters is often too simplistic. Therefore, recent works introduce the variants of $LCS$ based on shared substrings of length exactly or at least $k$ ($LCS_k$ and $LCS_{k+}$ respectively). The main drawback of the state-of-the-art algorithms for computing $LCS_k$ and $LCS_{k+}$ is that they work well only in a limited setting: they either solve the average case well w","authors_text":"Filip Paveti\\'c, Goran \\v{Z}u\\v{z}i\\'c, Gustav Matula, Ivan Katani\\'c, Mile \\v{S}iki\\'c","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","title":"Fast and simple algorithms for computing both $LCS_{k}$ and $LCS_{k+}$"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.07279","kind":"arxiv","version":3},"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:b723aeb272b1715fba0f01409b058fc426acb322e4ec3c749723aa5fcdd53b8f","target":"record","created_at":"2026-05-18T00:15:05Z","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":"970a3763f7440101a93f2d7efc6f3675c532da68919664bfd1aa8aa53a95ec6a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-20T08:32:12Z","title_canon_sha256":"d64c8edb9effbb11ed82edbcaee53ce3ed215123f46914387f85401976697286"},"schema_version":"1.0","source":{"id":"1705.07279","kind":"arxiv","version":3}},"canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"af3b608b4910a75ebfe23f46c9cba7a5c393a1dc94471ef14dcf557df3bfd816","first_computed_at":"2026-05-18T00:15:05.548144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:05.548144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"HqUHOM9XnRBiQ2aamhVXgLvTfhO4rKENE+33063jwBpxtcR+yzzE/2PDi0snsHSMpGnwE0oT/+ooDqYg4hK2DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:05.548779Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.07279","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b723aeb272b1715fba0f01409b058fc426acb322e4ec3c749723aa5fcdd53b8f","sha256:dbb8c08a266e61125e1c312130acc3be1e0edd65c8e9d30f8da85f6aa6623464"],"state_sha256":"f4e33c434cbbe6958fc477e4e635244eaed437220aa80323371535eecccd314c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CsBmB8NafAlMqwynDZA5wG2NLUQwWwMDEN+erzqui6AibnIUbNQwtgm07gROyd1fQtg5XxSOE5IEMdKeUnxCAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T23:14:17.540172Z","bundle_sha256":"8068896e35de89dfbb094c1a011a97d81a4f4892dd2b3d026bc4e4aba363fbc3"}}