List-size conjecture for Reed–Solomon codes beyond the Johnson radius

For a code of rate $R$ over a finite field, list-decodable from relative radius $r$ with list size $L$ means that every Hamming ball of radius $r n$ contains at most $L$ codewords. List-size conjecture beyond the Johnson radius. For any $R,\epsilon>0$, there exist Reed–Solomon codes with rate $R$ over a sufficiently large finite field that are list-decodable from radius $1-R-\epsilon$ with list size at most $\frac{1-R-\epsilon}{\epsilon}$. This gives an explicit target for the list size as the decoding radius approaches the rate-one capacity threshold; the source presents it as implied by the preceding conjecture and does not report a proof or disproof.