AIProofWatch
← Explore interestsIndividual problem

Formalization of 3SUM and shortest-path algorithms

3SUM looks for three input numbers summing to zero; all-pairs shortest paths computes distances between every pair of graph vertices.

Progress records 1

Understand the problem ↓

1 record · How we rate progress

Understanding the problem

Read the background

3SUM looks for three input numbers summing to zero; all-pairs shortest paths computes distances between every pair of graph vertices. A formalized complexity bound must include the machine model and integer-size assumptions.

This guide separates the original research claim from the status of any supporting formal artifact. Compare statements before comparing evidence badges.

Why it matters

A concrete target that separates mathematical novelty, formalization, and evidence.

What counts as progress

A new precisely scoped theorem, construction, bound, or documented formalization, compared with the relevant baseline.

What to watch for

  • Read the exact theorem and restrictions in the original source.
  • Separate a result’s discovery from its formalization and later independent checking.
  • Retain prior work, revisions, and the contribution of human researchers.

Background review: 2026-10-11. Selected sources:

Website timeline

Publication dates and editorial changes.