{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:FRW44GYF5TREWFTVSW76SUEYNZ","short_pith_number":"pith:FRW44GYF","schema_version":"1.0","canonical_sha256":"2c6dce1b05ece24b167595bfe950986e4e4c6299fa910263219b20282f6d90fd","source":{"kind":"arxiv","id":"1610.07160","version":1},"attestation_state":"computed","paper":{"title":"On Zermelo's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor V. Evstigneev, Rabah Amir","submitted_at":"2016-10-23T12:24:17Z","abstract_excerpt":"A famous result in game theory known as Zermelo's theorem says that \"in chess either White can force a win, or Black can force a win, or both sides can force at least a draw\". The present paper extends this result to the class of all finite-stage two-player games of complete information with alternating moves. It is shown that in any such game either the first player has a winning strategy, or the second player has a winning strategy, or both have unbeatable strategies."},"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":"1610.07160","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-10-23T12:24:17Z","cross_cats_sorted":[],"title_canon_sha256":"8568f345a83b42f6d5973db81dcb6ca7772fa334f79773fa32f4f709b1292fe9","abstract_canon_sha256":"ea789342d4609117cd90b656be658a66de4143ced9314d877a584511f05f747e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:01:35.101953Z","signature_b64":"ohlanaqhdzpuCsgG/VeYskZA5SEF7gkzeuZHMJJPp3BER5qfD3w95e46PkihhIAnNMiybwli3EdQM+CV71S4Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2c6dce1b05ece24b167595bfe950986e4e4c6299fa910263219b20282f6d90fd","last_reissued_at":"2026-05-18T01:01:35.101436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:01:35.101436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On Zermelo's theorem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Igor V. Evstigneev, Rabah Amir","submitted_at":"2016-10-23T12:24:17Z","abstract_excerpt":"A famous result in game theory known as Zermelo's theorem says that \"in chess either White can force a win, or Black can force a win, or both sides can force at least a draw\". The present paper extends this result to the class of all finite-stage two-player games of complete information with alternating moves. It is shown that in any such game either the first player has a winning strategy, or the second player has a winning strategy, or both have unbeatable strategies."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.07160","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1610.07160","created_at":"2026-05-18T01:01:35.101525+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.07160v1","created_at":"2026-05-18T01:01:35.101525+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.07160","created_at":"2026-05-18T01:01:35.101525+00:00"},{"alias_kind":"pith_short_12","alias_value":"FRW44GYF5TRE","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"FRW44GYF5TREWFTV","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"FRW44GYF","created_at":"2026-05-18T12:30:15.759754+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/FRW44GYF5TREWFTVSW76SUEYNZ","json":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ.json","graph_json":"https://pith.science/api/pith-number/FRW44GYF5TREWFTVSW76SUEYNZ/graph.json","events_json":"https://pith.science/api/pith-number/FRW44GYF5TREWFTVSW76SUEYNZ/events.json","paper":"https://pith.science/paper/FRW44GYF"},"agent_actions":{"view_html":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ","download_json":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ.json","view_paper":"https://pith.science/paper/FRW44GYF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.07160&json=true","fetch_graph":"https://pith.science/api/pith-number/FRW44GYF5TREWFTVSW76SUEYNZ/graph.json","fetch_events":"https://pith.science/api/pith-number/FRW44GYF5TREWFTVSW76SUEYNZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ/action/storage_attestation","attest_author":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ/action/author_attestation","sign_citation":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ/action/citation_signature","submit_replication":"https://pith.science/pith/FRW44GYF5TREWFTVSW76SUEYNZ/action/replication_record"}},"created_at":"2026-05-18T01:01:35.101525+00:00","updated_at":"2026-05-18T01:01:35.101525+00:00"}