{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:STZRV54ZJBTEFASDNOEGTB6C5H","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":"05e2049aeaf0e3f8551d303de47de32ced0598dc36aca034a3fe5f3528369f5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T17:43:35Z","title_canon_sha256":"0e183d85b29a79c53aedb415f29f298c747c05734dc0da0eec04eae965ff7fa6"},"schema_version":"1.0","source":{"id":"1805.07338","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1805.07338","created_at":"2026-05-18T00:07:07Z"},{"alias_kind":"arxiv_version","alias_value":"1805.07338v2","created_at":"2026-05-18T00:07:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07338","created_at":"2026-05-18T00:07:07Z"},{"alias_kind":"pith_short_12","alias_value":"STZRV54ZJBTE","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_16","alias_value":"STZRV54ZJBTEFASD","created_at":"2026-05-18T12:32:53Z"},{"alias_kind":"pith_short_8","alias_value":"STZRV54Z","created_at":"2026-05-18T12:32:53Z"}],"graph_snapshots":[{"event_id":"sha256:b181959f119701cc0cee1d096ceee1e9536cfd8c2a4da98cd2ae95a36f99b70f","target":"graph","created_at":"2026-05-18T00:07:07Z","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 conjecture that every $n$-vertex graph of minimum degree at least $\\frac k2$ and maximum degree at least $2k$ contains all trees with $k$ edges as subgraphs. We prove an approximate version of this conjecture for trees of bounded degree and dense host graphs.\n  Our work also has implications on the Erd\\H os--S\\'os conjecture and the $\\frac 23$-conjecture. We prove an approximate version of both conjectures for bounded degree trees and dense host graphs.","authors_text":"Guido Besomi, Mat\\'ias Pavez-Sign\\'e, Maya Stein","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T17:43:35Z","title":"Degree conditions for embedding trees"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07338","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:2e70db817baacc9e8a08fdc09b1aa2ee2713195e1b8442dececbddd855551fb4","target":"record","created_at":"2026-05-18T00:07:07Z","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":"05e2049aeaf0e3f8551d303de47de32ced0598dc36aca034a3fe5f3528369f5a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T17:43:35Z","title_canon_sha256":"0e183d85b29a79c53aedb415f29f298c747c05734dc0da0eec04eae965ff7fa6"},"schema_version":"1.0","source":{"id":"1805.07338","kind":"arxiv","version":2}},"canonical_sha256":"94f31af79948664282436b886987c2e9c18e78f468b4124c00f2bef35e877a10","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94f31af79948664282436b886987c2e9c18e78f468b4124c00f2bef35e877a10","first_computed_at":"2026-05-18T00:07:07.156056Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:07:07.156056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ILmvT/no56etN1lPjXF0MmIIGg5xDGIjrYZs3vtpFJpI5KX6gNjAEM1+InHfjnaHSuBYEeaprM8FYxy66BVjDg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:07:07.156774Z","signed_message":"canonical_sha256_bytes"},"source_id":"1805.07338","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e70db817baacc9e8a08fdc09b1aa2ee2713195e1b8442dececbddd855551fb4","sha256:b181959f119701cc0cee1d096ceee1e9536cfd8c2a4da98cd2ae95a36f99b70f"],"state_sha256":"f58641a6ec00ecf08f0e29dc5fc350a29bdc50d4836054f2a58bea5c706886fe"}