Strong saturation of a uniform hypergraph ($e\notin E(H)⟹\exists T\supseteq e:T^{(r)}\setminus \{e\}\subseteq E(H)$)

An $r$-uniform hypergraph is strongly saturated with respect to a complete uniform hypergraph of order $r+t$ when every missing edge immediately completes such a clique. Existing cliques are allowed. All $r$-sets meeting a fixed $t$-set give an example: the witness for a missing edge is its union with that fixed set. It has $\left(\genfrac{}{}{0ex}{}{n}{r}\right)-\left(\genfrac{}{}{0ex}{}{n-t}{r}\right)$ edges, and the exterior-power quotient bound for strong hypergraph saturation proves optimality.