{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NXB3FSJCOECEJ5TBUVQWDQC6L3","short_pith_number":"pith:NXB3FSJC","canonical_record":{"source":{"id":"1402.2097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T10:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"feae5df9d25aaf55bc7aa15423780a4edd65c809cbec810cab92b560b5c28541","abstract_canon_sha256":"e1e3fc6a9fa0b17c367ffbf2606e93c7efc18fc48490cd0128e4af42df4c8dbc"},"schema_version":"1.0"},"canonical_sha256":"6dc3b2c922710444f661a56161c05e5ecfeeb3dbb069d39884a045a65a75c604","source":{"kind":"arxiv","id":"1402.2097","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2097","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2097v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2097","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"NXB3FSJCOECE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXB3FSJCOECEJ5TB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXB3FSJC","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NXB3FSJCOECEJ5TBUVQWDQC6L3","target":"record","payload":{"canonical_record":{"source":{"id":"1402.2097","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T10:54:52Z","cross_cats_sorted":[],"title_canon_sha256":"feae5df9d25aaf55bc7aa15423780a4edd65c809cbec810cab92b560b5c28541","abstract_canon_sha256":"e1e3fc6a9fa0b17c367ffbf2606e93c7efc18fc48490cd0128e4af42df4c8dbc"},"schema_version":"1.0"},"canonical_sha256":"6dc3b2c922710444f661a56161c05e5ecfeeb3dbb069d39884a045a65a75c604","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:32.331374Z","signature_b64":"NRS7TBtDshFXqfNC1Ohz9JddL0oK4kT5pITZLs6o7/yXJsfVrIHmTzk2sHkiQ46+1q3qNiZa9PCYRo/iYRkjDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6dc3b2c922710444f661a56161c05e5ecfeeb3dbb069d39884a045a65a75c604","last_reissued_at":"2026-05-18T02:59:32.330580Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:32.330580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1402.2097","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Sp/8xGKbAGFI/q9jFKDjmy3q7CxrTlX5p0UWi4QE2u4yOmMgBL3Rl0UvZuzK52reAqqX0jW6JFopo2vSPILYAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:44:40.686691Z"},"content_sha256":"7810162b3d63f753d3a9f19325490ddc3ad9c266d69f5ed6a09c0040b67e2715","schema_version":"1.0","event_id":"sha256:7810162b3d63f753d3a9f19325490ddc3ad9c266d69f5ed6a09c0040b67e2715"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NXB3FSJCOECEJ5TBUVQWDQC6L3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Longest Common Subsequence in k-length substrings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Avivit Levy, Gary Benson, Riva Shalom","submitted_at":"2014-02-10T10:54:52Z","abstract_excerpt":"In this paper we define a new problem, motivated by computational biology, $LCSk$ aiming at finding the maximal number of $k$ length $substrings$, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where $k = 1$. We provide an algorithm, solving the general case in $O(n^2)$ time, where $n$ is the length of the input strings, equaling the time required for the special case of $k=1$. The space requirement of the algorithm is $O(kn)$. %, however, in order to enable %backtracking of the solution, $O(n^2)$ spac"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2097","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-18T02:59:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"20qW1t5KLrV4K/JIS+H1dLN9VO6G3K3QQb52XTIwBq7VjuXEEU9ooZG16BypMnYRhjz0v/ExJE6UhSWYPFpICw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T16:44:40.687036Z"},"content_sha256":"5f3f7631da30ef333eb0ad059f96c1bc28ef37461d0d34921c34451effa0cfa8","schema_version":"1.0","event_id":"sha256:5f3f7631da30ef333eb0ad059f96c1bc28ef37461d0d34921c34451effa0cfa8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/bundle.json","state_url":"https://pith.science/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/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-05T16:44:40Z","links":{"resolver":"https://pith.science/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3","bundle":"https://pith.science/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/bundle.json","state":"https://pith.science/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXB3FSJCOECEJ5TBUVQWDQC6L3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NXB3FSJCOECEJ5TBUVQWDQC6L3","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":"e1e3fc6a9fa0b17c367ffbf2606e93c7efc18fc48490cd0128e4af42df4c8dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T10:54:52Z","title_canon_sha256":"feae5df9d25aaf55bc7aa15423780a4edd65c809cbec810cab92b560b5c28541"},"schema_version":"1.0","source":{"id":"1402.2097","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.2097","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"arxiv_version","alias_value":"1402.2097v1","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.2097","created_at":"2026-05-18T02:59:32Z"},{"alias_kind":"pith_short_12","alias_value":"NXB3FSJCOECE","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NXB3FSJCOECEJ5TB","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NXB3FSJC","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:5f3f7631da30ef333eb0ad059f96c1bc28ef37461d0d34921c34451effa0cfa8","target":"graph","created_at":"2026-05-18T02:59:32Z","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 define a new problem, motivated by computational biology, $LCSk$ aiming at finding the maximal number of $k$ length $substrings$, matching in both input strings while preserving their order of appearance. The traditional LCS definition is a special case of our problem, where $k = 1$. We provide an algorithm, solving the general case in $O(n^2)$ time, where $n$ is the length of the input strings, equaling the time required for the special case of $k=1$. The space requirement of the algorithm is $O(kn)$. %, however, in order to enable %backtracking of the solution, $O(n^2)$ spac","authors_text":"Avivit Levy, Gary Benson, Riva Shalom","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T10:54:52Z","title":"Longest Common Subsequence in k-length substrings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.2097","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:7810162b3d63f753d3a9f19325490ddc3ad9c266d69f5ed6a09c0040b67e2715","target":"record","created_at":"2026-05-18T02:59:32Z","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":"e1e3fc6a9fa0b17c367ffbf2606e93c7efc18fc48490cd0128e4af42df4c8dbc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-10T10:54:52Z","title_canon_sha256":"feae5df9d25aaf55bc7aa15423780a4edd65c809cbec810cab92b560b5c28541"},"schema_version":"1.0","source":{"id":"1402.2097","kind":"arxiv","version":1}},"canonical_sha256":"6dc3b2c922710444f661a56161c05e5ecfeeb3dbb069d39884a045a65a75c604","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6dc3b2c922710444f661a56161c05e5ecfeeb3dbb069d39884a045a65a75c604","first_computed_at":"2026-05-18T02:59:32.330580Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:59:32.330580Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NRS7TBtDshFXqfNC1Ohz9JddL0oK4kT5pITZLs6o7/yXJsfVrIHmTzk2sHkiQ46+1q3qNiZa9PCYRo/iYRkjDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:59:32.331374Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.2097","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:7810162b3d63f753d3a9f19325490ddc3ad9c266d69f5ed6a09c0040b67e2715","sha256:5f3f7631da30ef333eb0ad059f96c1bc28ef37461d0d34921c34451effa0cfa8"],"state_sha256":"76a8c1d599b4a558d6b832eb1769bc1a8541f0c858ab36ce9b1dd867c9c8620d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8E2hUgB2dKuyuHMqoosdqMavr0R1j7JT627YVIk75EpLeKghyK8v28qnmgy7bu/liA/zvgI9PxRWzBlFDeUWCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T16:44:40.689036Z","bundle_sha256":"0416f9999a2395ffcfdb664af0f6cfb927e60f594b8d1e683f607ed4f2d0ecc3"}}