{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:65ZV5S4HWHRF6KBOA432FBYWYG","short_pith_number":"pith:65ZV5S4H","schema_version":"1.0","canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","source":{"kind":"arxiv","id":"1409.3080","version":2},"attestation_state":"computed","paper":{"title":"Bounds on Zimin Word Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh, Joshua Cooper","submitted_at":"2014-09-10T14:18:15Z","abstract_excerpt":"How long can a word be that avoids the unavoidable? Word $W$ encounters word $V$ provided there is a homomorphism $\\phi$ defined by mapping letters to nonempty words such that $\\phi(V)$ is a subword of $W$. Otherwise, $W$ is said to avoid $V$. If, on any arbitrary finite alphabet, there are finitely many words that avoid $V$, then we say $V$ is unavoidable. Zimin (1982) proved that every unavoidable word is encountered by some word $Z_n$, defined by: $Z_1 = x_1$ and $Z_{n+1} = Z_n x_{n+1} Z_n$. Here we explore bounds on how long words can be and still avoid the unavoidable Zimin words."},"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":"1409.3080","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-10T14:18:15Z","cross_cats_sorted":[],"title_canon_sha256":"ccec8ae18ecd66e128e2365fc701df708f73c38647209833008aff9ddbeb5fe2","abstract_canon_sha256":"8d9a30f7106a3469a5f0b83e81bbe493d7bb469f0955f63fee87e55b2565d2ff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:39:08.492601Z","signature_b64":"C9lA9QZ8FxiuDDF+yIt2aRwNCqIFa8inRy0A0v/3s7AyObq1Qanu9Be/HLcJcET7Bsecd7UU7IqGeCn58xrBDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","last_reissued_at":"2026-05-18T02:39:08.491978Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:39:08.491978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bounds on Zimin Word Avoidance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Danny Rorabaugh, Joshua Cooper","submitted_at":"2014-09-10T14:18:15Z","abstract_excerpt":"How long can a word be that avoids the unavoidable? Word $W$ encounters word $V$ provided there is a homomorphism $\\phi$ defined by mapping letters to nonempty words such that $\\phi(V)$ is a subword of $W$. Otherwise, $W$ is said to avoid $V$. If, on any arbitrary finite alphabet, there are finitely many words that avoid $V$, then we say $V$ is unavoidable. Zimin (1982) proved that every unavoidable word is encountered by some word $Z_n$, defined by: $Z_1 = x_1$ and $Z_{n+1} = Z_n x_{n+1} Z_n$. Here we explore bounds on how long words can be and still avoid the unavoidable Zimin words."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3080","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":"1409.3080","created_at":"2026-05-18T02:39:08.492075+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.3080v2","created_at":"2026-05-18T02:39:08.492075+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3080","created_at":"2026-05-18T02:39:08.492075+00:00"},{"alias_kind":"pith_short_12","alias_value":"65ZV5S4HWHRF","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_16","alias_value":"65ZV5S4HWHRF6KBO","created_at":"2026-05-18T12:28:16.859392+00:00"},{"alias_kind":"pith_short_8","alias_value":"65ZV5S4H","created_at":"2026-05-18T12:28:16.859392+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/65ZV5S4HWHRF6KBOA432FBYWYG","json":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG.json","graph_json":"https://pith.science/api/pith-number/65ZV5S4HWHRF6KBOA432FBYWYG/graph.json","events_json":"https://pith.science/api/pith-number/65ZV5S4HWHRF6KBOA432FBYWYG/events.json","paper":"https://pith.science/paper/65ZV5S4H"},"agent_actions":{"view_html":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG","download_json":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG.json","view_paper":"https://pith.science/paper/65ZV5S4H","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.3080&json=true","fetch_graph":"https://pith.science/api/pith-number/65ZV5S4HWHRF6KBOA432FBYWYG/graph.json","fetch_events":"https://pith.science/api/pith-number/65ZV5S4HWHRF6KBOA432FBYWYG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/action/storage_attestation","attest_author":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/action/author_attestation","sign_citation":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/action/citation_signature","submit_replication":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/action/replication_record"}},"created_at":"2026-05-18T02:39:08.492075+00:00","updated_at":"2026-05-18T02:39:08.492075+00:00"}