{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:NRBE4GFBXAH5X2JPQLZM2IBQJJ","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":"82183d803f071411756c89e5c82b29147867eed03d5954511db2516eace72ae3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T17:54:30Z","title_canon_sha256":"50dcf9229131946ff0fc5dfb62b5bd6c6189e97a68465a3b09893dc008397423"},"schema_version":"1.0","source":{"id":"1803.04958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.04958","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"arxiv_version","alias_value":"1803.04958v1","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.04958","created_at":"2026-05-18T00:21:15Z"},{"alias_kind":"pith_short_12","alias_value":"NRBE4GFBXAH5","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"NRBE4GFBXAH5X2JP","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"NRBE4GFB","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:2e16701c5b5cca02ab5cc4f0aeb34bcf0bb580e54decc00f3b223bcaaccbefc3","target":"graph","created_at":"2026-05-18T00:21:15Z","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":"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","authors_text":"Felix Joos, Jaehoon Kim","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T17:54:30Z","title":"Spanning trees in randomly perturbed graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.04958","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:a106317a365d594c4b60ae0f418899597c19a6c6922b8aaeee1a1a3a1f19b7fe","target":"record","created_at":"2026-05-18T00:21:15Z","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":"82183d803f071411756c89e5c82b29147867eed03d5954511db2516eace72ae3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-03-13T17:54:30Z","title_canon_sha256":"50dcf9229131946ff0fc5dfb62b5bd6c6189e97a68465a3b09893dc008397423"},"schema_version":"1.0","source":{"id":"1803.04958","kind":"arxiv","version":1}},"canonical_sha256":"6c424e18a1b80fdbe92f82f2cd20304a6e7fb11dac697490bccb4a2cdb68c8bd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c424e18a1b80fdbe92f82f2cd20304a6e7fb11dac697490bccb4a2cdb68c8bd","first_computed_at":"2026-05-18T00:21:15.362931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:21:15.362931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UI+RDav1vovp3+51lu5lrocLzAYkJyHahuypWlMOSykHMaZCVw+wSFLcr9ffyPDX9wyYRP5bU6th/thCTnu9Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:21:15.363272Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.04958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a106317a365d594c4b60ae0f418899597c19a6c6922b8aaeee1a1a3a1f19b7fe","sha256:2e16701c5b5cca02ab5cc4f0aeb34bcf0bb580e54decc00f3b223bcaaccbefc3"],"state_sha256":"1dcc57cdb5a0b77e009b90009554dda4dd74c1b0847e0e7e33c83cd11277d624"}