Capacity conjecture for symmetric PIR from MDS-coded storage with adversarial servers

Let an $[n,k]$ MDS storage code store a database accessed by a Symmetric Private Information Retrieval scheme, with $t$-colluding servers, $b$ Byzantine servers, and $r$ unresponsive servers. Let $M$ denote the number of messages. Symmetric PIR capacity conjecture. The capacity is

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

Moreover, the symmetrization of the current scheme is capacity-achieving, and the minimum shared randomness entropy per round required among the servers to guarantee symmetry is $k+t-1$ in $q$-ary units. This conjecture concerns both the symmetric PIR capacity and the required shared randomness; the supplied text gives no resolution status.