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 701–800 of 1,003
RTNI—A symbolic integrator for Haar-random tensor networks
Fukuda, M., König, R., & Nechita, I. (2019) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8121/ab434b · Cited by 45
Gée, C., & Denimal, E. (2020) · Remote Sensing · doi:10.3390/rs12182982 · Cited by 28
Vempala, S. (2001) · Combinatorial optimization · doi:10.1007/978-1-4615-0013-1_16 · Cited by 28
A Multi-Label Learning Based Kernel Automatic Recommendation Method for Support Vector Machine
Zhang, X., & Song, Q. (2015) · PLoS ONE · doi:10.1371/journal.pone.0120455 · Cited by 28
Efficacy of Using Support Vector Machine in a Contractor Prequalification Decision Model
Lam, K. C., Lam, M. C., & Wang, D. (2009) · Journal of Computing in Civil Engineering · doi:10.1061/(asce)cp.1943-5487.0000030 · Cited by 28
Deterministic sampling and range counting in geometric data streams
Bagchi, A., Chaudhary, A., Eppstein, D., & Goodrich, M. T. (2007) · ACM Transactions on Algorithms · doi:10.1145/1240233.1240239 · Cited by 28
On convergence properties of pocket algorithm
Muselli, M. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.572101 · Cited by 28
Calafiore, G. C., Campi, M. C., & Ghaoui, L. E. (2002) · IFAC Proceedings Volumes · doi:10.3182/20020721-6-es-1901.01000 · Cited by 28
Further applications of random sampling to computational geometry
Clarkson, K. L. (1986) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/12130.12173 · Cited by 28
Results on learnability and the Vapnik-Chervonenkis dimension
Linial, N., Mansour, Y., & Rivest, R. L. (1988) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1988.21930 · Cited by 28
A connectionist learning algorithm with provable generalization and scaling bounds
Gallant, S. I. (1990) · Neural Networks · doi:10.1016/0893-6080(90)90089-4 · Cited by 31
Trend Filtering Methods for Momentum StrategiesPreprint
Bruder, B., Dao, T.-L., Richard, J.-C., & Roncalli, T. (2013) · SSRN Electronic Journal · doi:10.2139/ssrn.2289097 · Cited by 28
The complexity dynamics of grokking
DeMoss, B., Sapora, S., Foerster, J., Hawes, N., & Posner, I. (2025) · Physica D Nonlinear Phenomena · doi:10.1016/j.physd.2025.134859 · Cited by 38
Shi, Y., Zeng, W., Wang, N., Wang, S., & Huang, Z. (2015) · Frontiers in Psychology · doi:10.3389/fpsyg.2015.01030 · Cited by 28
RANKING-BASED KERNELS IN APPLIED BIOMEDICAL DIAGNOSTICS USING A SUPPORT VECTOR MACHINE
Jumutc, V., Zayakin, P., & Borisov, A. (2011) · International Journal of Neural Systems · doi:10.1142/s0129065711002961 · Cited by 27
Nearest neighbor searching under uncertainty II
Agarwal, P. K., Aronov, B. S., Har-Peled, S., Phillips, J. M., Yi, K., & Zhang, W. (2013) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/2463664.2465219 · Cited by 27
Bounding Regression Errors in Data-Driven Power Grid Steady-State Models
Liu, Y., Xu, B., Botterud, A., Zhang, N., & Kang, C. (2020) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2020.3017684 · Cited by 30
EPTAS and Subexponential Algorithm for Maximum Clique on Disk and Unit Ball Graphs
Bonamy, M., Bonnet, É., Bousquet, N., Charbit, P., Giannopoulos, P., Kim, E. J., Rzążewski, P., Sikora, F., & Thomassé, S. (2021) · Journal of the ACM · doi:10.1145/3433160 · Cited by 27
Effects of quantum resources and noise on the statistical complexity of quantum circuits
Bu, K., Koh, D. E., Li, L., Luo, Q., & Zhang, Y. (2023) · Quantum Science and Technology · doi:10.1088/2058-9565/acb56a · Cited by 40
Recursive Teaching Dimension, Learning Complexity, and Maximum Classes
Doliwa, T., Simon, H. U., & Zilles, S. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16108-7_19 · Cited by 27
Bousquet, N., Lagoutte, A., & Thomassé, S. (2014) · European Journal of Combinatorics · doi:10.1016/j.ejc.2014.02.003 · Cited by 27
Effects of Kernel Function on Nu Support Vector Machines in Extreme Cases
Ikeda, K. (2006) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.860832 · Cited by 31
Information divergence estimation based on data-dependent partitions
Silva, J. F., & Narayanan, S. S. (2010) · Journal of Statistical Planning and Inference · doi:10.1016/j.jspi.2010.04.011 · Cited by 27
Existence of submatrices with all possible columns
Steele, J. M. (1978) · Journal of Combinatorial Theory Series A · doi:10.1016/0097-3165(78)90046-8 · Cited by 27
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Boosting
Aslam, J. A., & Decatur, S. E. (1998) · Information and Computation · doi:10.1006/inco.1998.2664 · Cited by 27
Alon, N., & Onn, S. (1999) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(98)00142-5 · Cited by 27
Deterministic sampling and range counting in geometric data streams
Bagchi, A., Chaudhary, A., Eppstein, D., & Goodrich, M. T. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997842 · Cited by 27
Benedek, G. M., & Itai, A. (1988) · Lecture notes in computer science · doi:10.1007/3-540-19488-6_108 · Cited by 35
Abstract Combinatorial Programs and Efficient Property Testers
Czumaj, A., & Sohler, C. (2005) · SIAM Journal on Computing · doi:10.1137/s009753970444199x · Cited by 27
Sameh, S., Zarzoura, F., & El-Mewafi, M. (2022) · International Journal of Geoinformatics · doi:10.52939/ijg.v18i6.2461 · Cited by 32
Computational Sample Complexity
Decatur, S. E., Goldreich, O., & Ron, D. (2000) · SIAM Journal on Computing · doi:10.1137/s0097539797325648 · Cited by 37
A new feature extraction method for odour classification
Ehret, B., Safenreiter, K., Lorenz, F. P., & Biermann, J. (2011) · Sensors and Actuators B Chemical · doi:10.1016/j.snb.2011.05.042 · Cited by 26
Time Series Forecasting Based on Novel Support Vector Machine Using Artificial Fish Swarm Algorithm
Chen, X., Wang, J., Sun, D., & Liang, J. (2008) · International Conference on Natural Computation (ICNC) · doi:10.1109/icnc.2008.48 · Cited by 26
Machine Learning: The State of the Art
Wang, J., & Tao, Q. (2008) · IEEE Intelligent Systems · doi:10.1109/mis.2008.107 · Cited by 26
Learning Reductions That Really Work
Beygelzimer, A., Daumé, H., Langford, J. C., & Mineiro, P. (2015) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494118 · Cited by 29
Lam, M. W. Y., Wang, J., Su, D., & Yu, D. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9054719 · Cited by 26
Simple Lifelong Learning Machines
Vogelstein, J. T., Dey, J. K., Helm, H. S., LeVine, W., Mehta, R., Tomita, T. M., Xu, H., Geisa, A., Wang, Q., van de Ven, G. M., et al. (2025) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2025.3595364 · Cited by 29
Jain, N., & Murthy, C. A. (2015) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-015-0418-6 · Cited by 26
Rademacher penalization applied to fuzzy ARTMAP and boosted ARTMAP
Verzi, S., Heileman, G. L., Georgiopoulus, M., & Healy, M. J. R. (2002) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2001.939530 · Cited by 26
An Optimal Deterministic Algorithm for Computing the Diameter of a Three-Dimensional Point Set
Ramos, E. A. (2001) · Discrete & Computational Geometry · doi:10.1007/s00454-001-0029-8 · Cited by 29
On the hardness of learning intersections of two halfspaces
Khot, S., & Saket, R. (2010) · Journal of Computer and System Sciences · doi:10.1016/j.jcss.2010.06.010 · Cited by 30
Spotting a False Alarm—Integrating Experience and Real-Time Analysis With Artificial Intelligence
Nybø, R., Bjørkevoll, K. S., & Rommetveit, R. (2008) · SPE Intelligent Energy Conference and Exhibition · doi:10.2118/112212-ms · Cited by 26
On the Complexity of Learning from Drifting Distributions
Barve, R. D., & Long, P. M. (1997) · Information and Computation · doi:10.1006/inco.1997.2656 · Cited by 26
Regression and Classification with Regularization
Mukherjee, S., Rifkin, R. M., & Poggio, T. (2003) · Lecture notes in statistics · doi:10.1007/978-0-387-21579-2_7 · Cited by 26
Learning from examples with unspecified attribute values
Goldman, S. A., Kwek, S. S., & Scott, S. (2003) · Information and Computation · doi:10.1016/s0890-5401(02)00030-5 · Cited by 26
Heisele, B., Verri, A., & Poggio, T. (2002) · Proceedings of the IEEE · doi:10.1109/jproc.2002.801450 · Cited by 26
Learning by canonical smooth estimation. II. Learning and choice of model complexity
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489276 · Cited by 26
Range counting over multidimensional data streams
Suri, S., Tóth, C. D., & Zhou, Y. (2004) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/997817.997844 · Cited by 26
On Graph Neural Networks versus Graph-Augmented MLPsPreprint
Chen, L., Chen, Z., & Bruna, J. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2010.15116 · Cited by 29
Characterizing forecastability of wind sites in the United States
Feng, C., Sun, M., Cui, M., Chartan, E. K., Hodge, B. S., & Zhang, J. (2018) · Renewable Energy · doi:10.1016/j.renene.2018.08.085 · Cited by 25
On the Zarankiewicz Problem for Graphs with Bounded VC-Dimension
Janzer, O., & Pohoata, C. (2024) · COMBINATORICA · doi:10.1007/s00493-024-00095-2 · Cited by 25
Data-driven AI algorithms for construction machinery
Liang, K., Zhao, J., Zhang, Z., Guan, W., Pan, M., & Li, M. (2024) · Automation in Construction · doi:10.1016/j.autcon.2024.105648 · Cited by 26
Active learning using on-line algorithms
Mesterharm, C., & Pazzani, M. J. (2011) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/2020408.2020553 · Cited by 25
The Importance of Ontological Structure: Why Validation by ‘Fit-to-Data’ Is Insufficient
Polhill, G. J., & Salt, D. (2017) · Understanding complex systems · doi:10.1007/978-3-319-66948-9_8 · Cited by 25
A Theory of Statistical Inference for Ensuring the Robustness of Scientific Results
Coker, B., Rudin, C. D., & King, G. (2021) · Management Science · doi:10.1287/mnsc.2020.3818 · Cited by 42
Mishra, V. N., Prasad, R., Kumar, P., Gupta, D. K., Agarwal, S., & Gangwal, A. (2018) · Iranian Journal of Science and Technology Transactions of Civil Engineering · doi:10.1007/s40996-018-0172-6 · Cited by 25
HyperBench: A Benchmark and Tool for Hypergraphs and Empirical Findings
Fischl, W., Gottlob, G., Longo, D. M., & Pichler, R. (2019) · ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS) · doi:10.1145/3294052.3319683 · Cited by 25
Ashtiani, H., Ben-David, S., Harvey, N. J. A., Liaw, C., Mehrabian, A., & Plan, Y. (2020) · Journal of the ACM · doi:10.1145/3417994 · Cited by 25
A central limit theorem for two-sample U-processes
Neumeyer, N. (2004) · Statistics & Probability Letters · doi:10.1016/j.spl.2002.12.001 · Cited by 25
Alternative second-order cone programming formulations for support vector classification
Maldonado, S., & López, J. (2014) · Information Sciences · doi:10.1016/j.ins.2014.01.041 · Cited by 25
The vapnik-chervonenkis dimension of a random graph
Anthony, M., Brightwell, G., & Cooper, C. (1995) · Discrete Mathematics · doi:10.1016/0012-365x(94)00187-n · Cited by 25
The VC-dimension of set systems defined by graphs
Kranakis, E., Kriz̧anc, D., Ruf, B., Urrutia, J., & Woeginger, G. J. (1997) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(96)00137-0 · Cited by 25
Adaptive Spatial Partitioning for Multidimensional Data Streams
Hershberger, J. E., Shrivastava, N., Suri, S., & Tóth, C. D. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30551-4_46 · Cited by 25
Structure optimization of neural networks with the A*-algorithm
Doering, A., Galicki, M., & Witte, H. (1997) · IEEE Transactions on Neural Networks · doi:10.1109/72.641466 · Cited by 25
A constructive approach to neuro-fuzzy networks
Mascioli, F. M. F., & Martinelli, G. (1998) · Signal Processing · doi:10.1016/s0165-1684(97)00200-4 · Cited by 25
Gandhi, S., Suri, S., & Welzl, E. (2007) · ACM Conference on Embedded Networked Sensor Systems (SenSys) · doi:10.1145/1322263.1322289 · Cited by 25
Composite Geometric Concepts and Polynomial Predictability
Long, P. M., & Warmuth, M. K. (1990) · Elsevier eBooks · doi:10.1016/b978-1-55860-146-8.50024-2 · Cited by 26
Spanning trees with low crossing number
Matoušek, J. (1991) · RAIRO - Theoretical Informatics and Applications · doi:10.1051/ita/1991250201031 · Cited by 25
Learning by examples from a nonuniform distribution
Reimann, P., & den Broeck, C. V. (1996) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.53.3989 · Cited by 27
Sample-based classification procedures related to empiric distributions
Glick, N. (1976) · IEEE Transactions on Information Theory · doi:10.1109/tit.1976.1055581 · Cited by 25
An information-theoretic view of connectivity in wireless sensor networks
Liu, X., & Srikant, R. (2005) · IEEE International Conference on Sensing, Communication, and Networking (SECON) · doi:10.1109/sahcn.2004.1381953 · Cited by 25
LEARNING NESTED DIFFERENCES OF INTERSECTION-CLOSED CONCEPT CLASSES
Helmbold, D. P., Sloan, R. H., & Warmuth, M. K. (1989) · Elsevier eBooks · doi:10.1016/b978-0-08-094829-4.50006-4 · Cited by 26
Approximate Aggregation for Tracking Quantiles in Wireless Sensor Networks
He, Z., Cai, Z., Cheng, S., & Wang, X. (2014) · Lecture notes in computer science · doi:10.1007/978-3-319-12691-3_13 · Cited by 24
Safe Multi-Agent Pathfinding with Time Uncertainty
Shahar, T., Shekhar, S., Atzmon, D., Saffidine, A., Juba, B., & Stern, R. (2021) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.12397 · Cited by 24
The VC dimension of k-fold union
Eisenstat, D., & Angluin, D. (2006) · Information Processing Letters · doi:10.1016/j.ipl.2006.10.004 · Cited by 24
Fundamentals of Machine Learning
Du, K.-L., & Swamy, M. N. S. (2013) · Springer eBooks · doi:10.1007/978-1-4471-5571-3_2 · Cited by 26
MREKLM: A fast multiple empirical kernel learning machine
Fan, Q., Wang, Z., Hongyuan Zha, B., & Gao, D. (2016) · Pattern Recognition · doi:10.1016/j.patcog.2016.07.027 · Cited by 24
Subjectivity in Inductive Inference
Gilboa, I., & Samuelson, L. (2009) · Theoretical Economics · doi:10.3982/te845 · Cited by 24
Counting the learnable functions of geometrically structured data
Rotondo, P., Lagomarsino, M. C., & Gherardi, M. (2020) · Physical Review Research · doi:10.1103/physrevresearch.2.023169 · Cited by 24
Local Prediction Models for Spatiotemporal Volume Visualization
Tkachev, G., Frey, S., & Ertl, T. (2019) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2019.2961893 · Cited by 24
Modularizing Deep Learning via Pairwise Learning With Kernels
Duan, S., Yu, S., & Principe, J. C. (2021) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2020.3042346 · Cited by 32
Practical complexity control in multilayer perceptrons
Gallinari, P., & Cibas, T. (1999) · Signal Processing · doi:10.1016/s0165-1684(98)00200-x · Cited by 24
A note on minimum distance estimation of copula densities
Gérard Biau, A., & Wegkamp, M. H. (2005) · Statistics & Probability Letters · doi:10.1016/j.spl.2005.02.006 · Cited by 24
Model selection by bootstrap penalization for classification
Fromont, M. (2006) · Machine Learning · doi:10.1007/s10994-006-7679-y · Cited by 24
Empirical Processes, Typical Sequences, and Coordinated Actions in Standard Borel Spaces
Raginsky, M. (2012) · IEEE Transactions on Information Theory · doi:10.1109/tit.2012.2227669 · Cited by 24
Kernel machines and additive fuzzy systems: classification and function approximation
Chen, Y., & Wang, J. Z. (2004) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzz.2003.1206530 · Cited by 24
Approximating stochastic biochemical processes with Wasserstein pseudometrics
Thorsley, D., & Klavins, E. (2010) · IET Systems Biology · doi:10.1049/iet-syb.2009.0039 · Cited by 27
Communication Complexity Under Product and Nonproduct Distributions
Sherstov, A. A. (2008) · Computational Complexity · doi:10.1007/s00037-009-0285-1 · Cited by 24
Nonparametric change detection and estimation in large-scale sensor networks
He, T., Ben-David, S., & Tong, L. (2006) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2006.870635 · Cited by 24
On hardness of learning intersection of two halfspaces
Khot, S., & Saket, R. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374426 · Cited by 24
Learning by canonical smooth estimation. I. Simultaneous estimation
Buescher, K. L., & Kumar, P. R. (1996) · IEEE Transactions on Automatic Control · doi:10.1109/9.489275 · Cited by 24
Probably Approximate Learning of Sets and Functions
Natarajan, B. K. (1991) · SIAM Journal on Computing · doi:10.1137/0220021 · Cited by 26
A new fast algorithm for multiclass hyperspectral image classification with SVM
Hosseini, S. A., & Ghassemian, H. (2011) · International Journal of Remote Sensing · doi:10.1080/01431161.2010.547882 · Cited by 23
Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty
Kanamori, T., & Takeda, A. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-011-9923-2 · Cited by 23
A Better Approximation for Balls
Cheang, G. H. L., & Barron, A. R. (2000) · Journal of Approximation Theory · doi:10.1006/jath.1999.3441 · Cited by 23
Margin-adaptive model selection in statistical learning
Arlot, S., & Bartlett, P. L. (2011) · Bernoulli · doi:10.3150/10-bej288 · Cited by 28
Fast and Flexible Top- k Similarity Search on Large Networks
Zhang, J., Tang, J., Ma, C., Tong, H., Yu, J. S., Li, J., Luyten, W. H. M. L., & Moens, M. (2017) · ACM Transactions on Information Systems · doi:10.1145/3086695 · Cited by 23
Kete, S. C. R., Suprihatin, S., Tarigan, S. D., & Effendi, H. (2019) · IOP Conference Series Earth and Environmental Science · doi:10.1088/1755-1315/284/1/012019 · Cited by 23
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
Long, P. M. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44634-6_4 · Cited by 23
A Family of Novel Graph Kernels for Structural Pattern Recognition
Horst Bunke, A., & Riesen, K. (2007) · Springer eBooks · doi:10.1007/978-3-540-76725-1_3 · Cited by 23
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.