Recovery threshold under noisy unweighted projections

Determine the partial recovery threshold for a d-uniform Erdős–Rényi random hypergraph when each edge of its unweighted projection is independently flipped with a fixed probability.

Background

The paper studies recovery from noiseless unweighted and weighted projections and determines sharp exact and partial recovery thresholds in those settings. It proposes extending the model by independently flipping every edge of the unweighted projection with a fixed noise probability. The authors expect such noise to reduce the partial recovery threshold but leave the resulting threshold unresolved.