In this Supplementary Information, we provide the additional analyses of authors and detail the results for network analysis that we present in the paper. The weighted network is generally represented as a graph G = (V, E, 𝜔) with a weight 𝜔 assigned to each edge, where V is the graph's vertex set, and E is the edge set. We assume that G is a simple undirected graph with no multiple edges or loops, and edges have no orientations.
S1 Author-level analysis
S2 Comparison of the two network filtering techniques
S3 Network statistics
S4 The disciplinary composition of clusters in the networks