{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:3PJMMUTY7MG7RMSOFYRQYP27ZH","short_pith_number":"pith:3PJMMUTY","schema_version":"1.0","canonical_sha256":"dbd2c65278fb0df8b24e2e230c3f5fc9dce3b3fe3ac2c2e2d100c729d46412c9","source":{"kind":"arxiv","id":"1408.5684","version":1},"attestation_state":"computed","paper":{"title":"Efficient winning strategies in random-turn Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Gal Kronenberg, Michael Krivelevich","submitted_at":"2014-08-25T08:56:19Z","abstract_excerpt":"We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007. A $p$-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin is being tossed before each turn to decide the identity of the next player to move (the probability of Player I to move is $p$). We analyze the random-turn version of several classical Maker-Breaker games such as the game Box (introduced by Chv\\'atal and Erd\\H os in 1987), the Hamilton cycle game and the $k$-vertex-connectivity game (both play"},"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":"1408.5684","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-08-25T08:56:19Z","cross_cats_sorted":[],"title_canon_sha256":"93ee42b8c2c044e31d5f925634b63442dbe02fef9cd6f9d342cd2f27779a1aa7","abstract_canon_sha256":"2eb5ec76e2c01ff8ecf07102cf50d19a0546e85cb251c0b52f129c9fe73b2431"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:24.493300Z","signature_b64":"mD/mt6G8t0kRheRldM32A/gumIy9p++XOPHHZLKKVlhc+1npY3Daav14hTmn3EoD1ato9gF42aiuqqJwFUEFCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dbd2c65278fb0df8b24e2e230c3f5fc9dce3b3fe3ac2c2e2d100c729d46412c9","last_reissued_at":"2026-05-18T02:44:24.492924Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:24.492924Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Efficient winning strategies in random-turn Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Gal Kronenberg, Michael Krivelevich","submitted_at":"2014-08-25T08:56:19Z","abstract_excerpt":"We consider random-turn positional games, introduced by Peres, Schramm, Sheffield and Wilson in 2007. A $p$-random-turn positional game is a two-player game, played the same as an ordinary positional game, except that instead of alternating turns, a coin is being tossed before each turn to decide the identity of the next player to move (the probability of Player I to move is $p$). We analyze the random-turn version of several classical Maker-Breaker games such as the game Box (introduced by Chv\\'atal and Erd\\H os in 1987), the Hamilton cycle game and the $k$-vertex-connectivity game (both play"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.5684","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":"1408.5684","created_at":"2026-05-18T02:44:24.492983+00:00"},{"alias_kind":"arxiv_version","alias_value":"1408.5684v1","created_at":"2026-05-18T02:44:24.492983+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.5684","created_at":"2026-05-18T02:44:24.492983+00:00"},{"alias_kind":"pith_short_12","alias_value":"3PJMMUTY7MG7","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"3PJMMUTY7MG7RMSO","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"3PJMMUTY","created_at":"2026-05-18T12:28:11.866339+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/3PJMMUTY7MG7RMSOFYRQYP27ZH","json":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH.json","graph_json":"https://pith.science/api/pith-number/3PJMMUTY7MG7RMSOFYRQYP27ZH/graph.json","events_json":"https://pith.science/api/pith-number/3PJMMUTY7MG7RMSOFYRQYP27ZH/events.json","paper":"https://pith.science/paper/3PJMMUTY"},"agent_actions":{"view_html":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH","download_json":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH.json","view_paper":"https://pith.science/paper/3PJMMUTY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1408.5684&json=true","fetch_graph":"https://pith.science/api/pith-number/3PJMMUTY7MG7RMSOFYRQYP27ZH/graph.json","fetch_events":"https://pith.science/api/pith-number/3PJMMUTY7MG7RMSOFYRQYP27ZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH/action/storage_attestation","attest_author":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH/action/author_attestation","sign_citation":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH/action/citation_signature","submit_replication":"https://pith.science/pith/3PJMMUTY7MG7RMSOFYRQYP27ZH/action/replication_record"}},"created_at":"2026-05-18T02:44:24.492983+00:00","updated_at":"2026-05-18T02:44:24.492983+00:00"}