{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:6BBPPAZX7HCE74JRCRINBCBQZC","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":"b1de2b71f0240fae4934b668caab165608ba418acd8d24df7c95726c784a7a63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T10:14:33Z","title_canon_sha256":"a9806f75ee7791cfc5c4d4a63d9eb20f583204822d7ffae2f97ec836f69449c7"},"schema_version":"1.0","source":{"id":"1210.4342","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.4342","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"arxiv_version","alias_value":"1210.4342v2","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.4342","created_at":"2026-05-18T03:28:19Z"},{"alias_kind":"pith_short_12","alias_value":"6BBPPAZX7HCE","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_16","alias_value":"6BBPPAZX7HCE74JR","created_at":"2026-05-18T12:26:56Z"},{"alias_kind":"pith_short_8","alias_value":"6BBPPAZX","created_at":"2026-05-18T12:26:56Z"}],"graph_snapshots":[{"event_id":"sha256:b0ada0dce986f8136338bd3c5d8b6f4713a6d28ae44464bb66f80e31ed52d992","target":"graph","created_at":"2026-05-18T03:28:19Z","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 this paper we consider biased Maker-Breaker games played on the edge set of a given graph $G$. We prove that for every $\\delta>0$ and large enough $n$, there exists a constant $k$ for which if $\\delta(G)\\geq \\delta n$ and $\\chi(G)\\geq k$, then Maker can build an odd cycle in the $(1:b)$ game for $b=O(\\frac{n}{\\log^2 n})$. We also consider the analogous game where Maker and Breaker claim vertices instead of edges. This is a special case of the following well known and notoriously difficult problem due to Duffus, {\\L}uczak and R\\\"{o}dl: is it true that for any positive constants $t$ and $b$, ","authors_text":"Asaf Ferber, Cory Palmer, Hong Liu, Mate Vizer, Michael Krivelevich, Roman Glebov, Tomas Valla","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T10:14:33Z","title":"The biased odd cycle game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.4342","kind":"arxiv","version":2},"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:b28bf78f64af26b88b3dba8ff95ce9e830c3d0fcc21024b1c3aad75fc067245e","target":"record","created_at":"2026-05-18T03:28:19Z","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":"b1de2b71f0240fae4934b668caab165608ba418acd8d24df7c95726c784a7a63","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-10-16T10:14:33Z","title_canon_sha256":"a9806f75ee7791cfc5c4d4a63d9eb20f583204822d7ffae2f97ec836f69449c7"},"schema_version":"1.0","source":{"id":"1210.4342","kind":"arxiv","version":2}},"canonical_sha256":"f042f78337f9c44ff1311450d08830c89ecfb02aad6c051327871f83334536cb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f042f78337f9c44ff1311450d08830c89ecfb02aad6c051327871f83334536cb","first_computed_at":"2026-05-18T03:28:19.500032Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:19.500032Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hXA3xVFW5OxTHGhu75soZJjHaWlhtOMqYCIzoiTCtuoy3L18N86qG3snyGh70ub08/OrXP2rP50YM7RojCdrDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:19.500622Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.4342","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b28bf78f64af26b88b3dba8ff95ce9e830c3d0fcc21024b1c3aad75fc067245e","sha256:b0ada0dce986f8136338bd3c5d8b6f4713a6d28ae44464bb66f80e31ed52d992"],"state_sha256":"7d8c7f43984c745d6dcc6052c73d67f52fefab100ba6a7b8ec9ea11456e69168"}