Randomized algorithms for the low-rank approximation of matrices
Open accessThe DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
We describe two recently proposed randomized algorithms for the construction of low-rank approximations to matrices, and demonstrate their application ( inter alia ) to the evaluation of the singular value decompositions of numerically low-rank matrices. Being probabilistic, the schemes described here have a finite probability of failure; in most cases, this probability is rather negligible (10 −17 is a typical value). In many situations, the new procedures are considerably more efficient and reliable than the classical (deterministic) ones; they also parallelize naturally. We present several numerical examples to illustrate the performance of the schemes.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The text we found for this paper looks like another document, so the self-check wasn’t run.
Citations
Cites
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Björck, Å., Dahlquist, G. G., & Anderson, N. (1974) · Cited by 1,719
Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
Gu, M., & Eisenstat, S. C. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917055 · Cited by 677
On the Compression of Low Rank Matrices
Cheng, H., Gimbutas, Z., Martinsson, P. G., & Rokhlin, V. (2005) · SIAM Journal on Scientific Computing · doi:10.1137/030602678 · Cited by 301
Self-citationA fast randomized algorithm for the approximation of matrices
Woolfe, F., Liberty, E., Rokhlin, V., & Tygert, M. (2008) · Applied and Computational Harmonic Analysis · doi:10.1016/j.acha.2007.12.002 · Cited by 280
Self-citationA Randomized Algorithm for the Approximation of Matrices
Martinsson, P.-G., Rockhlin, V., & Tygert, M. (2006) · doi:10.21236/ada458932 · Cited by 268
Self-citationEstimating the Largest Eigenvalue by the Power and Lanczos Algorithms with a Random Start
Kuczyński, J., & Woźniakowski, H. (1992) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/0613066 · Cited by 251
Incomplete Cross Approximation in the Mosaic-Skeleton Method
Tyrtyshnikov, E. (2000) · Computing · doi:10.1007/s006070070031 · Cited by 249
Efficient computation of the DFT with only a subset of input or output points
Sorensen, H. V., & Burrus, C. S. (1993) · IEEE Transactions on Signal Processing · doi:10.1109/78.205723 · Cited by 245
Estimating Extremal Eigenvalues and Condition Numbers of Matrices
Dixon, J. D. (1983) · SIAM Journal on Numerical Analysis · doi:10.1137/0720053 · Cited by 106
Research works printed but not linked: 1
- N Ailon B Chazelle (ACM Press New York) pp. 557–563 (2006).
Cited by
Items 401–500 of 541
Towards Automatic and Reliable Localized Model Order ReductionPreprint
Buhr, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1908.02074 · Cited by 3
The structure of global conservation laws in Galerkin plasma modelsPreprint
Kaptanoglu, A. A., Morgan, K., Hansen, C. J., & Brunton, S. L. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03436 · Cited by 3
Randomized Algorithms for Scientific Computing (RASC)
Buluç, A., Kolda, T. G., Wild, S. M., Anitescu, M., DeGennaro, A. M., Jakeman, J. D., Kamath, C., Kannan, R., Lopes, M. E., Martinsson, P., et al. (2021) · Lawrence Berkeley National Laboratory · doi:10.2172/2006805 · Cited by 5
Self-citationBlock Randomized Singular Value Decomposition on GPUs
Yuechao, L. U., Matsushita, Y., & Ino, F. (2020) · IEICE Transactions on Information and Systems · doi:10.1587/transinf.2019edp7265 · Cited by 2
Residual Based Sampling for Online Low Rank Approximation
Bhaskara, A., Lattanzi, S., Vassilvitskii, S., & Zadimoghaddam, M. (2020) · Information Theory and Applications Workshop (ITA) · doi:10.1109/ita50056.2020.9244974 · Cited by 2
Efficient algorithms for computing rank‐revealing factorizations on a GPU
Heavner, N., Chen, C., Gopal, A., & Martinsson, P. (2023) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2515 · Cited by 2
Self-citationLi, W., & Yang, C. (2025) · Engineering Analysis with Boundary Elements · doi:10.1016/j.enganabound.2025.106160 · Cited by 2
Interpolative Separable Density Fitting on Adaptive Real Space Grids
Zhu, H. Y., Yeh, C.-N., Morales, M. A., Greengard, L., Jiang, S., & Kaye, J. (2026) · Journal of Chemical Theory and Computation · doi:10.1021/acs.jctc.5c02008 · Cited by 2
Sepehri, A. (2019) · Bernoulli · doi:10.3150/18-bej1029 · Cited by 2
Scalable Physics-Based Maximum Likelihood Estimation Using Hierarchical Matrices
Chen, Y., & Anitescu, M. (2023) · SIAM/ASA Journal on Uncertainty Quantification · doi:10.1137/21m1458880 · Cited by 2
On the Noise Sensitivity of the Randomized SVD
Romanov, E. (2024) · IEEE Transactions on Information Theory · doi:10.1109/tit.2024.3450412 · Cited by 2
Tensor ring rank determination using odd-dimensional unfolding
Qiu, Y., Zhou, G., Li, C., Mandic, D. P., & Zhao, Q. (2024) · Neural Networks · doi:10.1016/j.neunet.2024.106947 · Cited by 2
Fast Direct Solvers for Integral Equations at Low-Frequency Based on Operator Filtering
Henry, C., Consoli, D., Dély, A., Rahmouni, L., Merlini, A., & Andriulli, F. P. (2023) · European Conference on Antennas and Propagation · doi:10.23919/eucap57121.2023.10133635 · Cited by 2
Adaptive Parallelizable Algorithms for Interpolative Decompositions via Partially Pivoted LU
Pearce, K. F., Chen, C., Dong, Y., & Martinsson, P. (2025) · Numerical Linear Algebra with Applications · doi:10.1002/nla.70002 · Cited by 2
Self-citationWu, Z., Zhang, H., Liu, Z., Ye, H., & Zheng, Y. (2026) · International Journal of Applied Mechanics · doi:10.1142/s1758825126500122 · Cited by 2
Efficient methods for grouping vectors into low-rank clusters
Rangan, A. V. (2011) · Journal of Computational Physics · doi:10.1016/j.jcp.2011.03.048 · Cited by 2
Multidimensional de-aliased Cadzow reconstruction of seismic records
Naghizadeh, M., & Sacchi, M. D. (2012) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/segam2012-0494.1 · Cited by 2
Hou, T. Y., Liu, P., & Zhang, Z. (2016) · CaltechAUTHORS (California Institute of Technology) · Cited by 2
Efficient high-order integral equation methods for the heat equation
Wang, S. (2016) · Cited by 2
Low-Rank Approximation-Based Super-Resolution Imaging for Airborne Forward-Looking Radar
Li, J., Zhang, Y., Zhang, Y., Huang, Y., & Yang, J. (2020) · IEEE Radar Conference (RadarConf) · doi:10.1109/radarconf2043947.2020.9266355 · Cited by 2
Parallel Computations with DNA-Encoded Chemical Reaction Networks
Gines, G., Genot, A. J., & Rondelez, Y. (2023) · Natural computing series · doi:10.1007/978-981-19-9891-1_19 · Cited by 3
Liu, Y., Pan, X., & Sheng, X. (2016) · International Symposium on Antennas, Propagation and EM Theory (ISAPE) · doi:10.1109/isape.2016.7834003 · Cited by 2
Francavilla, M. A., Lefkimmiatis, S., Villena, J. F., & Polimeridis, A. G. (2021) · Magnetic Resonance in Medicine · doi:10.1002/mrm.28718 · Cited by 2
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.006 · Cited by 3
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.011 · Cited by 4
Fast Random Projections Using Lean Walsh Transforms
Liberty, E., Ailon, N., & Singer, A. (2007) · doi:10.21236/ada489771 · Cited by 2
Self-citationDensity functional theory and nuclear quantum effects
Lin, L. (2011) · Cited by 2
Householder QR Factorization: Adding Randomization for Column Pivoting. FLAME Working Note #78Preprint
Martinsson, P., Quintana‐Ortí, G., Heavner, N., & Geijn, R. A. (2015) · arXiv (Cornell University) · Cited by 2
Self-citationCost‐effective suspension formulation for flexible TiB 2 tapes
Shirey, K., & Tallón, C. (2023) · International Journal of Applied Ceramic Technology · doi:10.1111/ijac.14322 · Cited by 1
Detecting Stubborn Behaviors in Influence Networks: A Model-Based Approach for Resilient Analysis
Raineri, R., Ravazzi, C., Como, G., & Fagnani, F. (2024) · IEEE Control Systems Letters · doi:10.1109/lcsys.2024.3472495 · Cited by 1
Fast Computation of Volume Integral Operator-Based Characteristic Modes With Skeletonization
Wu, D., & Wu, Q. (2025) · IEEE Antennas and Wireless Propagation Letters · doi:10.1109/lawp.2025.3586907 · Cited by 1
Ye, W.-R., & Huang, X. (2026) · Petroleum Science · doi:10.1016/j.petsci.2026.02.005 · Cited by 1
3D square-root variable-metric-based elastic full-waveform inversion and uncertainty estimation
Liu, Q., & Chen, L. (2026) · Science China Earth Sciences · doi:10.1007/s11430-025-1867-y · Cited by 1
Bayesian Low-Rank Interpolative Decomposition for Complex Datasets
Lu, J. (2022) · Studies in Engineering and Technology · doi:10.11114/set.v9i1.5624 · Cited by 9
Li, A., Becker, S., & Doostan, A. (2024) · Computer Methods in Applied Mechanics and Engineering · doi:10.1016/j.cma.2024.117538 · Cited by 2
Zhang, Q., Ritzert, S., Zhang, J., Kehls, J., Reese, S., & Brepols, T. (2026) · Journal of the Mechanics and Physics of Solids · doi:10.1016/j.jmps.2025.106499 · Cited by 1
Efficient Signal Denoising Methods Using Randomized HSVD and Wavelet Thresholding
Chaturantabut, S., & Chanakul, J. (2026) · AppliedMath · doi:10.3390/appliedmath6090149 · Cited by 1
On Low Rank Approximation of Linear Operators in p-Norms and Some Algorithms
Liu, Y. (2016) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595916500238 · Cited by 1
Sensor Array Signal Processing Using SSA
Vasylyshyn, V. I. (2023) · Lecture notes on data engineering and communications technologies · doi:10.1007/978-3-031-35467-0_41 · Cited by 1
Rank‐structured approximation of some Cauchy matrices with sublinear complexity
Lepilov, M., & Xia, J. (2023) · Numerical Linear Algebra with Applications · doi:10.1002/nla.2526 · Cited by 1
A class of refined preconditioners with sparse error correction for BEM linear system
Wang, M., & Zhang, S. (2023) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2023.115505 · Cited by 1
Truncated QR Factorization with Pivoting in Mixed Precision
Buttari, A., Mary, T., & Pacteau, A. (2025) · SIAM Journal on Scientific Computing · doi:10.1137/24m1644705 · Cited by 1
Fast algorithms for non-convex tensor completion problems
Kanwal, A., Rahman, M. U., & Boulaaras, S. (2025) · Afrika Matematika · doi:10.1007/s13370-025-01290-0 · Cited by 1
Huang, B., Tu, B., & Lu, B. (2012) · Communications in Computational Physics · doi:10.4208/cicp.101110.061211a · Cited by 1
Huang, S.-L., Xu, H., Pan, X., & Sheng, X. (2016) · International Symposium on Antennas, Propagation and EM Theory (ISAPE) · doi:10.1109/isape.2016.7834004 · Cited by 1
Block Randomized Optimization for Adaptive Hypergraph Learning
Karantaidis, G., Sarridis, I., & Kotropoulos, C. L. (2019) · Proceedings - International Conference on Image Processing · doi:10.1109/icip.2019.8802985 · Cited by 1
Regression and Model Selection
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.005 · Cited by 1
A domain decomposition preconditioning for an inverse volume scattering problem
Borges, C., & Biros, G. (2020) · Inverse Problems · doi:10.1088/1361-6420/ab6e78 · Cited by 1
Robust and Fast Algorithms for Singular Spectral Analysis of Seismic Data
Tiwari, R. K., & Rekapalli, R. (2020) · Springer eBooks · doi:10.1007/978-3-030-19304-1_6 · Cited by 1
Estimating the Error of Randomized Newton Methods: A Bootstrap Approach
Lopes, M. E., & Chen, X. (2020) · International Conference on Machine Learning · Cited by 1
Missing Image Data Reconstruction Based on Least-Squares Approach with Randomized SVD
Intawichai, S., & Chaturantabut, S. (2021) · Advances in intelligent systems and computing · doi:10.1007/978-3-030-68154-8_89 · Cited by 1
A Randomized Low-Rank Decomposition Based Method for Solving Volume-Surface Integral Equation
Liu, Y. (2021) · European Microwave Conference (EuMC) · doi:10.23919/eumc48046.2021.9338088 · Cited by 1
Hide Chopin in the Music: Efficient Information Steganography Via Random Shuffling
Sun, Z., Li, C., & Zhao, Q. (2021) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp39728.2021.9413357 · Cited by 1
A Fast Parameter Sweep Method for Microstrip Structures based on Method of Moment
Jia, M.-T., Zhao, Z., Wu, B., & Sheng, X. (2022) · Cross Strait Radio Science and Wireless Technology Conference (CSRSWTC) · doi:10.1109/csrswtc56224.2022.10098420 · Cited by 1
Gujjula, V., & Ambikasaran, S. (2023) · Journal of Computational Physics · doi:10.1016/j.jcp.2023.112627 · Cited by 1
Learning to Generate Parameters of ConvNets for Unseen Image Data
Wang, S., Feng, K., Li, C., Yuan, Y., & Wang, G. (2024) · IEEE Transactions on Image Processing · doi:10.1109/tip.2024.3445731 · Cited by 2
Is Networking of People, Attitudes and Ideas Exploitable for Marketing of New Energy Solutions?
Schebesch, K. B. (2013) · Springer eBooks · doi:10.1007/978-1-4614-6865-3_6 · Cited by 2
Fast Kalman filtering via a low-rank perturbative approach
Paninski, L., Rad, K. R., & Huggins, J. H. (2011) · Cited by 1
On Rank Reduction of Separated Representations.Preprint
Biagioni, D., Beylkin, D., & Beylkin, G. (2013) · arXiv (Cornell University) · Cited by 1
A Randomized Approximate Nearest Neighbors Algorithm - A Short Version
Jones, P. W., Osipov, A., & Rokhlin, V. (2011) · doi:10.21236/ada639824 · Cited by 1
Self-citationNumerical Calculus of Probability Density Functions
Satkauskas, I. (2017) · CU Scholar (University of Colorado Boulder) · Cited by 1
Geometry-Oblivious FMM for Compressing Dense SPD MatricesPreprint
Yu, C. D., Levitt, J., Reiz, S., & Biros, G. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1707.00164 · Cited by 1
Advancements in Algorithms for Approximations of Rank Structured Matrices
Lessel, K. (2020) · eScholarship (California Digital Library) · Cited by 1
Pass-efficient methods for compression of high-dimensional turbulent flow dataPreprint
Dunton, A. M., Jofre, L., Iaccarino, G., & Doostan, A. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1905.13257 · Cited by 3
Sparse sketches with small inversion biasPreprint
Dereziński, M., Liao, Z., Dobriban, E., & Mahoney, M. W. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2011.10695 · Cited by 41
The Dual JL Transforms and Superfast Matrix AlgorithmsPreprint
Luan, Q., Pan, V. Y., & Svadlenka, J. (2019) · arXiv (Cornell University) · Cited by 1
Pruning Neural Networks with Interpolative DecompositionsPreprint
Chee, J., Renz, M., Damle, A., & De, C. (2021) · arXiv (Cornell University) · Cited by 1
Bayesian Parametric Matrix Models: Principled Uncertainty Quantification for Spectral LearningPreprint
Nooraiepour, M. (2025) · SSRN Electronic Journal · doi:10.2139/ssrn.5625491 · Cited by 3
Sparsity promoting optimization in quantum mechanical signal processing
Compton, R. (2012) · eScholarship (California Digital Library)
Efficient full-wave computation of radar cross section for multiple source locations
Pham-Xuan, V., Condon, M., & Brennan, C. (2015) · European Conference on Antennas and Propagation
Fast linear algorithms for machine learning
Lu, Y. (2015) · ScholarlyCommons (University of Pennsylvania)
Fast direct algorithms for elliptic equations via hierarchical matrix compression
Schmitz, P. G. (2010) · Texas ScholarWorks (Texas Digital Library)
Skeleton based fast solution of MoM system with many right hand sides
Xu, K., Huang, S.-L., Pan, X., & Sheng, X. (2015) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/aps.2015.7304763
Fast computation of radiation pressure forces for Gaussian beams with multiple parameters
Pan, X., Gou, M., & Sheng, X. (2014) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/aps.2014.6905405
ID for data with multiple clusters
Ari, I., Cemgil, A. T., & Akarun, L. (2013) · Signal Processing and Communications Applications Conference (SIU) · doi:10.1109/siu.2013.6531308
Georgiev, S. (2011) · DukeSpace (Duke University)
Asendorf, N., & Nadakuditi, R. R. (2015) · Asilomar Conference on Signals, Systems and Computers (ACSSC) · doi:10.1109/acssc.2015.7421388
Uncertainty estimation for full waveform inversion with a prior information from depth migration
Zhu, H., Li, S., Fomel, S. B., Stadler, G., & Ghattas, O. N. (2015) · Second International Meeting for Applied Geoscience & Energy · doi:10.1190/segam2015-5834647.1
Fast direct methods for molecular electrostatics
Greengard, L., & Ho, K. L. (2012)
Gou, M., Yang, M., & Sheng, X. (2016) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.2244128
Some models and measures for learning on a budget
Venkatasubramanian, S., & Saha, A. (2012)
Collaborative Low-Rank Subspace ClusteringPreprint
Tierney, S., Guo, Y., & Gao, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1704.03966
Low-Rank Approximation via Sparse Frequent DirectionsPreprint
Teng, D., & Chu, D. (2017) · arXiv (Cornell University)
Skeletonization accelerated multilevel fast multipole algorithm for volume integral equation
Liu, Y., Pan, X., & Sheng, X. (2017) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/apusncursinrsm.2017.8072407
Fast solution of linear systems with many right hand sides using MPI parallel skeletonization
Huang, S.-L., Pan, X., & Sheng, X. (2017) · Digest - IEEE Antennas and Propagation Society. International Symposium · doi:10.1109/apusncursinrsm.2017.8072408
Fast Wide Angular Sweeping of Scattering From Large Scale Target with Cavity
Huang, S.-L., Pan, X., & Sheng, X. (2018) · IEEE International Conference on Computational Electromagnetics · doi:10.1109/compem.2018.8496634
Randomized Interpolative Decomposition of Separated RepresentationsPreprint
Biagioni, D., Beylkin, D., & Beylkin, G. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1306.5013
The Niche, Its Hypervolume and the Entropy of Existence
Stevenson, D. S. (2019) · Springer eBooks · doi:10.1007/978-3-030-25550-3_7
Mixed precision matrix interpolative decompositions for model reductionPreprint
Dunton, A. M., & Fox, A. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2012.00706
Fast Multipole-Based Elliptic PDE Solver and Preconditioner
Ibeid, H. (2016) · King Abdullah University of Science and Technology Repository (King Abdullah University of Science and Technology) · doi:10.25781/kaust-8021a
Multi-channel rank reduction methods with applications to receiver function reconstruction
Rubio, G. (2020) · ERA: Education and Research Archive (University of Alberta) · doi:10.7939/r3-jxgt-mg91
Constructing reduced model for complex physical systems via interpolation and neural networks*
Lai, X., Wang, X., & Nie, Y. (2021) · Chinese Physics B · doi:10.1088/1674-1056/abd92e
Interpolation for Parametric ROMs
Brunton, S. L., & Kutz, J. N. (2019) · Cambridge University Press eBooks · doi:10.1017/9781108380690.013
An Algorithmic Approach to Solve Continuum HypothesisPreprint
Lam, K. S. (2019) · SSRN Electronic Journal · doi:10.2139/ssrn.3318201
Deterministic matrix sketches for low-rank compression of high-dimensional simulation dataPreprint
Dunton, A. M., & Doostan, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2105.01271
Banf, M., & Hartwig, T. (2021) · Computation · doi:10.3390/computation9120146
Electromagnetics, Physics, and Mathematics
Tong, M. S., & Chew, W. C. (2020) · Wiley eBooks · doi:10.1002/9781119284857.ch1
4. Accelerating Hierarchical Low-Rank Approximation Methods Using GPUs
Yokota, R. (2019) · The Journal of The Institute of Image Information and Television Engineers · doi:10.3169/itej.73.58
Metadata
- Authors
- Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., & Tygert, M.
- Affiliations
- Yale University (US)
- University of Colorado Boulder (US)
- Department of Computer Science and
- Venue
- Proceedings of the National Academy of Sciences
- Publisher
- National Academy of Sciences
- Published
- 2007-12-18
- Volume
- 104
- Issue
- 51
- Pages
- 20167-20172
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- PMC
- PMC2154402
- OpenAlex
- W1968691112
- Cited by
- 559
- References
- 14
- Citations by year
- 2026: 25 · 2025: 22 · 2024: 21 · 2023: 29 · 2022: 26 · 2021: 35 · 2020: 44 · 2019: 56 · 2018: 37 · 2017: 41 · 2016: 44 · 2015: 41 · 2014: 33 · 2013: 27 · 2012: 27
- FWCI
- 8.96
- Type
- journal article
- Language
- en
- Open access
- green
- www.ncbi.nlm.nih.gov
- Locations
- Proceedings of the National Academy of Sciences (publishedVersion)
- PubMed Central (publishedVersion)
- PubMed (publishedVersion)
- ePubWU Institutional Repository (Wirtschaftsuniversität Wien) (submittedVersion)
- WU Research (submittedVersion, other-oa)
- Funders
- Japan Society for the Promotion of Science (26820298, 25000003, 16H00923)
- National Institute of Environmental Health Sciences (27302C0031)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Mathematics › Applied Mathematics › Statistical and numerical algorithms
- Keywords
- low-rank approximation, randomized algorithms, singular value decomposition, parallel algorithms, matrix approximation
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.