CoChat

Martinize2 and Vermouth: Unified Framework for Topology Generation

Open access
Kroon, P C, Grunewald, F, Barnoud, J, van Tilburg, M, Souza, P C T, Wassenaar, T A, Marrink, S J · 2023 · eLife
PreprintCited by 68

The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.

Abstract

Abstract Ongoing advances in force field and computer hardware development enable the use of molecular dynamics (MD) to simulate increasingly complex systems with the ultimate goal of reaching cellular complexity. At the same time, rational design by high-throughput (HT) simulations is another forefront of MD. In these areas, the Martini coarse-grained force field, especially the latest version (i.e. v3), is being actively explored because it offers enhanced spatial-temporal resolution. However, the automation tools for preparing simulations with the Martini force field, accompanying the previous version, were not designed for HT simulations or studies of complex cellular systems. Therefore, they become a major limiting factor. To address these shortcomings, we present the open-source Vermouth python library. Vermouth is designed to become the unified framework for developing programs, which prepare, run, and analyze Martini simulations of complex systems. To demonstrate the power of the Vermouth library, the Martinize2 program is showcased as a generalization of the martinize script, originally aimed to set up simulations of proteins. In contrast to the previous version, Martinize2 automatically handles protonation states in proteins and post-translation modifications, offers more options to fine-tune structural biases such as the elastic network, and can convert non-protein molecules such as ligands. Finally, Martinize2 is used in two high-complexity benchmarks. The entire I-TASSER protein template database as well as a subset of 200,000 structures from the AlphaFold Protein Structure Database are converted to CG resolution and we illustrate how the checks on input structure quality can safeguard high-throughput applications.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.7554/elife.90627.1

Cites

19 of 19 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 19 references

