{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:NRBE4GFBXAH5X2JPQLZM2IBQJJ","short_pith_number":"pith:NRBE4GFB","schema_version":"1.0","canonical_sha256":"6c424e18a1b80fdbe92f82f2cd20304a6e7fb11dac697490bccb4a2cdb68c8bd","source":{"kind":"arxiv","id":"1803.04958","version":1},"attestation_state":"computed","paper":{"title":"Spanning trees in randomly perturbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Jaehoon Kim","submitted_at":"2018-03-13T17:54:30Z","abstract_excerpt":"A classical result of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\\log{n})$ as a subgraph, and the bounds on the degree conditions are sharp. On the other hand, Krivelevich, Kwan and Sudakov recently proved that for every $n$-vertex graph $G_\\alpha$ with minimum degree at least $\\alpha n$ for any fixed $\\alpha >0$ and every $n$-vertex tree $T$ with bounded maximum degree, one can still find a copy of $T$ in $G_\\alpha$ with high probability after adding $O(n)$ randoml"},"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":"1803.04958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T17:54:30Z","cross_cats_sorted":[],"title_canon_sha256":"50dcf9229131946ff0fc5dfb62b5bd6c6189e97a68465a3b09893dc008397423","abstract_canon_sha256":"82183d803f071411756c89e5c82b29147867eed03d5954511db2516eace72ae3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:21:15.363272Z","signature_b64":"UI+RDav1vovp3+51lu5lrocLzAYkJyHahuypWlMOSykHMaZCVw+wSFLcr9ffyPDX9wyYRP5bU6th/thCTnu9Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c424e18a1b80fdbe92f82f2cd20304a6e7fb11dac697490bccb4a2cdb68c8bd","last_reissued_at":"2026-05-18T00:21:15.362931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:21:15.362931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Spanning trees in randomly perturbed graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Felix Joos, Jaehoon Kim","submitted_at":"2018-03-13T17:54:30Z","abstract_excerpt":"A classical result of Koml\\'os, S\\'ark\\\"ozy and Szemer\\'edi states that every $n$-vertex graph with minimum degree at least $(1/2+ o(1))n$ contains every $n$-vertex tree with maximum degree $O(n/\\log{n})$ as a subgraph, and the bounds on the degree conditions are sharp. On the other hand, Krivelevich, Kwan and Sudakov recently proved that for every $n$-vertex graph $G_\\alpha$ with minimum degree at least $\\alpha n$ for any fixed $\\alpha >0$ and every $n$-vertex tree $T$ with bounded maximum degree, one can still find a copy of $T$ in $G_\\alpha$ with high probability after adding $O(n)$ randoml"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04958","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":"1803.04958","created_at":"2026-05-18T00:21:15.362984+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.04958v1","created_at":"2026-05-18T00:21:15.362984+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04958","created_at":"2026-05-18T00:21:15.362984+00:00"},{"alias_kind":"pith_short_12","alias_value":"NRBE4GFBXAH5","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"NRBE4GFBXAH5X2JP","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"NRBE4GFB","created_at":"2026-05-18T12:32:40.477152+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/NRBE4GFBXAH5X2JPQLZM2IBQJJ","json":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ.json","graph_json":"https://pith.science/api/pith-number/NRBE4GFBXAH5X2JPQLZM2IBQJJ/graph.json","events_json":"https://pith.science/api/pith-number/NRBE4GFBXAH5X2JPQLZM2IBQJJ/events.json","paper":"https://pith.science/paper/NRBE4GFB"},"agent_actions":{"view_html":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ","download_json":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ.json","view_paper":"https://pith.science/paper/NRBE4GFB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.04958&json=true","fetch_graph":"https://pith.science/api/pith-number/NRBE4GFBXAH5X2JPQLZM2IBQJJ/graph.json","fetch_events":"https://pith.science/api/pith-number/NRBE4GFBXAH5X2JPQLZM2IBQJJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ/action/storage_attestation","attest_author":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ/action/author_attestation","sign_citation":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ/action/citation_signature","submit_replication":"https://pith.science/pith/NRBE4GFBXAH5X2JPQLZM2IBQJJ/action/replication_record"}},"created_at":"2026-05-18T00:21:15.362984+00:00","updated_at":"2026-05-18T00:21:15.362984+00:00"}