{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:B5O4AD7S6O7G7CG7HWGTAPMTIH","short_pith_number":"pith:B5O4AD7S","canonical_record":{"source":{"id":"1010.2857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T08:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"32277d7560b0043629362a4286c6164e119f875f98eeacd54923e1a7e7fb26dc","abstract_canon_sha256":"f3788f4c38b84779774d9fce03d122d5166a35cc3b12bf070f3cc23fc5a9e3ba"},"schema_version":"1.0"},"canonical_sha256":"0f5dc00ff2f3be6f88df3d8d303d9341e41a7b3d0035a532ed867921469f04ae","source":{"kind":"arxiv","id":"1010.2857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2857","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2857v1","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2857","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"B5O4AD7S6O7G","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"B5O4AD7S6O7G7CG7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"B5O4AD7S","created_at":"2026-05-18T12:26:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:B5O4AD7S6O7G7CG7HWGTAPMTIH","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T08:58:36Z","cross_cats_sorted":[],"title_canon_sha256":"32277d7560b0043629362a4286c6164e119f875f98eeacd54923e1a7e7fb26dc","abstract_canon_sha256":"f3788f4c38b84779774d9fce03d122d5166a35cc3b12bf070f3cc23fc5a9e3ba"},"schema_version":"1.0"},"canonical_sha256":"0f5dc00ff2f3be6f88df3d8d303d9341e41a7b3d0035a532ed867921469f04ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:18.998898Z","signature_b64":"Ai6Edxa6hEPxNKp9t2K87S43tVBpnVGRTODvFoX1jD5k2GK0AlRVN4Lw98Q62dbm2AazlK6eYreqSTV36SHwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0f5dc00ff2f3be6f88df3d8d303d9341e41a7b3d0035a532ed867921469f04ae","last_reissued_at":"2026-05-18T04:39:18.998426Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:18.998426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2857","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-18T04:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vdjJBykwDrNXq2Zd8I8Sxjbr+opoVMFWzfT0bGh93fDGoRIZvYvfbY0IRzvqNxEHoO6zqKM4eHDgPb8jpOMNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:02:05.209609Z"},"content_sha256":"cd5028ae12e0984222cdc8365bb538cba2a5927c3f20703e7825fbb8ee63fad9","schema_version":"1.0","event_id":"sha256:cd5028ae12e0984222cdc8365bb538cba2a5927c3f20703e7825fbb8ee63fad9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:B5O4AD7S6O7G7CG7HWGTAPMTIH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast embedding of spanning trees in biased Maker-Breaker games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Asaf Ferber, Dan Hefetz, Michael Krivelevich","submitted_at":"2010-10-14T08:58:36Z","abstract_excerpt":"Given a tree $T=(V,E)$ on $n$ vertices, we consider the $(1 : q)$ Maker-Breaker tree embedding game ${\\mathcal T}_n$. The board of this game is the edge set of the complete graph on $n$ vertices. Maker wins ${\\mathcal T}_n$ if and only if he is able to claim all edges of a copy of $T$. We prove that there exist real numbers $\\alpha, \\epsilon > 0$ such that, for sufficiently large $n$ and for every tree $T$ on $n$ vertices with maximum degree at most $n^{\\epsilon}$, Maker has a winning strategy for the $(1 : q)$ game ${\\mathcal T}_n$, for every $q \\leq n^{\\alpha}$. Moreover, we prove that Maker"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2857","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-18T04:39:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6WBH5Ub1OmJbUyOsLuqWzQa09XLxCG5bY5bqbB5NtjP9NnoDV21d1kOQKKy055ei1oSZrBiocm1DwYEbEM4PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T03:02:05.210259Z"},"content_sha256":"1c9002947c3a74c3be037f914642048adfc03276227979f6594c408b4f41b537","schema_version":"1.0","event_id":"sha256:1c9002947c3a74c3be037f914642048adfc03276227979f6594c408b4f41b537"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/bundle.json","state_url":"https://pith.science/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/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-26T03:02:05Z","links":{"resolver":"https://pith.science/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH","bundle":"https://pith.science/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/bundle.json","state":"https://pith.science/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/B5O4AD7S6O7G7CG7HWGTAPMTIH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:B5O4AD7S6O7G7CG7HWGTAPMTIH","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":"f3788f4c38b84779774d9fce03d122d5166a35cc3b12bf070f3cc23fc5a9e3ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T08:58:36Z","title_canon_sha256":"32277d7560b0043629362a4286c6164e119f875f98eeacd54923e1a7e7fb26dc"},"schema_version":"1.0","source":{"id":"1010.2857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2857","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2857v1","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2857","created_at":"2026-05-18T04:39:18Z"},{"alias_kind":"pith_short_12","alias_value":"B5O4AD7S6O7G","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_16","alias_value":"B5O4AD7S6O7G7CG7","created_at":"2026-05-18T12:26:05Z"},{"alias_kind":"pith_short_8","alias_value":"B5O4AD7S","created_at":"2026-05-18T12:26:05Z"}],"graph_snapshots":[{"event_id":"sha256:1c9002947c3a74c3be037f914642048adfc03276227979f6594c408b4f41b537","target":"graph","created_at":"2026-05-18T04:39:18Z","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":"Given a tree $T=(V,E)$ on $n$ vertices, we consider the $(1 : q)$ Maker-Breaker tree embedding game ${\\mathcal T}_n$. The board of this game is the edge set of the complete graph on $n$ vertices. Maker wins ${\\mathcal T}_n$ if and only if he is able to claim all edges of a copy of $T$. We prove that there exist real numbers $\\alpha, \\epsilon > 0$ such that, for sufficiently large $n$ and for every tree $T$ on $n$ vertices with maximum degree at most $n^{\\epsilon}$, Maker has a winning strategy for the $(1 : q)$ game ${\\mathcal T}_n$, for every $q \\leq n^{\\alpha}$. Moreover, we prove that Maker","authors_text":"Asaf Ferber, Dan Hefetz, Michael Krivelevich","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T08:58:36Z","title":"Fast embedding of spanning trees in biased Maker-Breaker games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2857","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:cd5028ae12e0984222cdc8365bb538cba2a5927c3f20703e7825fbb8ee63fad9","target":"record","created_at":"2026-05-18T04:39:18Z","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":"f3788f4c38b84779774d9fce03d122d5166a35cc3b12bf070f3cc23fc5a9e3ba","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-10-14T08:58:36Z","title_canon_sha256":"32277d7560b0043629362a4286c6164e119f875f98eeacd54923e1a7e7fb26dc"},"schema_version":"1.0","source":{"id":"1010.2857","kind":"arxiv","version":1}},"canonical_sha256":"0f5dc00ff2f3be6f88df3d8d303d9341e41a7b3d0035a532ed867921469f04ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0f5dc00ff2f3be6f88df3d8d303d9341e41a7b3d0035a532ed867921469f04ae","first_computed_at":"2026-05-18T04:39:18.998426Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:39:18.998426Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ai6Edxa6hEPxNKp9t2K87S43tVBpnVGRTODvFoX1jD5k2GK0AlRVN4Lw98Q62dbm2AazlK6eYreqSTV36SHwBA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:39:18.998898Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cd5028ae12e0984222cdc8365bb538cba2a5927c3f20703e7825fbb8ee63fad9","sha256:1c9002947c3a74c3be037f914642048adfc03276227979f6594c408b4f41b537"],"state_sha256":"33411965a8afb374f43062343ff66978dc8b8aa92bcddf943bbb548249d0110c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1aNpKi09EhwdYdAjxrmFwqIQASb7ytLbZoDhp7SGEXgPdNqUopouAylDvOZLIYqrM4NlAC+1rZ4yu7dhVijqAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T03:02:05.214296Z","bundle_sha256":"2f7bff47bb32fee665e406d40eeaf1f127b204103712f3ea2e2dc7860b700d98"}}