{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:65ZV5S4HWHRF6KBOA432FBYWYG","short_pith_number":"pith:65ZV5S4H","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"},"canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","source":{"kind":"arxiv","id":"1409.3080","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3080","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3080v2","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3080","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"65ZV5S4HWHRF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65ZV5S4HWHRF6KBO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65ZV5S4H","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:65ZV5S4HWHRF6KBOA432FBYWYG","target":"record","payload":{"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"},"canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","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"},"source_kind":"arxiv","source_id":"1409.3080","source_version":2,"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-05-18T02:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XhWe9x6d9LYtBX9+xToxIF+hvdU+1QgLIxEiIV+4pgn2eGMrCxo8bNAJJZ/jTrRMG0Vrl7baZl+yNMmykmhtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:01:01.630707Z"},"content_sha256":"257adfc3c56a2943ef24526b6cdb32bdd4ec84988f8e7cd51c61aab1e365d749","schema_version":"1.0","event_id":"sha256:257adfc3c56a2943ef24526b6cdb32bdd4ec84988f8e7cd51c61aab1e365d749"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:65ZV5S4HWHRF6KBOA432FBYWYG","target":"graph","payload":{"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"},"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-05-18T02:39:08Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uKkQMvH75rCoZJS0ZUFDEdD8K4FMl/zmjsk7VINhVl3tMstF1Bx5CEQpv7KCl5ml7GsTufe/aNf6/T9LmDM+AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T02:01:01.631053Z"},"content_sha256":"bbae158e3516bf58ecba1060baba2fafa8fd739ea267e64854f299a3465fedf7","schema_version":"1.0","event_id":"sha256:bbae158e3516bf58ecba1060baba2fafa8fd739ea267e64854f299a3465fedf7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/bundle.json","state_url":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/65ZV5S4HWHRF6KBOA432FBYWYG/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-06-22T02:01:01Z","links":{"resolver":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG","bundle":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/bundle.json","state":"https://pith.science/pith/65ZV5S4HWHRF6KBOA432FBYWYG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/65ZV5S4HWHRF6KBOA432FBYWYG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:65ZV5S4HWHRF6KBOA432FBYWYG","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":"8d9a30f7106a3469a5f0b83e81bbe493d7bb469f0955f63fee87e55b2565d2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-10T14:18:15Z","title_canon_sha256":"ccec8ae18ecd66e128e2365fc701df708f73c38647209833008aff9ddbeb5fe2"},"schema_version":"1.0","source":{"id":"1409.3080","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.3080","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"arxiv_version","alias_value":"1409.3080v2","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.3080","created_at":"2026-05-18T02:39:08Z"},{"alias_kind":"pith_short_12","alias_value":"65ZV5S4HWHRF","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"65ZV5S4HWHRF6KBO","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"65ZV5S4H","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:bbae158e3516bf58ecba1060baba2fafa8fd739ea267e64854f299a3465fedf7","target":"graph","created_at":"2026-05-18T02:39:08Z","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"},"paper":{"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.","authors_text":"Danny Rorabaugh, Joshua Cooper","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-10T14:18:15Z","title":"Bounds on Zimin Word Avoidance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.3080","kind":"arxiv","version":2},"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:257adfc3c56a2943ef24526b6cdb32bdd4ec84988f8e7cd51c61aab1e365d749","target":"record","created_at":"2026-05-18T02:39:08Z","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":"8d9a30f7106a3469a5f0b83e81bbe493d7bb469f0955f63fee87e55b2565d2ff","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-09-10T14:18:15Z","title_canon_sha256":"ccec8ae18ecd66e128e2365fc701df708f73c38647209833008aff9ddbeb5fe2"},"schema_version":"1.0","source":{"id":"1409.3080","kind":"arxiv","version":2}},"canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7735ecb87b1e25f282e0737a28716c18461dda05f4b513644609bd4e28016ba","first_computed_at":"2026-05-18T02:39:08.491978Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:08.491978Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C9lA9QZ8FxiuDDF+yIt2aRwNCqIFa8inRy0A0v/3s7AyObq1Qanu9Be/HLcJcET7Bsecd7UU7IqGeCn58xrBDg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:08.492601Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.3080","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:257adfc3c56a2943ef24526b6cdb32bdd4ec84988f8e7cd51c61aab1e365d749","sha256:bbae158e3516bf58ecba1060baba2fafa8fd739ea267e64854f299a3465fedf7"],"state_sha256":"7ea5fd8a3416a1f9d072d839efac178775c0239e00f58dd5736ace9b8664e610"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b1cPK/TyleruUWT2fcukdNulzYFCEVHI59pb4SIuH/nkdKZ/2kvwpnK1cVlm1Ocks+Qn1xJRAfTN6gor4pecAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T02:01:01.633022Z","bundle_sha256":"53a5a247a773b08e485969033498236519730bdf9dc02a372af0de7894459ea2"}}