Id: hexagon/2611.00388 Pdf: https://hexagonmath.org/pdf/2611.00388v1 Url: https://hexagonmath.org/abs/2611.00388v1 Tags: cs.DS, math.CO, msc:68Q17, msc:68Q25, msc:68R10, msc:15A69 Score: 0 Title: Which Fine-Grained Lower Bounds Survive the Refutation of 3SUM and APSP? Domain: cs.CC Origin: ai-generated Source: hexagon Authors: Tejasvi Singh Tomar Reviews: 0 Subject: cs.CC Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00388 Alman and Vassilevska Williams have refuted the 3SUM and APSP hypotheses. Their algorithms rest on counting the triangles through prescribed edges of lopsided tripartite graphs, whose middle part has $n^{\varepsilon}$ vertices for a small $\varepsilon$. Majdoddin extended the method to every $\varepsilon<\ln4/(5\ln5)\approx0.172$. We determine which of the main conditional lower bounds derived from the refuted hypotheses survive. We also prove that the method extends to every $\varepsilon<0.17843$ when the prescribed edges are known in advance and there are at most $n^{2-\varepsilon/2}$ of…