I kind of like this version of Take Five from Sachal Music.

Sometimes the Library of Congress does awesome things. This jukebox is up there.

I wouldn’t have believed before that there is money in a bannass stand, but I could be wrong.

The clarity in this press nugget leaves a lot to be desired. The statement “the trio has found a way to determine the smallest number of nodes that must be externally controlled to force a given network from any initial state to any desired final state,” is so vague! The full article is here. It turns out they are looking at a linear control problem $d\mathbf{x}/dt = A \mathbf{x}(t) + B \mathbf{u}(t)$ where the different elements of the state are related via a graph matched to $A$ and you want the input $\mathbf{u}(t)$ to only be nonzero on a subset of the nodes. Thanks to Ann Wehman for the pointer.