{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:STZRV54ZJBTEFASDNOEGTB6C5H","short_pith_number":"pith:STZRV54Z","schema_version":"1.0","canonical_sha256":"94f31af79948664282436b886987c2e9c18e78f468b4124c00f2bef35e877a10","source":{"kind":"arxiv","id":"1805.07338","version":2},"attestation_state":"computed","paper":{"title":"Degree conditions for embedding trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guido Besomi, Mat\\'ias Pavez-Sign\\'e, Maya Stein","submitted_at":"2018-05-18T17:43:35Z","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."},"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":"1805.07338","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-05-18T17:43:35Z","cross_cats_sorted":[],"title_canon_sha256":"0e183d85b29a79c53aedb415f29f298c747c05734dc0da0eec04eae965ff7fa6","abstract_canon_sha256":"05e2049aeaf0e3f8551d303de47de32ced0598dc36aca034a3fe5f3528369f5a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:07:07.156774Z","signature_b64":"ILmvT/no56etN1lPjXF0MmIIGg5xDGIjrYZs3vtpFJpI5KX6gNjAEM1+InHfjnaHSuBYEeaprM8FYxy66BVjDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94f31af79948664282436b886987c2e9c18e78f468b4124c00f2bef35e877a10","last_reissued_at":"2026-05-18T00:07:07.156056Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:07:07.156056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degree conditions for embedding trees","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guido Besomi, Mat\\'ias Pavez-Sign\\'e, Maya Stein","submitted_at":"2018-05-18T17:43:35Z","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."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.07338","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":"1805.07338","created_at":"2026-05-18T00:07:07.156161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.07338v2","created_at":"2026-05-18T00:07:07.156161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.07338","created_at":"2026-05-18T00:07:07.156161+00:00"},{"alias_kind":"pith_short_12","alias_value":"STZRV54ZJBTE","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_16","alias_value":"STZRV54ZJBTEFASD","created_at":"2026-05-18T12:32:53.628368+00:00"},{"alias_kind":"pith_short_8","alias_value":"STZRV54Z","created_at":"2026-05-18T12:32:53.628368+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/STZRV54ZJBTEFASDNOEGTB6C5H","json":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H.json","graph_json":"https://pith.science/api/pith-number/STZRV54ZJBTEFASDNOEGTB6C5H/graph.json","events_json":"https://pith.science/api/pith-number/STZRV54ZJBTEFASDNOEGTB6C5H/events.json","paper":"https://pith.science/paper/STZRV54Z"},"agent_actions":{"view_html":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H","download_json":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H.json","view_paper":"https://pith.science/paper/STZRV54Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.07338&json=true","fetch_graph":"https://pith.science/api/pith-number/STZRV54ZJBTEFASDNOEGTB6C5H/graph.json","fetch_events":"https://pith.science/api/pith-number/STZRV54ZJBTEFASDNOEGTB6C5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H/action/storage_attestation","attest_author":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H/action/author_attestation","sign_citation":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H/action/citation_signature","submit_replication":"https://pith.science/pith/STZRV54ZJBTEFASDNOEGTB6C5H/action/replication_record"}},"created_at":"2026-05-18T00:07:07.156161+00:00","updated_at":"2026-05-18T00:07:07.156161+00:00"}