{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:U6ZQQUSXFERU7PS7QWW576R5HW","short_pith_number":"pith:U6ZQQUSX","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"},"canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","source":{"kind":"arxiv","id":"1804.08731","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08731","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08731v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08731","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"U6ZQQUSXFERU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U6ZQQUSXFERU7PS7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U6ZQQUSX","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:U6ZQQUSXFERU7PS7QWW576R5HW","target":"record","payload":{"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"},"canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","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"},"source_kind":"arxiv","source_id":"1804.08731","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-18T00:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OTeTpIvkAGXpL8cTV8ld3bIPNo9w/O7y9m7xQH+3TLMY3vr/IbkwYoa/zxHOzYw2tOaTt1xVogXxMTuvA9P8Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:19:01.496521Z"},"content_sha256":"2eb21f62dcc15c223518c6673225c0224ed46deb37e7eef3330bf0125590cad5","schema_version":"1.0","event_id":"sha256:2eb21f62dcc15c223518c6673225c0224ed46deb37e7eef3330bf0125590cad5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:U6ZQQUSXFERU7PS7QWW576R5HW","target":"graph","payload":{"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"},"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:10:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sQO5+WAZitsaIrIV74o42ioCao6WEbcGv366nN6UvhnL7fKm2H7Hxi527GlV3TmfkH5tuTVIL4FO7HlkbDNrBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T03:19:01.497182Z"},"content_sha256":"38494ae01d0ef36da41c7775099535cab22cf46b27da376174660adae7aa5312","schema_version":"1.0","event_id":"sha256:38494ae01d0ef36da41c7775099535cab22cf46b27da376174660adae7aa5312"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/bundle.json","state_url":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U6ZQQUSXFERU7PS7QWW576R5HW/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-27T03:19:01Z","links":{"resolver":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW","bundle":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/bundle.json","state":"https://pith.science/pith/U6ZQQUSXFERU7PS7QWW576R5HW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U6ZQQUSXFERU7PS7QWW576R5HW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:U6ZQQUSXFERU7PS7QWW576R5HW","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":"46c709493155972c3f205243044d46b56c5d654485e8daac77f92882a8fdca0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T20:40:40Z","title_canon_sha256":"f52d9c1adca0f361ce4f3728b91d038fe5e37e83f9e5b6caf13495f5fbdb6a21"},"schema_version":"1.0","source":{"id":"1804.08731","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08731","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08731v2","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08731","created_at":"2026-05-18T00:10:44Z"},{"alias_kind":"pith_short_12","alias_value":"U6ZQQUSXFERU","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"U6ZQQUSXFERU7PS7","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"U6ZQQUSX","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:38494ae01d0ef36da41c7775099535cab22cf46b27da376174660adae7aa5312","target":"graph","created_at":"2026-05-18T00:10:44Z","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 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","authors_text":"Amihood Amir, Jakub Radoszewski, Panagiotis Charalampopoulos, Solon P. Pissis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T20:40:40Z","title":"Longest Common Substring Made Fully Dynamic"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08731","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:2eb21f62dcc15c223518c6673225c0224ed46deb37e7eef3330bf0125590cad5","target":"record","created_at":"2026-05-18T00:10:44Z","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":"46c709493155972c3f205243044d46b56c5d654485e8daac77f92882a8fdca0e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-23T20:40:40Z","title_canon_sha256":"f52d9c1adca0f361ce4f3728b91d038fe5e37e83f9e5b6caf13495f5fbdb6a21"},"schema_version":"1.0","source":{"id":"1804.08731","kind":"arxiv","version":2}},"canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7b308525729234fbe5f85addffa3d3db80413819ecfd692e36139886bd4e770","first_computed_at":"2026-05-18T00:10:44.617997Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:44.617997Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Lt36ckVAasyp1MBisKxh+hRd5OLTTxx7xildFgGgQmM6zyyyLH6uousSpmcI3v+BIBzDmGBVFVt5wnqacMmBCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:44.618400Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08731","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2eb21f62dcc15c223518c6673225c0224ed46deb37e7eef3330bf0125590cad5","sha256:38494ae01d0ef36da41c7775099535cab22cf46b27da376174660adae7aa5312"],"state_sha256":"fd25101837329c217cad6b9947a1bd59c6de37a3bd0449a9e5c19901ea2e4c44"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KlmZSJcqKpr56m29SwcIkrylTGo4zAafnrzb+xX/r8/uRB90iXTPdmOAhwartWso38a6F6qdk0yjQ/tUByakCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T03:19:01.500261Z","bundle_sha256":"7a26f202dea82214414c26e28ac039c38a2275d19a788e8a480667c1202ddbd4"}}