How about this? It's short, it's sweet and is happening now.
Jacob Holm was flipping through proofs from an October 2019 research paper he and colleague Eva Rotenberg—an associate professor in the department of applied mathematics and computer science at the Technical University of Denmark—had published online, when he discovered their findings had unwittingly given away a solution to a centuries-old graph problem.
The original paper: Worst-Case Polylog Incremental SPQR-trees: Embeddings, Planarity, and Triconnectivity
