{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:GIDIQMPVZULA3ARX7MWLEJISBL","short_pith_number":"pith:GIDIQMPV","schema_version":"1.0","canonical_sha256":"32068831f5cd160d8237fb2cb225120ad49e297f268a2cf534f5553b93478866","source":{"kind":"arxiv","id":"1505.07485","version":1},"attestation_state":"computed","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>="},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.07485","created_at":"2026-05-18T02:00:58.277592+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.07485v1","created_at":"2026-05-18T02:00:58.277592+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.07485","created_at":"2026-05-18T02:00:58.277592+00:00"},{"alias_kind":"pith_short_12","alias_value":"GIDIQMPVZULA","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_16","alias_value":"GIDIQMPVZULA3ARX","created_at":"2026-05-18T12:29:22.688609+00:00"},{"alias_kind":"pith_short_8","alias_value":"GIDIQMPV","created_at":"2026-05-18T12:29:22.688609+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/GIDIQMPVZULA3ARX7MWLEJISBL","json":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL.json","graph_json":"https://pith.science/api/pith-number/GIDIQMPVZULA3ARX7MWLEJISBL/graph.json","events_json":"https://pith.science/api/pith-number/GIDIQMPVZULA3ARX7MWLEJISBL/events.json","paper":"https://pith.science/paper/GIDIQMPV"},"agent_actions":{"view_html":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL","download_json":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL.json","view_paper":"https://pith.science/paper/GIDIQMPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.07485&json=true","fetch_graph":"https://pith.science/api/pith-number/GIDIQMPVZULA3ARX7MWLEJISBL/graph.json","fetch_events":"https://pith.science/api/pith-number/GIDIQMPVZULA3ARX7MWLEJISBL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/action/storage_attestation","attest_author":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/action/author_attestation","sign_citation":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/action/citation_signature","submit_replication":"https://pith.science/pith/GIDIQMPVZULA3ARX7MWLEJISBL/action/replication_record"}},"created_at":"2026-05-18T02:00:58.277592+00:00","updated_at":"2026-05-18T02:00:58.277592+00:00"}