With ETH Refuted, GNN Chains Tackle the Still-Hard Graph Alignment Problem
marc_lelarge · x · 2026-11-07
Marc Lelarge and collaborators released new combinatorial optimization results: with the Exponential Time Hypothesis refuted, 3-SAT gets a subexponential algorithm, while the Graph Alignment Problem (GAP) remains hard. They propose chaining 2-FWL GNNs to solve GAP, with code and models open-sourced on GitHub (chaining-gnn-graph-alignment, Apache-2.0), corresponding to arXiv:2510.03086, including inference scripts, QAPLIB evaluation and streaming alignment implementations.
More from Research
- Epoch AI Researchers Push for Evidence Transparency in AI R&D Speedup Report Estimating ~2x Acceleration — Jsevillamol · 2026-11-07
- Humanoids at the Edge Workshop Extends CFP to Nov 12, Focuses on Humanoids in Extreme Environments — omarsar0 · 2026-11-07
- Turn gaps average ~200ms: duplex voice models must plan replies mid-listen — smolix · 2026-11-07
- Why Higgs Realtime Duplex uses a 160ms step: it matches human decision speed — smolix · 2026-11-07
- ByteDance experiments suggest Full Bandwidth Transformer matches models twice its size — DimitrisPapail · 2026-11-07
- Ai2 brings 10+ robotics papers to CoRL 2026, spotlighting MolmoAct2 and MolmoBOT — allen_ai · 2026-11-07