{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:7IP2NT2UATX22CIXJUQPN7E2YD","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":"d88a4a6375c909b8cbd464b7cc68a9c0437337d274c7c8d303720a4947682361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-15T14:17:58Z","title_canon_sha256":"f720ebc6b61254a63cfc1f3dc5a1c7da5b70035526da7069fa762252e918e397"},"schema_version":"1.0","source":{"id":"1304.4108","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4108","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4108v1","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4108","created_at":"2026-05-18T03:27:55Z"},{"alias_kind":"pith_short_12","alias_value":"7IP2NT2UATX2","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_16","alias_value":"7IP2NT2UATX22CIX","created_at":"2026-05-18T12:27:36Z"},{"alias_kind":"pith_short_8","alias_value":"7IP2NT2U","created_at":"2026-05-18T12:27:36Z"}],"graph_snapshots":[{"event_id":"sha256:85c62847d09a3b96a65b5272f05f939706c6811725bae8d6373028d3a5feb252","target":"graph","created_at":"2026-05-18T03:27:55Z","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":"For a tree T on n vertices, we study the Maker-Breaker game, played on the edge set of the complete graph on n vertices, which Maker wins as soon as the graph she builds contains a copy of T. We prove that if T has bounded maximum degree, then Maker can win this game within n+1 moves. Moreover, we prove that Maker can build almost every tree on n vertices in n-1 moves and provide non-trivial examples of families of trees which Maker cannot build in n-1 moves.","authors_text":"Anita Liebenau, Asaf Ferber, Dan Hefetz, Dennis Clemens, Roman Glebov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-15T14:17:58Z","title":"Building spanning trees quickly in Maker-Breaker games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4108","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:3cac7e0ab4b4f58006a3fde283bfa7a3523b693bc2b8d242a9019592fa8ef271","target":"record","created_at":"2026-05-18T03:27:55Z","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":"d88a4a6375c909b8cbd464b7cc68a9c0437337d274c7c8d303720a4947682361","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-15T14:17:58Z","title_canon_sha256":"f720ebc6b61254a63cfc1f3dc5a1c7da5b70035526da7069fa762252e918e397"},"schema_version":"1.0","source":{"id":"1304.4108","kind":"arxiv","version":1}},"canonical_sha256":"fa1fa6cf5404efad09174d20f6fc9ac0c730f64794ba4e2fc75e14ca40e6d11f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fa1fa6cf5404efad09174d20f6fc9ac0c730f64794ba4e2fc75e14ca40e6d11f","first_computed_at":"2026-05-18T03:27:55.445187Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:55.445187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"oeWEe41nlwShMHLIzRsCDaJdnWOiKfiNvFSrbc6b7i+Kp7n3YiLMnr4zUH3PIxNI/eYIIJk534qE6f7LrPJyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:55.445978Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4108","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3cac7e0ab4b4f58006a3fde283bfa7a3523b693bc2b8d242a9019592fa8ef271","sha256:85c62847d09a3b96a65b5272f05f939706c6811725bae8d6373028d3a5feb252"],"state_sha256":"f31c8f38e5b3ffb9581cf074323067b012d7b1232fbcd1fc9246d0bdbad7cbab"}