{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:PGSOY2F2FLJPHBPBPRAPAD4TNP","short_pith_number":"pith:PGSOY2F2","schema_version":"1.0","canonical_sha256":"79a4ec68ba2ad2f385e17c40f00f936bde549bd3f579202490f97bed9fc9f4b2","source":{"kind":"arxiv","id":"1705.10277","version":7},"attestation_state":"computed","paper":{"title":"Inverse Lyndon words and Inverse Lyndon factorizations of words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.FL","authors_text":"Clelia De Felice, Paola Bonizzoni, Rocco Zaccagnino, Rosalba Zizza","submitted_at":"2017-05-29T16:24:11Z","abstract_excerpt":"Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon words with respect to the inverse lexicographic order. The Lyndon factorization of a nonempty word w is unique but w may have several inverse Lyndon factorizations. We prove that any nonempty word w admits a canonical inverse Lyndon factorization, named ICFL(w), that maintains the main properties of the Lyndon factorization of w: it can be compute"},"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":"1705.10277","kind":"arxiv","version":7},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2017-05-29T16:24:11Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"090b33f5f2683c90cc3b93efaac99bc58bcffe4e0d1a1060749a50211cf09400","abstract_canon_sha256":"f8332460e3d491c9201dd502a9f8dde4397f5de6072f4eac59d9be210f237195"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:06:31.039339Z","signature_b64":"sxnUrSQBJvNYxpYr1FtnOiTjWuSemT3rAzE6t193UmQYnMwgpEv0oZ6bUjuGwtFaVD72b8La84B1X5VwsvjjCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79a4ec68ba2ad2f385e17c40f00f936bde549bd3f579202490f97bed9fc9f4b2","last_reissued_at":"2026-05-18T00:06:31.038905Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:06:31.038905Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Inverse Lyndon words and Inverse Lyndon factorizations of words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"cs.FL","authors_text":"Clelia De Felice, Paola Bonizzoni, Rocco Zaccagnino, Rosalba Zizza","submitted_at":"2017-05-29T16:24:11Z","abstract_excerpt":"Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon words with respect to the inverse lexicographic order. The Lyndon factorization of a nonempty word w is unique but w may have several inverse Lyndon factorizations. We prove that any nonempty word w admits a canonical inverse Lyndon factorization, named ICFL(w), that maintains the main properties of the Lyndon factorization of w: it can be compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.10277","kind":"arxiv","version":7},"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":"1705.10277","created_at":"2026-05-18T00:06:31.038977+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.10277v7","created_at":"2026-05-18T00:06:31.038977+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.10277","created_at":"2026-05-18T00:06:31.038977+00:00"},{"alias_kind":"pith_short_12","alias_value":"PGSOY2F2FLJP","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"PGSOY2F2FLJPHBPB","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"PGSOY2F2","created_at":"2026-05-18T12:31:37.085036+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/PGSOY2F2FLJPHBPBPRAPAD4TNP","json":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP.json","graph_json":"https://pith.science/api/pith-number/PGSOY2F2FLJPHBPBPRAPAD4TNP/graph.json","events_json":"https://pith.science/api/pith-number/PGSOY2F2FLJPHBPBPRAPAD4TNP/events.json","paper":"https://pith.science/paper/PGSOY2F2"},"agent_actions":{"view_html":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP","download_json":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP.json","view_paper":"https://pith.science/paper/PGSOY2F2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.10277&json=true","fetch_graph":"https://pith.science/api/pith-number/PGSOY2F2FLJPHBPBPRAPAD4TNP/graph.json","fetch_events":"https://pith.science/api/pith-number/PGSOY2F2FLJPHBPBPRAPAD4TNP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP/action/storage_attestation","attest_author":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP/action/author_attestation","sign_citation":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP/action/citation_signature","submit_replication":"https://pith.science/pith/PGSOY2F2FLJPHBPBPRAPAD4TNP/action/replication_record"}},"created_at":"2026-05-18T00:06:31.038977+00:00","updated_at":"2026-05-18T00:06:31.038977+00:00"}