{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ZYSFUAI2LL6HEGNKPNMQ2TZV2O","short_pith_number":"pith:ZYSFUAI2","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"},"canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","source":{"kind":"arxiv","id":"1704.03479","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03479","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03479v2","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03479","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZYSFUAI2LL6H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYSFUAI2LL6HEGNK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYSFUAI2","created_at":"2026-05-18T12:31:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ZYSFUAI2LL6HEGNKPNMQ2TZV2O","target":"record","payload":{"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"},"canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","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"},"source_kind":"arxiv","source_id":"1704.03479","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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oRns4iz/qo6tO25ABAUqbu7NKtHzx8MU+Wsk0JDiHvT6CUF1t1Ii9Nyqg941N5uL5DjEVnFLq+j3xVZ32fZyCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:06.851712Z"},"content_sha256":"4b757a91e5b020f2f6e9368c025b5f180449e43fb63852d11f71dd8b314d3b2f","schema_version":"1.0","event_id":"sha256:4b757a91e5b020f2f6e9368c025b5f180449e43fb63852d11f71dd8b314d3b2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ZYSFUAI2LL6HEGNKPNMQ2TZV2O","target":"graph","payload":{"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"},"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-18T00:01:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FcfQ3DmE1xs9zwf5nXOjnBCEWAyaJLFm17j1cOTxU56nekLvGQROkG469edc32T4CZ1gWfhXHJVpY6eA8MNUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T10:44:06.852088Z"},"content_sha256":"9d61052866c6cb93600356e307eccb95a312d3b56f68bef3abab16358202a4a3","schema_version":"1.0","event_id":"sha256:9d61052866c6cb93600356e307eccb95a312d3b56f68bef3abab16358202a4a3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/bundle.json","state_url":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/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-05-30T10:44:06Z","links":{"resolver":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O","bundle":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/bundle.json","state":"https://pith.science/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZYSFUAI2LL6HEGNKPNMQ2TZV2O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZYSFUAI2LL6HEGNKPNMQ2TZV2O","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":"5e6b45289a5142f95699af9397a0de7c22ce2243e6b0f9bd39deb0eb9389b87b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T18:11:23Z","title_canon_sha256":"bc0b973a435787a0dec9460c774f36827bbf7edfb7547e21d4bceb7cc50129dc"},"schema_version":"1.0","source":{"id":"1704.03479","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1704.03479","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"arxiv_version","alias_value":"1704.03479v2","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.03479","created_at":"2026-05-18T00:01:39Z"},{"alias_kind":"pith_short_12","alias_value":"ZYSFUAI2LL6H","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZYSFUAI2LL6HEGNK","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZYSFUAI2","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:9d61052866c6cb93600356e307eccb95a312d3b56f68bef3abab16358202a4a3","target":"graph","created_at":"2026-05-18T00:01:39Z","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":"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","authors_text":"Benny Sudakov, David Conlon, Jacob Fox","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T18:11:23Z","title":"Tower-type bounds for unavoidable patterns in words"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.03479","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:4b757a91e5b020f2f6e9368c025b5f180449e43fb63852d11f71dd8b314d3b2f","target":"record","created_at":"2026-05-18T00:01:39Z","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":"5e6b45289a5142f95699af9397a0de7c22ce2243e6b0f9bd39deb0eb9389b87b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-04-11T18:11:23Z","title_canon_sha256":"bc0b973a435787a0dec9460c774f36827bbf7edfb7547e21d4bceb7cc50129dc"},"schema_version":"1.0","source":{"id":"1704.03479","kind":"arxiv","version":2}},"canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ce245a011a5afc7219aa7b590d4f35d3927833abfa1347a134aaeb1d6b7249df","first_computed_at":"2026-05-18T00:01:39.176918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:39.176918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zkJg5VCcICNchd6RDEec/mFEaxtTFvNXPthCnD6VQsugt9qfC4p1/3ZKAuA7WabSGjczKAba3PxKyQg4C+GsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:39.177391Z","signed_message":"canonical_sha256_bytes"},"source_id":"1704.03479","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4b757a91e5b020f2f6e9368c025b5f180449e43fb63852d11f71dd8b314d3b2f","sha256:9d61052866c6cb93600356e307eccb95a312d3b56f68bef3abab16358202a4a3"],"state_sha256":"d44c1cf523861f1159ba85f6d3ba863c3452df680b757d0f7aa92018fa7f3e78"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y2hcWJk4X/m7RqEqWiQ+m5nOJ+uSfixfJHpVTouxxhOgEvvHkpeiIuDWcPQbRzxpg9O6ekF/jkmztqkS5g+ZCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T10:44:06.854438Z","bundle_sha256":"886972d43f63fd8fe1191f57507eaa2275c7f36b6e039c733dec404820e7dfd2"}}