{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:KEDPWATDDI67C7WPVOE4YYWXY7","short_pith_number":"pith:KEDPWATD","schema_version":"1.0","canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","source":{"kind":"arxiv","id":"1506.06983","version":1},"attestation_state":"computed","paper":{"title":"Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman","submitted_at":"2015-06-23T13:29:26Z","abstract_excerpt":"We consider the problem of finding repetitive structures and inherent patterns in a given string $\\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\\s{u}$ of a string $\\s{s}$ is both a prefix and a suffix of $\\s{s}$ such that $\\s{u} \\not= \\s{s}$. The computation of the border array of a string $\\s{s}$, namely the borders of each prefix of $\\s{s}$, is strongly related to the string matching problem: given a string $\\s{w}$, find all of its occurrences in $\\s{s}$. A {\\itshape Lyndon word} is a primitive word (i.e., it is not a power of another word) which is minimal for the l"},"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":"1506.06983","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-23T13:29:26Z","cross_cats_sorted":[],"title_canon_sha256":"cd3e1da34f93afd523886c7db4f8eb5b09492482c4d72043348f04ed1ce99a71","abstract_canon_sha256":"d0bc4b4d4d46eba0b206aff2d38bb52247e15580b696a66df8619b06b6c8862f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:40:55.401208Z","signature_b64":"HMI7AXZpp1RzcaLtOjBf6MFpbClbjzCajFsMLvLPMQDWokfcaj8OOCvhr69MAX1h6mwETlFF10M+M4tos0oGCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5106fb02631a3df17ecfab89cc62d7c7ef94c69ec4c7ca8a679ba7edc1f03fd0","last_reissued_at":"2026-05-18T01:40:55.400458Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:40:55.400458Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear Algorithms for Computing the Lyndon Border Array and the Lyndon Suffix Array","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ali Alatabbi, Jacqueline W. Daykin, M. Sohel Rahman","submitted_at":"2015-06-23T13:29:26Z","abstract_excerpt":"We consider the problem of finding repetitive structures and inherent patterns in a given string $\\s{s}$ of length $n$ over a finite totally ordered alphabet. A border $\\s{u}$ of a string $\\s{s}$ is both a prefix and a suffix of $\\s{s}$ such that $\\s{u} \\not= \\s{s}$. The computation of the border array of a string $\\s{s}$, namely the borders of each prefix of $\\s{s}$, is strongly related to the string matching problem: given a string $\\s{w}$, find all of its occurrences in $\\s{s}$. A {\\itshape Lyndon word} is a primitive word (i.e., it is not a power of another word) which is minimal for the l"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06983","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":"1506.06983","created_at":"2026-05-18T01:40:55.400589+00:00"},{"alias_kind":"arxiv_version","alias_value":"1506.06983v1","created_at":"2026-05-18T01:40:55.400589+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06983","created_at":"2026-05-18T01:40:55.400589+00:00"},{"alias_kind":"pith_short_12","alias_value":"KEDPWATDDI67","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_16","alias_value":"KEDPWATDDI67C7WP","created_at":"2026-05-18T12:29:27.538025+00:00"},{"alias_kind":"pith_short_8","alias_value":"KEDPWATD","created_at":"2026-05-18T12:29:27.538025+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/KEDPWATDDI67C7WPVOE4YYWXY7","json":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7.json","graph_json":"https://pith.science/api/pith-number/KEDPWATDDI67C7WPVOE4YYWXY7/graph.json","events_json":"https://pith.science/api/pith-number/KEDPWATDDI67C7WPVOE4YYWXY7/events.json","paper":"https://pith.science/paper/KEDPWATD"},"agent_actions":{"view_html":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7","download_json":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7.json","view_paper":"https://pith.science/paper/KEDPWATD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1506.06983&json=true","fetch_graph":"https://pith.science/api/pith-number/KEDPWATDDI67C7WPVOE4YYWXY7/graph.json","fetch_events":"https://pith.science/api/pith-number/KEDPWATDDI67C7WPVOE4YYWXY7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/action/storage_attestation","attest_author":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/action/author_attestation","sign_citation":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/action/citation_signature","submit_replication":"https://pith.science/pith/KEDPWATDDI67C7WPVOE4YYWXY7/action/replication_record"}},"created_at":"2026-05-18T01:40:55.400589+00:00","updated_at":"2026-05-18T01:40:55.400589+00:00"}