{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:QCU7YNFXXE7SK5CDMZZ6B2J4DB","short_pith_number":"pith:QCU7YNFX","schema_version":"1.0","canonical_sha256":"80a9fc34b7b93f2574436673e0e93c1840fc52c43b4e2baa3fd9a71a0a7d3c94","source":{"kind":"arxiv","id":"1711.07251","version":2},"attestation_state":"computed","paper":{"title":"On the optimality of the uniform random strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Kusch, Christoph Spiegel, Juanjo Ru\\'e, Tibor Szab\\'o","submitted_at":"2017-11-20T10:53:36Z","abstract_excerpt":"The concept of biased Maker-Breaker games, introduced by Chv\\'atal and Erd{\\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\\cal H}$ the main questions is to determine the smallest bias $q({\\cal H})$ that allows Breaker to force that Maker ends up with an independent set of ${\\cal H}$. Here we prove matching general winning criteria for Maker and Breaker when the game hypergraph satisfies a couple of natural `container-type' regularity conditions about the degree of subsets of its vertices. This wi"},"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":"1711.07251","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-20T10:53:36Z","cross_cats_sorted":[],"title_canon_sha256":"6d752181c904f3c845fabab966183d41259ae3c423d799b875b3e9cf5ec06531","abstract_canon_sha256":"772d90b3ab3ce004fce2e9c00d9ecf9d6d129d2ef82f2a646edc838f79ddc17a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:09:00.323386Z","signature_b64":"xUMzpdnLVydKEaF7M95fS5RaSnIqYf44myODfyuFwqQGQn0xiLGDIIAR8WoRsYB7Q3OtAmbPJhJ3icF9KLSoBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"80a9fc34b7b93f2574436673e0e93c1840fc52c43b4e2baa3fd9a71a0a7d3c94","last_reissued_at":"2026-05-18T00:09:00.322691Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:09:00.322691Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the optimality of the uniform random strategy","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Christopher Kusch, Christoph Spiegel, Juanjo Ru\\'e, Tibor Szab\\'o","submitted_at":"2017-11-20T10:53:36Z","abstract_excerpt":"The concept of biased Maker-Breaker games, introduced by Chv\\'atal and Erd{\\H o}s, is a central topic in the field of positional games, with deep connections to the theory of random structures. For any given hypergraph ${\\cal H}$ the main questions is to determine the smallest bias $q({\\cal H})$ that allows Breaker to force that Maker ends up with an independent set of ${\\cal H}$. Here we prove matching general winning criteria for Maker and Breaker when the game hypergraph satisfies a couple of natural `container-type' regularity conditions about the degree of subsets of its vertices. This wi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.07251","kind":"arxiv","version":2},"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":"1711.07251","created_at":"2026-05-18T00:09:00.322796+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.07251v2","created_at":"2026-05-18T00:09:00.322796+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.07251","created_at":"2026-05-18T00:09:00.322796+00:00"},{"alias_kind":"pith_short_12","alias_value":"QCU7YNFXXE7S","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_16","alias_value":"QCU7YNFXXE7SK5CD","created_at":"2026-05-18T12:31:37.085036+00:00"},{"alias_kind":"pith_short_8","alias_value":"QCU7YNFX","created_at":"2026-05-18T12:31:37.085036+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/QCU7YNFXXE7SK5CDMZZ6B2J4DB","json":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB.json","graph_json":"https://pith.science/api/pith-number/QCU7YNFXXE7SK5CDMZZ6B2J4DB/graph.json","events_json":"https://pith.science/api/pith-number/QCU7YNFXXE7SK5CDMZZ6B2J4DB/events.json","paper":"https://pith.science/paper/QCU7YNFX"},"agent_actions":{"view_html":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB","download_json":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB.json","view_paper":"https://pith.science/paper/QCU7YNFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.07251&json=true","fetch_graph":"https://pith.science/api/pith-number/QCU7YNFXXE7SK5CDMZZ6B2J4DB/graph.json","fetch_events":"https://pith.science/api/pith-number/QCU7YNFXXE7SK5CDMZZ6B2J4DB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB/action/storage_attestation","attest_author":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB/action/author_attestation","sign_citation":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB/action/citation_signature","submit_replication":"https://pith.science/pith/QCU7YNFXXE7SK5CDMZZ6B2J4DB/action/replication_record"}},"created_at":"2026-05-18T00:09:00.322796+00:00","updated_at":"2026-05-18T00:09:00.322796+00:00"}