{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:CPWP7I6PYUM6HSG67DPHDC6ZQ6","short_pith_number":"pith:CPWP7I6P","schema_version":"1.0","canonical_sha256":"13ecffa3cfc519e3c8def8de718bd987aa8640ff13c7eb01ecd42c6ab1e68b8b","source":{"kind":"arxiv","id":"1611.08198","version":1},"attestation_state":"computed","paper":{"title":"Burrows-Wheeler transform and LCP array construction in constant space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe A. Louza, Guilherme P. Telles, Travis Gagie","submitted_at":"2016-11-24T14:43:57Z","abstract_excerpt":"In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, using constant additional space; we then show how to build the LCP array directly in compressed representation using Elias coding, still using constant additional space and with no asymptotic slowdown. Furthermore, we provide a time/space tradeoff for our algorithm when additional memory is allowed. Our algorithm runs in qua"},"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":"1611.08198","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-24T14:43:57Z","cross_cats_sorted":[],"title_canon_sha256":"4da24b251918006e48e3a64b849932ec13b848b696fbdc016c1d132cb4b3d2b0","abstract_canon_sha256":"36033b95bc0fb221fcc88f283c88f4d923af69f316dde1840f2585a06a3286bd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:14:01.410064Z","signature_b64":"0Mb5iu3+WbD9vEC26ZGulv1VD/zrd3oLn1h+MR+xNzEHl+RhhxhwZiXJCMGbAjIJ5mKGF7LbUsgPdHS24s0KCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"13ecffa3cfc519e3c8def8de718bd987aa8640ff13c7eb01ecd42c6ab1e68b8b","last_reissued_at":"2026-05-18T00:14:01.409459Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:14:01.409459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Burrows-Wheeler transform and LCP array construction in constant space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe A. Louza, Guilherme P. Telles, Travis Gagie","submitted_at":"2016-11-24T14:43:57Z","abstract_excerpt":"In this article we extend the elegant in-place Burrows-Wheeler transform (BWT) algorithm proposed by Crochemore et al. (Crochemore et al., 2015). Our extension is twofold: we first show how to compute simultaneously the longest common prefix (LCP) array as well as the BWT, using constant additional space; we then show how to build the LCP array directly in compressed representation using Elias coding, still using constant additional space and with no asymptotic slowdown. Furthermore, we provide a time/space tradeoff for our algorithm when additional memory is allowed. Our algorithm runs in qua"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08198","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":"1611.08198","created_at":"2026-05-18T00:14:01.409548+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08198v1","created_at":"2026-05-18T00:14:01.409548+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08198","created_at":"2026-05-18T00:14:01.409548+00:00"},{"alias_kind":"pith_short_12","alias_value":"CPWP7I6PYUM6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_16","alias_value":"CPWP7I6PYUM6HSG6","created_at":"2026-05-18T12:30:09.641336+00:00"},{"alias_kind":"pith_short_8","alias_value":"CPWP7I6P","created_at":"2026-05-18T12:30:09.641336+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/CPWP7I6PYUM6HSG67DPHDC6ZQ6","json":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6.json","graph_json":"https://pith.science/api/pith-number/CPWP7I6PYUM6HSG67DPHDC6ZQ6/graph.json","events_json":"https://pith.science/api/pith-number/CPWP7I6PYUM6HSG67DPHDC6ZQ6/events.json","paper":"https://pith.science/paper/CPWP7I6P"},"agent_actions":{"view_html":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6","download_json":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6.json","view_paper":"https://pith.science/paper/CPWP7I6P","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08198&json=true","fetch_graph":"https://pith.science/api/pith-number/CPWP7I6PYUM6HSG67DPHDC6ZQ6/graph.json","fetch_events":"https://pith.science/api/pith-number/CPWP7I6PYUM6HSG67DPHDC6ZQ6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6/action/storage_attestation","attest_author":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6/action/author_attestation","sign_citation":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6/action/citation_signature","submit_replication":"https://pith.science/pith/CPWP7I6PYUM6HSG67DPHDC6ZQ6/action/replication_record"}},"created_at":"2026-05-18T00:14:01.409548+00:00","updated_at":"2026-05-18T00:14:01.409548+00:00"}