This is the citation network extracted from the CiteSeer digital library. Nodes are publications and the directed edges denote citations. Publications can cite themselves in this dataset, and therefore the network includes loops. The network was extracted by hand by Jérôme Kunegis before the start of the KONECT project, and therefore no extraction code remains.


Internal nameciteseer
Data source
AvailabilityDataset is available for download
Consistency checkDataset passed all tests
Citation network
Node meaningPublication
Edge meaningCitation
Network formatUnipartite, directed
Edge typeUnweighted, no multiple edges
ReciprocalContains reciprocal edges
Directed cyclesContains directed cycles
LoopsContains loops


Size n =384,413
Volume m =1,751,463
Wedge count s =81,727,579
Claw count z =9,032,698,085
Cross count x =1,888,767,722,244
Triangle count t =1,351,820
Square count q =25,382,500
4-Tour count T4 =533,442,606
Maximum degree dmax =1,739
Maximum outdegree d+max =289
Maximum indegree dmax =1,739
Average degree d =9.112 40
Fill p =1.185 24 × 10−5
Size of LCC N =365,154
Size of LSCC Ns =16,208
Relative size of LSCC Nrs =0.042 163 0
Diameter δ =34
50-Percentile effective diameter δ0.5 =5.645 46
90-Percentile effective diameter δ0.9 =7.957 12
Mean distance δm =6.348 17
Gini coefficient G =0.578 549
Relative edge distribution entropy Her =0.945 199
Power law exponent γ =1.634 33
Tail power law exponent γt =2.731 00
Degree assortativity ρ =−0.061 826 4
Degree assortativity p-value pρ =0.000 00
In/outdegree correlation ρ± =−0.044 933 1
Clustering coefficient c =0.049 621 7
Spectral norm α =58.653 4
Operator 2-norm ν =49.521 6
Cyclic eigenvalue π =7.065 03
Algebraic connectivity a =0.004 605 12
Spectral separation 1[A] / λ2[A]| =1.082 53
Reciprocity y =0.013 567 5
Non-bipartivity bA =0.286 994
Normalized non-bipartivity bN =0.004 807 89
Spectral bipartite frustration bK =0.000 262 567
Controllability C =202,319


Degree distribution

Cumulative degree distribution

Lorenz curve

Spectral distribution of the adjacency matrix

Spectral distribution of the normalized adjacency matrix

Spectral distribution of the Laplacian

Spectral graph drawing based on the adjacency matrix

Spectral graph drawing based on the Laplacian

Spectral graph drawing based on the normalized adjacency matrix

Hop distribution

In/outdegree scatter plot

Clustering coefficient distribution


Matrix decompositions plots



[1] Jérôme Kunegis. KONECT – The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion, pages 1343–1350, 2013. [ http ]
[2] Kurt Bollacker, Steve Lawrence, and C. Lee Giles. CiteSeer: An autonomous Web agent for automatic retrieval and identification of interesting publications. In Proc. Int. Conf. on Auton. Agents, pages 116–123, 1998.