{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZIMQQ3EBHQY2NNUZFQW3X3VXA3","short_pith_number":"pith:ZIMQQ3EB","schema_version":"1.0","canonical_sha256":"ca19086c813c31a6b6992c2dbbeeb706ddf32e25ca49f6c6029a64fdedff1c40","source":{"kind":"arxiv","id":"1705.08640","version":1},"attestation_state":"computed","paper":{"title":"Representing the suffix tree with the CDAWG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial","submitted_at":"2017-05-24T07:42:36Z","abstract_excerpt":"Given a string $T$, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with $e_T$ arcs, taking overall $O(e_T+e_{{\\overline{T}}})$ words of space, where ${\\overline{T}}$ is the reverse of $T$, and supporting some key operations in time between $O(1)$ and $O(\\log{\\log{n}})$ in the worst case. This representation is especially appealing for highly repetitive strings, like collections of similar genomes or of version-controlled documents, in which $e_T$ grows sublinearly in the length of $T$ in practice. In this paper we augment such represen"},"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":"1705.08640","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-05-24T07:42:36Z","cross_cats_sorted":[],"title_canon_sha256":"57f17112b149e90d3f2e22fb83442f547bb383792e04c98040b6416aa4cc6087","abstract_canon_sha256":"8e1c61001f0902673107e885ed2b8dad27427b78873f08f4e6d0d62375596102"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:44.690884Z","signature_b64":"GE9SmydG0VNKfIywbu7gZSxixvWTIOI1gzSOgVby0u7DYOaL7UF64d7SazZmdknPuyisekw6jvSMvpUyNwOJDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca19086c813c31a6b6992c2dbbeeb706ddf32e25ca49f6c6029a64fdedff1c40","last_reissued_at":"2026-05-18T00:43:44.690297Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:44.690297Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Representing the suffix tree with the CDAWG","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Djamal Belazzougui, Fabio Cunial","submitted_at":"2017-05-24T07:42:36Z","abstract_excerpt":"Given a string $T$, it is known that its suffix tree can be represented using the compact directed acyclic word graph (CDAWG) with $e_T$ arcs, taking overall $O(e_T+e_{{\\overline{T}}})$ words of space, where ${\\overline{T}}$ is the reverse of $T$, and supporting some key operations in time between $O(1)$ and $O(\\log{\\log{n}})$ in the worst case. This representation is especially appealing for highly repetitive strings, like collections of similar genomes or of version-controlled documents, in which $e_T$ grows sublinearly in the length of $T$ in practice. In this paper we augment such represen"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.08640","kind":"arxiv","version":1},"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":"1705.08640","created_at":"2026-05-18T00:43:44.690389+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.08640v1","created_at":"2026-05-18T00:43:44.690389+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.08640","created_at":"2026-05-18T00:43:44.690389+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZIMQQ3EBHQY2","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZIMQQ3EBHQY2NNUZ","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZIMQQ3EB","created_at":"2026-05-18T12:31:59.375834+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/ZIMQQ3EBHQY2NNUZFQW3X3VXA3","json":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3.json","graph_json":"https://pith.science/api/pith-number/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/graph.json","events_json":"https://pith.science/api/pith-number/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/events.json","paper":"https://pith.science/paper/ZIMQQ3EB"},"agent_actions":{"view_html":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3","download_json":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3.json","view_paper":"https://pith.science/paper/ZIMQQ3EB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.08640&json=true","fetch_graph":"https://pith.science/api/pith-number/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/action/storage_attestation","attest_author":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/action/author_attestation","sign_citation":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/action/citation_signature","submit_replication":"https://pith.science/pith/ZIMQQ3EBHQY2NNUZFQW3X3VXA3/action/replication_record"}},"created_at":"2026-05-18T00:43:44.690389+00:00","updated_at":"2026-05-18T00:43:44.690389+00:00"}