The DOI matches its Crossref record; 116 of the 116 references it cites were found in a registry or an index.
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Abstract
It has been over a decade since neural networks were first applied to solve combinatorial optimization problems. During this period, enthusiasm has been erratic as new approaches are developed and (sometimes years later) their limitations are realized. This article briefly summarizes the work that has been done and presents the current standing of neural networks for combinatorial optimization by considering each of the major classes of combinatorial optimization problems. Areas which have not yet been studied are identified for future research.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Genetic algorithms in search, optimization, and machine learning
(1989) · Choice Reviews Online · doi:10.5860/choice.27-0936 · Cited by 49,010
Optimization by Simulated Annealing
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983) · Science · doi:10.1126/science.220.4598.671 · Cited by 45,134
(1979) · Cited by 43,841
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Neural networks and physical systems with emergent collective computational abilities.
Hopfield, J. J. (1982) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.79.8.2554 · Cited by 19,270
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Self-organized formation of topologically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · doi:10.1007/bf00337288 · Cited by 9,529
Self-Organization and Associative Memory
Kohonen, T. (1989) · Springer Series in Information Sciences · doi:10.1007/978-3-642-88163-3 · Cited by 8,740
Kohonen, T. (1990) · Proceedings of the IEEE · doi:10.1109/5.58325 · Cited by 8,414
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Handbook of Genetic Algorithms
Davis, L. D. (1991) · Cumulative Index of Computer Aided Architectural Design · Cited by 7,330
Hopfield, J. J. (1984) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.81.10.3088 · Cited by 6,918
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Linear Programming and Extensions
Dantzig, G. (1963) · RAND Corporation eBooks · doi:10.7249/r366 · Cited by 5,755
Integer and Combinatorial Optimization
Williams, H. P., Nemhauser, G. L., & Wolsey, L. A. (1990) · Journal of the Operational Research Society · doi:10.2307/2583737 · Cited by 5,485
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
On the shortest spanning subtree of a graph and the traveling salesman problem
Kruskal, J. B. (1956) · Proceedings of the American Mathematical Society · doi:10.1090/s0002-9939-1956-0078686-7 · Cited by 5,088
Future paths for integer programming and links to artificial intelligence
Glover, F. (1986) · Computers & Operations Research · doi:10.1016/0305-0548(86)90048-1 · Cited by 4,181
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
Lin, S., & Kernighan, B. W. (1973) · Operations Research · doi:10.1287/opre.21.2.498 · Cited by 3,821
A learning algorithm for Boltzmann machines
Ackley, D. H., Hinton, G. E., & Sejnowski, T. J. (1985) · Cognitive Science · doi:10.1207/s15516709cog0901_7 · Cited by 3,402
Integer and Combinatorial Optimization
Nemhauser, G., & Wolsey, L. (1988) · Wiley eBooks · doi:10.1002/9781118627372 · Cited by 3,176
Self-organized formation of topographically correct feature maps
Kohonen, T. (1982) · Biological Cybernetics · Cited by 2,995
Linear Programming and Extensions
Dantzig, G. (1963) · Princeton University Press eBooks · doi:10.1515/9781400884179 · Cited by 2,713
Modern heuristic techniques for combinatorial problems
Reeves, C. R. (1993) · Medical Entomology and Zoology · Cited by 2,580
Tank, D., & Hopfield, J. (1986) · IEEE Transactions on Circuits and Systems · doi:10.1109/tcs.1986.1085953 · Cited by 2,194
An Automatic Method for Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (2010) · 50 Years of Integer Programming 1958-2008 · doi:10.1007/978-3-540-68279-0_5 · Cited by 1,988
An Automatic Method of Solving Discrete Programming Problems
Land, A. H., & Doig, A. G. (1960) · Econometrica · doi:10.2307/1910129 · Cited by 1,942
*13 Simulated Annealing and Boltzmann Machines
(1993) · Neural Network Learning and Expert Systems · doi:10.7551/mitpress/4931.003.0017 · Cited by 1,637
Nonlinear neural networks: Principles, mechanisms, and architectures
Grossberg, S. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90021-4 · Cited by 1,623
ART 2: self-organization of stable category recognition codes for analog input patterns
Carpenter, G. A., & Grossberg, S. (1987) · Applied Optics · doi:10.1364/ao.26.004919 · Cited by 1,442
(1990) · Discrete Applied Mathematics · doi:10.1016/0166-218x(90)90039-f · Cited by 1,440
Self-organization and associative memory: 3rd edition
Kohonen, T. (1989) · Springer eBooks · Cited by 1,223
Constraint satisfaction in logic programming
Hentenryck, P. V. (1989) · Medical Entomology and Zoology · Cited by 1,218
Neural networks for nonlinear programming
Kennedy, M. P., & Chua, L. O. (1988) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.1783 · Cited by 1,111
Szu, H., & Hartley, R. (1987) · Physics Letters A · doi:10.1016/0375-9601(87)90796-1 · Cited by 1,089
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
Graph Theory: An Algorithmic Approach
Kay, E. (1976) · Journal of the Operational Research Society · doi:10.1057/jors.1976.202 · Cited by 902
An analogue approach to the travelling salesman problem using an elastic net method
Durbin, R., & Willshaw, D. (1987) · Nature · doi:10.1038/326689a0 · Cited by 797
Neural Computing - An Introduction
Beale, R., & Jackson, T. (1990) · Taylor & Francis eBooks · doi:10.1201/9781420050431 · Cited by 684
Metaheuristics: A bibliography
Osman, I. H., & Laporte, G. (1996) · Annals of Operations Research · doi:10.1007/bf02125421 · Cited by 672
Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization
(1998) · Springer eBooks · doi:10.1007/978-1-4615-5775-3 · Cited by 669
Chaotic simulated annealing by a neural network model with transient chaos
Chen, L., & Aihara, K. (1995) · Neural Networks · doi:10.1016/0893-6080(95)00033-v · Cited by 661
Adding a conscience to competitive learning
DeSieno (1988) · IEEE International Conference on Neural Networks · doi:10.1109/icnn.1988.23839 · Cited by 637
Intelligent Engineering Systems through Artificial Neural Networks
(2009) · ASME Press eBooks · doi:10.1115/1.802953 · Cited by 610
Combinations of genetic algorithms and neural networks: a survey of the state of the art
Schaffer, J. D., Whitley, D., & Eshelman, L. J. (2003) · [Proceedings] COGANN-92: International Workshop on Combinations of Genetic Algorithms and Neural Networks · doi:10.1109/cogann.1992.273950 · Cited by 570
On the stability of the Travelling Salesman Problem algorithm of Hopfield and Tank
Wilson, G. V., & Pawley, G. S. (1988) · Biological Cybernetics · doi:10.1007/bf00363956 · Cited by 546
Neural Networks and Physical Systems with Emergent Collective Computational Abilities
Hopfield, J. J. (2018) · Feynman and Computation · doi:10.1201/9780429500459-2 · Cited by 537
Designing and reporting on computational experiments with heuristic methods
Barr, R. S., Golden, B. L., Kelly, J. P., Resende, M. G. C., & Stewart, W. R. (1995) · Journal of Heuristics · doi:10.1007/bf02430363 · Cited by 448
A NEW METHOD FOR MAPPING OPTIMIZATION PROBLEMS ONTO NEURAL NETWORKS
Peterson, C., & Söderberg, B. (1989) · International Journal of Neural Systems · doi:10.1142/s0129065789000414 · Cited by 443
Testing heuristics: We have it all wrong
Hooker, J. N. (1995) · Journal of Heuristics · doi:10.1007/bf02430364 · Cited by 437
A theoretical investigation into the performance of the Hopfield model
Aiyer, S. V. B., Niranjan, M., & Fallside, F. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80232 · Cited by 381
Statistical cooling : a general approach to combinatorial optimization problems
Aarts, E. E., & Laarhoven, V. P. P. (1985) · Philips Journal of Research · Cited by 366
Neural Computing: An Introduction
Beale, R., & Jackson, T. (1990) · Institute of Physics eBooks · doi:10.1887/0852742622 · Cited by 344
Self-organizing feature maps and the travelling salesman problem
Angéniol, B., de La Croix Vaubois, G., & Le Texier, J.-Y. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90002-0 · Cited by 340
EVOLUTIONARY ARTIFICIAL NEURAL NETWORKS
YAO, X. (1993) · International Journal of Neural Systems · doi:10.1142/s0129065793000171 · Cited by 333
Applications of counterpropagation networks
Hecht-Nielsen, R. (1988) · Neural Networks · doi:10.1016/0893-6080(88)90015-9 · Cited by 309
Channel assignment for cellular radio using neural networks
Kunz, D. (1991) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.69987 · Cited by 267
A neural network parallel algorithm for channel assignment problems in cellular radio networks
Funabiki, N., & Takefuji, Y. (1992) · IEEE Transactions on Vehicular Technology · doi:10.1109/25.182594 · Cited by 266
Graph partitioning using annealed neural networks
Van den Bout, D. E., & Miller, T. K. (1990) · IEEE Transactions on Neural Networks · doi:10.1109/72.80231 · Cited by 218
A VLSI architecture for high-performance, low-cost, on-chip learning
Hammerstrom, D. (1990) · 1990 IJCNN International Joint Conference on Neural Networks · doi:10.1109/ijcnn.1990.137621 · Cited by 209
Neural Networks for the MS/OR Analyst: An Application Bibliography
Sharda, R. (1994) · Interfaces · doi:10.1287/inte.24.2.116 · Cited by 181
Neural networks for routing communication traffic
Rauch, H. E., & Winarske, T. (1988) · IEEE Control Systems Magazine · doi:10.1109/37.1870 · Cited by 175
Improving the performance of the Hopfield-Tank neural network through normalization and annealing
Van den Bout, D. E., & Miller, T. K. (1989) · Biological Cybernetics · doi:10.1007/bf00203001 · Cited by 162
Optimization neural networks for the segmentation of magnetic resonance images
Amartur, S. C., Piraino, D., & Takefuji, Y. (1992) · IEEE Transactions on Medical Imaging · doi:10.1109/42.141645 · Cited by 162
Neural network parallel computing
Takefujo, Y. (1992) · Kluwer international series in engineering and computer science · Cited by 160
A reconfigurable VLSI neural network
Satyanarayana, S., Tsividis, Y., & Graf, H. P. (1992) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.109558 · Cited by 157
Kohonen's self-organizing maps: exploring their computational capabilities
Ritter, A., & Schulten (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23838 · Cited by 151
Neural Network Parallel Computing
Takefuji, Y. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3642-0 · Cited by 149
Artificial neural networks for four-coloring map problems and K-colorability problems
Takefuji, Y., & Lee, K. C. (1991) · IEEE Transactions on Circuits and Systems · doi:10.1109/31.101328 · Cited by 145
State-of-the-Art Survey—The Traveling Salesman Problem: A Neural Network Perspective
Potvin, J. (1993) · INFORMS journal on computing · doi:10.1287/ijoc.5.4.328 · Cited by 142
Static and dynamic channel assignment using neural networks
Smith‐Miles, K., & Palaniswami, M. S. (1997) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.552073 · Cited by 137
Fort, J. (1988) · Biological Cybernetics · doi:10.1007/bf00336888 · Cited by 130
Neural network methods in combinatorial optimization
Looi, C. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90044-6 · Cited by 107
Alternative networks for solving the traveling salesman problem and the list-matching problem
Brandt, Wang, Y., Laub, & Mitra (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23945 · Cited by 107
Combinatorial optimization with Gaussian machines
Akiyama, Y., Yamashita, Kajiura, & Aiso (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118630 · Cited by 102
A study of the application of Kohonen-type neural networks to the Travelling Salesman Problem
Favata, F., & Walker, R. (1991) · Biological Cybernetics · doi:10.1007/bf00202610 · Cited by 101
A discrete stochastic neural network algorithm for constraint satisfaction problems
Adorf, H. M., & Johnston, M. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137951 · Cited by 99
Effects of the chaotic noise on the performance of a neural network model for optimization problems
Hayakawa, Y., Marumoto, A., & Sawada, Y. (1995) · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics · doi:10.1103/physreve.51.r2693 · Cited by 97
A stochastic model of retinotopy: A self organizing process
Cottrell, M., & Fort, J. (1986) · Biological Cybernetics · doi:10.1007/bf00318206 · Cited by 96
Neural Networks for Optimization Problems with Inequality Constraints: The Knapsack Problem
Ohlsson, M., Peterson, C., & Söderberg, B. (1993) · Neural Computation · doi:10.1162/neco.1993.5.2.331 · Cited by 95
THE TRAVELING SALESMAN PROBLEM: A NEURAL NETWORK PERSPECTIVE
Potvin, J. (1993) · Cited by 92
Approximating maximum clique with a Hopfield network
Jagota, A. (1995) · IEEE Transactions on Neural Networks · doi:10.1109/72.377977 · Cited by 92
Watt, R., Maslana, E. S., Navabi, M. J., & Mylrea, K. C. (1992) · Anesthesiology · doi:10.1097/00000542-199209001-00506 · Cited by 91
Neural networks and operations research: An overview
Burke, L. I., & Ignizio, J. P. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90043-5 · Cited by 88
Performance and fault-tolerance of neural networks for optimization
Protzel, P., Palumbo, D., & Arras, M. K. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238315 · Cited by 82
Determination of parameters in a Hopfield/Tank computational network
Hedge, Sweet, & Levy (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23941 · Cited by 81
A neural network algorithm for the multiple traveling salesmen problem
Wacholder, E., Han, J., & Mann, R. C. (1989) · Biological Cybernetics · doi:10.1007/bf00204755 · Cited by 78
Zhang, L., & Thomopoulos, S. C. A. (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118375 · Cited by 72
Szu (1988) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/icnn.1988.23937 · Cited by 71
Sensitivity analysis in neural net solutions
Davis, G. W. (1989) · IEEE Transactions on Systems Man and Cybernetics · doi:10.1109/21.44023 · Cited by 70
Design of a neural-based A/D converter using modified Hopfield network
Lee, B. W., & Sheu, B. J. (1989) · IEEE Journal of Solid-State Circuits · doi:10.1109/4.34101 · Cited by 70
Location and stability of the high-gain equilibria of nonlinear neural networks
Vidyasagar, M. (1993) · IEEE Transactions on Neural Networks · doi:10.1109/72.238320 · Cited by 69
Neural versus traditional approaches to the location of interacting hub facilities
Smith‐Miles, K., Krishnamoorthy, M., & Palaniswami, M. S. (1996) · Location Science · doi:10.1016/s0966-8349(96)00017-4 · Cited by 66
The guilty net for the traveling salesman problem
Burke, L. I., & Damany, P. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90047-9 · Cited by 58
Effective neural algorithms for the traveling salesman problem
Xu, X.-S., & TSAI, W. T. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90004-o · Cited by 55
A hybrid approach to sequencing jobs using heuristic rules and neural networks
Kim, S. Y., LEE, Y.-H., & AGNIHOTRI, D. (1995) · Production Planning & Control · doi:10.1080/09537289508930302 · Cited by 53
Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem
Smith‐Miles, K., Palaniswami, M. S., & Krishnamoorthy, M. (1996) · European Journal of Operational Research · doi:10.1016/0377-2217(96)00040-9 · Cited by 47
An analog VLSI implementation of Hopfield's neural network
Verleysen, M., & Jespers, P. G. A. (1989) · IEEE Micro · doi:10.1109/40.42986 · Cited by 45
Problem solving with optimization networks
Gee, A. (1993) · Cited by 37
Thomopoulos, S. C. A., Zhang, L., & Wann, C.-D. D. (1991) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1991.170276 · Cited by 35
A stochastic neural network for resource constrained scheduling
Vaithyanathan, S., & Ignizio, J. P. (1992) · Computers & Operations Research · doi:10.1016/0305-0548(92)90046-8 · Cited by 35
Clustering for vehicle routing with a competitive neural network
Potvin, J., & Robillard, C. (1995) · Neurocomputing · doi:10.1016/0925-2312(94)00012-h · Cited by 32
Mapping combinatorial optimization problems onto neural networks
Ramanujam, J. (1995) · Information Sciences · doi:10.1016/0020-0255(94)00052-d · Cited by 30
Zissimopoulos, V., Paschos, V. T., & Pekergin, F. (1991) · IEEE Transactions on Computers · doi:10.1109/12.106226 · Cited by 29
LSI module placement methods using neural computation networks
Date, H., Seki, M., & Hayashi, T. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137673 · Cited by 16
Neural algorithms for cell placement in VLSI design
Caviglia, D. D., Bisio, Curatelli, Giovannacci, & Raffo, L. (1989) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1989.118635 · Cited by 16
Industrial Applications of Neural Networks: Project Annie Handbook
Croall, I. F., & Mason, J. (1992) · Springer eBooks · Cited by 11
Neural networks for optimization problems in graph theory
Lai, J.-S., Kuo, S., & Chen, I.-Y. (2002) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.1994.409578 · Cited by 10
Solving an Optimization Problem with a Chaos Neural Network
Inoue, M., & Nagayoshi, A. (1992) · Progress of Theoretical Physics · doi:10.1143/ptp/88.4.769 · Cited by 9
Stable solutions vs. multiplicative utility solutions for the assignment problem
Mehrez, A., Yuan, Y., & Gafni, A. (1988) · Operations Research Letters · doi:10.1016/0167-6377(88)90079-x · Cited by 8
Use of neural networks for the optimum frequency assignment problem
Kurokawa, T., & Kozuka, S. (1994) · Electronics and Communications in Japan (Part I Communications) · doi:10.1002/ecja.4410771110 · Cited by 8
Lee, H.-M., & Hsu, C. (2003) · IEEE International Conference on Tools with Artificial Intelligence (ICTAI) · doi:10.1109/tai.1989.65366 · Cited by 8
A Hopfield-Tank Neural Network Model for the Generalized Traveling Salesman Problem
Andresol, R., Michel Gendreau, A., & Potvin, J. (1999) · Springer eBooks · doi:10.1007/978-1-4615-5775-3_27 · Cited by 7
Circuit partitioning using parallel mean field annealing algorithms
Bultan, T., & Aykanat, C. (2002) · IEEE Symposium on Parallel and Distributed Processing (SPDP) · doi:10.1109/spdp.1991.218253 · Cited by 6
An O(1) approximate parallel algorithm for the n-task-n-person assignment problem
Cho, Y. B., Kurokawa, T., Takefuji, Y., & Kim, H. S. (2005) · IEEE International Conference on Neural Networks/IEEE ... International Conference on Neural Networks · doi:10.1109/ijcnn.1993.716830 · Cited by 5
Automatic translation of constraints for solving optimization problems by neural networks
Gaspin, C. (1990) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn.1990.137942 · Cited by 4
Cited by
Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles
Kain, T., Mundhenk, P., Müller, J.-S., Tompits, H., Wesche, M., & Decke, H. (2020) · OASIcs : OpenAccess Series in Informatics · doi:10.4230/oasics.asd.2020.1 · Cited by 797
A Comprehensive Review of Stability Analysis of Continuous-Time Recurrent Neural Networks
Zhang, H., Wang, Z., & Liu, D. (2014) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2014.2317880 · Cited by 654
Li, S., Chen, S., & Liu, B. (2013) · Neural Processing Letters · doi:10.1007/s11063-012-9241-1 · Cited by 381
Learning Improvement Heuristics for Solving Routing Problems
Wu, Y., Song, W., Cao, Z., Zhang, J., & Lim, A. (2022) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3068828 · Cited by 344
Portfolio selection using neural networks
Fernández, A., & Gómez, S. (2007) · Computers & Operations Research · doi:10.1016/j.cor.2005.06.017 · Cited by 310
Metadata
- Authors
- Smith, K. A.
- Venue
- INFORMS Journal on Computing
- Published
- 1999-02
- Volume
- 11
- Issue
- 1
- Pages
- 15-34
- ISSN
- 0899-1499 (ISSN-L)
- 1091-9856
- 1526-5528
- OpenAlex
- W2117666205
- Cited by
- 401
- References
- 116
- FWCI
- 8.14
- Type
- journal article
- Language
- en
- Open access
- closed
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.