The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
On the limited memory BFGS method for large scale optimization
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737 · cited 1×
“…see for example Steihaug (1983), O'Leary (1982), Toint (1981) and Nash (1985); (ii) the partitioned quasi-Newton method of Griewank and Toint (1982a); (iii) the conjugate gradient method; see for example Fletcher (1980) and Gill, Murray and Wright (1981); (iv) limited memory quasi-Newton methods.”
Method
Research works printed but not linked: 34
- E.M.L. Beale, “Algorithms for very large nonlinear optimization problems,” in: M.J.D. Powell, ed.,Nonlinear Optimization 1981 (Academic Press, London, 1981) pp. 281–292.
- A. Buckley, “A combined conjugate gradient quasi-Newton minimization algorithm,”Mathematical Programming 15 (1978) 200–210. · DOI
- A. Buckley, “Update to TOMS Algorithm 630,” Rapports Techniques No. 91, Institut National de Recherche en Informatique et en Automatique, Domaine Voluceau, Rocquencourt, B.P. 105 (Le Chesnay, 1987).
- A. Buckley and A. LeNir, “QN-like variable storage conjugate gradients,”Mathematical Programming 27 (1983) 155–175. · DOI
- A. Buckley and A. LeNir, “BBVSCG—A variable storage algorithm for function minimization,”ACM Transactions on Mathematical Software 11/2 (1985) 103–119. · DOI
- R.H. Byrd and J. Nocedal, “A tool for the analysis of quasi-Newton methods with application to unconstrained minimization,”SIAM Journal on Numerical Analysis 26 (1989) 727–739. · DOI
- J.E. Dennis Jr. and R.B. Schnabel, “A view of unconstrained optimization,” in: G.L. Nemhauser, A.H.G. Rinnooy Kan and M.J. Todd, eds.,Handbooks in Operations Research and Management Science, Vol. 1, Optimization (North-Holland, Amsterdam, 1989) pp. 1–72.
- R. Fletcher,Practical Methods of Optimization, Vol. 1, Unconstrained Optimization (Wiley, New York, 1980).
- J.C. Gilbert and C. Lemaréchal, “Some numerical experiments with variable storage quasi-Newton algorithms,” IIASA Working Paper WP-88, A-2361 (Laxenburg, 1988).
- P.E. Gill and W. Murray, “Conjugate-gradient methods for large-scale nonlinear optimization,” Technical Report SOL 79-15, Department of Operations Research, Stanford University (Stanford, CA, 1979). · DOI
- A. Griewank, “The global convergence of partitioned BFGS on semi-smooth problems with convex decompositions,” ANL/MCS-TM-105, Mathematics and Computer Science Division, Argonne National Laboratory (Argonne, IL, 1987).
- A. Griewank and Ph.L. Toint, “Partitioned variable metric updates for large structured optimization problems,”Numerische Mathematik 39 (1982a) 119–137. · DOI
- A. Griewank and Ph.L. Toint, “Local convergence analysis of partitioned quasi-Newton updates,”Numerische Mathematik 39 (1982b) 429–448. · DOI
- A. Griewank and Ph.L. Toint, “Numerical experiments with partially separable optimization problems,” in: D.F. Griffiths, ed.,Numerical Analysis: Proceedings Dundee 1983, Lecture Notes in Mathematics, Vol. 1066 (Springer, Berlin, 1984) pp. 203–220. · DOI
- D.C. Liu and J. Nocedal, “Test results of two limited memory methods for large scale optimization,” Technical Report NAM 04, Department of Electrical Engineering and Computer Science, Northwestern University (Evanston, IL, 1988).
- J.J. Moré, B.S. Garbow and K.E. Hillstrom, “Testing unconstrained optimization software,”ACM Transactions on Mathematical Software 7 (1981) 17–41. · DOI
- S.G. Nash, “Preconditioning of truncated-Newton methods,”SIAM Journal on Scientific and Statistical Computing 6 (1985) 599–616. · DOI
- L. Nazareth, “A relationship between the BFGS and conjugate gradient algorithms and its implications for new algorithms,”SIAM Journal on Numerical Analysis 16 (1979) 794–800. · DOI
- J. Nocedal, “Updating quasi-Newton matrices with limited storage,”Mathematics of Computation 35 (1980) 773–782. · DOI
- D.P. O'Leary, “A discrete Newton algorithm for minimizing a function of many variables,”Mathematical Programming 23 (1982) 20–33. · DOI
- J.D. Pearson, “Variable metric methods of minimization,”Computer Journal 12 (1969) 171–178. · DOI
- J.M. Perry, “A class of conjugate gradient algorithms with a two-step variable-metric memory,” Discussion Paper 269, Center for Mathematical Studies in Economics and Management Science, Northwestern University (Evanston, IL, 1977).
- M.J.D. Powell, “Some global convergence properties of a variable metric algorithm for minimization without exact line search,” in: R.W. Cottle and C.E. Lemke, eds.,Nonlinear Programing, SIAM-AMS Proceedings IX (SIAM, Philadelphia, PA, 1976).
- M.J.D. Powell, “Restart procedures for the conjugate gradient method,”Mathematical Programming 12 (1977) 241–254. · DOI · Paper page
- D.F. Shanno, “On the convergence of a new conjugate gradient algorithm,”SIAM Journal on Numerical Analysis 15 (1978a) 1247–1257. · DOI
- D.F. Shanno, “Conjugate gradient methods with inexact searches,”Mathematics of Operations Research 3 (1978b) 244–256. · DOI · Paper page
- D.F. Shanno and K.H. Phua, “Matrix conditioning and nonlinear optimization,”Mathematical Programming 14 (1978) 149–160. · DOI
- D.F. Shanno and K.H. Phua, “Remark on algorithm 500: minimization of unconstrained multivariate functions,”ACM Transactions on Mathematical Software 6 (1980) 618–622. · DOI · Paper page
- T. Steihaug, “The conjugate gradient method and trust regions in large scale optimization,”SIAM Journal on Numerical Analysis 20 (1983) 626–637. · DOI
- Ph.L. Toint, “Some numerical results using a sparse matrix updating formula in unconstrained optimization,”Mathematics of Computation 32 (1978) 839–851. · DOI
- Ph.L. Toint, “Towards an efficient sparsity exploiting Newton method for minimization,” in: I.S. Duff, ed.,Sparse Matrices and their Uses (Academic Press, New York, 1981) pp. 57–87.
- Ph.L. Toint, “Test problems for partially separable optimization and results for the routine PSPMIN,” Report Nr 83/4, Department of Mathematics, Facultés Universitaires de Namur (Namur, 1983a).
- Ph.L. Toint, “VE08AD, a routine for partially separable optimization with bounded variables,” Harwell Subroutine Library, A.E.R.E. (UK, 1983b).
- Ph.L. Toint, “A view of nonlinear optimization in a large number of variables,” Report Nr 86/16, Department of Mathematics, Facultés Universitaires de Namur (Namur, 1986).
Cited by
Raissi, M., Perdikaris, P., & Karniadakis, G. E. (2019) · Journal of Computational Physics · doi:10.1016/j.jcp.2018.10.045 · Cited by 20,384
Boyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
Towards automated crystallographic structure refinement with phenix.refine
Afonine, P. V., Grosse-Kunstleve, R. W., Echols, N., Headd, J. J., Moriarty, N. W., Mustyakimov, M., Terwilliger, T. C., Urzhumtsev, A., Zwart, P. H., & Adams, P. D. (2012) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s0907444912001308 · Cited by 5,511
Improved protein structure prediction using potentials from deep learning
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2020) · Nature · doi:10.1038/s41586-019-1923-7 · Cited by 3,378
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Filter Bubbles, Echo Chambers, and Online News Consumption
Flaxman, S., Goel, S., & Rao, J. M. (2016) · Public Opinion Quarterly · doi:10.1093/poq/nfw006 · Cited by 1,992
Federated Optimization: Distributed Machine Learning for On-Device Intelligence
Konečný, J., McMahan, H. B., Ramage, D., & Richtárik, P. (2016) · arXiv · doi:10.48550/arxiv.1610.02527 · Cited by 1,563
Understanding Black-box Predictions via Influence Functions
Koh, P. W., & Liang, P. (2017) · arXiv · doi:10.48550/arxiv.1703.04730 · Cited by 1,514
Terwilliger, T. C., Grosse-Kunstleve, R. W., Afonine, P. V., Moriarty, N. W., Zwart, P. H., Hung, L.-W., Read, R. J., & Adams, P. D. (2008) · Acta Crystallographica Section D Biological Crystallography · doi:10.1107/s090744490705024x · Cited by 1,462
Chen, Y., & Pock, T. (2017) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2016.2596743 · Cited by 1,344
Do Better ImageNet Models Transfer Better?
Kornblith, S., Shlens, J., & Le, Q. V. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00277 · Cited by 1,325
Predicting clicks: estimating the click-through rate for new ads
Richardson, M., Dominowska, E., & Ragno, R. (2007) · Proceedings of the 16th international conference on World Wide Web · doi:10.1145/1242572.1242643 · Cited by 1,049
Observed versus latent features for knowledge base and text inference
Toutanova, K., & Chen, D. (2015) · Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality · doi:10.18653/v1/w15-4007 · Cited by 1,070
Revisiting Self-Supervised Visual Representation Learning
Kolesnikov, A., Zhai, X., & Beyer, L. (2019) · 2019 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2019.00202 · Cited by 675
(2004) · Cited by 610
Jia, F., Lei, Y., Lu, N., & Xing, S. (2018) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2018.03.025 · Cited by 587
SoK: Security and Privacy in Machine Learning
Papernot, N., McDaniel, P., Sinha, A., & Wellman, M. P. (2018) · 2018 IEEE European Symposium on Security and Privacy (EuroS&P) · doi:10.1109/eurosp.2018.00035 · Cited by 502
Shin, H.-C., Orton, M. R., Collins, D. J., Doran, S. J., & Leach, M. O. (2013) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2012.277 · Cited by 488
Communication-efficient edge ai: algorithms and systems
Shi, Y., Yang, K., Jiang, T., Zhang, J., & Letaief, K. B. (2020) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2020.3007787 · Cited by 488
Predicting Parameters in Deep Learning
Shakibi, B. (2014) · University of British Columbia · doi:10.14288/1.0165555 · Cited by 462
Conditional random fields for activity recognition
Vail, D. L., Veloso, M. M., & Lafferty, J. D. (2007) · Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems · doi:10.1145/1329125.1329409 · Cited by 357
Senior, A. W., Evans, R., Jumper, J., Kirkpatrick, J., Sifre, L., Green, T., Qin, C., Žídek, A., Nelson, A. W. R., Bridgland, A., et al. (2019) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.25834 · Cited by 347
Neural Optimizer Search with Reinforcement Learning
Bello, I., Zoph, B., Vasudevan, V., & Le, Q. V. (2017) · arXiv · doi:10.48550/arxiv.1709.07417 · Cited by 319
Learning generative models for protein fold families
Balakrishnan, S., Kamisetty, H., Carbonell, J. G., Lee, S., & Langmead, C. J. (2011) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.22934 · Cited by 316
Mobley, D. L., Chodera, J. D., & Dill, K. A. (2006) · The Journal of Chemical Physics · doi:10.1063/1.2221683 · Cited by 316
GAN-Leaks: A Taxonomy of Membership Inference Attacks against Generative Models
Chen, D., Yu, N., Zhang, Y., & Fritz, M. (2020) · Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security · doi:10.1145/3372297.3417238 · Cited by 311
A Survey of Privacy Attacks in Machine Learning
Rigaki, M., & Garcia, S. (2024) · ACM Computing Surveys · doi:10.1145/3624010 · Cited by 285
RobustBench: a standardized adversarial robustness benchmark
Croce, F., Andriushchenko, M., Sehwag, V., Debenedetti, E., Flammarion, N., Chiang, M., Mittal, P., & Hein, M. (2020) · arXiv · doi:10.48550/arxiv.2010.09670 · Cited by 284
Machine Learning Based Trust Computational Model for IoT Services
Jayasinghe, U., Lee, G. M., Um, T.-W., & Shi, Q. (2019) · IEEE Transactions on Sustainable Computing · doi:10.1109/tsusc.2018.2839623 · Cited by 256
A Survey of Uncertainty in Deep Neural Networks
Gawlikowski, J., Tassi, C. R. N., Ali, M., Lee, J., Humt, M., Feng, J., Kruspe, A., Triebel, R., Jung, P., Roscher, R., et al. (2021) · arXiv · doi:10.48550/arxiv.2107.03342 · Cited by 232
Geometric modeling in shape space
Kilian, M., Mitra, N. J., & Pottmann, H. (2007) · ACM SIGGRAPH 2007 papers · doi:10.1145/1275808.1276457 · Cited by 224
Hyperparameter optimization with approximate gradient
Pedregosa, F. (2016) · arXiv · doi:10.48550/arxiv.1602.02355 · Cited by 217
Analyzing Data Granularity Levels for Insider Threat Detection Using Machine Learning
Le, D. C., Zincir-Heywood, N., & Heywood, M. I. (2020) · IEEE Transactions on Network and Service Management · doi:10.1109/tnsm.2020.2967721 · Cited by 191
Certified Data Removal from Machine Learning Models
Guo, C., Goldstein, T., Hannun, A., & van der Maaten, L. (2019) · arXiv · doi:10.48550/arxiv.1911.03030 · Cited by 160
Boyd, P. G., & Woo, T. K. (2016) · CrystEngComm · doi:10.1039/c6ce00407e · Cited by 157
Graphene nanosheets derived from plastic waste for the application of DSSCs and supercapacitors
Pandey, S., Karakoti, M., Surana, K., Dhapola, P. S., SanthiBhushan, B., Ganguly, S., Singh, P. K., Abbas, A., Srivastava, A., & Sahoo, N. G. (2021) · Scientific Reports · doi:10.1038/s41598-021-83483-8 · Cited by 155
Ramírez-Gallego, S., Fernández, A., García, S., Chen, M., & Herrera, F. (2018) · Information Fusion · doi:10.1016/j.inffus.2017.10.001 · Cited by 140
Activity recognition using semi-Markov models on real world smart home datasets
van Kasteren, T. L. M., Englebienne, G., & Kröse, B. J. A. (2010) · Journal of Ambient Intelligence and Smart Environments · doi:10.3233/ais-2010-0070 · Cited by 131
Cyberthreat Detection from Twitter using Deep Neural Networks
Dionisio, N., Alves, F., Ferreira, P. M., & Bessani, A. (2019) · 2019 International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.2019.8852475 · Cited by 126
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125
Training an Active Random Field for Real-Time Image Denoising
Barbu, A. (2009) · IEEE Transactions on Image Processing · doi:10.1109/tip.2009.2028254 · Cited by 105
Unberath, M., Gao, C., Hu, Y., Judish, M., Taylor, R. H., Armand, M., & Grupp, R. (2021) · Frontiers in Robotics and AI · doi:10.3389/frobt.2021.716007 · Cited by 102
Vinje, V., Zapf, B., Ringstad, G., Eide, P. K., Rognes, M. E., & Mardal, K.-A. (2023) · Fluids and Barriers of the CNS · doi:10.1186/s12987-023-00459-8 · Cited by 83
SIRT3 substrate specificity determined by peptide arrays and machine learning
Smith, B. C., Settles, B., Hallows, W. C., Craven, M. W., & Denu, J. M. (2011) · ACS Chemical Biology · doi:10.1021/cb100218d · Cited by 80
Zhang, C., Zhao, Y., Fan, C., Li, T., Zhang, X., & Li, J. (2020) · Applied Thermal Engineering · doi:10.1016/j.applthermaleng.2020.115261 · Cited by 79
Chodera, J. D., Swope, W. C., Noé, F., Prinz, J.-H., Shirts, M. R., & Pande, V. S. (2011) · The Journal of Chemical Physics · doi:10.1063/1.3592152 · Cited by 71
A learning-based multimodel integrated framework for dynamic traffic flow forecasting
Zhou, T., Han, G., Xu, X., Han, C., Huang, Y., & Qin, J. (2019) · Neural Processing Letters · doi:10.1007/s11063-018-9804-x · Cited by 66
Hard to Forget: Poisoning Attacks on Certified Machine Unlearning
Marchant, N. G., Rubinstein, B. I. P., & Alfeld, S. (2022) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v36i7.20736 · Cited by 64
“We assumed the organization and the attacker both used L-BFGS (D. C. Liu and Nocedal, 1989) to fit their models.”
Benchmarking Adaptive Variational Quantum Eigensolvers
Claudino, D., Wright, J., McCaskey, A. J., & Humble, T. S. (2020) · Frontiers in Chemistry · doi:10.3389/fchem.2020.606863 · Cited by 52
Trastuzumab Deruxtecan Resistance via Loss of HER2 Expression and Binding
Chen, W., Gupta, A., Mai, N., Nag, S., Lau, J. S., Singh, S., Chodera, J. D., Liu, B., de Stanchina, E., Pareja, F., et al. (2026) · Cancer Discovery · doi:10.1158/2159-8290.cd-25-0647 · Cited by 50
Yue, Y., Fan, J., Xin, G., Huang, Q., Wang, J.-B., Li, Y., Zhang, Q., & Wang, W. (2021) · Environmental Science & Technology · doi:10.1021/acs.est.0c08811 · Cited by 50
Gómez, H., Rojas, R., Patel, D., Tabak, L. A., Lluch, J. M., & Masgrau, L. (2014) · Org. Biomol. Chem. · doi:10.1039/c3ob42569j · Cited by 41
State-of-the-RNArt: benchmarking current methods for RNA 3D structure prediction
Bernard, C., Postic, G., Ghannay, S., & Tahi, F. (2024) · NAR Genomics and Bioinformatics · doi:10.1093/nargab/lqae048 · Cited by 40
A study of scalar optically-pumped magnetometers for use in magnetoencephalography without shielding
Clancy, R. J., Gerginov, V., Alem, O., Becker, S., & Knappe, S. (2021) · Physics in Medicine & Biology · doi:10.1088/1361-6560/ac18fb · Cited by 37
Toward a Whole-Cell model of ribosome biogenesis: kinetic modeling of SSU assembly
Earnest, E. E., Lai, J., Chen, K., Hallock, M. J., Williamson, J. R., & Luthey-Schulten, Z. (2015) · Biophysical Journal · doi:10.1016/j.bpj.2015.07.030 · Cited by 30
Federated learning vulnerabilities, threats and defenses: A systematic review and future directions
Almutairi, S., & Barnawi, A. (2023) · Internet of Things · doi:10.1016/j.iot.2023.100947 · Cited by 35
Neural physical engines for inferring the halo mass distribution function
Charnock, T., Lavaux, G., Wandelt, B. D., Sarma Boruah, S., Jasche, J., & Hudson, M. J. (2020) · Monthly Notices of the Royal Astronomical Society · doi:10.1093/mnras/staa682 · Cited by 26
A Novel Framework to Harmonise Satellite Data Series for Climate Applications
Giering, R., Quast, R., Mittaz, J. P. D., Hunt, S. E., Harris, P. M., Woolliams, E. R., & Merchant, C. J. (2019) · Remote Sensing · doi:10.3390/rs11091002 · Cited by 21
On Inferring Intentions in Shared Tasks for Industrial Collaborative Robots
Olivares-Alarcos, A., Foix, S., & Alenyà, G. (2019) · Electronics · doi:10.3390/electronics8111306 · Cited by 20
Log2Intent: Towards Interpretable User Modeling via Recurrent Semantics Memory Unit
Tao, Z., Li, S., Wang, Z., Fang, C., Yang, L., Zhao, H., & Fu, Y. (2019) · Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3292500.3330889 · Cited by 16
Distance‐based reconstruction of protein quaternary structures from inter‐chain contacts
Soltanikazemi, E., Quadir, F., Roy, R. S., Guo, Z., & Cheng, J. (2022) · Proteins: Structure, Function, and Bioinformatics · doi:10.1002/prot.26269 · Cited by 15
Drug Target Prioritization for Alzheimer's Disease Using Protein Interaction Network Analysis
Podder, A., Pandit, M., & Narayanan, L. (2018) · OMICS: A Journal of Integrative Biology · doi:10.1089/omi.2018.0131 · Cited by 14
Person identity shift for privacy-preserving person re-identification
Dou, S., Jiang, X., Zhao, Q., Wang, Y., Li, D., & Zhao, C. (2026) · Science China Information Sciences · doi:10.1007/s11432-023-4583-x · Cited by 2
Connecting the dots: deep learning-based automated model building methods in cryo-EM
Bansia, H., & des Georges, A. (2026) · Frontiers in Molecular Biosciences · doi:10.3389/fmolb.2025.1613399 · Cited by 2
MORPHING OF TRIANGULAR MESHES IN SHAPE SPACE
WUHRER, S., BOSE, P., CHANG, S., O'ROURKE, J., & BRUNTON, A. (2010) · International Journal of Shape Modeling · doi:10.1142/s0218654310001341 · Cited by 1
Xu, Z., Liu, J., Wang, Y., & Gu, Y. (2026) · The Annals of Applied Statistics · doi:10.1214/26-aoas2236
Yamauchi, M., Brandani, G. B., Terakawa, T., & Takada, S. (2026) · eLife · doi:10.7554/elife.106752
Metadata
- Authors
- Liu, D. C., & Nocedal, J.
- Venue
- Mathematical Programming
- Published
- 1989-08
- Volume
- 45
- Issue
- 1-3
- Pages
- 503-528
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2051434435
- Cited by
- 8,560
- References
- 1
- FWCI
- 10.93
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.springer.com/tdm (tdm)
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.
