Paper Citation Record · LEDGER

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP

As of 16 August 2026, this Paper Citation Record lists 18 of 18 outbound references and 0 inbound Pith citation observations for arXiv:1908.09325.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
1908.09325 v2

Coverage vector

measured 18 of 18 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T11:31:21.489995Z

measured 18 of 18 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-16T06:30:59.297886+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: cited_works

Reference resolution

18 of 18 outbound references displayed

verified exact2
verified fuzzy5
unresolved9
parse uncertain0
malformed identifier2
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 11c47f88-d19f-43cc-9ed0-371a0175fbe1 · outbound

This paper cites Popularconjecturesimplystronglowerbounds for dynamic problems.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Popularconjecturesimplystronglowerbounds for dynamic problems

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.421347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 43fd23d2-eeae-4c92-babc-2cd190200f46 · outbound

This paper cites Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997.doi:10.1007/BF02523189.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Finding and counting given length cycles.Algo- rithmica, 17(3):209–223, 1997.doi:10.1007/BF02523189

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.425985Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0234467e-1c00-45b2-8865-c57bd1ad3502 · outbound

This paper cites Homomorphismsareagoodbasisforcounting small subgraphs.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Homomorphismsareagoodbasisforcounting small subgraphs

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.431376Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 22b3d969-170f-4ab1-9720-6691b5772f5b · outbound

This paper cites Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Fomin, Lukasz Kowalik, Daniel Lokshtanov, Dániel Marx, Marcin Pilipczuk, Michal Pilipczuk, and Saket Saurabh.Parameterized Algorithms

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.435698Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 85b904d4-3bcc-49aa-a211-0e5a698485fd · outbound

This paper cites Improving TSP tours using dynamic programming over tree decompositions.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Improving TSP tours using dynamic programming over tree decompositions

Reference 5

Resolution: malformed identifier; no resolver link, observed 2026-08-14T11:31:21.439892Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 134c7468-17e5-483b-aa0f-851a9414509c · outbound

This paper cites an unresolved cited work.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Unresolved cited work

Reference 6

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:31:21.962379Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 63b737ef-e586-4d8d-8aee-17e1bb72241c · outbound

This paper cites Fomin, Serge Gaspers, Saket Saurabh, and Alexey A.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Fomin, Serge Gaspers, Saket Saurabh, and Alexey A

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:31:21.946578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation b53c3cbd-a656-41dc-acd6-f372ab21b459 · outbound

This paper cites Fredman, János Komlós, and Endre Szemerédi.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Fredman, János Komlós, and Endre Szemerédi

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.452062Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2a8469b1-6e54-40f0-a70b-2ca2d9f5ff98 · outbound

This paper cites The parameterized com- plexity of local search for TSP, more reﬁned.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP The parameterized com- plexity of local search for TSP, more reﬁned

Reference 9

Resolution: verified exact; doi, observed 2026-08-14T11:31:21.546629Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 88dfd98e-3acf-4a5a-af02-2b0c709fa5a7 · outbound

This paper cites an unresolved cited work.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Unresolved cited work

Reference 10

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:31:21.931023Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation ffb53163-a525-4e44-9398-91109f396904 · outbound

This paper cites An eﬀective implementation of the Lin-Kernighan traveling salesman heuris- tic.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP An eﬀective implementation of the Lin-Kernighan traveling salesman heuris- tic

Reference 11

Resolution: malformed identifier; raw_fallback, observed 2026-08-14T11:31:21.916746Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 98ee8024-d2b7-4825-a775-735b9772108e · outbound

This paper cites Generalk-opt submoves for the Lin-Kernighan TSP heuristic.Math.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Generalk-opt submoves for the Lin-Kernighan TSP heuristic.Math

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:31:21.903662Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5b463ae2-4413-4afb-8ce7-feda9ed2160d · outbound

This paper cites an unresolved cited work.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Unresolved cited work

Reference 13

Resolution: unresolved; raw_fallback, observed 2026-08-14T11:31:21.890826Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 9a243134-ac70-4f23-a13c-a6430da9c460 · outbound

This paper cites Johnson and L.A McGeoch.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Johnson and L.A McGeoch

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:31:21.876819Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 32433758-e3dc-48e7-b81c-23c6bf60c88b · outbound

This paper cites Lin and Brian W.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Lin and Brian W

Reference 15

Resolution: unresolved; no resolver link, observed 2026-08-14T11:31:21.478879Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation dc7f13a9-e953-47d9-8f9d-02e17a0b9b9c · outbound

This paper cites Searching the k-change neighborhood for TSP is W[1]-hard.Oper.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Searching the k-change neighborhood for TSP is W[1]-hard.Oper

Reference 16

Resolution: verified exact; doi, observed 2026-08-14T11:31:21.526282Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 53a4845e-81c4-42d3-a651-23df8011c164 · outbound

This paper cites Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.doi:10.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Can you beat treewidth? Theory of Computing, 6(1):85–112, 2010.doi:10

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:31:21.865189Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Observation 5f569024-007d-4798-ae7d-942c2b3bfdbf · outbound

This paper cites Enumerating connection patterns.

Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Enumerating connection patterns

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T11:31:21.848935Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-16T06:30:59.297886+00:00.

Pith citing papers

No inbound Pith citation observations are available.