A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

Abstract: Traditional shortest-path graph kernels generate for each graph a histogram-like feature map, whose elements represent the number of occurrences of non-isomorphic shortest paths in this ...

I was surprised to find no issue (not even a closed one) tracking these missing features in CLN, so here we are. Rather than using P2WSH multisignature outputs for channel funding, we can use MuSig2 ...