Nobody who can access one component or share of a key, or the medium holding it, can also reach enough other components or shares of that same key to meet the threshold that would form it; under an m-of-n Shamir-type scheme, no single person holds m shares.
The graph holds this control, the 0 it maps to, and the evidence behind each claim, over MCP and REST.