An Effective Heuristic Algorithm for the Traveling-Salesman Problem
The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Abstract
This paper discusses a highly effective heuristic procedure for generating optimum and near-optimum solutions for the symmetric traveling-salesman problem. The procedure is based on a general approach to heuristics that is believed to have wide applicability in combinatorial optimization problems. The procedure produces optimum solutions for all problems tested, “classical” problems appearing in the literature, as well as randomly generated test problems, up to 110 cities. Run times grow approximately as n 2; in absolute terms, a typical 100-city problem requires less than 25 seconds for one case (GE635), and about three minutes to obtain the optimum with above 95 per cent confidence.
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
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
Self-citationComputer 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
Self-citationA 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 and Minimum Spanning Trees
Held, M., & Karp, R. M. (1970) · Operations Research · doi:10.1287/opre.18.6.1138 · Cited by 1,440
Solution of a Large-Scale Traveling-Salesman Problem
Chvátal, V., Cook, W. J., Dantzig, G. B., Fulkerson, D. R., & Johnson, S. M. (2009) · Springer eBooks · doi:10.1007/978-3-540-68279-0_1 · Cited by 1,263
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
Cited by
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
Ant system: optimization by a colony of cooperating agents
Dorigo, M., Maniezzo, V., & Colorni, A. (1996) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.484436 · Cited by 12,067
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
“Neural” computation of decisions in optimization problems
Hopfield, J. J., & Tank, D. W. (1985) · Biological Cybernetics · doi:10.1007/bf00339943 · Cited by 6,031
Mladenović, N., & Hansen, P. (1997) · Computers & Operations Research · doi:10.1016/s0305-0548(97)00031-2 · Cited by 4,254
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H.-P. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,790
Hoos (2000) · doi:10.1016/s0167-739x(00)00043-1 · Cited by 2,737
Ant colonies for the travelling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · Biosystems · doi:10.1016/s0303-2647(97)01708-5 · Cited by 2,023
Meng, L., Li, H., Zhang, L., & Wang, J. (2015) · The Crop Journal · doi:10.1016/j.cj.2015.01.001 · Cited by 1,903
Variable neighborhood search: Principles and applications
Hansen, P., & Mladenović, N. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00100-4 · Cited by 1,902
Optimization by simulated annealing: Quantitative studies
Kirkpatrick, S. (1984) · Journal of Statistical Physics · doi:10.1007/bf01009452 · Cited by 1,805
An effective implementation of the Lin–Kernighan traveling salesman heuristic
Helsgaun, K. (2000) · European Journal of Operational Research · doi:10.1016/s0377-2217(99)00284-2 · Cited by 1,630
The Traveling Salesman Problem and Its Variations
(2007) · Combinatorial Optimization · doi:10.1007/b101971 · Cited by 1,392
Towards a general theory of adaptive walks on rugged landscapes
Kauffman, S., & Levin, S. (1987) · Journal of Theoretical Biology · doi:10.1016/s0022-5193(87)80029-2 · Cited by 1,386
Dueck, G., & Scheuer, T. (1990) · Journal of Computational Physics · doi:10.1016/0021-9991(90)90201-b · Cited by 1,232
Lourenço, H. R., Martin, O. C., & Stützle, T. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_11 · Cited by 1,164
The multiple traveling salesman problem: an overview of formulations and solution procedures
Bektas, T. (2006) · Omega · doi:10.1016/j.omega.2004.10.004 · Cited by 1,153
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Arora, S. (1998) · Journal of the ACM · doi:10.1145/290179.290180 · Cited by 1,137
Vehicle Routing Problem with Time Windows, Part I: Route Construction and Local Search Algorithms
Bräysy, O., & Gendreau, M. (2005) · Transportation Science · doi:10.1287/trsc.1030.0056 · Cited by 1,135
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
Padberg, M., & Rinaldi, G. (1991) · SIAM Review · doi:10.1137/1033004 · Cited by 1,097
A generalized assignment heuristic for vehicle routing
Fisher, M. L., & Jaikumar, R. (1981) · Networks · doi:10.1002/net.3230110205 · Cited by 1,076
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Osman, I. H. (1993) · Annals of Operations Research · doi:10.1007/bf02023004 · Cited by 1,046
Eshelman, L. J. (1991) · Foundations of Genetic Algorithms · doi:10.1016/b978-0-08-050684-5.50020-3 · Cited by 1,040
Model-Driven Data Acquisition in Sensor Networks
Deshpande, A., Guestrin, C., Madden, S. R., Hellerstein, J. M., & Hong, W. (2004) · Proceedings 2004 VLDB Conference · doi:10.1016/b978-012088469-8.50053-x · Cited by 1,036
The traveling salesman problem: An overview of exact and approximate algorithms
Laporte, G. (1992) · European Journal of Operational Research · doi:10.1016/0377-2217(92)90138-y · Cited by 971
DeSarbo, W. S., Anthony Di Benedetto, C., Song, M., & Sinha, I. (2005) · Strategic Management Journal · doi:10.1002/smj.431 · Cited by 912
Glover, F., Taillard, E., & Taillard, E. (1993) · Annals of Operations Research · doi:10.1007/bf02078647 · Cited by 902
Routing and scheduling of vehicles and crews
Raff, S. (1983) · Computers & Operations Research · doi:10.1016/0305-0548(83)90030-8 · Cited by 867
Automated learning of decision rules for text categorization
Apté, C., Damerau, F., & Weiss, S. M. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183423 · Cited by 859
Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators
Larrañaga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., & Dizdarevic, S. (1999) · Artificial Intelligence Review · doi:10.1023/a:1006529012972 · Cited by 849
Johnson, D. S., Aragon, C. R., McGeoch, L. A., & Schevon, C. (1991) · Operations Research · doi:10.1287/opre.39.3.378 · Cited by 845
An Analysis of Several Heuristics for the Traveling Salesman Problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, II (1977) · SIAM Journal on Computing · doi:10.1137/0206041 · Cited by 837
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
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
The Euclidean travelling salesman problem is NP-complete
Papadimitriou, C. H. (1977) · Theoretical Computer Science · doi:10.1016/0304-3975(77)90012-3 · Cited by 776
An analysis of several heuristics for the traveling salesman problem
Rosenkrantz, D. J., Stearns, R. E., & Lewis, P. M. (2009) · Fundamental Problems in Computing · doi:10.1007/978-1-4020-9688-4_3 · Cited by 772
Classical and modern heuristics for the vehicle routing problem
Laporte, G. (2000) · International Transactions in Operational Research · doi:10.1016/s0969-6016(00)00003-4 · Cited by 759
Reinforcement learning for combinatorial optimization: A survey
Mazyavkina, N., Sviridov, S., Ivanov, S., & Burnaev, E. (2021) · Computers & Operations Research · doi:10.1016/j.cor.2021.105400 · Cited by 723
Ant colony optimization techniques for the vehicle routing problem
Bell, J. E., & McMullen, P. R. (2004) · Advanced Engineering Informatics · doi:10.1016/j.aei.2004.07.001 · Cited by 712
Johnson, D. S., Papadimitriou, C. H., & Yannakakis, M. (1988) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(88)90046-3 · Cited by 705
Ant colonies for the quadratic assignment problem
Gambardella, L. M., Taillard, É. D., & Dorigo, M. (1999) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2600676 · Cited by 704
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
A survey of very large-scale neighborhood search techniques
Ahuja, R. K., Ergun, Ö., Orlin, J. B., & Punnen, A. P. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00338-9 · Cited by 643
Origins of Order in Evolution: Self-Organization and Selection
Kauffman, S. A. (1992) · Understanding Origins · doi:10.1007/978-94-015-8054-0_8 · Cited by 642
Some simplified NP-complete problems
Garey, M. R., Johnson, D. S., & Stockmeyer, L. (1974) · Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74 · doi:10.1145/800119.803884 · Cited by 614
Iterated Local Search: Framework and Applications
Lourenço, H. R., Martin, O. C., & Stützle, T. (2010) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4419-1665-5_12 · Cited by 571
An improved Ant System algorithm for theVehicle Routing Problem
Bullnheimer, B., Hartl, R. F., & Strauss, C. (1999) · Annals of Operations Research · doi:10.1023/a:1018940026670 · Cited by 548
Christofides, N., Mingozzi, A., & Toth, P. (1981) · Mathematical Programming · doi:10.1007/bf01589353 · Cited by 535
A Gentle Introduction to Memetic Algorithms
Moscato, P., & Cotta, C. (2006) · International Series in Operations Research & Management Science · doi:10.1007/0-306-48056-5_5 · Cited by 457
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
Arora, S. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548458 · Cited by 449
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
Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
Karp, R. M. (1977) · Mathematics of Operations Research · doi:10.1287/moor.2.3.209 · Cited by 439
Automated Algorithm Selection: Survey and Perspectives
Kerschke, P., Hoos, H. H., Neumann, F., & Trautmann, H. (2019) · Evolutionary Computation · doi:10.1162/evco_a_00242 · Cited by 435
Heuristics for multi-attribute vehicle routing problems: A survey and synthesis
Vidal, T., Crainic, T. G., Gendreau, M., & Prins, C. (2013) · European Journal of Operational Research · doi:10.1016/j.ejor.2013.02.053 · Cited by 430
Coalitions among computationally bounded agents
Sandhlom, T. W., & Lesser, V. R. T. (1997) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00030-1 · Cited by 428
Deep Reinforcement Learning for Multiobjective Optimization
Li, K., Zhang, T., & Wang, R. (2021) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2020.2977661 · Cited by 424
Complex adaptive systems: Exploring the known, the unknown and the unknowable
Levin, S. (2002) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-02-00965-5 · Cited by 423
A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems
Chen, W.-N., Zhang, J., Chung, H. S. H., Zhong, W.-L., Wu, W.-G., & Shi, Y.-H. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2030331 · Cited by 423
General k-opt submoves for the Lin–Kernighan TSP heuristic
Helsgaun, K. (2009) · Mathematical Programming Computation · doi:10.1007/s12532-009-0004-6 · Cited by 414
Record Breaking Optimization Results Using the Ruin and Recreate Principle
Schrimpf, G., Schneider, J., Stamm-Wilbrandt, H., & Dueck, G. (2000) · Journal of Computational Physics · doi:10.1006/jcph.1999.6413 · Cited by 413
Guided local search and its application to the traveling salesman problem
Voudouris, C., & Tsang, E. (1999) · European Journal of Operational Research · doi:10.1016/s0377-2217(98)00099-x · Cited by 409
Maniezzo, V., Gambardella, L. M., & de Luigi, F. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_5 · Cited by 403
Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
Smith, K. A. (1999) · INFORMS Journal on Computing · doi:10.1287/ijoc.11.1.15 · Cited by 401
Some NP-complete geometric problems
Garey, M. R., Graham, R. L., & Johnson, D. S. (1976) · Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 · doi:10.1145/800113.803626 · Cited by 400
Pisinger, D., & Ropke, S. (2019) · International Series in Operations Research & Management Science · doi:10.1007/978-3-319-91086-4_4 · Cited by 395
Algorithm runtime prediction: Methods & evaluation
Hutter, F., Xu, L., Hoos, H. H., & Leyton-Brown, K. (2014) · Artificial Intelligence · doi:10.1016/j.artint.2013.10.003 · Cited by 395
CARHTA GENE: multipopulation integrated genetic and radiation hybrid mapping
de Givry, S., Bouchez, M., Chabrier, P., Milan, D., & Schiex, T. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti222 · Cited by 394
Getting Things in Order: An Introduction to the R Package seriation
Hahsler, M., Hornik, K., & Buchta, C. (2008) · Journal of Statistical Software · doi:10.18637/jss.v025.i03 · Cited by 385
Chapter 2 Time constrained routing and scheduling
Desrosiers, J., Dumas, Y., Solomon, M. M., & Soumis, F. (1995) · Handbooks in Operations Research and Management Science · doi:10.1016/s0927-0507(05)80106-9 · Cited by 374
An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem
Gambardella, L. M., & Dorigo, M. (2000) · INFORMS Journal on Computing · doi:10.1287/ijoc.12.3.237.12636 · Cited by 373
Local search in combinatorial optimization
Crama, Y., Kolen, A. W. J., & Pesch, E. J. (1995) · Lecture Notes in Computer Science · doi:10.1007/bfb0027029 · Cited by 361
An Introduction to Variable Neighborhood Search
Hansen, P., & Mladenović, N. (1999) · Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization · doi:10.1007/978-1-4615-5775-3_30 · Cited by 340
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
Classification in vehicle routing and scheduling
Bodin, L., & Golden, B. (1981) · Networks · doi:10.1002/net.3230110204 · Cited by 333
Experimental Evaluation of Heuristic Optimization Algorithms: A Tutorial
Rardin, R. L., & Uzsoy, R. (2001) · Journal of Heuristics · doi:10.1023/a:1011319115230 · Cited by 332
Learning Heuristics for the TSP by Policy Gradient
Deudon, M., Cournut, P., Lacoste, A., Adulyasak, Y., & Rousseau, L.-M. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-93031-2_12 · Cited by 303
Planning Paths for Package Delivery in Heterogeneous Multirobot Teams
Mathew, N., Smith, S. L., & Waslander, S. L. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2015.2461213 · Cited by 301
Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches
Matai, R., Singh, S., & Lal, M. (2010) · Traveling Salesman Problem, Theory and Applications · doi:10.5772/12909 · Cited by 299
PSO-based algorithm for home care worker scheduling in the UK
Akjiratikarl, C., Yenradee, P., & Drake, P. R. (2007) · Computers & Industrial Engineering · doi:10.1016/j.cie.2007.06.002 · Cited by 296
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Crowder, H., & Padberg, M. W. (1980) · Management Science · doi:10.1287/mnsc.26.5.495 · Cited by 294
Simple Local Search Problems that are Hard to Solve
Schäffer, A. A. (1991) · SIAM Journal on Computing · doi:10.1137/0220004 · Cited by 291
Minimum energy and fractal structures of drainage networks
Rinaldo, A., Rodriguez‐Iturbe, I., Rigon, R., Bras, R. L., Ijjasz‐Vasquez, E., & Marani, A. (1992) · Water Resources Research · doi:10.1029/92wr00801 · Cited by 290
Heuristics from nature for hard combinatorial optimization problems
Colorni, A. (1996) · International Transactions in Operational Research · doi:10.1016/0969-6016(96)00004-4 · Cited by 288
A simulated annealing heuristic for the capacitated location routing problem
Yu, V. F., Lin, S.-W., Lee, W., & Ting, C.-J. (2010) · Computers & Industrial Engineering · doi:10.1016/j.cie.2009.10.007 · Cited by 287
Self-citationA matheuristic for the vehicle routing problem with drones and its variants
Schermer, D., Moeini, M., & Wendt, O. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.06.016 · Cited by 278
A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems
Freisleben, B., & Merz, P. (2002) · Proceedings of IEEE International Conference on Evolutionary Computation · doi:10.1109/icec.1996.542671 · Cited by 277
Scheduling and rescheduling with iterative repair
Zweben, M., Davis, E., Daun, B., & Deale, M. J. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.257756 · Cited by 275
Capacitated clustering problems by hybrid simulated annealing and tabu search
Osman, I. (1994) · International Transactions in Operational Research · doi:10.1016/0969-6016(94)90032-9 · Cited by 274
Some Simple Applications of the Travelling Salesman Problem
Lenstra, J. K., & Kan, A. H. G. R. (1975) · Journal of the Operational Research Society · doi:10.1057/jors.1975.151 · Cited by 270
A fundamental problem in vehicle routing
Orloff, C. S. (1974) · Networks · doi:10.1002/net.3230040105 · Cited by 266
Schermer, D., Moeini, M., & Wendt, O. (2019) · Computers & Operations Research · doi:10.1016/j.cor.2019.04.021 · Cited by 264
Traveling Salesperson Problems for the Dubins Vehicle
Savla, K., Frazzoli, E., & Bullo, F. (2008) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2008.925814 · Cited by 259
Landscapes and their correlation functions
Stadler, P. F. (1996) · Journal of Mathematical Chemistry · doi:10.1007/bf01165154 · Cited by 258
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
Fisher, M. L., & Kedia, P. (1990) · Management Science · doi:10.1287/mnsc.36.6.674 · Cited by 253
On the worst‐case performance of some algorithms for the asymmetric traveling salesman problem
Frieze, A. M., Galbiati, G., & Maffioli, F. (1982) · Networks · doi:10.1002/net.3230120103 · Cited by 252
Applying the genetic approach to simulated annealing in solving some NP-hard problems
Lin, F.-T., Kao, C.-Y., & Hsu, C.-C. (1993) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.257766 · Cited by 252
Design and control of warehouse order picking: A literature review
de Koster, R., Le-Duc, T., & Roodbergen, K. J. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.07.009 · Cited by 114
Holland, C., Levis, J., Nuggehalli, R., Santilli, B., & Winters, J. (2017) · Interfaces · doi:10.1287/inte.2016.0875 · Cited by 95
Hutter, M., & Legg, S. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.863127 · Cited by 63
Metadata
- Authors
- Lin, S., & Kernighan, B. W.
- Venue
- Operations Research
- Published
- 1973-04
- Volume
- 21
- Issue
- 2
- Pages
- 498-516
- ISSN
- 0030-364X (ISSN-L)
- 1526-5463
- OpenAlex
- W2042986967
- Cited by
- 3,821
- References
- 6
- FWCI
- 77.00
- 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.