Paper Citation Record · LEDGER

The Transformer Network for the Traveling Salesman Problem

As of 8 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 4 inbound Pith citation observations for arXiv:2103.03012.

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

pith.paper-citation-record.v1
2103.03012 v1

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 4 of 4 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 4 of 4 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-06T11:56:09.076671Z

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-12T08:31:25.825030Z

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 7dd7d721-b344-4dcc-8e95-e1013fcc2e48 · inbound

Parametrized Multi-Agent Routing via Deep Attention Models cites this paper.

Parametrized Multi-Agent Routing via Deep Attention Models The Transformer Network for the Traveling Salesman Problem

Reference 2009

Resolution: unresolved; no resolver link, observed 2026-08-06T11:56:09.076671Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c5f1813b-f17b-4b93-8955-0c1be04290be · inbound

Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm cites this paper.

Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm The Transformer Network for the Traveling Salesman Problem

Reference 1985

Resolution: unresolved; no resolver link, observed 2026-08-04T14:42:33.129948Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 35a0445b-784a-4ee0-a444-2bc4270aef56 · inbound

Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems cites this paper.

Omni-scale Learning-based Sequential Decision Framework for Order Fulfillment of Tote-handling Robotic Systems The Transformer Network for the Traveling Salesman Problem

Reference 89

Resolution: verified exact; arxiv_id, observed 2026-05-12T08:31:25.828078Z

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.

Observation 42886456-e8a9-4586-b665-da76cf0bb057 · inbound

GES-TSP: Graph Edge Sparsification for TSP cites this paper.

GES-TSP: Graph Edge Sparsification for TSP The Transformer Network for the Traveling Salesman Problem

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-14T17:25:51.527088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.