Guy's conjecture on the crossing number for complete graphs

Is there a drawing of any complete graph with fewer crossings than the number given by his upper bound?

Open the “Graph drawing and embedding” section on Wikipedia →

Source: List of unsolved problems in mathematics (CC BY-SA 4.0)