{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UZJCSEZIM7XDG645IJDOKIEW2H","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":"489184d0b116386b09a19a6781850da37125db90f619a97ff8f53705edbbfbde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-13T16:22:32Z","title_canon_sha256":"597d3935fca9a7e8a401b6466d6b0534eaa58689d5e8d755a38eb7212c858ac3"},"schema_version":"1.0","source":{"id":"1802.04707","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.04707","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"arxiv_version","alias_value":"1802.04707v2","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04707","created_at":"2026-05-17T23:53:51Z"},{"alias_kind":"pith_short_12","alias_value":"UZJCSEZIM7XD","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UZJCSEZIM7XDG645","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UZJCSEZI","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:5353d6d18d5a8d5b1000e85ac83539807dc8b147b6a4f7eee8b1b117cd5109d7","target":"graph","created_at":"2026-05-17T23:53:51Z","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 solve a problem of Krivelevich, Kwan and Sudakov [SIAM Journal on Discrete Mathematics 31 (2017), 155-171] concerning the threshold for the containment of all bounded degree spanning trees in the model of randomly perturbed dense graphs. More precisely, we show that, if we start with a dense graph $G_\\alpha$ on $n$ vertices with $\\delta(G_\\alpha)\\ge \\alpha n$ for $\\alpha>0$ and we add to it the binomial random graph $G(n,C/n)$, then with high probability the graph $G_\\alpha\\cup G(n,C/n)$ contains copies of all spanning trees with maximum degree at most $\\Delta$ simultaneously, where $C$ dep","authors_text":"Jie Han, Julia B\\\"ottcher, Olaf Parczyk, Richard Montgomery, Yoshiharu Kohayakawa, Yury Person","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-13T16:22:32Z","title":"Universality for bounded degree spanning trees in randomly perturbed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04707","kind":"arxiv","version":2},"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:02e9b7bff6d60f89ee7ccaf4571419a05df8b2c88fdb85d2982ed4ec6f0cc52b","target":"record","created_at":"2026-05-17T23:53:51Z","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":"489184d0b116386b09a19a6781850da37125db90f619a97ff8f53705edbbfbde","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-13T16:22:32Z","title_canon_sha256":"597d3935fca9a7e8a401b6466d6b0534eaa58689d5e8d755a38eb7212c858ac3"},"schema_version":"1.0","source":{"id":"1802.04707","kind":"arxiv","version":2}},"canonical_sha256":"a65229132867ee337b9d4246e52096d1dfba08d38ad196ac58cb4b322bb4e26f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a65229132867ee337b9d4246e52096d1dfba08d38ad196ac58cb4b322bb4e26f","first_computed_at":"2026-05-17T23:53:51.680149Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:53:51.680149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"FDJ9fy/BWj4jMl41+ktUBBHh+TIHZc8mALyDqeI7nchzLvEcdVfRteI18C7EAIxxghx+8e0Gq1k2AIecirSrDQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:53:51.681206Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.04707","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02e9b7bff6d60f89ee7ccaf4571419a05df8b2c88fdb85d2982ed4ec6f0cc52b","sha256:5353d6d18d5a8d5b1000e85ac83539807dc8b147b6a4f7eee8b1b117cd5109d7"],"state_sha256":"eac0e2eca1fdea3dda62ad9bb360cb80db3fb102ca9d99fea40ac25e2c669d14"}