{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:RRMHKDVBC4R4XCE6GZ2HW4VTMY","short_pith_number":"pith:RRMHKDVB","schema_version":"1.0","canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","source":{"kind":"arxiv","id":"1812.01382","version":1},"attestation_state":"computed","paper":{"title":"A new Bound for the Maker-Breaker Triangle Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Srivastav, Christian Glazik","submitted_at":"2018-12-04T12:44:09Z","abstract_excerpt":"The triangle game introduced by Chv\\'{a}tal and Erd\\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\\in\\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alternately Maker claims one edge and thereafter Breaker claims $q$ edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chv\\'{a}tal and Erd\\H{o}s (1978) proved that for $q<\\sqrt{2n+2}-5/2\\approx 1.414\\sqrt{n}$ Maker has a winning strategy, and for $q\\geq 2\\sqrt{n}$ Breaker has a winning strategy. "},"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":"1812.01382","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-04T12:44:09Z","cross_cats_sorted":[],"title_canon_sha256":"36173f0bc72247aa42e3f8862934a9de0af80995a44fd0970c891977fdd6f483","abstract_canon_sha256":"eab02d5bc37451e54a256a78cc84d168589e346dad4120c380d4399ba3764902"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:12.621763Z","signature_b64":"t9NdmBH4KP6pjFpGZ62L55iAR/OEQGx4LL8W63N3Vl976HzdEZHb71vtfkLr0jXw8k6pSqrw5udMbvYluvsFAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c58750ea11723cb889e36747b72b3662f756929af894b70f4d433d469fa2bac","last_reissued_at":"2026-05-17T23:59:12.621246Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:12.621246Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A new Bound for the Maker-Breaker Triangle Game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anand Srivastav, Christian Glazik","submitted_at":"2018-12-04T12:44:09Z","abstract_excerpt":"The triangle game introduced by Chv\\'{a}tal and Erd\\H{o}s (1978) is one of the most famous combinatorial games. For $n,q\\in\\mathbb{N}$, the $(n,q)$-triangle game is played by two players, called Maker and Breaker, on the complete graph $K_n$. Alternately Maker claims one edge and thereafter Breaker claims $q$ edges of the graph. Maker wins the game if he can claim all three edges of a triangle, otherwise Breaker wins. Chv\\'{a}tal and Erd\\H{o}s (1978) proved that for $q<\\sqrt{2n+2}-5/2\\approx 1.414\\sqrt{n}$ Maker has a winning strategy, and for $q\\geq 2\\sqrt{n}$ Breaker has a winning strategy. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.01382","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":"1812.01382","created_at":"2026-05-17T23:59:12.621333+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.01382v1","created_at":"2026-05-17T23:59:12.621333+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.01382","created_at":"2026-05-17T23:59:12.621333+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRMHKDVBC4R4","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRMHKDVBC4R4XCE6","created_at":"2026-05-18T12:32:50.500415+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRMHKDVB","created_at":"2026-05-18T12:32:50.500415+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/RRMHKDVBC4R4XCE6GZ2HW4VTMY","json":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY.json","graph_json":"https://pith.science/api/pith-number/RRMHKDVBC4R4XCE6GZ2HW4VTMY/graph.json","events_json":"https://pith.science/api/pith-number/RRMHKDVBC4R4XCE6GZ2HW4VTMY/events.json","paper":"https://pith.science/paper/RRMHKDVB"},"agent_actions":{"view_html":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY","download_json":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY.json","view_paper":"https://pith.science/paper/RRMHKDVB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.01382&json=true","fetch_graph":"https://pith.science/api/pith-number/RRMHKDVBC4R4XCE6GZ2HW4VTMY/graph.json","fetch_events":"https://pith.science/api/pith-number/RRMHKDVBC4R4XCE6GZ2HW4VTMY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/action/storage_attestation","attest_author":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/action/author_attestation","sign_citation":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/action/citation_signature","submit_replication":"https://pith.science/pith/RRMHKDVBC4R4XCE6GZ2HW4VTMY/action/replication_record"}},"created_at":"2026-05-17T23:59:12.621333+00:00","updated_at":"2026-05-17T23:59:12.621333+00:00"}