{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008928372,0.001073007,0.001596247,0.001285172,0.003429989,0.003894301,0.002810904,0.003830474,0.04324381],"category_scores_gemma":[0.005907326,0.0005624989,0.0007967117,0.004149921,0.002133165,0.004502657,0.001851595,0.002571412,0.002219794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.008870214,"about_ca_system_score_gemma":0.009082076,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.2961692,"about_ca_topic_score_gemma":0.2454481,"domain_scores_codex":[0.9989814,0.0002767617,0.00002637864,0.0001946387,0.0001962423,0.0003244769],"domain_scores_gemma":[0.9985298,0.000622361,0.00008657572,0.0001592016,0.000243907,0.0003581688],"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.0004481674,0.0001302267,0.0009283996,0.0003117495,0.00008160039,0.0002536685,0.00035099,0.08917607,0.0003826855,0.7163422,0.1335944,0.05799989],"study_design_scores_gemma":[0.000203505,0.00008853331,0.001093452,0.0001483292,0.00008012358,0.0003312935,0.001090509,0.2735578,0.0006440895,0.602964,0.1196954,0.0001028727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.2220928,0.004720232,0.218074,0.01748607,0.0007929073,0.0005723504,0.01068611,0.0009679053,0.5246076],"genre_scores_gemma":[0.7864528,0.003470665,0.0551734,0.001055426,0.0002842136,0.0003021926,0.005674022,0.0004125231,0.1471748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7038308,"threshold_uncertainty_score":0.5888906,"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."}}