Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Travelling Salesman Problem: Parallel Implementations & Analysis
As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 2 inbound Pith citation observations for arXiv:2205.14352.
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-08T06:32:00.761636+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-07T14:37:14.589364Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-11T21:46:48.677661Z
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 5ee4aa49-19b3-42f4-a642-c9e927e600d9 · inbound
A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem cites this paper.
A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem Travelling Salesman Problem: Parallel Implementations & Analysis
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T14:37:14.589364Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5939afa8-9120-4c7f-9aec-c77e05d361b3 · inbound
A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems cites this paper.
A virtually connected probabilistic computer as a solver for higher-order, densely connected, or reconfigurable combinatorial optimisation problems Travelling Salesman Problem: Parallel Implementations & Analysis
Reference 17
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T21:46:48.699794Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.