The vanishing minimal deviation angle conjecture for networks

Let $N$ be the dimension of the network, and let the minimal deviation angle be the minimum deviation angle arising from the network's admissible vectors as defined in the surrounding discussion. Vanishing minimal deviation angle conjecture. The minimal deviation angle is equal to zero for any $N$. The claim is proved in the source for $N=2$, while the general case is presented as very likely but is not established there.