{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:FEGOX7WN4RTY5WO4KC6JNKKLEV","short_pith_number":"pith:FEGOX7WN","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"},"canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","source":{"kind":"arxiv","id":"0708.4406","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.4406","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"0708.4406v1","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.4406","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"FEGOX7WN4RTY","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEGOX7WN4RTY5WO4","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEGOX7WN","created_at":"2026-07-04T17:23:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:FEGOX7WN4RTY5WO4KC6JNKKLEV","target":"record","payload":{"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"},"canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","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"},"source_kind":"arxiv","source_id":"0708.4406","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T17:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4DtwueyI3tIyEvuRq0/k9n1IWmPReQAE8dbC69QkAztB+aUNcRElTARKteKz6st1WW4fh9cLyC1d2oTlVWE4Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:10:26.773326Z"},"content_sha256":"06e79b1c6bb31a4c9c57cef86bba576b8b828875658d8d89f208cc600aa39c73","schema_version":"1.0","event_id":"sha256:06e79b1c6bb31a4c9c57cef86bba576b8b828875658d8d89f208cc600aa39c73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:FEGOX7WN4RTY5WO4KC6JNKKLEV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-04T17:23:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MbjkbsSYtEYtkg1Eeb4cW0ZASJGpXb2Aio9r8fEd58Yl9A6DpBWULkOQ1IN65rhrpXU1zZbKi/0TPXDpysH8Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T23:10:26.773702Z"},"content_sha256":"612727f9810ac6df3518bbf5d52725807d44c20caef0eba179c56ce8d093fa30","schema_version":"1.0","event_id":"sha256:612727f9810ac6df3518bbf5d52725807d44c20caef0eba179c56ce8d093fa30"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/bundle.json","state_url":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-04T23:10:26Z","links":{"resolver":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV","bundle":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/bundle.json","state":"https://pith.science/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FEGOX7WN4RTY5WO4KC6JNKKLEV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:FEGOX7WN4RTY5WO4KC6JNKKLEV","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"d7244390dd197285e773e11c71bd19051ef173731b3034dc57178ce8e8eb24fc","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2007-08-31T18:34:41Z","title_canon_sha256":"e110a663ac36cab036ada6c865c644348e7363bd331f69c1a74d78f0c9ad2f8c"},"schema_version":"1.0","source":{"id":"0708.4406","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0708.4406","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"arxiv_version","alias_value":"0708.4406v1","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0708.4406","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_12","alias_value":"FEGOX7WN4RTY","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_16","alias_value":"FEGOX7WN4RTY5WO4","created_at":"2026-07-04T17:23:15Z"},{"alias_kind":"pith_short_8","alias_value":"FEGOX7WN","created_at":"2026-07-04T17:23:15Z"}],"graph_snapshots":[{"event_id":"sha256:612727f9810ac6df3518bbf5d52725807d44c20caef0eba179c56ce8d093fa30","target":"graph","created_at":"2026-07-04T17:23:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/0708.4406/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Amy Glen","cross_cats":["cs.DM"],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"2007-08-31T18:34:41Z","title":"A characterization of fine words over a finite alphabet"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0708.4406","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:06e79b1c6bb31a4c9c57cef86bba576b8b828875658d8d89f208cc600aa39c73","target":"record","created_at":"2026-07-04T17:23:15Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"d7244390dd197285e773e11c71bd19051ef173731b3034dc57178ce8e8eb24fc","cross_cats_sorted":["cs.DM"],"license":"","primary_cat":"math.CO","submitted_at":"2007-08-31T18:34:41Z","title_canon_sha256":"e110a663ac36cab036ada6c865c644348e7363bd331f69c1a74d78f0c9ad2f8c"},"schema_version":"1.0","source":{"id":"0708.4406","kind":"arxiv","version":1}},"canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"290cebfecde4678ed9dc50bc96a94b257ba7f9a0f2eb1f2ae6573618278a183b","first_computed_at":"2026-07-04T17:23:15.794899Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T17:23:15.794899Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3S40QlzR8MLT77Yni7tn8loQY3sTCfl7tTatfsOJVsTRD+LpqeCAWgrrLDPBV+chsdt6M3sWK2kXplgl50jBDA==","signature_status":"signed_v1","signed_at":"2026-07-04T17:23:15.795268Z","signed_message":"canonical_sha256_bytes"},"source_id":"0708.4406","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:06e79b1c6bb31a4c9c57cef86bba576b8b828875658d8d89f208cc600aa39c73","sha256:612727f9810ac6df3518bbf5d52725807d44c20caef0eba179c56ce8d093fa30"],"state_sha256":"19a2ecd890f6b73e663cd6603a03083d54381debb4973e4a293bb4f9acd7a981"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m/aEmqiNYSmKIvKMFbBkD54QRihNWdfz2GkW7dWjQ3XWVkcZhoy/Db4y/Fekt8S0jXEmoNi6n2lvY3yNJyhFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T23:10:26.775690Z","bundle_sha256":"c85ce3b327cd0a3c0f5b3b40943a47ccfd6484fce9e78cf9e7158233103b412d"}}