Perhaps so. If you hunt you might be able to find a new summary table somewhere (I didn't find one in a very brief skim around). My impression was this new work was more about high-dimensional cases than necessary a dramatic improvement for every low-dimensional example.

I mean, it says it directly in the article:

> His result has also revived a debate in the field about the nature of the optimal packing in arbitrarily high dimensions. For a while, mathematicians considered highly symmetric, lattice-based packings to be the best way to arrange spheres as densely as possible. But in 2023, a team found a packing that didn’t rely neatly on a repeating lattice; before Klartag’s result, it was the record to beat. Some mathematicians saw it as evidence that more disorder was needed in the search for an optimal sphere packing.

Clearly, this improvement doesn't apply to the few dimensions for which we already proven optimal packing, but the proof was general.

If you click through to the link from your quoted sentence, the 2023 paper "provided a new recipe for how to densely pack spheres in all arbitrarily high dimensions", and from the description the new paper also seems to address the same question.

This is different from asking about the best-known specific packing in n dimensions when n = 7, 10, 19, or whatever.

In a few of the specific low dimensional cases, my impression is that the best currently known packing is not regular, and I don't see any evidence that this has changed. Perhaps this new method will give people a way to beat those records, or perhaps not.