Pith. sign in

Paper Citation Record · LEDGER

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes

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.

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

pith.paper-citation-record.v1
2607.18632 v1

Coverage vector

measured 77 of 77 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T14:53:50.026443Z

measured 77 of 77 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-09T06:31:02.800959+00:00

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

77 of 77 outbound references displayed

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

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 63772030-c687-4764-adf2-e929d872d32d · outbound

This paper cites Encyclopedia of operations research and management science , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Encyclopedia of operations research and management science , volume=

Reference 1

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.110954Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.110954Z digest=sha256:2bf2601cb8a3267022a443d1cb642e588a8f9be9bf957b0dd89cc80eb66d388e

Observation 169e6269-621c-46c5-b283-9bb8774c04c5 · outbound

This paper cites Proceedings of the AAAI conference on artificial intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the AAAI conference on artificial intelligence , volume=

Reference 2

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.193758Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.193758Z digest=sha256:e5f79a7eac20e84961ba550a6d1b6b57b83674b762ee74994e20af14c451c117

Observation 8c7b2987-2792-47b6-a244-23f9027acc4c · outbound

This paper cites Proceedings of the AAAI Conference on Artificial Intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the AAAI Conference on Artificial Intelligence , volume=

Reference 3

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.360624Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.360624Z digest=sha256:36701162caa08bdd7db7f9c226452a6b0d3d7e8adecb481f60bf8928c1be8e11

Observation 753604f8-1193-4608-9336-4baaab0e074b · outbound

This paper cites Cascaded Large-Scale TSP Solving with Unified Neural Guidance: Bridging Local and Population-based Search.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Cascaded Large-Scale TSP Solving with Unified Neural Guidance: Bridging Local and Population-based Search

Reference 4

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.509115Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.509115Z digest=sha256:f391afe2acaa1a3a166f554eb93a56b2e565e9803c47d7cb2c21c61505606bdd

Observation 820cb268-b9b3-47b8-91ba-daf10273dcfc · outbound

This paper cites Pattern Recognition , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Pattern Recognition , pages=

Reference 5

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.603673Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.603673Z digest=sha256:4f61cf8cbe2f1593efb6adda955792823fff355524ab1faf08cddbce14d61bec

Observation 0f9f8f76-8754-4140-80ab-780ecdadc76c · outbound

This paper cites arXiv preprint arXiv:2509.23465 , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint arXiv:2509.23465 , year=

Reference 6

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.749485Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.749485Z digest=sha256:6c4e1a45ebf8fe56bfa543707a15d9330a0d777d99538e36f128294c92222242

Observation a6d825cf-e68c-4a2a-834b-571f24fe2e91 · outbound

This paper cites Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V

Reference 7

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.882241Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.882241Z digest=sha256:4bf1650ed7933f8f949bea74ea5043c8b9e258884e7e4672efd67f9cc1871167

Observation daa691ae-64ed-406d-9af4-65f71763a745 · outbound

This paper cites Nature Communications , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Nature Communications , year=

Reference 8

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:41.988540Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:41.988540Z digest=sha256:497e067aba54ecda4d20bfcea841c6c40ef6557db46075a32abcd70520442d8e

Observation f3db3bf5-e974-4995-86c2-dfea330ad8ac · outbound

This paper cites arXiv preprint arXiv:2504.15147 , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint arXiv:2504.15147 , year=

Reference 9

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.092347Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.092347Z digest=sha256:08ba14ce2d2dc2cf8f8d91dcf2dc9b7afd0821dca67ea0fcd5ba519b616e71eb

Observation a4d64ed9-563d-4e7e-8947-ac3ac520969d · outbound

This paper cites Neurocomputing , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Neurocomputing , pages=

Reference 10

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.231514Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.231514Z digest=sha256:3544fc0faecbffe6dbb204cfaf2a00b4851216951cff3f22fa11b4681ed7ad4b

Observation 3c5b6a7c-0cc5-4722-a3bb-1b7c93eaea20 · outbound

