{"id":"W2009831508","doi":"10.1016/j.tcs.2013.03.016","title":"Complexity of Canadian traveler problem variants","year":2013,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"PSPACE; Combinatorics; Mathematics; Time complexity; Disjoint sets; Vertex (graph theory); Graph; Discrete mathematics; Path (computing); Travelling salesman problem; Computational complexity theory; Computer science; Algorithm","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.001893448,0.001218862,0.001752991,0.001984747,0.00301465,0.006351497,0.003783354,0.002566437,0.02134353],"category_scores_gemma":[0.01464568,0.0007019523,0.001748315,0.003647964,0.002464755,0.004875217,0.002143664,0.003797532,0.0009178406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.01223803,"about_ca_system_score_gemma":0.01014313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.2072077,"about_ca_topic_score_gemma":0.1940629,"domain_scores_codex":[0.9971156,0.000695882,0.0001020971,0.0004640183,0.0008312533,0.0007911394],"domain_scores_gemma":[0.9938403,0.003978188,0.0002959741,0.0005446208,0.0007497568,0.0005911927],"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.0009026198,0.0003323854,0.003090902,0.0002630017,0.0001014642,0.0002410107,0.000541131,0.2098689,0.0008255382,0.6964036,0.04748026,0.03994911],"study_design_scores_gemma":[0.000249317,0.00009039744,0.002237077,0.00006650974,0.00009410503,0.000226944,0.000623275,0.4590609,0.0006860938,0.5190466,0.01753201,0.00008675705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6163009,0.002939061,0.1296816,0.007598728,0.0005001548,0.000523728,0.006892658,0.0005964079,0.2349667],"genre_scores_gemma":[0.9082298,0.001098953,0.04083609,0.0004416371,0.0002042743,0.0002318611,0.005034442,0.0003654051,0.04355757],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2072077,"threshold_uncertainty_score":0.4120032,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03185590816938742,"score_gpt":0.2465272280430168,"score_spread":0.2146713198736294,"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."}}