Universe Reduction for APSP: Equivalence of Three Fine-Grained Hypotheses

Abstract: The APSP Hypothesis states that the All-Pairs Shortest Paths (APSP) problem requires time $n<sup>{3-o(1)}$ on graphs with polynomially bounded integer edge weights. Two increasingly stronger assumptions are the Strong APSP Hypothesis and the Directed Unweighted APSP Hypothesis, which state that the fastest-known APSP algorithms on graphs with small weights and unweighted graphs, respectively, are best-possible. In this paper, we design an efficient universe reduction for APSP, which proves that these three hypotheses are, in fact, equivalent, conditioned on $ω= 2$ and a plausible additive combinatorics assumption. Along the way, we resolve the fine-grained complexity of many long-standing graph and matrix problems with "intermediate" complexity such as Node-Weighted APSP, All-Pairs Bottleneck Paths, Monotone Min-Plus Product in certain settings, and many others, by designing matching APSP-based lower bounds.

• The paper introduces select-plus rank and a low-rank Exact Triangle algorithm that runs in n^{3+o(1)}(r/n^{3−ω})^{1/200000} time, enabling subcubic algorithms for structurally simple APSP instances.
• The paper proves that Strong APSP and Directed Unweighted APSP are equivalent when ω=2, while equivalence with standard APSP additionally relies on the Sum-Order-Preserving Hashing Hypothesis.
• The paper derives the first primary-APSP-based lower bounds for several intermediate problems, including Node-Weighted APSP, bottleneck paths, and Min Product, yielding n^{2.5−o(1)} bounds that match known upper bounds when ω=2.

Overview

This paper, by Nick Fischer, establishes that three increasingly strong fine-grained complexity hypotheses about the All-Pairs Shortest Paths (APSP) problem are equivalent: the APSP Hypothesis (cubic hardness for polynomially bounded integer weights), the Strong APSP Hypothesis (cubic hardness for weights in $\{0,\dots,n^{3-\omega}\}$), and the Directed Unweighted APSP Hypothesis ($\tilde O(n^{2+\mu})$-hardness for unweighted directed graphs). The equivalence holds conditioned on two assumptions: $\omega = 2$ and a new additive combinatorics hypothesis concerning sum-order-preserving hashing. As a by-product of the unconditional parts of the technique, the paper derives matching APSP-based lower bounds for a range of "intermediate" graph and matrix problems whose complexities lie strictly between $\tilde O(n^\omega)$ and $O(n^3)$ — including Node-Weighted APSP, All-Pairs Bottleneck Paths, Min Product, Min-Equality Product, and row-monotone bounded-difference Min-Plus Product. Prior to this work, no non-trivial lower bound under any primary hypothesis was known for any such intermediate problem.

Background: the three hypotheses

The APSP Hypothesis postulates that APSP on graphs with integer weights in $\{0,\dots,n^c\}$ requires time $n^{3-o(1)}$; the best-known algorithm runs in $n^3/2^{\tilde O(\sqrt{\log n})}$ time (2603.27736). The Strong APSP Hypothesis restricts this to small universes: since min-plus products with entries in $\{0,\dots,u\}$ can be computed in $\tilde O(n^\omega u)$ time via Alon–Galil–Margalit, cubic time is conjectured optimal already at universe size $\tilde O(n^{2+\mu})$0. Conversely, Zwick's algorithm solves directed unweighted APSP in $\tilde O(n^{2+\mu})$1 time, where $\tilde O(n^{2+\mu})$2 is a rectangular matrix multiplication constant; the Directed Unweighted APSP Hypothesis asserts this is optimal. Via reductions due to Shoshan–Zwick and Chan–Vassilevska W.–Xu, all three hypotheses admit clean characterizations as statements about rectangular min-plus products with bounded entries:

Hypothesis	Min-plus characterization
APSP	$\tilde O(n^{2+\mu})$3
Strong APSP	$\tilde O(n^{2+\mu})$4
Directed Unweighted APSP	$\tilde O(n^{2+\mu})$5

