{"id":"W2952355925","doi":"10.48550/arxiv.1406.0941","title":"Augmentative Message Passing for Traveling Salesman Problem and Graph\\n Partitioning","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Travelling salesman problem; Computer science; Cutting-plane method; 2-opt; Mathematical optimization; Message passing; Graph; Optimization problem; Combinatorial optimization; Context (archaeology); Graph partition; Domain (mathematical analysis); Benchmark (surveying); Theoretical computer science; Mathematics; Algorithm; Parallel computing; Integer programming","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00161525,0.001238059,0.0009392067,0.0007502878,0.0006826775,0.001279106,0.001697868,0.00140194,0.006181532],"category_scores_gemma":[0.006554586,0.0004310666,0.0008361513,0.001104266,0.001155455,0.003221305,0.001507683,0.002126954,0.0007633406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250282,"about_ca_system_score_gemma":0.001057974,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003124557,"about_ca_topic_score_gemma":0.00321718,"domain_scores_codex":[0.9991628,0.0003984677,0.00002777033,0.0001553841,0.0001496276,0.0001060506],"domain_scores_gemma":[0.9973356,0.001850447,0.0002287068,0.0003450519,0.0001449643,0.0000952305],"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.0002416557,0.0002109004,0.0004799119,0.0002989334,0.00004572319,0.0001562398,0.0002751337,0.6871096,0.00378176,0.1647818,0.008163524,0.1344548],"study_design_scores_gemma":[0.00002553309,0.00006766167,0.0000704578,0.00001503053,0.00001258645,0.00003877251,0.00003172809,0.9447613,0.001229476,0.04989606,0.00384355,0.000007870182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02444677,0.0003259675,0.9659679,0.0007101814,0.00007384869,0.0001583195,0.0001244911,0.0005226695,0.007669868],"genre_scores_gemma":[0.3601775,0.0005187341,0.6286242,0.0002913415,0.0001494245,0.0004489642,0.0003996628,0.0002222953,0.009167853],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006181532,"threshold_uncertainty_score":0.0206793,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08733762938479313,"score_gpt":0.2390427468014967,"score_spread":0.1517051174167036,"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."}}