This paper cites 2025 RIVF International Conference on Computing and Communication Technologies (RIVF) , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2025 RIVF International Conference on Computing and Communication Technologies (RIVF) , pages=

Reference 11

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.342977Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.342977Z digest=sha256:45b39fdd4b16742021cd0ffdb4df545b6f7d9e4c720ba020d167f42a5be447bf

Observation 38b859ca-8cb0-4722-a3b2-ee6c3b8d3a0e · outbound

This paper cites Journal of Statistical Software , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Journal of Statistical Software , volume=

Reference 12

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.544681Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.544681Z digest=sha256:379c50b7a42255d4e91d6c7d41f7a96d168b923c5c09a96c6648ca0dcc489aaa

Observation ebb3fb43-1f25-416b-b23b-64b876225988 · outbound

This paper cites A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes A new benchmark set for Traveling salesman problem and Hamiltonian cycle problem

Reference 13

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.670857Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.670857Z digest=sha256:95125e7b4c6bb7e87ee9158b3ec732475636b1954c99d107b7ee3ec44462466e

Observation 8e468dd1-3137-4313-b352-91b87ea90bd1 · outbound

This paper cites URL: http://comopt.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes URL: http://comopt

Reference 14

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.788570Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.788570Z digest=sha256:09eade696c3389106083fc781f2a2246de143af8ae19bbe337c8ca7be55da6c6

Observation c9d8c807-0339-4687-bb21-307fbdf4bb09 · outbound

This paper cites ORSA journal on computing , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes ORSA journal on computing , volume=

Reference 15

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:42.841824Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:42.841824Z digest=sha256:aaa206264f803780ca291d3a451ebca5abc61fe8ff39fe2ed76db7bb5a25111d

Observation 59e519df-c5a8-42cb-855e-73ab7cd4472f · outbound

This paper cites 2007 International Conference on Machine Learning and Cybernetics , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2007 International Conference on Machine Learning and Cybernetics , volume=

Reference 16

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.022134Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.022134Z digest=sha256:ffc4cc00d31412fe3dfde42a7ef7931cfd9a33242a4d3a0af62a052cf4eb0aa8

Observation c68352f4-a9eb-42ef-a2df-66e82f4e5baa · outbound

This paper cites Proceedings of the Genetic and Evolutionary Computation Conference , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the Genetic and Evolutionary Computation Conference , pages=

Reference 17

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.183130Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.183130Z digest=sha256:6d7c855ad7d454ae552caf3d075ac1df30ed8b8a2f7fad06126c9326177cd51e

Observation 7153e5c6-46ea-4403-a6d5-9e5f3363a9d1 · outbound

This paper cites Asian conference on machine learning , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Asian conference on machine learning , pages=

Reference 18

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.272713Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.272713Z digest=sha256:0f4c9422c72eebc45642998f72c14e5453a2774149e16a19a383fd4a702db489

Observation 567d5981-0ed9-4197-a858-5d4af81079f9 · outbound

This paper cites Neural Combinatorial Optimization with Reinforcement Learning.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Neural Combinatorial Optimization with Reinforcement Learning

Reference 19

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.387352Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.387352Z digest=sha256:c843bef222e3d560907a68482a448093d536cf85ade4a48a56cc908082f1c809

Reference 20

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.505270Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.505270Z digest=sha256:dbb490e661a97cd8269a5fc20302a8d6b10bc2be4cf51e0133e731d03f6bb428

Observation 0921123a-2f11-4cb3-9a9b-a981d61cb284 · outbound

This paper cites 2006 , publisher =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2006 , publisher =

Reference 21

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.579792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.579792Z digest=sha256:cda2ed6e0d730508bc4b9442c815b04837e751e7f737f6bee019ea0465582fe0

Observation cc113e98-3dda-46ea-8bea-220775db63fc · outbound

This paper cites INFORMS Journal on Computing , volume =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes INFORMS Journal on Computing , volume =

Reference 22

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.687546Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.687546Z digest=sha256:7bac994321f7981a3e6c63908553f0665a1b8e14c085a5f652fa57bfb98c6ef6

