{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DEJTFOT4CARMRN34XCSOOUT2VV","short_pith_number":"pith:DEJTFOT4","schema_version":"1.0","canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","source":{"kind":"arxiv","id":"1312.5135","version":3},"attestation_state":"computed","paper":{"title":"Successful strategies for a queens placing game on an n x n chess board","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.HO","authors_text":"Thomas Jenrich","submitted_at":"2013-12-18T16:04:02Z","abstract_excerpt":"In his list of open problems, Martin Erickson described a certain game: \"Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is unimportant). The last player who can move wins.\" Then he asked: \"Who should win?\"\n  Obviously, for n up to 3, the first player wins, if he does not miss to start at the central position in the case n=3.\n  In this article, we give very simple always winning strategies for the first player if n is 4 or odd.\n  The additionally (in the source package) provided compute"},"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":"1312.5135","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2013-12-18T16:04:02Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"3da037742244af1f73425d8e9c40cd2de100146a22157092d6f1442ebd59f269","abstract_canon_sha256":"b9bd2e7c2e31c198f1b5fade450ca2e4f5f37beca2b4a57ef77768841bf9f2ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:53.359100Z","signature_b64":"9iTSFLsRvY757sparnfGF2MZ9Vxl3koa0bbmnOn03zTzEYFU5/ShfCr3vxN8OPdYmRUTjOkLWs4wgWVLEn1MAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","last_reissued_at":"2026-05-18T02:53:53.358185Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:53.358185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successful strategies for a queens placing game on an n x n chess board","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.HO","authors_text":"Thomas Jenrich","submitted_at":"2013-12-18T16:04:02Z","abstract_excerpt":"In his list of open problems, Martin Erickson described a certain game: \"Two players alternately put queens on an n x n chess board so that each new queen is not in range of any queen already on the board (the color of the queens is unimportant). The last player who can move wins.\" Then he asked: \"Who should win?\"\n  Obviously, for n up to 3, the first player wins, if he does not miss to start at the central position in the case n=3.\n  In this article, we give very simple always winning strategies for the first player if n is 4 or odd.\n  The additionally (in the source package) provided compute"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5135","kind":"arxiv","version":3},"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":"1312.5135","created_at":"2026-05-18T02:53:53.358340+00:00"},{"alias_kind":"arxiv_version","alias_value":"1312.5135v3","created_at":"2026-05-18T02:53:53.358340+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5135","created_at":"2026-05-18T02:53:53.358340+00:00"},{"alias_kind":"pith_short_12","alias_value":"DEJTFOT4CARM","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DEJTFOT4CARMRN34","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DEJTFOT4","created_at":"2026-05-18T12:27:43.054852+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/DEJTFOT4CARMRN34XCSOOUT2VV","json":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV.json","graph_json":"https://pith.science/api/pith-number/DEJTFOT4CARMRN34XCSOOUT2VV/graph.json","events_json":"https://pith.science/api/pith-number/DEJTFOT4CARMRN34XCSOOUT2VV/events.json","paper":"https://pith.science/paper/DEJTFOT4"},"agent_actions":{"view_html":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV","download_json":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV.json","view_paper":"https://pith.science/paper/DEJTFOT4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1312.5135&json=true","fetch_graph":"https://pith.science/api/pith-number/DEJTFOT4CARMRN34XCSOOUT2VV/graph.json","fetch_events":"https://pith.science/api/pith-number/DEJTFOT4CARMRN34XCSOOUT2VV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/action/storage_attestation","attest_author":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/action/author_attestation","sign_citation":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/action/citation_signature","submit_replication":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/action/replication_record"}},"created_at":"2026-05-18T02:53:53.358340+00:00","updated_at":"2026-05-18T02:53:53.358340+00:00"}