{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:UZJCSEZIM7XDG645IJDOKIEW2H","short_pith_number":"pith:UZJCSEZI","schema_version":"1.0","canonical_sha256":"a65229132867ee337b9d4246e52096d1dfba08d38ad196ac58cb4b322bb4e26f","source":{"kind":"arxiv","id":"1802.04707","version":2},"attestation_state":"computed","paper":{"title":"Universality for bounded degree spanning trees in randomly perturbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Julia B\\\"ottcher, Olaf Parczyk, Richard Montgomery, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-02-13T16:22:32Z","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"},"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":"1802.04707","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-13T16:22:32Z","cross_cats_sorted":[],"title_canon_sha256":"597d3935fca9a7e8a401b6466d6b0534eaa58689d5e8d755a38eb7212c858ac3","abstract_canon_sha256":"489184d0b116386b09a19a6781850da37125db90f619a97ff8f53705edbbfbde"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:53:51.681206Z","signature_b64":"FDJ9fy/BWj4jMl41+ktUBBHh+TIHZc8mALyDqeI7nchzLvEcdVfRteI18C7EAIxxghx+8e0Gq1k2AIecirSrDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a65229132867ee337b9d4246e52096d1dfba08d38ad196ac58cb4b322bb4e26f","last_reissued_at":"2026-05-17T23:53:51.680149Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:53:51.680149Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universality for bounded degree spanning trees in randomly perturbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jie Han, Julia B\\\"ottcher, Olaf Parczyk, Richard Montgomery, Yoshiharu Kohayakawa, Yury Person","submitted_at":"2018-02-13T16:22:32Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.04707","kind":"arxiv","version":2},"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":"1802.04707","created_at":"2026-05-17T23:53:51.680256+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.04707v2","created_at":"2026-05-17T23:53:51.680256+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.04707","created_at":"2026-05-17T23:53:51.680256+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZJCSEZIM7XD","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZJCSEZIM7XDG645","created_at":"2026-05-18T12:32:56.356000+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZJCSEZI","created_at":"2026-05-18T12:32:56.356000+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/UZJCSEZIM7XDG645IJDOKIEW2H","json":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H.json","graph_json":"https://pith.science/api/pith-number/UZJCSEZIM7XDG645IJDOKIEW2H/graph.json","events_json":"https://pith.science/api/pith-number/UZJCSEZIM7XDG645IJDOKIEW2H/events.json","paper":"https://pith.science/paper/UZJCSEZI"},"agent_actions":{"view_html":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H","download_json":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H.json","view_paper":"https://pith.science/paper/UZJCSEZI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.04707&json=true","fetch_graph":"https://pith.science/api/pith-number/UZJCSEZIM7XDG645IJDOKIEW2H/graph.json","fetch_events":"https://pith.science/api/pith-number/UZJCSEZIM7XDG645IJDOKIEW2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H/action/storage_attestation","attest_author":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H/action/author_attestation","sign_citation":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H/action/citation_signature","submit_replication":"https://pith.science/pith/UZJCSEZIM7XDG645IJDOKIEW2H/action/replication_record"}},"created_at":"2026-05-17T23:53:51.680256+00:00","updated_at":"2026-05-17T23:53:51.680256+00:00"}