Pith. sign in

Paper Citation Record · LEDGER

GES-TSP: Graph Edge Sparsification for TSP

As of 9 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-09T06:31:02.800959+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:87f4d035e4fc6c881950a207abc5cc168f1aad901aa761b223087d6426a27a10

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:721a25426aa880d567efc4ed32eb3af29143a759249807d3e84b7e18062b0717

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:4334e5e78548afda368129abd1b854d5a21c5eba7fad55c64be2e16b01aaa196

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:7ee696b8a560a58000766739bdea0bec327ab39afee3bf7575f7e82892adc6ba

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:b7078f74e8ae606a8cfd679826a170ab93c009d57fbb34dbf9f6b47b66bfae39

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:24daa75e6795dbf1a7b212ac7e63d76af974fd5e1914a08bc1ef5670a5483bb8

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:15cf8461c8f3648aba41e2afbeb19178c7642533f502591194a26563d5b9ba9b

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:a9ac7d1bd5f44e3be93c7fdf147393c44944688054298b03e17535099c8db540

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:d42e7013d8c42d055f1d011f45dfee709a6b0fd6d11a8f1aca273a7d72d605d4

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:246e43b61eb8685687aa14705c40eab9aaf6db56604357be0b1a9807d293c38b

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:0fad688e5b46e2a7ae9c828cbd47a7ea1600a77934c90a9afe3514228791741f

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:275c624f6cf524a88bdd2b9d4c743e6bf6a433b93221a80e9a0ddca1a0c00bdb

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:663fc4720f1521bad86f33c821102fce882392558ad599328c6b1b6e04bbf2db

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:a7d1a5748835c6602f9c98c3e680b85274e84ddc6814421d44cda1220cace33f

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:5146304ea2d2207b12f0afeffb11abc359661dcfe1e3c294c2242eb144008912

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:7a60935b40eb274adb18100be9f88a880a2c21ad3b794efcfd8b7aeeda284c1f

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:5e333d716e22ed814473d3c6450c1a1b239783e6b15764c3f04ad4eb766893df

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:9ddac038166aea4b79f3a967d9972c38c9756430f6ab28f2ad9b2837e53b2fe1

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:ca1cc907c0272d9b5b574561552a5ad690626b1f536cbdc22afc422aeff9b2b6

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:0d3ca48359ebf2afb7230b8b191127004556f592f3db6fd40506b70c4f2f3ae8

Pith citing papers

No inbound Pith citation observations are available.