A new arXiv paper (2509.10711) considers the gathering problem in an (N,f)-fault system: N robots are present, and at most f may fail at any execution. The traditional version of the problem asks that N-f non-faulty robots gather together, and the authors treat this as a benchmarking problem.
The paper's title points to two additional constraints: the system is asynchronous, and the robots are opaque. While the abstract does not spell out the algorithm or results, the term "indulgent" suggests an approach that remains correct even when timing assumptions are relaxed.
The abstract stops at the problem statement, so the article does not report specific outcomes. It does, however, highlight a fault-tolerant variant of gathering that combines failure tolerance with visibility restrictions imposed by opaque robots.