{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:7IP2NT2UATX22CIXJUQPN7E2YD","short_pith_number":"pith:7IP2NT2U","schema_version":"1.0","canonical_sha256":"fa1fa6cf5404efad09174d20f6fc9ac0c730f64794ba4e2fc75e14ca40e6d11f","source":{"kind":"arxiv","id":"1304.4108","version":1},"attestation_state":"computed","paper":{"title":"Building spanning trees quickly in Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Asaf Ferber, Dan Hefetz, Dennis Clemens, Roman Glebov","submitted_at":"2013-04-15T14:17:58Z","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."},"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":"1304.4108","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-04-15T14:17:58Z","cross_cats_sorted":[],"title_canon_sha256":"f720ebc6b61254a63cfc1f3dc5a1c7da5b70035526da7069fa762252e918e397","abstract_canon_sha256":"d88a4a6375c909b8cbd464b7cc68a9c0437337d274c7c8d303720a4947682361"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:55.445978Z","signature_b64":"oeWEe41nlwShMHLIzRsCDaJdnWOiKfiNvFSrbc6b7i+Kp7n3YiLMnr4zUH3PIxNI/eYIIJk534qE6f7LrPJyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fa1fa6cf5404efad09174d20f6fc9ac0c730f64794ba4e2fc75e14ca40e6d11f","last_reissued_at":"2026-05-18T03:27:55.445187Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:55.445187Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Building spanning trees quickly in Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Anita Liebenau, Asaf Ferber, Dan Hefetz, Dennis Clemens, Roman Glebov","submitted_at":"2013-04-15T14:17:58Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4108","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":"1304.4108","created_at":"2026-05-18T03:27:55.445285+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4108v1","created_at":"2026-05-18T03:27:55.445285+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4108","created_at":"2026-05-18T03:27:55.445285+00:00"},{"alias_kind":"pith_short_12","alias_value":"7IP2NT2UATX2","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_16","alias_value":"7IP2NT2UATX22CIX","created_at":"2026-05-18T12:27:36.564083+00:00"},{"alias_kind":"pith_short_8","alias_value":"7IP2NT2U","created_at":"2026-05-18T12:27:36.564083+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/7IP2NT2UATX22CIXJUQPN7E2YD","json":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD.json","graph_json":"https://pith.science/api/pith-number/7IP2NT2UATX22CIXJUQPN7E2YD/graph.json","events_json":"https://pith.science/api/pith-number/7IP2NT2UATX22CIXJUQPN7E2YD/events.json","paper":"https://pith.science/paper/7IP2NT2U"},"agent_actions":{"view_html":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD","download_json":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD.json","view_paper":"https://pith.science/paper/7IP2NT2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4108&json=true","fetch_graph":"https://pith.science/api/pith-number/7IP2NT2UATX22CIXJUQPN7E2YD/graph.json","fetch_events":"https://pith.science/api/pith-number/7IP2NT2UATX22CIXJUQPN7E2YD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD/action/storage_attestation","attest_author":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD/action/author_attestation","sign_citation":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD/action/citation_signature","submit_replication":"https://pith.science/pith/7IP2NT2UATX22CIXJUQPN7E2YD/action/replication_record"}},"created_at":"2026-05-18T03:27:55.445285+00:00","updated_at":"2026-05-18T03:27:55.445285+00:00"}