{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:BS5Z5MXGT22CTP6S4NG3ZJZDQW","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":"2b733827060eb8cc619ba3efc10bcf994ec1170df708c76e87e6181ffbde5c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T08:36:07Z","title_canon_sha256":"a5734ce305d2eb4c5a8ce83b6d1cc2096876904f997f2fd01a522c858eea6154"},"schema_version":"1.0","source":{"id":"1305.1744","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1305.1744","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"arxiv_version","alias_value":"1305.1744v1","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.1744","created_at":"2026-05-18T03:26:11Z"},{"alias_kind":"pith_short_12","alias_value":"BS5Z5MXGT22C","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"BS5Z5MXGT22CTP6S","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"BS5Z5MXG","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:5fe8759df27440ff6fc57ee90d26312366773cdfb3449b19e078b87c53f55487","target":"graph","created_at":"2026-05-18T03:26:11Z","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 consider an index data structure for similar strings. The generalized suffix tree can be a solution for this. The generalized suffix tree of two strings $A$ and $B$ is a compacted trie representing all suffixes in $A$ and $B$. It has $|A|+|B|$ leaves and can be constructed in $O(|A|+|B|)$ time. However, if the two strings are similar, the generalized suffix tree is not efficient because it does not exploit the similarity which is usually represented as an alignment of $A$ and $B$.\n  In this paper we propose a space/time-efficient suffix tree of alignment which wisely exploits the similarity","authors_text":"Costas S. Iliopoulos, Heejin Park, Jan Holub, Joong Chae Na, Kunsoo Park, Laurent Mouchard, Maxime Crochemore","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T08:36:07Z","title":"Suffix Tree of Alignment: An Efficient Index for Similar Data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.1744","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:29de8d2590eefd1a338fe7fa710eba9f6bbffee41f7e4bec01430538cf6075e6","target":"record","created_at":"2026-05-18T03:26:11Z","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":"2b733827060eb8cc619ba3efc10bcf994ec1170df708c76e87e6181ffbde5c04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-08T08:36:07Z","title_canon_sha256":"a5734ce305d2eb4c5a8ce83b6d1cc2096876904f997f2fd01a522c858eea6154"},"schema_version":"1.0","source":{"id":"1305.1744","kind":"arxiv","version":1}},"canonical_sha256":"0cbb9eb2e69eb429bfd2e34dbca72385b83ecdc938f850a50b14b556feddf113","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0cbb9eb2e69eb429bfd2e34dbca72385b83ecdc938f850a50b14b556feddf113","first_computed_at":"2026-05-18T03:26:11.352591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:26:11.352591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"w3f3lXXkdjJapd9v1T03gBdVTEyyeqfMDRdQhCjDoVWvBROEGl0xHGRGaIl13qkIk+QoqAJWG1ByXPd+Uiq1AQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:26:11.353398Z","signed_message":"canonical_sha256_bytes"},"source_id":"1305.1744","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:29de8d2590eefd1a338fe7fa710eba9f6bbffee41f7e4bec01430538cf6075e6","sha256:5fe8759df27440ff6fc57ee90d26312366773cdfb3449b19e078b87c53f55487"],"state_sha256":"8abbcc5c0033cc76455ecdf48a68928e87e64ce62c47d45f89a1af87bcb5d335"}