{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZYSFUAI2LL6HEGNKPNMQ2TZV2O","short_pith_number":"pith:ZYSFUAI2","schema_version":"1.0","canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","source":{"kind":"arxiv","id":"1704.03479","version":2},"attestation_state":"computed","paper":{"title":"Tower-type bounds for unavoidable patterns in words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2017-04-11T18:11:23Z","abstract_excerpt":"A word $w$ is said to contain the pattern $P$ if there is a way to substitute a nonempty word for each letter in $P$ so that the resulting word is a subword of $w$. Bean, Ehrenfeucht and McNulty and, independently, Zimin characterised the patterns $P$ which are unavoidable, in the sense that any sufficiently long word over a fixed alphabet contains $P$. Zimin's characterisation says that a pattern is unavoidable if and only if it is contained in a Zimin word, where the Zimin words are defined by $Z_1 = x_1$ and $Z_n=Z_{n-1} x_n Z_{n-1}$. We study the quantitative aspects of this theorem, obtai"},"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":"1704.03479","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T18:11:23Z","cross_cats_sorted":[],"title_canon_sha256":"bc0b973a435787a0dec9460c774f36827bbf7edfb7547e21d4bceb7cc50129dc","abstract_canon_sha256":"5e6b45289a5142f95699af9397a0de7c22ce2243e6b0f9bd39deb0eb9389b87b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:39.177391Z","signature_b64":"zkJg5VCcICNchd6RDEec/mFEaxtTFvNXPthCnD6VQsugt9qfC4p1/3ZKAuA7WabSGjczKAba3PxKyQg4C+GsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","last_reissued_at":"2026-05-18T00:01:39.176918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:39.176918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tower-type bounds for unavoidable patterns in words","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","submitted_at":"2017-04-11T18:11:23Z","abstract_excerpt":"A word $w$ is said to contain the pattern $P$ if there is a way to substitute a nonempty word for each letter in $P$ so that the resulting word is a subword of $w$. Bean, Ehrenfeucht and McNulty and, independently, Zimin characterised the patterns $P$ which are unavoidable, in the sense that any sufficiently long word over a fixed alphabet contains $P$. Zimin's characterisation says that a pattern is unavoidable if and only if it is contained in a Zimin word, where the Zimin words are defined by $Z_1 = x_1$ and $Z_n=Z_{n-1} x_n Z_{n-1}$. We study the quantitative aspects of this theorem, obtai"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03479","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":"1704.03479","created_at":"2026-05-18T00:01:39.176990+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.03479v2","created_at":"2026-05-18T00:01:39.176990+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03479","created_at":"2026-05-18T00:01:39.176990+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZYSFUAI2LL6H","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZYSFUAI2LL6HEGNK","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZYSFUAI2","created_at":"2026-05-18T12:31:59.375834+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/ZYSFUAI2LL6HEGNKPNMQ2TZV2O","json":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O.json","graph_json":"https://pith.science/api/pith-number/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/graph.json","events_json":"https://pith.science/api/pith-number/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/events.json","paper":"https://pith.science/paper/ZYSFUAI2"},"agent_actions":{"view_html":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O","download_json":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O.json","view_paper":"https://pith.science/paper/ZYSFUAI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.03479&json=true","fetch_graph":"https://pith.science/api/pith-number/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/graph.json","fetch_events":"https://pith.science/api/pith-number/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/action/storage_attestation","attest_author":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/action/author_attestation","sign_citation":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/action/citation_signature","submit_replication":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/action/replication_record"}},"created_at":"2026-05-18T00:01:39.176990+00:00","updated_at":"2026-05-18T00:01:39.176990+00:00"}