{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:GIDIQMPVZULA3ARX7MWLEJISBL","short_pith_number":"pith:GIDIQMPV","canonical_record":{"source":{"id":"1505.07485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T20:23:34Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"a53450e21e46aa506cc942ed5be659d9f6454cef71f901f41fa18b06d5e0e75a","abstract_canon_sha256":"9e41d207491c3b66977ece44ca387012f0a128eace7b0b055b47b88ed42b5057"},"schema_version":"1.0"},"canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","source":{"kind":"arxiv","id":"1505.07485","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07485","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07485v1","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07485","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"GIDIQMPVZULA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GIDIQMPVZULA3ARX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GIDIQMPV","created_at":"2026-05-18T12:29:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:GIDIQMPVZULA3ARX7MWLEJISBL","target":"record","payload":{"canonical_record":{"source":{"id":"1505.07485","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T20:23:34Z","cross_cats_sorted":["math-ph","math.CO","math.MP"],"title_canon_sha256":"a53450e21e46aa506cc942ed5be659d9f6454cef71f901f41fa18b06d5e0e75a","abstract_canon_sha256":"9e41d207491c3b66977ece44ca387012f0a128eace7b0b055b47b88ed42b5057"},"schema_version":"1.0"},"canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:00:58.278016Z","signature_b64":"ELbSHn0JZF3cFV8i47Key/IeD19a4z4rq1XzbZsUwQUt1RL200fKChJhLHo7mXSfj5CgPPkT2BDemZYp4+UwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","last_reissued_at":"2026-05-18T02:00:58.277515Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:00:58.277515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.07485","source_version":1,"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:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4BG3n++iW554h0r17W3lkIMZwAtjnztf8rG8N6vDm45GguRKVp56C+eDL6xmkKy1JDgq4wCxobT8eFQAIUikDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:52:25.399043Z"},"content_sha256":"0193d1e36818b1e2c48dbd451c92467a277c7a42607eb2f359e7c21c5fdee02a","schema_version":"1.0","event_id":"sha256:0193d1e36818b1e2c48dbd451c92467a277c7a42607eb2f359e7c21c5fdee02a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:GIDIQMPVZULA3ARX7MWLEJISBL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Games on Random Boards","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.CO","math.MP"],"primary_cat":"math.PR","authors_text":"Alexander E. Holroyd, James B. Martin, Johan W\\\"astlund, Riddhipratim Basu","submitted_at":"2015-05-27T20:23:34Z","abstract_excerpt":"We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with optimal play on percolation clusters of Euclidean lattices.\n  On Z^2 with two different percolation parameters for odd and even sites, we prove that the game has no draws provided closed sites of one parity are sufficiently rare compared with those of the other parity (thus favoring one player). We prove this also for certain d-dimensional lattices with d>="},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07485","kind":"arxiv","version":1},"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:00:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ofgNRtT2cYYSas5CqCQKp2tNJ4sMkOgRYvl9+LK2ETkQN8+4S9AM6E+g4Gi5E8r7iq2xcNWFhrA79hahH8qKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T06:52:25.399406Z"},"content_sha256":"11444bc4a5486144496892ff81629be6b9522b9e40116d17451ae28a33f69e97","schema_version":"1.0","event_id":"sha256:11444bc4a5486144496892ff81629be6b9522b9e40116d17451ae28a33f69e97"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/bundle.json","state_url":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GIDIQMPVZULA3ARX7MWLEJISBL/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-01T06:52:25Z","links":{"resolver":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL","bundle":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/bundle.json","state":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GIDIQMPVZULA3ARX7MWLEJISBL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:GIDIQMPVZULA3ARX7MWLEJISBL","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":"9e41d207491c3b66977ece44ca387012f0a128eace7b0b055b47b88ed42b5057","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T20:23:34Z","title_canon_sha256":"a53450e21e46aa506cc942ed5be659d9f6454cef71f901f41fa18b06d5e0e75a"},"schema_version":"1.0","source":{"id":"1505.07485","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.07485","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"arxiv_version","alias_value":"1505.07485v1","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07485","created_at":"2026-05-18T02:00:58Z"},{"alias_kind":"pith_short_12","alias_value":"GIDIQMPVZULA","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_16","alias_value":"GIDIQMPVZULA3ARX","created_at":"2026-05-18T12:29:22Z"},{"alias_kind":"pith_short_8","alias_value":"GIDIQMPV","created_at":"2026-05-18T12:29:22Z"}],"graph_snapshots":[{"event_id":"sha256:11444bc4a5486144496892ff81629be6b9522b9e40116d17451ae28a33f69e97","target":"graph","created_at":"2026-05-18T02:00:58Z","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":"We consider the following two-player game on a graph. A token is located at a vertex, and the players take turns to move it along an edge to a vertex that has not been visited before. A player who cannot move loses. We analyze outcomes with optimal play on percolation clusters of Euclidean lattices.\n  On Z^2 with two different percolation parameters for odd and even sites, we prove that the game has no draws provided closed sites of one parity are sufficiently rare compared with those of the other parity (thus favoring one player). We prove this also for certain d-dimensional lattices with d>=","authors_text":"Alexander E. Holroyd, James B. Martin, Johan W\\\"astlund, Riddhipratim Basu","cross_cats":["math-ph","math.CO","math.MP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T20:23:34Z","title":"Games on Random Boards"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.07485","kind":"arxiv","version":1},"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:0193d1e36818b1e2c48dbd451c92467a277c7a42607eb2f359e7c21c5fdee02a","target":"record","created_at":"2026-05-18T02:00:58Z","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":"9e41d207491c3b66977ece44ca387012f0a128eace7b0b055b47b88ed42b5057","cross_cats_sorted":["math-ph","math.CO","math.MP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2015-05-27T20:23:34Z","title_canon_sha256":"a53450e21e46aa506cc942ed5be659d9f6454cef71f901f41fa18b06d5e0e75a"},"schema_version":"1.0","source":{"id":"1505.07485","kind":"arxiv","version":1}},"canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","first_computed_at":"2026-05-18T02:00:58.277515Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:00:58.277515Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ELbSHn0JZF3cFV8i47Key/IeD19a4z4rq1XzbZsUwQUt1RL200fKChJhLHo7mXSfj5CgPPkT2BDemZYp4+UwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:00:58.278016Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.07485","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0193d1e36818b1e2c48dbd451c92467a277c7a42607eb2f359e7c21c5fdee02a","sha256:11444bc4a5486144496892ff81629be6b9522b9e40116d17451ae28a33f69e97"],"state_sha256":"57326ca8f31c20bdb32a43ecaa8c9e63dd9ce0a135a1620a5bacf17583331c1c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C94nJa0rlddHIDgmrG8bfY4tvTX8wYqy9lE6vxvglOd9vhOWWSfj3j3lI1kEhXNdZiYTxisR4oO7qRGZhYO4Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T06:52:25.401574Z","bundle_sha256":"fb6018aac939a3688a12a32db9b24b2fe5b59b3277f90f20456e501c486e92a7"}}