Asymptotic capacity conjecture for PIR from MDS-coded colluding and adversarial servers

Assume $n>k+t+2b+r-1$, where $t$, $b$, and $r$ are the numbers of colluding, Byzantine, and nonresponsive servers, respectively. Consider PIR from an $(n,k)$ MDS storage code with $t$-collusion, $b$ Byzantine servers, and $r$ nonresponsive servers.

Asymptotic PIR capacity conjecture. The asymptotic capacity as the number of files $m$ tends to infinity is

$$1-\frac{k+t+2b+r-1}{n}.$$

This conjecture concerns the cases in which the relevant parameters are known, namely $k=1$ or $t=1$, where the symmetric capacity coincides with the asymptotic nonsymmetric capacity. Its resolution is not established in the supplied text.