{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC","short_pith_number":"pith:QXIDBM5S","canonical_record":{"source":{"id":"1311.4552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662","abstract_canon_sha256":"91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c"},"schema_version":"1.0"},"canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","source":{"kind":"arxiv","id":"1311.4552","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4552","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4552v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4552","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"QXIDBM5S3J2M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXIDBM5S3J2MALSH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXIDBM5S","created_at":"2026-05-18T12:27:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4552","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","cross_cats_sorted":[],"title_canon_sha256":"c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662","abstract_canon_sha256":"91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c"},"schema_version":"1.0"},"canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:43.989912Z","signature_b64":"4jelHfbGn1zG/aLjyCeVpoZbYY2McRZ0msp3RRu/9kPrNzj/BhE+px0mmNo7pvcJ1h2B/rLQnQjx7wMAxRAUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","last_reissued_at":"2026-05-18T03:06:43.989407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:43.989407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4552","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vQ2+xHcJwwO5Sslxbrj3zENUK71YS3l7xoUoSAd8GrHvSAdAalvGOgcvdDqJQjMIN0Dq6fTeYufRP88IkAEWBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:39.198378Z"},"content_sha256":"8c0f9e41bb220451313e6a99c26de46b402ce8ba4ae0b056004e5b780befb2e7","schema_version":"1.0","event_id":"sha256:8c0f9e41bb220451313e6a99c26de46b402ce8ba4ae0b056004e5b780befb2e7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient algorithms for the 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":"Sebastian Deorowicz, Szymon Grabowski","submitted_at":"2013-11-18T21:02:38Z","abstract_excerpt":"Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols from two sequences $A$ and $B$ are replaced with matching non-overlapping substrings of length $k$ from $A$ and $B$. We propose several algorithms for LCS$k$, being non-trivial incarnations of the major concepts known from LCS research (dynamic programming, sparse dynamic programming, tabulation). Our algorithms make use of a linear-time and linear-space preprocessing finding "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4552","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-18T03:06:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JSAImm3EGw7Kkp+EtQambGyi6ZD9g2Gj61AwJnWbE7w6t0tdmuKksr+zxFplZgoORolhQU6nsH5vcIuxQZZZBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:15:39.198941Z"},"content_sha256":"c716c63c58e4e93c8438c56c422b876cd65b40c880dca579dd2a4af265bcf1fd","schema_version":"1.0","event_id":"sha256:c716c63c58e4e93c8438c56c422b876cd65b40c880dca579dd2a4af265bcf1fd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/bundle.json","state_url":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/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-09T14:15:39Z","links":{"resolver":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC","bundle":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/bundle.json","state":"https://pith.science/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QXIDBM5S3J2MALSHUWRU3TIJMC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:QXIDBM5S3J2MALSHUWRU3TIJMC","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":"91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","title_canon_sha256":"c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662"},"schema_version":"1.0","source":{"id":"1311.4552","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4552","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4552v1","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4552","created_at":"2026-05-18T03:06:43Z"},{"alias_kind":"pith_short_12","alias_value":"QXIDBM5S3J2M","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_16","alias_value":"QXIDBM5S3J2MALSH","created_at":"2026-05-18T12:27:57Z"},{"alias_kind":"pith_short_8","alias_value":"QXIDBM5S","created_at":"2026-05-18T12:27:57Z"}],"graph_snapshots":[{"event_id":"sha256:c716c63c58e4e93c8438c56c422b876cd65b40c880dca579dd2a4af265bcf1fd","target":"graph","created_at":"2026-05-18T03:06:43Z","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":"Finding the longest common subsequence in $k$-length substrings (LCS$k$) is a recently proposed problem motivated by computational biology. This is a generalization of the well-known LCS problem in which matching symbols from two sequences $A$ and $B$ are replaced with matching non-overlapping substrings of length $k$ from $A$ and $B$. We propose several algorithms for LCS$k$, being non-trivial incarnations of the major concepts known from LCS research (dynamic programming, sparse dynamic programming, tabulation). Our algorithms make use of a linear-time and linear-space preprocessing finding ","authors_text":"Sebastian Deorowicz, Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","title":"Efficient algorithms for the longest common subsequence in $k$-length substrings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4552","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:8c0f9e41bb220451313e6a99c26de46b402ce8ba4ae0b056004e5b780befb2e7","target":"record","created_at":"2026-05-18T03:06:43Z","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":"91d335bb3620fdde8c2fbd716d77061b0723ec1d7db3387f0d5f603e9819a69c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-18T21:02:38Z","title_canon_sha256":"c00bff187f8d740b9711f51872c676f6faf91eb00a9d41e7c524caad9056d662"},"schema_version":"1.0","source":{"id":"1311.4552","kind":"arxiv","version":1}},"canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85d030b3b2da74c02e47a5a34dcd09608968fa9c7ebd8bd4c3a019dfc1980c89","first_computed_at":"2026-05-18T03:06:43.989407Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:43.989407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4jelHfbGn1zG/aLjyCeVpoZbYY2McRZ0msp3RRu/9kPrNzj/BhE+px0mmNo7pvcJ1h2B/rLQnQjx7wMAxRAUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:43.989912Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4552","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c0f9e41bb220451313e6a99c26de46b402ce8ba4ae0b056004e5b780befb2e7","sha256:c716c63c58e4e93c8438c56c422b876cd65b40c880dca579dd2a4af265bcf1fd"],"state_sha256":"a893c56e424d91885db8bd5512388ea1f564b87da50a7ce349c5375ea9b4b736"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i0hEpU+uPo1VL0qivHcF3IHm5bHaxyTaDYX6a1XlgTw3JFAx+4KhWQ9hyFxX2SUBuS9o3ykSISB8LZJCfheqCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:15:39.202090Z","bundle_sha256":"41a5a089f8fbff28226eddf1e59fe385cf1e73067d9815739f4123ed525f2940"}}