Observation 72e3aa9b-aa2d-40ee-95dd-2d7dfb1c4eb0 · outbound

This paper cites Advances in computers , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Advances in computers , volume=

Reference 23

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.813662Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.813662Z digest=sha256:0767e511e5b879b7f14f759094cb8927238713a6c05e018eaaf6af8f4a15279e

Observation b3103d11-9d83-49a1-af7e-7cecf1e54f71 · outbound

This paper cites AI Magazine , volume =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes AI Magazine , volume =

Reference 24

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:43.988068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:43.988068Z digest=sha256:daf7df49f59c9610e011559a37d43c0d2b795758b2516fd8125a9b0f07e35b9f

Observation 98301985-13fe-4963-bb9b-188d530af857 · outbound

This paper cites Journal of artificial intelligence research , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Journal of artificial intelligence research , volume=

Reference 25

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.130181Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.130181Z digest=sha256:1cbd7ff8264e0c5f0f06ef1642bd0ef4eeeba14ffc28c5471a46c809ef1d00d9

Observation b70283e2-e176-43ad-91c4-6e162a1a1133 · outbound

This paper cites IEEE transactions on neural networks , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes IEEE transactions on neural networks , volume=

Reference 26

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.245343Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.245343Z digest=sha256:e20481afd0c01901c381581d641bdd4ed7fd43212e101b2fb17915c121fbc2a4

Observation 6b8d658b-ff56-4faa-841b-d7ff7aa5aba1 · outbound

This paper cites IEEE transactions on neural networks and learning systems , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes IEEE transactions on neural networks and learning systems , volume=

Reference 27

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.327053Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.327053Z digest=sha256:fa6b1346a73af63196307c478ad414e42e9d332bea36e4a4520a73dfab7bab93

Observation 802d6290-7a24-4092-92ab-776f799768e5 · outbound

This paper cites Artificial Intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Artificial Intelligence , volume=

Reference 28

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.387285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.387285Z digest=sha256:7d110c850701ea491946a0466290b437c0c32562b04a1dad43797e895f5d99ae

Observation 3833983c-9153-4e25-934d-e42028dd2537 · outbound

This paper cites Ieee Access , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Ieee Access , volume=

Reference 29

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.487614Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.487614Z digest=sha256:2fbd05f3cea17588cf627a184dbd2d9ccc55989a1a013224812f569b963f00d2

Observation 675410d3-39f6-4f4f-ac6b-5ea063a136f1 · outbound

This paper cites Distill , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Distill , volume=

Reference 30

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.606087Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.606087Z digest=sha256:14bf3f27f6fbcfd6e0b2272ed6c5b8f7f0751ace97ccd92085e9bab4126b1621

Observation 9f9b826a-acff-43c7-823f-c23803ed9d21 · outbound

This paper cites arXiv preprint , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint , year=

Reference 31

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.775474Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.775474Z digest=sha256:b4961bbde62dd0129e65226bf5bf197658d1fd358c01ae59a4b8b9eb89a777ab

Observation e04b2095-e3da-4c47-b9ce-f5fa5e981fd3 · outbound

This paper cites Journal of Heuristics , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Journal of Heuristics , volume=

Reference 32

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:44.940340Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:44.940340Z digest=sha256:9e4bcd8131c04e4520864e6f99625110190e7018de77a1b69c682ebd6bb467c4

Observation 16417fc3-d652-45d5-89f0-2926903a213b · outbound

This paper cites arXiv preprint , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint , year=

Reference 33

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.056939Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.056939Z digest=sha256:cffdd87b3d4ac1523d79db0d14eb299fd6ff64454ca38cce51cd9687fc96f48e

Observation bc76db81-a295-4963-8d27-7bac431154e9 · outbound

This paper cites Advances in computers , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Advances in computers , volume=

Reference 34

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.124041Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.124041Z digest=sha256:5fef91209f2ef65eb94f056b194df521a7500fb40b3b62c9f3bb0e55ecc87507

