{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:FEGOX7WN4RTY5WO4KC6JNKKLEV","short_pith_number":"pith:FEGOX7WN","schema_version":"1.0","canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","source":{"kind":"arxiv","id":"0708.4406","version":1},"attestation_state":"computed","paper":{"title":"A characterization of fine words over a finite alphabet","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen","submitted_at":"2007-08-31T18:34:41Z","abstract_excerpt":"To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same length. We say that an infinite word w over A is \"fine\" if there exists an infinite word u such that, for any lexicographic order, min(w) = au where a = min(A). In this paper, we characterize fine words; specifically, we prove that an infinite word w is fine if and only if w is either a \"strict episturmian word\" or a strict \"skew episturmian word''. This charact"},"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":"0708.4406","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.CO","submitted_at":"2007-08-31T18:34:41Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e110a663ac36cab036ada6c865c644348e7363bd331f69c1a74d78f0c9ad2f8c","abstract_canon_sha256":"d7244390dd197285e773e11c71bd19051ef173731b3034dc57178ce8e8eb24fc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T17:23:15.795268Z","signature_b64":"3S40QlzR8MLT77Yni7tn8loQY3sTCfl7tTatfsOJVsTRD+LpqeCAWgrrLDPBV+chsdt6M3sWK2kXplgl50jBDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","last_reissued_at":"2026-07-04T17:23:15.794899Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T17:23:15.794899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A characterization of fine words over a finite alphabet","license":"","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Amy Glen","submitted_at":"2007-08-31T18:34:41Z","abstract_excerpt":"To any infinite word w over a finite alphabet A we can associate two infinite words min(w) and max(w) such that any prefix of min(w) (resp. max(w)) is the lexicographically smallest (resp. greatest) amongst the factors of w of the same length. We say that an infinite word w over A is \"fine\" if there exists an infinite word u such that, for any lexicographic order, min(w) = au where a = min(A). In this paper, we characterize fine words; specifically, we prove that an infinite word w is fine if and only if w is either a \"strict episturmian word\" or a strict \"skew episturmian word''. This charact"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.4406","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/0708.4406/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"0708.4406","created_at":"2026-07-04T17:23:15.794958+00:00"},{"alias_kind":"arxiv_version","alias_value":"0708.4406v1","created_at":"2026-07-04T17:23:15.794958+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.4406","created_at":"2026-07-04T17:23:15.794958+00:00"},{"alias_kind":"pith_short_12","alias_value":"FEGOX7WN4RTY","created_at":"2026-07-04T17:23:15.794958+00:00"},{"alias_kind":"pith_short_16","alias_value":"FEGOX7WN4RTY5WO4","created_at":"2026-07-04T17:23:15.794958+00:00"},{"alias_kind":"pith_short_8","alias_value":"FEGOX7WN","created_at":"2026-07-04T17:23:15.794958+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/FEGOX7WN4RTY5WO4KC6JNKKLEV","json":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV.json","graph_json":"https://pith.science/api/pith-number/FEGOX7WN4RTY5WO4KC6JNKKLEV/graph.json","events_json":"https://pith.science/api/pith-number/FEGOX7WN4RTY5WO4KC6JNKKLEV/events.json","paper":"https://pith.science/paper/FEGOX7WN"},"agent_actions":{"view_html":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV","download_json":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV.json","view_paper":"https://pith.science/paper/FEGOX7WN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0708.4406&json=true","fetch_graph":"https://pith.science/api/pith-number/FEGOX7WN4RTY5WO4KC6JNKKLEV/graph.json","fetch_events":"https://pith.science/api/pith-number/FEGOX7WN4RTY5WO4KC6JNKKLEV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/action/storage_attestation","attest_author":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/action/author_attestation","sign_citation":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/action/citation_signature","submit_replication":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/action/replication_record"}},"created_at":"2026-07-04T17:23:15.794958+00:00","updated_at":"2026-07-04T17:23:15.794958+00:00"}