Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-06T17:04:38.542320Z
Paper Citation Record · LEDGER
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
As of 7 August 2026, this Paper Citation Record lists 37 of 37 outbound references and 0 inbound Pith citation observations for arXiv:2507.12304.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-07T06:34:17.273281+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
37 of 37 outbound references displayed
- verified exact1
- verified fuzzy27
- unresolved9
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation ac7688f1-09a6-4251-a903-5b04c1968865 · outbound
This paper cites Avis and V.
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:45.705165Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3f3dc28c-e5da-49ec-b245-9c34ebed8e39 · outbound
This paper cites Fast algorithms for geometric traveling salesman problems.ORSA Journal on Computing , 4(4):387–411, 1992.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Fast algorithms for geometric traveling salesman problems.ORSA Journal on Computing , 4(4):387–411, 1992
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:45.539672Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ad776d90-d522-4af1-81d2-d3e9befca989 · outbound
This paper cites Exponential lower bounds for many pivot rules for the sim- plex method.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Exponential lower bounds for many pivot rules for the sim- plex method
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:45.357383Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6d30a613-5599-4f4d-8df3-b271b9453404 · outbound
This paper cites Brodowsky, Stefan Hougardy, and Xianghui Zhong.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Brodowsky, Stefan Hougardy, and Xianghui Zhong
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:45.129894Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a6057ebe-a91e-4c77-add1-3f9fde44671c · outbound
This paper cites New results on the oldk-opt algo- rithm for the traveling salesman problem.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem New results on the oldk-opt algo- rithm for the traveling salesman problem
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:44.960230Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 14d2dd4c-54b7-4e49-821a-a7190c5bd25f · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 6
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:44.772025Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 9ccbfc3e-d133-4f48-b0f4-2cad08768764 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 7
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:44.630916Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6d6ab920-10aa-4303-a600-570716e9b31f · outbound
This paper cites Smoothed analysis of the 2- opt algorithm for the general TSP.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Smoothed analysis of the 2- opt algorithm for the general TSP
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:44.304895Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation df6a42d7-0323-41bb-809a-72cfc69bea58 · outbound
This paper cites Worst case and probabilistic analysis of the 2-opt algorithm for the TSP.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Worst case and probabilistic analysis of the 2-opt algorithm for the TSP
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:44.028828Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a6c50128-48e0-410f-a989-a0e746646598 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 10
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:43.770856Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 2b8972c1-64ee-4d8f-8c67-d1b3fcee66e0 · outbound
This paper cites On the Smoothed Complexity of Combinatorial Local Search.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem On the Smoothed Complexity of Combinatorial Local Search
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:43.506137Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6616f29f-d0cc-4030-8778-49ac5fe803f9 · outbound
This paper cites On the smoothed complexity of combinatorial local search.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem On the smoothed complexity of combinatorial local search
Reference 12
- Resolution
- verified exact
- raw_fallback, observed 2026-08-06T17:04:38.844122Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 57bb0632-be3d-4f88-b691-465274272fec · outbound
This paper cites Worst case behavior of the steepest edge simplex method.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Worst case behavior of the steepest edge simplex method
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:43.173579Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8fc02db9-1ae4-44e0-aee9-20683a812d02 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 14
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:42.795549Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f67df12b-d859-480f-b692-a1d1ac15fcd5 · outbound
This paper cites Hoang, and Stefan Hougardy.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Hoang, and Stefan Hougardy
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:42.565996Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8f3d5fe9-fbe2-4621-bd9a-bd674f5e3d74 · outbound
This paper cites Hoang and Stefan Hougardy.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Hoang and Stefan Hougardy
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:42.442698Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 6fbddce0-551f-4e78-b274-b126f7af794b · outbound
This paper cites The approximation ratio of the 2-opt heuristic for the metric traveling salesman problem.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem The approximation ratio of the 2-opt heuristic for the metric traveling salesman problem
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:42.340499Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c99b9706-9dce-4660-946c-e68b9a3519f7 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 18
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:42.224439Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 465b0911-6e51-46f2-82bb-24163dbee80a · outbound
This paper cites Johnson and Lyle A.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Johnson and Lyle A
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:42.024377Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ae18dfb2-6b49-49c0-a88f-10dd37f30563 · outbound
This paper cites Johnson and Lyle A.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Johnson and Lyle A
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:41.892105Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8a1dceea-73f0-4a2d-9705-9c8477660ece · outbound
This paper cites Johnson, Christos H.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Johnson, Christos H
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:41.738569Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 8e1783a7-f7b4-43e2-9a64-cc8a5e7555fd · outbound
This paper cites Kleitman.
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:41.583365Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 450cb861-ca66-41d5-92d2-130fea758c35 · outbound
This paper cites Mount, Nathan S.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Mount, Nathan S
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:41.452459Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 5adb64d3-4e13-4982-8334-5c946173ac77 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 24
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:41.272676Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 73318d48-6c3d-4c46-8100-6e81f6ca9dd7 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 25
- Resolution
- unresolved
- raw_fallback, observed 2026-08-06T17:04:41.086193Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation a0000ed2-064a-419b-9d2e-221dccaadb00 · outbound
This paper cites Structure in locally optimal solutions.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Structure in locally optimal solutions
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:40.949263Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation d57aec9a-8cd1-4a74-96ac-afa712ccec23 · outbound
This paper cites Computer solutions of the traveling salesman problem.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Computer solutions of the traveling salesman problem
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:40.752535Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 57246904-c924-470e-9589-c5776e82ac65 · outbound
This paper cites Improved smoothed analysis of 2-opt for the euclidean TSP.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Improved smoothed analysis of 2-opt for the euclidean TSP
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:40.546062Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation c396724b-953d-49f9-9b30-5544941fdcea · outbound
This paper cites Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Superpolynomial smoothed complexity of 3-FLIP in Local Max-Cut
Reference 29
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T17:04:37.663299Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e095d8b1-09e4-49e4-bf56-dbd0894a1f9d · outbound
This paper cites On the power of nodes of degree four in the local max-cut problem.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem On the power of nodes of degree four in the local max-cut problem
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:40.346046Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 4778c26a-c881-4786-8c3d-311ee4f716f2 · outbound
This paper cites Papadimitriou.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Papadimitriou
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:40.054529Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation ce667ff2-3c8e-4b56-b076-26e078eb87d9 · outbound
This paper cites Papadimitriou, Alejandro A.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Papadimitriou, Alejandro A
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:39.854541Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation fce2361a-36b8-4251-9e9c-455aa0dc4857 · outbound
This paper cites Integer linear programs and local search for max-cut.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Integer linear programs and local search for max-cut
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:39.652002Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 3c93df68-ed73-49a2-ab2e-986651f454c8 · outbound
This paper cites Sch¨ affer and Mihalis Yannakakis.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Sch¨ affer and Mihalis Yannakakis
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:39.413616Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 1c435ff4-2b62-4d31-b596-aaae4bea2eee · outbound
This paper cites Computational complexity.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Computational complexity
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:39.271714Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation f6b1b754-8229-4f8c-95e1-b75ad974067c · outbound
This paper cites On the approximation ratio of the k-opt and lin-kernighan algo- rithm for metric and graph tsp.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem On the approximation ratio of the k-opt and lin-kernighan algo- rithm for metric and graph tsp
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-06T17:04:39.033108Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.
Observation 80184460-05d4-4e3b-b39b-8893266a8715 · outbound
This paper cites an unresolved cited work.
A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem Unresolved cited work
Reference 275
- Resolution
- unresolved
- no resolver link, observed 2026-08-06T17:04:37.856016Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.