{"id":"W4387010616","doi":"10.1109/les.2023.3298739","title":"An Approximate Parallel Annealing Ising Machine for Solving Traveling Salesman Problems","year":2023,"lang":"en","type":"article","venue":"IEEE Embedded Systems Letters","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; University of Alberta","keywords":"Travelling salesman problem; Simulated annealing; Computer science; Adder; Ising model; Mathematical optimization; Combinatorial optimization; Algorithm; Parallel computing; Mathematics; Physics","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001989954,0.0003043343,0.0004160328,0.0002681495,0.0003499685,0.0003325358,0.0005818709,0.0004486382,0.002222599],"category_scores_gemma":[0.0006438893,0.0001900801,0.0002873818,0.0004167912,0.0002733076,0.0004524403,0.00024916,0.0005285114,0.0003339008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003698436,"about_ca_system_score_gemma":0.0006279208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001073725,"about_ca_topic_score_gemma":0.001762199,"domain_scores_codex":[0.9998789,0.00003021015,0.000007251695,0.00002319352,0.0000458284,0.00001460079],"domain_scores_gemma":[0.9998916,0.00004095,0.00001052804,0.00002380792,0.00002588667,0.000007293638],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001000015,0.00005686928,0.0005295262,0.0001346006,0.00003662779,0.00007792674,0.00006320638,0.801484,0.02372232,0.0461777,0.001770415,0.1258467],"study_design_scores_gemma":[0.000005843801,0.00002489664,0.00004509093,0.000002481574,0.000003958774,0.00001317172,0.000002855242,0.9941909,0.001676642,0.003000975,0.001030654,0.000002648206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04996665,0.0004650914,0.9391251,0.0001858826,0.00006428047,0.00005962357,0.00004401959,0.0007621373,0.009327222],"genre_scores_gemma":[0.4771738,0.0002542777,0.5190735,0.00008600143,0.00002567461,0.0001949097,0.00009212759,0.00006284107,0.003036848],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002222599,"threshold_uncertainty_score":0.007435322,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02437242235873445,"score_gpt":0.2646234403038393,"score_spread":0.2402510179451048,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}