{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009900628,0.0001311089,0.0001822744,0.0006548804,0.0002970838,0.0003936777,0.002459718,0.00004562645,0.0005181854],"category_scores_gemma":[0.0000416469,0.0001067137,0.00004236095,0.00260386,0.003335165,0.0008976835,0.0004819477,0.0001525812,0.0002276725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000518321,"about_ca_system_score_gemma":0.0004458704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004674398,"about_ca_topic_score_gemma":0.0002722708,"domain_scores_codex":[0.99785,0.0001028215,0.0002975992,0.0004839344,0.0005969263,0.0006687256],"domain_scores_gemma":[0.9980702,0.00005727771,0.00005820603,0.0006580012,0.0004844305,0.0006718449],"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":[5.225366e-7,0.00003108537,0.00003854551,0.000005623528,0.000001658039,0.000001597258,0.0003869449,0.0002370035,0.0003794323,0.9863102,0.0002297491,0.01237767],"study_design_scores_gemma":[0.0001348214,0.00009925495,0.004468463,0.00001433136,8.756578e-7,0.00001131235,0.00000382688,0.681953,0.000790429,0.3122601,0.0001278969,0.0001357809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003548645,0.000004613546,0.9497665,0.004415993,0.0001792147,0.0003583672,0.000002108831,0.00008318095,0.04164134],"genre_scores_gemma":[0.61816,0.000002215145,0.3813396,0.0004530946,0.00001667704,0.000006632292,5.294823e-7,0.000003472077,0.00001781469],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.681716,"threshold_uncertainty_score":0.9993772,"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."}}