Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
As of 23 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 1 inbound Pith citation observation for arXiv:2505.15862.
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-23T06:30:58.430688+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-10T01:12:53.472283Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Reference resolution
0 of 0 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
0
arxiv_reference, observed 2026-08-05T02:28:24.338817Z
Outbound references
No outbound reference observations are available for this paper version.
Pith citing papers
Observation 080f4ef1-c2f8-4cbc-baf0-3bc58c9d7258 · inbound
Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem cites this paper.
Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem Bandit based Dynamic Candidate Edge Selection in Solving Traveling Salesman Problems
Reference 39
- Resolution
- verified exact
- arxiv_id, observed 2026-05-10T01:30:54.815935Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-23T06:30:58.430688+00:00.