Author Correction: Hypergraph reconstruction from network data

The authors have corrected the mistake and verified that the properties of Eq. (12) derived in the original article still hold. They have also re-ran every calculation using the updated equation. The empirical findings are qualitatively unchanged; the authors have found highly similar compression ratios when comparing the clique descriptions to the optimal descriptions obtained by minimising the description length (DL). The exact values of the minimum description length (MDL) are different since the modification to Eq. (12) changes the absolute value of P(H), and since the Monte Carlo Markov chain algorithm is stochastic and therefore yields slightly different results from runs to runs. Below is a detailed list of changes brought about by modifying Eq. (12) and running new simulations.