{"as_of":"2026-08-09T14:03:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:52b86aba42a367c1051ee4c9560a6268babfcb809644c8a41245769749dfb030","coverage":[{"denominator":20,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":20,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-14T17:25:51.527088Z","state":"measured"},{"denominator":20,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":20,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-09T06:31:02.800959+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.09708/citation-record","integrity":"/paper/2607.09708/integrity","json":"/paper/2607.09708/citation-record.json","paper":"/paper/2607.09708"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"The traveling salesman problem","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:87f4d035e4fc6c881950a207abc5cc168f1aad901aa761b223087d6426a27a10","observation_id":"de783334-e4ef-4581-acb3-aae69a2fc22d","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Spectral sparsification of graphs.SIAM Journal on Computing, 40(4):981–1025, 2011","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:721a25426aa880d567efc4ed32eb3af29143a759249807d3e84b7e18062b0717","observation_id":"2088bd9c-4608-4d0d-a59c-6efe71dfc1c6","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Springer, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:4334e5e78548afda368129abd1b854d5a21c5eba7fad55c64be2e16b01aaa196","observation_id":"df52dc7d-fbbf-4296-b366-66d6b6830677","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":null,"venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:7ee696b8a560a58000766739bdea0bec327ab39afee3bf7575f7e82892adc6ba","observation_id":"d2490bd0-6c6c-4344-b1c0-b41890e719a8","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.03012","last_updated":"2021-03-04T13:20:06Z","snapshot_observed_at":"2026-08-08T18:12:53.602154Z","submitted_at":"2021-03-04T13:20:06Z","title":"The Transformer Network for the Traveling Salesman Problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.03012","snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"The transformer network for the traveling salesman problem.arXiv preprint arXiv:2103.03012, 2021","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"cited_paper":"/paper/2103.03012","citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:b7078f74e8ae606a8cfd679826a170ab93c009d57fbb34dbf9f6b47b66bfae39","observation_id":"42886456-e8a9-4586-b665-da76cf0bb057","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"An efficient graph convolutional network technique for the travelling salesman problem.arXiv preprint arXiv:1906.01227, 2019","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:24daa75e6795dbf1a7b212ac7e63d76af974fd5e1914a08bc1ef5670a5483bb8","observation_id":"7b1adfd2-1c96-4fd3-aa62-9b605f80849b","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Pointer networks.Advances in neural information processing systems, 28, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:15cf8461c8f3648aba41e2afbeb19178c7642533f502591194a26563d5b9ba9b","observation_id":"b0830e95-f689-4d8a-a6e5-07c4001c4bfb","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1611.09940","last_updated":"2017-01-12T23:55:36Z","snapshot_observed_at":"2026-07-06T05:20:39.825511Z","submitted_at":"2016-11-29T23:22:39Z","title":"Neural Combinatorial Optimization with Reinforcement Learning","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1611.09940","snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Neural combina- torial optimization with reinforcement learning.arXiv preprint arXiv:1611.09940, 2016","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:a9ac7d1bd5f44e3be93c7fdf147393c44944688054298b03e17535099c8db540","observation_id":"95bd3b28-7818-4ede-b4a8-56e7d3fb89e9","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Pomo: Policy optimization with multiple optima for reinforcement learning.Advances in neural information processing systems, 33:21188–21198, 2020","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:d42e7013d8c42d055f1d011f45dfee709a6b0fd6d11a8f1aca273a7d72d605d4","observation_id":"7ea4a22f-c9c1-4416-ba8e-8db90103f875","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Learning to sparsify travelling salesman problem instances","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:246e43b61eb8685687aa14705c40eab9aaf6db56604357be0b1a9807d293c38b","observation_id":"66f9bcd7-a429-4c71-bb7a-3b6712f4b03d","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":null,"venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:0fad688e5b46e2a7ae9c828cbd47a7ea1600a77934c90a9afe3514228791741f","observation_id":"b7d362a9-a9fa-47c3-b06e-6dbe12a242f8","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Combhelper: a neural approach to reduce search space for graph combinatorial problems","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:275c624f6cf524a88bdd2b9d4c743e6bf6a433b93221a80e9a0ddca1a0c00bdb","observation_id":"55d30e76-b988-484e-bfaa-019852f58364","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"A comprehensive survey on graph reduction: Sparsification, coarsening, and condensation","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:663fc4720f1521bad86f33c821102fce882392558ad599328c6b1b6e04bbf2db","observation_id":"6dea1669-40a4-4376-abdd-16471962e6ce","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"The graph neural network model.IEEE transactions on neural networks, 20(1):61–80, 2008","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:a7d1a5748835c6602f9c98c3e680b85274e84ddc6814421d44cda1220cace33f","observation_id":"d911ddfd-4801-4035-a23a-0389597397d2","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Open graph benchmark: Datasets for machine learning on graphs","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:5146304ea2d2207b12f0afeffb11abc359661dcfe1e3c294c2242eb144008912","observation_id":"6089da88-2f17-4bf0-9f39-4baf6ce5d9a8","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Graph attention networks.stat, 1050:4, 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:7a60935b40eb274adb18100be9f88a880a2c21ad3b794efcfd8b7aeeda284c1f","observation_id":"94f543ff-42d7-4e5a-a1e7-83488c57ccf6","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Worst-case analysis of a new heuristic for the travelling salesman problem","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:5e333d716e22ed814473d3c6450c1a1b239783e6b15764c3f04ad4eb766893df","observation_id":"4dcd2168-e66a-41c3-b129-e667c6bd7131","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Scip: solving constraint integer programs.Mathematical Programming Computation, 1(1):1–41, 2009","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:9ddac038166aea4b79f3a967d9972c38c9756430f6ab28f2ad9b2837e53b2fe1","observation_id":"4a0db43a-5f43-49d0-ae48-1e95fbfd08b1","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Solving the equality generalized traveling salesman problem using the lin– kernighan–helsgaun algorithm.Mathematical Programming Computation, 7(3):269–287, 2015","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:ca1cc907c0272d9b5b574561552a5ad690626b1f536cbdc22afc422aeff9b2b6","observation_id":"a14db04a-925e-4395-b904-92281a0cefa9","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2005.05847","last_updated":"2020-09-08T03:13:18Z","snapshot_observed_at":"2026-08-03T17:32:34.354604Z","submitted_at":"2020-05-12T15:09:20Z","title":"Generalization of Machine Learning for Problem Reduction: A Case Study on Travelling Salesman Problems","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2005.05847","snapshot_observed_at":"2026-07-14T17:25:51.527088Z","title":"Generalization of machine learn- ing for problem reduction: a case study on travelling salesman problems.arXiv preprint arXiv:2005.05847, 2020","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-14T17:25:51.527088Z"},"links":{"cited_paper":"/paper/2005.05847","citing_paper":"/paper/2607.09708"},"observation_digest":"sha256:0d3ca48359ebf2afb7230b8b191127004556f592f3db6fd40506b70c4f2f3ae8","observation_id":"f0a6246d-8ad9-47a7-96b0-ab4161b31631","resolution":{"observed_at":"2026-07-14T17:25:51.527088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.09708","last_updated":"2026-06-23T11:13:29Z","latest_version":1,"primary_category":"cs.AI","snapshot_observed_at":"2026-08-03T17:22:08.207004Z","submitted_at":"2026-06-23T11:13:29Z","title":"GES-TSP: Graph Edge Sparsification for TSP"},"reference_resolution":{"displayed":20,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":20,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":20},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-09T06:31:02.800959+00:00","source":"crossref"},{"observed_at":"2026-08-09T06:30:57.326959+00:00","source":"retraction_watch"}],"thesis":"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."}