{"as_of":"2026-08-09T10:07:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:915f08c29637172aaf5c4ec87cd89fec2a30bfafb20a7ebf9db2565ee33926be","coverage":[{"denominator":77,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":77,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-01T14:53:50.026443Z","state":"measured"},{"denominator":77,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":77,"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.18632/citation-record","integrity":"/paper/2607.18632/integrity","json":"/paper/2607.18632/citation-record.json","paper":"/paper/2607.18632"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-01T14:53:41.110954Z","title":"Encyclopedia of operations research and management science , volume=","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":1,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.110954Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:2bf2601cb8a3267022a443d1cb642e588a8f9be9bf957b0dd89cc80eb66d388e","observation_id":"63772030-c687-4764-adf2-e929d872d32d","resolution":{"observed_at":"2026-08-01T14:53:41.110954Z","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-08-01T14:53:41.193758Z","title":"Proceedings of the AAAI conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":2,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.193758Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:e5f79a7eac20e84961ba550a6d1b6b57b83674b762ee74994e20af14c451c117","observation_id":"169e6269-621c-46c5-b283-9bb8774c04c5","resolution":{"observed_at":"2026-08-01T14:53:41.193758Z","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-08-01T14:53:41.360624Z","title":"Proceedings of the AAAI Conference on Artificial Intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":3,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.360624Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:36701162caa08bdd7db7f9c226452a6b0d3d7e8adecb481f60bf8928c1be8e11","observation_id":"8c7b2987-2792-47b6-a244-23f9027acc4c","resolution":{"observed_at":"2026-08-01T14:53:41.360624Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2501.14285","last_updated":"2025-08-24T09:49:29Z","snapshot_observed_at":"2026-08-07T00:54:43.080021Z","submitted_at":"2025-01-24T06:56:27Z","title":"Cascaded Large-Scale TSP Solving with Unified Neural Guidance: Bridging Local and Population-based Search","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2501.14285","snapshot_observed_at":"2026-08-01T14:53:41.509115Z","title":"arXiv preprint arXiv:2501.14285 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":4,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.509115Z"},"links":{"cited_paper":"/paper/2501.14285","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:f391afe2acaa1a3a166f554eb93a56b2e565e9803c47d7cb2c21c61505606bdd","observation_id":"753604f8-1193-4608-9336-4baaab0e074b","resolution":{"observed_at":"2026-08-01T14:53:41.509115Z","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-08-01T14:53:41.603673Z","title":"Pattern Recognition , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":5,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.603673Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4f61cf8cbe2f1593efb6adda955792823fff355524ab1faf08cddbce14d61bec","observation_id":"820cb268-b9b3-47b8-91ba-daf10273dcfc","resolution":{"observed_at":"2026-08-01T14:53:41.603673Z","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-08-01T14:53:41.749485Z","title":"arXiv preprint arXiv:2509.23465 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":6,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.749485Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:6c4e1a45ebf8fe56bfa543707a15d9330a0d777d99538e36f128294c92222242","observation_id":"0f9f8f76-8754-4140-80ab-780ecdadc76c","resolution":{"observed_at":"2026-08-01T14:53:41.749485Z","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-08-01T14:53:41.882241Z","title":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":7,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.882241Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4bf1650ed7933f8f949bea74ea5043c8b9e258884e7e4672efd67f9cc1871167","observation_id":"a6d825cf-e68c-4a2a-834b-571f24fe2e91","resolution":{"observed_at":"2026-08-01T14:53:41.882241Z","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-08-01T14:53:41.988540Z","title":"Nature Communications , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":8,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:41.988540Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:497e067aba54ecda4d20bfcea841c6c40ef6557db46075a32abcd70520442d8e","observation_id":"daa691ae-64ed-406d-9af4-65f71763a745","resolution":{"observed_at":"2026-08-01T14:53:41.988540Z","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-08-01T14:53:42.092347Z","title":"arXiv preprint arXiv:2504.15147 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":9,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.092347Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:08ba14ce2d2dc2cf8f8d91dcf2dc9b7afd0821dca67ea0fcd5ba519b616e71eb","observation_id":"f3db3bf5-e974-4995-86c2-dfea330ad8ac","resolution":{"observed_at":"2026-08-01T14:53:42.092347Z","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-08-01T14:53:42.231514Z","title":"Neurocomputing , pages=","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":10,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.231514Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:3544fc0faecbffe6dbb204cfaf2a00b4851216951cff3f22fa11b4681ed7ad4b","observation_id":"a4d64ed9-563d-4e7e-8947-ac3ac520969d","resolution":{"observed_at":"2026-08-01T14:53:42.231514Z","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-08-01T14:53:42.342977Z","title":"2025 RIVF International Conference on Computing and Communication Technologies (RIVF) , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":11,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.342977Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:45b39fdd4b16742021cd0ffdb4df545b6f7d9e4c720ba020d167f42a5be447bf","observation_id":"3c5b6a7c-0cc5-4722-a3bb-1b7c93eaea20","resolution":{"observed_at":"2026-08-01T14:53:42.342977Z","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-08-01T14:53:42.544681Z","title":"Journal of Statistical Software , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":12,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.544681Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:379c50b7a42255d4e91d6c7d41f7a96d168b923c5c09a96c6648ca0dcc489aaa","observation_id":"38b859ca-8cb0-4722-a3b2-ee6c3b8d3a0e","resolution":{"observed_at":"2026-08-01T14:53:42.544681Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1806.09285","last_updated":"2018-06-25T04:48:34Z","snapshot_observed_at":"2026-07-06T06:46:32.717122Z","submitted_at":"2018-06-25T04:48:34Z","title":"A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1806.09285","snapshot_observed_at":"2026-08-01T14:53:42.670857Z","title":"arXiv preprint arXiv:1806.09285 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":13,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.670857Z"},"links":{"cited_paper":"/paper/1806.09285","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:95125e7b4c6bb7e87ee9158b3ec732475636b1954c99d107b7ee3ec44462466e","observation_id":"ebb3fb43-1f25-416b-b23b-64b876225988","resolution":{"observed_at":"2026-08-01T14:53:42.670857Z","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-08-01T14:53:42.788570Z","title":"URL: http://comopt","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":14,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.788570Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:09eade696c3389106083fc781f2a2246de143af8ae19bbe337c8ca7be55da6c6","observation_id":"8e468dd1-3137-4313-b352-91b87ea90bd1","resolution":{"observed_at":"2026-08-01T14:53:42.788570Z","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-08-01T14:53:42.841824Z","title":"ORSA journal on computing , volume=","venue":null,"work_id":null,"year":1991},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":15,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:42.841824Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:aaa206264f803780ca291d3a451ebca5abc61fe8ff39fe2ed76db7bb5a25111d","observation_id":"c9d8c807-0339-4687-bb21-307fbdf4bb09","resolution":{"observed_at":"2026-08-01T14:53:42.841824Z","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-08-01T14:53:43.022134Z","title":"2007 International Conference on Machine Learning and Cybernetics , volume=","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":16,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.022134Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:ffc4cc00d31412fe3dfde42a7ef7931cfd9a33242a4d3a0af62a052cf4eb0aa8","observation_id":"59e519df-c5a8-42cb-855e-73ab7cd4472f","resolution":{"observed_at":"2026-08-01T14:53:43.022134Z","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-08-01T14:53:43.183130Z","title":"Proceedings of the Genetic and Evolutionary Computation Conference , pages=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":17,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.183130Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:6d7c855ad7d454ae552caf3d075ac1df30ed8b8a2f7fad06126c9326177cd51e","observation_id":"c68352f4-a9eb-42ef-a2df-66e82f4e5baa","resolution":{"observed_at":"2026-08-01T14:53:43.183130Z","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-08-01T14:53:43.272713Z","title":"Asian conference on machine learning , pages=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":18,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.272713Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:0f4c9422c72eebc45642998f72c14e5453a2774149e16a19a383fd4a702db489","observation_id":"7153e5c6-46ea-4403-a6d5-9e5f3363a9d1","resolution":{"observed_at":"2026-08-01T14:53:43.272713Z","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-08-01T14:53:43.387352Z","title":"arXiv preprint arXiv:1611.09940 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":19,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.387352Z"},"links":{"cited_paper":"/paper/1611.09940","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:c843bef222e3d560907a68482a448093d536cf85ade4a48a56cc908082f1c809","observation_id":"567d5981-0ed9-4197-a858-5d4af81079f9","resolution":{"observed_at":"2026-08-01T14:53:43.387352Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1803.08475","last_updated":"2019-02-07T09:10:08Z","snapshot_observed_at":"2026-07-06T06:29:42.428021Z","submitted_at":"2018-03-22T17:22:24Z","title":"Attention, Learn to Solve Routing Problems!","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1803.08475","snapshot_observed_at":"2026-08-01T14:53:43.505270Z","title":"arXiv preprint arXiv:1803.08475 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":20,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.505270Z"},"links":{"cited_paper":"/paper/1803.08475","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:dbb490e661a97cd8269a5fc20302a8d6b10bc2be4cf51e0133e731d03f6bb428","observation_id":"9aa5abaf-39eb-4c29-91c3-58b0cb28b4a4","resolution":{"observed_at":"2026-08-01T14:53:43.505270Z","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-08-01T14:53:43.579792Z","title":"2006 , publisher =","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":21,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.579792Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:cda2ed6e0d730508bc4b9442c815b04837e751e7f737f6bee019ea0465582fe0","observation_id":"0921123a-2f11-4cb3-9a9b-a981d61cb284","resolution":{"observed_at":"2026-08-01T14:53:43.579792Z","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-08-01T14:53:43.687546Z","title":"INFORMS Journal on Computing , volume =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":22,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.687546Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:7bac994321f7981a3e6c63908553f0665a1b8e14c085a5f652fa57bfb98c6ef6","observation_id":"cc113e98-3dda-46ea-8bea-220775db63fc","resolution":{"observed_at":"2026-08-01T14:53:43.687546Z","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-08-01T14:53:43.813662Z","title":"Advances in computers , volume=","venue":null,"work_id":null,"year":1976},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":23,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.813662Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:0767e511e5b879b7f14f759094cb8927238713a6c05e018eaaf6af8f4a15279e","observation_id":"72e3aa9b-aa2d-40ee-95dd-2d7dfb1c4eb0","resolution":{"observed_at":"2026-08-01T14:53:43.813662Z","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-08-01T14:53:43.988068Z","title":"AI Magazine , volume =","venue":null,"work_id":null,"year":2014},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":24,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:43.988068Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:daf7df49f59c9610e011559a37d43c0d2b795758b2516fd8125a9b0f07e35b9f","observation_id":"b3103d11-9d83-49a1-af7e-7cecf1e54f71","resolution":{"observed_at":"2026-08-01T14:53:43.988068Z","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-08-01T14:53:44.130181Z","title":"Journal of artificial intelligence research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":25,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.130181Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:1cbd7ff8264e0c5f0f06ef1642bd0ef4eeeba14ffc28c5471a46c809ef1d00d9","observation_id":"98301985-13fe-4963-bb9b-188d530af857","resolution":{"observed_at":"2026-08-01T14:53:44.130181Z","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-08-01T14:53:44.245343Z","title":"IEEE transactions on neural networks , volume=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":26,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.245343Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:e20481afd0c01901c381581d641bdd4ed7fd43212e101b2fb17915c121fbc2a4","observation_id":"b70283e2-e176-43ad-91c4-6e162a1a1133","resolution":{"observed_at":"2026-08-01T14:53:44.245343Z","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-08-01T14:53:44.327053Z","title":"IEEE transactions on neural networks and learning systems , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":27,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.327053Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:fa6b1346a73af63196307c478ad414e42e9d332bea36e4a4520a73dfab7bab93","observation_id":"6b8d658b-ff56-4faa-841b-d7ff7aa5aba1","resolution":{"observed_at":"2026-08-01T14:53:44.327053Z","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-08-01T14:53:44.387285Z","title":"Artificial Intelligence , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":28,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.387285Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:7d110c850701ea491946a0466290b437c0c32562b04a1dad43797e895f5d99ae","observation_id":"802d6290-7a24-4092-92ab-776f799768e5","resolution":{"observed_at":"2026-08-01T14:53:44.387285Z","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-08-01T14:53:44.487614Z","title":"Ieee Access , volume=","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":29,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.487614Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:2fbd05f3cea17588cf627a184dbd2d9ccc55989a1a013224812f569b963f00d2","observation_id":"3833983c-9153-4e25-934d-e42028dd2537","resolution":{"observed_at":"2026-08-01T14:53:44.487614Z","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-08-01T14:53:44.606087Z","title":"Distill , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":30,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.606087Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:14bf3f27f6fbcfd6e0b2272ed6c5b8f7f0751ace97ccd92085e9bab4126b1621","observation_id":"675410d3-39f6-4f4f-ac6b-5ea063a136f1","resolution":{"observed_at":"2026-08-01T14:53:44.606087Z","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-08-01T14:53:44.775474Z","title":"arXiv preprint , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":31,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.775474Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:b4961bbde62dd0129e65226bf5bf197658d1fd358c01ae59a4b8b9eb89a777ab","observation_id":"9f9b826a-acff-43c7-823f-c23803ed9d21","resolution":{"observed_at":"2026-08-01T14:53:44.775474Z","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-08-01T14:53:44.940340Z","title":"Journal of Heuristics , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":32,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:44.940340Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9e4bcd8131c04e4520864e6f99625110190e7018de77a1b69c682ebd6bb467c4","observation_id":"e04b2095-e3da-4c47-b9ce-f5fa5e981fd3","resolution":{"observed_at":"2026-08-01T14:53:44.940340Z","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-08-01T14:53:45.056939Z","title":"arXiv preprint , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":33,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.056939Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:cffdd87b3d4ac1523d79db0d14eb299fd6ff64454ca38cce51cd9687fc96f48e","observation_id":"16417fc3-d652-45d5-89f0-2926903a213b","resolution":{"observed_at":"2026-08-01T14:53:45.056939Z","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-08-01T14:53:45.124041Z","title":"Advances in computers , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":34,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.124041Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:5fef91209f2ef65eb94f056b194df521a7500fb40b3b62c9f3bb0e55ecc87507","observation_id":"bc76db81-a295-4963-8d27-7bac431154e9","resolution":{"observed_at":"2026-08-01T14:53:45.124041Z","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-08-01T14:53:45.231785Z","title":"2021 , url=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":35,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.231785Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:ba4d6b5858a3bfc0bbd65ad4c95c756ffcb430245ba0e6bbaa919e70c95c0852","observation_id":"49bae4b6-7ff6-42ca-8a7e-864201de3f59","resolution":{"observed_at":"2026-08-01T14:53:45.231785Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2110.05291","last_updated":"2022-04-04T23:11:00Z","snapshot_observed_at":"2026-07-06T11:56:34.288687Z","submitted_at":"2021-10-11T14:06:08Z","title":"Graph Neural Network Guided Local Search for the Traveling Salesperson Problem","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2110.05291","snapshot_observed_at":"2026-08-01T14:53:45.283790Z","title":"arXiv preprint arXiv:2110.05291 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":36,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.283790Z"},"links":{"cited_paper":"/paper/2110.05291","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:c61f18714fe1a2873f722a19cb7e7dad66631274b2e7432593a7af83e4f199b4","observation_id":"d3beaf76-73ab-4c1e-838d-c732b674f6fb","resolution":{"observed_at":"2026-08-01T14:53:45.283790Z","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-08-01T14:53:45.400978Z","title":"Advances in Neural Information Processing Systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":37,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.400978Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4ad2f03d8c55bf3db3083c863dff17c15510d60f40205f71652b47c7446f19bf","observation_id":"db949dc4-c9b1-4992-ac58-789cf4a0e716","resolution":{"observed_at":"2026-08-01T14:53:45.400978Z","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-08-01T14:53:45.463672Z","title":"International Conference on Algorithmic Aspects in Information and Management , pages=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":38,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.463672Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:2dcf0d74cb7f5c6479b90b9d28144dbb83333c8935182a88020829d166e4565e","observation_id":"9bbdb312-3a5a-4ba6-9c4f-9ce8f6d41aec","resolution":{"observed_at":"2026-08-01T14:53:45.463672Z","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-08-01T14:53:45.561826Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":39,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.561826Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:5bba88323bd68de28e83429a239c88a71126934bd981e1b3740c4c6e7ef7072c","observation_id":"4c548f35-1289-4e78-b0a7-1cbcabef7c13","resolution":{"observed_at":"2026-08-01T14:53:45.561826Z","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-08-01T14:53:45.759002Z","title":"Advances in neural information processing systems , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":40,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.759002Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:48162933f1ddc846831c03e0515b94564eea3c3967c91b94044fea3c61dc9b3c","observation_id":"4f0e68b0-e964-4d8e-af41-c243269f97af","resolution":{"observed_at":"2026-08-01T14:53:45.759002Z","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-08-01T14:53:45.903545Z","title":"AI Open , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":41,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:45.903545Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:a6d39fad9f58ce4754e097469a06d5bc13ab048b82ed2ebc97e1c0e8a9adad30","observation_id":"7a7f48a9-1931-48d0-8a84-f17fa4dc470a","resolution":{"observed_at":"2026-08-01T14:53:45.903545Z","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-08-01T14:53:46.052908Z","title":"arXiv preprint , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":42,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.052908Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:84939a9dffc2f5790aa79e50a32dc18d4fc8e9372112458d8960dbd24c21c1ca","observation_id":"62b714b9-8cc4-4e6e-baa3-1b8111c87e65","resolution":{"observed_at":"2026-08-01T14:53:46.052908Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2103.14807","last_updated":"2021-03-27T04:47:59Z","snapshot_observed_at":"2026-08-05T09:15:51.537038Z","submitted_at":"2021-03-27T04:47:59Z","title":"An Introduction to Robust Graph Convolutional Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2103.14807","snapshot_observed_at":"2026-08-01T14:53:46.167846Z","title":"arXiv preprint arXiv:2103.14807 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":43,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.167846Z"},"links":{"cited_paper":"/paper/2103.14807","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:a112c6bf75edbaaffd2c2dcc526197b36496278f3d37ae237cb57d5dfd856ae2","observation_id":"e4f91d6c-ae03-4e3a-a36e-67fd6d887687","resolution":{"observed_at":"2026-08-01T14:53:46.167846Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2404.13079","last_updated":"2024-04-16T07:27:49Z","snapshot_observed_at":"2026-08-06T03:09:54.343894Z","submitted_at":"2024-04-16T07:27:49Z","title":"Relational Graph Convolutional Networks for Sentiment Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2404.13079","snapshot_observed_at":"2026-08-01T14:53:46.280482Z","title":"arXiv preprint arXiv:2404.13079 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":44,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.280482Z"},"links":{"cited_paper":"/paper/2404.13079","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:6f934418ba8298df121a0abf8bd3903f5c2de147121c85a3a5bf03a7f99d2746","observation_id":"d9a39d9b-3df1-4135-82fb-6133de5c2859","resolution":{"observed_at":"2026-08-01T14:53:46.280482Z","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-08-01T14:53:46.373339Z","title":"Future Internet , volume=","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":45,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.373339Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:80dd30f9bd29d3d8f85008f45e6b0145c597f9c94116d6b45d21374165155437","observation_id":"ff171d17-ac25-4516-a450-c4675f4a913a","resolution":{"observed_at":"2026-08-01T14:53:46.373339Z","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-08-01T14:53:46.462206Z","title":"arXiv preprint , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":46,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.462206Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4e9804f5610fe04ab6de7ac15e4dab8bf2e3a5ca9dbd2aec8400ae38dfb87242","observation_id":"b1865624-51d3-4870-9563-ad29d403f6c9","resolution":{"observed_at":"2026-08-01T14:53:46.462206Z","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-08-01T14:53:46.610253Z","title":"Expert Systems With Applications , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":47,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.610253Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:d77e9848c3080d3f2580ec2730347c8ee8437f04775aa83371d6961d5bc28af5","observation_id":"010daba8-a325-4f42-8cdf-a8161b65bcd6","resolution":{"observed_at":"2026-08-01T14:53:46.610253Z","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-08-01T14:53:46.737782Z","title":"European Journal of Operational Research , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":48,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.737782Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:0591c968df7f91558c337f03cc4f83b47187d6d690e2fda45ce4de6478f994a9","observation_id":"da01717e-20b8-4e76-9666-57b2ea10d078","resolution":{"observed_at":"2026-08-01T14:53:46.737782Z","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-08-01T14:53:46.913687Z","title":"IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) , volume=","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":49,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:46.913687Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:c574842ec97b82fc0bed6e6c27a1c8ff4c3a24242d5d2f0f470d2a8c9f6b712a","observation_id":"8560888b-b914-43f2-b010-f6efb18386d8","resolution":{"observed_at":"2026-08-01T14:53:46.913687Z","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-08-01T14:53:47.032843Z","title":"INFORMS Journal on Computing , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":50,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.032843Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:95fa7ef8bccbb6f24d82aa2fce0976fb97aa51f27da994d1a3cffb958762dc6d","observation_id":"1cb4e05b-e710-40e3-be5e-a2e9de3c7f68","resolution":{"observed_at":"2026-08-01T14:53:47.032843Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2302.04035","last_updated":"2023-02-08T13:14:20Z","snapshot_observed_at":"2026-08-04T18:25:32.911992Z","submitted_at":"2023-02-08T13:14:20Z","title":"Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2302.04035","snapshot_observed_at":"2026-08-01T14:53:47.121471Z","title":"arXiv preprint arXiv:2302.04035 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":51,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.121471Z"},"links":{"cited_paper":"/paper/2302.04035","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:7dc6030aae02d5df281e723a620a8943bbffc2644158ca8bb1e512e634b4b304","observation_id":"9612a321-696e-4c81-a0ee-4fda2ff7dae7","resolution":{"observed_at":"2026-08-01T14:53:47.121471Z","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-08-01T14:53:47.204229Z","title":"17th International Conference on Agents and Artificial Intelligence, ICAART 2025 , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":52,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.204229Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:96722e57fa96362d98aaf55a576a383894c42e1e416becee941b3546c90653d1","observation_id":"f69987da-b551-4870-9e07-ae3fac463921","resolution":{"observed_at":"2026-08-01T14:53:47.204229Z","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-08-01T14:53:47.319419Z","title":"International Conference on Learning and Intelligent Optimization , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":53,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.319419Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:83417978b6a75adaf2641ce3322605e1bed2b6681b84138ec41f5f5d449b2ab0","observation_id":"3f271e34-1f6e-4cbc-bd6c-2024b1169d72","resolution":{"observed_at":"2026-08-01T14:53:47.319419Z","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-08-01T14:53:47.485095Z","title":"Applied Soft Computing , pages=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":54,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.485095Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:7bdc0e72cfaa37f3f010383dc16595c855ebeea1446694e4ba06ea57d1cc00dc","observation_id":"2e633bdf-02bb-4f2a-bbc1-bb48c05fa98e","resolution":{"observed_at":"2026-08-01T14:53:47.485095Z","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-08-01T14:53:47.684788Z","title":"arXiv preprint arXiv:2509.26377 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":55,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.684788Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9c0c6593e666a797ea9d649db1efc086ebedd24856471c36bb00eb3c34f8f838","observation_id":"51350d2f-fb89-470f-923e-117532834c01","resolution":{"observed_at":"2026-08-01T14:53:47.684788Z","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-08-01T14:53:47.764433Z","title":"Biometrics bulletin , volume=","venue":null,"work_id":null,"year":1945},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":56,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.764433Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4624ef2bd20ab0ff65ebad48ef93d31f48c1717da4fb8709ba90781183287ccb","observation_id":"f1b61b14-d66c-417d-9bd1-2a94b80bdc39","resolution":{"observed_at":"2026-08-01T14:53:47.764433Z","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-08-01T14:53:47.900645Z","title":"com: A tool for life science researchers for multiple hypothesis testing correction , author=","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":57,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:47.900645Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:28e1908a3af17215d26aea8c60120759494e350693081130b6cb65cce711fb7c","observation_id":"a2b39b12-e460-4dae-b8d0-6b9131ba7d21","resolution":{"observed_at":"2026-08-01T14:53:47.900645Z","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-08-01T14:53:48.029396Z","title":"Scandinavian journal of statistics , pages=","venue":null,"work_id":null,"year":1979},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":58,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.029396Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:b6164bd7db391cc8466e7ef4fc01cdbc001a35e612becedd40963316bbecbf13","observation_id":"0720c07c-6ce9-45f9-80f5-dcc6334a21e1","resolution":{"observed_at":"2026-08-01T14:53:48.029396Z","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-08-01T14:53:48.126505Z","title":"Proceedings of the aaai conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":59,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.126505Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9aa04a027780d050c708f3f5854d69394c119bf76f83ea45a24dd40068d6a8b0","observation_id":"c72177ff-845c-44db-b3dc-06dc19dedc24","resolution":{"observed_at":"2026-08-01T14:53:48.126505Z","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-08-01T14:53:48.201817Z","title":"Proceedings of the AAAI conference on artificial intelligence , volume=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":60,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.201817Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:4dbde78b15ac39e0eaf31599c274ef8ecba65322645937b497a3c8a8a2c577ef","observation_id":"99f5215d-fce9-4de9-b043-3ee6cc5b1b88","resolution":{"observed_at":"2026-08-01T14:53:48.201817Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2006.10637","last_updated":"2020-10-09T11:39:32Z","snapshot_observed_at":"2026-08-07T10:11:23.671536Z","submitted_at":"2020-06-18T16:06:18Z","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","version":3},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2006.10637","snapshot_observed_at":"2026-08-01T14:53:48.297100Z","title":"arXiv preprint arXiv:2006.10637 , year=","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":61,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.297100Z"},"links":{"cited_paper":"/paper/2006.10637","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:25056e4bf3314213736b7b58be122bfc11b71a64657f2f43f149f755e5d211ca","observation_id":"8a1300cf-1863-4acf-b224-15799609b966","resolution":{"observed_at":"2026-08-01T14:53:48.297100Z","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-08-01T14:53:48.387806Z","title":"Evolutionary computation , volume=","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":62,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.387806Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:b09eb5e63554f03bfd5773669f5a15e6243fe7d95e7674c8b3cf4d7ef2ca5c07","observation_id":"6d60daeb-3829-4e2d-93e6-31b7a39892a2","resolution":{"observed_at":"2026-08-01T14:53:48.387806Z","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-08-01T14:53:48.563682Z","title":"Journal of Heuristics , volume=","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":63,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.563682Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:0cea08dd879bf6d45c5b9c9023a215766ebda57b13e73c0bf152b66faecd0a26","observation_id":"4939581f-0c17-4d24-91ab-192acf94f9b3","resolution":{"observed_at":"2026-08-01T14:53:48.563682Z","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-08-01T14:53:48.663063Z","title":"IEEE Transactions on Evolutionary Computation , volume=","venue":null,"work_id":null,"year":1997},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":64,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.663063Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9313bb7479301181e70d934fa3e28f558c607171bacb2b8f712cba62954e1eeb","observation_id":"02c745e9-9832-4465-9a22-a78496384d54","resolution":{"observed_at":"2026-08-01T14:53:48.663063Z","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-08-01T14:53:48.841148Z","title":"Artificial Intelligence Review , volume=","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":65,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.841148Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:dac1091d924a9adda6176aef7270b53fc642b9f74be961c7af54f7e3d3412359","observation_id":"c2859594-0b82-445c-82e2-d5c06f0ea77f","resolution":{"observed_at":"2026-08-01T14:53:48.841148Z","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-08-01T14:53:48.993643Z","title":"Artificial Intelligence , volume=","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":66,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:48.993643Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:46ec0093ec2753f5a230988f3328cd1eb516379dfa6357403830fd30f1dab37b","observation_id":"4add8518-07f8-439c-9b04-5a95e221fcbf","resolution":{"observed_at":"2026-08-01T14:53:48.993643Z","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-08-01T14:53:49.079702Z","title":"Proceedings of the 9th Learning and Intelligent OptimizatioN Conference (LION) , volume =","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":67,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.079702Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:a4bc0062896c0664fcc8a5f2e886d88c3d01421807f9ff4bf549b833ebd46969","observation_id":"0b2c4d33-f823-4f07-b5ff-8bbc86cebd4c","resolution":{"observed_at":"2026-08-01T14:53:49.079702Z","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-08-01T14:53:49.142929Z","title":"IEEE Congress on Evolutionary Computation (CEC) , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":68,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.142929Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:99247de18d6cb9c83a5a058c76ac3df65df666dd5549d773394615b3b85e0fac","observation_id":"179986da-ad87-4291-91e5-1cd57b5be3dc","resolution":{"observed_at":"2026-08-01T14:53:49.142929Z","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-08-01T14:53:49.223077Z","title":"2005 , isbn =","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":69,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.223077Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:87d1eab2fc88debcbceb730aac5b80644b7f4d41569c23044ab11dfe664d291a","observation_id":"b2338498-451b-4167-ab35-6607d254e81c","resolution":{"observed_at":"2026-08-01T14:53:49.223077Z","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-08-01T14:53:49.285734Z","title":"2007 , isbn =","venue":null,"work_id":null,"year":2007},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":70,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.285734Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:45d74c64871ae25cea37a035aa4251c7089f502aa34a6bc654cf48ad83d35608","observation_id":"63e6d0f8-8f23-4b25-897a-e65e7426fb2f","resolution":{"observed_at":"2026-08-01T14:53:49.285734Z","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-08-01T14:53:49.433476Z","title":"Learning to Rank with Nonsmooth Cost Functions , url =","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":71,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.433476Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9ca4d42f797548a72b14bc3228cfea78b8741066e1e5d759bb5ffc29296495c5","observation_id":"ad8682e6-3109-4725-9751-1f6e6e948ee1","resolution":{"observed_at":"2026-08-01T14:53:49.433476Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2512.02328","last_updated":"2026-06-01T05:23:20Z","snapshot_observed_at":"2026-08-07T20:41:31.523352Z","submitted_at":"2025-12-02T01:49:17Z","title":"Molecular Embedding-Based Algorithm Selection in Protein-Ligand Docking","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2512.02328","snapshot_observed_at":"2026-08-01T14:53:49.569393Z","title":"arXiv preprint arXiv:2512.02328 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":72,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.569393Z"},"links":{"cited_paper":"/paper/2512.02328","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:6188aa7013bc3bdfc2cbcd54bb6b00a8c6ed8dcfcd3e44314baa9cbe30b4b994","observation_id":"ac5e9881-e692-431a-8edd-89b3aea60da5","resolution":{"observed_at":"2026-08-01T14:53:49.569393Z","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-08-01T14:53:49.664077Z","title":"Journal of Cheminformatics , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":73,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.664077Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:f4cfaf3541f3d698828e3b0376b715b41df816a9548f0abdd8881ba360656e9c","observation_id":"28d2646d-3d34-47f6-967a-3bc40ce47042","resolution":{"observed_at":"2026-08-01T14:53:49.664077Z","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-08-01T14:53:49.737752Z","title":"European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar) , pages=","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":74,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.737752Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:54627dc0f231a5780bb634fcbe2b7188475d3b8d1f6848e438f3806c272fdf1a","observation_id":"3ab3d1f7-0c23-4885-bbdd-6d778637c0f9","resolution":{"observed_at":"2026-08-01T14:53:49.737752Z","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-08-01T14:53:49.845831Z","title":"Theoretical Computer Science , volume=","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":75,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.845831Z"},"links":{"citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:da036fd6e3b042b3487d9492d4d2c6e61c5ca1ed15bb8fe278e758969a2c95d9","observation_id":"a6df25ee-7329-409c-a990-d7d80bc980a1","resolution":{"observed_at":"2026-08-01T14:53:49.845831Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2009.03509","last_updated":"2021-05-10T02:23:20Z","snapshot_observed_at":"2026-07-06T09:53:43.248602Z","submitted_at":"2020-09-08T04:04:04Z","title":"Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification","version":5},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2009.03509","snapshot_observed_at":"2026-08-01T14:53:49.966306Z","title":"arXiv preprint arXiv:2009.03509 , year=","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":76,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:49.966306Z"},"links":{"cited_paper":"/paper/2009.03509","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:9122cc701aaaf686c31ed1834df0871908e28a0a0654819641c029ba46e99268","observation_id":"3a601464-c0c1-4915-aff4-4dddbf2bccad","resolution":{"observed_at":"2026-08-01T14:53:49.966306Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20797","last_updated":"2026-05-20T06:43:34Z","snapshot_observed_at":"2026-08-08T07:59:59.898480Z","submitted_at":"2026-05-20T06:43:34Z","title":"Beyond Numerical Features: CNN-Driven Algorithm Selection via Contour Plots for Continuous Black-Box Optimization","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.20797","snapshot_observed_at":"2026-08-01T14:53:50.026443Z","title":"arXiv preprint arXiv:2605.20797 , year=","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes","version":1},"reference_index":77,"source":"arxiv_source","source_observed_at":"2026-08-01T14:53:50.026443Z"},"links":{"cited_paper":"/paper/2605.20797","citing_paper":"/paper/2607.18632"},"observation_digest":"sha256:32848b2159dc53da078aa1f75d46582358b56175adfc1f86db3905830dd25eda","observation_id":"a3483e36-f94c-49a0-8b38-ae5cf933bde2","resolution":{"observed_at":"2026-08-01T14:53:50.026443Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.18632","last_updated":"2026-07-21T02:01:01Z","latest_version":1,"primary_category":"cs.LG","snapshot_observed_at":"2026-08-05T07:30:41.277507Z","submitted_at":"2026-07-21T02:01:01Z","title":"Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes"},"reference_resolution":{"displayed":77,"state_counts":{"malformed_identifier":0,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":77,"verified_exact":0,"verified_fuzzy":0},"total_outbound_references":77},"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 77 of 77 outbound references and 0 inbound Pith citation observations for arXiv:2607.18632."}