{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:SYC6YKEFSLL5EB3DLIBPEG7BYU","short_pith_number":"pith:SYC6YKEF","schema_version":"1.0","canonical_sha256":"9605ec288592d7d207635a02f21be1c505e1edbb3641638a4a1dc26fcbd89003","source":{"kind":"arxiv","id":"2606.23659","version":1},"attestation_state":"computed","paper":{"title":"A Resolution of Erd\\H{o}s Problem 550 on Tree versus Complete Multipartite Ramsey Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Li (Trinity College, University of Cambridge)","submitted_at":"2026-06-22T17:45:05Z","abstract_excerpt":"We resolve Erd\\H{o}s Problem 550, originally asked as question (2) of Erd\\H{o}s, Faudree, Rousseau, and Schelp. Precisely, for fixed integers $k\\geq 2$ and $1\\leq m_1\\leq \\cdots \\leq m_k$, we prove that, for every sufficiently large $n$ and every $n$-vertex tree $T$, $R(T,K_{m_1,\\ldots,m_k}) \\leq (k-1)(R(T,K_{m_1,m_2})-1)+m_1$. The proof combines a new off-Tur\\'an tree-embedding theorem with a compactness-and-rounding theorem for represented bounded-rank hypergraph obstructions. The embedding theorem follows from Szemer\\'edi regularity and a local regular-matching embedding lemma of Hladk\\'y a"},"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.23659","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-06-22T17:45:05Z","cross_cats_sorted":[],"title_canon_sha256":"e71bd9021ec222cf88ed53818adf8f4fa8bab1bcb306fd034eede6d42641eba7","abstract_canon_sha256":"d2276e71f0ed41f0e02cc73739bbd31db710b77366f2a700b916922849ebd05f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-23T03:14:33.952227Z","signature_b64":"wyyJsuvIGDbmu3kpZZH52CultxJMLs6s/podyzK6UGyznCJgNXkILCYQIEJYXCoB4BtfNUHGGKPLmuH8lM7oAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9605ec288592d7d207635a02f21be1c505e1edbb3641638a4a1dc26fcbd89003","last_reissued_at":"2026-06-23T03:14:33.951789Z","signature_status":"signed_v1","first_computed_at":"2026-06-23T03:14:33.951789Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Resolution of Erd\\H{o}s Problem 550 on Tree versus Complete Multipartite Ramsey Numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Eric Li (Trinity College, University of Cambridge)","submitted_at":"2026-06-22T17:45:05Z","abstract_excerpt":"We resolve Erd\\H{o}s Problem 550, originally asked as question (2) of Erd\\H{o}s, Faudree, Rousseau, and Schelp. Precisely, for fixed integers $k\\geq 2$ and $1\\leq m_1\\leq \\cdots \\leq m_k$, we prove that, for every sufficiently large $n$ and every $n$-vertex tree $T$, $R(T,K_{m_1,\\ldots,m_k}) \\leq (k-1)(R(T,K_{m_1,m_2})-1)+m_1$. The proof combines a new off-Tur\\'an tree-embedding theorem with a compactness-and-rounding theorem for represented bounded-rank hypergraph obstructions. The embedding theorem follows from Szemer\\'edi regularity and a local regular-matching embedding lemma of Hladk\\'y a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.23659","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.23659/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.23659","created_at":"2026-06-23T03:14:33.951849+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.23659v1","created_at":"2026-06-23T03:14:33.951849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.23659","created_at":"2026-06-23T03:14:33.951849+00:00"},{"alias_kind":"pith_short_12","alias_value":"SYC6YKEFSLL5","created_at":"2026-06-23T03:14:33.951849+00:00"},{"alias_kind":"pith_short_16","alias_value":"SYC6YKEFSLL5EB3D","created_at":"2026-06-23T03:14:33.951849+00:00"},{"alias_kind":"pith_short_8","alias_value":"SYC6YKEF","created_at":"2026-06-23T03:14:33.951849+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/SYC6YKEFSLL5EB3DLIBPEG7BYU","json":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU.json","graph_json":"https://pith.science/api/pith-number/SYC6YKEFSLL5EB3DLIBPEG7BYU/graph.json","events_json":"https://pith.science/api/pith-number/SYC6YKEFSLL5EB3DLIBPEG7BYU/events.json","paper":"https://pith.science/paper/SYC6YKEF"},"agent_actions":{"view_html":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU","download_json":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU.json","view_paper":"https://pith.science/paper/SYC6YKEF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.23659&json=true","fetch_graph":"https://pith.science/api/pith-number/SYC6YKEFSLL5EB3DLIBPEG7BYU/graph.json","fetch_events":"https://pith.science/api/pith-number/SYC6YKEFSLL5EB3DLIBPEG7BYU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU/action/storage_attestation","attest_author":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU/action/author_attestation","sign_citation":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU/action/citation_signature","submit_replication":"https://pith.science/pith/SYC6YKEFSLL5EB3DLIBPEG7BYU/action/replication_record"}},"created_at":"2026-06-23T03:14:33.951849+00:00","updated_at":"2026-06-23T03:14:33.951849+00:00"}