Paper Citation Record · LEDGER

An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

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

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

pith.paper-citation-record.v1
1906.01227 v2

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 33 of 33 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 33 of 33 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-09T10:38:06.104759Z

measured 1 of 1 external citation measurements

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

203
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 fedfcb7c-5b66-4d4e-8c8f-7aec1942f395 · inbound

Output-Constrained Decision Trees cites this paper.

Output-Constrained Decision Trees An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 6

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T00:45:54.460037Z

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.

Observation 7d7a70a5-bb7c-4673-8e4d-c281e762975d · inbound

Network Interdiction Goes Neural cites this paper.

Network Interdiction Goes Neural An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 15

Resolution: verified exact; arxiv_id, observed 2026-05-24T01:03:41.259322Z

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.

Observation f1ca0086-d2d1-41ca-90ee-2ee46f6a4d9a · inbound

Supplementary Materials to Graph Convolutional Branch and Bound cites this paper.

Supplementary Materials to Graph Convolutional Branch and Bound An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 1

Resolution: metadata mismatch; arxiv_id, observed 2026-05-24T00:03:38.986815Z

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.

Observation b9d8df75-e059-49d7-b0f3-d50f384c1503 · inbound

Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization cites this paper.

Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 3

Resolution: unresolved; no resolver link, observed 2026-08-09T10:38:06.104759Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 18bf46fe-4bde-4b3e-82a6-d2a5797ceab2 · inbound

Hierarchical Learning-based Graph Partition for Large-scale Vehicle Routing Problems cites this paper.

Hierarchical Learning-based Graph Partition for Large-scale Vehicle Routing Problems An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-08T05:37:08.411866Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9346f039-b7c5-4ead-a49a-d18326e58dc2 · 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 An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 39

Resolution: unresolved; no resolver link, observed 2026-08-07T14:37:16.834961Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2b01519a-5248-45cd-a328-35b26cc4a1f7 · inbound

SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy cites this paper.

SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 2022

Resolution: unresolved; no resolver link, observed 2026-08-07T05:18:12.694848Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c08f337f-87ae-45f5-9791-92e5891e6ff4 · inbound

Recurrent State Encoders for Efficient Neural Combinatorial Optimization cites this paper.

Recurrent State Encoders for Efficient Neural Combinatorial Optimization An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-05T05:42:52.584945Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation edc57c24-3e92-44bd-96b9-8ab14dac7f60 · 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 An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 3b9b8820-1ce6-4201-a5b4-cd8d94d57b39 · inbound

Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP cites this paper.

Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 2

Resolution: metadata mismatch; arxiv_id, observed 2026-05-18T04:20:52.263246Z

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.

Observation b5d4886a-2631-48f9-a4a3-bf0cbc4c3069 · inbound

Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem cites this paper.

Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 4

Resolution: unresolved; no resolver link, observed 2026-08-04T06:54:15.840674Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 29c2dc76-11e2-4ff7-9232-373776a2df18 · inbound

Graph Neural Networks are Heuristics cites this paper.

Graph Neural Networks are Heuristics An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 2017

Resolution: unresolved; no resolver link, observed 2026-08-03T09:36:03.629370Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 8cae7865-2fc0-420e-98e2-05dcc362ab98 · inbound

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks cites this paper.

Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-02T23:08:06.454299Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation baa1e8b0-e5ff-47c2-845b-43f94ae32518 · 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 An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 18

Resolution: metadata mismatch; arxiv_id, observed 2026-05-11T13:41:09.253398Z

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.

Observation 4333086e-281d-4213-97f3-f826363b21e9 · inbound

Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis cites this paper.

Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 18

Resolution: metadata mismatch; arxiv_id, observed 2026-05-20T12:38:16.825567Z

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.

Observation 2ec13765-b16e-4da9-b0f7-810dc70cc49b · inbound

GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization cites this paper.

GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 36

Resolution: verified exact; arxiv_id, observed 2026-05-20T07:18:07.117362Z

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.

Observation c7528c1d-fcfc-44c6-a55a-87659a272ec8 · inbound

Convex Compositional Reasoning Models cites this paper.

Convex Compositional Reasoning Models An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-05-25T05:15:22.566333Z

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.

