{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2TRAZBSZEWLIYIB6UQBAXQU2EW","short_pith_number":"pith:2TRAZBSZ","schema_version":"1.0","canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","source":{"kind":"arxiv","id":"1012.4263","version":1},"attestation_state":"computed","paper":{"title":"Lightweight LCP-Array Construction in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enno Ohlebusch, Simon Gog","submitted_at":"2010-12-20T09:08:05Z","abstract_excerpt":"The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the lengths of the longest common prefixes of lexicographically adjacent suffixes, and it can be computed in linear time. In this paper, we present new LCP-array construction algorithms that are fast and very sp"},"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":"1012.4263","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-20T09:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"5610f697d278e63dabd066220d2b361cd869ee9aeedc584495b405392b5644b8","abstract_canon_sha256":"2b69f89c82b7ddbea0234cf247ede6304cd0ca0e579d82f4eda6cd1692bd16f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:32:55.141338Z","signature_b64":"ZqcBwJKu7tTRpK+D2hh10q9cilv7FJXxE4O1LE+bTi9XSHbp3FL91KsIMeqjFJWPw85zAyNFrZwf367o2cXeDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e20c865925968c203ea4020bc29a25b2a2bff33d770798214a14d41e9daf86","last_reissued_at":"2026-05-18T04:32:55.140483Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:32:55.140483Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lightweight LCP-Array Construction in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Enno Ohlebusch, Simon Gog","submitted_at":"2010-12-20T09:08:05Z","abstract_excerpt":"The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the lengths of the longest common prefixes of lexicographically adjacent suffixes, and it can be computed in linear time. In this paper, we present new LCP-array construction algorithms that are fast and very sp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4263","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":"1012.4263","created_at":"2026-05-18T04:32:55.140628+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.4263v1","created_at":"2026-05-18T04:32:55.140628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4263","created_at":"2026-05-18T04:32:55.140628+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TRAZBSZEWLI","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TRAZBSZEWLIYIB6","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TRAZBSZ","created_at":"2026-05-18T12:26:03.138858+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/2TRAZBSZEWLIYIB6UQBAXQU2EW","json":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW.json","graph_json":"https://pith.science/api/pith-number/2TRAZBSZEWLIYIB6UQBAXQU2EW/graph.json","events_json":"https://pith.science/api/pith-number/2TRAZBSZEWLIYIB6UQBAXQU2EW/events.json","paper":"https://pith.science/paper/2TRAZBSZ"},"agent_actions":{"view_html":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW","download_json":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW.json","view_paper":"https://pith.science/paper/2TRAZBSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.4263&json=true","fetch_graph":"https://pith.science/api/pith-number/2TRAZBSZEWLIYIB6UQBAXQU2EW/graph.json","fetch_events":"https://pith.science/api/pith-number/2TRAZBSZEWLIYIB6UQBAXQU2EW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/action/storage_attestation","attest_author":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/action/author_attestation","sign_citation":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/action/citation_signature","submit_replication":"https://pith.science/pith/2TRAZBSZEWLIYIB6UQBAXQU2EW/action/replication_record"}},"created_at":"2026-05-18T04:32:55.140628+00:00","updated_at":"2026-05-18T04:32:55.140628+00:00"}