Container fingerprint ($T\subseteq I\subseteq C(T)$)

A container fingerprint is a small vertex subset $T$, usually contained in a hypergraph independent set $I$, which determines a container $C(T)$ containing $I$. A deterministic membership-query algorithm records positive answers in $T$ and uses negative answers to remove vertices from the container. Reconstruction from $T$ follows the golden rule for container algorithms.