{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:LFW25KM57M7P35ZS7F34IMA2XJ","short_pith_number":"pith:LFW25KM5","schema_version":"1.0","canonical_sha256":"596daea99dfb3efdf732f977c4301aba4c1b1efd8baf1ab93b732a4590bf22b7","source":{"kind":"arxiv","id":"1905.04746","version":2},"attestation_state":"computed","paper":{"title":"Generalized Lyndon Factorizations of Infinite Words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amanda Burcroff, Eric Winsor","submitted_at":"2019-05-12T17:09:39Z","abstract_excerpt":"A generalized lexicographic order on words is a lexicographic order where the total order of the alphabet depends on the position of the comparison. A generalized Lyndon word is a finite word which is strictly smallest among its class of rotations with respect to a generalized lexicographic order. This notion can be extended to infinite words: an infinite generalized Lyndon word is an infinite word which is strictly smallest among its class of suffixes. We prove a conjecture of Dolce, Restivo, and Reutenauer: every infinite word has a unique nonincreasing factorization into finite and infinite"},"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":"1905.04746","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-05-12T17:09:39Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"812800bf75649e33e16e21fa1d13c537d949e228cecc06fa6089553df9fd44b8","abstract_canon_sha256":"cb36e820173821af973a3f13d2ec45bf93d64e42c9a6e5cd08aab5abf3d3362d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:53.136348Z","signature_b64":"qmfMfKxdvKQZ0oSzv0Qx+UlewVnEENNxI/utIsHN2h3LUHpoo9gvJOABfI25jXzFSbEIHX+4s9y7HEP2+EJlBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"596daea99dfb3efdf732f977c4301aba4c1b1efd8baf1ab93b732a4590bf22b7","last_reissued_at":"2026-05-17T23:42:53.135880Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:53.135880Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalized Lyndon Factorizations of Infinite Words","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amanda Burcroff, Eric Winsor","submitted_at":"2019-05-12T17:09:39Z","abstract_excerpt":"A generalized lexicographic order on words is a lexicographic order where the total order of the alphabet depends on the position of the comparison. A generalized Lyndon word is a finite word which is strictly smallest among its class of rotations with respect to a generalized lexicographic order. This notion can be extended to infinite words: an infinite generalized Lyndon word is an infinite word which is strictly smallest among its class of suffixes. We prove a conjecture of Dolce, Restivo, and Reutenauer: every infinite word has a unique nonincreasing factorization into finite and infinite"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04746","kind":"arxiv","version":2},"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":"1905.04746","created_at":"2026-05-17T23:42:53.135951+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.04746v2","created_at":"2026-05-17T23:42:53.135951+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04746","created_at":"2026-05-17T23:42:53.135951+00:00"},{"alias_kind":"pith_short_12","alias_value":"LFW25KM57M7P","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_16","alias_value":"LFW25KM57M7P35ZS","created_at":"2026-05-18T12:33:21.387695+00:00"},{"alias_kind":"pith_short_8","alias_value":"LFW25KM5","created_at":"2026-05-18T12:33:21.387695+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/LFW25KM57M7P35ZS7F34IMA2XJ","json":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ.json","graph_json":"https://pith.science/api/pith-number/LFW25KM57M7P35ZS7F34IMA2XJ/graph.json","events_json":"https://pith.science/api/pith-number/LFW25KM57M7P35ZS7F34IMA2XJ/events.json","paper":"https://pith.science/paper/LFW25KM5"},"agent_actions":{"view_html":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ","download_json":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ.json","view_paper":"https://pith.science/paper/LFW25KM5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.04746&json=true","fetch_graph":"https://pith.science/api/pith-number/LFW25KM57M7P35ZS7F34IMA2XJ/graph.json","fetch_events":"https://pith.science/api/pith-number/LFW25KM57M7P35ZS7F34IMA2XJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ/action/storage_attestation","attest_author":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ/action/author_attestation","sign_citation":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ/action/citation_signature","submit_replication":"https://pith.science/pith/LFW25KM57M7P35ZS7F34IMA2XJ/action/replication_record"}},"created_at":"2026-05-17T23:42:53.135951+00:00","updated_at":"2026-05-17T23:42:53.135951+00:00"}