{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:5IXUALZRGY5J46X7RPPV6KQ4LF","short_pith_number":"pith:5IXUALZR","canonical_record":{"source":{"id":"1409.7217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T11:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"6b987070e36e1a782a7cdd7ae05bc5d71f51660ba6851dcf7b8690f9ca49d0f2","abstract_canon_sha256":"d2da2d07d03b40d0b59ca536b9765b2cf2f9f614046b434d7cb55e471d463f12"},"schema_version":"1.0"},"canonical_sha256":"ea2f402f31363a9e7aff8bdf5f2a1c5944b3528c50a4ba42ae2bd83edf9aaf03","source":{"kind":"arxiv","id":"1409.7217","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7217","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7217v2","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7217","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"5IXUALZRGY5J","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IXUALZRGY5J46X7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IXUALZR","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:5IXUALZRGY5J46X7RPPV6KQ4LF","target":"record","payload":{"canonical_record":{"source":{"id":"1409.7217","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T11:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"6b987070e36e1a782a7cdd7ae05bc5d71f51660ba6851dcf7b8690f9ca49d0f2","abstract_canon_sha256":"d2da2d07d03b40d0b59ca536b9765b2cf2f9f614046b434d7cb55e471d463f12"},"schema_version":"1.0"},"canonical_sha256":"ea2f402f31363a9e7aff8bdf5f2a1c5944b3528c50a4ba42ae2bd83edf9aaf03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:40:09.816915Z","signature_b64":"S0LUEWfLm+18YBUSg0GpCoJEWhnVTvJQ6khXFhybKSFVwVCfzYZaLahAgMSMXcND+c8bLXy21DRUwqUYgAGaCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ea2f402f31363a9e7aff8bdf5f2a1c5944b3528c50a4ba42ae2bd83edf9aaf03","last_reissued_at":"2026-05-18T02:40:09.816476Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:40:09.816476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1409.7217","source_version":2,"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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2VZPNGEZldPw1rU4RNseAEZBt2RHOrfa/XV/EAlHmpEQmyT4uCCSJIPF58CereBTAgNZULaWFQF3oT/RTUr6DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:51:09.750765Z"},"content_sha256":"ccce143a08ec965110a2f9693fdc64cd6d4c8770226b76b2ae0d145c1cab569d","schema_version":"1.0","event_id":"sha256:ccce143a08ec965110a2f9693fdc64cd6d4c8770226b76b2ae0d145c1cab569d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:5IXUALZRGY5J46X7RPPV6KQ4LF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A note on the longest common substring with $k$-mismatches problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Szymon Grabowski","submitted_at":"2014-09-25T11:29:18Z","abstract_excerpt":"The recently introduced longest common substring with $k$-mismatches ($k$-LCF) problem is to find, given two sequences $S_1$ and $S_2$ of length $n$ each, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance between $A_1$ and $A_2$ is at most $k$. So far, the only subquadratic time result for this problem was known for $k = 1$~\\cite{FGKU2014}. We first present two output-dependent algorithms solving the $k$-LCF problem and show that for $k = O(\\log^{1-\\varepsilon} n)$, where $\\varepsilon > 0$, at least one of them works in subquadratic time, using $O(n)$ words o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7217","kind":"arxiv","version":2},"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:40:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jCwESpjNH7Pcvg/uhBJshSEP4NXR/pR4cDZpOtLAaKY9nFTUOVXErQTAAJT3Vf1unn11wHQ2AC/8+3cYzhK/AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T04:51:09.751112Z"},"content_sha256":"7413792753dc64af7b6cf850a8cf3dcad1d8399f7eb29e1c77345bc7eb996fd7","schema_version":"1.0","event_id":"sha256:7413792753dc64af7b6cf850a8cf3dcad1d8399f7eb29e1c77345bc7eb996fd7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/bundle.json","state_url":"https://pith.science/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/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-22T04:51:09Z","links":{"resolver":"https://pith.science/pith/5IXUALZRGY5J46X7RPPV6KQ4LF","bundle":"https://pith.science/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/bundle.json","state":"https://pith.science/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5IXUALZRGY5J46X7RPPV6KQ4LF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:5IXUALZRGY5J46X7RPPV6KQ4LF","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":"d2da2d07d03b40d0b59ca536b9765b2cf2f9f614046b434d7cb55e471d463f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T11:29:18Z","title_canon_sha256":"6b987070e36e1a782a7cdd7ae05bc5d71f51660ba6851dcf7b8690f9ca49d0f2"},"schema_version":"1.0","source":{"id":"1409.7217","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.7217","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"arxiv_version","alias_value":"1409.7217v2","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.7217","created_at":"2026-05-18T02:40:09Z"},{"alias_kind":"pith_short_12","alias_value":"5IXUALZRGY5J","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"5IXUALZRGY5J46X7","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"5IXUALZR","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:7413792753dc64af7b6cf850a8cf3dcad1d8399f7eb29e1c77345bc7eb996fd7","target":"graph","created_at":"2026-05-18T02:40:09Z","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":"The recently introduced longest common substring with $k$-mismatches ($k$-LCF) problem is to find, given two sequences $S_1$ and $S_2$ of length $n$ each, a longest substring $A_1$ of $S_1$ and $A_2$ of $S_2$ such that the Hamming distance between $A_1$ and $A_2$ is at most $k$. So far, the only subquadratic time result for this problem was known for $k = 1$~\\cite{FGKU2014}. We first present two output-dependent algorithms solving the $k$-LCF problem and show that for $k = O(\\log^{1-\\varepsilon} n)$, where $\\varepsilon > 0$, at least one of them works in subquadratic time, using $O(n)$ words o","authors_text":"Szymon Grabowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T11:29:18Z","title":"A note on the longest common substring with $k$-mismatches problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.7217","kind":"arxiv","version":2},"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:ccce143a08ec965110a2f9693fdc64cd6d4c8770226b76b2ae0d145c1cab569d","target":"record","created_at":"2026-05-18T02:40:09Z","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":"d2da2d07d03b40d0b59ca536b9765b2cf2f9f614046b434d7cb55e471d463f12","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-09-25T11:29:18Z","title_canon_sha256":"6b987070e36e1a782a7cdd7ae05bc5d71f51660ba6851dcf7b8690f9ca49d0f2"},"schema_version":"1.0","source":{"id":"1409.7217","kind":"arxiv","version":2}},"canonical_sha256":"ea2f402f31363a9e7aff8bdf5f2a1c5944b3528c50a4ba42ae2bd83edf9aaf03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ea2f402f31363a9e7aff8bdf5f2a1c5944b3528c50a4ba42ae2bd83edf9aaf03","first_computed_at":"2026-05-18T02:40:09.816476Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:40:09.816476Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S0LUEWfLm+18YBUSg0GpCoJEWhnVTvJQ6khXFhybKSFVwVCfzYZaLahAgMSMXcND+c8bLXy21DRUwqUYgAGaCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:40:09.816915Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.7217","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ccce143a08ec965110a2f9693fdc64cd6d4c8770226b76b2ae0d145c1cab569d","sha256:7413792753dc64af7b6cf850a8cf3dcad1d8399f7eb29e1c77345bc7eb996fd7"],"state_sha256":"40eca27393c4541eed854749982d11c71cc70e62600b77a98d10e0188ec89aab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lAF3dvAFm7x1ynNBIzu3D8PFMJdsqT29NF9AQj5Cn21vXOnpLmrwi8F4pSUQmV3aE2JZcfELOGzX+pgJspKQBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T04:51:09.753125Z","bundle_sha256":"b744a03bd3f47fbf6ef55bda5d18552bc4d539b21244bcf87c17f6adad274a6e"}}