{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:WQ2EXBUVASAGNCKJB6IYJDI7KV","short_pith_number":"pith:WQ2EXBUV","schema_version":"1.0","canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","source":{"kind":"arxiv","id":"1307.4229","version":1},"attestation_state":"computed","paper":{"title":"The random graph intuition for the tournament game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Dennis Clemens, Heidi Gebauer","submitted_at":"2013-07-16T10:02:51Z","abstract_excerpt":"In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two possible orientations. Before the game starts, Breaker fixes an arbitrary tournament T_k on k vertices. Maker wins if, at the end of the game, her digraph contains a copy of T_k; otherwise Breaker wins. In our main result, we show that Maker has a winning strategy for k = (2-o(1))log_2 n, improving the constant factor in previous results of Beck and the second author. This is asymptotically tight since it is known th"},"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":"1307.4229","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-16T10:02:51Z","cross_cats_sorted":[],"title_canon_sha256":"3bf8b60df0b3b67f6f532b3b27c2bc8875aba672b6963d06873c5f486ea2cb3d","abstract_canon_sha256":"c61b961de0044acea56c9d82a94d45e1d5a598634fc4a9517b0e66e2f90b64f2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:15.258864Z","signature_b64":"F2dOJKyXPkS2hA6C9jl+R57zH/BV/EcynK8IxsNe/vNiEb4w67IO3clVErnudRfw+eBLgdWo5D+is8Qb1CcqBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","last_reissued_at":"2026-05-17T23:53:15.258263Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:15.258263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The random graph intuition for the tournament game","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Dennis Clemens, Heidi Gebauer","submitted_at":"2013-07-16T10:02:51Z","abstract_excerpt":"In the tournament game two players, called Maker and Breaker, alternately take turns in claiming an unclaimed edge of the complete graph on n vertices and selecting one of the two possible orientations. Before the game starts, Breaker fixes an arbitrary tournament T_k on k vertices. Maker wins if, at the end of the game, her digraph contains a copy of T_k; otherwise Breaker wins. In our main result, we show that Maker has a winning strategy for k = (2-o(1))log_2 n, improving the constant factor in previous results of Beck and the second author. This is asymptotically tight since it is known th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4229","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":"1307.4229","created_at":"2026-05-17T23:53:15.258380+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4229v1","created_at":"2026-05-17T23:53:15.258380+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4229","created_at":"2026-05-17T23:53:15.258380+00:00"},{"alias_kind":"pith_short_12","alias_value":"WQ2EXBUVASAG","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"WQ2EXBUVASAGNCKJ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"WQ2EXBUV","created_at":"2026-05-18T12:28:04.890932+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/WQ2EXBUVASAGNCKJB6IYJDI7KV","json":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV.json","graph_json":"https://pith.science/api/pith-number/WQ2EXBUVASAGNCKJB6IYJDI7KV/graph.json","events_json":"https://pith.science/api/pith-number/WQ2EXBUVASAGNCKJB6IYJDI7KV/events.json","paper":"https://pith.science/paper/WQ2EXBUV"},"agent_actions":{"view_html":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV","download_json":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV.json","view_paper":"https://pith.science/paper/WQ2EXBUV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4229&json=true","fetch_graph":"https://pith.science/api/pith-number/WQ2EXBUVASAGNCKJB6IYJDI7KV/graph.json","fetch_events":"https://pith.science/api/pith-number/WQ2EXBUVASAGNCKJB6IYJDI7KV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/action/storage_attestation","attest_author":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/action/author_attestation","sign_citation":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/action/citation_signature","submit_replication":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/action/replication_record"}},"created_at":"2026-05-17T23:53:15.258380+00:00","updated_at":"2026-05-17T23:53:15.258380+00:00"}