{"id":"W2949074211","doi":"10.48550/arxiv.1705.02385","title":"The Salesman's Improved Tours for Fundamental Classes","year":2017,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Metric (unit); Conjecture; Combinatorics; Linear programming relaxation; Class (philosophy); Upper and lower bounds; Mathematics; Integer (computer science); Relaxation (psychology); Discrete mathematics; Integer programming; Computer science; Mathematical optimization; Artificial intelligence","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.000874259,0.0009416959,0.0008650932,0.001375018,0.001311921,0.00254492,0.002094065,0.0012403,0.01363912],"category_scores_gemma":[0.007809095,0.0005502913,0.001356336,0.00111367,0.001810351,0.004574894,0.003010879,0.006567307,0.001496269],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003362008,"about_ca_system_score_gemma":0.001570595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005787549,"about_ca_topic_score_gemma":0.006628633,"domain_scores_codex":[0.9992712,0.0001323448,0.00002148958,0.0001717016,0.0002193093,0.0001840145],"domain_scores_gemma":[0.9980512,0.0009118319,0.0001930804,0.0003412245,0.0001840456,0.0003186577],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001405553,0.00009292264,0.0006118664,0.0001675782,0.00002879551,0.0000703854,0.00027059,0.05112197,0.001992714,0.8808748,0.01908811,0.0455398],"study_design_scores_gemma":[0.00003340094,0.0000738096,0.0007300382,0.00006145992,0.00001635361,0.00008553821,0.0001073123,0.2602628,0.0007101262,0.7190563,0.01883659,0.0000262504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3088174,0.003449946,0.4240764,0.007309585,0.0008442235,0.000362616,0.002080045,0.001380216,0.2516795],"genre_scores_gemma":[0.7484562,0.002133484,0.1949766,0.001333964,0.0007700014,0.0003235781,0.002871284,0.000745936,0.04838883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01363912,"threshold_uncertainty_score":0.04562742,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.125365298800189,"score_gpt":0.2233440680330669,"score_spread":0.09797876923287782,"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."}}