{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:WQ2EXBUVASAGNCKJB6IYJDI7KV","short_pith_number":"pith:WQ2EXBUV","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"},"canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","source":{"kind":"arxiv","id":"1307.4229","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4229","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4229v1","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4229","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"WQ2EXBUVASAG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WQ2EXBUVASAGNCKJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WQ2EXBUV","created_at":"2026-05-18T12:28:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:WQ2EXBUVASAGNCKJB6IYJDI7KV","target":"record","payload":{"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"},"canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","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"},"source_kind":"arxiv","source_id":"1307.4229","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e+H6vYImX+Ka1uMN4aNrNh7rZMEVNmzKTKihaKzNaYQKLvpF8rxRzGMfrtzMy35jdg71PwisdI/HPIn4idG6CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:22.964987Z"},"content_sha256":"a25da3bdd986c1a8ca441e70d5ac9da3cfa381a681b40268e74e87fe7127e1d8","schema_version":"1.0","event_id":"sha256:a25da3bdd986c1a8ca441e70d5ac9da3cfa381a681b40268e74e87fe7127e1d8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:WQ2EXBUVASAGNCKJB6IYJDI7KV","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:53:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6HZUONXJoYC0kgS15ph3qno2XmPYkns4eALBAoZfuaF59H8QYETc/ssyPmq98+1AiTK8hSguK+ww4MN4v3KBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:32:22.965372Z"},"content_sha256":"63dca2904d103cb70c4c93e2c49485731351ab2f61db2eee6db9522e8e18c609","schema_version":"1.0","event_id":"sha256:63dca2904d103cb70c4c93e2c49485731351ab2f61db2eee6db9522e8e18c609"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/bundle.json","state_url":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-28T13:32:22Z","links":{"resolver":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV","bundle":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/bundle.json","state":"https://pith.science/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WQ2EXBUVASAGNCKJB6IYJDI7KV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:WQ2EXBUVASAGNCKJB6IYJDI7KV","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":"c61b961de0044acea56c9d82a94d45e1d5a598634fc4a9517b0e66e2f90b64f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-16T10:02:51Z","title_canon_sha256":"3bf8b60df0b3b67f6f532b3b27c2bc8875aba672b6963d06873c5f486ea2cb3d"},"schema_version":"1.0","source":{"id":"1307.4229","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4229","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4229v1","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4229","created_at":"2026-05-17T23:53:15Z"},{"alias_kind":"pith_short_12","alias_value":"WQ2EXBUVASAG","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"WQ2EXBUVASAGNCKJ","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"WQ2EXBUV","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:63dca2904d103cb70c4c93e2c49485731351ab2f61db2eee6db9522e8e18c609","target":"graph","created_at":"2026-05-17T23:53:15Z","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 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","authors_text":"Anita Liebenau, Dennis Clemens, Heidi Gebauer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-16T10:02:51Z","title":"The random graph intuition for the tournament game"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4229","kind":"arxiv","version":1},"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:a25da3bdd986c1a8ca441e70d5ac9da3cfa381a681b40268e74e87fe7127e1d8","target":"record","created_at":"2026-05-17T23:53:15Z","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":"c61b961de0044acea56c9d82a94d45e1d5a598634fc4a9517b0e66e2f90b64f2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-07-16T10:02:51Z","title_canon_sha256":"3bf8b60df0b3b67f6f532b3b27c2bc8875aba672b6963d06873c5f486ea2cb3d"},"schema_version":"1.0","source":{"id":"1307.4229","kind":"arxiv","version":1}},"canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b4344b869504806689490f91848d1f5561c5e3f17c6937a701c3b55adf63cddc","first_computed_at":"2026-05-17T23:53:15.258263Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:15.258263Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"F2dOJKyXPkS2hA6C9jl+R57zH/BV/EcynK8IxsNe/vNiEb4w67IO3clVErnudRfw+eBLgdWo5D+is8Qb1CcqBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:15.258864Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4229","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a25da3bdd986c1a8ca441e70d5ac9da3cfa381a681b40268e74e87fe7127e1d8","sha256:63dca2904d103cb70c4c93e2c49485731351ab2f61db2eee6db9522e8e18c609"],"state_sha256":"700de667045e51095cc29a74c0495e4fcab428372cae984e2b422a4fe14d81c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"stGmIHxmkt8t5tyeWtXiT87EJiqANOeuQdgUX2lGIAdTOOvAOnejTvDNBhk9+RWr25vIIjQbe1szJ0JEK0LTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:32:22.968062Z","bundle_sha256":"ac00b6ae9cba9fee3f937393c5badeb2b61c3802de19b033b291f3e43f54d742"}}