Conjecture on reciprocal Carmichael-function sums over integers with prescribed prime signatures

Let $B$, $\sigma$, $t$, $m$, and $\nu$ be as above, and let $\mathcal{K}(t,\sigma)$ be the set of integers with exactly $t$ distinct prime divisors, each having signature matching $\sigma$. For an integer $k$, let $\lambda_{k,m}$ denote the corresponding value of the Carmichael function computed using the first $m$ prime bases. The reciprocal-sum conjecture. One has

$$\sum_{k\le x,\\ k\in\mathcal{K}(t,\sigma)} \frac{1}{\lambda_{k,m}} \ll x^{o(1)}.$$

This conjectural estimate is used to obtain the paper's $B^{2/3+o(1)}$ running-time bound for finding strong pseudoprimes when $t>2$; without it, the paper derives a weaker unconditional bound. The source does not state a resolution of the conjecture.