Pith. sign in

Paper Citation Record · LEDGER

GES-TSP: Graph Edge Sparsification for TSP

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

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

pith.paper-citation-record.v1
2607.09708 v1

Coverage vector

measured 20 of 20 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-14T17:25:51.527088Z

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

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

20 of 20 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved20
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation de783334-e4ef-4581-acb3-aae69a2fc22d · outbound

This paper cites The traveling salesman problem.

GES-TSP: Graph Edge Sparsification for TSP The traveling salesman problem

Reference 1

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:10059511e729491b7983f0289484a4fb9998dd629ed23b5d8175105d3f40a457

Observation 2088bd9c-4608-4d0d-a59c-6efe71dfc1c6 · outbound

This paper cites Spectral sparsification of graphs.SIAM Journal on Computing, 40(4):981–1025, 2011.

GES-TSP: Graph Edge Sparsification for TSP Spectral sparsification of graphs.SIAM Journal on Computing, 40(4):981–1025, 2011

Reference 2

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:dcfff1d811a3ee83f67eb07daa3b6608ae5539a327e7b69d12b164d913fa882a

Observation df52dc7d-fbbf-4296-b366-66d6b6830677 · outbound

This paper cites Springer, 2008.

GES-TSP: Graph Edge Sparsification for TSP Springer, 2008

Reference 3

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:82b3114474cc3977dda9ae44f3e5cd2b7a21b574c8033d15b377d121471609e0

Observation d2490bd0-6c6c-4344-b1c0-b41890e719a8 · outbound

This paper cites an unresolved cited work.

GES-TSP: Graph Edge Sparsification for TSP Unresolved cited work

Reference 4

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:23a279f1fcfa1d35d089f841725bae4685467412982e2fa21015170d3198c33f

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

This paper cites The Transformer Network for the Traveling Salesman Problem.

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.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:151278a9514b32f600e7a3f69e0231ecefd28084ea1659e6a7841e03175ebd68

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

This paper cites An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem.

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.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:7887dbadb702f5bad767017bbb0c6e50f43e366221223615ee75d6475e52564f

Observation b0830e95-f689-4d8a-a6e5-07c4001c4bfb · outbound

This paper cites Pointer networks.Advances in neural information processing systems, 28, 2015.

GES-TSP: Graph Edge Sparsification for TSP Pointer networks.Advances in neural information processing systems, 28, 2015

Reference 7

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:b35fd6c3c6514d84110d080db5f8a2578a801bf7658aef647321ef6cc096cdbb

Observation 95bd3b28-7818-4ede-b4a8-56e7d3fb89e9 · outbound

This paper cites Neural Combinatorial Optimization with Reinforcement Learning.

GES-TSP: Graph Edge Sparsification for TSP Neural Combinatorial Optimization with Reinforcement Learning

Reference 8

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:b0af86ae8536294972d0ec861beadeb6d6fc17b52421e88c561de1d7ff3283db

Observation 7ea4a22f-c9c1-4416-ba8e-8db90103f875 · outbound

This paper cites Pomo: Policy optimization with multiple optima for reinforcement learning.Advances in neural information processing systems, 33:21188–21198, 2020.

GES-TSP: Graph Edge Sparsification for TSP Pomo: Policy optimization with multiple optima for reinforcement learning.Advances in neural information processing systems, 33:21188–21198, 2020

Reference 9

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:4c027c6f81f4f01310061729e8e09581a1ed773432f651c954d133dfcb9a8d7a

Observation 66f9bcd7-a429-4c71-bb7a-3b6712f4b03d · outbound

This paper cites Learning to sparsify travelling salesman problem instances.

GES-TSP: Graph Edge Sparsification for TSP Learning to sparsify travelling salesman problem instances

Reference 10

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:ee50c4891b5938c60104d7e2a5aaec3030ebbcd7c65ad598e99fdab5eabde427

Observation b7d362a9-a9fa-47c3-b06e-6dbe12a242f8 · outbound

This paper cites an unresolved cited work.

GES-TSP: Graph Edge Sparsification for TSP Unresolved cited work

