On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“revealing the inverse relationship between model capacity and forgetting severity”
In the citing paper
“establishing that the minimum capacity required to maintain bounded forgetting grows sublinearly with task sequence length39”
Citations
Cites
An Introduction to Probability Theory and Its Applications, Vol. 2
Feller, W., & Teichmann, T. (1967) · Physics Today · doi:10.1063/1.3034322 · Cited by 1,280
Research works printed but not linked: 3
- Vapnik V. N., 1968, Dokl. Akad. Nauk SSSR, 181, 781
- Gnedenko B. V., 1968, Theory of Probability
- Hinčin A. Ya., 1956, Uspehi Mat. Nauk (N.S.), 11, 17
Cited by
Items 901–1,000 of 1,003
SVM Model to Predict the Water Quality Based on Physicochemical Parameters
Koranga, M., Pant, P., Pant, D., Bhatt, A. K., Pant, R., Ram, M., & Kumar, T. (2021) · International Journal of Mathematical Engineering and Management Sciences · doi:10.33889/ijmems.2021.6.2.040 · Cited by 18
Németh, Á., Harangi, M., Daróczy, B., Juhász, L., Paragh, G., & Fülöp, P. (2022) · Journal of Clinical Medicine · doi:10.3390/jcm11154311 · Cited by 19
Functional Classification with Margin Conditions
Fromont, M., & Tuleau-Malot, C. (2006) · Lecture notes in computer science · doi:10.1007/11776420_10 · Cited by 18
Exact combinatorial bounds on the probability of overfitting for empirical risk minimization
Vorontsov, K. V. (2010) · Pattern Recognition and Image Analysis · doi:10.1134/s105466181003003x · Cited by 18
An Integrated Neuroevolutionary Approach to Reactive Control and High-Level Strategy
Kohl, N., & Miikkulainen, R. P. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2150755 · Cited by 18
Pipe crack identification based on the energy method and committee of neural networks
Lee, J.-W., Kim, S.-R., & Huh, Y.-C. (2014) · International Journal of Steel Structures · doi:10.1007/s13296-014-2014-0 · Cited by 18
A general approach for cache-oblivious range reporting and approximate range counting
Afshani, P., Hamilton, C. H., & Zeh, N. (2010) · Computational Geometry · doi:10.1016/j.comgeo.2010.04.003 · Cited by 18
The minimax learning rates of normal and Ising undirected graphical models
Devroye, L., Mehrabian, A., & Reddad, T. (2020) · Electronic Journal of Statistics · doi:10.1214/20-ejs1721 · Cited by 38
Glivenko–Cantelli theorems for classes of convex sets
Elker, J., Pollard, D., & Stute, W. (1979) · Advances in Applied Probability · doi:10.1017/s000186780003305x · Cited by 18
Lower Bounds for Evolution Strategies Using VC-Dimension
Teytaud, O., & Fournier, H. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-87700-4_11 · Cited by 18
Estimating the Optimal Margins of Embeddings in Euclidean Half Spaces
Forster, J., Schmitt, N., & Simon, H. U. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44581-1_26 · Cited by 18
Noise-injected neural networks show promise for use on small-sample expression data
Hua, J.-P., Lowey, J., Xiong, Z.-X., & Dougherty, E. (2006) · BMC Bioinformatics · doi:10.1186/1471-2105-7-274 · Cited by 18
Learning nested differences in the presence of malicious noise
Auer, P. L. (1997) · Theoretical Computer Science · doi:10.1016/s0304-3975(97)00019-4 · Cited by 18
Internets in the sky: capacity of 3D wireless networks
Gupta, P., & Kumar, P. R. (2000) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc.2000.914139 · Cited by 18
IDENTIFICATION WITH FINITELY MANY DATA POINTS: THE LSCR APPROACH
Campi, M. C., & Weyer, E. (2006) · IFAC Proceedings Volumes · doi:10.3182/20060329-3-au-2901.00005 · Cited by 18
Multifractal analysis of the coupling space of feedforward neural networks
Engel, A., & Weigt, M. (1996) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.53.r2064 · Cited by 19
Randomized algorithms for the synthesis of cautious adaptive controllers
Campi, M. C., & Prandini, M. (2003) · Systems & Control Letters · doi:10.1016/s0167-6911(02)00340-7 · Cited by 18
Dissecting Deep Neural NetworksPreprint
Robinson, H., Rasheed, A., & San, O. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.03879 · Cited by 19
A CNN Model for Semantic Person Part Segmentation With Capacity Optimization
Jiang, Y., & Chi, Z. (2018) · IEEE Transactions on Image Processing · doi:10.1109/tip.2018.2886785 · Cited by 17
News analytics: Framework, techniques, and metrics
Das, S. R. (2011) · Wiley eBooks · doi:10.1002/9781118467411.ch2 · Cited by 18
Some Combinatorial Applications of Gröbner Bases
Rónyai, L., & Mészáros, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-21493-6_4 · Cited by 17
Aggregation capacity of wireless sensor networks: Extended network case
Wang, C., Changjun, J., Liu, Y., Li, X.-Y., Tang, S., & Ma, H. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5934966 · Cited by 17
Learning with prior information
Campi, M. C., & Vidyasagar, M. (2001) · IEEE Transactions on Automatic Control · doi:10.1109/9.964680 · Cited by 17
The teaching size: computable teachers and learners for universal languages
Telle, J. A., Hernández‐Orallo, J., & Ferri, C. (2019) · Machine Learning · doi:10.1007/s10994-019-05821-2 · Cited by 24
Sattari, M. T., Feizi, H., Samadianfard, S., Falsafian, K., & Salwana, E. (2020) · Measurement · doi:10.1016/j.measurement.2020.108512 · Cited by 17
TipTap: Approximate Mining of Frequent k -Subgraph Patterns in Evolving Graphs
Nasir, M. A. U., Aslay, Ç., Morales, G. D. F., & Riondato, M. (2021) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3442590 · Cited by 17
At-the-time and Back-in-time Persistent Sketches
Shi, B., Zhao, Z., Peng, Y., Li, F., & Phillips, J. M. (2021) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3448016.3452802 · Cited by 17
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2021) · ACM Journal of Experimental Algorithmics · doi:10.1145/3440015 · Cited by 17
Distribution-free performance bounds with the resubstitution error estimate
Gascuel, O., & Caraux, G. (1992) · Pattern Recognition Letters · doi:10.1016/0167-8655(92)90125-j · Cited by 17
Aires, F., & Prigent, C. (2007) · Journal of Geophysical Research Atmospheres · doi:10.1029/2007jd008391 · Cited by 17
Validation of $k$-Nearest Neighbor Classifiers
Bax, E. T. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2180887 · Cited by 26
Noise-tolerant distribution-free learning of general geometric concepts
Bshouty, N. H., Goldman, S. A., Mathias, H. D., Suri, S., & Tamaki, H. (1998) · Journal of the ACM · doi:10.1145/290179.290184 · Cited by 21
Sensor Placement Algorithms for Triangulation Based Localization
Tekdas, O., & Isler, V. (2007) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.2007.364164 · Cited by 17
Vorontsov, K. V. (2009) · Pattern Recognition and Image Analysis · doi:10.1134/s1054661809030055 · Cited by 17
Centerpoints: A Link between Optimization and Convex Geometry
Basu, A., & Oertel, T. (2017) · SIAM Journal on Optimization · doi:10.1137/16m1092908 · Cited by 23
Khanaki, K., & Pillay, A. (2018) · Mathematical logic quarterly · doi:10.1002/malq.201700070 · Cited by 17
On the Number of Distinct Rows of a Matrix with Bounded Subdeterminants
Glanzer, C., Weismantel, R., & Zenklusen, R. (2018) · SIAM Journal on Discrete Mathematics · doi:10.1137/17m1125728 · Cited by 17
Sousa, V., Meireles, I., Oliveira, V., & Dias‐Ferreira, C. (2019) · Waste and Biomass Valorization · doi:10.1007/s12649-019-00656-3 · Cited by 17
Local Rademacher complexity bounds based on covering numbers
Lei, Y., Ding, L., & Bi, Y. (2016) · Neurocomputing · doi:10.1016/j.neucom.2016.08.074 · Cited by 17
Structural Results About On-line Learning Models With and Without Queries
Auer, P. L., & Long, P. M. (1999) · Machine Learning · doi:10.1023/a:1007614417594 · Cited by 33
Optimal schedules for monitoring anytime algorithms
Finkelstein, L., & Markovitch, S. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00072-2 · Cited by 17
Theory revision with queries: Horn, read-once, and parity formulas
Goldsmith, J., Sloan, R. H., Szörényi, B., & Turán, G. (2004) · Artificial Intelligence · doi:10.1016/s0004-3702(04)00030-x · Cited by 17
A Bayesian/information theoretic model of bias learning
Baxter, J. (1996) · Conference on Learning Theory · doi:10.1145/238061.238071 · Cited by 17
Learning and generalization in a linear perceptron stochastically trained with noisy data
Dunmur, A. P., & Wallace, D. J. (1993) · Journal of Physics A Mathematical and General · doi:10.1088/0305-4470/26/21/016 · Cited by 23
Regularization of neural networks for improved load forecasting in power system
Siwek, K., & Osowski, S. (2002) · IEEE International Conference on Electronics, Circuits and Systems (ICECS) · doi:10.1109/icecs.2001.957443 · Cited by 17
Goodrich, M. T., & Ramos, E. A. (1997) · Discrete & Computational Geometry · doi:10.1007/pl00009325 · Cited by 17
Almost Sure $L_r$-Norm Convergence for Data-Based Histogram Density Estimates
Zhao, L. C., Krishnaiah, P. R., & Chen, X. R. (1991) · Theory of Probability and Its Applications · doi:10.1137/1135057 · Cited by 17
An expert network for DNA sequence analysis
Fu, L. (1999) · IEEE Intelligent Systems and their Applications · doi:10.1109/5254.747907 · Cited by 17
Operator Learning: A Statistical Perspective
Subedi, U., & Tewari, A. (2025) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-042424-070908 · Cited by 38
Double Descent in Quantum Kernel Methods
Kempkes, M., Ijaz, A., Gil-Fuster, E., Bravo-Prieto, C., Spiegelberg, J., van Nieuwenburg, E., & Dunjko, V. (2026) · PRX Quantum · doi:10.1103/cn64-gs6b · Cited by 25
Bounded VC-Dimension Implies the Schur-Erdős Conjecture
Fox, J., Pach, J., & Suk, A. (2021) · COMBINATORICA · doi:10.1007/s00493-021-4530-9 · Cited by 16
Sharpness-Aware Minimization Revisited: Weighted Sharpness as a Regularization Term
Yue, Y., Jiang, J., Ye, Z., Gao, N., Liu, Y., & Zhang, K. (2023) · Knowledge Discovery and Data Mining · doi:10.1145/3580305.3599501 · Cited by 26
Classification of data with a qudit, a geometric approach
Mandilara, A., Dellen, B. K., Jaekel, U., Valtinos, T., & Syvridis, D. (2024) · Quantum Machine Intelligence · doi:10.1007/s42484-024-00146-3 · Cited by 17
Praveen, B., Mustak, S., & Sharma, P. (2019) · The international archives of the photogrammetry, remote sensing and spatial information sciences/International archives of the photogrammetry, remote sensing and spatial information sciences · doi:10.5194/isprs-archives-xlii-3-w6-585-2019 · Cited by 19
Prediction of arsenic removal in aqueous solutions with non‐neural network algorithms
Hafsa, N. E., Al‐Yaari, M., & Rushd, S. (2020) · The Canadian Journal of Chemical Engineering · doi:10.1002/cjce.23966 · Cited by 17
Bavarian : Betweenness Centrality Approximation with Variance-aware Rademacher Averages
Cousins, C., Wohlgemuth, C., & Riondato, M. (2022) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/3577021 · Cited by 23
Tempo, R., Calafiore, G. C., & Dabbene, F. (2012) · Communications and control engineering/Communications and control engineering series · doi:10.1007/978-1-4471-4610-0_9 · Cited by 16
Coresets for Kernel Regression
Zheng, Y. L., & Phillips, J. M. (2017) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3097983.3098000 · Cited by 16
An Improved Bound for Weak Epsilon-Nets in the Plane
Rubin, N. (2018) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2018.00030 · Cited by 16
L p Samplers and Their Applications
Cormode, G., & Jowhari, H. (2019) · ACM Computing Surveys · doi:10.1145/3297715 · Cited by 16
On k-Path Covers and their applications
Funke, S., Nusser, A., & Storandt, S. (2015) · The VLDB Journal · doi:10.1007/s00778-015-0392-3 · Cited by 16
Solving Some Discrepancy Problems in NC
Mahajan, S., Ramos, E. A., & Subrahmanyam, K. V. (1997) · Lecture notes in computer science · doi:10.1007/bfb0058020 · Cited by 16
Capacity and Error Estimates for Boolean Classifiers with Limited Complexity
Pearl, J. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766943 · Cited by 16
Approximate Halfspace Range Counting
Aronov, B. S., & Sharir, M. (2010) · SIAM Journal on Computing · doi:10.1137/080736600 · Cited by 16
Buzaglo, S., Pinchasi, R., & Rote, G. (2012) · Springer eBooks · doi:10.1007/978-1-4614-0110-0_6 · Cited by 16
Learning Deterministic Finite Automata from Smallest Counterexamples
Birkendorf, A., Böker, A., & Simon, H. U. (2000) · SIAM Journal on Discrete Mathematics · doi:10.1137/s0895480198340943 · Cited by 16
Approximate testing and learnability
Romanik, K. (1992) · Conference on Learning Theory · doi:10.1145/130385.130422 · Cited by 16
Necessary and sufficient conditions for weak convergence of smoothed empirical processes
Radulović, D. S., & Wegkamp, M. H. (2003) · Statistics & Probability Letters · doi:10.1016/s0167-7152(02)00395-4 · Cited by 16
On Restricted-Focus-of-Attention Learnability of Boolean Functions
Birkendorf, A., Dichterman, E., Jackson, J. C., Klasner, N., & Simon, H. U. (1998) · Machine Learning · doi:10.1023/a:1007458528570 · Cited by 16
Duality Between Learning Machines: A Bridge Between Supervised and Unsupervised Learning
Nadal, J., & Parga, N. (1994) · Neural Computation · doi:10.1162/neco.1994.6.3.491 · Cited by 17
Data-driven design and complexity control of time–frequency detectors
Richard, C., & Lengelle, R. (1999) · Signal Processing · doi:10.1016/s0165-1684(99)00021-3 · Cited by 16
Multicast Throughput of Hybrid Wireless Networks Under Gaussian Channel Model
Wang, C., Tang, S., Li, X., Jiang, C., & Liu, Y. (2009) · IEEE International Conference on Distributed Computing Systems (ICDCS) · doi:10.1109/icdcs.2009.18 · Cited by 16
Geometric algorithms for the minimum cost assignment problem
Tokuyama, T., & Nakano, J. (1995) · Random Structures and Algorithms · doi:10.1002/rsa.3240060403 · Cited by 18
Learning capacity and sample complexity on expert networks
Fu, L. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.548180 · Cited by 16
Markov Perfect Industry Dynamics with Many Firms
Weintraub, G. Y., Benkard, C. L., & Roy, B. V. (2005) · Federal Reserve Bank of San Francisco, Working Paper Series · doi:10.24148/wp2005-23 · Cited by 17
Efficient Learning with Virtual Threshold Gates
Maass, W., & Warmuth, M. K. (1995) · Elsevier eBooks · doi:10.1016/b978-1-55860-377-6.50054-2 · Cited by 16
A correction to the proof of a lemma in "The capacity of wireless networks"
Kumar, P. R. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.818407 · Cited by 16
An Emperical Study on Support Vector Machines for Intrusion Detection
Chandra Sekhar Reddy, N. (2019) · International Journal of Emerging Trends in Engineering Research · doi:10.30534/ijeter/2019/037102019 · Cited by 15
Machine learning-based variable selection for clustered credit risk modeling
Bosker, J., Gürtler, M., & Zöllner, M. (2024) · Journal of Business Economics · doi:10.1007/s11573-024-01213-8 · Cited by 18
On Generalizable Low False-Positive Learning Using Asymmetric Support Vector Machines
Wu, S.-H., Lin, K., Chien, H.-H., Chen, C.-M., & Chen⋆, M.-S. (2012) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2012.46 · Cited by 15
Why is Resorting to Fate Wise? A Critical Look at Randomized Algorithms in Systems and Control
Campi, M. C. (2010) · European Journal of Control · doi:10.3166/ejc.16.419-430 · Cited by 15
A Comparative Study of Famous Classification Techniques and Data Mining Tools
Paul, Y., & Kumar, N. (2019) · Lecture notes in electrical engineering · doi:10.1007/978-3-030-29407-6_45 · Cited by 17
Peverati, R. (2020) · International Journal of Quantum Chemistry · doi:10.1002/qua.26379 · Cited by 15
Flow-Mixup: Classifying Multi-labeled Medical Images with Corrupted Labels
Chen, J., Yu, H., Feng, R., Chen, D. Z., & gg, J. W. (2020) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm49941.2020.9313408 · Cited by 16
Learning via variably scaled kernels
Campi, C., Marchetti, F., & Perracchione, E. (2021) · Advances in Computational Mathematics · doi:10.1007/s10444-021-09875-6 · Cited by 15
Wahl, T. B., & Strelchuk, S. (2023) · Physical Review Letters · doi:10.1103/physrevlett.131.180601 · Cited by 15
From High Definition Image to Low Space Optimization
Feigin, M., Feldman, D., & Sochen, N. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-24785-9_39 · Cited by 15
Cohen, E., Cormode, G., & Duffield, N. G. (2011) · Proceedings of the VLDB Endowment · doi:10.14778/3402707.3402721 · Cited by 15
Maximum Margin Decision Surfaces for Increased Generalisation in Evolutionary Decision Tree Learning
Agapitos, A., O’Neill, M., Brabazon, A., & Theodoridis, T. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-20407-4_6 · Cited by 15
Predicting Energy Demand Peak Using M5 Model Trees
Abdelkader, S. S., Grolinger, K., & Capretz, M. A. M. (2015) · International Conference on Machine Learning and Applications · doi:10.1109/icmla.2015.164 · Cited by 15
Local SVM approaches for fast and accurate classification of remote-sensing images
Segata, N., Pasolli, E., Melgani, F., & Blanzieri, E. (2012) · International Journal of Remote Sensing · doi:10.1080/01431161.2012.678947 · Cited by 17
Multi-kernel classification machine with reduced complexity
Wang, Z., Zhu, C., Niu, Z., Gao, D., & Feng, X. (2014) · Knowledge-Based Systems · doi:10.1016/j.knosys.2014.04.012 · Cited by 15
Simulation‐based Uniform Value Function Estimates of Markov Decision Processes
Jain, R., & Varaiya, P. P. (2006) · SIAM Journal on Control and Optimization · doi:10.1137/040619508 · Cited by 15
On the Classification Capability of Sign-Constrained Perceptrons
Legenstein, R. A., & Maass, W. (2007) · Neural Computation · doi:10.1162/neco.2008.20.1.288 · Cited by 15
Maximal width learning of binary functions
Anthony, M., & Ratsaby, J. (2009) · Theoretical Computer Science · doi:10.1016/j.tcs.2009.09.020 · Cited by 15
Classifier-independent feature selection on the basis of divergence criterion
Abe, N., Kudo, M., Toyama, J., & Shimbo, M. (2006) · Pattern Analysis and Applications · doi:10.1007/s10044-006-0030-1 · Cited by 15
Pairwise Intersections and Forbidden Configurations
Anstee, R. P., & Keevash, P. (2005) · Discrete Mathematics & Theoretical Computer Science · doi:10.46298/dmtcs.3426 · Cited by 15
An Improved Training Algorithm for Nonlinear Kernel Discriminants
Abdallah, F., Richard, C., & Lengelle, R. (2004) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2004.834346 · Cited by 15
Mahdi, R. N., & Rouchka, E. C. (2011) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2011.2109736 · Cited by 15
The complexity of exact learning of acyclic conditional preference networks from swap examples
Alanazi, E., Mouhoub, M., & Zilles, S. (2019) · Artificial Intelligence · doi:10.1016/j.artint.2019.103182 · Cited by 15
Metadata
- Authors
- Vapnik, V. N., & Chervonenkis, A. Y.
- Venue
- Theory of Probability & Its Applications
- Published
- 1971-01
- Volume
- 16
- Issue
- 2
- Pages
- 264-280
- ISSN
- 0040-585X (ISSN-L)
- 1095-7219
- OpenAlex
- W4238284510
- Cited by
- 2,448
- References
- 1
- Citations by year
- 2026: 51 · 2025: 60 · 2024: 83 · 2023: 80 · 2022: 101 · 2021: 105 · 2020: 95 · 2019: 105 · 2018: 71 · 2017: 77 · 2016: 60 · 2015: 99 · 2014: 69 · 2013: 86 · 2012: 78
- FWCI
- 0.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Theory of Probability and Its Applications (publishedVersion)
- Topics
- Physical Sciences › Mathematics › Statistics and Probability › Probability and Statistical Research
- Physical Sciences › Mathematics › Mathematical Physics › Stochastic processes and statistical mechanics
- Physical Sciences › Mathematics › Mathematical Physics › Mathematical Dynamics and Fractals
- Keywords
- uniform convergence, relative frequency, probability, law of large numbers
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.