What happened
Researchers proved that the two main ways to fix broken deep neural networks on graph data are mathematically impossible to solve perfectly—they're NP-hard problems, meaning no known efficient algorithm exists. This explains why researchers use approximations and heuristics in practice instead of searching for perfect solutions, which would take forever.
Why it matters
This is a theoretical ceiling: it establishes that certain fundamental improvements to how neural networks process graph-structured data (like social networks or molecular structures) cannot be solved exactly at scale, which justifies engineering shortcuts and tells practitioners where to stop looking for better exact algorithms.