{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:WEQJMT4BOF6H2W6PQIYJOGGLK2","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":"0177ad3da67f61ffe460e49b87203a942d1ac219f3670315a76502f5c9b51863","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-19T21:16:08Z","title_canon_sha256":"e8ce859ac6b681200af26382aa6cf391af4e3e7cddda6b0ccfbf45c9f3a3c45c"},"schema_version":"1.0","source":{"id":"1103.3809","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1103.3809","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"arxiv_version","alias_value":"1103.3809v2","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3809","created_at":"2026-05-18T02:39:38Z"},{"alias_kind":"pith_short_12","alias_value":"WEQJMT4BOF6H","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_16","alias_value":"WEQJMT4BOF6H2W6P","created_at":"2026-05-18T12:26:44Z"},{"alias_kind":"pith_short_8","alias_value":"WEQJMT4B","created_at":"2026-05-18T12:26:44Z"}],"graph_snapshots":[{"event_id":"sha256:b418331e6b92ad2c803d3b114d17f6348784cdaa6c445c69d6c61da9927b4573","target":"graph","created_at":"2026-05-18T02:39:38Z","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 sequence is nonrepetitive if it does not contain two adjacent identical blocks. The remarkable construction of Thue asserts that 3 symbols are enough to build an arbitrarily long nonrepetitive sequence. It is still not settled whether the following extension holds: for every sequence of 3-element sets $L_1,..., L_n$ there exists a nonrepetitive sequence $s_1, ..., s_n$ with $s_i\\in L_i$. Applying the probabilistic method one can prove that this is true for sufficiently large sets $L_i$. We present an elementary proof that sets of size 4 suffice (confirming the best known bound). The argument","authors_text":"Jakub Kozik, Jaros{\\l}aw Grytczuk, Piotr Micek","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-19T21:16:08Z","title":"A new approach to nonrepetitive sequences"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3809","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:32c0b204db188fd873dc5e468d6358746cdc9fdbca5293fa7a87633e89511af7","target":"record","created_at":"2026-05-18T02:39:38Z","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":"0177ad3da67f61ffe460e49b87203a942d1ac219f3670315a76502f5c9b51863","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-19T21:16:08Z","title_canon_sha256":"e8ce859ac6b681200af26382aa6cf391af4e3e7cddda6b0ccfbf45c9f3a3c45c"},"schema_version":"1.0","source":{"id":"1103.3809","kind":"arxiv","version":2}},"canonical_sha256":"b120964f81717c7d5bcf82309718cb56b9d191dca88ae298dabcf124fd3827b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b120964f81717c7d5bcf82309718cb56b9d191dca88ae298dabcf124fd3827b2","first_computed_at":"2026-05-18T02:39:38.473780Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:39:38.473780Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/MNHSe03F1te+1DdY5fjqAONWcythm1+Jp2+9DLSRSGxuQep14wFy8DLWbogOmxpi6LlUA/sHoslYpjHAZ2DAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:39:38.474164Z","signed_message":"canonical_sha256_bytes"},"source_id":"1103.3809","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:32c0b204db188fd873dc5e468d6358746cdc9fdbca5293fa7a87633e89511af7","sha256:b418331e6b92ad2c803d3b114d17f6348784cdaa6c445c69d6c61da9927b4573"],"state_sha256":"87a674862f9f7ddbd4735c0f62a7a0b169ceff5b7d19e4c1eec894852d1f0744"}