{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:6SVQSR7FUI2PYHMEWQMKAPMAOH","short_pith_number":"pith:6SVQSR7F","schema_version":"1.0","canonical_sha256":"f4ab0947e5a234fc1d84b418a03d8071ed6f1dade42711f1ac6ec9e0f3a33308","source":{"kind":"arxiv","id":"2509.07934","version":1},"attestation_state":"computed","paper":{"title":"Ramsey numbers of trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Yan, Mat\\'ias Pavez-Sign\\'e, Richard Montgomery","submitted_at":"2025-09-09T17:17:10Z","abstract_excerpt":"We show that there exists a constant $c>0$ such that every $n$-vertex tree $T$ with $\\Delta(T)\\le cn$ has Ramsey number $R(T)=\\max\\{t_1+2t_2,2t_1\\}-1$, where $t_1\\ge t_2$ are the sizes of the bipartition classes of $T$. This improves an asymptotic result of Haxell, {\\L}uczak, and Tingley from 2002, and shows that, though Burr's 1974 conjecture on the Ramsey numbers of trees has long been known to be false for certain `double stars', it is true for trees with up to small linear maximum degree."},"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":"2509.07934","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2025-09-09T17:17:10Z","cross_cats_sorted":[],"title_canon_sha256":"c6db1241ea8e66355ff82a9ae354eb1df0e4d3de1a92860c0059e97c730a97a9","abstract_canon_sha256":"b2fc302729da1cdcf44f73b8dbd1ac75cbcf477d261fe94513f06937d14ca7e6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T12:07:42.722850Z","signature_b64":"/r2e6d30bLjWopSLiPlMv3rqA6k5yq9RTzZjDgcsJtwtZqgSDwODmPWCB8QvkYLkxLLtGc8gigQtcuC3iXyFDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4ab0947e5a234fc1d84b418a03d8071ed6f1dade42711f1ac6ec9e0f3a33308","last_reissued_at":"2026-07-05T12:07:42.722408Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T12:07:42.722408Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ramsey numbers of trees","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jun Yan, Mat\\'ias Pavez-Sign\\'e, Richard Montgomery","submitted_at":"2025-09-09T17:17:10Z","abstract_excerpt":"We show that there exists a constant $c>0$ such that every $n$-vertex tree $T$ with $\\Delta(T)\\le cn$ has Ramsey number $R(T)=\\max\\{t_1+2t_2,2t_1\\}-1$, where $t_1\\ge t_2$ are the sizes of the bipartition classes of $T$. This improves an asymptotic result of Haxell, {\\L}uczak, and Tingley from 2002, and shows that, though Burr's 1974 conjecture on the Ramsey numbers of trees has long been known to be false for certain `double stars', it is true for trees with up to small linear maximum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2509.07934","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/2509.07934/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":"2509.07934","created_at":"2026-07-05T12:07:42.722466+00:00"},{"alias_kind":"arxiv_version","alias_value":"2509.07934v1","created_at":"2026-07-05T12:07:42.722466+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2509.07934","created_at":"2026-07-05T12:07:42.722466+00:00"},{"alias_kind":"pith_short_12","alias_value":"6SVQSR7FUI2P","created_at":"2026-07-05T12:07:42.722466+00:00"},{"alias_kind":"pith_short_16","alias_value":"6SVQSR7FUI2PYHME","created_at":"2026-07-05T12:07:42.722466+00:00"},{"alias_kind":"pith_short_8","alias_value":"6SVQSR7F","created_at":"2026-07-05T12:07:42.722466+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11410","citing_title":"On Balance, To What Degree is Burr's Conjecture True?","ref_index":11,"is_internal_anchor":false},{"citing_arxiv_id":"2606.02389","citing_title":"A degree version of the Burr-Erd\\H{o}s conjecture on trees","ref_index":30,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH","json":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH.json","graph_json":"https://pith.science/api/pith-number/6SVQSR7FUI2PYHMEWQMKAPMAOH/graph.json","events_json":"https://pith.science/api/pith-number/6SVQSR7FUI2PYHMEWQMKAPMAOH/events.json","paper":"https://pith.science/paper/6SVQSR7F"},"agent_actions":{"view_html":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH","download_json":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH.json","view_paper":"https://pith.science/paper/6SVQSR7F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2509.07934&json=true","fetch_graph":"https://pith.science/api/pith-number/6SVQSR7FUI2PYHMEWQMKAPMAOH/graph.json","fetch_events":"https://pith.science/api/pith-number/6SVQSR7FUI2PYHMEWQMKAPMAOH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH/action/storage_attestation","attest_author":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH/action/author_attestation","sign_citation":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH/action/citation_signature","submit_replication":"https://pith.science/pith/6SVQSR7FUI2PYHMEWQMKAPMAOH/action/replication_record"}},"created_at":"2026-07-05T12:07:42.722466+00:00","updated_at":"2026-07-05T12:07:42.722466+00:00"}