{"id":"W1982991648","doi":"10.5555/365411.365430","title":"Optimal covering tours with turn costs","year":2001,"lang":"en","type":"article","venue":"","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Arc routing; Travelling salesman problem; Mathematical optimization; Computer science; Routing (electronic design automation); Approximation algorithm; Path (computing); Computational geometry; Polynomial-time approximation scheme; Class (philosophy); Completeness (order theory); Arc (geometry); Time complexity; Mathematics; Algorithm; Artificial intelligence; Geometry","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.00006631308,0.00005332564,0.00004476774,0.00005079175,0.00006171329,0.0001055045,0.0001683768,0.00001382854,0.00004059494],"category_scores_gemma":[0.000005626237,0.00004206554,0.00001352784,0.0003104357,0.00000773496,0.0003513553,0.00004852973,0.00003512669,0.00004302052],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002544444,"about_ca_system_score_gemma":0.00003543127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001291248,"about_ca_topic_score_gemma":0.00001388876,"domain_scores_codex":[0.9995118,0.000009812275,0.00006165862,0.0001520998,0.0001535618,0.0001110333],"domain_scores_gemma":[0.9997253,0.00002752619,0.00001944243,0.0001270582,0.00005158971,0.0000490545],"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.00004024938,0.0001128934,0.003690576,0.000004727843,0.00003101132,0.0001113319,0.0003458705,0.6167158,0.001754282,0.1646324,0.004226751,0.2083341],"study_design_scores_gemma":[0.0008543885,0.0003411852,0.01822763,0.00001878059,0.000005401648,0.0004191877,0.00004780451,0.9219952,0.008366284,0.0005813133,0.04875666,0.0003861827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2581751,0.0000177186,0.7297089,0.0004352931,0.00008345208,0.00003634907,1.389934e-7,0.00007281663,0.01147031],"genre_scores_gemma":[0.8614593,0.000004460243,0.1363461,0.0003388581,0.0000657809,0.000003090599,0.000002197351,0.000002360035,0.001777906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6032842,"threshold_uncertainty_score":0.1715383,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009435230428336246,"score_gpt":0.2238616418722822,"score_spread":0.214426411443946,"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."}}