In this paper, we introduce a variation of the group testing problem where each test is specified by an ordered subset of items and returns the first defective item in the specified order or returns null if there are no defectives. The goal is to identify a small set of$K$defective items amongst a collection of size N, using as few tests as possible for perfect recovery. For the adaptive testing regime, we show that a simple scheme can find all defective items in at most$K$tests, which is optimal. For the non-adaptive setting, we first come up with a necessary and sufficient condition for any collection of tests to be feasible for recovering all the defectives. Using this, we show that any feasible non-adaptive strategy requires at least$\Omega(K^{2})$tests. In terms of achievability, it is easy to show the existence of a feasible collection of$O(K^{2}\log(N/K))$tests. We show via carefully constructed explicit designs that one can do significantly better for constant$K$. While the cases$K=1,2$are straightforward, the case$K=3$is already non-trivial and we come up with an iterative design that is asymptotically optimal and requires$\Theta(\log \log N)$, tests. Note that this is in contrast to standard binary group testing, where at least$\Omega(\log N)$tests are required. For constant$K\geq 3$, our iterative design requires only poly($\log \log N$) tests.

A graph $G$ is said to be $k$-distinguishable if the vertex set can be colored using $k$ colors such that no non-trivial automorphism fixes every color class, and the distinguishing number $D(G)$ is the least integer $k$ for which $G$ is $k$-distinguishable. If for each $v\in V(G)$ we have a list $L(v)$ of colors, and we stipulate that the color assigned to vertex $v$ comes from its list $L(v)$ then $G$ is said to be $\mathcal{L}$-distinguishable where $\mathcal{L} =\{L(v)\}_{v\in V(G)}$. The list distinguishing number of a graph, denoted $D_l(G)$, is the minimum integer $k$ such that every collection of lists $\mathcal{L}$ with $|L(v)|=k$ admits an $\mathcal{L}$-distinguishing coloring. In this paper, we prove that $D_l(G)=D(G)$ when $G$ is a Kneser graph.