{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:3NX7HWCVM2ZM2JSF3Q7AKV3G4M","short_pith_number":"pith:3NX7HWCV","schema_version":"1.0","canonical_sha256":"db6ff3d85566b2cd2645dc3e055766e325850bf245608b157e1883695d170b80","source":{"kind":"arxiv","id":"1710.10105","version":1},"attestation_state":"computed","paper":{"title":"Lyndon Array Construction during Burrows-Wheeler Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles, W. F. Smyth","submitted_at":"2017-10-27T12:37:14Z","abstract_excerpt":"In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$. Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that computing the Burrows-Wheeler transform and then constructing the Lyndon array is competitive compared to the known approaches. We also propose a new balanced parenthesis representation for the Lyndon"},"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":"1710.10105","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-27T12:37:14Z","cross_cats_sorted":[],"title_canon_sha256":"6ac067a1d919c0d504b003558a1ee428e51f28f4bc25e87e6e7c415e7aa2d267","abstract_canon_sha256":"4a306418f3791334fe9c1480d98321e66d09bef351bc9a7a37c240b5f0e2c4d3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:39.841905Z","signature_b64":"GZyB+XkFW2sfwXB9UVZKn/4BAR5oGFvhk5qJgAUuRxDjUlviQ9vDY8/ot0rUQ5gcuGkio8FA7cRi476GtlViAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db6ff3d85566b2cd2645dc3e055766e325850bf245608b157e1883695d170b80","last_reissued_at":"2026-05-17T23:51:39.841201Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:39.841201Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lyndon Array Construction during Burrows-Wheeler Inversion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Felipe A. Louza, Giovanni Manzini, Guilherme P. Telles, W. F. Smyth","submitted_at":"2017-10-27T12:37:14Z","abstract_excerpt":"In this paper we present an algorithm to compute the Lyndon array of a string $T$ of length $n$ as a byproduct of the inversion of the Burrows-Wheeler transform of $T$. Our algorithm runs in linear time using only a stack in addition to the data structures used for Burrows-Wheeler inversion. We compare our algorithm with two other linear-time algorithms for Lyndon array construction and show that computing the Burrows-Wheeler transform and then constructing the Lyndon array is competitive compared to the known approaches. We also propose a new balanced parenthesis representation for the Lyndon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.10105","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":"1710.10105","created_at":"2026-05-17T23:51:39.841330+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.10105v1","created_at":"2026-05-17T23:51:39.841330+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.10105","created_at":"2026-05-17T23:51:39.841330+00:00"},{"alias_kind":"pith_short_12","alias_value":"3NX7HWCVM2ZM","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"3NX7HWCVM2ZM2JSF","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"3NX7HWCV","created_at":"2026-05-18T12:30:58.224056+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/3NX7HWCVM2ZM2JSF3Q7AKV3G4M","json":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M.json","graph_json":"https://pith.science/api/pith-number/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/graph.json","events_json":"https://pith.science/api/pith-number/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/events.json","paper":"https://pith.science/paper/3NX7HWCV"},"agent_actions":{"view_html":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M","download_json":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M.json","view_paper":"https://pith.science/paper/3NX7HWCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.10105&json=true","fetch_graph":"https://pith.science/api/pith-number/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/graph.json","fetch_events":"https://pith.science/api/pith-number/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/action/storage_attestation","attest_author":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/action/author_attestation","sign_citation":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/action/citation_signature","submit_replication":"https://pith.science/pith/3NX7HWCVM2ZM2JSF3Q7AKV3G4M/action/replication_record"}},"created_at":"2026-05-17T23:51:39.841330+00:00","updated_at":"2026-05-17T23:51:39.841330+00:00"}