Nobody who can reach a component or share of a key, or the medium holding it, can also reach enough of that key's other components or shares to reach the number needed to rebuild it; in a Shamir-type m-of-n scheme, no individual holds m shares.
The graph holds this control, the 0 it maps to, and the evidence behind each claim, over MCP and REST.