Nobody who can reach one of a key's components or shares, or the medium carrying it, can also reach enough of its other components or shares, or the media holding them, to reach the number needed to rebuild it; in an m-of-n scheme resting on a recognised secret-sharing algorithm, no individual may hold m shares.
The graph holds this control, the 0 it maps to, and the evidence behind each claim, over MCP and REST.