{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:VQL2O67M6ENWDBM3W47GW4IEAE","short_pith_number":"pith:VQL2O67M","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"},"canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","source":{"kind":"arxiv","id":"1309.5759","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5759","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5759v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5759","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"VQL2O67M6ENW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQL2O67M6ENWDBM3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQL2O67M","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:VQL2O67M6ENWDBM3W47GW4IEAE","target":"record","payload":{"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"},"canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","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"},"source_kind":"arxiv","source_id":"1309.5759","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-18T03:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ongwhxQCKPo7cGzQz52txu+er6segRTZjmE8GqtHBbMpNcHiYf1Nxqv4xwH/4hbMs8WV/o2yZeaJDW7jVHAIAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:57:13.418278Z"},"content_sha256":"3ab4785f67204e40012ba99948c086b453d9bb29aaed8cf8b00b3d058e44b5d2","schema_version":"1.0","event_id":"sha256:3ab4785f67204e40012ba99948c086b453d9bb29aaed8cf8b00b3d058e44b5d2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:VQL2O67M6ENWDBM3W47GW4IEAE","target":"graph","payload":{"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"},"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:12:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QGZCelXC84J8lTjKq6yWOU9gOs+HcNZKtNTCW3JMSHISU4mT0hRl6N7tD6GZiolXLTUnmz1R4haiNVsjSBMwBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T22:57:13.418655Z"},"content_sha256":"83e71e9c6705d2d477cd0be750c9bf80b7d8a997dd626039b76d81276e59d0e7","schema_version":"1.0","event_id":"sha256:83e71e9c6705d2d477cd0be750c9bf80b7d8a997dd626039b76d81276e59d0e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/bundle.json","state_url":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VQL2O67M6ENWDBM3W47GW4IEAE/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-05-27T22:57:13Z","links":{"resolver":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE","bundle":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/bundle.json","state":"https://pith.science/pith/VQL2O67M6ENWDBM3W47GW4IEAE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VQL2O67M6ENWDBM3W47GW4IEAE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VQL2O67M6ENWDBM3W47GW4IEAE","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":"eca2f43e6460e36ac752772e56add63cf008f38d90e37638e17e83857b23e60e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T10:43:16Z","title_canon_sha256":"6f90e68577aa475591d7a49ed98d75b7e44e5fdf879a27b70f70c3645bca1c32"},"schema_version":"1.0","source":{"id":"1309.5759","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.5759","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"arxiv_version","alias_value":"1309.5759v1","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.5759","created_at":"2026-05-18T03:12:34Z"},{"alias_kind":"pith_short_12","alias_value":"VQL2O67M6ENW","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VQL2O67M6ENWDBM3","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VQL2O67M","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:83e71e9c6705d2d477cd0be750c9bf80b7d8a997dd626039b76d81276e59d0e7","target":"graph","created_at":"2026-05-18T03:12:34Z","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":"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","authors_text":"Alan Frieze, Andrew Beveridge, Andrzej Dudek, Milos Stojakovic, Tobias Muller","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T10:43:16Z","title":"Maker-Breaker games on random geometric graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.5759","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:3ab4785f67204e40012ba99948c086b453d9bb29aaed8cf8b00b3d058e44b5d2","target":"record","created_at":"2026-05-18T03:12:34Z","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":"eca2f43e6460e36ac752772e56add63cf008f38d90e37638e17e83857b23e60e","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-23T10:43:16Z","title_canon_sha256":"6f90e68577aa475591d7a49ed98d75b7e44e5fdf879a27b70f70c3645bca1c32"},"schema_version":"1.0","source":{"id":"1309.5759","kind":"arxiv","version":1}},"canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ac17a77becf11b61859bb73e6b710401040197cf47246b0b3e82247ab17c4e73","first_computed_at":"2026-05-18T03:12:34.261561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:12:34.261561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4db1z8gjku0QoyRybQ7G6J2WRrrvr3gDrYpom2QXa71jZ0v54Hdi/IbiMQHxnpTjsjCQ/LVaqSBQckddPRlACw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:12:34.262299Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.5759","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3ab4785f67204e40012ba99948c086b453d9bb29aaed8cf8b00b3d058e44b5d2","sha256:83e71e9c6705d2d477cd0be750c9bf80b7d8a997dd626039b76d81276e59d0e7"],"state_sha256":"2ade077b9cdf534b94c255692a0dd2b75d9ae54ba456ae6710cceb31cbfad921"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AirdvVXjeJ7BEbcFGhHXX0DwwH1T+T6PxoxH8xeLoa5xuCrcRD19dZWJKBStbqYH3Y9f0wxpb9bc/nUrUfg+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T22:57:13.421232Z","bundle_sha256":"83e4030c38e08169c8476c28fcadf335fe5386e4796260119d5af87f568c2fd0"}}