Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
As of 7 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:1806.09285.
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, observed 2026-08-05T16:40:22.922968Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-08-05T16:40:23.017001Z
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 ccb3a749-7429-43f9-a8d0-fa586b2182e2 · inbound
Finding trail covers: near-optimal decompositions of graph states as linear fusion networks cites this paper.
Finding trail covers: near-optimal decompositions of graph states as linear fusion networks A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
Reference 43
- Resolution
- verified exact
- local_arxiv, observed 2026-08-05T16:40:23.020207Z
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 ebb3fb43-1f25-416b-b23b-64b876225988 · inbound
Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes cites this paper.
Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-08-01T14:53:42.670857Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.