GraphIt: a high-performance graph DSL
Open accessThe DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Abstract
The performance bottlenecks of graph applications depend not only on the algorithm and the underlying hardware, but also on the size and structure of the input graph. As a result, programmers must try different combinations of a large set of techniques, which make tradeoffs among locality, work-efficiency, and parallelism, to develop the best implementation for a specific algorithm and type of graph. Existing graph frameworks and domain specific languages (DSLs) lack flexibility, supporting only a limited set of optimizations. This paper introduces GraphIt, a new DSL for graph computations that generates fast implementations for algorithms with different performance characteristics running on graphs with different sizes and structures. GraphIt separates what is computed (algorithm) from how it is computed (schedule). Programmers specify the algorithm using an algorithm language, and performance optimizations are specified using a separate scheduling language. The algorithm language simplifies expressing the algorithms, while exposing opportunities for optimizations. We formulate graph optimizations, including edge traversal direction, data layout, parallelization, cache, NUMA, and kernel fusion optimizations, as tradeoffs among locality, parallelism, and work-efficiency. The scheduling language enables programmers to easily search through this complicated tradeoff space by composing together a large set of edge traversal, vertex data layout, and program structure optimizations. The separation of algorithm and schedule also enables us to build an autotuner on top of GraphIt to automatically find high-performance schedules. The compiler uses a new scheduling representation, the graph iteration space, to model, compose, and ensure the validity of the large number of optimizations. We evaluate GraphIt’s performance with seven algorithms on graphs with different structures and sizes. GraphIt outperforms the next fastest of six state-of-the-art shared-memory frameworks (Ligra, Green-Marl, GraphMat, Galois, Gemini, and Grazelle) on 24 out of 32 experiments by up to 4.8×, and is never more than 43% slower than the fastest framework on the other experiments. GraphIt also reduces the lines of code by up to an order of magnitude compared to the next fastest framework.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
(1999) · Cited by 12,854
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652 · cited 1×
“Edges LiveJournal (LJ) [Davis and Hu 2011] 5 M 69 M Twitter (TW) [Kwak et al. 2010] 41 M 1469 M WebGraph (WB) [Meusel et al.”
BackgroundThe university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,466
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
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 · cited 7×
“Hybrid traversal modes (DensePull-SparsePush and DensePush-SparsePush) use different directions (SparsePush, DensePull, and DensePush) in different iterations based on the size of the active set to improve work-efficiency [Beamer et al. 2012; Shun and Blelloch 2013].”
BackgroundMethodInfluentialSelf-citationAdvanced compiler optimizations for supercomputers
Padua, D. A., & Wolfe, M. J. (1986) · Communications of the ACM · doi:10.1145/7902.7904 · Cited by 690 · cited 2×
“Inspired by iteration space theory for dense loops [Padua and Wolfe 1986; Wolf and Lam 1991], we introduce an abstract graph iteration space model to represent, compose, and ensure the validity of edge traversal optimizations.”
MethodX-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 · cited 2×
“When the graphs do fit in memory, out-of-core systems, such as X-Stream [Roy et al. 2013], have shown to be much slower than shared-memory frameworks [Grossman et al. 2018; Zhang et al. 2017].”
BackgroundA loop transformation theory and an algorithm to maximize parallelism
Wolf, M. E., & Lam, M. S. (1991) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.97902 · Cited by 643 · cited 2×
“Inspired by iteration space theory for dense loops [Padua and Wolfe 1986; Wolf and Lam 1991], we introduce an abstract graph iteration space model to represent, compose, and ensure the validity of edge traversal optimizations.”
MethodA 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 · cited 5×
“2015], Galois [Nguyen et al. 2013], Green-Marl [Hong et al.”
BackgroundMethodInfluentialOpenTuner: an extensible framework for program autotuning
Ansel, J., Kamil, S., Veeramachaneni, K., Ragan-Kelley, J., Bosboom, J., O'Reilly, U.-M., & Amarasinghe, S. (2014) · Proceedings of the 23rd international conference on Parallel architectures and compilation · doi:10.1145/2628071.2628092 · Cited by 530 · cited 1×
“As a result, we use OpenTuner [Ansel et al. 2014] to build an autotuner on top of GraphIt that leverages stochastic search techniques (e.g., AUC bandit, greedy mutation, differential mutation, and hill climbing) to find high-performance schedules within a reasonable amount of time.”
MethodSelf-citationGraphLab: A New Framework for Parallel Machine LearningPreprint
Low, Y., Gonzalez, J. E., Kyrola, A., Bickson, D., Guestrin, C., & Hellerstein, J. M. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.4990 · Cited by 449 · cited 1×
“Graph analytics has also been studied extensively in distributed memory systems (e.g., [Chen et al. 2015; Dathathri et al. 2018; Gonzalez et al. 2012; Low et al. 2010; McCune et al. 2015; Prabhakaran et al. 2012; Roy et al. 2015; Sakr et al. 2017; Yan et al. 2017; Zhu et al. 2016]).”
GridGraph: large-scale graph processing on a single machine using 2-level hierarchical partitioning
Zhu, X., Han, W., & Chen, W. (2015) · USENIX Annual Technical Conference · Cited by 410
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 · cited 1×
“Graph analytics has also been studied extensively in distributed memory systems (e.g., [Chen et al. 2015; Dathathri et al. 2018; Gonzalez et al. 2012; Low et al. 2010; McCune et al. 2015; Prabhakaran et al. 2012; Roy et al. 2015; Sakr et al. 2017; Yan et al. 2017; Zhu et al. 2016]).”
McCune, R. R., Weninger, T., & Madey, G. (2015) · ACM Computing Surveys · doi:10.1145/2818185 · Cited by 294 · cited 1×
“Graph analytics has also been studied extensively in distributed memory systems (e.g., [Chen et al. 2015; Dathathri et al. 2018; Gonzalez et al. 2012; Low et al. 2010; McCune et al. 2015; Prabhakaran et al. 2012; Roy et al. 2015; Sakr et al. 2017; Yan et al. 2017; Zhu et al. 2016]).”
Gunrock: a high-performance graph processing library on the GPU
Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., & Owens, J. D. (2015) · Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2688500.2688538 · Cited by 287
GraphMat: high performance graph analytics made productive
Sundaram, N., Satish, N., Patwary, M. M. A., Dulloor, S. R., Anderson, M. J., Vadlamudi, S. G., Das, D., & Dubey, P. (2015) · Proceedings of the VLDB Endowment · doi:10.14778/2809974.2809983 · Cited by 282 · cited 8×
“Among prior work, GraphMat has the fastest shared-memory implementation of CF [Sundaram et al. 2015].”
BackgroundMethodInfluentialGemini: a computation-centric distributed graph processing system
Zhu, X., Chen, W., Zheng, W., & Ma, X. (2016) · Operating Systems Design and Implementation · doi:10.5555/3026877.3026901 · Cited by 241
Chaos: scale-out graph processing from secondary storage
Roy, A., Bindschaedler, L., Malicevic, J., & Zwaenepoel, W. (2015) · ACM SIGOPS Symposium on Operating Systems Principles (SOSP) · doi:10.1145/2815400.2815408 · Cited by 241 · cited 1×
“Graph analytics has also been studied extensively in distributed memory systems (e.g., [Chen et al. 2015; Dathathri et al. 2018; Gonzalez et al. 2012; Low et al. 2010; McCune et al. 2015; Prabhakaran et al. 2012; Roy et al. 2015; Sakr et al. 2017; Yan et al. 2017; Zhu et al. 2016]).”
Liszt: a domain specific language for building portable mesh-based PDE solvers
DeVito, Z., Joubert, N., Palacios, F., Oakley, S., Medina, M., Barrientos, M., Elsen, E., Ham, F., Aiken, A., Duraisamy, K., et al. (2011) · Proceedings of 2011 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1145/2063384.2063396 · Cited by 200 · cited 1×
“Physical Simulation DSLs. GraphIt is heavily influenced by DSLs for physical simulations, including Simit [Kjolstad et al. 2016] and Liszt [DeVito et al. 2011].”
MethodGraph Processing on GPUs: A Survey
Shi, X., Zheng, Z., Zhou, Y., Jin, H., He, L., Liu, B., & Hua, Q.-S. (2018) · ACM Computing Surveys · doi:10.1145/3128571 · Cited by 179 · cited 1×
“A number of graph processing frameworks have been developed for GPUs (see [Shi et al. 2018] for a survey).”
BackgroundFlashGraph: 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 · cited 2×
“, [Jun et al. 2018; Kyrola et al. 2012; Maass et al. 2017; Roy et al. 2013; Vora et al. 2016; Wang et al. 2017, 2015; Yan et al. 2017; Zheng et al. 2015; Zhu et al. 2015]), while GraphIt focuses on in-memory graph processing.”
BackgroundNavigating 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 · cited 3×
“However, since these languages do not allow for explicit representation of active vertex sets, their performance on graph traversal algorithms is worse than the frontier-based frameworks [Aberger et al. 2016; Satish et al. 2014].”
BackgroundPixie: A System for Recommending 3+ Billion Items to 200+ Million Users in Real-Time
Eksombatchai, C., Jindal, P., Liu, J. Z., Liu, Y., Sharma, R., Sugnet, C., Ulrich, M., & Leskovec, J. (2018) · Proceedings of the 2018 World Wide Web Conference on World Wide Web - WWW '18 · doi:10.1145/3178876.3186183 · Cited by 173 · cited 1×
“Speeding up these algorithms can enhance the efficiency of data analytics applications and improve the quality of web services [Eksombatchai et al. 2018; Fu et al. 2017; Sharma et al. 2016].”
BackgroundNUMA-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 · cited 4×
“2017], Polymer [Zhang et al. 2015], Gemini [Zhu et al.”
BackgroundInfluentialLocality Exists in Graph Processing: Workload Characterization on an Ivy Bridge Server
Beamer, S., Asanovic, K., & Patterson, D. (2015) · 2015 IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2015.12 · Cited by 168 · cited 2×
“The performance bottlenecks of these algorithms depend not only on the algorithm and the underlying hardware, but also on the size and structure of the graph [Beamer et al. 2015].”
BackgroundMethodEmptyHeaded: A Relational Engine for Graph Processing
Aberger, C. R., Tu, S., Olukotun, K., & Ré, C. (2016) · Proceedings of the 2016 International Conference on Management of Data · doi:10.1145/2882903.2915213 · Cited by 165 · cited 3×
“Green-Marl [Hong et al. 2012], Socialite [Lam et al. 2013], Abelian [Gill et al. 2018], and EmptyHeaded [Aberger et al. 2016] are DSLs for shared-memory graph processing.”
BackgroundMosaic: Processing a Trillion-Edge Graph on a Single Machine
Maass, S., Min, C., Kashyap, S., Kang, W., Kumar, M., & Kim, T. (2017) · Proceedings of the Twelfth European Conference on Computer Systems · doi:10.1145/3064176.3064191 · Cited by 164 · cited 1×
“There has been a significant amount of work dealing with graphs that cannot fit in memory (e.g., [Jun et al. 2018; Kyrola et al. 2012; Maass et al. 2017; Roy et al. 2013; Vora et al. 2016; Wang et al. 2017, 2015; Yan et al. 2017; Zheng et al. 2015; Zhu et al. 2015]), while GraphIt focuses on…”
BackgroundPEGASUS: mining peta-scale graphs
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2011) · Knowledge and Information Systems · doi:10.1007/s10115-010-0305-0 · Cited by 159
Halide: decoupling algorithms from schedules for high-performance image processing
Ragan‐Kelley, J., Adams, A., Sharlet, D., Barnes, C., Paris, S., Levoy, M., Amarasinghe, S. P., & Durand, F. (2017) · Communications of the ACM · doi:10.1145/3150211 · Cited by 146 · cited 1×
“Examples of existing scheduling languages include Halide [Ragan-Kelley et al. 2017], CHiLL [Chen et al. 2008], and HMPP [Romain et al. 2007].”
BackgroundSelf-citationMaking caches work for graph analytics
Zhang, Y., Kiriansky, V., Mendis, C., Amarasinghe, S. P., & Zaharia, M. (2017) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2017.8257937 · Cited by 128 · cited 8×
“2013], have shown to be much slower than shared-memory frameworks [Grossman et al. 2018; Zhang et al. 2017].”
BackgroundMethodResultInfluentialSelf-citationGraFBoost: Using Accelerated Flash Storage for External Graph Analytics
Jun, S.-W., Wright, A., Zhang, S., Xu, S., & Arvind, A. (2018) · Proceedings - International Symposium on Computer Architecture/Proceedings · doi:10.1109/isca.2018.00042 · Cited by 123 · cited 2×
“There has been a significant amount of work dealing with graphs that cannot fit in memory (e.g., [Jun et al. 2018; Kyrola et al. 2012; Maass et al. 2017; Roy et al. 2013; Vora et al. 2016; Wang et al. 2017, 2015; Yan et al. 2017; Zheng et al. 2015; Zhu et al. 2015]), while GraphIt focuses on…”
Gluon: a communication-optimizing substrate for distributed heterogeneous graph analytics
Dathathri, R., Gill, G., Hoang, L., Dang, H.-V., Brooks, A., Dryden, N., Snir, M., & Pingali, K. K. (2018) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3192366.3192404 · Cited by 119 · cited 1×
“Graph analytics has also been studied extensively in distributed memory systems (e.g., [Chen et al. 2015; Dathathri et al. 2018; Gonzalez et al. 2012; Low et al. 2010; McCune et al. 2015; Prabhakaran et al. 2012; Roy et al. 2015; Sakr et al. 2017; Yan et al. 2017; Zhu et al. 2016]).”
When cache blocking of sparse matrix vector multiply works and why
Nishtala, R., Vuduc, R. W., Demmel, J. W., & Yelick, K. (2007) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-007-0038-9 · Cited by 117 · cited 4×
“…can significantly reduce the number of random DRAM accesses when processing each SSG. Cache partitioning improves locality but sacrifices work-efficiency due to vertex data replication from graph partitioning and merging partial results [Beamer et al. 2017; Nishtala et al. 2007; Zhang et al. 2017].”
BackgroundResultInfluentialLoad the edges you need: a generic I/O optimization for disk-based graph processing
Vora, K., Xu, G. H., & Gupta, R. (2016) · USENIX Annual Technical Conference · Cited by 109
SociaLite: Datalog extensions for efficient social network analysis
Seo, J., Guo, S. D., & Lam, M. S. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544832 · Cited by 104 · cited 4×
“Green-Marl [Hong et al. 2012], Socialite [Lam et al. 2013], Abelian [Gill et al. 2018], and EmptyHeaded [Aberger et al. 2016] are DSLs for shared-memory graph processing.”
BackgroundInfluentialReducing Pagerank Communication via Propagation Blocking
Beamer, S., Asanović, K., & Patterson, D. A. (2017) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2017.112 · Cited by 96 · cited 5×
“CSR Segmenting [Zhang et al. 2017] and cache blocking [Beamer et al. 2017; Nishtala et al. 2007] have been introduced to improve the cache performance of graph applications through graph partitioning.”
BackgroundResultInfluentialManaging 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
GraphJet: real-time content recommendations at twitter
Sharma, A., Jiang, J., Bommannavar, P., Larson, B., & Lin, J. (2016) · Proceedings of the VLDB Endowment · doi:10.14778/3007263.3007267 · Cited by 94 · cited 1×
“Speeding up these algorithms can enhance the efficiency of data analytics applications and improve the quality of web services [Eksombatchai et al. 2018; Fu et al. 2017; Sharma et al. 2016].”
BackgroundWang, K., Hussain, A., Zuo, Z., Xu, G. H., & Sani, A. A. (2017) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3037697.3037744 · Cited by 92 · cited 1×
“…amount of work dealing with graphs that cannot fit in memory (e.g., [Jun et al. 2018; Kyrola et al. 2012; Maass et al. 2017; Roy et al. 2013; Vora et al. 2016; Wang et al. 2017, 2015; Yan et al. 2017; Zheng et al. 2015; Zhu et al. 2015]), while GraphIt focuses on in-memory graph processing.”
BackgroundSun, J., Vandierendonck, H., & Nikolopoulos, D. S. (2017) · International Conference on Supercomputing · doi:10.1145/3079079.3079097 · Cited by 73
Gunrock: a high-performance graph processing library on the GPU
Wang, Y., Davidson, A. A., Pan, Y., Wu, Y., Riffel, A., & Owens, J. D. (2016) · ACM SIGPLAN Notices · doi:10.1145/3016078.2851145 · Cited by 70
Simit: A Language for Physical Simulation
Kjølstad, F., Kamil, S. A., Ragan‐Kelley, J., Levin, D. I. W., Sueda, S., Chen, D., Vouga, E., Kaufman, D. M., Kanwar, G., Matusik, W., et al. (2016) · ACM Transactions on Graphics · doi:10.1145/2866569 · Cited by 68 · cited 1×
“Physical Simulation DSLs. GraphIt is heavily influenced by DSLs for physical simulations, including Simit [Kjolstad et al. 2016] and Liszt [DeVito et al. 2011].”
MethodSelf-citationWang, K., Xu, G. H., Su, Z., & Liu, Y. D. (2015) · Cited by 49
Elixir: a system for synthesizing concurrent graph programs
Prountzos, D., Manevich, R., & Pingali, K. K. (2012) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2384616.2384644 · Cited by 38 · cited 1×
“Program synthesis techniques have been explored in the context of graph algorithms [Prountzos et al. 2012, 2015], which allow many different implementations of an application to be generated.”
MethodSparkler: supporting large-scale matrix factorization
Li, B., Tata, S., & Sismanis, Y. (2013) · International Conference on Extending Database Technology (EDBT) · doi:10.1145/2452376.2452449 · Cited by 38
Synthesizing parallel graph programs via automated planning
Prountzos, D., Manevich, R., & Pingali, K. K. (2015) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2737924.2737953 · Cited by 20 · cited 1×
“Program synthesis techniques have been explored in the context of graph algorithms [Prountzos et al. 2012, 2015], which allow many different implementations of an application to be generated.”
Method
Cited by
Taichi: a language for high-performance computation on spatially sparse data structures
Hu, Y., Li, T.-M., Anderson, L., Ragan-Kelley, J., & Durand, F. (2019) · ACM Transactions on Graphics · doi:10.1145/3355089.3356506 · Cited by 257
Performance Optimization using Multimodal Modeling and Heterogeneous GNN
Dutta, A., Alcaraz, J., TehraniJamsaz, A., Cesar, E., Sikora, A., & Jannesari, A. (2023) · Proceedings of the 32nd International Symposium on High-Performance Parallel and Distributed Computing · doi:10.1145/3588195.3592984 · Cited by 16
“OpenTuner [8] is a search-based autotuner which employs various search techniques such as AUC Bandit, Nelder-Mead, Torczon hill-climbers, etc. ytopt and OpenTuner have been previously used for a variety of tuning tasks [32, 35, 43, 81, 84] and were hence chosen as baselines for this paper.”
Method
Metadata
- Authors
- Zhang, Y., Yang, M., Baghdadi, R., Kamil, S., Shun, J., & Amarasinghe, S.
- Venue
- Proceedings of the ACM on Programming Languages
- Published
- 2018-10-24
- Volume
- 2
- Issue
- OOPSLA
- Pages
- 1-30
- ISSN
- 2475-1421 (ISSN-L)
- OpenAlex
- W2898231337
- Cited by
- 169
- References
- 48
- FWCI
- 8.85
- Type
- journal article
- Language
- en
- Open access
- diamond
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.