{"id":"W2267848830","doi":"10.1287/ijoc.2015.0668","title":"An AO<sup>*</sup> Based Exact Algorithm for the Canadian Traveler Problem","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Vertex (graph theory); Computer science; Pruning; Mathematical optimization; Algorithm; Markov decision process; Vertex cover; Graph; Graph traversal; Time complexity; Markov process; Theoretical computer science; Mathematics","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001817843,0.0001784224,0.0001567958,0.0002891267,0.001271314,0.001101031,0.001275371,0.0000811968,0.00004731274],"category_scores_gemma":[0.00007141686,0.00008953969,0.0001183674,0.0003031796,0.00005187939,0.0009651422,0.00004886254,0.0003284083,0.0000391636],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002550418,"about_ca_system_score_gemma":0.0009082027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005837413,"about_ca_topic_score_gemma":0.000773491,"domain_scores_codex":[0.9981157,0.00006314988,0.000452459,0.0002181795,0.0004649135,0.0006856466],"domain_scores_gemma":[0.9981426,0.0003634458,0.0002015546,0.000375091,0.000381813,0.0005354749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004038415,0.00001987157,0.00007781971,0.000003302719,0.00001397989,0.000007159108,0.0005893597,0.09859261,0.000006247658,0.002693591,0.000985259,0.8970068],"study_design_scores_gemma":[0.0009106914,0.0003186751,0.0003097921,0.00008551672,0.000002828552,0.00006738448,0.00003690329,0.9625893,0.00006176507,0.0007552503,0.03468563,0.0001762217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005521196,0.00001098189,0.9919884,0.005402874,0.0002323994,0.0003781939,0.000005838507,0.00007354375,0.001355652],"genre_scores_gemma":[0.5106516,0.00001135777,0.4825805,0.005800942,0.0005694406,0.00001280537,0.000003447903,0.00003002758,0.0003398672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8968306,"threshold_uncertainty_score":0.9999359,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0258705942880433,"score_gpt":0.2749130858102049,"score_spread":0.2490424915221616,"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."}}