{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ZOTSM44R3GYJP6527SFZ5PLJES","short_pith_number":"pith:ZOTSM44R","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"},"canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","source":{"kind":"arxiv","id":"1109.2341","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2341","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2341v4","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2341","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZOTSM44R3GYJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZOTSM44R3GYJP652","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZOTSM44R","created_at":"2026-05-18T12:26:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ZOTSM44R3GYJP6527SFZ5PLJES","target":"record","payload":{"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"},"canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","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"},"source_kind":"arxiv","source_id":"1109.2341","source_version":4,"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-18T03:55:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ztfb61lXYDBv2rw8SE/ORQ+L1lIvFqvH4QDkdl24tBlrDsLHg0fMm3AjQJWmMalWIYrsnnjMfa1nUWHHfKE3Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:55:46.167871Z"},"content_sha256":"e3d368fd8f609b06465ac0fa0bf7de7a3fdc7af40b584ec99857e8866211e99f","schema_version":"1.0","event_id":"sha256:e3d368fd8f609b06465ac0fa0bf7de7a3fdc7af40b584ec99857e8866211e99f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ZOTSM44R3GYJP6527SFZ5PLJES","target":"graph","payload":{"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"},"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-18T03:55:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5o4+2utNxAdV+RhS6KnjweZ9TMzqMN499FEGF1IUOo+ixw31LXAvLBuAyzmQE4PF+FK5rrnb2C9q1o6yx8ETAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-24T03:55:46.168214Z"},"content_sha256":"746101a3d34e028513a7f14724c4fe2d467495696f6d5ae6adf5dcb735571000","schema_version":"1.0","event_id":"sha256:746101a3d34e028513a7f14724c4fe2d467495696f6d5ae6adf5dcb735571000"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/bundle.json","state_url":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZOTSM44R3GYJP6527SFZ5PLJES/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:55:46Z","links":{"resolver":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES","bundle":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/bundle.json","state":"https://pith.science/pith/ZOTSM44R3GYJP6527SFZ5PLJES/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZOTSM44R3GYJP6527SFZ5PLJES/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ZOTSM44R3GYJP6527SFZ5PLJES","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":"721d839e72576129b3159d118ccd3c6e8272a0e297378a3716c39b62afa892ba","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-11T19:18:53Z","title_canon_sha256":"bbb5e67d64868ff2dd04fac75723847899718ae86b454b072f520452d553a725"},"schema_version":"1.0","source":{"id":"1109.2341","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1109.2341","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"arxiv_version","alias_value":"1109.2341v4","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.2341","created_at":"2026-05-18T03:55:14Z"},{"alias_kind":"pith_short_12","alias_value":"ZOTSM44R3GYJ","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_16","alias_value":"ZOTSM44R3GYJP652","created_at":"2026-05-18T12:26:50Z"},{"alias_kind":"pith_short_8","alias_value":"ZOTSM44R","created_at":"2026-05-18T12:26:50Z"}],"graph_snapshots":[{"event_id":"sha256:746101a3d34e028513a7f14724c4fe2d467495696f6d5ae6adf5dcb735571000","target":"graph","created_at":"2026-05-18T03:55:14Z","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":"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","authors_text":"Thomas Jenrich","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-11T19:18:53Z","title":"Guaranteed successful strategies for a square achievement game on an n by n grid"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.2341","kind":"arxiv","version":4},"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:e3d368fd8f609b06465ac0fa0bf7de7a3fdc7af40b584ec99857e8866211e99f","target":"record","created_at":"2026-05-18T03:55:14Z","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":"721d839e72576129b3159d118ccd3c6e8272a0e297378a3716c39b62afa892ba","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-09-11T19:18:53Z","title_canon_sha256":"bbb5e67d64868ff2dd04fac75723847899718ae86b454b072f520452d553a725"},"schema_version":"1.0","source":{"id":"1109.2341","kind":"arxiv","version":4}},"canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cba7267391d9b097fbbafc8b9ebd69249001229270535f25546c3a8d099dd356","first_computed_at":"2026-05-18T03:55:14.142427Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:14.142427Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"n8KgCkc5E7HofkojVH1zIMnwnjhTuEu+t1pv+R1SEG81F8BW91XYLhnD9sbATwr2AHUDN/XqhgUA5xF+gu7mDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:14.142951Z","signed_message":"canonical_sha256_bytes"},"source_id":"1109.2341","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3d368fd8f609b06465ac0fa0bf7de7a3fdc7af40b584ec99857e8866211e99f","sha256:746101a3d34e028513a7f14724c4fe2d467495696f6d5ae6adf5dcb735571000"],"state_sha256":"05dcb6f6ff45fbdc058ff2425ac4830fba3e3604dc9a64829d55ea0d2866dca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x8ZsC8HRHV8cAe9UDR7dUt8lEmyhcASKlh+M/l8kUt+W0Qy+uXEHTQN28BuHwvtuhxI/Kk2Bz4BCr8LuZ2FkBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-24T03:55:46.170125Z","bundle_sha256":"e3080465bde638d65807696b6e667b80b7d8d175eeab3e05356b49207b93ca68"}}