{"id":"W2145935606","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph Partitioning","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Computer science; Message passing; 2-opt; Cutting-plane method; Mathematical optimization; Optimization problem; Graph; Combinatorial optimization; Graph partition; Context (archaeology); Theoretical computer science; Bottleneck traveling salesman problem; Mathematics; Algorithm; Integer programming; Parallel computing","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003136221,0.0001189444,0.000131311,0.0000786575,0.0001945118,0.0000405909,0.00007649889,0.00005746942,0.000009760581],"category_scores_gemma":[0.00003024683,0.000147585,0.00004271645,0.0002369685,0.00005211182,0.000212665,0.00002107641,0.00008805986,0.000002644772],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004575869,"about_ca_system_score_gemma":0.000007048734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000465133,"about_ca_topic_score_gemma":0.000008117472,"domain_scores_codex":[0.9993474,0.00007038481,0.0001148552,0.0002327664,0.00002777893,0.0002068438],"domain_scores_gemma":[0.9995515,0.0001759971,0.00004340913,0.0001107539,0.00004195493,0.00007639504],"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.000009222945,0.000007939241,0.002573682,0.00006804014,0.00003750775,0.000002397256,0.0003381615,0.9447283,0.000943612,0.04962218,0.00002809056,0.00164083],"study_design_scores_gemma":[0.0006841544,0.00003015299,0.0008909305,0.00005155997,0.00005197663,0.00000166855,0.0002618489,0.9818016,0.001506095,0.01436313,0.0001557072,0.0002011965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.230281,0.00001211327,0.767456,0.00001353625,0.00005048063,0.0001276811,0.000003389227,0.0001962597,0.001859544],"genre_scores_gemma":[0.9374996,0.00002145101,0.0622932,0.00002147833,0.00002975214,0.00000159862,0.000007773257,0.00002584552,0.00009927064],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7072186,"threshold_uncertainty_score":0.6018342,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04590610047051673,"score_gpt":0.1944879409977994,"score_spread":0.1485818405272827,"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."}}