Reference 11

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:f5dd55d9f23bea55762a6351acfe0f47c60a53f122f89b41f43eac272aee1aed

Observation 55d30e76-b988-484e-bfaa-019852f58364 · outbound

This paper cites Combhelper: a neural approach to reduce search space for graph combinatorial problems.

GES-TSP: Graph Edge Sparsification for TSP Combhelper: a neural approach to reduce search space for graph combinatorial problems

Reference 12

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:1f417f221a9f689c6c461848481b5057c44a6fb97cdd04078b681fd73b5bb57d

Observation 6dea1669-40a4-4376-abdd-16471962e6ce · outbound

This paper cites A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation.

GES-TSP: Graph Edge Sparsification for TSP A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation

Reference 13

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:a22eaf1d7879c66e74e2e3dc6b8541d0d1a42999db8320def8885666a5b23222

Observation d911ddfd-4801-4035-a23a-0389597397d2 · outbound

This paper cites The graph neural network model.IEEE transactions on neural networks, 20(1):61–80, 2008.

GES-TSP: Graph Edge Sparsification for TSP The graph neural network model.IEEE transactions on neural networks, 20(1):61–80, 2008

Reference 14

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:291ce5c403f68da13e7c06b259cd8dc1c3f3144725206a5dea9089bcbbb28159

Observation 6089da88-2f17-4bf0-9f39-4baf6ce5d9a8 · outbound

This paper cites Open graph benchmark: Datasets for machine learning on graphs.

GES-TSP: Graph Edge Sparsification for TSP Open graph benchmark: Datasets for machine learning on graphs

Reference 15

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:3ceaa34a8fd32257f27fedf3fb20c7f704f58b7f1bf59b5b931183fb0fb4ffd3

Observation 94f543ff-42d7-4e5a-a1e7-83488c57ccf6 · outbound

This paper cites Graph attention networks.stat, 1050:4, 2018.

GES-TSP: Graph Edge Sparsification for TSP Graph attention networks.stat, 1050:4, 2018

Reference 16

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:3bce1d2a8c2475dc68ff13b78bece730bf320c865c0e903c1591d9a18dc29de2

Observation 4dcd2168-e66a-41c3-b129-e667c6bd7131 · outbound

This paper cites Worst-case analysis of a new heuristic for the travelling salesman problem.

GES-TSP: Graph Edge Sparsification for TSP Worst-case analysis of a new heuristic for the travelling salesman problem

Reference 17

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:1e43387ef5a67f03593ca68183e5ac5e4e375560ce31e578b5336a1ec66dcc68

Observation 4a0db43a-5f43-49d0-ae48-1e95fbfd08b1 · outbound

This paper cites Scip: solving constraint integer programs.Mathematical Programming Computation, 1(1):1–41, 2009.

GES-TSP: Graph Edge Sparsification for TSP Scip: solving constraint integer programs.Mathematical Programming Computation, 1(1):1–41, 2009

Reference 18

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:6f0f057bcb87427acc5cf3d7cb12bc5073b9185f16240988a53862e90593e83a

Observation a14db04a-925e-4395-b904-92281a0cefa9 · outbound

This paper cites Solving the equality generalized traveling salesman problem using the lin– kernighan–helsgaun algorithm.Mathematical Programming Computation, 7(3):269–287, 2015.

GES-TSP: Graph Edge Sparsification for TSP Solving the equality generalized traveling salesman problem using the lin– kernighan–helsgaun algorithm.Mathematical Programming Computation, 7(3):269–287, 2015

Reference 19

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:423f598c856cef653289fd66da044c36b9254d111e03f8a9e36a58a30ed69e0e

Observation f0a6246d-8ad9-47a7-96b0-ab4161b31631 · outbound

This paper cites Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems.

GES-TSP: Graph Edge Sparsification for TSP Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems

Reference 20

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

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-14T17:25:51.527088Z digest=sha256:e84e3ae76136e53542d893aea547f5a7c38bd8b3e7223528416e654632fca478

Pith citing papers

No inbound Pith citation observations are available.