{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreif7xaqqygio7zgpae2kltbbzphxwade4psa2jv3dlxdgmxtk2vypa",
    "uri": "at://did:plc:4rgrdigiftglskeax4wvmsev/app.bsky.feed.post/3mj3l22herdk2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreiflo6xt7is6b2iafwghkjahlgggocme5jwjsbeuqqwcywuvjhmszm"
    },
    "mimeType": "image/png",
    "size": 24783
  },
  "path": "/abs/2604.06590v1",
  "publishedAt": "2026-04-09T00:00:00.000Z",
  "site": "https://arxiv.org",
  "tags": [
    "Pritish Kamath",
    "Ravi Kumar",
    "Pasin Manurangsi"
  ],
  "textContent": "**Authors:** Pritish Kamath, Ravi Kumar, Pasin Manurangsi\n\nWe study two conjectures posed in the analysis of Boolean functions $f : \\\\{-1, 1\\\\}^n \\to \\\\{-1, 1\\\\}$, in both of which, the Majority function plays a central role: the \"Majority is Least Stable\" (Benjamini et al., 1999) and the \"Non-Interactive Correlation Distillation for Erasures\" (Yang, 2004; O'Donnell and Wright, 2012). While both conjectures have been refuted in their originally stated form, we obtain a nearly tight characterization of the noise parameter regime in which each of the conjectures hold, for all $n \\ge 5$. Whereas, for $n=3$, both conjectures hold in all noise parameter regimes. We state refined versions of both conjectures that we believe captures the spirit of the original conjectures.",
  "title": "When Majority Fails: Tight Bounds for Correlation Distillation Conjectures"
}