Observation 49bae4b6-7ff6-42ca-8a7e-864201de3f59 · outbound

This paper cites 2021 , url=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2021 , url=

Reference 35

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.231785Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.231785Z digest=sha256:ba4d6b5858a3bfc0bbd65ad4c95c756ffcb430245ba0e6bbaa919e70c95c0852

Observation d3beaf76-73ab-4c1e-838d-c732b674f6fb · outbound

This paper cites Graph Neural Network Guided Local Search for the Traveling Salesperson Problem.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Graph Neural Network Guided Local Search for the Traveling Salesperson Problem

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.283790Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.283790Z digest=sha256:c61f18714fe1a2873f722a19cb7e7dad66631274b2e7432593a7af83e4f199b4

Observation db949dc4-c9b1-4992-ac58-789cf4a0e716 · outbound

This paper cites Advances in Neural Information Processing Systems , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Advances in Neural Information Processing Systems , volume=

Reference 37

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.400978Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.400978Z digest=sha256:4ad2f03d8c55bf3db3083c863dff17c15510d60f40205f71652b47c7446f19bf

Observation 9bbdb312-3a5a-4ba6-9c4f-9ce8f6d41aec · outbound

This paper cites International Conference on Algorithmic Aspects in Information and Management , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes International Conference on Algorithmic Aspects in Information and Management , pages=

Reference 38

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.463672Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.463672Z digest=sha256:2dcf0d74cb7f5c6479b90b9d28144dbb83333c8935182a88020829d166e4565e

Observation 4c548f35-1289-4e78-b0a7-1cbcabef7c13 · outbound

This paper cites an unresolved cited work.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Unresolved cited work

Reference 39

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.561826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.561826Z digest=sha256:5bba88323bd68de28e83429a239c88a71126934bd981e1b3740c4c6e7ef7072c

Observation 4f0e68b0-e964-4d8e-af41-c243269f97af · outbound

This paper cites Advances in neural information processing systems , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Advances in neural information processing systems , volume=

Reference 40

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.759002Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.759002Z digest=sha256:48162933f1ddc846831c03e0515b94564eea3c3967c91b94044fea3c61dc9b3c

Observation 7a7f48a9-1931-48d0-8a84-f17fa4dc470a · outbound

This paper cites AI Open , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes AI Open , volume=

Reference 41

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:45.903545Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:45.903545Z digest=sha256:a6d39fad9f58ce4754e097469a06d5bc13ab048b82ed2ebc97e1c0e8a9adad30

Observation 62b714b9-8cc4-4e6e-baa3-1b8111c87e65 · outbound

This paper cites arXiv preprint , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint , year=

Reference 42

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.052908Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.052908Z digest=sha256:84939a9dffc2f5790aa79e50a32dc18d4fc8e9372112458d8960dbd24c21c1ca

Observation e4f91d6c-ae03-4e3a-a36e-67fd6d887687 · outbound

This paper cites An Introduction to Robust Graph Convolutional Networks.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes An Introduction to Robust Graph Convolutional Networks

Reference 43

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.167846Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.167846Z digest=sha256:a112c6bf75edbaaffd2c2dcc526197b36496278f3d37ae237cb57d5dfd856ae2

Observation d9a39d9b-3df1-4135-82fb-6133de5c2859 · outbound

This paper cites Relational Graph Convolutional Networks for Sentiment Analysis.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Relational Graph Convolutional Networks for Sentiment Analysis

Reference 44

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.280482Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.280482Z digest=sha256:6f934418ba8298df121a0abf8bd3903f5c2de147121c85a3a5bf03a7f99d2746

Observation ff171d17-ac25-4516-a450-c4675f4a913a · outbound

This paper cites Future Internet , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Future Internet , volume=

Reference 45

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.373339Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.373339Z digest=sha256:80dd30f9bd29d3d8f85008f45e6b0145c597f9c94116d6b45d21374165155437

Observation b1865624-51d3-4870-9563-ad29d403f6c9 · outbound

This paper cites arXiv preprint , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint , year=

