{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:U7GXFNIA3J6JE4NYI5TLML44ZH","short_pith_number":"pith:U7GXFNIA","canonical_record":{"source":{"id":"1201.5597","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-01-26T18:26:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb82a8f77d693529dbafd8e49bb44ad19223a7cd91c5f25f47775e188e512738","abstract_canon_sha256":"ea836186bfb93f361d40a8e5e6ed99e6d39759d54876716c2d7af7e7bd0c6661"},"schema_version":"1.0"},"canonical_sha256":"a7cd72b500da7c9271b84766b62f9cc9c227a0d034499fed618a6cdf9c726453","source":{"kind":"arxiv","id":"1201.5597","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5597","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5597v4","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5597","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"U7GXFNIA3J6J","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U7GXFNIA3J6JE4NY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U7GXFNIA","created_at":"2026-05-18T12:27:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:U7GXFNIA3J6JE4NYI5TLML44ZH","target":"record","payload":{"canonical_record":{"source":{"id":"1201.5597","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-01-26T18:26:57Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"eb82a8f77d693529dbafd8e49bb44ad19223a7cd91c5f25f47775e188e512738","abstract_canon_sha256":"ea836186bfb93f361d40a8e5e6ed99e6d39759d54876716c2d7af7e7bd0c6661"},"schema_version":"1.0"},"canonical_sha256":"a7cd72b500da7c9271b84766b62f9cc9c227a0d034499fed618a6cdf9c726453","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:55:35.345799Z","signature_b64":"VCo7+VQQuNaFwwEHsB0dITtOEcSwwWv40H0fjDQQmcxKmH9FTzxeVPgozcraq17xQJXPCqmF3mhjUw3sCZDuAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cd72b500da7c9271b84766b62f9cc9c227a0d034499fed618a6cdf9c726453","last_reissued_at":"2026-05-18T03:55:35.345138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:55:35.345138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1201.5597","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HKE3kGzOOHHl8H9pPuJskixHKXZFGasWfghs1uffvjxgGiHmPTN8VxRBwm48MZpU/XybGzGzW0SzClDdxQO0DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:12:43.071622Z"},"content_sha256":"814939c17a2775a774eded02e3a9431a5ba7cee8852ee00a9cb802d19383a31c","schema_version":"1.0","event_id":"sha256:814939c17a2775a774eded02e3a9431a5ba7cee8852ee00a9cb802d19383a31c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:U7GXFNIA3J6JE4NYI5TLML44ZH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The mate-in-n problem of infinite chess is decidable","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"math.LO","authors_text":"Dan Brumleve, Joel David Hamkins, Philipp Schlicht","submitted_at":"2012-01-26T18:26:57Z","abstract_excerpt":"Infinite chess is chess played on an infinite edgeless chessboard. The familiar chess pieces move about according to their usual chess rules, and each player strives to place the opposing king into checkmate. The mate-in-n problem of infinite chess is the problem of determining whether a designated player can force a win from a given finite position in at most n moves. A naive formulation of this problem leads to assertions of high arithmetic complexity with 2n alternating quantifiers---there is a move for white, such that for every black reply, there is a counter-move for white, and so on. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5597","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:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JY93v2nmaz+OisJCVsaYuwOQq0XPFUO7HPTwFTp+bXlv8FxeGtg5LzKwIBOTmsUKAoarsaeE8Ud2gTKMVE+zBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T19:12:43.072251Z"},"content_sha256":"0ab5f7c4a0aa6a403348154d063742b35287329da9c2d6b3443ddc056c9ceeeb","schema_version":"1.0","event_id":"sha256:0ab5f7c4a0aa6a403348154d063742b35287329da9c2d6b3443ddc056c9ceeeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/bundle.json","state_url":"https://pith.science/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/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-07T19:12:43Z","links":{"resolver":"https://pith.science/pith/U7GXFNIA3J6JE4NYI5TLML44ZH","bundle":"https://pith.science/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/bundle.json","state":"https://pith.science/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U7GXFNIA3J6JE4NYI5TLML44ZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:U7GXFNIA3J6JE4NYI5TLML44ZH","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":"ea836186bfb93f361d40a8e5e6ed99e6d39759d54876716c2d7af7e7bd0c6661","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-01-26T18:26:57Z","title_canon_sha256":"eb82a8f77d693529dbafd8e49bb44ad19223a7cd91c5f25f47775e188e512738"},"schema_version":"1.0","source":{"id":"1201.5597","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.5597","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"arxiv_version","alias_value":"1201.5597v4","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.5597","created_at":"2026-05-18T03:55:35Z"},{"alias_kind":"pith_short_12","alias_value":"U7GXFNIA3J6J","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_16","alias_value":"U7GXFNIA3J6JE4NY","created_at":"2026-05-18T12:27:23Z"},{"alias_kind":"pith_short_8","alias_value":"U7GXFNIA","created_at":"2026-05-18T12:27:23Z"}],"graph_snapshots":[{"event_id":"sha256:0ab5f7c4a0aa6a403348154d063742b35287329da9c2d6b3443ddc056c9ceeeb","target":"graph","created_at":"2026-05-18T03:55:35Z","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":"Infinite chess is chess played on an infinite edgeless chessboard. The familiar chess pieces move about according to their usual chess rules, and each player strives to place the opposing king into checkmate. The mate-in-n problem of infinite chess is the problem of determining whether a designated player can force a win from a given finite position in at most n moves. A naive formulation of this problem leads to assertions of high arithmetic complexity with 2n alternating quantifiers---there is a move for white, such that for every black reply, there is a counter-move for white, and so on. In","authors_text":"Dan Brumleve, Joel David Hamkins, Philipp Schlicht","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-01-26T18:26:57Z","title":"The mate-in-n problem of infinite chess is decidable"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.5597","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:814939c17a2775a774eded02e3a9431a5ba7cee8852ee00a9cb802d19383a31c","target":"record","created_at":"2026-05-18T03:55:35Z","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":"ea836186bfb93f361d40a8e5e6ed99e6d39759d54876716c2d7af7e7bd0c6661","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.LO","submitted_at":"2012-01-26T18:26:57Z","title_canon_sha256":"eb82a8f77d693529dbafd8e49bb44ad19223a7cd91c5f25f47775e188e512738"},"schema_version":"1.0","source":{"id":"1201.5597","kind":"arxiv","version":4}},"canonical_sha256":"a7cd72b500da7c9271b84766b62f9cc9c227a0d034499fed618a6cdf9c726453","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a7cd72b500da7c9271b84766b62f9cc9c227a0d034499fed618a6cdf9c726453","first_computed_at":"2026-05-18T03:55:35.345138Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:55:35.345138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VCo7+VQQuNaFwwEHsB0dITtOEcSwwWv40H0fjDQQmcxKmH9FTzxeVPgozcraq17xQJXPCqmF3mhjUw3sCZDuAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:55:35.345799Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.5597","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:814939c17a2775a774eded02e3a9431a5ba7cee8852ee00a9cb802d19383a31c","sha256:0ab5f7c4a0aa6a403348154d063742b35287329da9c2d6b3443ddc056c9ceeeb"],"state_sha256":"3c353cfbc9bb0421c0d9c536de016af11d361844b44f6deadbd06c924f156450"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Xur0eLYRZoUaYATtijOjOkNdIIbGajZJ+Yh0jI92C5KKYEhpcMGmqxSmyLry6x1gWoxVub5TmKXls9zAOnGDDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T19:12:43.075511Z","bundle_sha256":"dd9fb9a559c183f5e32cb61aa23b01fa2ddd06537dd39cdc58a4c32b3c3440d9"}}