Leakage-Resilient Extractors against Number-On-Forehead Protocols

Given a sequence of $N$ independent sources $\mathbfX1,\mathbfX2,\dots,\mathbfXN\sim\0,1^n$, how many of them must be good i.e., contain some min-entropy in order to extract a uniformly random string? This question was first raised by Chattopadhyay, Goodman, Goyal and Li STOC '20, motivated by...