{"id":"W1588435642","doi":"","title":"Exact Algorithms for the Canadian Traveller Problem on Paths and Trees","year":2008,"lang":"en","type":"article","venue":"DSpace@MIT (Massachusetts Institute of Technology)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Traverse; Generalization; Approximation algorithm; Combinatorics; Computer science; Enhanced Data Rates for GSM Evolution; Algorithm; Exact solutions in general relativity; Discrete mathematics; Mathematics; Theoretical computer science; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.0002848923,0.0002291719,0.0002656221,0.0006411384,0.0007760958,0.00007255175,0.001090402,0.0002960685,0.000008541129],"category_scores_gemma":[0.0001276375,0.0001683417,0.00007885264,0.0007909318,0.0006895312,0.0003332676,0.0001485629,0.0003312793,0.00001024056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009597751,"about_ca_system_score_gemma":0.0004384406,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002317146,"about_ca_topic_score_gemma":0.0197156,"domain_scores_codex":[0.9984135,0.00002228472,0.0002802292,0.0004799948,0.0002927561,0.0005112079],"domain_scores_gemma":[0.9986921,0.00006995721,0.0001278248,0.0007649617,0.0001776288,0.0001675203],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004019389,0.0003672348,0.004741153,0.00010397,0.0003930169,0.0001439327,0.003215028,0.006425051,0.0007323699,0.4723237,0.02850788,0.4830064],"study_design_scores_gemma":[0.00198524,0.000783676,0.003545968,0.0001037888,0.00002785574,0.0001293286,0.0001038306,0.08968392,0.003386931,0.005216583,0.8944072,0.0006257329],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01863217,0.002243878,0.7205409,0.2298317,0.001668651,0.005882207,0.0002529476,0.001527671,0.01941994],"genre_scores_gemma":[0.7558887,0.0006282569,0.2406191,0.0007366436,0.00005052648,0.000249167,0.00001067782,0.00002993745,0.001786992],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8658993,"threshold_uncertainty_score":0.998172,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03246409085776625,"score_gpt":0.2568305085769395,"score_spread":0.2243664177191733,"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."}}