{"id":"W1985734068","doi":"10.1016/j.tcs.2014.02.026","title":"The Covering Canadian Traveller Problem","year":2014,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"Travelling salesman problem; Shortest path problem; Routing (electronic design automation); Competitive analysis; Computer science; Mathematical optimization; A priori and a posteriori; Set (abstract data type); Path (computing); Variation (astronomy); Operations research; Mathematics; Upper and lower bounds; Theoretical computer science; Computer network","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002602019,0.000114858,0.00009493804,0.0001247337,0.001383738,0.00124394,0.00294189,0.00003273793,0.00002636861],"category_scores_gemma":[0.0000952812,0.00007416559,0.00003534173,0.0009258762,0.001724673,0.0004262011,0.0005030858,0.0001763203,0.0001512821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007367177,"about_ca_system_score_gemma":0.0003252185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000282791,"about_ca_topic_score_gemma":0.0003131177,"domain_scores_codex":[0.9979329,0.000127742,0.0001866507,0.0004436464,0.0005574198,0.0007516862],"domain_scores_gemma":[0.9982722,0.0002619723,0.0000314775,0.0006994912,0.0001819202,0.0005528835],"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":[6.567734e-7,0.000005080237,0.00001544923,0.000001262662,0.000001023759,9.091128e-7,0.0002095132,0.001192511,0.00003057776,0.9347706,0.0001314797,0.06364089],"study_design_scores_gemma":[0.00008995572,0.00007037209,0.0002482817,0.000007517549,5.549247e-7,0.00000992385,0.000002429118,0.8529435,0.0002600001,0.1359625,0.01028789,0.0001170684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004912054,0.000007459466,0.9477107,0.006204367,0.000353154,0.0001528251,2.911205e-7,0.00010716,0.04497286],"genre_scores_gemma":[0.8530442,0.000006344214,0.1455135,0.00128838,0.00006773992,0.000006800523,2.221544e-7,0.00000525686,0.00006761875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.852553,"threshold_uncertainty_score":0.9999163,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006748960221634481,"score_gpt":0.2194451526924925,"score_spread":0.212696192470858,"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."}}