{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:MVQ56I7X5DYHA7BIUE4I3GT2VT","short_pith_number":"pith:MVQ56I7X","canonical_record":{"source":{"id":"1711.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-14T21:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"89a27e488d2c8377b53d5330e26d5ef09c1f7706e918f9f2b9fc0f0b8715097d","abstract_canon_sha256":"4e77f3e5159a74f6606eb2a3b219f547f792a715376135c6c83b80b2ad63ad4e"},"schema_version":"1.0"},"canonical_sha256":"6561df23f7e8f0707c28a1388d9a7aacc5efdcf3c7ba633e16e13e87012a374e","source":{"kind":"arxiv","id":"1711.05311","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05311","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05311v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05311","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"MVQ56I7X5DYH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVQ56I7X5DYHA7BI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVQ56I7X","created_at":"2026-05-18T12:31:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:MVQ56I7X5DYHA7BIUE4I3GT2VT","target":"record","payload":{"canonical_record":{"source":{"id":"1711.05311","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-14T21:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"89a27e488d2c8377b53d5330e26d5ef09c1f7706e918f9f2b9fc0f0b8715097d","abstract_canon_sha256":"4e77f3e5159a74f6606eb2a3b219f547f792a715376135c6c83b80b2ad63ad4e"},"schema_version":"1.0"},"canonical_sha256":"6561df23f7e8f0707c28a1388d9a7aacc5efdcf3c7ba633e16e13e87012a374e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:33.677971Z","signature_b64":"JiaoHB7odG4D724CfWYrTyIhaamammiq253RQk1aKawB7GDBD/Ioev+sj9Yh1GlSa6VhPTaQM4qcn4HQmGxLDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6561df23f7e8f0707c28a1388d9a7aacc5efdcf3c7ba633e16e13e87012a374e","last_reissued_at":"2026-05-18T00:30:33.677349Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:33.677349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.05311","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Btqf4o2pb8BXnDcPTLD59L+1fTMPUp9xxk4UGC2X1dVd7WQbE8icWGuLJJm4FYru8uQVqeCwVIC1ELoLDUPbCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:25.775540Z"},"content_sha256":"c567843177868640a412ed3d4dd393b0f26ac381743c737ac9c2b00fbc9996ee","schema_version":"1.0","event_id":"sha256:c567843177868640a412ed3d4dd393b0f26ac381743c737ac9c2b00fbc9996ee"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:MVQ56I7X5DYHA7BIUE4I3GT2VT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Making spanning graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Humberto Naves, Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2017-11-14T21:00:32Z","abstract_excerpt":"We prove that for each $D\\ge 2$ there exists $c>0$ such that whenever $b\\le c\\big(\\tfrac{n}{\\log n}\\big)^{1/D}$, in the $(1:b)$ Maker-Breaker game played on $E(K_n)$, Maker has a strategy to guarantee claiming a graph $G$ containing copies of all graphs $H$ with $v(H)\\le n$ and $\\Delta(H)\\le D$. We show further that the graph $G$ guaranteed by this strategy also contains copies of any graph $H$ with bounded maximum degree and degeneracy at most $\\tfrac{D-1}{2}$. This lower bound on the threshold bias is sharp up to the $\\log$-factor when $H$ consists of $\\tfrac{n}{3}$ vertex-disjoint triangles"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05311","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-18T00:30:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IWlExYXVpPpImDJ1coP1LiFgUeuSxkuOAbt89mJ18ayVm7W5GQFxfFNAzDkCOHWf7N6nvCjZykyYGGXkRQ0IAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T18:15:25.776252Z"},"content_sha256":"e12a515e42ac65c01fca0b41ab9ef1eb8afd756016466e9f657d2de528334ae2","schema_version":"1.0","event_id":"sha256:e12a515e42ac65c01fca0b41ab9ef1eb8afd756016466e9f657d2de528334ae2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/bundle.json","state_url":"https://pith.science/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/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-28T18:15:25Z","links":{"resolver":"https://pith.science/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT","bundle":"https://pith.science/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/bundle.json","state":"https://pith.science/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MVQ56I7X5DYHA7BIUE4I3GT2VT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:MVQ56I7X5DYHA7BIUE4I3GT2VT","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":"4e77f3e5159a74f6606eb2a3b219f547f792a715376135c6c83b80b2ad63ad4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-14T21:00:32Z","title_canon_sha256":"89a27e488d2c8377b53d5330e26d5ef09c1f7706e918f9f2b9fc0f0b8715097d"},"schema_version":"1.0","source":{"id":"1711.05311","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.05311","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"arxiv_version","alias_value":"1711.05311v1","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.05311","created_at":"2026-05-18T00:30:33Z"},{"alias_kind":"pith_short_12","alias_value":"MVQ56I7X5DYH","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_16","alias_value":"MVQ56I7X5DYHA7BI","created_at":"2026-05-18T12:31:31Z"},{"alias_kind":"pith_short_8","alias_value":"MVQ56I7X","created_at":"2026-05-18T12:31:31Z"}],"graph_snapshots":[{"event_id":"sha256:e12a515e42ac65c01fca0b41ab9ef1eb8afd756016466e9f657d2de528334ae2","target":"graph","created_at":"2026-05-18T00:30:33Z","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":"We prove that for each $D\\ge 2$ there exists $c>0$ such that whenever $b\\le c\\big(\\tfrac{n}{\\log n}\\big)^{1/D}$, in the $(1:b)$ Maker-Breaker game played on $E(K_n)$, Maker has a strategy to guarantee claiming a graph $G$ containing copies of all graphs $H$ with $v(H)\\le n$ and $\\Delta(H)\\le D$. We show further that the graph $G$ guaranteed by this strategy also contains copies of any graph $H$ with bounded maximum degree and degeneracy at most $\\tfrac{D-1}{2}$. This lower bound on the threshold bias is sharp up to the $\\log$-factor when $H$ consists of $\\tfrac{n}{3}$ vertex-disjoint triangles","authors_text":"Humberto Naves, Julia B\\\"ottcher, Peter Allen, Yoshiharu Kohayakawa, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-14T21:00:32Z","title":"Making spanning graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.05311","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:c567843177868640a412ed3d4dd393b0f26ac381743c737ac9c2b00fbc9996ee","target":"record","created_at":"2026-05-18T00:30:33Z","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":"4e77f3e5159a74f6606eb2a3b219f547f792a715376135c6c83b80b2ad63ad4e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-14T21:00:32Z","title_canon_sha256":"89a27e488d2c8377b53d5330e26d5ef09c1f7706e918f9f2b9fc0f0b8715097d"},"schema_version":"1.0","source":{"id":"1711.05311","kind":"arxiv","version":1}},"canonical_sha256":"6561df23f7e8f0707c28a1388d9a7aacc5efdcf3c7ba633e16e13e87012a374e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6561df23f7e8f0707c28a1388d9a7aacc5efdcf3c7ba633e16e13e87012a374e","first_computed_at":"2026-05-18T00:30:33.677349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:30:33.677349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JiaoHB7odG4D724CfWYrTyIhaamammiq253RQk1aKawB7GDBD/Ioev+sj9Yh1GlSa6VhPTaQM4qcn4HQmGxLDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:30:33.677971Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.05311","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c567843177868640a412ed3d4dd393b0f26ac381743c737ac9c2b00fbc9996ee","sha256:e12a515e42ac65c01fca0b41ab9ef1eb8afd756016466e9f657d2de528334ae2"],"state_sha256":"ae51ec5a4adb7c6512f13807283abfbd44e60d0427b2bf2e736808220c85a114"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"27wo/YqszoBCJA0M0eivRAcmap9b9FQzeHF4mAeaAUn26/7V9xjML8q175kn6kyNwyK6cu52pEojSCaZIBKoDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T18:15:25.780131Z","bundle_sha256":"dbf1ba6b023a9a43be4d3c8e918e631045b0182441fa914a781ec99758d2b327"}}