{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreielekbikqslnk7rdkmxy3cw7jltxvcnd3d4qcjrcwtwy3luvolkey",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mg4u44ki4kt2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2603.01268v1",
  "publishedAt": "2026-03-03T01:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Alexander Morgan",
    "Chenghao Guo"
  ],
  "textContent": "**Authors:** Alexander Morgan, Chenghao Guo\n\nWe formulate and analyze a heterogeneous random hypergraph model, and we provide an achieveability result for recovery of hyperedges from the observed projected graph. We observe a projected graph which combines random hyperedges across all degrees, where a projected edge appears if and only if both vertices appear in at least one hyperedge. Our goal is to reconstruct the original set of hyperedges of degree $d_j$ for some $j$. Our achievability result is based on the idea of selecting maximal cliques of size $d_j$ in the projected graph, and we show that this algorithm succeeds under a natural condition on the densities. This achievability condition generalizes a known threshold for $d$-uniform hypergraphs with noiseless and noisy projections. We conjecture the threshold to be optimal for recovering hyperedges with the largest degree.",
  "title": "Achievability of Heterogeneous Hypergraph Recovery from its Graph Projection"
}