{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:BLFJXXKVUWKJXBWWKWN2BY3AX4","short_pith_number":"pith:BLFJXXKV","schema_version":"1.0","canonical_sha256":"0aca9bdd55a5949b86d6559ba0e360bf3619c9a0926b49488d6b9cbba7b15efa","source":{"kind":"arxiv","id":"1406.5895","version":1},"attestation_state":"computed","paper":{"title":"Universal Lyndon Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Arturo Carpi, Gabriele Fici, Jakub Oprsal, Marinella Sciortino, Stepan Holub","submitted_at":"2014-06-23T13:24:16Z","abstract_excerpt":"A word $w$ over an alphabet $\\Sigma$ is a Lyndon word if there exists an order defined on $\\Sigma$ for which $w$ is lexicographically smaller than all of its conjugates (other than itself). We introduce and study \\emph{universal Lyndon words}, which are words over an $n$-letter alphabet that have length $n!$ and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every $n$ and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-co"},"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":"1406.5895","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-06-23T13:24:16Z","cross_cats_sorted":["cs.FL","math.CO"],"title_canon_sha256":"620ad3339dd5f24d9502f47ef3e5fb818f6ac6a2e0efb5cceb4cef1c4a5b851b","abstract_canon_sha256":"979d76fdaad1d1e87e6e84114ccff489a37331107b91349d4b5eed28f4037c28"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:43.640543Z","signature_b64":"OByRLO/kUTL4icNLyRIA55AMgBWfRRSMdiedWazCLPHRAbyctjmR7exhGJlTFBchAYzR5X3u41q52IdZnLu/Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0aca9bdd55a5949b86d6559ba0e360bf3619c9a0926b49488d6b9cbba7b15efa","last_reissued_at":"2026-05-18T02:47:43.639722Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:43.639722Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal Lyndon Words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","math.CO"],"primary_cat":"cs.DM","authors_text":"Arturo Carpi, Gabriele Fici, Jakub Oprsal, Marinella Sciortino, Stepan Holub","submitted_at":"2014-06-23T13:24:16Z","abstract_excerpt":"A word $w$ over an alphabet $\\Sigma$ is a Lyndon word if there exists an order defined on $\\Sigma$ for which $w$ is lexicographically smaller than all of its conjugates (other than itself). We introduce and study \\emph{universal Lyndon words}, which are words over an $n$-letter alphabet that have length $n!$ and such that all the conjugates are Lyndon words. We show that universal Lyndon words exist for every $n$ and exhibit combinatorial and structural properties of these words. We then define particular prefix codes, which we call Hamiltonian lex-codes, and show that every Hamiltonian lex-co"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.5895","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":"1406.5895","created_at":"2026-05-18T02:47:43.639847+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.5895v1","created_at":"2026-05-18T02:47:43.639847+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.5895","created_at":"2026-05-18T02:47:43.639847+00:00"},{"alias_kind":"pith_short_12","alias_value":"BLFJXXKVUWKJ","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"BLFJXXKVUWKJXBWW","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"BLFJXXKV","created_at":"2026-05-18T12:28:22.404517+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/BLFJXXKVUWKJXBWWKWN2BY3AX4","json":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4.json","graph_json":"https://pith.science/api/pith-number/BLFJXXKVUWKJXBWWKWN2BY3AX4/graph.json","events_json":"https://pith.science/api/pith-number/BLFJXXKVUWKJXBWWKWN2BY3AX4/events.json","paper":"https://pith.science/paper/BLFJXXKV"},"agent_actions":{"view_html":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4","download_json":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4.json","view_paper":"https://pith.science/paper/BLFJXXKV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.5895&json=true","fetch_graph":"https://pith.science/api/pith-number/BLFJXXKVUWKJXBWWKWN2BY3AX4/graph.json","fetch_events":"https://pith.science/api/pith-number/BLFJXXKVUWKJXBWWKWN2BY3AX4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4/action/storage_attestation","attest_author":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4/action/author_attestation","sign_citation":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4/action/citation_signature","submit_replication":"https://pith.science/pith/BLFJXXKVUWKJXBWWKWN2BY3AX4/action/replication_record"}},"created_at":"2026-05-18T02:47:43.639847+00:00","updated_at":"2026-05-18T02:47:43.639847+00:00"}