{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:FL2SCFJW6AMDUAXAEQRNQQE7IW","short_pith_number":"pith:FL2SCFJW","schema_version":"1.0","canonical_sha256":"2af5211536f0183a02e02422d8409f45b5555054443d8cdfb0d4f8a247becbae","source":{"kind":"arxiv","id":"1908.04686","version":1},"attestation_state":"computed","paper":{"title":"Space-Efficient Construction of Compressed Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giovanna Rosone, Nicola Prezza","submitted_at":"2019-08-12T10:58:49Z","abstract_excerpt":"We show how to build several data structures of central importance to string processing, taking as input the Burrows-Wheeler transform (BWT) and using small extra working space. Let $n$ be the text length and $\\sigma$ be the alphabet size. We first provide two algorithms that enumerate all LCP values and suffix tree intervals in $O(n\\log\\sigma)$ time using just $o(n\\log\\sigma)$ bits of working space on top of the input BWT. Using these algorithms as building blocks, for any parameter $0 < \\epsilon \\leq 1$ we show how to build the PLCP bitvector and the balanced parentheses representation of th"},"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":"1908.04686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-08-12T10:58:49Z","cross_cats_sorted":[],"title_canon_sha256":"1fd4e904139a0a18599bf7b0d50fdffeb6542d048edaa8aa8c7fd861ed7f5710","abstract_canon_sha256":"492ee9304c976d32106f137b2610de6ebb2b1ad608aeb27f29d7b6cde84dabbc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:55:15.531147Z","signature_b64":"ebdt38al/i54+T4QM0kVWEC0LAOEzGIvXYsmi9cVHuDyedi7E101sGfJ91s1yayBS6zHCXir6bZCP3JxruySDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2af5211536f0183a02e02422d8409f45b5555054443d8cdfb0d4f8a247becbae","last_reissued_at":"2026-07-04T23:55:15.530806Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:55:15.530806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-Efficient Construction of Compressed Suffix Trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giovanna Rosone, Nicola Prezza","submitted_at":"2019-08-12T10:58:49Z","abstract_excerpt":"We show how to build several data structures of central importance to string processing, taking as input the Burrows-Wheeler transform (BWT) and using small extra working space. Let $n$ be the text length and $\\sigma$ be the alphabet size. We first provide two algorithms that enumerate all LCP values and suffix tree intervals in $O(n\\log\\sigma)$ time using just $o(n\\log\\sigma)$ bits of working space on top of the input BWT. Using these algorithms as building blocks, for any parameter $0 < \\epsilon \\leq 1$ we show how to build the PLCP bitvector and the balanced parentheses representation of th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04686","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04686/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.04686","created_at":"2026-07-04T23:55:15.530866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04686v1","created_at":"2026-07-04T23:55:15.530866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04686","created_at":"2026-07-04T23:55:15.530866+00:00"},{"alias_kind":"pith_short_12","alias_value":"FL2SCFJW6AMD","created_at":"2026-07-04T23:55:15.530866+00:00"},{"alias_kind":"pith_short_16","alias_value":"FL2SCFJW6AMDUAXA","created_at":"2026-07-04T23:55:15.530866+00:00"},{"alias_kind":"pith_short_8","alias_value":"FL2SCFJW","created_at":"2026-07-04T23:55:15.530866+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/FL2SCFJW6AMDUAXAEQRNQQE7IW","json":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW.json","graph_json":"https://pith.science/api/pith-number/FL2SCFJW6AMDUAXAEQRNQQE7IW/graph.json","events_json":"https://pith.science/api/pith-number/FL2SCFJW6AMDUAXAEQRNQQE7IW/events.json","paper":"https://pith.science/paper/FL2SCFJW"},"agent_actions":{"view_html":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW","download_json":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW.json","view_paper":"https://pith.science/paper/FL2SCFJW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04686&json=true","fetch_graph":"https://pith.science/api/pith-number/FL2SCFJW6AMDUAXAEQRNQQE7IW/graph.json","fetch_events":"https://pith.science/api/pith-number/FL2SCFJW6AMDUAXAEQRNQQE7IW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW/action/storage_attestation","attest_author":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW/action/author_attestation","sign_citation":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW/action/citation_signature","submit_replication":"https://pith.science/pith/FL2SCFJW6AMDUAXAEQRNQQE7IW/action/replication_record"}},"created_at":"2026-07-04T23:55:15.530866+00:00","updated_at":"2026-07-04T23:55:15.530866+00:00"}