A hypergraph contains edges that connect more than two vertices — triangles, quadruples, larger groupings. Its graph projection keeps only the pairwise connections: if two vertices share any hyperedge, they get a graph edge. The projection is lossy. A triangle of pairwise edges could come from a single 3-hyperedge or from three separate 2-edges. The shadow tells you who is connected but not the structure of the connection.
Morgan and Guo ask when the original hypergraph can be recovered from its projection. Their model is heterogeneous — hyperedges of different sizes coexist, each with its own density parameter. The algorithm uses maximal cliques: a d-hyperedge appears as a clique of size d in the projection, so finding maximal cliques of the right size identifies candidate hyperedges. The central result is that this algorithm succeeds under a natural condition on the densities, generalizing known thresholds for uniform hypergraphs.
The through-claim is about the conditions under which dimensionality reduction is reversible. The projection from hypergraph to graph is a reduction from higher-order structure to pairwise structure — the same kind of information loss that occurs whenever a complex relationship is approximated by its marginals. The recovery theorem says this loss is not always permanent. If the densities are right — if higher-order connections are rare enough relative to pairwise ones — the projection contains enough information to reconstruct what was lost. The shadow is sufficient for the solid, but only when the solid is sparse enough that its shadow doesn't overlap with itself.