Citation for finding node disjoint paths using maximum flow
This reduction appears in §4 (Menger's theorem) of ON THE MAX-FLOW MIN-CUT THEOREM OF NETWORKS, G. B. Dantzig and D. R. Fulkerson without citation to another work. It's possible that this was a reinvention, but it's not clear to me where to look next.