{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:CQ72W5RHSRXSJL2XUTZFAORCJZ","short_pith_number":"pith:CQ72W5RH","canonical_record":{"source":{"id":"1102.5438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T19:16:17Z","cross_cats_sorted":["cs.DM","cs.DS","math.NT"],"title_canon_sha256":"97510979c83d757e14a04b49410f0556d00154c3dba28dbf1591091c0813877e","abstract_canon_sha256":"0424ae8b67e0cf5e2d1a0ec1f4e64c403a09f4ff147b06258161db3cebbadc4d"},"schema_version":"1.0"},"canonical_sha256":"143fab7627946f24af57a4f2503a224e7edfbd26f5ef9314da6be20a4b04cee6","source":{"kind":"arxiv","id":"1102.5438","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5438","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5438v2","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5438","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CQ72W5RHSRXS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CQ72W5RHSRXSJL2X","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CQ72W5RH","created_at":"2026-05-18T12:26:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:CQ72W5RHSRXSJL2XUTZFAORCJZ","target":"record","payload":{"canonical_record":{"source":{"id":"1102.5438","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T19:16:17Z","cross_cats_sorted":["cs.DM","cs.DS","math.NT"],"title_canon_sha256":"97510979c83d757e14a04b49410f0556d00154c3dba28dbf1591091c0813877e","abstract_canon_sha256":"0424ae8b67e0cf5e2d1a0ec1f4e64c403a09f4ff147b06258161db3cebbadc4d"},"schema_version":"1.0"},"canonical_sha256":"143fab7627946f24af57a4f2503a224e7edfbd26f5ef9314da6be20a4b04cee6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:27.329666Z","signature_b64":"2hliyjflPNRuaTObrfgDxrLt5Dhku8SlYQJ4nbIDHy995yuOG0kKp9ZO1urLQ5a0FPvuoU+yB6VK5ON23qFtAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"143fab7627946f24af57a4f2503a224e7edfbd26f5ef9314da6be20a4b04cee6","last_reissued_at":"2026-05-18T04:24:27.328969Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:27.328969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1102.5438","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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JtiRUgr9lzaMgr0AHDvR+4wI2mCdCPfue763BxKr6zDdd0yAT8eYCDfTS5pmXC4mmt+8YwvZSIe0KiP4oqQiDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T15:42:35.831479Z"},"content_sha256":"b0d705544078fe59118670f1a922f2cb45fe7d3b8c5ad1b3f8b71397da4426b8","schema_version":"1.0","event_id":"sha256:b0d705544078fe59118670f1a922f2cb45fe7d3b8c5ad1b3f8b71397da4426b8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:CQ72W5RHSRXSJL2XUTZFAORCJZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonrepetitive sequences on arithmetic progressions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS","math.NT"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Jaros{\\l}aw Grytczuk, Marcin Witkowski","submitted_at":"2011-02-26T19:16:17Z","abstract_excerpt":"A sequence $S=s_{1}s_{2}..._{n}$ is \\emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization of nonrepetitive sequences involving arithmetic progressions. We prove that for every $k\\geqslant 1$ and every $c\\geqslant 1$ there exist arbitrarily long sequences over at most $(1+\\frac{1}{c})k+18k^{c/c+1}$ symbols whose subsequences indexed by arithmetic progressions with common differences from the set $\\{1,2,...,k\\}$ are nonrepetitive. This improves a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5438","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-18T04:24:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WDUwRG/QH5RJmc+hBE1JebP+RZG0+slv55vJT0OTTkJiZ6BjUjQiYoxNbEMTcHdJZkCzTkqT/UTjsC22EY0ZCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T15:42:35.831835Z"},"content_sha256":"74cbedfa98c2d0dfc323593db80e52726bdc182fcdc5def5bd7f504e0918ae13","schema_version":"1.0","event_id":"sha256:74cbedfa98c2d0dfc323593db80e52726bdc182fcdc5def5bd7f504e0918ae13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/bundle.json","state_url":"https://pith.science/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/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-19T15:42:35Z","links":{"resolver":"https://pith.science/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ","bundle":"https://pith.science/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/bundle.json","state":"https://pith.science/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CQ72W5RHSRXSJL2XUTZFAORCJZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:CQ72W5RHSRXSJL2XUTZFAORCJZ","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":"0424ae8b67e0cf5e2d1a0ec1f4e64c403a09f4ff147b06258161db3cebbadc4d","cross_cats_sorted":["cs.DM","cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T19:16:17Z","title_canon_sha256":"97510979c83d757e14a04b49410f0556d00154c3dba28dbf1591091c0813877e"},"schema_version":"1.0","source":{"id":"1102.5438","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1102.5438","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"arxiv_version","alias_value":"1102.5438v2","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1102.5438","created_at":"2026-05-18T04:24:27Z"},{"alias_kind":"pith_short_12","alias_value":"CQ72W5RHSRXS","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_16","alias_value":"CQ72W5RHSRXSJL2X","created_at":"2026-05-18T12:26:26Z"},{"alias_kind":"pith_short_8","alias_value":"CQ72W5RH","created_at":"2026-05-18T12:26:26Z"}],"graph_snapshots":[{"event_id":"sha256:74cbedfa98c2d0dfc323593db80e52726bdc182fcdc5def5bd7f504e0918ae13","target":"graph","created_at":"2026-05-18T04:24:27Z","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 $S=s_{1}s_{2}..._{n}$ is \\emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization of nonrepetitive sequences involving arithmetic progressions. We prove that for every $k\\geqslant 1$ and every $c\\geqslant 1$ there exist arbitrarily long sequences over at most $(1+\\frac{1}{c})k+18k^{c/c+1}$ symbols whose subsequences indexed by arithmetic progressions with common differences from the set $\\{1,2,...,k\\}$ are nonrepetitive. This improves a p","authors_text":"Jakub Kozik, Jaros{\\l}aw Grytczuk, Marcin Witkowski","cross_cats":["cs.DM","cs.DS","math.NT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T19:16:17Z","title":"Nonrepetitive sequences on arithmetic progressions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1102.5438","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:b0d705544078fe59118670f1a922f2cb45fe7d3b8c5ad1b3f8b71397da4426b8","target":"record","created_at":"2026-05-18T04:24:27Z","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":"0424ae8b67e0cf5e2d1a0ec1f4e64c403a09f4ff147b06258161db3cebbadc4d","cross_cats_sorted":["cs.DM","cs.DS","math.NT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-02-26T19:16:17Z","title_canon_sha256":"97510979c83d757e14a04b49410f0556d00154c3dba28dbf1591091c0813877e"},"schema_version":"1.0","source":{"id":"1102.5438","kind":"arxiv","version":2}},"canonical_sha256":"143fab7627946f24af57a4f2503a224e7edfbd26f5ef9314da6be20a4b04cee6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"143fab7627946f24af57a4f2503a224e7edfbd26f5ef9314da6be20a4b04cee6","first_computed_at":"2026-05-18T04:24:27.328969Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:27.328969Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2hliyjflPNRuaTObrfgDxrLt5Dhku8SlYQJ4nbIDHy995yuOG0kKp9ZO1urLQ5a0FPvuoU+yB6VK5ON23qFtAg==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:27.329666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1102.5438","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0d705544078fe59118670f1a922f2cb45fe7d3b8c5ad1b3f8b71397da4426b8","sha256:74cbedfa98c2d0dfc323593db80e52726bdc182fcdc5def5bd7f504e0918ae13"],"state_sha256":"a298ce82a5dfe056fbad9599e6b576b718cc8ab4ad5e9da3ccce9ae0efb4981d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9Ab4T/Bh7pj+wCJrl0NTXFx0zWJBVVEdaZH27YnFyoxjfqnm4mF7ZHhTW2kmkDw9YMF080iNIWjJHqE91uAOBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T15:42:35.835502Z","bundle_sha256":"bd27ee8a07316865e898b8ddaa2293347988ba4d7713e8b2864ee5409c40227b"}}