Reference 46

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.462206Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.462206Z digest=sha256:4e9804f5610fe04ab6de7ac15e4dab8bf2e3a5ca9dbd2aec8400ae38dfb87242

Observation 010daba8-a325-4f42-8cdf-a8161b65bcd6 · outbound

This paper cites Expert Systems With Applications , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Expert Systems With Applications , volume=

Reference 47

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.610253Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.610253Z digest=sha256:d77e9848c3080d3f2580ec2730347c8ee8437f04775aa83371d6961d5bc28af5

Observation da01717e-20b8-4e76-9666-57b2ea10d078 · outbound

This paper cites European Journal of Operational Research , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes European Journal of Operational Research , volume=

Reference 48

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.737782Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.737782Z digest=sha256:0591c968df7f91558c337f03cc4f83b47187d6d690e2fda45ce4de6478f994a9

Observation 8560888b-b914-43f2-b010-f6efb18386d8 · outbound

This paper cites IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) , volume=

Reference 49

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:46.913687Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:46.913687Z digest=sha256:c574842ec97b82fc0bed6e6c27a1c8ff4c3a24242d5d2f0f470d2a8c9f6b712a

Observation 1cb4e05b-e710-40e3-be5e-a2e9de3c7f68 · outbound

This paper cites INFORMS Journal on Computing , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes INFORMS Journal on Computing , volume=

Reference 50

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.032843Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.032843Z digest=sha256:95fa7ef8bccbb6f24d82aa2fce0976fb97aa51f27da994d1a3cffb958762dc6d

Observation 9612a321-696e-4c81-a0ee-4fda2ff7dae7 · outbound

This paper cites Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Revisit the Algorithm Selection Problem for TSP with Spatial Information Enhanced Graph Neural Networks

Reference 51

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.121471Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.121471Z digest=sha256:7dc6030aae02d5df281e723a620a8943bbffc2644158ca8bb1e512e634b4b304

Observation f69987da-b551-4870-9e07-ae3fac463921 · outbound

This paper cites 17th International Conference on Agents and Artificial Intelligence, ICAART 2025 , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 17th International Conference on Agents and Artificial Intelligence, ICAART 2025 , pages=

Reference 52

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.204229Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.204229Z digest=sha256:96722e57fa96362d98aaf55a576a383894c42e1e416becee941b3546c90653d1

Observation 3f271e34-1f6e-4cbc-bd6c-2024b1169d72 · outbound

This paper cites International Conference on Learning and Intelligent Optimization , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes International Conference on Learning and Intelligent Optimization , pages=

Reference 53

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.319419Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.319419Z digest=sha256:83417978b6a75adaf2641ce3322605e1bed2b6681b84138ec41f5f5d449b2ab0

Observation 2e633bdf-02bb-4f2a-bbc1-bb48c05fa98e · outbound

This paper cites Applied Soft Computing , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Applied Soft Computing , pages=

Reference 54

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.485095Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.485095Z digest=sha256:7bdc0e72cfaa37f3f010383dc16595c855ebeea1446694e4ba06ea57d1cc00dc

Observation 51350d2f-fb89-470f-923e-117532834c01 · outbound

This paper cites arXiv preprint arXiv:2509.26377 , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes arXiv preprint arXiv:2509.26377 , year=

Reference 55

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.684788Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.684788Z digest=sha256:9c0c6593e666a797ea9d649db1efc086ebedd24856471c36bb00eb3c34f8f838

Observation f1b61b14-d66c-417d-9bd1-2a94b80bdc39 · outbound

This paper cites Biometrics bulletin , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Biometrics bulletin , volume=

Reference 56

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.764433Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.764433Z digest=sha256:4624ef2bd20ab0ff65ebad48ef93d31f48c1717da4fb8709ba90781183287ccb

Observation a2b39b12-e460-4dae-b8d0-6b9131ba7d21 · outbound

This paper cites com: A tool for life science researchers for multiple hypothesis testing correction , author=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes com: A tool for life science researchers for multiple hypothesis testing correction , author=

