{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SFMZFF5SWEEBVICMCJSJHADQZW","short_pith_number":"pith:SFMZFF5S","schema_version":"1.0","canonical_sha256":"91599297b2b1081aa04c1264938070cd86874d22de0da61bc85c46ab2c90493f","source":{"kind":"arxiv","id":"2606.02389","version":1},"attestation_state":"computed","paper":{"title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jasmin Katz, Jozef Skokan, Mat\\'ias Pavez-Sign\\'e","submitted_at":"2026-06-01T15:37:05Z","abstract_excerpt":"An old conjecture of Burr and Erd\\H os states that the Ramsey number of any $n$-vertex tree $T$ is at most $2n-2$. In 2012, Schelp asked whether a degree version of the Burr--Erd\\H{o}s conjecture holds. More precisely, Schelp asked if is it true that for any $\\varepsilon>0$ and $\\Delta\\ge 2$, if $G$ is a graph on $N\\ge (2+\\varepsilon)n$ vertices and minimum degree $\\delta(G)\\ge \\lfloor 3N/4\\rfloor$, then every blue/red colouring of the edges of $G$ yields a monochromatic copy of each $n$-vertex tree with maximum degree at most $\\Delta$. We prove this conjecture in a strong form, showing that i"},"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":"2606.02389","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T15:37:05Z","cross_cats_sorted":[],"title_canon_sha256":"69fb577a7fd405427a2c8cd0722489d20e6306c99db3a55efd6ce6e0803f8ab5","abstract_canon_sha256":"52453e32b362c7410879555e4fe3ab7e3df16e2bc1e91423fa9be1724acaec45"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T03:04:57.874455Z","signature_b64":"PSlkmYq/VTQwvl7LP8qs+7BFyMej46kOWng8sPb8+ZHlw5J9iJoi80gE9G//csDbSDMYNnOcqNa/Q7OrVLXzDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"91599297b2b1081aa04c1264938070cd86874d22de0da61bc85c46ab2c90493f","last_reissued_at":"2026-06-02T03:04:57.874075Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T03:04:57.874075Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jasmin Katz, Jozef Skokan, Mat\\'ias Pavez-Sign\\'e","submitted_at":"2026-06-01T15:37:05Z","abstract_excerpt":"An old conjecture of Burr and Erd\\H os states that the Ramsey number of any $n$-vertex tree $T$ is at most $2n-2$. In 2012, Schelp asked whether a degree version of the Burr--Erd\\H{o}s conjecture holds. More precisely, Schelp asked if is it true that for any $\\varepsilon>0$ and $\\Delta\\ge 2$, if $G$ is a graph on $N\\ge (2+\\varepsilon)n$ vertices and minimum degree $\\delta(G)\\ge \\lfloor 3N/4\\rfloor$, then every blue/red colouring of the edges of $G$ yields a monochromatic copy of each $n$-vertex tree with maximum degree at most $\\Delta$. We prove this conjecture in a strong form, showing that i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02389","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.02389/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2606.02389","created_at":"2026-06-02T03:04:57.874137+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02389v1","created_at":"2026-06-02T03:04:57.874137+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02389","created_at":"2026-06-02T03:04:57.874137+00:00"},{"alias_kind":"pith_short_12","alias_value":"SFMZFF5SWEEB","created_at":"2026-06-02T03:04:57.874137+00:00"},{"alias_kind":"pith_short_16","alias_value":"SFMZFF5SWEEBVICM","created_at":"2026-06-02T03:04:57.874137+00:00"},{"alias_kind":"pith_short_8","alias_value":"SFMZFF5S","created_at":"2026-06-02T03:04:57.874137+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/SFMZFF5SWEEBVICMCJSJHADQZW","json":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW.json","graph_json":"https://pith.science/api/pith-number/SFMZFF5SWEEBVICMCJSJHADQZW/graph.json","events_json":"https://pith.science/api/pith-number/SFMZFF5SWEEBVICMCJSJHADQZW/events.json","paper":"https://pith.science/paper/SFMZFF5S"},"agent_actions":{"view_html":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW","download_json":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW.json","view_paper":"https://pith.science/paper/SFMZFF5S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02389&json=true","fetch_graph":"https://pith.science/api/pith-number/SFMZFF5SWEEBVICMCJSJHADQZW/graph.json","fetch_events":"https://pith.science/api/pith-number/SFMZFF5SWEEBVICMCJSJHADQZW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW/action/storage_attestation","attest_author":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW/action/author_attestation","sign_citation":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW/action/citation_signature","submit_replication":"https://pith.science/pith/SFMZFF5SWEEBVICMCJSJHADQZW/action/replication_record"}},"created_at":"2026-06-02T03:04:57.874137+00:00","updated_at":"2026-06-02T03:04:57.874137+00:00"}