{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:VFPXRNMYEL3KSTU5KR54SGAQJR","short_pith_number":"pith:VFPXRNMY","schema_version":"1.0","canonical_sha256":"a95f78b59822f6a94e9d547bc918104c5824fbb8dae2e6fd110c919b626ccaef","source":{"kind":"arxiv","id":"1907.04804","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.04804","created_at":"2026-05-17T23:40:56.684018+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.04804v1","created_at":"2026-05-17T23:40:56.684018+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.04804","created_at":"2026-05-17T23:40:56.684018+00:00"},{"alias_kind":"pith_short_12","alias_value":"VFPXRNMYEL3K","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_16","alias_value":"VFPXRNMYEL3KSTU5","created_at":"2026-05-18T12:33:30.264802+00:00"},{"alias_kind":"pith_short_8","alias_value":"VFPXRNMY","created_at":"2026-05-18T12:33:30.264802+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/VFPXRNMYEL3KSTU5KR54SGAQJR","json":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR.json","graph_json":"https://pith.science/api/pith-number/VFPXRNMYEL3KSTU5KR54SGAQJR/graph.json","events_json":"https://pith.science/api/pith-number/VFPXRNMYEL3KSTU5KR54SGAQJR/events.json","paper":"https://pith.science/paper/VFPXRNMY"},"agent_actions":{"view_html":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR","download_json":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR.json","view_paper":"https://pith.science/paper/VFPXRNMY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.04804&json=true","fetch_graph":"https://pith.science/api/pith-number/VFPXRNMYEL3KSTU5KR54SGAQJR/graph.json","fetch_events":"https://pith.science/api/pith-number/VFPXRNMYEL3KSTU5KR54SGAQJR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/action/storage_attestation","attest_author":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/action/author_attestation","sign_citation":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/action/citation_signature","submit_replication":"https://pith.science/pith/VFPXRNMYEL3KSTU5KR54SGAQJR/action/replication_record"}},"created_at":"2026-05-17T23:40:56.684018+00:00","updated_at":"2026-05-17T23:40:56.684018+00:00"}