{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ZOTSM44R3GYJP6527SFZ5PLJES","short_pith_number":"pith:ZOTSM44R","schema_version":"1.0","canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","source":{"kind":"arxiv","id":"1109.2341","version":4},"attestation_state":"computed","paper":{"title":"Guaranteed successful strategies for a square achievement game on an n by n grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Thomas Jenrich","submitted_at":"2011-09-11T19:18:53Z","abstract_excerpt":"At some places (see the references) Martin Erickson describes a certain game:\n  \"Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner.\"\n  Then he asks \"What is the outcome of the game given optimal play?\" or\n  \"What is the smallest n such that the first player has a winning strategy?\"\n  For n lower than 3 a win is obviously impossible.\n  The aim of this article and the additionally (in the source package) provi"},"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":"1109.2341","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-11T19:18:53Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"bbb5e67d64868ff2dd04fac75723847899718ae86b454b072f520452d553a725","abstract_canon_sha256":"721d839e72576129b3159d118ccd3c6e8272a0e297378a3716c39b62afa892ba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:14.142951Z","signature_b64":"n8KgCkc5E7HofkojVH1zIMnwnjhTuEu+t1pv+R1SEG81F8BW91XYLhnD9sbATwr2AHUDN/XqhgUA5xF+gu7mDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","last_reissued_at":"2026-05-18T03:55:14.142427Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:14.142427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Guaranteed successful strategies for a square achievement game on an n by n grid","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"Thomas Jenrich","submitted_at":"2011-09-11T19:18:53Z","abstract_excerpt":"At some places (see the references) Martin Erickson describes a certain game:\n  \"Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of an n x n grid. The first player (if any) to occupy four cells at the vertices of a square with horizontal and vertical sides is the winner.\"\n  Then he asks \"What is the outcome of the game given optimal play?\" or\n  \"What is the smallest n such that the first player has a winning strategy?\"\n  For n lower than 3 a win is obviously impossible.\n  The aim of this article and the additionally (in the source package) provi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2341","kind":"arxiv","version":4},"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":"1109.2341","created_at":"2026-05-18T03:55:14.142515+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.2341v4","created_at":"2026-05-18T03:55:14.142515+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2341","created_at":"2026-05-18T03:55:14.142515+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOTSM44R3GYJ","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOTSM44R3GYJP652","created_at":"2026-05-18T12:26:50.516681+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOTSM44R","created_at":"2026-05-18T12:26:50.516681+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/ZOTSM44R3GYJP6527SFZ5PLJES","json":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES.json","graph_json":"https://pith.science/api/pith-number/ZOTSM44R3GYJP6527SFZ5PLJES/graph.json","events_json":"https://pith.science/api/pith-number/ZOTSM44R3GYJP6527SFZ5PLJES/events.json","paper":"https://pith.science/paper/ZOTSM44R"},"agent_actions":{"view_html":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES","download_json":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES.json","view_paper":"https://pith.science/paper/ZOTSM44R","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.2341&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOTSM44R3GYJP6527SFZ5PLJES/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOTSM44R3GYJP6527SFZ5PLJES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/action/storage_attestation","attest_author":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/action/author_attestation","sign_citation":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/action/citation_signature","submit_replication":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/action/replication_record"}},"created_at":"2026-05-18T03:55:14.142515+00:00","updated_at":"2026-05-18T03:55:14.142515+00:00"}