Research works printed but not linked: 100

  1. Marrink, 2019, Computational Modeling of Realistic Cell Membranes, Chem Rev, 10.1021/acs.chemrev.8b00460 · DOI · Paper page
  2. Yu, 2021, A Multiscale Coarse-Grained Model of the SARS-CoV-2 Virion, Biophys J, 120, 1097, 10.1016/j.bpj.2020.10.048 · DOI · Paper page
  3. Dommer, 2023, #COVIDisAirborne: AI-Enabled Multiscale Computational Microscopy of Delta SARS-CoV-2 in a Respiratory Aerosol, Int J High Perform Comput Appl, 37, 28, 10.1177/10943420221128233 · DOI
  4. Pezeshkian, 2020, Backmapping Triangulated Surfaces to Coarse-Grained Membrane Models, Nat Commun, 11, 1, 10.1038/s41467-020-16094-y · DOI · Paper page
  5. Autin, 2022, Integrative Structural Modelling and Visualisation of a Cellular Organelle, QRB Discov, 3, e11, 10.1017/qrd.2022.10 · DOI
  6. Feig, 2019, Whole-Cell Models and Simulations in Molecular Detail, Annu Rev Cell Dev Biol, 35, 191, 10.1146/annurev-cellbio-100617-062542 · DOI · Paper page
  7. Im, 2016, Challenges in Structural Approaches to Cell Modeling, J Mol Biol, 428, 2943, 10.1016/j.jmb.2016.05.024 · DOI · Paper page
  8. Buch, 2010, High-Throughput All-Atom Molecular Dynamics Simulations Using Distributed Computing, J Chem Inf Model, 50, 397, 10.1021/ci900455r · DOI · Paper page
  9. Souza, 2021, Perspectives on High-Throughput Ligand/Protein Docking With Martini MD Simulations, Front Mol Biosci, 8, 10.3389/fmolb.2021.657222 · DOI · Paper page
  10. Kutzner, 2022, GROMACS in the Cloud: A Global Supercomputer to Speed Up Alchemical Drug Design, J Chem Inf Model, 62, 1691, 10.1021/acs.jcim.2c00044 · DOI
  11. Marrink, 2007, The MARTINI Force Field: Coarse Grained Model for Biomolecular Simulations, Journal of Physical Chemistry B, 111, 7812, 10.1021/jp071097f · DOI · Paper page
  12. Abraham, 2018, BioExcel Whitepaper on Scientific Software Development, Zenodo
  13. Páll, 2015, Tackling Exascale Software Challenges in Molecular Dynamics Simulations with GROMACS, 3
  14. Brooks, 2009, CHARMM: The Biomolecular Simulation Program, J Comput Chem, 30, 1545, 10.1002/jcc.21287 · DOI · Paper page
  15. Phillips, 2005, Scalable Molecular Dynamics with NAMD, J Comput Chem, 26, 1781, 10.1002/jcc.20289 · DOI · Paper page
  16. Machado, 2016, SIRAH Tools: Mapping, Backmapping and Visualization of Coarse-Grained Models, Bioinformatics, 32, 1568, 10.1093/bioinformatics/btw020 · DOI · Paper page
  17. Danne, 2017, DoGlycans –Tools for Preparing Carbohydrate Structures for Atomistic Simulations of Glycoproteins, Glycolipids, and Carbohydrate Polymers for GROMACS, J Chem Inf Model, 57, 2401, 10.1021/acs.jcim.7b00237 · DOI
  18. Girard, 2019, Hoobas: A Highly Object-Oriented Builder for Molecular Dynamics, Comput Mater Sci, 167, 25, 10.1016/j.commatsci.2019.05.003 · DOI
  19. Jo, 2017, CHARMM-GUI 10 Years for Biomolecular Modeling and Simulation, J Comput Chem, 38, 1114, 10.1002/jcc.24660 · DOI · Paper page
  20. Malde, 2011, An Automated Force Field Topology Builder (ATB) and Repository: Version 1.0, J Chem Theory Comput, 7, 4026, 10.1021/ct200196m · DOI · Paper page
  21. Canzar, 2013, Charge Group Partitioning in Biomolecular Simulation, Journal of Computational Biology, 20, 188, 10.1089/cmb.2012.0239 · DOI
  22. Jorgensen, 2005, Potential Energy Functions for Atomic-Level Simulations of Water and Organic and Biomolecular Systems, Proceedings of the National Academy of Sciences, 102, 6665, 10.1073/pnas.0408037102 · DOI · Paper page
  23. Dodda, 2017, 1.14*CM1A-LBCC: Localized Bond-Charge Corrected CM1A Charges for Condensed-Phase Simulations, J Phys Chem B, 121, 3864, 10.1021/acs.jpcb.7b00272 · DOI · Paper page
  24. Dodda, 2017, LigParGen Web Server: An Automatic OPLS-AA Parameter Generator for Organic Ligands, Nucleic Acids Res, 45, W331, 10.1093/nar/gkx312 · DOI · Paper page
  25. Vanommeslaeghe, 2012, Automation of the CHARMM General Force Field (CGenFF) I: Bond Perception and Atom Typing, J Chem Inf Model, 52, 3144, 10.1021/ci300363c · DOI · Paper page
  26. Uusitalo, 2015, Martini Coarse-Grained Force Field: Extension to DNA, J Chem Theory Comput, 11, 3932, 10.1021/acs.jctc.5b00286 · DOI · Paper page
  27. Jo, CHARMM-GUI: A Web-Based Graphical User Interface for CHARMM, J. Comput. Chem, 2008, 1859
  28. Souza, 2020, Protein–Ligand Binding with the Coarse-Grained Martini Model, Nat Commun, 11, 3714, 10.1038/s41467-020-17437-5 · DOI · Paper page
  29. Herzog, 2016, Improved Side Chain Dynamics in MARTINI Simulations of Protein–Lipid Interfaces, J Chem Theory Comput, 12, 2446, 10.1021/acs.jctc.6b00122 · DOI · Paper page
  30. Periole, 2009, Combining an Elastic Network With a Coarse-Grained Molecular Force Field: Structure, Dynamics, and Intermolecular Recognition, J Chem Theory Comput, 5, 2531, 10.1021/ct9002114 · DOI · Paper page
  31. Poma, 2017, Combining the MARTINI and Structure-Based Coarse-Grained Approaches for the Molecular Dynamics Studies of Conformational Transitions in Proteins, J Chem Theory Comput, 13, 1366, 10.1021/acs.jctc.6b00986 · DOI · Paper page
  32. Monticelli, 2008, The MARTINI Coarse-Grained Force Field: Extension to Proteins, J Chem Theory Comput, 4, 819, 10.1021/ct700324x · DOI · Paper page
  33. Chue Hong, 2022, FAIR Principles for Research Software (FAIR4RS Principles)
  34. Alibay, 2022, MDAKits: Supporting and Promoting the Development of Community Packages Leveraging the MDAnalysis Library
  35. Grünewald, 2022, Polyply; a Python Suite for Facilitating Simulations of Macromolecules and Nanomaterials, Nat Commun, 13, 68, 10.1038/s41467-021-27627-4 · DOI · Paper page
  36. Empereur-Mot, 2020, Swarm-CG : Automatic Parametrization of Bonded Terms in MARTINI-Based Coarse-Grained Models of Simple to Complex Molecules via Fuzzy Self-Tuning Particle Swarm Optimization, ACS Omega, 5, 32823, 10.1021/acsomega.0c05469 · DOI · Paper page
  37. Wassenaar, 2014, Going Backward: A Flexible Geometric Approach to Reverse Transformation from Coarse Grained to Atomistic Models, J Chem Theory Comput, 10, 676, 10.1021/ct400617g · DOI · Paper page
  38. Marx, 2020, When Computational Pipelines Go ‘Clank.’, Nat Methods, 17, 659, 10.1038/s41592-020-0886-9 · DOI
  39. Bashford, 1990, PKa’s of Ionizable Groups in Proteins: Atomic Detail from a Continuum Electrostatic Model, Biochemistry, 29, 10219, 10.1021/bi00496a010 · DOI · Paper page
  40. Huang, 2016, All-Atom Continuous Constant PH Molecular Dynamics with Particle Mesh Ewald and Titratable Water, J Chem Theory Comput, 12, 5411, 10.1021/acs.jctc.6b00552 · DOI · Paper page
  41. Donnini, 2011, Constant PH Molecular Dynamics in Explicit Solvent with λ-Dynamics, J Chem Theory Comput, 7, 1962, 10.1021/ct200061r · DOI · Paper page
  42. Bennett, 2013, Constant PH Simulations with the Coarse-Grained MARTINI Model — Application to Oleic Acid Aggregates, Can J Chem, 91, 839, 10.1139/cjc-2013-0010 · DOI
  43. Grünewald, 2020, Titratable Martini Model for Constant PH Simulations, J Chem Phys, 153, 024118, 10.1063/5.0014258 · DOI · Paper page
  44. Aho, 2022, Scalable Constant PH Molecular Dynamics in GROMACS, J Chem Theory Comput, 18, 6148, 10.1021/acs.jctc.2c00516 · DOI · Paper page
  45. Huang, 2017, CHARMM36m: An Improved Force Field for Folded and Intrinsically Disordered Proteins, Nat Methods, 14, 71, 10.1038/nmeth.4067 · DOI · Paper page
  46. Lindorff-Larsen, 2010, Improved Side-Chain Torsion Potentials for the Amber Ff99SB Protein Force Field, Proteins: Structure, Function, and Bioinformatics, 78, 1950, 10.1002/prot.22711 · DOI · Paper page
  47. Anandakrishnan, 2012, H++ 3.0: Automating PK Prediction and the Preparation of Biomolecular Structures for Atomistic Molecular Modeling and Simulations, Nucleic Acids Res, 40, W537, 10.1093/nar/gks375 · DOI · Paper page
  48. Olsson, 2011, PROPKA3: Consistent Treatment of Internal and Surface Residues in Empirical p K a Predictions, J Chem Theory Comput, 7, 525, 10.1021/ct100578z · DOI · Paper page
  49. Kmiecik, 2016, Coarse-Grained Protein Models and Their Applications, Chem Rev, 116, 7898, 10.1021/acs.chemrev.6b00163 · DOI · Paper page
  50. Alessandri, 2022, Martini 3 Coarse-Grained Force Field: Small Molecules, Adv Theory Simul, 5, 2100391, 10.1002/adts.202100391 · DOI · Paper page
  51. Kabsch, 1983, Dictionary of Protein Secondary Structure: Pattern Recognition of Hydrogen-Bonded and Geometrical Features, Biopolymers, 22, 2577, 10.1002/bip.360221211 · DOI · Paper page
  52. Touw, 2015, A Series of PDB-Related Databanks for Everyday Needs, Nucleic Acids Res, 43, D364, 10.1093/nar/gku1028 · DOI · Paper page
  53. Virtanen, 2020, SciPy 1.0 Contributors. SciPy 1.0: Fundamental Algorithms for Scientific Computing in Python, Nat Methods, 17, 261, 10.1038/s41592-019-0686-2 · DOI · Paper page
  54. Engler, 2017, Enumerating Common Molecular Substructures, PeerJ Prepr, 1
  55. Cao, 2008, A Maximum Common Substructure-Based Algorithm for Searching and Predicting Drug-like Compounds, Bioinformatics, 24, i366, 10.1093/bioinformatics/btn186 · DOI · Paper page
  56. Cook S. A. 1971. The Complexity of Theorem-Proving Procedures. Proceedings of the third annual ACM symposium on Theory of computing - STOC ’71.
  57. Nnyigide, 2022, Protein Repair and Analysis Server: A Web Server to Repair PDB Structures, Add Missing Heavy Atoms and Hydrogen Atoms, and Assign Secondary Structures by Amide Interactions, J Chem Inf Model, 62, 4232, 10.1021/acs.jcim.2c00571 · DOI
  58. Lee, 2016, CHARMM-GUI Input Generator for NAMD, GROMACS, AMBER, OpenMM, and CHARMM/OpenMM Simulations Using the CHARMM36 Additive Force Field, J Chem Theory Comput, 12, 405, 10.1021/acs.jctc.5b00935 · DOI · Paper page
  59. Bjelkmar, 2010, Implementation of the CHARMM Force Field in GROMACS: Analysis of Protein Stability Effects from Correction Maps, Virtual Interaction Sites, and Water Models, J Chem Theory Comput, 6, 459, 10.1021/ct900549r · DOI · Paper page
  60. Bussi, 2007, Canonical Sampling through Velocity Rescaling, J Chem Phys, 126, 14101, 10.1063/1.2408420 · DOI · Paper page
  61. Parrinello, 1981, Polymorphic Transitions in Single Crystals: A New Molecular Dynamics Method, J Appl Phys, 52, 7182, 10.1063/1.328693 · DOI · Paper page
  62. Berendsen, 1984, Molecular Dynamics with Coupling to an External Bath, J Chem Phys, 81, 3684, 10.1063/1.448118 · DOI · Paper page
  63. Abraham, 2015, GROMACS: High Performance Molecular Simulations through Multi-Level Parallelism from Laptops to Supercomputers, SoftwareX, 1
  64. de Jong, 2016, Martini Straight: Boosting Performance Using a Shorter Cutoff and GPUs, Comput Phys Commun, 199, 1, 10.1016/j.cpc.2015.09.014 · DOI · Paper page
  65. Webb, 2018, Graph-Based Approach to Systematic Molecular Coarse-Graining, Journal of Chemical Theory and Computation, acs.jctc.8b00920, 10.1021/acs.jctc.8b00920 · DOI
  66. Chakraborty, 2018, Encoding and selecting coarse-grain mapping operators with hierarchical graphs, The Journal of Chemical Physics, 149, 134106, 10.1063/1.5040114 · DOI
  67. Karp, 1972, Reducibility among Combinatorial Problems, 85, 10.1007/978-1-4684-2001-2_9 · DOI · Paper page
  68. Periole, 2009, Combining an Elastic Network With a Coarse-Grained Molecular Force Field: Structure, Dynamics, and Intermolecular Recognition, Journal of Chemical Theory and Computation, 5, 2531, 10.1021/ct9002114 · DOI · Paper page
  69. Poma, 2017, Combining the MARTINI and Structure-Based Coarse-Grained Approaches for the Molecular Dynamics Studies of Conformational Transitions in Proteins, Journal of Chemical Theory and Computation, 13, 1366, 10.1021/acs.jctc.6b00986 · DOI · Paper page
  70. Taketomi, 1975, Studies on protein folding, unfolding and fluctuations by computer simulation. I. The effect of specific amino acid sequence represented by specific inter-unit interactions, International journal of peptide and protein research, 7, 445, 10.1111/j.1399-3011.1975.tb02465.x · DOI · Paper page
  71. Chung, 2010, Graph Theory in the Information Age, Notices of the AMS, 57, 726
  72. Engler, 2017, Enumerating common molecular substructures, PeerJ Prepr, 1, 10.7287/peerj.preprints.3250v1 · DOI
  73. Engler, Multiple-Choice Knapsack for Assigning Partial Atomic Charges in Drug-Like Molecules, 1, 10.4230/LIPIcs.WABI.2018.16 · DOI
  74. Cao, 2008, A maximum common substructure-based algorithm for searching and predicting drug-like compounds, Bioinformatics, 24, i366, 10.1093/bioinformatics/btn186 · DOI · Paper page
  75. Bonnici, 2013, A subgraph isomorphism algorithm and its application to biochemical data, BMC Bioinformatics, 14, S13, 10.1186/1471-2105-14-S7-S13 · DOI · Paper page
  76. Houbraken, 2014, The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration, PLoS ONE, 9, e97896, 10.1371/journal.pone.0097896 · DOI
  77. Cordella, 2001, An improved algorithm for matching large graphs, Proceedings of the 3rd IAPR Workshop on Graph-Based Representations in Pattern Recognition, 219, 149
  78. Cordella, 2004, A (sub)graph isomorphism algorithm for matching large graphs, IEEE Transactions on Pattern Analysis and Machine Intelligence, 26, 1367, 10.1109/TPAMI.2004.75 · DOI · Paper page
  79. Krissinel, 2004, Common subgraph isomorphism detection by backtracking search, Software: Practice and Experience, 34, 591
  80. Koch, 2001, Enumerating all connected maximal common subgraphs in two graphs, Theoretical Computer Science, 250, 1, 10.1016/S0304-3975(00)00286-3 · DOI · Paper page
  81. Demeyer, 2013, The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees, PLoS ONE, 8, e61183, 10.1371/journal.pone.0061183 · DOI
  82. Hagberg A., Swart P., S Chult D., Varoquaux G., Vaught T., Millman J. 2008. Exploring network structure, dynamics, and function using networkx. Proceedings of the 7th Python in Science Conference (SciPy2008).
  83. Abraham, 2015, GROMACS: High performance molecular simulations through multi-level parallelism from laptops to supercomputers, SoftwareX, 1
  84. Páll, 2015, Tackling Exascale Software Challenges in Molecular Dynamics Simulations with GROMACS, 3, 10.1007/978-3-319-15976-8_1 · DOI · Paper page
  85. Case, 2005, The Amber biomolecular simulation programs, J Comput Chem, 26, 1668, 10.1002/jcc.20290 · DOI · Paper page
  86. Brooks, 1983, CHARMM: A program for macromolecular energy, minimization, and dynamics calculations, Journal of Computational Chemistry, 4, 187, 10.1002/jcc.540040211 · DOI · Paper page
  87. Phillips, 2005, Scalable molecular dynamics with NAMD, Journal of computational chemistry, 26, 1781, 10.1002/jcc.20289 · DOI · Paper page
  88. de Jong, 2013, Improved Parameters for the Martini Coarse-Grained Protein Force Field, J Chem Theory Comput, 9, 687, 10.1021/ct300646g · DOI · Paper page
  89. Uusitalo, 2015, Martini Coarse-Grained Force Field: Extension to DNA, J Chem Theory Comput, 11, 3932, 10.1021/acs.jctc.5b00286 · DOI · Paper page
  90. Machado, 2016, SIRAH tools: mapping, backmapping and visualization of coarse-grained models, Bioinformatics, 32, 1568, 10.1093/bioinformatics/btw020 · DOI · Paper page
  91. Danne, 2017, doGlycans –Tools for Preparing Carbohydrate Structures for Atomistic Simulations of Glycoproteins, Glycolipids, and Carbohydrate Polymers for GROMACS, J Chem Inf Model, 57, 2401, 10.1021/acs.jcim.7b00237 · DOI
  92. Girard, 2019, Hoobas: A highly object-oriented builder for molecular dynamics, Comput Mater Sci, 167, 25, 10.1016/j.commatsci.2019.05.003 · DOI
  93. Jo, 2017, CHARMM-GUI 10 years for biomolecular modeling and simulation, J Comput Chem, 38, 1114, 10.1002/jcc.24660 · DOI · Paper page
  94. Qi, 2015, CHARMM-GUI Martini Maker for Coarse-Grained Simulations with the Martini Force Field, J Chem Theory Comput, 11, 4486, 10.1021/acs.jctc.5b00513 · DOI · Paper page
  95. Malde, 2011, An Automated Force Field Topology Builder (ATB) and Repository: Version 1.0, Journal of Chemical Theory and Computation, 7, 4026, 10.1021/ct200196m · DOI · Paper page
  96. Canzar, 2013, Charge Group Partitioning in Biomolecular Simulation, Journal of Computational Biology, 20, 188, 10.1089/cmb.2012.0239 · DOI
  97. Dodda, 2017, 1.14*CM1A-LBCC: Localized Bond-Charge Corrected CM1A Charges for Condensed-Phase Simulations, J Phys Chem B, 121, 3864, 10.1021/acs.jpcb.7b00272 · DOI · Paper page
  98. Jorgensen, 2005, Potential energy functions for atomic-level simulations of water and organic and biomolecular systems, Proceedings of the National Academy of Sciences, 102, 6665, 10.1073/pnas.0408037102 · DOI · Paper page
  99. Dodda, 2017, LigParGen web server: an automatic OPLS-AA parameter generator for organic ligands, Nucleic Acids Res, 45, W331, 10.1093/nar/gkx312 · DOI · Paper page
  100. Vanommeslaeghe, 2012, Automation of the CHARMM General Force Field (CGenFF) I: Bond Perception and Atom Typing, J Chem Inf Model, 52, 3144, 10.1021/ci300363c · DOI · Paper page

Cited by

See all 68

Metadata

Authors
Kroon, P. C., Grunewald, F., Barnoud, J., van Tilburg, M., Souza, P. C. T., Wassenaar, T. A., & Marrink, S. J.
Venue
eLife
Published
2023-08-25
ISSN
2050-084X (ISSN-L)
OpenAlex
W4386162596
Cited by
68
References
19
Type
posted content
Language
en
Open access
gold
Funders
  • European Research Council (COMP-MICR-CROW-MEM)
  • Novo Nordisk (BOUNDLESS)
  • Klaus Tschira Foundation (Independent Postdoc)

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Martinize2 and Vermouth: Unified Framework for Topology Generation. https://app.cochat.ai/papers/10.7554/elife.90627.1
The paper
Kroon, P. C., Grunewald, F., Barnoud, J., van Tilburg, M., Souza, P. C. T., Wassenaar, T. A., & Marrink, S. J. (2023). Martinize2 and Vermouth: Unified Framework for Topology Generation. eLife. https://doi.org/10.7554/elife.90627.1

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.