Before revision:  Furthermore, our algorithm comes with a number of attractive theoretical properties in terms of recovering nodes sets with low hypergraph conductance and hypergraph normalized cut scores. Finally, and most importantly, our method is strongly-local, meaning that its runtime depends only on the size of an input set.
After revision:  Furthermore, our algorithm comes with a number of attractive theoretical properties in terms of output cluster quality. Most importantly, our method is strongly-local, meaning that its runtime depends only on the size of an input set.