{"as_of":"2026-08-08T02:54:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3b0eaceaaf75ddca418ae18d6a4b1fc9a7aa197f55b94f6932dcd508d057fee7","coverage":[{"denominator":87,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":87,"source":"paper_references, paper_reference_links","source_observed_at":"2026-08-07T14:37:21.294779Z","state":"measured"},{"denominator":87,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":87,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-07T06:34:17.273281+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/2505.18278/citation-record","integrity":"/paper/2505.18278/integrity","json":"/paper/2505.18278/citation-record.json","paper":"/paper/2505.18278"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:13.555511Z","title":null,"venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.555511Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:76e1bb57744b64cf23ccd12d07a1b5e30cc008ee562041ae98288c6261d38dca","observation_id":"3a246af1-f02e-491d-b69d-110d3d2997b7","resolution":{"observed_at":"2026-08-07T14:37:13.555511Z","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-07T14:37:13.606732Z","title":"Applegate, W","venue":null,"work_id":null,"year":2006},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.606732Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:62b0a4788b476642d2ae6619baa050c3283fd2eabacaa0f3bfc9fa47939aec58","observation_id":"f2b72ee5-dc1b-4ab1-a23b-7d5e82c03b2b","resolution":{"observed_at":"2026-08-07T14:37:13.606732Z","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-07T14:37:13.671490Z","title":"Dahiya, S","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.671490Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:11cbd01d952cb45cc5911d0a33f190d5ece585b38592796dd50259eda3446ea3","observation_id":"06e96e49-f47b-4289-8520-49324fac4c02","resolution":{"observed_at":"2026-08-07T14:37:13.671490Z","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-07T14:37:13.786123Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.786123Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:0b951298b6fdd2c3e6c57fbbeb6813556c1911f78c8ed61b7e21899819c20f93","observation_id":"375b6ef2-f60e-49d4-9db2-cfc0f0045229","resolution":{"observed_at":"2026-08-07T14:37:13.786123Z","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-07T14:37:13.873220Z","title":"Dell’Amico, R","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.873220Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:454f2e342b4617748b9599fad604ed3f10af94f4d6deb7e11bc87cf5e9e443b5","observation_id":"3979793c-dec8-45b9-86b0-77b637cf377c","resolution":{"observed_at":"2026-08-07T14:37:13.873220Z","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-07T14:37:13.968504Z","title":null,"venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:13.968504Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d32d5a3502a6adaac059965149462c9726c888d1ea96dc7efc7675d09840371d","observation_id":"1379a454-937a-4308-a291-c2f7c8269926","resolution":{"observed_at":"2026-08-07T14:37:13.968504Z","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-07T14:37:14.063140Z","title":"Tschoke, R","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.063140Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:5277c78054b82182e4e0502dd0f04c213f56e37cd855d68af8c0360973067073","observation_id":"9bdb454b-3539-4013-b0d8-db0488f3477a","resolution":{"observed_at":"2026-08-07T14:37:14.063140Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.584008Z","title":null,"venue":null,"work_id":"21ec194a-282a-42c5-b90c-0e5acd379ffd","year":2023},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.145167Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:153bc53057dfacd2b9e80744f4166e3d42da17fb3c5c0de3a5e226ea0cf4563b","observation_id":"d294c84d-5e05-4aa4-b72e-4f0a7b4475c7","resolution":{"observed_at":"2026-08-07T14:37:32.658570Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1907.12666","last_updated":"2019-07-29T21:52:06Z","snapshot_observed_at":"2026-08-04T02:09:59.293845Z","submitted_at":"2019-07-29T21:52:06Z","title":"Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance","version":1},"cited_work":{"arxiv_id":"1907.12666","doi":null,"metadata_source":"pith","pith_arxiv_id":"1907.12666","snapshot_observed_at":"2026-08-07T14:37:22.546627Z","title":"Modeling Shared Cache Performance of OpenMP Programs using Reuse Distance","venue":"cs.PF","work_id":"d7c932f2-ee5a-4134-88e9-ec8c3f117dc2","year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.224115Z"},"links":{"cited_paper":"/paper/1907.12666","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:9f0f2ddb726c9717a24ca0d09a7c02ece99b947f50baf1ca01d234fa1489b9cc","observation_id":"78721056-f27c-49ea-815d-9d0a048ff1b7","resolution":{"observed_at":"2026-08-07T14:37:22.582147Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.477587Z","title":null,"venue":null,"work_id":"dea763de-b466-4be7-b3d1-54111e4447ab","year":1996},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.286953Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3cacd38c1a201e4c7e9b90f59258eee8f535d19d1ad7a116c0ad34f56b9b7168","observation_id":"3b427da2-9525-4cb1-a3b2-7e252af87a63","resolution":{"observed_at":"2026-08-07T14:37:32.512502Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.388127Z","title":"Clausen, Branch and bound algorithms-principles and examples, Department of computer science, University of Copenhagen (1999) 1–30","venue":null,"work_id":"9dc9c1e8-b94a-4f59-a419-3ab9b3d2b0eb","year":1999},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.347324Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:bb60b859f6e5cc159f980ad9f45e32e558185c423c4627ca5ff7a2c2bf3aeade","observation_id":"659abac1-e6ef-454c-818b-2b805d572e0b","resolution":{"observed_at":"2026-08-07T14:37:32.425761Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-45586-8_6","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:21.977694Z","title":"Ladányi, T","venue":null,"work_id":"82b3090e-3943-4612-a6e2-88f3826b1c9b","year":2001},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.423807Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:be2d93cc59b7b256afaa9fea8ce42150ccd019c43ed3305763eed26952759c04","observation_id":"996dce8e-22e7-4a0b-a98f-d869610f65cb","resolution":{"observed_at":"2026-08-07T14:37:22.036271Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2104.10025","last_updated":"2021-04-19T01:53:17Z","snapshot_observed_at":"2026-07-06T11:02:04.656447Z","submitted_at":"2021-04-19T01:53:17Z","title":"Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms","version":1},"cited_work":{"arxiv_id":"2104.10025","doi":null,"metadata_source":"pith","pith_arxiv_id":"2104.10025","snapshot_observed_at":"2026-08-07T14:37:22.419124Z","title":"Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms","venue":"cs.DC","work_id":"e7aedfdf-12d7-4790-bb8e-6705aa5ab1e1","year":2021},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.483832Z"},"links":{"cited_paper":"/paper/2104.10025","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:4945fe2bce481031150c170970823661f4ba28ec5d76010e1baa22682c7db5e4","observation_id":"dfce90d0-b43f-43c5-9784-13411c482639","resolution":{"observed_at":"2026-08-07T14:37:22.445819Z","resolver_source":"local_arxiv","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2205.14352","last_updated":"2022-05-28T06:35:40Z","snapshot_observed_at":"2026-07-06T13:14:55.899731Z","submitted_at":"2022-05-28T06:35:40Z","title":"Travelling Salesman Problem: Parallel Implementations & Analysis","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2205.14352","snapshot_observed_at":"2026-08-07T14:37:14.589364Z","title":"Gohil, M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.589364Z"},"links":{"cited_paper":"/paper/2205.14352","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:4a593347359dd1704619418cc95bb8c248c3d97cb992a60f76359ce295a6e7f9","observation_id":"5ee4aa49-19b3-42f4-a642-c9e927e600d9","resolution":{"observed_at":"2026-08-07T14:37:14.589364Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.276050Z","title":"Rokbani, R","venue":null,"work_id":"182915ff-9f53-431e-afcf-bf4696abf0f3","year":2021},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.651507Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3bf4eaed50b9e72c6477198aeed41e6f78ce858f37d24b147a014908212b385e","observation_id":"32b823ea-4140-4ab2-aa82-127b0c755015","resolution":{"observed_at":"2026-08-07T14:37:32.340454Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.172357Z","title":null,"venue":null,"work_id":"f5ba6d69-352f-453e-9e31-deff68c37748","year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.732330Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:defdc1aae174609ffc9e7ccfcee3b986fefb6fdfd4d302b4c4795d0700df5568","observation_id":"a4790566-91d3-4467-a53d-851f1a04044c","resolution":{"observed_at":"2026-08-07T14:37:32.202482Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:32.048120Z","title":"Peng, Parallel genetic algorithm for travelling salesman problem, in: International conference on automation control, algorithm, and intelligent bionics (ACAIB 2022), Vol","venue":null,"work_id":"5d63fd67-cb62-4679-8fe8-88310a693d4d","year":2022},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.834079Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:a33ed6a01b6051cf9bb5bc1c461fd0735e243958efb9063979e03ac733b4251f","observation_id":"4ca8f936-d5e6-414b-a0fc-770f2ab2daee","resolution":{"observed_at":"2026-08-07T14:37:32.116416Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.942436Z","title":"Abbasi, M","venue":null,"work_id":"a16f6bda-7a93-4ac9-868e-f082e53204f2","year":2020},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.888922Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:9740bf064e072424f3843cd16f950787a5489ad9eaccb7c36aa1d77ad784f75b","observation_id":"f809f0cd-136c-4d0b-ac84-c4bccb1037c7","resolution":{"observed_at":"2026-08-07T14:37:31.996527Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.810236Z","title":"Katiyar, N","venue":null,"work_id":"8b679a69-8fbd-4ac1-af9b-68dd8d990dae","year":2015},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:14.983643Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:9caa69e50bbfaabe31730ac5eedc2e40f661193a26dbacdd6faf683247bfd854","observation_id":"6e5b3ff5-c138-414c-aa31-3ee31cb3799c","resolution":{"observed_at":"2026-08-07T14:37:31.859809Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.695478Z","title":"Delévacq, P","venue":null,"work_id":"abba9d76-ab18-4e7f-ad1a-874c1798f568","year":2013},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.100257Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:ec9702898cc9b7b1e475e0cad4b6357586ee98d58ef65d6bd8c06bc8a6b948f7","observation_id":"6db48dfc-c3db-437f-9ac5-93e3e4b3eedd","resolution":{"observed_at":"2026-08-07T14:37:31.725033Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.595064Z","title":null,"venue":null,"work_id":"f58a29e5-d848-4c40-966b-1a6dca84d04a","year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.201169Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:6f36b6a59b3508c6b0bf05cd3cf740d6a3591fff199bf3c4929668910a5a799f","observation_id":"9f1d0ea8-c24d-4285-8c49-f44d0f47d2bf","resolution":{"observed_at":"2026-08-07T14:37:31.627927Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.489284Z","title":"Mavrovouniotis, S","venue":null,"work_id":"e70a30c9-34d9-4b3f-87e4-6dbf8517b50d","year":2013},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.356209Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:788c52ec35da770b1b0d071f7d19256decf30e2ba3211650afc881061d8888f6","observation_id":"ce99a948-a825-4b33-8066-f5f0cfef897e","resolution":{"observed_at":"2026-08-07T14:37:31.542680Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.376914Z","title":"Kirkpatrick, C","venue":null,"work_id":"fd09bb54-a904-4fb8-9661-5c022599d730","year":1983},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.422947Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:2fa11fbbdfdd70d5123bddc0c40cbf9419b053e6f9e197427b951ac6ab80daeb","observation_id":"84e8e9bf-6064-4efb-86f1-607575541243","resolution":{"observed_at":"2026-08-07T14:37:31.422508Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.285513Z","title":"Sonuc, B","venue":null,"work_id":"9a41fa9a-7da1-474a-b62d-655c89bcaa47","year":2018},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.512828Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:81ef63ca6d2536bd08e23a482aba2a3453ddec4d6b5fbe40e6a1e93ad93598a3","observation_id":"dcb24ad5-abc8-4338-8bc5-0b25d05e4868","resolution":{"observed_at":"2026-08-07T14:37:31.320271Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.162078Z","title":"Borisenko, S","venue":null,"work_id":"05dd3cbd-c871-4a5b-88fc-f4e71e41e61b","year":2017},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.591633Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:c80c523805b3e8fee4295ec16cd3cad12bb082b1ca2356bba791c32fdc4febf0","observation_id":"53cf2845-cf24-4d0c-b832-ef54e9c4d85c","resolution":{"observed_at":"2026-08-07T14:37:31.209871Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:31.065100Z","title":"de Almeida Dantas, E","venue":null,"work_id":"0fa6597f-5e01-487f-bedd-40658e8879d6","year":2018},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.667482Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:968d3d57013a7c9790d268aa2e19cd1b8aa95e40f4a63b84fd11a34bc37415dd","observation_id":"b699973f-9bdb-4ece-ba05-a303bcdecd44","resolution":{"observed_at":"2026-08-07T14:37:31.100002Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.964285Z","title":"Sere, Application of parallel distributed computing for global optimization with simulated an- nealing, Ph.D","venue":null,"work_id":"6940ddc2-0385-468e-8b77-d04b95096df8","year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.780245Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:747bb00ade3fd8c72a597f2f6e5c16d06ed3fd35bab4be9d5e3b3b1a4398573c","observation_id":"02c7adba-6767-46d4-a309-26085f2fb714","resolution":{"observed_at":"2026-08-07T14:37:31.004367Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.845477Z","title":"Glover, Tabu search—part i, ORSA Journal on computing 1 (3) (1989) 190–206","venue":null,"work_id":"64ec4d43-9372-4573-92fa-0ce09cb8a5a4","year":1989},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.834363Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:37005fc79d3e63c265005cfe09f05a575c9afacbc480a2f16a36760f7ad33d7b","observation_id":"9ddb906a-31d7-47e8-96db-083412c2ec78","resolution":{"observed_at":"2026-08-07T14:37:30.888450Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.738688Z","title":"Talbi, Metaheuristics: from design to implementation, John Wiley & Sons, 2009","venue":null,"work_id":"d458f430-a9a8-4748-acdc-742fa7c1818a","year":2009},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.901658Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:b39dd36306bc152937b6528b2e56ccf7d2f197a5cd9e8098e86c9174a2a83c36","observation_id":"457b04ca-9bf4-4ce7-8f43-1611bb956daa","resolution":{"observed_at":"2026-08-07T14:37:30.782313Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.653741Z","title":"Talbi, A taxonomy of hybrid metaheuristics, Journal of heuristics 8 (2002) 541–564","venue":null,"work_id":"d366f5e4-dc11-40ed-b080-e08d49ccdea9","year":2002},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:15.978847Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:dfe04fa25202504f87c286bd8e725b277420a6301bd97ac263980c79a6102aa2","observation_id":"b0002154-483e-464c-a6a4-8c0a6b37ce5a","resolution":{"observed_at":"2026-08-07T14:37:30.689332Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.517649Z","title":null,"venue":null,"work_id":"26bb9394-fafd-4c4f-9789-8e1f6f4f1747","year":2020},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.045381Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d5ede422e99afcf4b636592b8afa4a9d1b69a6e48eadfc4e460540171f030bc0","observation_id":"f3016e61-4c51-4aa1-8362-053ea11e9f89","resolution":{"observed_at":"2026-08-07T14:37:30.575372Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.397021Z","title":null,"venue":null,"work_id":"85d084f8-91a4-46c1-8fce-c61e29920f4e","year":2002},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.144931Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:7620e74eda006f84df8d24004c6c2d9b4ec4d18770c79a8d74e21f83ad55d989","observation_id":"fdb5714a-45c6-4520-aa3c-c4401e1e7356","resolution":{"observed_at":"2026-08-07T14:37:30.440658Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.310925Z","title":null,"venue":null,"work_id":"f3c520aa-a8ba-4a9d-b973-340e858d9e02","year":2005},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.248968Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d12f8c792733c667c59292549bbb9cf7c6fa0c658e367ff735a44f068b0c37a1","observation_id":"b6c054e4-d23e-4863-92e6-6b7722bf9b24","resolution":{"observed_at":"2026-08-07T14:37:30.347319Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/s1474-6670(17)51595-5","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:21.838153Z","title":"Dudek-Dyducb, T","venue":null,"work_id":"ef1c2d51-5ff8-4970-8344-7e8b66d5c247","year":1995},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.353751Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:e82fb54b2ad3c9fdd3cade86b84a6ad70df8025dad20561af33f172460d38496","observation_id":"badaaf10-c155-4534-b4d4-dea5609d0b81","resolution":{"observed_at":"2026-08-07T14:37:21.884021Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.223532Z","title":"Soylu, A","venue":null,"work_id":"621768bd-b08d-4376-9add-05c38e8a0039","year":2017},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.486850Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:cf26f5c93b2ba2bf078b2e586d86cf36cd2bdf2d7f192fee2c00e609cb8e2ea9","observation_id":"607b0f89-1c71-4993-aa97-b61267b9d782","resolution":{"observed_at":"2026-08-07T14:37:30.256064Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:30.138460Z","title":null,"venue":null,"work_id":"07d9e178-1acd-4de4-bc57-be56cc07edfc","year":2012},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.601199Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:53c40b3c205dfe6ad1adde2967c14c6dc5f724c0c552d6b114c7e249cc1d560b","observation_id":"055e6082-7049-487a-89b4-96a67a306c1b","resolution":{"observed_at":"2026-08-07T14:37:30.165972Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:29.992550Z","title":"Vinyals, M","venue":null,"work_id":"ad6d85f2-1300-48a2-ab82-8c78d0897997","year":2015},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.685896Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:2d7ae1a40624dff7dcf9e84b7c4963884323c869a3bec37d1f1a5e3435fed6a0","observation_id":"2ce41124-024f-4ab8-84a1-92c136db9edd","resolution":{"observed_at":"2026-08-07T14:37:30.064632Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:29.783938Z","title":null,"venue":null,"work_id":"2ba006c7-f984-4619-87b8-dbd23a126da8","year":2018},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.753882Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:c7a1648ddc8e29434bc36a4ab19ec0d4404fe761c9df3a4918405013e575253a","observation_id":"5da8fa55-e279-4a15-9144-8710a527a13d","resolution":{"observed_at":"2026-08-07T14:37:29.870572Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"1906.01227","last_updated":"2019-10-14T11:31:45Z","snapshot_observed_at":"2026-08-06T10:54:26.264740Z","submitted_at":"2019-06-04T06:51:45Z","title":"An Efficient Graph Convolutional Network Technique for the Travelling Salesman Problem","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1906.01227","snapshot_observed_at":"2026-08-07T14:37:16.834961Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.834961Z"},"links":{"cited_paper":"/paper/1906.01227","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:ee3e18940930bc72a39011fa1adb92ac8ec81a38be9cd25c634058444e332da9","observation_id":"9346f039-b7c5-4ead-a49a-d18326e58dc2","resolution":{"observed_at":"2026-08-07T14:37:16.834961Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:29.557065Z","title":null,"venue":null,"work_id":"6ae27723-98d3-4501-a8c1-cffab7b8d1c0","year":2021},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:16.946245Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:1110e6b1379a92ec9190116780067f7ad2dc8c53c45fcb38243d075b89cded06","observation_id":"b7b1fd6c-e220-4b44-a0bb-681cc91b9927","resolution":{"observed_at":"2026-08-07T14:37:29.661241Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:29.350823Z","title":null,"venue":null,"work_id":"b13096e7-6689-482b-8ddc-b84ec9db5f62","year":2023},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.113477Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:2fa551f102c312fd30d3b558f69d1b44cd13fe39b5eab853bb1a5c5631f4ff5c","observation_id":"4517237d-c2be-4e53-b6d9-d0e0db30d8af","resolution":{"observed_at":"2026-08-07T14:37:29.456149Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/0001106","last_updated":"2000-01-28T22:12:03Z","snapshot_observed_at":"2026-07-07T07:02:58.841967Z","submitted_at":"2000-01-28T22:12:03Z","title":"Quantum Computation by Adiabatic Evolution","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/0001106","snapshot_observed_at":"2026-08-07T14:37:17.218147Z","title":"Farhi, J","venue":null,"work_id":null,"year":2000},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.218147Z"},"links":{"cited_paper":"/paper/quant-ph/0001106","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:e95d4989c5fd7e01612148960e43ecc43554ca7019e5410d33300307c5beb0f3","observation_id":"777cd09c-6db1-4092-8da4-8dc2c7b05d70","resolution":{"observed_at":"2026-08-07T14:37:17.218147Z","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-07T14:37:17.347748Z","title":"Han, J.-H","venue":null,"work_id":null,"year":2002},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.347748Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3f6361e19953fa35afe995cba9a31d02efcd567f10a16cfe6bf009f109cf9964","observation_id":"8587dd3a-66f1-4c56-8971-264f3801897a","resolution":{"observed_at":"2026-08-07T14:37:17.347748Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"1506.08479","last_updated":"2016-10-17T05:45:18Z","snapshot_observed_at":"2026-07-06T04:22:14.860464Z","submitted_at":"2015-06-29T00:27:32Z","title":"Quantum Annealing Implementation of Job-Shop Scheduling","version":2},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"1506.08479","snapshot_observed_at":"2026-08-07T14:37:17.457436Z","title":"Venturelli, D","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.457436Z"},"links":{"cited_paper":"/paper/1506.08479","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:c69d3bb8d9952ecc21c506ccd0aa4a1c26a693d452b67372205f083582f5fb9f","observation_id":"87615a6c-1e1d-4524-9d63-f1a55528ebb7","resolution":{"observed_at":"2026-08-07T14:37:17.457436Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:29.166482Z","title":null,"venue":null,"work_id":"3e78383d-2f35-4f7f-afd3-6c8a4a373863","year":2019},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.536158Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:abfbfedaabb520d7eae32f2cb50e104520892da8154f8054e41b97a30ac09433","observation_id":"503cc645-9dca-41ee-99b4-29e54aea74da","resolution":{"observed_at":"2026-08-07T14:37:29.249954Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:28.956939Z","title":"URLhttps://www.math.uwaterloo.ca/tsp/data/","venue":null,"work_id":"a60b2237-4a59-4680-9bdf-3257f179a9b9","year":2025},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.625913Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:68f4facc499d9c05d7ae4d30fb4d200284c7990f4636a88258ed3524499b3990","observation_id":"6d9228ea-11f0-4246-ad81-7fec1d03e69c","resolution":{"observed_at":"2026-08-07T14:37:29.055003Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:28.611497Z","title":"URLhttps://www.math.uwaterloo.ca/tsp/data/ml/monalisa.html","venue":null,"work_id":"22003dd5-4c6c-45a9-a0e1-28090ebe8099","year":2025},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.711018Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:4b184ec3755b52c1a9d99627182d0df2b4037f4df2079b09b63c2ba0467c39c6","observation_id":"738de44e-e705-4f6f-8d82-8b11457066f7","resolution":{"observed_at":"2026-08-07T14:37:28.790747Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:28.272513Z","title":null,"venue":null,"work_id":"28bbe7f6-d330-4c04-aa47-94497df82c08","year":2025},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.782912Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d68e2345224d460062142e0de6523d030b70e3954a2d232f0ff3ee61e22a96d3","observation_id":"09b2ab8c-8994-4fe0-8911-a7528ef85741","resolution":{"observed_at":"2026-08-07T14:37:28.428007Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:28.106143Z","title":"Geological Survey, Usgs national transportation dataset (ntd) downloadable data collection, usgs, accessed: 2025-03-23 (2023)","venue":null,"work_id":"7b13d813-85b8-4c3a-9a82-c1be1bca03e0","year":2023},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.868754Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3f593a7b25be335cd36b9b1ddf68eb30813b829a092e11808b0f48835d659653","observation_id":"fd8c9070-84c7-413c-8cbe-8ace25425bab","resolution":{"observed_at":"2026-08-07T14:37:28.171220Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.961725Z","title":"Reinelt, Tsplib—a traveling salesman problem library, ORSA journal on computing 3 (4) (1991) 376–384","venue":null,"work_id":"5b443c1a-85c2-465a-84d4-f64afc7b4634","year":1991},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:17.949149Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:8cc85aae36d7daa08a48cf6aeb36fef824a027f125e94bd57538b6b94bb122b1","observation_id":"bf19d51c-0741-47c2-84b2-c072b28057c8","resolution":{"observed_at":"2026-08-07T14:37:28.020198Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.846186Z","title":null,"venue":null,"work_id":"1ecf1ee9-1dec-4c89-8a9d-723fb725b1c4","year":2004},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.027867Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:490cedfe2f2a330e6916c9d4408c52c8b707a33e221e7d5d242c758937df4efa","observation_id":"50c36699-183f-410b-937e-501cc541a59d","resolution":{"observed_at":"2026-08-07T14:37:27.893991Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.684063Z","title":"Basel Iii, T","venue":null,"work_id":"8bb6779d-af8e-4bd0-bce1-69fe8d173693","year":2001},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.120670Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:0a34e03cdf93693d587ae1ed1e29bcad1b06389bb8665935b7c93b8586e4d6bf","observation_id":"197d8806-680b-4301-a5c8-4e2ee646b76b","resolution":{"observed_at":"2026-08-07T14:37:27.764158Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.544698Z","title":null,"venue":null,"work_id":"ac601a3b-635b-480b-ad21-6126287b15e8","year":2014},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.188410Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3978ae16e7278ecc00cd252d87ada56a2b68501f772d22b6820090868894301a","observation_id":"ca50b037-4243-4d66-b569-74e041e10975","resolution":{"observed_at":"2026-08-07T14:37:27.611111Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.411024Z","title":null,"venue":null,"work_id":"beb0e4db-8073-4687-b469-bc82d31660c0","year":2023},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.255637Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:5d0d3789ee677217bdbc68766062cc756c23d4f4b6f0a104d5685cd05e4f462c","observation_id":"d9308c8f-fa15-4ff2-b812-a378e52366ae","resolution":{"observed_at":"2026-08-07T14:37:27.467531Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.245862Z","title":"Janson, D","venue":null,"work_id":"fa45a10c-f53c-4bb1-8153-8d47e2ac0697","year":2005},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.333238Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:84bd2cac9ffea9b90219a6c6d41e03ccbae6d5d16b5b5755a7d1b6fba778746d","observation_id":"c448ab54-e7fb-4932-88e1-bfb0595e4b2c","resolution":{"observed_at":"2026-08-07T14:37:27.319919Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:27.113701Z","title":"Sohn, Generalized speculative computation of parallel simulated annealing, Annals of Operations Research 63 (1) (1996) 29–55","venue":null,"work_id":"ff58377c-f74c-42cd-a3f1-08fbc4327fe7","year":1996},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.418105Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d5755ac482c5cc16b0c1f54e40817615a261ef15acf3e495fd438a5e428847c7","observation_id":"88c58f57-c822-4891-a1ea-293975e3aca9","resolution":{"observed_at":"2026-08-07T14:37:27.175881Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.960988Z","title":null,"venue":null,"work_id":"677c1b08-aa04-427b-b928-e8b335d58adb","year":1991},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.490427Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:19c32254ebda0c7c8e61735cc4e640e0e3b99eb1efd50d9089cbde3b491f2a58","observation_id":"53eed978-1de6-4432-a563-0aa26d509707","resolution":{"observed_at":"2026-08-07T14:37:27.040525Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.824764Z","title":"Yavits, A","venue":null,"work_id":"54b0f41e-f52a-40ca-ae0a-ffc46abfa594","year":2014},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.608597Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:e34f2b628741604ac84199d8b5c2408fcd3e046aca36ca0673f598ee3a682d7c","observation_id":"53a61a43-c1b3-4fa9-8cff-2140fae773be","resolution":{"observed_at":"2026-08-07T14:37:26.888850Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.659596Z","title":"Bertuletti, S","venue":null,"work_id":"980c2f99-2136-4d6b-8d41-f51a61c1e2e3","year":2023},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.688515Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:5db346ef6b6b9aa40c20d84c8e2e8133976d063c72a76887c9d94b56ed0ed560","observation_id":"9790f9f1-372a-429d-aaa0-d4a9aadcbd63","resolution":{"observed_at":"2026-08-07T14:37:26.728365Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.507808Z","title":"Koziris, G","venue":null,"work_id":"c6d7b9ac-6253-4acb-8886-61cd4d2d6afd","year":2021},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.767514Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:8e814813d1009977b2f65864e9d4c787c96a9a8bcd8d86d4c48eff473595d6b3","observation_id":"8f2ac862-a15d-4162-8e3d-e77cbfacb5f6","resolution":{"observed_at":"2026-08-07T14:37:26.602141Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:18.859642Z","title":null,"venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.859642Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:75daf3275f5ce5b94002364bc3ee41d2bf56593300e9da6124e52730364c7a3c","observation_id":"70adfae1-d5dd-4365-b388-0794488f15e5","resolution":{"observed_at":"2026-08-07T14:37:18.859642Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.345793Z","title":null,"venue":null,"work_id":"21ee7a6c-4b38-4e95-bd95-55095db74736","year":2007},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:18.942845Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:020f44a6071896a304fcf11b7b1c8190d3d87dc97c1db831f560b00f2ac2b94c","observation_id":"ace1cd8f-e820-4dcd-a019-3e896b02e152","resolution":{"observed_at":"2026-08-07T14:37:26.402588Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.216605Z","title":"39, 2025, pp","venue":null,"work_id":"4e11d149-6e60-45b3-9829-67c9e31c6c6f","year":2025},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.040533Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:baafcb0678c879c918d17f9788c2d748d3e59e3b07992765d9897971aba0186e","observation_id":"c62d73db-e32f-4f84-8774-d81e5ed135b2","resolution":{"observed_at":"2026-08-07T14:37:26.270767Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.ejor.2010.09.010","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:21.619677Z","title":"URLhttps://www.sciencedirect.com/science/article/pii/S0377221710006065","venue":null,"work_id":"e5fda113-5f3f-42ed-b882-9ecaddd8256a","year":2011},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":64,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.119975Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:77b326e774b17daf7e5f5357d75349c686a05d4282f0ca9b59e6f2d3448b5036","observation_id":"db972259-7a1b-4a60-af04-4eac3f5aafce","resolution":{"observed_at":"2026-08-07T14:37:21.722906Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:26.053228Z","title":null,"venue":null,"work_id":"57a1295c-acae-4031-a90a-e08d8aa970a2","year":1962},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":65,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.194443Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d0ca6913a00f5279501445f7c28f6c2460efa3414c999897327f47ea555e5b03","observation_id":"485a1499-cd3e-49e2-ab4c-05a991afa84f","resolution":{"observed_at":"2026-08-07T14:37:26.120871Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.929590Z","title":"Catanzaro, L","venue":null,"work_id":"5a9d4de9-2745-42e3-9196-dfcf0e4ce5db","year":2015},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":66,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.289688Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:33d4f7b6755076d538e87bab30081feb93901e54739c889c016cd197f0755d46","observation_id":"35adb541-d521-4817-b289-da854875d8dd","resolution":{"observed_at":"2026-08-07T14:37:25.971095Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.790922Z","title":null,"venue":null,"work_id":"29fdffe8-a0ba-4656-9c52-726c420d165b","year":2001},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.387655Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:2d03bd6b9cfda920d5129855bc4151f59ca6afe18efe379d659dfb25e486c81c","observation_id":"0e4d18a7-9490-4bd6-9003-8571086c61b3","resolution":{"observed_at":"2026-08-07T14:37:25.867908Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.651988Z","title":null,"venue":null,"work_id":"acd1f7a8-d392-42e0-927f-c9bed757fc96","year":2017},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":68,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.469062Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:4ffd8dac7f71d1e99a2a8066bc284097b2951fe601142e9b9998a06dcf057e34","observation_id":"2545222b-55ad-4187-be4c-45974015ee0d","resolution":{"observed_at":"2026-08-07T14:37:25.715970Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.486948Z","title":"Alba, Parallel metaheuristics: a new class of algorithms, John Wiley & Sons, 2005","venue":null,"work_id":"c17e27e4-8b76-4b93-9631-24caa66a8d6f","year":2005},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":69,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.534502Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:3e2bc1a5d02afe1c91cb5022930507f4c074227247000b99649b171394e10852","observation_id":"7ccb1ade-3969-4976-bd3a-bfa8c8264537","resolution":{"observed_at":"2026-08-07T14:37:25.557505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.302642Z","title":"Abdelkafi, J","venue":null,"work_id":"e4d30ac2-79a1-4c5b-8675-10ba2f726248","year":2014},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":70,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.611087Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:23083783985608ed7c788986db7f2dcd3dabcffe15d031852ed83339c90d5e73","observation_id":"0226cee7-4357-42a9-9f88-501f0eccda0a","resolution":{"observed_at":"2026-08-07T14:37:25.359542Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:25.186489Z","title":"Melab, E.-G","venue":null,"work_id":"2bc04254-22ea-4205-802f-78555e1f741e","year":2013},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":71,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.667304Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:77b772554f09ac7f7a89b995d2682df075b13fe396ffd628023fabdbb949606b","observation_id":"87341b7b-ca49-4a63-8a2a-614c004371ce","resolution":{"observed_at":"2026-08-07T14:37:25.230959Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.973477Z","title":"Skinderowicz, Implementing a gpu-based parallel max–min ant system, Future Generation Computer Systems 106 (2020) 277–295","venue":null,"work_id":"2ab8da60-3dcb-4a1c-84f6-34156b4366e2","year":2020},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":72,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.731092Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:f7d5d9241adf40eeefb8cfd90df2c930a331e3401f52a07874ee47a7c6c3cd78","observation_id":"27a5f76e-0c7d-4086-8484-2e6cc67acbc2","resolution":{"observed_at":"2026-08-07T14:37:25.047846Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.854526Z","title":null,"venue":null,"work_id":"cbe3c11b-f690-4e03-a740-38699aff8907","year":2021},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":73,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.814609Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:1f15f077f01374cf6e436aec186e533cdcfeeb2bf08ee77e9fa31b2f6e67a135","observation_id":"60823c43-5ba7-452c-8ef7-ffc4f8849cd8","resolution":{"observed_at":"2026-08-07T14:37:24.909406Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.717148Z","title":"Zhang, Depth-first branch-and-bound versus local search: A case study, in: AAAI/IAAI, 2000, pp","venue":null,"work_id":"05d7c158-af2f-4235-ad87-098a02518e16","year":2000},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":74,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:19.917597Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:ee850b46f9d7b7342a207155251b122872afbf2fb4812c37b683a684e10ab7c9","observation_id":"e5ae588d-d611-42d6-99cd-35aa32ca2004","resolution":{"observed_at":"2026-08-07T14:37:24.798967Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.546215Z","title":null,"venue":null,"work_id":"e2a8ecc2-816f-4cb6-897c-114146b7ad09","year":2011},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":75,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.048904Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:6118bf6ab86794368854b5b6be25420e7a3b4df8c6013bb2df08f206fc2b2d55","observation_id":"86e0ca11-c30d-4c45-b658-1bb75e29b213","resolution":{"observed_at":"2026-08-07T14:37:24.617443Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.363950Z","title":null,"venue":null,"work_id":"33d3a0cd-b0cf-4a8e-8f8d-50fdb46a3a72","year":2008},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":76,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.152025Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:b0ed07bcb6adf0881572edadc57fefd539ed0816f8de849a87f06378feff9a91","observation_id":"4c424a9b-768e-44ff-a942-0716e5ce47e6","resolution":{"observed_at":"2026-08-07T14:37:24.473590Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":{"arxiv_id":"2412.14995","last_updated":"2024-12-19T16:07:00Z","snapshot_observed_at":"2026-08-06T16:02:22.309330Z","submitted_at":"2024-12-19T16:07:00Z","title":"HSEvo: Elevating Automatic Heuristic Design with Diversity-Driven Harmony Search and Genetic Algorithm Using LLMs","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2412.14995","snapshot_observed_at":"2026-08-07T14:37:20.282514Z","title":null,"venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":77,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.282514Z"},"links":{"cited_paper":"/paper/2412.14995","citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:8201f6f02ec98d981e4a77c9ddce7d99b8d013668e9e1b7814812f5600e38abf","observation_id":"1daa9562-f424-453c-9897-32e60fff3000","resolution":{"observed_at":"2026-08-07T14:37:20.282514Z","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":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:24.204595Z","title":"Kshirsagar, S","venue":null,"work_id":"a44775d7-f0aa-4b1f-96e6-2608ead68e54","year":2016},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":78,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.378064Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:9254706e7b1bb65fc7eba16826c52bb0f094b6a8a162aedda3187b0dfafcc405","observation_id":"6285b544-e4c7-4f11-8c6c-647d0beab10b","resolution":{"observed_at":"2026-08-07T14:37:24.284505Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.991656Z","title":null,"venue":null,"work_id":"780d7f84-5af7-40f1-836c-a3aeb01ca77d","year":2012},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":79,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.457061Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:becffc06f51e20b3bfb5bba90d658b7bb35b2b78bec4dcd956f3e516d4a98813","observation_id":"22bf57bb-b9ee-49f2-aa4a-02c8e57de9e9","resolution":{"observed_at":"2026-08-07T14:37:24.106875Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.827691Z","title":"Saxena, M","venue":null,"work_id":"8eae1812-1ab1-42ed-9fa1-1e956d1a346c","year":2017},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":80,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.572573Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:a22f99a91c96d7a03c1b23b9a6a708c82bbd272bf17b0e115d88ceb20e74c617","observation_id":"feba7b0c-4f15-45ee-b60f-cf0ef74580da","resolution":{"observed_at":"2026-08-07T14:37:23.901335Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.625454Z","title":null,"venue":null,"work_id":"35a7a68d-6d3a-4e65-9ef6-2097870235e2","year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":81,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.706841Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:648f0fef1bb7a44b437b91bec5fdb1f4a2b7a0ba0d709d588357f3d17113a2fd","observation_id":"c262da0b-5d55-4b48-a43d-19487efd7dca","resolution":{"observed_at":"2026-08-07T14:37:23.727358Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.437652Z","title":null,"venue":null,"work_id":"f48ca5d8-8c1e-4423-9b8c-d2a21ed8db17","year":2020},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":82,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.799867Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:eaefa9e655178edafe9f81fbf80ccc7365a27f8d57022344d0dbadd0f4a061d9","observation_id":"2f7e18ae-b3fa-4bc0-824d-6aaf19a751c2","resolution":{"observed_at":"2026-08-07T14:37:23.523053Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.249661Z","title":null,"venue":null,"work_id":"6adbe027-f232-4e2b-a8cf-8370ba831397","year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":83,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.904583Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:72e14576757c3e018cf8a35a86144de7655a97e0591001b926415f43ae9c2d47","observation_id":"a770923b-3a3a-43f9-8f2f-897d64590953","resolution":{"observed_at":"2026-08-07T14:37:23.318948Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:23.006005Z","title":null,"venue":null,"work_id":"991ce650-aab1-4082-a247-e45bbfb1df79","year":2025},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":84,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:20.986974Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:d304a21bdf8898b04926ddd1a2f7da7e72ea8d6615a5779d032840afc1b0f01b","observation_id":"34043318-0a80-4c0f-b4fc-8e5561cf8dcf","resolution":{"observed_at":"2026-08-07T14:37:23.116549Z","resolver_source":"raw_fallback","status":"unresolved"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:22.837114Z","title":"Hudson, Q","venue":null,"work_id":"e4be0c66-9547-4514-91d4-f05371a8fefb","year":null},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":85,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:21.111036Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:6100b81a9556d360a4d807d3e0088077729905c2620e9fb976c2f3e81fa1ece0","observation_id":"acc05a7f-d1c2-4487-999e-6190038f3877","resolution":{"observed_at":"2026-08-07T14:37:22.929221Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":"raw_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:22.684361Z","title":"Ouyang, Y","venue":null,"work_id":"792c6165-d224-4a37-a5aa-85c2561c7337","year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":86,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:21.210800Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:c7d288ffd4a7b7b31ff6a08751d51632e884ae46570ac2aad9a95b3ffe4e6be1","observation_id":"86497501-87f4-43b0-8684-5dd41a35c638","resolution":{"observed_at":"2026-08-07T14:37:22.737829Z","resolver_source":"raw_fallback","status":"verified_fuzzy"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1016/j.aej","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-07T14:37:21.387204Z","title":"Linganathan, P","venue":null,"work_id":"2381ec07-4705-49a4-a0e1-b64b5b7cca4e","year":2024},"citing_paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem","version":1},"reference_index":87,"source":"pdf_text","source_observed_at":"2026-08-07T14:37:21.294779Z"},"links":{"citing_paper":"/paper/2505.18278"},"observation_digest":"sha256:435063757033951ee2f42dfe92fede30926ab4c155cb9286016c57702e53c534","observation_id":"29f14cff-ff6f-47bf-9592-ea08316a29dd","resolution":{"observed_at":"2026-08-07T14:37:21.513209Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-07T06:34:17.273281+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"state":"measured"}}],"paper":{"arxiv_id":"2505.18278","last_updated":"2025-05-23T18:14:24Z","latest_version":1,"primary_category":"cs.DC","snapshot_observed_at":"2026-08-07T14:31:52.364578Z","submitted_at":"2025-05-23T18:14:24Z","title":"A Comparative Review of Parallel Exact, Heuristic, Metaheuristic, and Hybrid Optimization Techniques for the Traveling Salesman Problem"},"reference_resolution":{"displayed":87,"state_counts":{"malformed_identifier":2,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":42,"verified_exact":5,"verified_fuzzy":38},"total_outbound_references":87},"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-07T06:34:17.273281+00:00","source":"crossref"},{"observed_at":"2026-08-07T06:34:11.927384+00:00","source":"retraction_watch"}],"thesis":"As of 8 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2505.18278."}