Algorithms in Real Algebraic Geometry
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Existential Theory of the Reals
(2006) · Algorithms and computation in mathematics · doi:10.1007/3-540-33099-2_14 · Cited by 7
Computing Roadmaps and Connected Components of Semi-algebraic Sets
Basu, S., Pollack, R. M., & Roy, M.-F. (2003) · Algorithms and computation in mathematics · doi:10.1007/978-3-662-05355-3_17 · Cited by 1
Self-citationQuantitative Semi-algebraic Geometry
(2006) · Springer eBooks · doi:10.1007/3-540-33099-2_8 · Cited by 1
Cited by
Items 701–800 of 865
Spectraèdres tropicaux : application à la programmation semi-définie et aux jeux à paiement moyen
Skomra, M. (2018) · theses.fr (ABES) · doi:10.70675/355d0679zdae2z42d3za970za4e69ef8a144 · Cited by 3
Approximation Classes for Real Number Optimization Problems
Flarup, U., & Meer, K. (2006) · Lecture notes in computer science · doi:10.1007/11839132_8
Two Logical Hierarchies of Optimization Problems over the Real Numbers
Hansen, U. F., & Meer, K. (2005) · Lecture notes in computer science · doi:10.1007/11549345_40
Reachability in One-Dimensional Controlled Polynomial Dynamical Systems
Korovina, M., & Vorobjov, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-29709-0_22
Satisfiability of Viability Constraints for Pfaffian Dynamics
Korovina, M., & Vorobjov, N. (2007) · Springer eBooks · doi:10.1007/978-3-540-70881-0_23
Nguyen, H. T., Крейнович, В., Gamez, J. E., et al. (2009) · Studies in computational intelligence · doi:10.1007/978-3-642-01533-5_3
“And indeed, in fuzzy logic with the set of truth values [0, 1 ] and the negation operation f¬(x )=1 − x, there is a value which is invariant under the operation A →¬ A: the value 0.5.”
BackgroundMethodInfluentialQuelques Bornes indépendantes du nombre de variables pour les polynômes quadratiques
Moussa, S., & Mahaman, B. (2011) · Afrika Matematika · doi:10.1007/s13370-011-0057-3
Resultant-Based Method for Overdetermined Strata for Degree 4 hyperbolic Polynomials
Ezzaldine, H., Khalil, H., Mouhamad, S., et al. (2015) · British Journal of Mathematics & Computer Science · doi:10.9734/bjmcs/2015/15865
Hybrid plant modeling for discrete controllers analysis: A case study
Seabra, E. A. R., & Machado, J. (2010) · 2022 IEEE 20th International Conference on Industrial Informatics (INDIN) · doi:10.1109/indin.2010.5549583
Berthomieu, J., & Pardo, L. M. (2011) · Journal of Complexity · doi:10.1016/j.jco.2011.11.005
“The reader interested in this approach may follow [3, 4, 5, 6, 7] and references therein.”
BackgroundDetermining divisibility between polynomials with inexact coefficients
Nakayama, H., & Sekigawa, H. (2010) · ACM communications in computer algebra · doi:10.1145/1823931.1823944
“But in general case, Problem 1 is NP-hard and thus difficult (for the complexity of the algorithm, see Chapter 13 of [2]).”
BackgroundNumerical and geometric properties of a method for finding points on real solution components
Wu, W., Reid, G. J., & Feng, Y. (2014) · doi:10.1145/2631948.2631969
Simulation Aspects on the Design of Automated Manufacturing Systems
Seabra, E. A. R., & Machado, J. (2010) · IFAC Proceedings Volumes · doi:10.3182/20100701-2-pt-4011.00053
Feasible algorithms for lattice and directed subspaces
Valle, J. D., Kreinovich, V., & Wojciechowski, P. J. (2014) · Mathematical Proceedings of the Royal Irish Academy · doi:10.3318/pria.2014.114.11
Phenotype space and kinship assignment for the simpson index
Litow, B. E., & Konovalov, D. A. (2007) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita:2007034
“Details about Tarski algebra can be found in [3,10,16].”
BackgroundSchmidt, J. R. (2014) · Journal of Physical Mathematics · doi:10.4172/2090-0902.1000125 · Cited by 1
Computing Highest-Order Divisors for a Class of Quasi-Linear Partial Differential Equations
Grigoriev, D., & Schwarz, F. (2015) · Lecture notes in computer science · doi:10.1007/978-3-319-24021-3_12
Using Representation Theorems for Proving Polynomials Non-negative
Lucas, S. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-13770-4_4
On the Feasibility of Semi-algebraic Sets in Poisson Regression
Kahle, T. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-42432-3_18
Von der natürlichen über die künstliche zur Superintelligenz?
Mainzer, K. (2016) · Technik im Fokus · doi:10.1007/978-3-662-48453-1_10
Systematic Integration by Parts
Jüngel, A. (2016) · SpringerBriefs in mathematics · doi:10.1007/978-3-319-34219-1_3
Computing Sparse Representations of Systems of Rational Fractions
Lemaire, F., & Temperville, A. (2016) · Lecture notes in computer science · doi:10.1007/978-3-319-45641-6_23
Du, W., YiSheng, L. A. I., Duan, D., & XiaoKe, F. A. N. G. (2015) · Scientia Sinica Mathematica · doi:10.1360/n012015-00063
On the realisability of double-cross matrices by polylines in the plane
Kuijpers, B., & Moelans, B. (2016) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2016.12.001
Bouzidi, Y., Poteaux, A., & Quadrat, A. (2019) · Advances in delays and dynamics · doi:10.1007/978-3-030-11554-8_11
“On the other hand, the Bezout theorem [1, 8] states that for polynomials R and I of total degree respectively d1 and d2, the cardinal of V (〈R, I 〉) is bounded by d1 d2.”
BackgroundCalculation of fundamental units of number rings by means of the generalized continued fractionPreprint
Bruno, A. D. (2017) · Keldysh Institute Preprints · doi:10.20948/prepr-2017-46
Positive Definite and Unimodal Regions for Gram-Charlier Series in Analytic FormPreprint
Kwon, O. K. (2017) · SSRN Electronic Journal · doi:10.2139/ssrn.2928665
A simple sufficient criterion of the global controllability for a class of planar polynomial systems
Sun, Y., & Xie, W. (2017) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2017.8027517
A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
Litow, B. E. (2017) · Theoretical Computer Science · doi:10.1016/j.tcs.2017.10.013
Estimativa da região de estabilidade via Funções Energia Generalizadas
Ribeiro, Y. C. D. S. (2017) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.18.2017.tde-04102017-134112
Grid Methods in Computational Real Algebraic (and Semialgebraic) Geometry
Cucker, F. (2018) · Chinese Annals of Mathematics Series B · doi:10.1007/s11401-018-1070-8 · Cited by 2
Davenport, J. H., Poonen, B., Maynard, J., Helfgott, H. A., Tiep, P. H., & Cruz-Filipe, L. (2019) · International Congress of Mathematicians (ICM) · doi:10.1142/9789813272880_0038 · Cited by 1
Can each number be specified by a finite text?
Tsirelson, B. S. (2020) · WikiJournal of Science · doi:10.15347/wjs/2020.008
On the Global Controllability for Planar Systems without Explicit Control Curves
Sun, Y. (2019) · Chinese Control Conference (CCC) · doi:10.23919/chicc.2019.8865578
“, it can be verified by the finite operations of the coefficients of fi and gi, i = 1, 2, see [4, 5, 10, 11].”
BackgroundOn the Effective Computation of Stabilizing Controllers of 2D Systems
Bouzidi, Y., Cluzeau, T., Quadrat, A., et al. (2020) · Communications in computer and information science · doi:10.1007/978-3-030-41258-6_3
Bouzidi, Y., & Rouillier, F. (2020) · Advances in delays and dynamics · doi:10.1007/978-3-030-38356-5_8 · Cited by 1
Invariant coordinate subspaces of normal form of a system of ordinary differential equationsPreprint
Batkhin, A. B. (2020) · Keldysh Institute Preprints · doi:10.20948/prepr-2020-72
Decidability Results on Theories
Rasga, J., & Sernadas, C. (2020) · Studies in universal logic · doi:10.1007/978-3-030-56554-1_3
A Hurwitz Like Characterization of GUAS Planar Switched Systems
Diatta, D. N., Baldé, M., & Keita, A. D. T. (2020) · Trends in mathematics · doi:10.1007/978-3-030-57336-2_6
Quantitative Result on the Deviation of a Real Algebraic Curve from Its Vertical Tangents
Diatta, D. N., Diatta, S., & Roy, M.-F. (2020) · Trends in mathematics · doi:10.1007/978-3-030-57336-2_18
Self-citationAlgebraic Properties of Invariancy Regions
Adelgren, N. (2021) · SpringerBriefs in optimization · doi:10.1007/978-3-030-61821-6_3
Yoshida, T., & Yoshinaga, M. (2022) · Order · doi:10.1007/s11083-022-09600-y
Throwing a Sofa Through the Window
Halperin, D., Sharir, M., & Yehuda, I. (2023) · Discrete & Computational Geometry · doi:10.1007/s00454-023-00572-3
Krait, G., Lazard, S., Moroz, G., & Pouget, M. (2021) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2021.113553
Invariant Coordinate Subspaces of Normal Form of a System of Ordinary Differential Equations
Batkhin, A. B. (2021) · Programming and Computer Software · doi:10.1134/s0361768821020031
Algebraic conditions and the sparsity of spectrally arbitrary patterns
Deaett, L., & Garnett, C. (2021) · Special Matrices · doi:10.1515/spma-2020-0136
“# Edges returned by min_spanning_tree () might not respect direction # in the digraph , so this must be corrected for normalized_arcs = [] for e in spanning_tree_edges : if A[e[0],e[1]] == 1: normalized_arcs .”
BackgroundInfluentialCorrection to: Tropical varieties for exponential sums
Ergür, A. A., Paouris, G., & Rojas, J. M. (2021) · Mathematische Annalen · doi:10.1007/s00208-021-02198-3
Efficient Computation of a Semi-Algebraic Basis of the First Homology Group of a Semi-Algebraic Set
Basu, S., & Percival, S. (2024) · Discrete & Computational Geometry · doi:10.1007/s00454-024-00626-0
Self-citationOn algorithms testing positivity of real symmetric polynomials
Timofte, V., & Timofte, A. M. (2021) · Journal of Inequalities and Applications · doi:10.1186/s13660-021-02672-1
Yang, J., & Yap, C. K. (2021) · Journal of Algebra and Its Applications · doi:10.1142/s0219498822502334
Lengths of Roots of Polynomials in a Hahn Field
Knight, J. F., & Lange, K. (2021) · Algebra and Logic · doi:10.1007/s10469-021-09632-0
Revisiting reachability in Polynomial Interrupt Timed Automata
Bérard, B., & Haddad, S. (2021) · Information Processing Letters · doi:10.1016/j.ipl.2021.106208
“The proof relies on the construction of a finite abstraction, obtained via a cylindrical algebraic decomposition [11, 12] related to the first order theory of reals.”
BackgroundMethodGröbner Bases and Buchberger’s Algorithm
Joswig, M., & Theobald, T. (2013) · Universitext · doi:10.1007/978-1-4471-4817-3_9
AM/GM-based optimization : gheometry and generalizations
Naumann, H. (2021) · Publication Server of Goethe University Frankfurt am Main (Goethe University Frankfurt) · doi:10.21248/gups.64529
Feasible algorithms for lattice and directed subspaces
Valle, J. D., Крейнович, В., & Wojciechowski, P. J. (2014) · Mathematical Proceedings of the Royal Irish Academy · doi:10.1353/mpr.2014.0011
What to expect from a set of itemsets?
Delacroix, T., Lenca, P., & Lallich, S. (2022) · Information Sciences · doi:10.1016/j.ins.2021.12.115
“Solving a multivariate polynomial system is a difficult task in general which has been mostly addressed within the field of algebraic geometry and a number of algorithms for solving real polynomial systems are now known to exist [43, 3, 5].”
BackgroundMethodYengui, I. (2015) · Lecture notes in mathematics · doi:10.1007/978-3-319-19494-3_1
Yengui, I. (2015) · Lecture notes in mathematics · doi:10.1007/978-3-319-19494-3_3
Computation of General Equilibria (New Developments)
Kübler, F. (2018) · The New Palgrave Dictionary of Economics · doi:10.1057/978-1-349-95189-5_2490
A topological method for finding invariant sets of continuous systems
Fribourg, L., Goubault, É., Mohamed, S., et al. (2020) · Information and Computation · doi:10.1016/j.ic.2020.104581
Nia, P. M. (2014) · Digital Repository Service (Northeastern University) · doi:10.17760/d20005008
Runtime Monitoring of IoT Services to Guarantee Properties
(2018) · Advances in web technologies and engineering book series · doi:10.4018/978-1-5225-7622-8.ch007
(2016) · Inactive DOIs · doi:10.4115/jla.v5i0.152
赖, 义., & 王, 仁. (2008) · Science in China Series A-Mathematics (in Chinese) · doi:10.1360/za2008-38-10-1153
Computation of General Equilibria (New Developments)
Kübler, F. (2013) · Palgrave Macmillan eBooks · doi:10.1057/9781137336583.0296
I-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real Algebra
Loup, U., & Ábrahám, E. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21493-6_15 · Cited by 1
van der Hoeven, J. (2023) · Applicable Algebra in Engineering Communication and Computing · doi:10.1007/s00200-023-00616-4
On the equality of periods of Kontsevich–Zagier
Cresson, J., & Viu-Sos, J. (2022) · Journal de Théorie des Nombres de Bordeaux · doi:10.5802/jtnb.1204
On the Topology of the Intersection Curve of Two Real Parameterized Algebraic Surfaces
Diatta, D. N., & Ruatta, O. (2022) · Trends in mathematics · doi:10.1007/978-3-031-04616-2_21
An Algorithm to Verify a Class of Matrix Inequalities in the Global Stability of Nonlinear Systems
Gu, H.-L., & Sun, Y. (2022) · Chinese Control Conference (CCC) · doi:10.23919/ccc55666.2022.9902217
“Question: Whether there is a number 0 > 0 such that R(x1, x2, · · · , xk) − 0I or R(t, x1, x2, · · · , xk) − 0I for all (x1, x2, · · · , xk) ∈ R or for t 0, (x1, x2, · · · , xk) ∈ R? According to the cylindrical decomposition algorithm in [11], we can eliminate quantifiers (i.”
On the zeros of univariate E-polynomials
Barbagallo, M. L., Jeronimo, G., & Sabia, J. (2023) · Revista de la Unión Matemática Argentina · doi:10.33044/revuma.2305
Topology of real multi-affine hypersurfaces and a homological stability property
Basu, S., & Perrucci, D. (2023) · Advances in Mathematics · doi:10.1016/j.aim.2023.108982
Self-citationDoes a sparse ReLU network training problem always admit an optimum?Preprint
Le, Q.-T., Riccietti, E., & Gribonval, R. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2306.02666 · Cited by 5
A Tropical Count of Real Bitangents to Plane Quartic Curves
Geiger, A., & Panizzut, M. (2023) · The Electronic Journal of Combinatorics · doi:10.37236/11099 · Cited by 6
Uma introdução à Geometria Algébrica Real
Hornhardt, C. D. N. (2014) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.45.2014.tde-20230727-113217
Gutnik, S. A., & Sarychev, V. A. (2023) · Mathematics in Computer Science · doi:10.1007/s11786-023-00569-4
“We use the results on the geometry of discriminants [15].”
MethodCaravantes, J., Diaz–Toca, G. M., & González-Vega, L. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-38271-0_46
Rambau, J. (2023) · Discrete & Computational Geometry · doi:10.1007/s00454-023-00541-w
An Algorithm to Verify the Positive Realness of Transfer Function Matrices
Gu, H.-L., & Sun, Y. (2023) · Chinese Control Conference (CCC) · doi:10.23919/ccc58697.2023.10240720
“By Sturm Theorem, see [15, 16], we can know whether d3(ω) has real roots.”
BackgroundOn Types of Isolated KKT Points in Polynomial Optimization
Guo, F., Jiao, L., Kim, D. S., & Phạm, T.-S. (2023) · Journal of Systems Science and Complexity · doi:10.1007/s11424-023-2119-7 · Cited by 1
“These decision problems can be solved by algorithms based on the cylindrical algebraic decomposition (CAD) [20, 33] .”
BackgroundMethodInfluentialCylindrical Algebraic Decomposition with Frontier ConditionPreprint
Baker, H. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4644153
Connectivity with Uncertainty Regions Given as Line Segments
Cabello, S., & Gajser, D. (2024) · Algorithmica · doi:10.1007/s00453-023-01200-5
Safe Smooth Paths Between Straight Line Obstacles
Bertot, Y. (2024) · Lecture notes in computer science · doi:10.1007/978-3-031-61716-4_3 · Cited by 1
Computing roadmaps in unbounded smooth real algebraic sets II: Algorithm and complexity
Prébet, R., Din, M. S. E., & Schost, É. (2025) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2025.102532
Basu, S. (2024) · Notices of the American Mathematical Society · doi:10.1090/noti2900 · Cited by 1
Self-citationCalculation of a Strong Resonance Condition in a Hamiltonian System
Batkhin, A. B., & Khaidarov, Z. K. (2023) · Журнал вычислительной математики и математической физики · doi:10.31857/s0044466923050071
Intersection Searching amid Tetrahedra in Four Dimensions
Ezra, E. E., & Sharir, M. (2024) · Discrete & Computational Geometry · doi:10.1007/s00454-024-00656-8
“Although not a trivial step, all these lines can be computed in OD1(1) time, which is constant since D1 is constant, by solving a suitable set of equations that characterize these lines; see [20] and [8].”
On Robustness for the Skolem, Positivity and Ultimate Positivity Problems
Akshay, S., Bazille, H., Genest, B., et al. (2024) · Logical Methods in Computer Science · doi:10.46298/lmcs-20(2:11)2024
“Further, we note that two distinct algebraic numbers α and β , are always roots of p α p β , and we have that Given a polynomial p ∈ Z [ X ], one can compute its roots in polynomial time wrt size( p ) [9].”
BackgroundImproved Algebraic Degeneracy Testing
Cardinal, J., & Sharir, M. (2024) · Discrete & Computational Geometry · doi:10.1007/s00454-024-00673-7
Geometric and computational hardness of bilevel programming
Bolte, J., Le, Q.-T., Pauwels, E., & Vaiter, S. (2025) · Mathematical Programming · doi:10.1007/s10107-025-02229-w · Cited by 2
Perrucci, D., & Roy, M.-F. (2024) · Journal of Algebra · doi:10.1016/j.jalgebra.2024.07.010
Self-citationMaximal Codimension Collisions and Invariant Measures for Hard Spheres on a Line
Wilkinson, M. (2024) · Journal of Statistical Physics · doi:10.1007/s10955-024-03310-y
“We invite the reader to consult Coste [11] or Basu, Pollack and Roy ( [6], Chapter 14) for techniques which allow one to determine the structure of the variety determined by the above semi-algebraic system (2)–(5).”
Topologically Correct Intersection Curves of Two Trimmed Quadrics with Tolerance Control
Shao, W., & Chen, F. (2024) · Journal of Systems Science and Complexity · doi:10.1007/s11424-024-2519-3
Generating Sonic Phantoms with Quadratic Difference Tone Spectrum Synthesis
Gutiérrez, E., Haworth, C., & Cádiz, R. F. (2023) · Computer Music Journal · doi:10.1162/comj_a_00687
“The most widely used algorithm to solve this problem consists of finding a mathematical object called a Gröbner basis and then using it to determine the number of solutions to the problem (see, for example, Basu, Pollack, and Roy 2005).”
Gluonic evanescent operators: negative-norm states and complex anomalous dimensions
Jin, Q., Ren, K., Yang, G., et al. (2024) · Journal of High Energy Physics · doi:10.1007/jhep09(2024)151
Geometric Illumination of Implicit Algebraic Surfaces
Zamboj, M., & Řada, J. (2024) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-71225-8_7
Value-Positivity for Matrix Games
Chatterjee, K., Oliu‐Barton, M., & Saona, R. (2024) · Mathematics of Operations Research · doi:10.1287/moor.2022.0332
Smooth symmetric systems over a finite field and applications
Giménez, N., Matera, G., Pérez, M., et al. (2024) · Journal of Algebra · doi:10.1016/j.jalgebra.2024.09.011
Elimination Algorithms for Skew Polynomials with Applications in Cybersecurity
Rasheed, R., Sadiq, A. S., & Kaiwartya, O. (2024) · Mathematics · doi:10.3390/math12203258
“The conventional method (e.g., [21,22]) for proving this property involves rewriting the original polynomials in terms of matrix representations; this allows the utilisation of determinant computations using Cramer’s rule, where the proof proceeds by expanding the determinant along a selected row…”
Et-Taoui, B., Lehbab, I., & Makhlouf, A. (2024) · Advances in Geometry · doi:10.1515/advgeom-2024-0025
Metadata
- Authors
- Basu, S., Pollack, R., & Roy, M.-F.
- Affiliations
- Georgia Institute of Technology (US)
- Courant Institute of Mathematical Sciences (US)
- Institut de recherche mathématique de Rennes (FR)
- Venue
- Algorithms and computation in mathematics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2006
- ISSN
- 1431-1550 (ISSN-L)
- OpenAlex
- W4255213956
- Cited by
- 868
- References
- 3
- Citations by year
- 2026: 27 · 2025: 37 · 2024: 65 · 2023: 52 · 2022: 58 · 2021: 54 · 2020: 48 · 2019: 46 · 2018: 48 · 2017: 37 · 2016: 46 · 2015: 54 · 2014: 54 · 2013: 35 · 2012: 40
- FWCI
- 9.06
- Type
- book
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Algorithms and computation in mathematics (publishedVersion)
- CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
- Digital Access to Libraries (Université catholique de Louvain (UCL), l'Université de Namur (UNamur) and the Université Saint-Louis (USL-B)) (submittedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Polynomial and algebraic computation
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Mathematics › Geometry and Topology › Algebraic Geometry and Number Theory
- Keywords
- real algebraic geometry, real root counting, polynomial systems, polynomial inequalities, global optimization, existence of solutions, computational complexity
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.