Reference 57

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:47.900645Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:47.900645Z digest=sha256:28e1908a3af17215d26aea8c60120759494e350693081130b6cb65cce711fb7c

Observation 0720c07c-6ce9-45f9-80f5-dcc6334a21e1 · outbound

This paper cites Scandinavian journal of statistics , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Scandinavian journal of statistics , pages=

Reference 58

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.029396Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.029396Z digest=sha256:b6164bd7db391cc8466e7ef4fc01cdbc001a35e612becedd40963316bbecbf13

Observation c72177ff-845c-44db-b3dc-06dc19dedc24 · outbound

This paper cites Proceedings of the aaai conference on artificial intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the aaai conference on artificial intelligence , volume=

Reference 59

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.126505Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.126505Z digest=sha256:9aa04a027780d050c708f3f5854d69394c119bf76f83ea45a24dd40068d6a8b0

Observation 99f5215d-fce9-4de9-b043-3ee6cc5b1b88 · outbound

This paper cites Proceedings of the AAAI conference on artificial intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the AAAI conference on artificial intelligence , volume=

Reference 60

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.201817Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.201817Z digest=sha256:4dbde78b15ac39e0eaf31599c274ef8ecba65322645937b497a3c8a8a2c577ef

Observation 8a1300cf-1863-4acf-b224-15799609b966 · outbound

This paper cites Temporal Graph Networks for Deep Learning on Dynamic Graphs.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Temporal Graph Networks for Deep Learning on Dynamic Graphs

Reference 61

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.297100Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.297100Z digest=sha256:25056e4bf3314213736b7b58be122bfc11b71a64657f2f43f149f755e5d211ca

Observation 6d60daeb-3829-4e2d-93e6-31b7a39892a2 · outbound

This paper cites Evolutionary computation , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Evolutionary computation , volume=

Reference 62

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.387806Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.387806Z digest=sha256:b09eb5e63554f03bfd5773669f5a15e6243fe7d95e7674c8b3cf4d7ef2ca5c07

Observation 4939581f-0c17-4d24-91ab-192acf94f9b3 · outbound

This paper cites Journal of Heuristics , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Journal of Heuristics , volume=

Reference 63

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.563682Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.563682Z digest=sha256:0cea08dd879bf6d45c5b9c9023a215766ebda57b13e73c0bf152b66faecd0a26

Observation 02c745e9-9832-4465-9a22-a78496384d54 · outbound

This paper cites IEEE Transactions on Evolutionary Computation , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes IEEE Transactions on Evolutionary Computation , volume=

Reference 64

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.663063Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.663063Z digest=sha256:9313bb7479301181e70d934fa3e28f558c607171bacb2b8f712cba62954e1eeb

Observation c2859594-0b82-445c-82e2-d5c06f0ea77f · outbound

This paper cites Artificial Intelligence Review , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Artificial Intelligence Review , volume=

Reference 65

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.841148Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.841148Z digest=sha256:dac1091d924a9adda6176aef7270b53fc642b9f74be961c7af54f7e3d3412359

Observation 4add8518-07f8-439c-9b04-5a95e221fcbf · outbound

This paper cites Artificial Intelligence , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Artificial Intelligence , volume=

Reference 66

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:48.993643Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:48.993643Z digest=sha256:46ec0093ec2753f5a230988f3328cd1eb516379dfa6357403830fd30f1dab37b

Observation 0b2c4d33-f823-4f07-b5ff-8bbc86cebd4c · outbound

This paper cites Proceedings of the 9th Learning and Intelligent OptimizatioN Conference (LION) , volume =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Proceedings of the 9th Learning and Intelligent OptimizatioN Conference (LION) , volume =

Reference 67

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.079702Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.079702Z digest=sha256:a4bc0062896c0664fcc8a5f2e886d88c3d01421807f9ff4bf549b833ebd46969

Observation 179986da-ad87-4291-91e5-1cd57b5be3dc · outbound

