Pith. sign in

Paper Citation Record · LEDGER

Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy

As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2407.13616.

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

pith.paper-citation-record.v1
2407.13616 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 2 of 2 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-10T06:31:04.303077+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-07T23:38:11.639995Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-06-30T06:24:19.246959Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation 7dcd2bee-d8dd-448d-8214-58858279fed7 · inbound

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits cites this paper.

A quantum speedup algorithm for TSP based on quantum dynamic programming with very few qubits Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-07T23:38:11.639995Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-07T23:38:11.639995Z digest=sha256:031558eb5c4c22ab2442bbeee15508c088a858cb80122b68018701043c894e6b

Observation 7b3831b1-c1ac-49ff-94e0-4b4f71cb3a1f · inbound

Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems cites this paper.

Quantum-enhanced Monte Carlo Tree Search framework for combinatorial optimization problems Quantum Local Search for Traveling Salesman Problem with Path-Slicing Strategy

Reference 71

Resolution
verified exact
arxiv_id, observed 2026-06-30T06:24:19.248245Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.

source=arxiv_source observed=2026-06-30T06:20:32.505136Z digest=sha256:68ba99b154e78e8ececb9524533f881fee915c9193a9eeb7cae0817e88e7c1b6