{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:VFPXRNMYEL3KSTU5KR54SGAQJR","short_pith_number":"pith:VFPXRNMY","canonical_record":{"source":{"id":"1907.04804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"c622f10dd6fea2beedca20838d597e09e0477ba83a0cd361041cfb8210d2085f","abstract_canon_sha256":"ea2d8249107084741f98717c5a7bec53fa8f7694be7bc2fba6b1ada75b2dadb8"},"schema_version":"1.0"},"canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","source":{"kind":"arxiv","id":"1907.04804","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04804","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04804v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04804","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"VFPXRNMYEL3K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VFPXRNMYEL3KSTU5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VFPXRNMY","created_at":"2026-05-18T12:33:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:VFPXRNMYEL3KSTU5KR54SGAQJR","target":"record","payload":{"canonical_record":{"source":{"id":"1907.04804","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:53:05Z","cross_cats_sorted":[],"title_canon_sha256":"c622f10dd6fea2beedca20838d597e09e0477ba83a0cd361041cfb8210d2085f","abstract_canon_sha256":"ea2d8249107084741f98717c5a7bec53fa8f7694be7bc2fba6b1ada75b2dadb8"},"schema_version":"1.0"},"canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:56.684612Z","signature_b64":"hg5M97jWkxBOfYra7fCVjoFGpER8ISoSsZQFD2It2nKQgzy9PttTj5SxsrPx13Wp6BHE5JyINyXDR1Gih1a0Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","last_reissued_at":"2026-05-17T23:40:56.683910Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:56.683910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.04804","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-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cM/KxxXzeFsnbe3kfXz9CcOGTrxBd6KCOlBNyibeus+URF2IpiO5celc9wnYBCviF5moBPW1h+CdUxUEdN2FCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:23:00.480693Z"},"content_sha256":"23c6dc415beed2d8c2fa556dfef20cd7e7e24645d1851ff521f4b1fb76f04326","schema_version":"1.0","event_id":"sha256:23c6dc415beed2d8c2fa556dfef20cd7e7e24645d1851ff521f4b1fb76f04326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:VFPXRNMYEL3KSTU5KR54SGAQJR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The random strategy in Maker-Breaker graph minor games","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Ander Lamaison","submitted_at":"2019-07-10T15:53:05Z","abstract_excerpt":"In a $(1:b)$ biased Maker-Breaker game, how good a strategy is for a player can be measured by the bias range for which its rival can win, choosing an appropriate counterstrategy. Bednarska and {\\L}uczak proved that, in the $H$-subgraph game, the uniformly random strategy for Maker is essentially optimal with high probability. Here we prove an analogous result for the $H$-graph minor game, and we study for which choices of $H$ the random strategy is within a factor of $1+o(1)$ of being optimal."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04804","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-17T23:40:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TlAPb2bpmTju4nZZOA1P1e0CY6UJJW2lb4qelg6iJJEolN54xOivXBDoupseIEG95z6d8cPORcMq5Z/CC6fVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T07:23:00.481088Z"},"content_sha256":"d71a0163117ddcf2c60caaa45cdcb1d10e31d9c06c3a848abf0466112d875f7e","schema_version":"1.0","event_id":"sha256:d71a0163117ddcf2c60caaa45cdcb1d10e31d9c06c3a848abf0466112d875f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/bundle.json","state_url":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/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-25T07:23:00Z","links":{"resolver":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR","bundle":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/bundle.json","state":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:VFPXRNMYEL3KSTU5KR54SGAQJR","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":"ea2d8249107084741f98717c5a7bec53fa8f7694be7bc2fba6b1ada75b2dadb8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:53:05Z","title_canon_sha256":"c622f10dd6fea2beedca20838d597e09e0477ba83a0cd361041cfb8210d2085f"},"schema_version":"1.0","source":{"id":"1907.04804","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.04804","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"arxiv_version","alias_value":"1907.04804v1","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04804","created_at":"2026-05-17T23:40:56Z"},{"alias_kind":"pith_short_12","alias_value":"VFPXRNMYEL3K","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_16","alias_value":"VFPXRNMYEL3KSTU5","created_at":"2026-05-18T12:33:30Z"},{"alias_kind":"pith_short_8","alias_value":"VFPXRNMY","created_at":"2026-05-18T12:33:30Z"}],"graph_snapshots":[{"event_id":"sha256:d71a0163117ddcf2c60caaa45cdcb1d10e31d9c06c3a848abf0466112d875f7e","target":"graph","created_at":"2026-05-17T23:40:56Z","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 $(1:b)$ biased Maker-Breaker game, how good a strategy is for a player can be measured by the bias range for which its rival can win, choosing an appropriate counterstrategy. Bednarska and {\\L}uczak proved that, in the $H$-subgraph game, the uniformly random strategy for Maker is essentially optimal with high probability. Here we prove an analogous result for the $H$-graph minor game, and we study for which choices of $H$ the random strategy is within a factor of $1+o(1)$ of being optimal.","authors_text":"Ander Lamaison","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:53:05Z","title":"The random strategy in Maker-Breaker graph minor games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.04804","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:23c6dc415beed2d8c2fa556dfef20cd7e7e24645d1851ff521f4b1fb76f04326","target":"record","created_at":"2026-05-17T23:40:56Z","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":"ea2d8249107084741f98717c5a7bec53fa8f7694be7bc2fba6b1ada75b2dadb8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2019-07-10T15:53:05Z","title_canon_sha256":"c622f10dd6fea2beedca20838d597e09e0477ba83a0cd361041cfb8210d2085f"},"schema_version":"1.0","source":{"id":"1907.04804","kind":"arxiv","version":1}},"canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","first_computed_at":"2026-05-17T23:40:56.683910Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:56.683910Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hg5M97jWkxBOfYra7fCVjoFGpER8ISoSsZQFD2It2nKQgzy9PttTj5SxsrPx13Wp6BHE5JyINyXDR1Gih1a0Cw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:56.684612Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.04804","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:23c6dc415beed2d8c2fa556dfef20cd7e7e24645d1851ff521f4b1fb76f04326","sha256:d71a0163117ddcf2c60caaa45cdcb1d10e31d9c06c3a848abf0466112d875f7e"],"state_sha256":"cd5f2d94a1d794519d9fc35f91f3cf1b2ff290f37eec54f66c02b2244488059c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vBqhhrpQsSuNob3s3WAnM3lqVUuNAvOWQ/ACEKQHlxPz8vN36K59hLwBCA/LT6+EfnD1awwAufU14OKvgnmcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T07:23:00.483303Z","bundle_sha256":"5bb0fb5ff131a1ec861619d1810703c3c25b0427cf7f3e295b3dd42e038cdf88"}}