An Analysis of Several Heuristics for the Traveling Salesman Problem
The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Abstract
Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the obtained tour length to the minimal tour length. For the nearest neighbor method, we show the ratio is bounded above by a logarithmic function of the number of nodes. We also provide a logarithmic lower bound on the worst case. A class of approximation methods we call insertion methods are studied, and these are also shown to have a logarithmic upper bound. For two specific insertion methods, which we call nearest insertion and cheapest insertion, the ratio is shown to have a constant upper bound of 2, and examples are provided that come arbitrarily close to this upper bound. It is also shown that for any $n\geqq 8$, there are traveling salesman problems with n nodes having tours which cannot be improved by making $n/4$ edge changes, but for which the ratio is $2(1-1/n)$.
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
“While pioneering approaches for in situ sequencing154,155, transcriptome in vivo analysis156, and multiplex FISH157–159 of single-cell RNA are emerging (see also a recent review160), their throughput and accessibility to the research community have not yet matched those of more established protocols.”
From Revealing the vectors of cellular identity with single-cell genomics (2016) · cites this paper as [154]
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
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
Shortest Connection Networks And Some Generalizations
Prim, R. C. (1957) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1957.tb01515.x · Cited by 4,565
Floyd, R. W. (1962) · Communications of the ACM · doi:10.1145/367766.368168 · Cited by 3,998
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
Computer Solutions of the Traveling Salesman Problem
Lin, S. (1965) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1965.tb04146.x · Cited by 1,986
A Method for Solving Traveling-Salesman Problems
Croes, G. A. (1958) · Operations Research · doi:10.1287/opre.6.6.791 · Cited by 1,570
The Traveling Salesman Problem: A Survey
Bellmore, M., & Nemhauser, G. L. (1968) · Operations Research · doi:10.1287/opre.16.3.538 · Cited by 411
A Heuristic Approach to Solving Travelling Salesman Problems
Karg, R. L., & Thompson, G. L. (1964) · Management Science · doi:10.1287/mnsc.10.2.225 · Cited by 210
Reiter, S., & Sherman, G. (1965) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0113056 · Cited by 112
Research works printed but not linked: 1
- Sartaj Sahni, Teofilo Gonzales, P -complete problems and approximate solutions, 15th Annual Symposium on Switching and Automata Theory (Univ. New Orleans, New Orleans, La., 1974), IEEE Comput. Soc., Long Beach, Calif., 1974, 28–32 MR0416113 (54:4189) · doi:10.1109/swat.1974.22
Cited by
Items 801–900 of 1,000
A Real Time Scheduling Scheme For Food Delivery
Ding, X., Liu, H., & Chen, X. (2021) · IEEE International Conference on Emergency Science and Information Technology (ICESIT) · doi:10.1109/icesit53460.2021.9696540 · Cited by 1
MICA: A Mobile Support System for Warehouse Workers
Prause, C. R., Jentsch, M., & Eisenhauer, M. (2012) · IGI Global eBooks · doi:10.4018/978-1-4666-2785-7.ch009 · Cited by 1
Approximation mit relativer Gütegarantie
(2007) · Teubner eBooks · doi:10.1007/978-3-8351-9067-2_3 · Cited by 1
MICA: A Mobile Support System for Warehouse Workers
Prause, C. R., Jentsch, M., & Eisenhauer, M. (2011) · IGI Global eBooks · doi:10.4018/978-1-60960-587-2.ch301 · Cited by 1
Das Traveling-Salesman-Problem
Körte, B., & Vygen, J. (2018) · Springer eBooks · doi:10.1007/978-3-662-57691-5_21 · Cited by 1
Determining the Optimal Parcel Delivery Method Using One Drone and One Truck
Satoh, K., & Morita, H. (2022) · International Journal of Mathematics in Operational Research · doi:10.1504/ijmor.2023.130109 · Cited by 1
On the Nearest-Neighbor Algorithm for the Mean-Field Traveling Salesman Problem
Bandyopadhyay, A., & Sajadi, F. A. (2014) · Journal of Applied Probability · doi:10.1017/s0021900200010111 · Cited by 1
Approximations for the Steiner Multicycle Problem
Fernandes, C. G., Lintzmayer, C. N., & Moura, P. F. S. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-20624-5_12 · Cited by 1
Introduction to Stochastic Optimisation
Jalili, S. (2022) · Engineering optimization · doi:10.1007/978-981-19-4633-2_1 · Cited by 1
Aldous, D. (2023) · College Mathematics Journal · doi:10.1080/07468342.2023.2201150 · Cited by 1
A Hybrid NSGA-II Approach to Solve a Bi-Objective Multi-Period Assembly Inventory Routing Problem
Prakash, S., & Mukherjee, I. (2023) · International Conference on Industrial Engineering and Operations Management (IEOM) · doi:10.46254/na8.20230111 · Cited by 1
Farthest-First Traversal for Identifying Multiple Influential Spreaders
Ramrakhiyani, M., Tiwari, M., & Sunitha, V. (2024) · Studies in computational intelligence · doi:10.1007/978-3-031-53499-7_39 · Cited by 1
A 1.5-Approximation for Symmetric Euclidean Open Loop TSP
Chauhan, A. (2024) · IEEE Access · doi:10.1109/access.2024.3472282 · Cited by 1
Formulation of Kerosene Routing Problem and a Rolling-Horizon Approach Based Heuristic
Ooe, H., Yokoyama, S., Yamashita, T., Kawamura, H., & Tada, M. (2024) · Transactions of the Japanese Society for Artificial Intelligence · doi:10.1527/tjsai.39-6_ag24-b · Cited by 1
Traveling Salesman Problem: A Comprehensive Review and Computational Implementation in Python
Bhattarai, S. (2024) · Scientific Researches in Academia · doi:10.3126/sra.v2i2.74286 · Cited by 1
Nugroho, D. S., & Ilham, A. (2025) · Jurnal Komputer dan Teknologi Informasi · doi:10.26714/jkti.v3i1.16196 · Cited by 1
Malware Containment via Firewall Placement in Large Scale Wireless IoT Networks
Mesbah, W. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3627851 · Cited by 1
Single Vehicle Round-trip Routing
Goetschalckx, M. (2011) · International series in management science/operations research/International series in operations research & management science · doi:10.1007/978-1-4419-6512-7_8 · Cited by 1
LP-based heuristics for the Traveling Salesman Problem
Fortini, M. (2007) · AMS Dottorato Institutional Doctoral Theses Repository (University of Bologna) · doi:10.6092/unibo/amsdottorato/339 · Cited by 1
Greedy Permutations and Finite Voronoi Diagrams (Media Exposition)
Chubet, O., MacNichol, P., Parikh, P., Sheehy, D. R., & Sheth, S. (2023) · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · doi:10.4230/lipics.socg.2023.64 · Cited by 1
Improvement of a Distribution System Using a Heuristic Method: A Case Study
Thumronglaohapun, S., & Suwandechochai, R. (2019) · Thailand Statistician Thailand · Cited by 1
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
Kubo, N., Muramoto, K., & Shimozono, S. (2000) · Lecture notes in computer science · doi:10.1007/3-540-40996-3_19 · Cited by 1
Johnston, M. R. (1999) · Massey Research Online (Massey University) · Cited by 1
Nearest Neighbor Network TraversalPreprint
Pritchard, D. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0702114 · Cited by 1
The bi-weighted TSP problem for VLSI crosstalk minimization
Wong, M. D. F., & Shao, M. (2003) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas.2002.1010337 · Cited by 1
Genetic computing for the film copy deliverer problem
Zhang, L., & Zheng, W. (2002) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1995.537911 · Cited by 1
Scheduling Memory Transactions in Distributed Systems
Kim, J. (2013) · VTechWorks (Virginia Tech) · Cited by 1
Routing multicast connections with optimal network cost in ATM networks
Jia, X., Lee, C. H., Ng, J. M., & Chan, E. (2002) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn.1995.540103 · Cited by 1
On polynomial-approximated solutions to the film copy deliverer problem
Zhang, L., & Zheng, W. (2002) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.1996.565340 · Cited by 1
Distributed Task Allocation and Task Sequencing for Robots with Motion Constraints
Sadeghi, A. (2016) · UWSpace (University of Waterloo) · Cited by 1
Optimization and Approximation
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0009 · Cited by 1
Sauerland, V. (2012) · Helmholtz Centre for Ocean Research Kiel (GEOMAR) · Cited by 1
Interactive computer methods for plant layout scheduling and group technology
Nakornchai, V. (1982) · Spiral (Imperial College London) · Cited by 1
An Empirical Analysis of Approximation Algorithms for the Euclidean Traveling Salesman ProblemPreprint
He, Y., & Xiang, M. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1705.09058 · Cited by 1
(2008) · Wiley series in probability and statistics · doi:10.1002/9780470317013.refs · Cited by 1
Das Traveling-Salesman-Problem
(2008) · Springer eBooks · doi:10.1007/978-3-540-76919-4_21 · Cited by 1
Automatic layout procedures for serial routing devices
Ogawa, Y., Terai, H., & Kozawa, T. (2003) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1988.14833 · Cited by 1
Multispace Search for Combinatorial Optimization
Gu, J. (1998) · Springer eBooks · doi:10.1007/978-1-4613-0303-9_30 · Cited by 1
Coordinate Package Delivery and On-Demand Rides: A Zoning Policy and AnalysisPreprint
Cao, J., & Liu, S. (2023) · SSRN Electronic Journal · doi:10.2139/ssrn.4565248 · Cited by 1
Grötschel, M., & Lovász, L. (1993) · Cited by 1
The Marco Polo Problem: A Combinatorial Approach to Geometric LocalizationPreprint
Gila, O., Goodrich, M. T., Hadizadeh, Z., Hirschberg, D. S., & Taherijam, S. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2504.17955 · Cited by 1
Sequence Variables: A Constraint Programming Computational Domain for Routing and SequencingPreprint
Delecluse, A., Schaus, P., & Hentenryck, P. V. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2510.09373 · Cited by 1
Exact and Heuristic Approaches to Arc Routing Problems
Dang, T. (2022) · Lancaster EPrints (Lancaster University) · doi:10.17635/lancaster/thesis/1709 · Cited by 1
Integration of data reduction methods for an AutoML system for clustering analyses
Scheich, M. (2024) · OPUS Publication Server of the University of Stuttgart (University of Stuttgart) · doi:10.18419/opus-14841 · Cited by 1
Balancing bike sharing systems : a hybrid metaheuristic approach for the dynamic case
Pinter, A. (2013) · reposiTUm (TU Wien) · doi:10.34726/hss.2013.23274 · Cited by 1
Χαρτογράφηση διαδρομών μιας πόλης με χρήση του OpenStreetMap και σχεδιασμός βέλτιστων διελεύσεων
Γιαννίκογλου, Κ. Β., & Γιαννίκογλου, Κ. Β. (2024) · University of Thessaly Institutional Repository (University of Thessaly) · Cited by 1
Simulation ausgewählter Heuristiken zur Tourenplanung in manuellen Kommissionierstationen
Werth, F., & Ullrich, O. (2011) · Kölner Universitäts PublikationsServer (Universität zu Köln) · Cited by 1
Time-Optimal Trajectory Planning for Vehicles with Minimum Turning Radius and Variable Velocity
Kučerová, K., & Kučerová, K. (2020) · Cvut DSpace (Czech Technical University) · Cited by 1
Optimización de transportes de reparables en el sector aeronáutico
Blanch Rodríguez, A. (2023) · idUS (Universidad de Sevilla) · Cited by 1
Nussbaumer, M. (2008) · Unipub UB Graz (Universität Graz) · Cited by 1
Optimização de circuitos de recolha de lixos domésticos em zonas urbanas
Oliveira, M. J. D. S. (2008) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT) · doi:10.34626/y2pv-5b35 · Cited by 1
COL-Trees: Efficient Hierarchical Object Search in Spatial NetworksPreprint
Abeywickrama, T., Cheema, M. A., & Storandt, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2601.22183 · Cited by 1
Ohigashi, H., & Hamada, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.25241 · Cited by 1
Opportunistic multi-content dissemination : Passive monitoring and adaptation to network conditions
Sammarco, M. (2014) · theses.fr (ABES) · doi:10.70675/e19835e0z1af4z4474zbe1dz5b88eeb44862 · Cited by 1
Automatic and Adaptive Learning for Relational Data Stream Clustering
Rastin, P. (2018) · theses.fr (ABES) · doi:10.70675/9a2924bdzca98z4126zb729z66fce8bb4d19 · Cited by 1
Approximation methods to vehicle routing problem for a drone fleet management
Sukarno, S. A. (2019) · theses.fr (ABES) · doi:10.70675/7a049146zb15dz4121z9923z649a9b8c339f · Cited by 1
Models and Algorithms for Route Planning of Freight Buses
Chang, Z. (2019) · theses.fr (ABES) · doi:10.70675/8ff69007zb13dz4003z804dzad8f3401cb44 · Cited by 1
Lafabrègue, B. (2021) · theses.fr (ABES) · doi:10.70675/dbc08bbaz7167z4e7azb6ddzb4fac488b0e1 · Cited by 1
Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problemsPreprint
Finet, Y., Bérubé-Lauzière, Y., & Drouin-Touchette, V. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2606.30415 · Cited by 1
A lower bound of 4 for online graph explorationPreprint
Baligács, J. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2607.15113 · Cited by 1
Fast generation of spectrally-shaped disorder, on the spherePreprint
Casiulis, M., & Martiniani, S. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2608.24867 · Cited by 1
A $(1+1/\sqrt{2})$-Approximation for the Multiple-Depot Traveling Salesman ProblemPreprint
Zhao, J., Liu, Y., & Xiao, M. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.19537 · Cited by 1
Το πρόβλημα του προσανατολισμού με χρονικά παράθυρα: πειραματική διερεύνηση ευρετικής μεθόδου
Παπαχρήστου, Χ. (2005) · Institutional Repository Hellanicus · Cited by 1
Caractérisation des instances difficiles de problèmes d'optimisation NP-difficiles
Weber, V. (2013) · theses.fr (ABES) · doi:10.70675/4d3102e2z800ez4f25z8c02zbba9045a91a9 · Cited by 1
O problema de minimização de pilhas abertas - novas contribuições
Fink, C. (2012) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/t.55.2012.tde-19022013-084858
A novel and efficient ant-based algorithm for solving traveling salesman problem
Tsai, C.-F., Tsai, C.-W., & Tseng, C. (2005) · Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics · doi:10.1109/icsmc.2002.1173431
Integer Programming Models of Bookmobile Routing
Foulds, L. R., Wallace, S. W., Wilson, J., & West, M. (2008) · Birkhäuser Basel eBooks · doi:10.1007/978-3-7643-8591-0_18
Optimisation de la planification des cueillettes d'huiles usagées
Colin, R. (2011) · Espace ÉTS (ETS)
Eulerian and Hamiltonian Graphs
(1992) · Wiley eBooks · doi:10.1002/9781118033104.ch3
Joly, T. (2011) · Archipel (Université du Québec à Montréal)
de Mesquita, A. C. P. (2010) · Digital Library of Theses and Dissertations (Universidade de São Paulo) · doi:10.11606/d.3.2010.tde-17082010-105538
Local search algorithms for some combinatorial optimisation problems
Samaniego, J. M. (1987) · Research Online (University of Wollongong)
Approximation of Multi‐criteria Min and Max TSP (1, 2)
Angel, É., Bampis, E., Gourvès, L., & Monnot, J. (2008) · Wiley eBooks · doi:10.1002/9780470611098.ch2
Pruning by upperbounds in heuristic search: Use of approximate algorithms
Sarkar, U., Chakrabarti, P., Ghose, S., & DeSarkar, S. C. (2005) · Springer eBooks · doi:10.1007/bfb0018402
Optimal Exploration Systems. Optimal Exploration Systems.
Klesh, A. (2009) · Deep Blue (University of Michigan)
Effective Heuristics for Route Construction of Mobile Data Collectors
Hanoun, S., & Nahavandi, S. (2009) · InTech eBooks · doi:10.5772/6996
de Mesquita, A. C. P., & da Cunha, C. B. (2011) · Transportes · doi:10.14295/transportes.v19i1.212
Das Traveling-Salesman-Problem
Körte, B., & Vygen, J. (2012) · Springer eBooks · doi:10.1007/978-3-642-25401-7_21
Rozwiazywanie NP-trudnych problemow przy uzyciu heurystyk opartych na zbiorach rozmytych
Verdegay, J. L., & Moreno, E. V. (2003) · Prace Naukowe Uniwersytetu Ekonomicznego we Wrocławiu
Algoritmo transgenético aplicado ao problema do caixeiro comprador capacitado simétrico
Goldbarg, M. C., Bagi, L. B., & Goldbarg, E. F. G. (2008) · Pesquisa Operacional · doi:10.1590/s0101-74382008000100006
A Hybrid Algorithm for the Multi-Objective Time Dependent Vehicle Routing Problem
Sun, Y., Chen, Y., Pan, C. C., & Yang, G. K. (2014) · Applied Mechanics and Materials · doi:10.4028/www.scientific.net/amm.505-506.1071
A simula program to automate wire‐wrap schedule generation
Lester, L., & Thelander, H. A. (1985) · Software Practice and Experience · doi:10.1002/spe.4380150304
Brief note a routing problem for a plant nursery
Sklar, M. G., Armstrong, R. D., & Davis, K. R. (1984) · Mathematical Modelling · doi:10.1016/0270-0255(84)90037-x
Circular insertion method for traveling salesman problem
Liu, S. T., & Shue, L. Y. (1981) · Journal of the Chinese Institute of Engineers · doi:10.1080/02533839.1981.9676674
Bond yield modelling and its application in the European Union
Zhang, D. (2013) · UEA Digital Repository (University of East Anglia)
Simchi‐Levi, D., Chen, X., & Bramel, J. (2013) · Springer series in operations research/Springer series in operations research and financial engineering · doi:10.1007/978-1-4614-9149-1_4
Analysis of the gradient solution of the travelling salesman problem
Ковалев, М. М., & Котов, В. М. (1981) · USSR Computational Mathematics and Mathematical Physics · doi:10.1016/0041-5553(81)90049-5
Il problema del commesso viaggiatore
Körte, B., & Vygen, J. (2011) · Unitext · doi:10.1007/978-88-470-1523-4_21
On the Energy Consumption of Fast Convergecast in Wireless Networks
Cälinescu, G. (2009) · International Conference on Sensor Technologies and Applications · doi:10.1109/sensorcomm.2009.113
A Semi Definite Programming Based Optimization Algorithm for Project Scheduling Problem
Bakshi, T., Sinharay, A., Sarkar, B., & Sanyal, S. K. (2014) · Journal of The Institution of Engineers (India) Series C · doi:10.1007/s40032-014-0163-8
Pickup and Delivery Traveling Salesman Problem with Traffic Conditions
Patvichaichod, S., & Visuwan, P. (2008) · Agriculture and Natural Resources
Jungnickel, D. (2012) · Algorithms and computation in mathematics · doi:10.1007/978-3-642-32278-5_15
A class of greedy algorithms for solving the travelling salesman problem /
Almulla, M. A. (1990) · doi:10.82308/15206
On the Approximability of Range Assignment Problems
Fuchs, B. (2007) · Kölner Universitäts PublikationsServer (Universität zu Köln)
Algoritmos para o problema do caixeiro viajante multiobjectivo
Paquete, L. (2005) · Portuguese National Funding Agency for Science, Research and Technology (RCAAP Project by FCT)
Near-Optimal Deterministic Steiner Tree Maintenance in Sensor Networks
Sharma, G., & Busch, C. (2016) · ACM Transactions on Sensor Networks · doi:10.1145/2854155
Tsp Solving by Hybridization of GA and AS
Joudaki, M., Imani, M., & Mazhari, N. (2012) · International Journal of Computer and Electrical Engineering · doi:10.7763/ijcee.2012.v4.637
Strongly Connected Spanning Subgraph for Almost Symmetric Networks
Abu-Affash, A. K., Carmi, P., & Tzur, A. P. (2017) · International Journal of Computational Geometry & Applications · doi:10.1142/s0218195917500042
Needles in a Haystack: the Class NP
Moore, C., & Mertens, S. (2011) · Oxford University Press eBooks · doi:10.1093/acprof:oso/9780199233212.003.0004
Metadata
- Authors
- Rosenkrantz, D. J., Stearns, R. E., & Lewis, II
- Affiliations
- General Electric (United States) (US)
- Venue
- SIAM Journal on Computing
- Published
- 1977-09
- Volume
- 6
- Issue
- 3
- Pages
- 563-581
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2956015669
- Cited by
- 837
- References
- 14
- Citations by year
- 2026: 39 · 2025: 40 · 2024: 46 · 2023: 42 · 2022: 33 · 2021: 45 · 2020: 34 · 2019: 36 · 2018: 32 · 2017: 31 · 2016: 25 · 2015: 25 · 2014: 32 · 2013: 29 · 2012: 23
- FWCI
- 2.91
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- SIAM Journal on Computing (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Physical Sciences › Computer Science › Computer Graphics and Computer-Aided Design › Computational Geometry and Mesh Generation
- Keywords
- traveling salesman problem, approximation algorithms, polynomial-time heuristic, nearest neighbor algorithm, insertion method, logarithmic approximation ratio, worst-case analysis
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.