{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:CADVWJWGD6RSE6WHBI3FBQ2LZZ","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":"9ba3cefa93f3c41c42329a4a14b1f3b3aa32213172f06420e188bc46b9de2ea1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T10:06:13Z","title_canon_sha256":"11c8127247033d5ae8d75b2d53afb1ad2f2d273960c4c09725a0ba613349529d"},"schema_version":"1.0","source":{"id":"1312.2738","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2738","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2738v3","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2738","created_at":"2026-05-18T03:02:33Z"},{"alias_kind":"pith_short_12","alias_value":"CADVWJWGD6RS","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"CADVWJWGD6RSE6WH","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"CADVWJWG","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:7ec6a7176b4d0afc4fb204e953e8870178c7da332ed74d782dbb3cb5c4f59e6a","target":"graph","created_at":"2026-05-18T03:02:33Z","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":"We revisit the problem of finding shortest unique substring (SUS) proposed recently by [6]. We propose an optimal $O(n)$ time and space algorithm that can find an SUS for every location of a string of size $n$. Our algorithm significantly improves the $O(n^2)$ time complexity needed by [6]. We also support finding all the SUSes covering every location, whereas the solution in [6] can find only one SUS for every location. Further, our solution is simpler and easier to implement and can also be more space efficient in practice, since we only use the inverse suffix array and longest common prefix","authors_text":"Atalay Mert \\.Ileri, Bojian Xu, M. O\\u{g}uzhan K\\\"ulekci","cross_cats":["cs.DB"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T10:06:13Z","title":"Shortest Unique Substring Query Revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2738","kind":"arxiv","version":3},"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:13e13bb41eabceca3070bfe653fee3a3e7ddf5a8cf94bc2392b1692cb19f4428","target":"record","created_at":"2026-05-18T03:02:33Z","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":"9ba3cefa93f3c41c42329a4a14b1f3b3aa32213172f06420e188bc46b9de2ea1","cross_cats_sorted":["cs.DB"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-12-10T10:06:13Z","title_canon_sha256":"11c8127247033d5ae8d75b2d53afb1ad2f2d273960c4c09725a0ba613349529d"},"schema_version":"1.0","source":{"id":"1312.2738","kind":"arxiv","version":3}},"canonical_sha256":"10075b26c61fa3227ac70a3650c34bce640b2db3b86c7ae3b0295e2fe2340c40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10075b26c61fa3227ac70a3650c34bce640b2db3b86c7ae3b0295e2fe2340c40","first_computed_at":"2026-05-18T03:02:33.937524Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:02:33.937524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0VD9ngDRyKpDLgQYrHA/MTlT4PnhzZhhfAZdzEDVKqHfi3PfUYtFKAG4/moC4yUkyLurDTgDWpav/tZYTFYrBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:02:33.938296Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2738","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:13e13bb41eabceca3070bfe653fee3a3e7ddf5a8cf94bc2392b1692cb19f4428","sha256:7ec6a7176b4d0afc4fb204e953e8870178c7da332ed74d782dbb3cb5c4f59e6a"],"state_sha256":"e883237c3b40441a9672e4f9d8edd7f77d53c071f28f62c8f79ae74cbb8a33aa"}