{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001023306,0.000861435,0.0007249435,0.0002429885,0.005930908,0.002141603,0.009517097,0.0005275181,0.0000355624],"category_scores_gemma":[0.0001804454,0.0008408802,0.001201978,0.00041281,0.001888107,0.0009729138,0.006161014,0.00118576,0.00007934355],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004337142,"about_ca_system_score_gemma":0.0007867282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003108522,"about_ca_topic_score_gemma":0.0007346428,"domain_scores_codex":[0.9951584,0.0002606181,0.0005202797,0.002515528,0.0002085364,0.001336646],"domain_scores_gemma":[0.9923997,0.001159388,0.001155429,0.00433784,0.0005100857,0.0004375879],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004286877,0.0004160112,0.001364346,0.0002176608,0.0007757721,0.0001862013,0.0004965804,0.006558309,0.00007962741,0.953407,0.002133955,0.03393588],"study_design_scores_gemma":[0.001444105,0.0003344613,0.001246418,0.0001645593,0.0002088962,0.00001397332,0.0003827523,0.6689736,0.0001137135,0.2817783,0.04434032,0.0009989354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05685282,0.0005078109,0.9224848,0.001630099,0.0106352,0.002540118,0.0002583152,0.0003224669,0.004768406],"genre_scores_gemma":[0.9795997,0.00167752,0.004457156,0.0001291413,0.0005895706,0.00001135658,0.00002903671,0.00004864324,0.01345791],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9227468,"threshold_uncertainty_score":0.9994042,"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."}}