When $\tilde O(n^{2+\mu})$6, the Directed Unweighted Hypothesis implies the Strong Hypothesis, which implies the APSP Hypothesis. The paper's contribution is to prove the two converse directions, i.e., to construct universe reductions: from large weights down to weights bounded by $\tilde O(n^{2+\mu})$7 (large-universe reduction), and from weights bounded by $\tilde O(n^{2+\mu})$8 down to no weights at all (small-universe reduction).

The restriction to $\tilde O(n^{2+\mu})$9 is argued to be essentially unavoidable: both secondary hypotheses depend on matrix multiplication constants ($\omega = 2$0 and $\omega = 2$1), and an equivalence would tightly relate them; only under $\omega = 2$2 does the trivial relation $\omega = 2$3 become tight, so only then would the equivalence carry no surprising implications about these constants.

Select-plus rank and low-rank min-plus product

The central technical innovation is a new structural parameter called select-plus rank. A matrix $\omega = 2$4 has select-plus rank $\omega = 2$5 if each entry $\omega = 2$6 can be written as one of $\omega = 2$7 sums $\omega = 2$8, where $\omega = 2$9 and $\tilde O(n^\omega)$0. This is analogous to standard rank with multiplication replaced by addition and addition by selection; it is always at most the min-plus rank, ranges from $\tilde O(n^\omega)$1 to $\tilde O(n^\omega)$2, is trivially bounded by the universe size, and is submultiplicative under entry-wise addition.

The key algorithmic result is a subcubic algorithm for low-rank Exact Triangle: given matrices $\tilde O(n^\omega)$3 where $\tilde O(n^\omega)$4 comes with a select-plus rank-$\tilde O(n^\omega)$5 decomposition, all exact triangles can be found in deterministic time

$\tilde O(n^\omega)$6

which is truly subcubic whenever $\tilde O(n^\omega)$7. This unifies and generalizes previously studied tractable regimes of APSP: sparse graphs, small-weight graphs, node-weighted graphs, and graphs with few distinct edge weights per node. Notably, the algorithm also improves the recursion structure of the prior few-weights-per-node algorithm of Abboud, Fischer, Jin, Vassilevska W., and Xi, replacing a polynomial dependence on $\tilde O(n^\omega)$8 in the exponent loss with a linear one.

The proof proceeds through a four-step chain of potential-adjusting reductions from low-rank instances to uniform low-doubling instances (solvable subcubically via an algebraic algorithm): low-rank → slice-uniform → uniform → uniform regular → uniform low-doubling. Two ingredients are new. First, a decomposition lemma showing that any rank-$\tilde O(n^\omega)$9 matrix splits into a row-regular part, a column-regular part, and a part of rank at most $O(n^3)$0 (recursed upon); this relies on a derandomized conflict-free covering argument based on conditional expectations. Second, an improved regularization step that recurses on only constantly many strictly-lower-rank instances rather than polynomially many slice-uniform ones, which is what yields the linear-in-$O(n^3)$1 exponent loss.

A useful conceptual consequence is a statement about pseudo-witnesses: in any hard min-plus product instance, every output entry has at most $O(n^3)$2 indices $O(n^3)$3 that become witnesses after rounding entries to multiples of $O(n^3)$4. Otherwise the product matrix has select-plus rank $O(n^3)$5 and can be computed subcubically.

Small-universe reduction

Using the pseudo-witness machinery with $O(n^3)$6, the paper proves that if directed unweighted APSP admits an $O(n^3)$7-time algorithm, then the Strong APSP Hypothesis fails. Concretely, $O(n^3)$8 reduces to $O(n^3)$9 instances of $\{0,\dots,n^c\}$0: unpopular output entries are handled by random sampling plus witness listing, while popular entries are handled by constructing a low-rank approximation of the product and solving a rank-$\{0,\dots,n^c\}$1 Exact Triangle instance. Combined with the known equivalence between rectangular min-plus products and directed unweighted APSP, this proves the equivalence of the Strong APSP and Directed Unweighted APSP Hypotheses when $\{0,\dots,n^c\}$2.

