{"as_of":"2026-08-10T14:33:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:2fff567a9ffd21112f89c2f41f5cca8941f86a212c4417554776b4eec3f7fe85","coverage":[{"denominator":0,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":34,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":34,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-10T06:31:04.303077+00:00","state":"measured"},{"denominator":34,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":34,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-10T13:47:19.187472Z","state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":1,"source":"arxiv_reference","source_observed_at":"2026-08-05T02:28:24.338817Z","state":"measured"}],"external_citation_measurements":[{"count":203,"observed_at":"2026-08-05T02:28:24.338817Z","source":"arxiv_reference"}],"inbound":[{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2405.15314","last_updated":"2026-04-03T09:10:59Z","snapshot_observed_at":"2026-07-06T18:19:08.871953Z","submitted_at":"2024-05-24T07:54:44Z","title":"Output-Constrained Decision Trees","version":5},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-05-24T00:43:59.929538Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2405.15314"},"observation_digest":"sha256:28d2d52a87e785ec29ac43a207ff9ea2159a8755976fec9b91ce2e45b8e0bc14","observation_id":"fedfcb7c-5b66-4d4e-8c8f-7aec1942f395","resolution":{"observed_at":"2026-05-24T00:45:54.460037Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2405.16409","last_updated":"2024-05-26T02:34:26Z","snapshot_observed_at":"2026-07-06T18:20:01.382394Z","submitted_at":"2024-05-26T02:34:26Z","title":"Network Interdiction Goes Neural","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-05-24T01:02:52.190276Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2405.16409"},"observation_digest":"sha256:de4d630e89b9091187d363f1217fd681d4593d8d482227970e43abf9d01568dc","observation_id":"7d7a70a5-bb7c-4673-8e4d-c281e762975d","resolution":{"observed_at":"2026-05-24T01:03:41.259322Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2406.03099","last_updated":"2026-04-03T14:38:42Z","snapshot_observed_at":"2026-07-06T18:25:44.620682Z","submitted_at":"2024-06-05T09:42:43Z","title":"Supplementary Materials to Graph Convolutional Branch and Bound","version":4},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-05-24T00:03:19.104115Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2406.03099"},"observation_digest":"sha256:d3decb2e5d202577c79b5a492d5116691d7796f93f27b88f118a419ca7ff018e","observation_id":"f1ca0086-d2d1-41ca-90ee-2ee46f6a4d9a","resolution":{"observed_at":"2026-05-24T00:03:38.986815Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-08-10T13:47:19.187472Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2501.16130","last_updated":"2025-01-30T02:30:24Z","snapshot_observed_at":"2026-08-10T13:40:31.067035Z","submitted_at":"2025-01-27T15:20:41Z","title":"ReFill: Reinforcement Learning for Fill-In Minimization","version":2},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-10T13:47:19.187472Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2501.16130"},"observation_digest":"sha256:a17ad491695bff556f665b0d1fae91c41d38d4e7fb18c29bc55632a1d536dfd2","observation_id":"2d52ba68-c024-4bcd-98f6-fd169585def1","resolution":{"observed_at":"2026-08-10T13:47:19.187472Z","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-08-09T10:38:06.104759Z","title":"An efficient graph convolutional network technique for the travelling salesman problem,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2502.02941","last_updated":"2025-02-05T07:13:43Z","snapshot_observed_at":"2026-08-09T19:53:15.394836Z","submitted_at":"2025-02-05T07:13:43Z","title":"Fast T2T: Optimization Consistency Speeds Up Diffusion-Based Training-to-Testing Solving for Combinatorial Optimization","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-09T10:38:06.104759Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2502.02941"},"observation_digest":"sha256:a84c856830715b0c0cd6b1ec60b3ab34cc0e95d0b59d5c0072f93a1b103d6b50","observation_id":"b9d8df75-e059-49d7-b0f3-d50f384c1503","resolution":{"observed_at":"2026-08-09T10:38:06.104759Z","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-08-08T05:37:08.411866Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2502.08340","last_updated":"2025-02-12T12:07:09Z","snapshot_observed_at":"2026-08-08T11:55:04.721513Z","submitted_at":"2025-02-12T12:07:09Z","title":"Hierarchical Learning-based Graph Partition for Large-scale Vehicle Routing Problems","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-08T05:37:08.411866Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2502.08340"},"observation_digest":"sha256:7018e68de711b66cd8c91766fe1677f3ea787ea88574b2e026a2ef673b945800","observation_id":"18bf46fe-4bde-4b3e-82a6-d2a5797ceab2","resolution":{"observed_at":"2026-08-08T05:37:08.411866Z","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-08-07T14:37:16.834961Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-09T17:30:19.254392Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.834961Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:b51c7edccd7be93d583f4aa2fe26f889e5a1d89ef863cdf74b2732f4e6bd2bc0","observation_id":"9346f039-b7c5-4ead-a49a-d18326e58dc2","resolution":{"observed_at":"2026-08-07T14:37:16.834961Z","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-08-07T05:18:12.694848Z","title":"K., Laurent, T., and Bresson, X","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2506.08424","last_updated":"2025-06-11T06:43:18Z","snapshot_observed_at":"2026-08-09T21:44:28.927152Z","submitted_at":"2025-06-10T03:55:14Z","title":"SHIELD: Multi-task Multi-distribution Vehicle Routing Solver with Sparsity and Hierarchy","version":2},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-08-07T05:18:12.694848Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2506.08424"},"observation_digest":"sha256:3797d437e3e80d4bcd280dfc2526f432e186ac3e03dcde222b2f3df6971dcba5","observation_id":"2b01519a-5248-45cd-a328-35b26cc4a1f7","resolution":{"observed_at":"2026-08-07T05:18:12.694848Z","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-08-05T05:42:52.584945Z","title":"Joshi, Thomas Laurent, and Xavier Bresson","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2509.05084","last_updated":"2025-09-05T13:22:42Z","snapshot_observed_at":"2026-08-10T01:44:32.327065Z","submitted_at":"2025-09-05T13:22:42Z","title":"Recurrent State Encoders for Efficient Neural Combinatorial Optimization","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-05T05:42:52.584945Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2509.05084"},"observation_digest":"sha256:829f53639f8e85d724d34c78df2672fee47990d7fa3f16d4c70d05d3d786dd14","observation_id":"c08f337f-87ae-45f5-9791-92e5891e6ff4","resolution":{"observed_at":"2026-08-05T05:42:52.584945Z","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-08-04T14:42:33.802192Z","title":"Chaitanya K","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2509.24256","last_updated":"2026-07-13T05:58:29Z","snapshot_observed_at":"2026-08-09T11:06:42.766870Z","submitted_at":"2025-09-29T04:05:48Z","title":"Graph Optimization Foundation Model: Tokenizing Graph via A Language-Model Paradigm","version":2},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-04T14:42:33.802192Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2509.24256"},"observation_digest":"sha256:4e2719f0d3a904d62a5a317dd3269715a634bc1a543e840ee49901c51fb92cfd","observation_id":"edc57c24-3e92-44bd-96b9-8ab14dac7f60","resolution":{"observed_at":"2026-08-04T14:42:33.802192Z","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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2510.20169","last_updated":"2026-04-15T11:23:02Z","snapshot_observed_at":"2026-08-03T00:06:51.537094Z","submitted_at":"2025-10-23T03:30:18Z","title":"Empowering Targeted Neighborhood Search via Hyper Tour for Large-Scale TSP","version":3},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-05-18T04:17:36.406949Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2510.20169"},"observation_digest":"sha256:ef1d112c3bed032f7566e6a2dd8d44caaa3c09a127539579c2f0f867fabce261","observation_id":"3b9b8820-1ce6-4201-a5b4-cd8d94d57b39","resolution":{"observed_at":"2026-05-18T04:20:52.263246Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-08-04T06:54:15.840674Z","title":"K., Cappart, Q., Rousseau, L","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2511.05872","last_updated":"2025-11-08T06:16:11Z","snapshot_observed_at":"2026-08-10T03:56:08.929325Z","submitted_at":"2025-11-08T06:16:11Z","title":"Adaptation and Fine-tuning with TabPFN for Travelling Salesman Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-04T06:54:15.840674Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2511.05872"},"observation_digest":"sha256:3b546966c2178bbb2dbad201269145f0f7dc0dadb7401859adadde904c1f9ca7","observation_id":"b5d4886a-2631-48f9-a4a3-bf0cbc4c3069","resolution":{"observed_at":"2026-08-04T06:54:15.840674Z","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-08-03T09:36:03.629370Z","title":"An efficient graph convolutional network technique for the travelling salesman problem.arXiv preprint arXiv:1906.01227,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2601.13465","last_updated":"2026-07-03T21:44:01Z","snapshot_observed_at":"2026-08-07T00:53:06.276907Z","submitted_at":"2026-01-19T23:40:08Z","title":"Graph Neural Networks are Heuristics","version":4},"reference_index":2017,"source":"pdf_text","source_observed_at":"2026-08-03T09:36:03.629370Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2601.13465"},"observation_digest":"sha256:efb685ef0bb3e7d2d066b87468fdb29493fdd697666bbba9d48773f20adb45fe","observation_id":"29c2dc76-11e2-4ff7-9232-373776a2df18","resolution":{"observed_at":"2026-08-03T09:36:03.629370Z","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-08-02T23:08:06.454299Z","title":null,"venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2602.14772","last_updated":"2026-06-24T08:19:42Z","snapshot_observed_at":"2026-08-09T22:54:30.368000Z","submitted_at":"2026-02-16T14:26:25Z","title":"Learning Structural Hardness for Combinatorial Auctions: Instance-Dependent Algorithm Selection via Graph Neural Networks","version":2},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-02T23:08:06.454299Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2602.14772"},"observation_digest":"sha256:de77c0000e935c1a0aa27f10249223ee2c48b31bd55f83b2f41aa1b181b0f488","observation_id":"8cae7865-2fc0-420e-98e2-05dcc362ab98","resolution":{"observed_at":"2026-08-02T23:08:06.454299Z","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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2604.20236","last_updated":"2026-06-11T14:50:16Z","snapshot_observed_at":"2026-08-03T02:41:15.764656Z","submitted_at":"2026-04-22T06:40:05Z","title":"Machine Learning-based Two-Stage Graph Sparsification for the Travelling Salesman Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-05-10T01:12:53.472283Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2604.20236"},"observation_digest":"sha256:bcbb0ebe242a38840d4f2864e17cae0764b5f05504f20b6fcb51b5ff0ee9b922","observation_id":"baa1e8b0-e5ff-47c2-845b-43f94ae32518","resolution":{"observed_at":"2026-05-11T13:41:09.253398Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.17539","last_updated":"2026-05-19T03:52:40Z","snapshot_observed_at":"2026-07-06T23:28:30.942078Z","submitted_at":"2026-05-17T16:47:31Z","title":"Memory-Guided Tree Search with Cross-Branch Knowledge Transfer for LLM Solver Synthesis","version":2},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-05-20T12:36:34.903007Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.17539"},"observation_digest":"sha256:749a548073fcc16d042acf4986db137b40076e0a1d570a09fb4a7e59b0101753","observation_id":"4333086e-281d-4213-97f3-f826363b21e9","resolution":{"observed_at":"2026-05-20T12:38:16.825567Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.19119","last_updated":"2026-05-18T21:11:03Z","snapshot_observed_at":"2026-08-07T18:29:28.977996Z","submitted_at":"2026-05-18T21:11:03Z","title":"GOAL: Graph-based Objective-Aligned Diffusion Solvers for Dynamic Multi-Objective Optimization","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-05-20T07:14:39.757279Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.19119"},"observation_digest":"sha256:37da343a6f474485ebb3b46bd23932ffa3da74fb6892c95f2b78e1f7207467db","observation_id":"2ec13765-b16e-4da9-b0f7-810dc70cc49b","resolution":{"observed_at":"2026-05-20T07:18:07.117362Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.23395","last_updated":"2026-05-25T08:06:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-22T09:04:14Z","title":"Convex Compositional Reasoning Models","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-05-25T05:11:31.879013Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.23395"},"observation_digest":"sha256:78260f1b58a9c9d93a6bd6873b55e66c044a88f5de43466b52459c9fece38844","observation_id":"c7528c1d-fcfc-44c6-a55a-87659a272ec8","resolution":{"observed_at":"2026-05-25T05:15:22.566333Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.23395","last_updated":"2026-05-25T08:06:16Z","snapshot_observed_at":"2026-07-06T02:11:23.670680Z","submitted_at":"2026-05-22T09:04:14Z","title":"Convex Compositional Reasoning Models","version":2},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-06-30T16:17:11.905398Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.23395"},"observation_digest":"sha256:49c997c719b1daad315ed849e80feadc2ffa22bcf94f99bf87abdf0b1632d2b7","observation_id":"d62ef28b-f11a-45a5-b018-ed7b040cc760","resolution":{"observed_at":"2026-06-30T16:24:56.911380Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.24484","last_updated":"2026-05-23T09:12:42Z","snapshot_observed_at":"2026-08-08T07:19:31.159844Z","submitted_at":"2026-05-23T09:12:42Z","title":"SPACE: Unifying Symmetric and Asymmetric Routing Problems for Generalist Neural Solver","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-06-30T13:33:20.527303Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.24484"},"observation_digest":"sha256:515c9f6e95fdf1d6fc7060d21f323d2c7ab7915497d93127f6dfcd1c1cc3c0f8","observation_id":"063af3f1-4d79-4079-8f6d-8e2e400a7fd9","resolution":{"observed_at":"2026-06-30T13:34:40.216318Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2605.26776","last_updated":"2026-05-26T09:46:54Z","snapshot_observed_at":"2026-08-07T19:57:42.169811Z","submitted_at":"2026-05-26T09:46:54Z","title":"Towards Generalization-Oriented Models for Vehicle Routing Problems with Mixture-of-Experts","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-06-29T19:46:55.148691Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2605.26776"},"observation_digest":"sha256:c459c422d50efa393f99c52b9b0a223a14ceee2b8738e1ab0f1fd150bc9b665b","observation_id":"9545370f-e7e3-44f3-ac6f-1cbbff1fb619","resolution":{"observed_at":"2026-06-29T19:53:55.825864Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.02294","last_updated":"2026-06-01T14:16:18Z","snapshot_observed_at":"2026-08-06T02:40:12.407253Z","submitted_at":"2026-06-01T14:16:18Z","title":"Regularized Large Neighborhood Search","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-06-28T15:15:11.130848Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.02294"},"observation_digest":"sha256:c9774eb4f8c80971eecf48490dc0d555435a9734f64f157b44a248dc35d1ff52","observation_id":"95f90e69-3d0e-4cd2-b692-cf17dd281e7b","resolution":{"observed_at":"2026-06-28T15:22:19.741716Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.10431","last_updated":"2026-06-09T05:15:25Z","snapshot_observed_at":"2026-08-07T18:30:09.302924Z","submitted_at":"2026-06-09T05:15:25Z","title":"Vision-Assisted Foundation Model for Solving Multi-Task Vehicle Routing Problems","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-06-27T14:14:50.580212Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.10431"},"observation_digest":"sha256:ff331a806274cf7c820a3a90ca1037785c7bb28f100e49466d15552f43c09609","observation_id":"af90e4af-1572-4f57-9157-af855e259c85","resolution":{"observed_at":"2026-07-03T04:07:36.626235Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.19185","last_updated":"2026-06-17T15:24:37Z","snapshot_observed_at":"2026-08-08T05:43:23.884916Z","submitted_at":"2026-06-17T15:24:37Z","title":"AGDN: Learning to Solve Traveling Salesman Problem with Anisotropic Graph Diffusion Network","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-06-26T21:29:20.129182Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.19185"},"observation_digest":"sha256:a3fb426c46ac6ab929010fb2c933f9398c0c568a8559640abb58d16411583c05","observation_id":"7e8b34f6-cee3-464c-adb3-509606054516","resolution":{"observed_at":"2026-07-04T00:09:14.409503Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.22776","last_updated":"2026-07-17T14:11:14Z","snapshot_observed_at":"2026-08-09T15:47:22.338082Z","submitted_at":"2026-06-22T02:31:22Z","title":"GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-06-26T09:27:40.182940Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.22776"},"observation_digest":"sha256:b516150313b889b8102344296bac4b6e9b793977bb5405d42937e1cad2966777","observation_id":"e4823f8e-42ba-4daa-913c-64192c2c440a","resolution":{"observed_at":"2026-07-04T09:49:44.518376Z","resolver_source":"arxiv_id","status":"metadata_mismatch"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-08-02T10:33:25.079875Z","title":"Joshi, Thomas Laurent, and Xavier Bresson","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2606.22776","last_updated":"2026-07-17T14:11:14Z","snapshot_observed_at":"2026-08-09T15:47:22.338082Z","submitted_at":"2026-06-22T02:31:22Z","title":"GeoRouteNet: A Geometry-Aware Non-Autoregressive Neural Solver for the Euclidean Traveling Salesman Problem","version":2},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-02T10:33:25.079875Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.22776"},"observation_digest":"sha256:adb4ff5ab32b4374aa3f94cb66e2c4a92d42e9e6fe979d4d8dd8bef45259fd14","observation_id":"569d6f40-eadd-4aee-b357-a5d772c5f53f","resolution":{"observed_at":"2026-08-02T10:33:25.079875Z","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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.26873","last_updated":"2026-06-25T10:58:29Z","snapshot_observed_at":"2026-07-07T00:01:10.711037Z","submitted_at":"2026-06-25T10:58:29Z","title":"Scalable Message-Passing Quantum Graph Neural Networks in the Weisfeiler-Leman Hierarchy","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-06-26T04:56:56.361617Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.26873"},"observation_digest":"sha256:41dde94dee6b1d7a85c935ac9549b302ba62fd75498cb8f838176a8f9627ea91","observation_id":"1e2468c2-b97a-47ad-895b-3d3da1b90884","resolution":{"observed_at":"2026-07-04T13:49:51.208022Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2606.29725","last_updated":"2026-06-29T03:05:58Z","snapshot_observed_at":"2026-08-08T16:07:35.935209Z","submitted_at":"2026-06-29T03:05:58Z","title":"Optimizing Nursing Care Taxi Dispatch Leveraging Integer Linear Programming Solvers and Machine Learning","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-06-30T07:39:35.373726Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2606.29725"},"observation_digest":"sha256:1936bc022f8e87c3bea6dc85823ffc1a7b74f3d97049fad9b7e0bd1817a7d1cd","observation_id":"562e9b16-df6e-4849-a36d-bd99498e0fb8","resolution":{"observed_at":"2026-06-30T07:44:21.941326Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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":"1906.01227","doi":"10.48550/arxiv.1906.01227","metadata_source":"arxiv_reference","pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"An efficient graph convolutional network technique for the travelling salesman problem","venue":"arXiv (Cornell University)","work_id":"0f1c5a45-cd76-4c8e-9fa5-8eabcff91de7","year":1906},"citing_paper":{"arxiv_id":"2607.01185","last_updated":"2026-07-01T17:17:55Z","snapshot_observed_at":"2026-08-07T15:00:43.360697Z","submitted_at":"2026-07-01T17:17:55Z","title":"Neural Certificate Pricing for Combinatorial Optimization Problems","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-02T15:11:43.912523Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.01185"},"observation_digest":"sha256:a924747113d02e34e7298cefef47bf394f6f03e1ed6d3e52de513fe25c0988fb","observation_id":"abf5e3bf-e467-434b-be12-7d0af7d83f13","resolution":{"observed_at":"2026-07-02T15:17:07.327749Z","resolver_source":"arxiv_id","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-10T06:31:04.303077+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"state":"measured"}},{"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-11T23:55:28.923983Z","title":"org/abs/1906.01227","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.03791","last_updated":"2026-07-24T21:53:47Z","snapshot_observed_at":"2026-08-06T09:31:49.020352Z","submitted_at":"2026-07-04T09:43:03Z","title":"TSP with Predictions: Heatmap to Tour with Provable Guarantees","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-11T23:55:28.923983Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.03791"},"observation_digest":"sha256:568c9e2f6193f3696f204d624745bda3ac68394aa95403a5e8dada5cc4f56059","observation_id":"f2f239a8-15f8-40e4-8cab-dce860dc08f6","resolution":{"observed_at":"2026-07-11T23:55:28.923983Z","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-08-02T09:02:58.207638Z","title":"org/abs/1906.01227","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.03791","last_updated":"2026-07-24T21:53:47Z","snapshot_observed_at":"2026-08-06T09:31:49.020352Z","submitted_at":"2026-07-04T09:43:03Z","title":"TSP with Predictions: Heatmap to Tour with Provable Guarantees","version":2},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-08-02T09:02:58.207638Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.03791"},"observation_digest":"sha256:58b29b70f4812f3ae39f7b8f67716979fe0611e69fe306f7cb378643d1113d03","observation_id":"9e46238f-b8a8-43a1-ab84-3458a82e5118","resolution":{"observed_at":"2026-08-02T09:02:58.207638Z","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-10T08:03:33.200643Z","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:7887dbadb702f5bad767017bbb0c6e50f43e366221223615ee75d6475e52564f","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":{"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-08-01T17:18:09.677845Z","title":"Joshi, Thomas Laurent, and Xavier Bresson","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2607.17708","last_updated":"2026-07-20T09:02:11Z","snapshot_observed_at":"2026-08-07T23:50:58.427084Z","submitted_at":"2026-07-20T09:02:11Z","title":"LaT: LLM-as-Trainer for Multi-Task Vehicle Routing Solvers","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-01T17:18:09.677845Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2607.17708"},"observation_digest":"sha256:c3475fb275401af6bf0556a88d105a42ca662e9939c7e6c1ba979b559891067c","observation_id":"6d4dfcbe-e0da-494f-be00-41dd948d1f3e","resolution":{"observed_at":"2026-08-01T17:18:09.677845Z","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-08-04T01:24:24.165800Z","title":"An efficient graph con- volutional network technique for the travelling salesman problem,","venue":null,"work_id":null,"year":1906},"citing_paper":{"arxiv_id":"2608.00648","last_updated":"2026-08-01T13:08:16Z","snapshot_observed_at":"2026-08-06T23:17:34.690341Z","submitted_at":"2026-08-01T13:08:16Z","title":"MDGAM-Based Cooperative Task Scheduling for Communication-Constrained Distributed Multi-Agent Systems","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-04T01:24:24.165800Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2608.00648"},"observation_digest":"sha256:f6b181df15d427699a26f07e3699d41f186ff73c996176e270bdd5d986fdecb6","observation_id":"e0a18bf4-6dcb-4e54-b919-d59f0ff8b81b","resolution":{"observed_at":"2026-08-04T01:24:24.165800Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"links":{"evidence":"/evidence","html":"/paper/1906.01227/citation-record","integrity":"/paper/1906.01227/integrity","json":"/paper/1906.01227/citation-record.json","paper":"/paper/1906.01227"},"outbound":[],"paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","latest_version":2,"primary_category":"cs.LG","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"},"reference_resolution":{"displayed":0,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":0,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":0},"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-10T06:31:04.303077+00:00","source":"crossref"},{"observed_at":"2026-08-10T06:30:57.382061+00:00","source":"retraction_watch"}],"thesis":"As of 10 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 34 inbound Pith citation observations for arXiv:1906.01227."}