{"as_of":"2026-08-15T05:31:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:3af87f336087b5dc9f0f8d1ea53f6242c81e131d93e4f26f04aa2b303eb8fec7","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-14T06:32:32.682623+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-11T02:16:25.849562Z","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:be9d5d12b66daf1e96602e357df81632f40271625c99449d95f0e1d7593a9cbb","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-11T02:16:25.849562Z","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:8f31201482d9ee314417c85b3123257b3f2f11faea610070540292e04d326b2a","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-11T02:16:25.849562Z","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:66cbdad85f821ae22e110c04ffa59e32e5b6a7a396d365227e103ca41b59fe0c","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-11T02:16:25.849562Z","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:bf9429e94ee6c3cdda99bdb89143e7c373dae5955603fc27ba33cf03de6c3dbe","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-11T02:16:25.849562Z","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:6757ba814c15b164fd18fa7c62200da0651698e680d5d0aaba0dc27225051c44","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-11T02:16:25.849562Z","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:d2d49a2bb4ff2ad5fff85e44aae1eebf10479b0816fcef3cbd9edb37b069599b","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-11T02:16:25.849562Z","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:8b1ce175612062be5cbab3beff949632877b46210dac9287ba8a6e953faba465","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-11T02:16:25.849562Z","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:24229f2f0f4ac0460ad6b980b3c4ca6de776344276c2c4f191f5b02d46296c79","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T16:00:45.096938Z","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-11T02:16:25.849562Z","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:1b3b5714c06f6e5b55781e9980f11aae7295c2a825fcc12a74f9ba6c28a96fb0","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:54c9bd2eefd9a740ec14a44c01c31822157e11c1ba78c9fbf44d14d6fd185556","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:6f23be3b8d82bf554fd204cf97aac4495c7118bd67a262e2f64d232059712cae","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Ladányi, T","venue":"Lecture notes in computer science","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-11T02:16:25.849562Z","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:47be925acd0cd8051a5e15e18b20184c2a493c3c204302ecc3beac96e197b866","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-13T19:37:47.540029Z","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-11T02:16:25.849562Z","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:4529ca648c4665cda8f3b238a4b2a4fe1c5e974c2d883682e057961f09f71799","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-08-13T21:14:20.886340Z","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-11T02:16:25.849562Z","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:5e912cf2af5fcfdf1b24a2296dd2f8251a7ba3318952e93fd9bd72760f1de543","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-11T02:16:25.849562Z","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:6ccb88b0fd15a0fce96d19b7bbce7d2838c903e682c996c36b121a361629fd1b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:754bd4a76802e504f85aedbc827b45234375c9f117ac6261b02ef11be42c4da3","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:eaef99c01a7cc32633fb76d73d33833632730023376899b5eb75ef58f2c36129","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:7b2baf7c5dd4faff56eba6af79988e01cdb7924620b89da514e8619e397db4e7","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:d5b7eb71eece1cc1e33b9480ca0fe0b0e865d3320429af3e69e34c732c177155","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:3471ee565840149f33973c4251b60772659ff3750352131fc5385e3ed6b34ac9","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:c1840a5cd807fa565112f0c62bc21ec53170f4f44a1c0bfde1c8ee940eaa0d6b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:6d39c3906de959ba374f9c817020bf2f149a839010b944f397ad27e0ab39f4e2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:74b91409522a0b9b00890b755dae3a70b447c94ca4258f86a0ff049de79aa6ea","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:1453f5ae7cfd62c581e0f0360bcafcae86ea9331685ca0dfdf68bee1dc2180c2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:fd400d93c321b5bc0d8bc87ac280b8da60bae73deac908233e9785e0fd1ef1bd","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:ff9c6fbb223ecb2d1bf90830955f35a867b69658880dca838e909c19af6dbdcf","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9397e4eaa4f259dd8021681a608f56cfc4b1c4f1c54172a3cb34b77fb57fa736","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:e5905a896a4658a3813aa023b40ae6af9aa4a9ef9ebd42d91d6e3c6780175a5c","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:972b7957f718e7758c08aa5f0877ecf1c297e0bc9277f39642340e1911526b65","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:67c9d0df59331daa87c2efd8c2923d641beaa818084768da30d1ca79799e8c8c","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:8550a9a3e0cc95ee72030bbe0969a97c1b3605fa1d65fb3c8916172353fce300","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:81683cf4c65da1ab797a196395e882571b5a7fcd7d8b67f36eb56b75b370e476","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:26cb5a66fd8ce0a9f7dc56045577c31c7114b3e3e77f37fe02997ee3af5717c2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"Dudek-Dyducb, T","venue":"IFAC Proceedings Volumes","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-11T02:16:25.849562Z","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:d4b5fb0b2f3fa930c5ae2325d97b1495864c98842f3f0ae98492a9bb75d94e87","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:47a93fbe6bdcc6e88d1c95f0ede30103a2c19dfa862a01f7ca1f196345f6daf4","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:355815d1229dd154a93d59893b8ad2e79c8c0896aed65f17a21c83242f241c52","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:65e2225db267c1b8e9b9b87a39405471e2624e60c8d075c8e68ada8b914515a8","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:3faa4c58ccb6f188d41efd4ac7c5532164c0572698010735505395f2e62c75fd","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-14T16:21:23.234747Z","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-11T02:16:25.849562Z","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:74fefb88001f50f4fd772d50a15b9b6af8ccde2ea0eac0f874a7dc09fa32bfc2","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-11T02:16:25.849562Z","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:92326e7afa07066a4a2cbc3d15ef57687706f49c327225867daa6d8481510b8d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:e303e506b39e28104cda79ba1eeb10686895035cb380b37ced83cbb7082716d9","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:89bebe20fe6670e60322abedf87aaf8ae3c25e1969fa8ce36a2080917f9331b8","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-11T02:16:25.849562Z","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:646a81189e0f9b306109a76330e3b31f3f2d1ca5c21f5c82f2f1ce8a3ed78033","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-08-14T22:42:38.028621Z","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-11T02:16:25.849562Z","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:af1ab16c718991264ec82fe544e38e13ac56fa9ef8fbbe5de78d3593ecd25c49","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-11T02:16:25.849562Z","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:93b0d9ab1dbe5c3a8303665d2853d0c9732c3909eaeb09cb67bca3d8e3c6ab57","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:d10387465d3ebb26048c008219175743f96ae7bcac54b7abff4894129e022b53","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:3862c9ff047066c9172ba44ce03db8a9e1640f94c60e52e990069c9822483cf7","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:940d832515358cf4b1ea69163d948ae3944dbde466fa6d4c754b454e2f4b570b","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:77071b66005fde2b4b299491a407a50d804683d4508a0326cc86379a899fe8d6","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:10f66f2d06e8eab9e3d9c85b6b2c789ab4d2fb3aef1de160491646e7f927d707","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:4c3f23b5e7ccd3f167195b29d7406ee985a0ada835bb20d87ed6f4db0b8ed127","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:30cd7bed9133d39b9d8f24ca707202992ac4223601021a3deda4f361cb11db6c","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:4190cc197079875b3d34fa527c290e20ad224d344e0084e3ad88638f4c19fe1d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:3d98e071665bb9be499e96cbac8c9bea68c786e9f76098151b90f93affffb272","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:6171eb34f71b806a45ec4df31ffb196f35c3c390d0fdab3424a3973617cbac50","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9d2c99d96b8068dd9e6db46cd22aeac074c7ff88f10e037793966fd893fd1f30","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:4ee5086335a393640ad18c8897b05dfacc2cd89a28260d72101ea5508135131d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:f8a5288130b786dd6c6e03a1c0d66a61cc3efdcbfe2b558499bd9de34cb18c18","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:390f059587321636e888a4b95916e725dc7adf9ff1214978758bbf8cc6369ce2","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:e3ec9f0f4a8c8297864d22a4eedeec82102dd80112fbe73f82ad49d374ce1ea1","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:c5fb2e9aeabca9318a6439bb7088734459230c4a456a971b03843d926c3388d2","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-11T02:16:25.849562Z","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:5d529595a46c8bb830831909e84a3262b9e9c0608d52f2ec27a10933f32d2296","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9c83367893164daabf3533e2153b75f258c209535d48264f351592581d666eb1","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-10T05:30:23.456663Z","title":"URLhttps://www.sciencedirect.com/science/article/pii/S0377221710006065","venue":"European Journal of Operational Research","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-11T02:16:25.849562Z","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:64d3a3c9d3bc79cfee2ff1567e2872518a18560f8dfa5c335bb48b3c322d30b8","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:ac46d2ae82613183039e716b8928f49ca18e0bcdb8aee4d1b2049ade72ad48a1","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:e0f5a0f02c572826c1249b3be837be6482551b859385f5fbfa4417254c8ad618","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:8c858b45d36de5e4dba6b2c12c15dcdd399a49671660a5885f4e4e0e2c621856","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:8b871dffa17f7a0455e8a0d37291911a9c9a56d0bccf7174287f5bd5418044b8","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:c1f26e2d9fed3c644557d49be363d376bdd2f3a84a15ac406e0855925a9b9328","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:1fd1e98e20c15031faa9911fc0c601cf889b2cac861df5d9cd02fa18a342185d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:0ceaa09c14dbcea57af82a1e569afcc7e8dc35a1ace9ca125bd69d5540f2fea1","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:79152992573c1bbf12eeed4fe53eaa36bc55d78d6b8b88afb471df6cc4acf950","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:336420c990e31009fa73aa2c4f3fff8410a69e9fa2be6f0e04d7d17b55de2d08","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9ea4a045800fd86c21d87dff7b62b2d9e3ea368a0d495fe1fc50047badb90f40","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:ebb08eceb5e286ff45f7a1843214309da1fc588d7daf70928f88fac67b5166f7","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:ab3d9f9fa54b41d1047107eb2a188b560ed0211ce4f97f378d16b0cc3ded1f07","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-13T14:59:12.496857Z","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-11T02:16:25.849562Z","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:27e2fd16f1264f646b642ebfe950c7c9369b80cb58613ce00308ab446e05796b","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-11T02:16:25.849562Z","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:1cef5d9d381c2d903f80c658fdc4617d1b01399b011dd955be51ab4fe8ad5f5a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:8033f4055052f6a581a7894bc11528427afcf5e0994b392bed5dfbdbaa43d652","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9df68a6301189b68298252e606be0740fe2e98004cbad6f4148a19e6bc5d318d","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:a79267c8a47d74adc9caa146bd9a83735a27c6009b21c2effa07ba4d93f1630a","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:175e95adbc7d9ed6aa2c72c69cfbc22d3388c719b29b46fc1d9d38b29184179e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:0242d32e75c65fd0c32f6afd136dcf7ea358a18b94b372c7c49ebbb160e54377","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:5e2670253be5b7009a8a1b8d88784d6ac1592324fd2be5eb15b3591e203e7eb3","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:2211e725453aba9ccaf4b206208a1828a049b3b35ae228d8a1aa87d5f27209ff","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:9cb81b09b2fa07d5573c0390b3dc9d7b36370414b8d882ab4db46e209eff5f1e","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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:345274d032d353006dc0c2270a8899eb6c00e0c8c582782f2f95f61fa630c87f","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-14T06:32:32.682623+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+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-11T02:16:25.849562Z","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-14T06:32:32.682623+00:00","source":"crossref"},{"observed_at":"2026-08-14T06:32:18.44784+00:00","source":"retraction_watch"}],"thesis":"As of 15 August 2026, this Paper Citation Record lists 87 of 87 outbound references and 0 inbound Pith citation observations for arXiv:2505.18278."}