More generally, the reduction interpolates across all weight bounds: assuming $\{0,\dots,n^c\}$3, Zwick's $\{0,\dots,n^c\}$4-time algorithm for directed graphs with weights in $\{0,\dots,n^c\}$5 and Shoshan–Zwick's $\{0,\dots,n^c\}$6-time algorithm for undirected graphs are shown optimal for every constant $\{0,\dots,n^c\}$7, conditioned on the Strong APSP Hypothesis. This is a rare instance of two explicitly formulated fine-grained hypotheses being proven equivalent, and moreover of two problems with identical input/output sizes but different complexities ($\{0,\dots,n^c\}$8 versus $\{0,\dots,n^c\}$9) being equivalent.

Doubling reduction

For the large-universe direction, the first step is an unconditional result: APSP reduces to instances whose edge-weight set $n^{3-o(1)}$0 satisfies $n^{3-o(1)}$1 and $n^{3-o(1)}$2 for any constant $n^{3-o(1)}$3. Ignoring the doubling constraint, this already shows that worst-case APSP instances need only $n^{3-o(1)}$4 distinct weights rather than the naive upper bound of $n^{3-o(1)}$5. Technically, the proof scales the instance over $n^{3-o(1)}$6 levels, classifies output entries by their number of $n^{3-o(1)}$7-pseudo-witnesses at each scale, and exploits the transition point where this count jumps past $n^{3-o(1)}$8: below it, listing pseudo-witnesses suffices; above it, the rounded product has low select-plus rank and the low-rank Exact Triangle algorithm applies. The reduction is stated for rectangular dimensions and preserves uniformity, regularity, and doubling constraints, yielding corollaries that convert hypothetical subcubic algorithms for structured min-plus products into violations of the APSP Hypothesis.

Conditional large-universe reduction

The second step toward the full universe reduction is conditional on a new assumption motivated by additive combinatorics. A function $n^{3-o(1)}$9 is sum-order-preserving if $n^3/2^{\tilde O(\sqrt{\log n})}$0 implies $n^3/2^{\tilde O(\sqrt{\log n})}$1. Such a hash into $n^3/2^{\tilde O(\sqrt{\log n})}$2 would immediately reduce low-doubling min-plus products to small-universe ones, but naive pigeonhole arguments show no such function exists for arbitrary $n^3/2^{\tilde O(\sqrt{\log n})}$3. Combining order-preserving Freiman isomorphisms (Amirkhanyan–Bush–Croot) with Sanders' quasi-polynomial Freiman–Ruzsa bounds, the paper shows that every set $n^3/2^{\tilde O(\sqrt{\log n})}$4 of doubling $n^3/2^{\tilde O(\sqrt{\log n})}$5 contains a subset of size $n^3/2^{\tilde O(\sqrt{\log n})}$6 admitting such a hash. Since the required coverage fraction must be polynomial in $n^3/2^{\tilde O(\sqrt{\log n})}$7, the paper formulates the Sum-Order-Preserving Hashing Hypothesis (a computational strengthening of the Polynomial Freiman-Ruzsa Conjecture for integers) and proves, conditioned on it together with $n^3/2^{\tilde O(\sqrt{\log n})}$8, that the APSP and Strong APSP Hypotheses are equivalent. The author argues that some such additive-combinatorics assumption appears unavoidable, since a universe reduction implicitly answers the structural question underlying Freiman–Ruzsa; notably, however, none of the lower-bound applications require this hypothesis.

Lower bounds for intermediate problems

