{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:DEJTFOT4CARMRN34XCSOOUT2VV","short_pith_number":"pith:DEJTFOT4","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"},"canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","source":{"kind":"arxiv","id":"1312.5135","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5135","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5135v3","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5135","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"DEJTFOT4CARM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DEJTFOT4CARMRN34","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DEJTFOT4","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:DEJTFOT4CARMRN34XCSOOUT2VV","target":"record","payload":{"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"},"canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","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"},"source_kind":"arxiv","source_id":"1312.5135","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1G12CWNyQn7QC50DShJrOIxAav5rkRtfnLuH1KR0PwiJh3OCsiSFEtIu5l2XollgSaq40vLQ/WavWJF3zuQRCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:32:44.110747Z"},"content_sha256":"1d1d83ae49be8bf18f472d93e5e0e8d819639c614db04d0235a3906d5b3c119c","schema_version":"1.0","event_id":"sha256:1d1d83ae49be8bf18f472d93e5e0e8d819639c614db04d0235a3906d5b3c119c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:DEJTFOT4CARMRN34XCSOOUT2VV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:53:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kmNj0yA1Dl6e1vOsIwguZByP2oiJk6HCN68IO9m6+Nl0xQJkPZdqyVnr8tOzdvcYMpEvX7cJw0b1SX5tKtUoDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:32:44.111399Z"},"content_sha256":"93da6b4172a038d31b036902c786dcff5a8c4d691456cb2bf72e2d5a0d57a25a","schema_version":"1.0","event_id":"sha256:93da6b4172a038d31b036902c786dcff5a8c4d691456cb2bf72e2d5a0d57a25a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/bundle.json","state_url":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DEJTFOT4CARMRN34XCSOOUT2VV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-24T03:32:44Z","links":{"resolver":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV","bundle":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/bundle.json","state":"https://pith.science/pith/DEJTFOT4CARMRN34XCSOOUT2VV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DEJTFOT4CARMRN34XCSOOUT2VV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DEJTFOT4CARMRN34XCSOOUT2VV","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":"b9bd2e7c2e31c198f1b5fade450ca2e4f5f37beca2b4a57ef77768841bf9f2ed","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2013-12-18T16:04:02Z","title_canon_sha256":"3da037742244af1f73425d8e9c40cd2de100146a22157092d6f1442ebd59f269"},"schema_version":"1.0","source":{"id":"1312.5135","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.5135","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"arxiv_version","alias_value":"1312.5135v3","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.5135","created_at":"2026-05-18T02:53:53Z"},{"alias_kind":"pith_short_12","alias_value":"DEJTFOT4CARM","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"DEJTFOT4CARMRN34","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"DEJTFOT4","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:93da6b4172a038d31b036902c786dcff5a8c4d691456cb2bf72e2d5a0d57a25a","target":"graph","created_at":"2026-05-18T02:53:53Z","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":"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","authors_text":"Thomas Jenrich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2013-12-18T16:04:02Z","title":"Successful strategies for a queens placing game on an n x n chess board"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.5135","kind":"arxiv","version":3},"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:1d1d83ae49be8bf18f472d93e5e0e8d819639c614db04d0235a3906d5b3c119c","target":"record","created_at":"2026-05-18T02:53:53Z","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":"b9bd2e7c2e31c198f1b5fade450ca2e4f5f37beca2b4a57ef77768841bf9f2ed","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.HO","submitted_at":"2013-12-18T16:04:02Z","title_canon_sha256":"3da037742244af1f73425d8e9c40cd2de100146a22157092d6f1442ebd59f269"},"schema_version":"1.0","source":{"id":"1312.5135","kind":"arxiv","version":3}},"canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"191332ba7c1022c8b77cb8a4e7527aad7f00b659cbf0e73fa6c06ba5f76f9445","first_computed_at":"2026-05-18T02:53:53.358185Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:53.358185Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9iTSFLsRvY757sparnfGF2MZ9Vxl3koa0bbmnOn03zTzEYFU5/ShfCr3vxN8OPdYmRUTjOkLWs4wgWVLEn1MAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:53.359100Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.5135","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1d1d83ae49be8bf18f472d93e5e0e8d819639c614db04d0235a3906d5b3c119c","sha256:93da6b4172a038d31b036902c786dcff5a8c4d691456cb2bf72e2d5a0d57a25a"],"state_sha256":"24de8579a4598ac0c09c1e6607c2887b01dea0cd42793e42efb9fc9380c50bfc"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"02yFCJ8k6PGmiQUdvPI5TA+aVLOsgcgeeMchsVTX3URh5I+eyeFLhAa7sp0tKIZqL8nujCaY/ebdm33BYiZnDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:32:44.114265Z","bundle_sha256":"d8a59e6c51793f24a8bf84b7317c471a69265fc875b92d2b40b8158249d7d12b"}}