{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YYTHMKBHCJA3BDYQSCGDJ7UL7F","short_pith_number":"pith:YYTHMKBH","canonical_record":{"source":{"id":"1802.06369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"67e0ba8560a84d0c626c2dd76fb85c9d0634efc4846f1ae1ddc01149afd4b671","abstract_canon_sha256":"d2179a2feb10d9db0f7767f132445a590156a46ea9f8c6dbef2ced9eb03b4e81"},"schema_version":"1.0"},"canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","source":{"kind":"arxiv","id":"1802.06369","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06369","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06369v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06369","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"YYTHMKBHCJA3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YYTHMKBHCJA3BDYQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YYTHMKBH","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YYTHMKBHCJA3BDYQSCGDJ7UL7F","target":"record","payload":{"canonical_record":{"source":{"id":"1802.06369","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","cross_cats_sorted":[],"title_canon_sha256":"67e0ba8560a84d0c626c2dd76fb85c9d0634efc4846f1ae1ddc01149afd4b671","abstract_canon_sha256":"d2179a2feb10d9db0f7767f132445a590156a46ea9f8c6dbef2ced9eb03b4e81"},"schema_version":"1.0"},"canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:03.450765Z","signature_b64":"iyLD3+cCZukO3LxNhbUNXhIpRoX7O3WPEszBQbThjlxz3l4lJi8c37rG3DWvX9RjnG9AEykVVtOfgUP53D5kAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","last_reissued_at":"2026-05-18T00:23:03.450261Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:03.450261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.06369","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aRtuqpKJzdu1MLaVIGZzmkLuNMrElN3pKNCJHeoRQ1dCl/u9fferO08xNF6ULuL+XOKWq33hQGbjof1f6j1wCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:11.623122Z"},"content_sha256":"aea7b5cc5b8a200a3d6bd09c0469bc1f4323d06cea0f8e3cd3321324c999e628","schema_version":"1.0","event_id":"sha256:aea7b5cc5b8a200a3d6bd09c0469bc1f4323d06cea0f8e3cd3321324c999e628"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YYTHMKBHCJA3BDYQSCGDJ7UL7F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Linear-Time Algorithm for Long LCF with $k$ Mismatches","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Panagiotis Charalampopoulos, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","submitted_at":"2018-02-18T13:04:21Z","abstract_excerpt":"In the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their Hamming distance is at most $k$. Thankachan et al. show that this problem can be solved in $\\mathcal{O}(n \\log^k n)$ time and $\\mathcal{O}(n)$ space for constant $k$. We consider the LCF$_k$($\\ell$) problem in which we assume that the sought factors have length at least $\\ell$, and the LCF$_k$($\\ell$) problem for $\\ell=\\Omega(\\log^{2k+2} n)$, which we call the Lon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06369","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-18T00:23:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x1tpQPF0NtHdvpkCFkzl6AhJJP8ytarCZ72o7xGonISjFLKcGK8GpWZkbMZKSx8xQnwdOSkq3ZggKY5eP7usAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T08:38:11.623894Z"},"content_sha256":"d4d7157ad56f1ee78888ceaa1603692108c40f186b2a6d622ec504f62b1bb68e","schema_version":"1.0","event_id":"sha256:d4d7157ad56f1ee78888ceaa1603692108c40f186b2a6d622ec504f62b1bb68e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/bundle.json","state_url":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/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-30T08:38:11Z","links":{"resolver":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F","bundle":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/bundle.json","state":"https://pith.science/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YYTHMKBHCJA3BDYQSCGDJ7UL7F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YYTHMKBHCJA3BDYQSCGDJ7UL7F","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":"d2179a2feb10d9db0f7767f132445a590156a46ea9f8c6dbef2ced9eb03b4e81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","title_canon_sha256":"67e0ba8560a84d0c626c2dd76fb85c9d0634efc4846f1ae1ddc01149afd4b671"},"schema_version":"1.0","source":{"id":"1802.06369","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.06369","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"arxiv_version","alias_value":"1802.06369v1","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.06369","created_at":"2026-05-18T00:23:03Z"},{"alias_kind":"pith_short_12","alias_value":"YYTHMKBHCJA3","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YYTHMKBHCJA3BDYQ","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YYTHMKBH","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:d4d7157ad56f1ee78888ceaa1603692108c40f186b2a6d622ec504f62b1bb68e","target":"graph","created_at":"2026-05-18T00:23:03Z","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 the Longest Common Factor with $k$ Mismatches (LCF$_k$) problem, we are given two strings $X$ and $Y$ of total length $n$, and we are asked to find a pair of maximal-length factors, one of $X$ and the other of $Y$, such that their Hamming distance is at most $k$. Thankachan et al. show that this problem can be solved in $\\mathcal{O}(n \\log^k n)$ time and $\\mathcal{O}(n)$ space for constant $k$. We consider the LCF$_k$($\\ell$) problem in which we assume that the sought factors have length at least $\\ell$, and the LCF$_k$($\\ell$) problem for $\\ell=\\Omega(\\log^{2k+2} n)$, which we call the Lon","authors_text":"Costas S. Iliopoulos, Jakub Radoszewski, Maxime Crochemore, Panagiotis Charalampopoulos, Solon P. Pissis, Tomasz Kociumaka, Tomasz Wale\\'n, Wojciech Rytter","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","title":"Linear-Time Algorithm for Long LCF with $k$ Mismatches"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.06369","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:aea7b5cc5b8a200a3d6bd09c0469bc1f4323d06cea0f8e3cd3321324c999e628","target":"record","created_at":"2026-05-18T00:23:03Z","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":"d2179a2feb10d9db0f7767f132445a590156a46ea9f8c6dbef2ced9eb03b4e81","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2018-02-18T13:04:21Z","title_canon_sha256":"67e0ba8560a84d0c626c2dd76fb85c9d0634efc4846f1ae1ddc01149afd4b671"},"schema_version":"1.0","source":{"id":"1802.06369","kind":"arxiv","version":1}},"canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6267628271241b08f10908c34fe8bf97f239bc19cb02ac96d3951f2db3191ee","first_computed_at":"2026-05-18T00:23:03.450261Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:03.450261Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"iyLD3+cCZukO3LxNhbUNXhIpRoX7O3WPEszBQbThjlxz3l4lJi8c37rG3DWvX9RjnG9AEykVVtOfgUP53D5kAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:03.450765Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.06369","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aea7b5cc5b8a200a3d6bd09c0469bc1f4323d06cea0f8e3cd3321324c999e628","sha256:d4d7157ad56f1ee78888ceaa1603692108c40f186b2a6d622ec504f62b1bb68e"],"state_sha256":"ca5e7fa74ed7eb3f55fa82e9cb41333a241e9fad39af871bd51c539b3f03820f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hUo9u6fC/RwrYhP9sYAvh7beNNBKmpn3d2PKMDc0tBRgpgr9wnoVlFdcLAeTXcD/uXDN9vIlw1WL1qgxaPu2Bw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T08:38:11.627422Z","bundle_sha256":"72a1b9c62d24da8247a273a40683b730687c48062b740e535d84c6d9a4056166"}}