{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:RF2LEI3EPUZMZSWWHR5TAZNV2R","short_pith_number":"pith:RF2LEI3E","schema_version":"1.0","canonical_sha256":"8974b223647d32cccad63c7b3065b5d464057082eeacd3b3599f822abb6a88c4","source":{"kind":"arxiv","id":"1403.1364","version":3},"attestation_state":"computed","paper":{"title":"A Suffix Tree Or Not A Suffix Tree?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Tatiana Starikovskaya","submitted_at":"2014-03-06T07:24:14Z","abstract_excerpt":"In this paper we study the structure of suffix trees. Given an unlabeled tree $\\tau$ on $n$ nodes and suffix links of its internal nodes, we ask the question \"Is $\\tau$ a suffix tree?\", i.e., is there a string $S$ whose suffix tree has the same topological structure as $\\tau$? We place no restrictions on $S$, in particular we do not require that $S$ ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees ar"},"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":"1403.1364","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-03-06T07:24:14Z","cross_cats_sorted":[],"title_canon_sha256":"c7819d6f0505f601b047d119865e2c4b437b38ebe0fd2546984c9d133c3a2e1b","abstract_canon_sha256":"6a100aee325c42289728050330c6ef162f8078d5fda94464e69b286ebba6fea1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:54.066603Z","signature_b64":"cd1K2igEtsIdmBC8HKkH+ES+YY9WZuXS20tErB4QeYBEviSbYkkKD76LRbHXlTbmLl4JlaPt35ZaSpj4F+I3Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8974b223647d32cccad63c7b3065b5d464057082eeacd3b3599f822abb6a88c4","last_reissued_at":"2026-05-18T02:43:54.066161Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:54.066161Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Suffix Tree Or Not A Suffix Tree?","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Hjalte Wedel Vildh{\\o}j, Tatiana Starikovskaya","submitted_at":"2014-03-06T07:24:14Z","abstract_excerpt":"In this paper we study the structure of suffix trees. Given an unlabeled tree $\\tau$ on $n$ nodes and suffix links of its internal nodes, we ask the question \"Is $\\tau$ a suffix tree?\", i.e., is there a string $S$ whose suffix tree has the same topological structure as $\\tau$? We place no restrictions on $S$, in particular we do not require that $S$ ends with a unique symbol. This corresponds to considering the more general definition of implicit or extended suffix trees. Such general suffix trees have many applications and are for example needed to allow efficient updates when suffix trees ar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1364","kind":"arxiv","version":3},"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":"1403.1364","created_at":"2026-05-18T02:43:54.066223+00:00"},{"alias_kind":"arxiv_version","alias_value":"1403.1364v3","created_at":"2026-05-18T02:43:54.066223+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1364","created_at":"2026-05-18T02:43:54.066223+00:00"},{"alias_kind":"pith_short_12","alias_value":"RF2LEI3EPUZM","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_16","alias_value":"RF2LEI3EPUZMZSWW","created_at":"2026-05-18T12:28:46.137349+00:00"},{"alias_kind":"pith_short_8","alias_value":"RF2LEI3E","created_at":"2026-05-18T12:28:46.137349+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R","json":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R.json","graph_json":"https://pith.science/api/pith-number/RF2LEI3EPUZMZSWWHR5TAZNV2R/graph.json","events_json":"https://pith.science/api/pith-number/RF2LEI3EPUZMZSWWHR5TAZNV2R/events.json","paper":"https://pith.science/paper/RF2LEI3E"},"agent_actions":{"view_html":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R","download_json":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R.json","view_paper":"https://pith.science/paper/RF2LEI3E","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1403.1364&json=true","fetch_graph":"https://pith.science/api/pith-number/RF2LEI3EPUZMZSWWHR5TAZNV2R/graph.json","fetch_events":"https://pith.science/api/pith-number/RF2LEI3EPUZMZSWWHR5TAZNV2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R/action/storage_attestation","attest_author":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R/action/author_attestation","sign_citation":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R/action/citation_signature","submit_replication":"https://pith.science/pith/RF2LEI3EPUZMZSWWHR5TAZNV2R/action/replication_record"}},"created_at":"2026-05-18T02:43:54.066223+00:00","updated_at":"2026-05-18T02:43:54.066223+00:00"}