Observation d62ef28b-f11a-45a5-b018-ed7b040cc760 · inbound

Convex Compositional Reasoning Models cites this paper.

Convex Compositional Reasoning Models An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 8

Resolution: verified exact; arxiv_id, observed 2026-06-30T16:24:56.911380Z

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.

Observation 063af3f1-4d79-4079-8f6d-8e2e400a7fd9 · inbound

SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver cites this paper.

SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 6

Resolution: verified exact; arxiv_id, observed 2026-06-30T13:34:40.216318Z

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.

Observation 9545370f-e7e3-44f3-ac6f-1cbbff1fb619 · inbound

Towards Generalization-Oriented Models for Vehicle Routing Problems with Mixture-of-Experts cites this paper.

Towards Generalization-Oriented Models for Vehicle Routing Problems with Mixture-of-Experts An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 24

Resolution: verified exact; arxiv_id, observed 2026-06-29T19:53:55.825864Z

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.

Observation 95f90e69-3d0e-4cd2-b692-cf17dd281e7b · inbound

Regularized Large Neighborhood Search cites this paper.

Regularized Large Neighborhood Search An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 62

Resolution: metadata mismatch; arxiv_id, observed 2026-06-28T15:22:19.741716Z

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.

Observation af90e4af-1572-4f57-9157-af855e259c85 · inbound

Vision-Assisted Foundation Model for Solving Multi-Task Vehicle Routing Problems cites this paper.

Vision-Assisted Foundation Model for Solving Multi-Task Vehicle Routing Problems An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 2

Resolution: verified exact; arxiv_id, observed 2026-07-03T04:07:36.626235Z

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.

Observation 7e8b34f6-cee3-464c-adb3-509606054516 · inbound

AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network cites this paper.

AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 36

Resolution: verified exact; arxiv_id, observed 2026-07-04T00:09:14.409503Z

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.

Observation e4823f8e-42ba-4daa-913c-64192c2c440a · inbound

GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem cites this paper.

GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 10

Resolution: metadata mismatch; arxiv_id, observed 2026-07-04T09:49:44.518376Z

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.

Observation 569d6f40-eadd-4aee-b357-a5d772c5f53f · inbound

GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem cites this paper.

GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-02T10:33:25.079875Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1e2468c2-b97a-47ad-895b-3d3da1b90884 · inbound

Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy cites this paper.

Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 3

Resolution: verified exact; arxiv_id, observed 2026-07-04T13:49:51.208022Z

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.

Observation 562e9b16-df6e-4849-a36d-bd99498e0fb8 · inbound

Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning cites this paper.

Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 20

Resolution: verified exact; arxiv_id, observed 2026-06-30T07:44:21.941326Z

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.

Observation abf5e3bf-e467-434b-be12-7d0af7d83f13 · inbound

Neural Certificate Pricing for Combinatorial Optimization Problems cites this paper.

Neural Certificate Pricing for Combinatorial Optimization Problems An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 21

Resolution: verified exact; arxiv_id, observed 2026-07-02T15:17:07.327749Z

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.

Observation f2f239a8-15f8-40e4-8cab-dce860dc08f6 · inbound

TSP with Predictions: Heatmap to Tour with Provable Guarantees cites this paper.

TSP with Predictions: Heatmap to Tour with Provable Guarantees An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-11T23:55:28.923983Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e46238f-b8a8-43a1-ab84-3458a82e5118 · inbound

TSP with Predictions: Heatmap to Tour with Provable Guarantees cites this paper.

TSP with Predictions: Heatmap to Tour with Provable Guarantees An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 2019

Resolution: unresolved; no resolver link, observed 2026-08-02T09:02:58.207638Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7b1adfd2-1c96-4fd3-aa62-9b605f80849b · inbound

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

GES-TSP: Graph Edge Sparsification for TSP An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 6

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 6d4dfcbe-e0da-494f-be00-41dd948d1f3e · inbound

LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers cites this paper.

LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 5

Resolution: unresolved; no resolver link, observed 2026-08-01T17:18:09.677845Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e0a18bf4-6dcb-4e54-b919-d59f0ff8b81b · inbound

MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems cites this paper.

MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem

Reference 27

Resolution: unresolved; no resolver link, observed 2026-08-04T01:24:24.165800Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.