{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VQL2O67M6ENWDBM3W47GW4IEAE","short_pith_number":"pith:VQL2O67M","schema_version":"1.0","canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","source":{"kind":"arxiv","id":"1309.5759","version":1},"attestation_state":"computed","paper":{"title":"Maker-Breaker games on random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrew Beveridge, Andrzej Dudek, Milos Stojakovic, Tobias Muller","submitted_at":"2013-09-23T10:43:16Z","abstract_excerpt":"In a Maker-Breaker game on a graph $G$, Breaker and Maker alternately claim edges of $G$. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between $n$ points chosen uniformly at random in the unit square by order of increasing edge-length then, with probability tending to one as $n\\to\\infty$, the graph becomes Maker-win the very moment it satisfies a simple necessary condition. In particular, with high probabi"},"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":"1309.5759","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T10:43:16Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"6f90e68577aa475591d7a49ed98d75b7e44e5fdf879a27b70f70c3645bca1c32","abstract_canon_sha256":"eca2f43e6460e36ac752772e56add63cf008f38d90e37638e17e83857b23e60e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:12:34.262299Z","signature_b64":"4db1z8gjku0QoyRybQ7G6J2WRrrvr3gDrYpom2QXa71jZ0v54Hdi/IbiMQHxnpTjsjCQ/LVaqSBQckddPRlACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","last_reissued_at":"2026-05-18T03:12:34.261561Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:12:34.261561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maker-Breaker games on random geometric graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Alan Frieze, Andrew Beveridge, Andrzej Dudek, Milos Stojakovic, Tobias Muller","submitted_at":"2013-09-23T10:43:16Z","abstract_excerpt":"In a Maker-Breaker game on a graph $G$, Breaker and Maker alternately claim edges of $G$. Maker wins if, after all edges have been claimed, the graph induced by his edges has some desired property. We consider four Maker-Breaker games played on random geometric graphs. For each of our four games we show that if we add edges between $n$ points chosen uniformly at random in the unit square by order of increasing edge-length then, with probability tending to one as $n\\to\\infty$, the graph becomes Maker-win the very moment it satisfies a simple necessary condition. In particular, with high probabi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5759","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":"1309.5759","created_at":"2026-05-18T03:12:34.261669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.5759v1","created_at":"2026-05-18T03:12:34.261669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5759","created_at":"2026-05-18T03:12:34.261669+00:00"},{"alias_kind":"pith_short_12","alias_value":"VQL2O67M6ENW","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VQL2O67M6ENWDBM3","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VQL2O67M","created_at":"2026-05-18T12:28:04.890932+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/VQL2O67M6ENWDBM3W47GW4IEAE","json":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE.json","graph_json":"https://pith.science/api/pith-number/VQL2O67M6ENWDBM3W47GW4IEAE/graph.json","events_json":"https://pith.science/api/pith-number/VQL2O67M6ENWDBM3W47GW4IEAE/events.json","paper":"https://pith.science/paper/VQL2O67M"},"agent_actions":{"view_html":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE","download_json":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE.json","view_paper":"https://pith.science/paper/VQL2O67M","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.5759&json=true","fetch_graph":"https://pith.science/api/pith-number/VQL2O67M6ENWDBM3W47GW4IEAE/graph.json","fetch_events":"https://pith.science/api/pith-number/VQL2O67M6ENWDBM3W47GW4IEAE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/action/storage_attestation","attest_author":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/action/author_attestation","sign_citation":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/action/citation_signature","submit_replication":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/action/replication_record"}},"created_at":"2026-05-18T03:12:34.261669+00:00","updated_at":"2026-05-18T03:12:34.261669+00:00"}