What was already known
Abboud, Fischer, Kelley, Lovett and Meka obtained time using a graph decomposition and asked whether the exponent could be reached.
AI involvement
The authors set the problem and direction. They credit Gemini 4 agents with developing the algorithms and proofs and writing the Lean formalization. The authors verified and edited the paper.
- Section 7, AI disclosureAI work and human attribution
Importance
The result reaches the proposed square-root exponent in the saving over cubic time for both problems.
Technical verification
Cui, Liu and Woodruff report checking the manuscript. Lean checks formal versions of the decomposition and the two runtime bounds with the documented sampler hypotheses and cost accounting.
Independent checking
The authors report verifying the paper’s proofs and algorithms.
- Checker
- Piaoyang Cui, Yiming Liu and David P. Woodruff
- Scope
- Cui, Liu and Woodruff give deterministic combinatorial algorithms that multiply two Boolean matrices or decide if an -vertex graph contains a triangle in time.
- Basis
- Reported by the linked checker
Formal checking
Checked the core theorem statements under explicit sampler and extractor hypotheses. The cost monad represents operation counts.
- Checker
- Lean 4 kernel, as reported by the authors
- Scope
- Cui, Liu and Woodruff give deterministic combinatorial algorithms that multiply two Boolean matrices or decide if an -vertex graph contains a triangle in time.
- Basis
- Reported by the linked checker
- Pinned Lean formalization notesPinned Lean formalization notes
- Main theorem and proof of the two boundsMain theorem and proof of the two bounds
Human understanding
The authors directed and checked the work. The paper credits the agents with the decomposition and gives no separately attributed human explanation of that step.
Other useful sources
Correction and publication history
Added a reviewed earlier manuscript to the research catalog.
Read this published revision