One can prove that there is theoretical identifiability of the rank and the parameters of an FST distribution, using a rank minimization formulation.
this problem is NP-hard, and it remains open whether there exists a polynomial method with identifiability results.