{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6KZQ3UTKDWJQFLD3ST6AKKMQDV","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":"4809cb5810af6034b24d87c9d2f9d8c0d4844ff586324ebedd919c45a8a09439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-25T15:52:25Z","title_canon_sha256":"0470c7020576042f3015887b72e100a93760ca4ced8672abc3a499cfef153e8e"},"schema_version":"1.0","source":{"id":"1907.11152","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.11152","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"1907.11152v1","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.11152","created_at":"2026-05-17T23:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"6KZQ3UTKDWJQ","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6KZQ3UTKDWJQFLD3","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6KZQ3UTK","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:ed022a560a5aff86f5cb345c47d62fc892cf1eb373a019b1ea269c0e9dfd17cc","target":"graph","created_at":"2026-05-17T23:39:33Z","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":"Consider the following game played by Maker and Breaker on the vertices of the cycle $C_{n}$, with first move given to Breaker. The aim of Maker is to maximise the number of adjacent pairs of vertices that are both claimed by her, and the aim of Breaker is to minimise this number. The aim of this paper is to find this number exactly for all $n$ when both players play optimally, answering a related question of Dowden, Kang, Mikala\\v{c}ki and Stojakovi\\'{c}.","authors_text":"Eero Raty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-25T15:52:25Z","title":"An Achievement Game on a Cycle"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.11152","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:3332f5884b473aa4420ea8cc9ac1198d7ff5c2b8e982ffcd465e150d0f29a447","target":"record","created_at":"2026-05-17T23:39:33Z","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":"4809cb5810af6034b24d87c9d2f9d8c0d4844ff586324ebedd919c45a8a09439","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-07-25T15:52:25Z","title_canon_sha256":"0470c7020576042f3015887b72e100a93760ca4ced8672abc3a499cfef153e8e"},"schema_version":"1.0","source":{"id":"1907.11152","kind":"arxiv","version":1}},"canonical_sha256":"f2b30dd26a1d9302ac7b94fc0529901d62750395ba61e75e40cf8331a33fd177","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2b30dd26a1d9302ac7b94fc0529901d62750395ba61e75e40cf8331a33fd177","first_computed_at":"2026-05-17T23:39:33.129581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:33.129581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p7VgtmmXJIs6lq2y4rh8PklKLmbWuQRkPlcPOIZB1bDm5J+yZoctJKsb1JwmfKhlJTrx68J7qidnIa0BG9w/DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:33.130069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.11152","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3332f5884b473aa4420ea8cc9ac1198d7ff5c2b8e982ffcd465e150d0f29a447","sha256:ed022a560a5aff86f5cb345c47d62fc892cf1eb373a019b1ea269c0e9dfd17cc"],"state_sha256":"d74c5aec8517f0efd3954760a993b25c6c0ef7129a9cd457302278b7b1b5d389"}