{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:U6ZQQUSXFERU7PS7QWW576R5HW","short_pith_number":"pith:U6ZQQUSX","schema_version":"1.0","canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","source":{"kind":"arxiv","id":"1804.08731","version":2},"attestation_state":"computed","paper":{"title":"Longest Common Substring Made Fully Dynamic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Jakub Radoszewski, Panagiotis Charalampopoulos, Solon P. Pissis","submitted_at":"2018-04-23T20:40:40Z","abstract_excerpt":"In the longest common substring (LCS) problem, we are given two strings $S$ and $T$, each of length at most $n$, and we are asked to find a longest string occurring as a fragment of both $S$ and $T$. This is a classical and well-studied problem in computer science with a known $\\mathcal{O}(n)$-time solution. In the fully dynamic version of the problem, edit operations are allowed in either of the two strings, and we are asked to report an LCS after each such operation. We present the first solution to this problem that requires sublinear time per edit operation. In particular, we show how to r"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1804.08731","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T20:40:40Z","cross_cats_sorted":[],"title_canon_sha256":"f52d9c1adca0f361ce4f3728b91d038fe5e37e83f9e5b6caf13495f5fbdb6a21","abstract_canon_sha256":"46c709493155972c3f205243044d46b56c5d654485e8daac77f92882a8fdca0e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:44.618400Z","signature_b64":"Lt36ckVAasyp1MBisKxh+hRd5OLTTxx7xildFgGgQmM6zyyyLH6uousSpmcI3v+BIBzDmGBVFVt5wnqacMmBCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","last_reissued_at":"2026-05-18T00:10:44.617997Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:44.617997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Longest Common Substring Made Fully Dynamic","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Amihood Amir, Jakub Radoszewski, Panagiotis Charalampopoulos, Solon P. Pissis","submitted_at":"2018-04-23T20:40:40Z","abstract_excerpt":"In the longest common substring (LCS) problem, we are given two strings $S$ and $T$, each of length at most $n$, and we are asked to find a longest string occurring as a fragment of both $S$ and $T$. This is a classical and well-studied problem in computer science with a known $\\mathcal{O}(n)$-time solution. In the fully dynamic version of the problem, edit operations are allowed in either of the two strings, and we are asked to report an LCS after each such operation. We present the first solution to this problem that requires sublinear time per edit operation. In particular, we show how to r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08731","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.08731","created_at":"2026-05-18T00:10:44.618051+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.08731v2","created_at":"2026-05-18T00:10:44.618051+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08731","created_at":"2026-05-18T00:10:44.618051+00:00"},{"alias_kind":"pith_short_12","alias_value":"U6ZQQUSXFERU","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"U6ZQQUSXFERU7PS7","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"U6ZQQUSX","created_at":"2026-05-18T12:32:56.356000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1906.09732","citing_title":"Dynamic Palindrome Detection","ref_index":3,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW","json":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW.json","graph_json":"https://pith.science/api/pith-number/U6ZQQUSXFERU7PS7QWW576R5HW/graph.json","events_json":"https://pith.science/api/pith-number/U6ZQQUSXFERU7PS7QWW576R5HW/events.json","paper":"https://pith.science/paper/U6ZQQUSX"},"agent_actions":{"view_html":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW","download_json":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW.json","view_paper":"https://pith.science/paper/U6ZQQUSX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.08731&json=true","fetch_graph":"https://pith.science/api/pith-number/U6ZQQUSXFERU7PS7QWW576R5HW/graph.json","fetch_events":"https://pith.science/api/pith-number/U6ZQQUSXFERU7PS7QWW576R5HW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/action/storage_attestation","attest_author":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/action/author_attestation","sign_citation":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/action/citation_signature","submit_replication":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/action/replication_record"}},"created_at":"2026-05-18T00:10:44.618051+00:00","updated_at":"2026-05-18T00:10:44.618051+00:00"}