{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:4DDOCFD4XYNGAD42XUTSRF6ZHI","short_pith_number":"pith:4DDOCFD4","canonical_record":{"source":{"id":"1902.05540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-14T18:47:03Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"3dfff0c047f8b1cf29464c4d2c95c92ced315a3ba6460244a30dabf5d0b2c111","abstract_canon_sha256":"32af675bb4ca1f6793ab56c7d62642ba32b7059f2e74b35c1746985d8cf64fb7"},"schema_version":"1.0"},"canonical_sha256":"e0c6e1147cbe1a600f9abd272897d93a34fb37f84d58afd8784471e5cfcae4dc","source":{"kind":"arxiv","id":"1902.05540","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05540","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05540v1","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05540","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"4DDOCFD4XYNG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DDOCFD4XYNGAD42","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DDOCFD4","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:4DDOCFD4XYNGAD42XUTSRF6ZHI","target":"record","payload":{"canonical_record":{"source":{"id":"1902.05540","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-14T18:47:03Z","cross_cats_sorted":["cs.FL"],"title_canon_sha256":"3dfff0c047f8b1cf29464c4d2c95c92ced315a3ba6460244a30dabf5d0b2c111","abstract_canon_sha256":"32af675bb4ca1f6793ab56c7d62642ba32b7059f2e74b35c1746985d8cf64fb7"},"schema_version":"1.0"},"canonical_sha256":"e0c6e1147cbe1a600f9abd272897d93a34fb37f84d58afd8784471e5cfcae4dc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:58.413000Z","signature_b64":"xl4U3XUe1x1d3YIlXwVtgOBMy8+LHdkIQImIbXbTgqvcfsq+gQpoAk+0vGO4tGWeABg+JWbpHKycd9N18ZpKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e0c6e1147cbe1a600f9abd272897d93a34fb37f84d58afd8784471e5cfcae4dc","last_reissued_at":"2026-05-17T23:53:58.412367Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:58.412367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1902.05540","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-05-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"drXcPMTnjGR0IkQ2xez/5JUaXORT7DL45pqOvPJ+ybuxPCwUPLGAmClrXbLfXyBvv3LYvCwpNbLW2Zbpi34tDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:28:11.168974Z"},"content_sha256":"eb00ae613681b9b79643053c4cb11b01315ca0e6acd00e40bacb0a6074d69822","schema_version":"1.0","event_id":"sha256:eb00ae613681b9b79643053c4cb11b01315ca0e6acd00e40bacb0a6074d69822"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:4DDOCFD4XYNGAD42XUTSRF6ZHI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On long words avoiding Zimin patterns","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL"],"primary_cat":"cs.DM","authors_text":"Arnaud Carayol, Stefan G\\\"oller","submitted_at":"2019-02-14T18:47:03Z","abstract_excerpt":"A pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by Zimin and independently by Bean, Ehrenfeucht and McNulty states that a pattern over $n$ distinct variables is unavoidable if, and only if, $p$ itself is encountered in the $n$-th Zimin pattern. Given an alphabet size $k$, we study the minimal length $f(n,k)$ such that every word of length $f(n,k)$ encounters the $n$-th Zimin pattern. It is known that $f$ is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05540","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":""},"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-17T23:53:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MPumPZMUrPj7XI+fNHUb8ou4wg3Iyph/9f0vdvjITE7B1roM2RKzRIIZHcIF+wtDQSs4ZH/dcdbdHtMYsBh+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T15:28:11.169304Z"},"content_sha256":"400090362f15825ca0c3232da2a7629efbe3a6107f8a812e4a325eb4bccd9a9c","schema_version":"1.0","event_id":"sha256:400090362f15825ca0c3232da2a7629efbe3a6107f8a812e4a325eb4bccd9a9c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/bundle.json","state_url":"https://pith.science/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/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-27T15:28:11Z","links":{"resolver":"https://pith.science/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI","bundle":"https://pith.science/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/bundle.json","state":"https://pith.science/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4DDOCFD4XYNGAD42XUTSRF6ZHI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:4DDOCFD4XYNGAD42XUTSRF6ZHI","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":"32af675bb4ca1f6793ab56c7d62642ba32b7059f2e74b35c1746985d8cf64fb7","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-14T18:47:03Z","title_canon_sha256":"3dfff0c047f8b1cf29464c4d2c95c92ced315a3ba6460244a30dabf5d0b2c111"},"schema_version":"1.0","source":{"id":"1902.05540","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1902.05540","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"arxiv_version","alias_value":"1902.05540v1","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.05540","created_at":"2026-05-17T23:53:58Z"},{"alias_kind":"pith_short_12","alias_value":"4DDOCFD4XYNG","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"4DDOCFD4XYNGAD42","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"4DDOCFD4","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:400090362f15825ca0c3232da2a7629efbe3a6107f8a812e4a325eb4bccd9a9c","target":"graph","created_at":"2026-05-17T23:53:58Z","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 pattern is encountered in a word if some infix of the word is the image of the pattern under some non-erasing morphism. A pattern $p$ is unavoidable if, over every finite alphabet, every sufficiently long word encounters $p$. A theorem by Zimin and independently by Bean, Ehrenfeucht and McNulty states that a pattern over $n$ distinct variables is unavoidable if, and only if, $p$ itself is encountered in the $n$-th Zimin pattern. Given an alphabet size $k$, we study the minimal length $f(n,k)$ such that every word of length $f(n,k)$ encounters the $n$-th Zimin pattern. It is known that $f$ is","authors_text":"Arnaud Carayol, Stefan G\\\"oller","cross_cats":["cs.FL"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-14T18:47:03Z","title":"On long words avoiding Zimin patterns"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.05540","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:eb00ae613681b9b79643053c4cb11b01315ca0e6acd00e40bacb0a6074d69822","target":"record","created_at":"2026-05-17T23:53:58Z","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":"32af675bb4ca1f6793ab56c7d62642ba32b7059f2e74b35c1746985d8cf64fb7","cross_cats_sorted":["cs.FL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-02-14T18:47:03Z","title_canon_sha256":"3dfff0c047f8b1cf29464c4d2c95c92ced315a3ba6460244a30dabf5d0b2c111"},"schema_version":"1.0","source":{"id":"1902.05540","kind":"arxiv","version":1}},"canonical_sha256":"e0c6e1147cbe1a600f9abd272897d93a34fb37f84d58afd8784471e5cfcae4dc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e0c6e1147cbe1a600f9abd272897d93a34fb37f84d58afd8784471e5cfcae4dc","first_computed_at":"2026-05-17T23:53:58.412367Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:58.412367Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xl4U3XUe1x1d3YIlXwVtgOBMy8+LHdkIQImIbXbTgqvcfsq+gQpoAk+0vGO4tGWeABg+JWbpHKycd9N18ZpKBw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:58.413000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1902.05540","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:eb00ae613681b9b79643053c4cb11b01315ca0e6acd00e40bacb0a6074d69822","sha256:400090362f15825ca0c3232da2a7629efbe3a6107f8a812e4a325eb4bccd9a9c"],"state_sha256":"4a7f6c42c60fb0d2a16c533db2e5938170fb091c9156990f472fc34f5d359a32"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"te/4gIBfuRx1uLeIlOvymlWI8mk6P/zafcAinutEdTLAlYn8i4WtDbYnGJco8rgS+2Ckj+nBqTV0AehU4oHYAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T15:28:11.171116Z","bundle_sha256":"06d3ab94601e3d7b049ca43de747d54209f6dc662c4d00a164e3f361128fce6a"}}