The DOI matches its Crossref record; 96 of the 96 references it cites were found in a registry or an index.
Thinking Like a Vertex: A Survey of Vertex-Centric Frameworks for Large-Scale Distributed Graph Processing
Abstract
The vertex-centric programming model is an established computational paradigm recently incorporated into distributed processing frameworks to address challenges in large-scale graph processing. Billion-node graphs that exceed the memory capacity of commodity machines are not well supported by popular Big Data tools like MapReduce, which are notoriously poor performing for iterative graph algorithms such as PageRank. In response, a new type of framework challenges one to “think like a vertex” (TLAV) and implements user-defined programs from the perspective of a vertex rather than a graph. Such an approach improves locality, demonstrates linear scalability, and provides a natural way to express and compute many iterative graph algorithms. These frameworks are simple to program and widely applicable but, like an operating system, are composed of several intricate, interdependent components, of which a thorough understanding is necessary in order to elicit top performance at scale. To this end, the first comprehensive survey of TLAV frameworks is presented. In this survey, the vertex-centric approach to graph processing is overviewed, TLAV frameworks are deconstructed into four main components and respectively analyzed, and TLAV implementations are reviewed and categorized.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Lecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
The anatomy of a large-scale hypertextual Web search engine
Brin, S., & Page, L. (1998) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(98)00110-x · Cited by 16,004
Advances in neural information processing systems 7
(1996) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(96)90463-0 · Cited by 14,281
(1999) · Cited by 12,854
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
Error and attack tolerance of complex networks
Albert, R., Jeong, H., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35019019 · Cited by 7,534
Error and attack tolerance of complex networksPreprint
Albert, R., Jeong, H., & Barabási, A.-Ĺ. (2000) · Cited by 6,467
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
(2010) · Cited by 4,411
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
Near linear time algorithm to detect community structures in large-scale networks
Raghavan, U. N., Albert, R., & Kumara, S. (2007) · Physical Review E · doi:10.1103/physreve.76.036106 · Cited by 3,502
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
Distributed snapshots: determining global states of distributed systems
Chandy, K. M., & Lamport, L. (1985) · ACM Transactions on Computer Systems · doi:10.1145/214451.214456 · Cited by 2,443
Leskovec, J., Lang, K. J., Dasgupta, A., & Mahoney, M. W. (2009) · Internet Mathematics · doi:10.1080/15427951.2009.10129177 · Cited by 1,872
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653
Distributed Computing: A Locality-Sensitive Approach
Peleg, D. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719772 · Cited by 1,487
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Active messages: a mechanism for integrated communication and computation
von Eicken, T., Culler, D. E., Goldstein, S. C., & Schauser, K. E. (1992) · Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92 · doi:10.1145/139669.140382 · Cited by 1,393
GraphChi: Large-Scale Graph Computation on Just a PC
Kyrola, A., Blelloch, G. E., & Guestrin, C. (2018) · Figshare · doi:10.1184/r1/6605999 · Cited by 868
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
Hierarchical ordering of sequential processes
Dijkstra, E. (1971) · Acta Informatica · doi:10.1007/bf00289519 · Cited by 797
Twister: a runtime for iterative MapReduce
Ekanayake, J., Li, H., Zhang, B., Gunarathne, T., Bae, S.-H., Qiu, J., & Fox, G. (2010) · Proceedings of the 19th ACM International Symposium on High Performance Distributed Computing · doi:10.1145/1851476.1851593 · Cited by 777
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Zhou, Y., Wilkinson, D., Schreiber, R., & Pan, R. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68880-8_32 · Cited by 700
X-Stream: edge-centric graph processing using streaming partitions
Roy, A., Mihailovic, I., & Zwaenepoel, W. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522740 · Cited by 673
Distributed large-scale natural graph factorization
Ahmed, A., Shervashidze, N., Narayanamurthy, S., Josifovski, V., & Smola, A. J. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488393 · Cited by 648
Big-data applications in the government sector
Kim, G.-H., Trimi, S., & Chung, J.-H. (2014) · Communications of the ACM · doi:10.1145/2500873 · Cited by 632
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
A lightweight infrastructure for graph analytics
Nguyen, D., Lenharth, A., & Pingali, K. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522739 · Cited by 579
GPS: a graph processing system
Salihoglu, S., & Widom, J. (2013) · Proceedings of the 25th International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484843 · Cited by 510
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
WTF: the who to follow service at Twitter
Gupta, P., Goel, A., Lin, J., Sharma, A., Wang, D., & Zadeh, R. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488433 · Cited by 461
Streaming graph partitioning for large distributed graphs
Stanton, I., & Kliot, G. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339722 · Cited by 446
Trinity: a distributed graph engine on a memory cloud
Shao, B., Wang, H., & Li, Y. (2013) · Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2463676.2467799 · Cited by 432
GraphLab: A New Framework For Parallel Machine Learning
Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C., & Hellerstein, J. M. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.2041 · Cited by 425
Distributed shared memory: a survey of issues and algorithms
Nitzberg, B., & Lo, V. (1991) · Computer · doi:10.1109/2.84877 · Cited by 421
The Combinatorial BLAS: design, implementation, and applications
Buluç, A., & Gilbert, J. R. (2011) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342011403516 · Cited by 415
Counting triangles and the curse of the last reducer
Suri, S., & Vassilvitskii, S. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963491 · Cited by 408
The drinking philosophers problem
Chandy, K. M., & Misra, J. (1984) · ACM Transactions on Programming Languages and Systems · doi:10.1145/1780.1804 · Cited by 390
Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)
(2008) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898716474 · Cited by 363
From "think like a vertex" to "think like a graph"
Tian, Y., Balmin, A., Corsten, S. A., Tatikonda, S., & McPherson, J. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2732232.2732238 · Cited by 352
FENNEL: streaming graph partitioning for massive scale graphs
Tsourakakis, C., Gkantsidis, C., Radunovic, B., & Vojnovic, M. (2014) · Proceedings of the 7th ACM international conference on Web search and data mining · doi:10.1145/2556195.2556213 · Cited by 341
Evolutionary Network Analysis: A Survey
Aggarwal, C., & Subbian, K. (2014) · ACM Computing Surveys · doi:10.1145/2601412 · Cited by 313
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
Parallel multilevel k-way partitioning scheme for irregular graphs
Karypis, G., & Kumar, V. (1996) · Proceedings of the 1996 ACM/IEEE conference on Supercomputing · doi:10.1145/369028.369103 · Cited by 310
Δ-stepping: a parallelizable shortest path algorithm
Meyer, U., & Sanders, P. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00076-2 · Cited by 309
X10: an object-oriented approach to non-uniform cluster computing
Charles, P., Grothoff, C., Saraswat, V., Donawa, C., Kielstra, A., Ebcioglu, K., von Praun, C., & Sarkar, V. (2005) · ACM SIGPLAN Notices · doi:10.1145/1103845.1094852 · Cited by 301
PowerLyra: differentiated graph computation and partitioning on skewed graphs
Chen, R., Shi, J., Chen, Y., & Chen, H. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741970 · Cited by 299
Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees
Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., & Tsiarli, M. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487645 · Cited by 294
Efficient Parallel Graph Exploration on Multi-Core CPU and GPU
Hong, S., Oguntebi, T., & Olukotun, K. (2011) · 2011 International Conference on Parallel Architectures and Compilation Techniques · doi:10.1109/pact.2011.14 · Cited by 269
TurboGraph: a fast parallel graph engine handling billion-scale graphs in a single PC
Han, W.-S., Lee, S., Park, K., Lee, J.-H., Kim, M.-S., Kim, J., & Yu, H. (2013) · Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2487575.2487581 · Cited by 259
Piccolo: building fast, distributed programs with partitioned tables
Power, R., & Li, J. (2010) · doi:10.5555/1924943.1924964 · Cited by 252
Kineograph: taking the pulse of a fast-changing and connected world
Cheng, R., Hong, J., Kyrola, A., Miao, Y., Weng, X., Wu, M., Yang, F., Zhou, L., Zhao, F., & Chen, E. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168846 · Cited by 247
Linear Time 1/2-Approximation Algorithm for Maximum Weighted Matching in General Graphs
Preis, R. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49116-3_24 · Cited by 237
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993501 · Cited by 234
HAMA: An Efficient Matrix Computation with the MapReduce Framework
Seo, S., Yoon, E. J., Kim, J., Jin, S., Kim, J.-S., & Maeng, S. (2010) · 2010 IEEE Second International Conference on Cloud Computing Technology and Science · doi:10.1109/cloudcom.2010.17 · Cited by 207
Suomela, J. (2013) · ACM Computing Surveys · doi:10.1145/2431211.2431223 · Cited by 201
iMapReduce: A Distributed Computing Framework for Iterative Computation
Zhang, Y., Gao, Q., Gao, L., & Wang, C. (2012) · Journal of Grid Computing · doi:10.1007/s10723-012-9204-9 · Cited by 179
FlashGraph: Processing Billion-Node Graphs on an Array of Commodity SSDs
Zheng, D., Mhembere, D., Burns, R. C., Vogelstein, J. T., Priebe, C. E., & Szalay, A. S. (2014) · arXiv (Cornell University) · doi:10.48550/arxiv.1408.0500 · Cited by 177
Navigating the maze of graph analytics frameworks using massive graph datasets
Satish, N., Sundaram, N., Patwary, M. M. A., Seo, J., Park, J., Hassaan, M. A., Sengupta, S., Yin, Z., & Dubey, P. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2610518 · Cited by 176
Balanced label propagation for partitioning massive graphs
Ugander, J., & Backstrom, L. (2013) · Proceedings of the sixth ACM international conference on Web search and data mining · doi:10.1145/2433396.2433461 · Cited by 170
NUMA-aware graph-structured analytics
Zhang, K., Chen, R., & Chen, H. (2015) · Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688507 · Cited by 169
Local Computation: Lower and Upper Bounds
Kuhn, F., Moscibroda, T., & Wattenhofer, R. (2016) · Journal of the ACM · doi:10.1145/2742012 · Cited by 167
Design patterns for efficient graph algorithms in MapReduce
Lin, J., & Schatz, M. (2010) · Proceedings of the Eighth Workshop on Mining and Learning with Graphs · doi:10.1145/1830252.1830263 · Cited by 167
Parallel Graph Partitioning for Complex Networks
Meyerhenke, H., Sanders, P., & Schulz, C. (2015) · 2015 IEEE International Parallel and Distributed Processing Symposium · doi:10.1109/ipdps.2015.18 · Cited by 163
A comprehensive view of Hadoop research—A systematic literature review
Polato, I., Ré, R., Goldman, A., & Kon, F. (2014) · Journal of Network and Computer Applications · doi:10.1016/j.jnca.2014.07.022 · Cited by 162
Chronos: a graph engine for temporal graph analysis
Han, W., Miao, Y., Li, K., Wu, M., Yang, F., Zhou, L., Prabhakaran, V., Chen, W., & Chen, E. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592799 · Cited by 161
Smaller and Faster: Parallel Processing of Compressed Graphs with Ligra+
Shun, J., Dhulipala, L., & Blelloch, G. E. (2015) · DCC · doi:10.1109/dcc.2015.8 · Cited by 151
Restreaming graph partitioning: simple versatile algorithms for advanced balancing
Nishimura, J., & Ugander, J. H. (2013) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2487575.2487696 · Cited by 144
HyperGraphDB: A Generalized Graph Database
Iordanov, B. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16720-1_3 · Cited by 143
Asynchronous Large-Scale Graph Processing Made Easy
Wang, G., Xie, W., Demers, A. J., & Gehrke, J. E. (2013) · Cited by 142
How to partition a billion-node graph
Wang, L., Xiao, Y., Shao, B., & Wang, H. (2014) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2014.6816682 · Cited by 136
Signal/Collect: Graph Algorithms for the (Semantic) Web
Stutz, P., Bernstein, A., & Cohen, W. W. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-17746-0_48 · Cited by 125
Direction-Optimizing Breadth-First Search
Beamer, S., Asanović, K., & Patterson, D. A. (2013) · Scientific Programming · doi:10.1155/2013/702694 · Cited by 111
Kang, U., Tong, H., Sun, J., Lin, C., & Faloutsos, C. (2011) · ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020580 · Cited by 109
Distributed Power-law Graph Computing: Theoretical and Empirical Analysis
Xie, C., Yan, L., Li, W.-J., & Zhang, Z. (2014) · Cited by 106
SYNC or ASYNC: time to fuse for distributed graph-parallel computation
Xie, C., Chen, R., Guan, H., Zang, B., & Chen, H. (2015) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688508 · Cited by 103
Managing large graphs on multi-cores with graph awareness
Prabhakaran, V., Wu, M., Weng, X., McSherry, F., Zhou, L., & Haridasan, M. (2012) · USENIX Annual Technical Conference · Cited by 94
SBV-Cut: Vertex-cut based graph partitioning using structural balance vertices
Kim, M., & Candan, K. S. (2011) · Data & Knowledge Engineering · doi:10.1016/j.datak.2011.11.004 · Cited by 82
Mapreduce is Good Enough?If All You Have is a Hammer, Throw Away Everything That's Not a Nail!
Lin, J. (2012) · Big Data · doi:10.1089/big.2012.1501 · Cited by 78
Using Pregel-like Large Scale Graph Processing Frameworks for Social Network Analysis
Quick, L., Wilkinson, P., & Hardcastle, D. (2012) · IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM) · doi:10.1109/asonam.2012.254 · Cited by 65
Computation and communication efficient graph processing with distributed immutable view
Chen, R., Ding, X., Wang, P., Chen, H., Zang, B., & Guan, H. (2014) · ACM International Symposium on High-Performance Parallel and Distributed Computing (HPDC) · doi:10.1145/2600212.2600233 · Cited by 61
I/O-efficient techniques for computing pagerank
Chen, Y.-Y., Gan, Q., & Suel, T. (2002) · Proceedings of the eleventh international conference on Information and knowledge management · doi:10.1145/584792.584882 · Cited by 59
Adaptive Partitioning for Large-Scale Dynamic Graphs
Vaquero, L. M., Cuadrado, F., Logothetis, D., & Martella, C. (2014) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2014.23 · Cited by 58
LFGraph: simple and fast distributed graph analytics
Hoque, I., & Gupta, I. (2013) · doi:10.1145/2524211.2524218 · Cited by 55
PuLP: Scalable multi-objective multi-constraint partitioning for small-world networks
Slota, G. M., Madduri, K., & Rajamanickam, S. (2014) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2014.7004265 · Cited by 51
Replication-Based Fault-Tolerance for Large-Scale Graph Processing
Wang, P., Zhang, K., Chen, R., Chen, H., & Guan, H. (2014) · International Conference on Dependable Systems & Networks/Proceedings · doi:10.1109/dsn.2014.58 · Cited by 47
Techniques for Graph Analytics on Big Data
Nisar, M. U., Fard, A. M. Z., & Miller, J. A. (2013) · IEEE International Congress on Big Data (BigData Congress) · doi:10.1109/bigdata.congress.2013.78 · Cited by 39
Streaming Balanced Graph Partitioning Algorithms for Random Graphs
Stanton, I. (2012) · Cited by 35
xDGP: A Dynamic Graph Processing System with Adaptive PartitioningPreprint
Vaquero, L. M., Cuadrado, F., Logothetis, D., & Martella, C. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1309.1049 · Cited by 32
A multilevel bilinear programming algorithm for the vertex separator problem
Hager, W. W., Hungerford, J. T., & Safro, I. (2017) · Computational Optimization and Applications · doi:10.1007/s10589-017-9945-2 · Cited by 32
Optimal sparse matrix dense vector multiplication in the I/O-model
Bender, M. A., Brodal, G. S., Fagerberg, R., Jacob, R., & Vicari, E. (2007) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1248377.1248391 · Cited by 31
Active messages as a spanning model for parallel graph computation
Lumsdaine, A., & Edmonds, N. G. (2013) · Cited by 2
Metadata
- Authors
- McCune, R. R., Weninger, T., & Madey, G.
- Venue
- ACM Computing Surveys
- Published
- 2015-10-12
- Volume
- 48
- Issue
- 2
- Pages
- 1-39
- ISSN
- 0360-0300 (ISSN-L)
- 1557-7341
- OpenAlex
- W2080098453
- Cited by
- 294
- References
- 96
- FWCI
- 30.33
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.