{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:JHRMDPRZ3V6KNEDXXYZKTUDITV","short_pith_number":"pith:JHRMDPRZ","schema_version":"1.0","canonical_sha256":"49e2c1be39dd7ca69077be32a9d0689d79a4968cbc642ecd3a9705537c95957f","source":{"kind":"arxiv","id":"1103.3810","version":2},"attestation_state":"computed","paper":{"title":"Nonrepetitive games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Jaros{\\l}aw Grytczuk, Piotr Micek","submitted_at":"2011-03-19T21:22:37Z","abstract_excerpt":"(Note. The results of this manuscript has been merged and published with another paper of the same authors: A new approach to nonrepetitve sequences.)\n  A repetition of size $h$ ($h\\geqslant1$) in a given sequence is a subsequence of consecutive terms of the form: $xx=x_1... x_hx_1... x_h$. A sequence is nonrepetitive if it does not contain a repetition of any size. The remarkable construction of Thue asserts that 3 different symbols are enough to build an arbitrarily long nonrepetitive sequence. We consider game-theoretic versions of results on nonrepetitive sequences. A nonrepetitive game is"},"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":"1103.3810","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-03-19T21:22:37Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"a8ea0f5ac024f25e1a6f7cbd1026918f911ac293635b32143f342b40d98fe816","abstract_canon_sha256":"947b9a411d28bfd1454d2aad511b967c5c4d1ad55e6efc430b45a34c7687c442"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:52.616670Z","signature_b64":"RQuVKYlJX81Yi4YR3mqwrsLU+CgxqTcnS6lFbwRSgD8llmnERbt/Rt1tLcncCP7yYcFtXroiVfQhp2DSY4cuDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"49e2c1be39dd7ca69077be32a9d0689d79a4968cbc642ecd3a9705537c95957f","last_reissued_at":"2026-05-18T04:07:52.615986Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:52.615986Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Nonrepetitive games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Jakub Kozik, Jaros{\\l}aw Grytczuk, Piotr Micek","submitted_at":"2011-03-19T21:22:37Z","abstract_excerpt":"(Note. The results of this manuscript has been merged and published with another paper of the same authors: A new approach to nonrepetitve sequences.)\n  A repetition of size $h$ ($h\\geqslant1$) in a given sequence is a subsequence of consecutive terms of the form: $xx=x_1... x_hx_1... x_h$. A sequence is nonrepetitive if it does not contain a repetition of any size. The remarkable construction of Thue asserts that 3 different symbols are enough to build an arbitrarily long nonrepetitive sequence. We consider game-theoretic versions of results on nonrepetitive sequences. A nonrepetitive game is"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.3810","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":"1103.3810","created_at":"2026-05-18T04:07:52.616084+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.3810v2","created_at":"2026-05-18T04:07:52.616084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.3810","created_at":"2026-05-18T04:07:52.616084+00:00"},{"alias_kind":"pith_short_12","alias_value":"JHRMDPRZ3V6K","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_16","alias_value":"JHRMDPRZ3V6KNEDX","created_at":"2026-05-18T12:26:32.869790+00:00"},{"alias_kind":"pith_short_8","alias_value":"JHRMDPRZ","created_at":"2026-05-18T12:26:32.869790+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/JHRMDPRZ3V6KNEDXXYZKTUDITV","json":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV.json","graph_json":"https://pith.science/api/pith-number/JHRMDPRZ3V6KNEDXXYZKTUDITV/graph.json","events_json":"https://pith.science/api/pith-number/JHRMDPRZ3V6KNEDXXYZKTUDITV/events.json","paper":"https://pith.science/paper/JHRMDPRZ"},"agent_actions":{"view_html":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV","download_json":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV.json","view_paper":"https://pith.science/paper/JHRMDPRZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.3810&json=true","fetch_graph":"https://pith.science/api/pith-number/JHRMDPRZ3V6KNEDXXYZKTUDITV/graph.json","fetch_events":"https://pith.science/api/pith-number/JHRMDPRZ3V6KNEDXXYZKTUDITV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV/action/storage_attestation","attest_author":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV/action/author_attestation","sign_citation":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV/action/citation_signature","submit_replication":"https://pith.science/pith/JHRMDPRZ3V6KNEDXXYZKTUDITV/action/replication_record"}},"created_at":"2026-05-18T04:07:52.616084+00:00","updated_at":"2026-05-18T04:07:52.616084+00:00"}