Before revision:  In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on h-uniform hypergraphsover n nodes .
After revision:  In this work, we consider the problem of recovery a planted k-densest sub-hypergraph on d-uniform hypergraphs .