This paper cites IEEE Congress on Evolutionary Computation (CEC) , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes IEEE Congress on Evolutionary Computation (CEC) , year=

Reference 68

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.142929Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.142929Z digest=sha256:99247de18d6cb9c83a5a058c76ac3df65df666dd5549d773394615b3b85e0fac

Observation b2338498-451b-4167-ab35-6607d254e81c · outbound

This paper cites 2005 , isbn =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2005 , isbn =

Reference 69

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.223077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.223077Z digest=sha256:87d1eab2fc88debcbceb730aac5b80644b7f4d41569c23044ab11dfe664d291a

Observation 63e6d0f8-8f23-4b25-897a-e65e7426fb2f · outbound

This paper cites 2007 , isbn =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes 2007 , isbn =

Reference 70

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.285734Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.285734Z digest=sha256:45d74c64871ae25cea37a035aa4251c7089f502aa34a6bc654cf48ad83d35608

Observation ad8682e6-3109-4725-9751-1f6e6e948ee1 · outbound

This paper cites Learning to Rank with Nonsmooth Cost Functions , url =.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Learning to Rank with Nonsmooth Cost Functions , url =

Reference 71

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.433476Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.433476Z digest=sha256:9ca4d42f797548a72b14bc3228cfea78b8741066e1e5d759bb5ffc29296495c5

Observation ac5e9881-e692-431a-8edd-89b3aea60da5 · outbound

This paper cites Molecular Embedding-Based Algorithm Selection in Protein-Ligand Docking.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Molecular Embedding-Based Algorithm Selection in Protein-Ligand Docking

Reference 72

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.569393Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.569393Z digest=sha256:6188aa7013bc3bdfc2cbcd54bb6b00a8c6ed8dcfcd3e44314baa9cbe30b4b994

Observation 28d2646d-3d34-47f6-967a-3bc40ce47042 · outbound

This paper cites Journal of Cheminformatics , year=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Journal of Cheminformatics , year=

Reference 73

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.664077Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.664077Z digest=sha256:f4cfaf3541f3d698828e3b0376b715b41df816a9548f0abdd8881ba360656e9c

Observation 3ab3d1f7-0c23-4885-bbdd-6d778637c0f9 · outbound

This paper cites European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar) , pages=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes European Conference on Evolutionary Computation in Combinatorial Optimization (Part of EvoStar) , pages=

Reference 74

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.737752Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.737752Z digest=sha256:54627dc0f231a5780bb634fcbe2b7188475d3b8d1f6848e438f3806c272fdf1a

Observation a6df25ee-7329-409c-a990-d7d80bc980a1 · outbound

This paper cites Theoretical Computer Science , volume=.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Theoretical Computer Science , volume=

Reference 75

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.845831Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.845831Z digest=sha256:da036fd6e3b042b3487d9492d4d2c6e61c5ca1ed15bb8fe278e758969a2c95d9

Observation 3a601464-c0c1-4915-aff4-4dddbf2bccad · outbound

This paper cites Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Masked Label Prediction: Unified Message Passing Model for Semi-Supervised Classification

Reference 76

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:49.966306Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:49.966306Z digest=sha256:9122cc701aaaf686c31ed1834df0871908e28a0a0654819641c029ba46e99268

Observation a3483e36-f94c-49a0-8b38-ae5cf933bde2 · outbound

This paper cites Beyond Numerical Features: CNN-Driven Algorithm Selection via Contour Plots for Continuous Black-Box Optimization.

Graph Neural Network-based Algorithm Selection for the Traveling Salesman Problem: A Systematic Study of Cost and Rank Losses under Distinct Budget Regimes Beyond Numerical Features: CNN-Driven Algorithm Selection via Contour Plots for Continuous Black-Box Optimization

Reference 77

Resolution
unresolved
no resolver link, observed 2026-08-01T14:53:50.026443Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=arxiv_source observed=2026-08-01T14:53:50.026443Z digest=sha256:32848b2159dc53da078aa1f75d46582358b56175adfc1f86db3905830dd25eda

Pith citing papers

No inbound Pith citation observations are available.