Because the lower-bound applications rely only on the unconditional doubling reduction, they yield clean $n^3/2^{\tilde O(\sqrt{\log n})}$9 lower bounds under the primary APSP Hypothesis alone, matching known upper bounds whenever $\{0,\dots,u\}$0. The main results are:

Problem	Lower bound	Matching upper bound (if $\{0,\dots,u\}$1)
Node-Weighted APSP (undirected)	$\{0,\dots,u\}$2	$\{0,\dots,u\}$3
All-Pairs Bottleneck Paths	$\{0,\dots,u\}$4	$\{0,\dots,u\}$5
Row-monotone bounded-difference Min-Plus Product	$\{0,\dots,u\}$6	$\{0,\dots,u\}$7
Min Product / Min-Max Product / Min-Equality Product	$\{0,\dots,u\}$8	$\{0,\dots,u\}$9
Min-Witness Product	$\tilde O(n^\omega u)$0 (non-matching)	$\tilde O(n^\omega u)$1

Via known equivalences, the bottleneck-paths bound also settles All-Pairs Nondecreasing Paths and $\tilde O(n^\omega u)$2-approximate APSP for strongly polynomial algorithms. The Node-Weighted APSP bound strengthens a prior Directed-Unweighted-based bound of Chan, Vassilevska W., and Xu to rest on the primary hypothesis, via a four-layered undirected node-weighted gadget encoding rectangular min-plus products. The monotone min-plus bound is technically the most involved: starting from low-doubling (rather than small-universe) instances, entries are replaced by their ranks in the sorted sumset, and a carefully constructed function $\tilde O(n^\omega u)$3 interpolates gaps so that the resulting matrix is row-bounded-difference, with bad pairs corrected by brute force using the regularity condition. For Min-Witness Product, the paper improves the prior best APSP-independent status by giving an $\tilde O(n^\omega u)$4 bound based on the APSP Hypothesis itself, though it remains non-matching.

Limitations and open questions

The equivalence of all three hypotheses rests on two assumptions that deserve scrutiny. First, $\tilde O(n^\omega u)$5 is used throughout; the author argues this is inherent because the hypotheses reference distinct matrix multiplication constants, though all results remain meaningful for $\tilde O(n^\omega u)$6 in weakened forms. Second, the Sum-Order-Preserving Hashing Hypothesis is new and unproven; its quasi-polynomial version is currently the state of the art, and its resolution is tied to the integer Polynomial Freiman-Ruzsa Conjecture, which remains open even after the recent characteristic-2 breakthrough of Gowers, Green, Manners, and Tao. A weaker variant tolerating an $\tilde O(n^\omega u)$7 loss suffices for all consequences. The author concedes the irony that proving hypotheses equivalent required introducing another hypothesis, but notes it is purely mathematical rather than complexity-theoretic.

Several specific questions remain open: whether the column-monotone variant of bounded-difference Min-Plus Product admits a matching lower bound (only the row-monotone case is resolved); whether the Min-Witness Product gap between $\tilde O(n^\omega u)$8 and $\tilde O(n^\omega u)$9 can be closed; whether a universe reduction from real-weighted to integer-weighted APSP exists (parts of the current technique inherently rely on finite bit representations); and whether the select-plus rank framework can be pushed further, potentially even toward challenging the APSP Hypothesis itself.

Conclusion

This paper makes substantial progress on consolidating the hypothesis landscape of fine-grained complexity around APSP. It introduces select-plus rank as an expressive structural parameter with a genuinely subcubic low-rank Exact Triangle algorithm, uses it to prove the equivalence of the Strong APSP and Directed Unweighted APSP Hypotheses (conditionally on $\tilde O(n^{2+\mu})$00), and — conditionally additionally on a plausible additive combinatorics assumption — extends the equivalence to the primary APSP Hypothesis. Independently of the conditional results, the unconditional doubling reduction yields the first matching lower bounds under a primary hypothesis for numerous intermediate-complexity problems, effectively closing them whenever $\tilde O(n^{2+\mu})$01.