Lemma 13 (One-Inclusion Hypergraph Algorithm (See Lemma 17 of [1]})) 

Let \(\mathcal {X}= [n]\)  with \(n \in \mathbb {N}\) , \(k\)  be positive constant and \(\mathcal {H}\subseteq [k]^n\)  be a class with Natarajan dimension \(\mathrm {Ndim}(\mathcal {H}) < \infty \) . There exists an algorithm \(\mathbb {A} : 2^{[k]^X} \times (X \times [k])^{n-1} \times X\)  such that
\(\frac{1}{n!}\sum _{\sigma \sim \mathcal {U}(\mathbb {S}_n)}[\mathbb {A}(\mathcal {H}, \sigma (1), h(\sigma (1)),...,\sigma (n-1), h(\sigma (n-1)), \sigma (n)) \ne h(\sigma (n))] \le \frac{\mathrm {Ndim}(\mathcal {H}) \log (k)}{n}\,,\) 
