For a digraph $D$, a subset $Q\subseteq V(D)$ is called a $q$-kernel if $Q$ is an independent set and all vertices in $V(D)$ are reachable from $Q$ via a directed path of length at most $q$. Given integers $q\geq 2$ and $δ\geq 1$, Spiro arXiv:2404.07305 [math.CO] posed the question: what is the smallest constant $c_{δ,q}$ such that every digraph $D$ with minimum in-degree $δ$ has a $q$-kernel of size at most $c_{δ,q}|V(D)|$? We show the constants $c_{δ,q}$ are monotone in both $δ$ and $q$, and we improve upon the known upper bounds for $c_{δ,q}$. Our main results show $\frac{1}{δ+1} \leq c_{δ,q}\leq \frac{1}{\lfloor\sqrt{δ+1}\rfloor+1}$ for all $q \geq 3$ and $δ\geq 1$, and $ c_{δ,q}=\frac{1}{δ+1}$ whenever $δ\geq 1$ and $q \geq \left\lceil\frac{3δ}{2}\right\rceil + 1$.