{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295439,0.001017336,0.0008591269,0.0008523863,0.00104088,0.001268982,0.002051587,0.001191614,0.01190737],"category_scores_gemma":[0.003989272,0.0005167265,0.000857276,0.001700539,0.0008263738,0.001572712,0.001729281,0.001504515,0.00133491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003582331,"about_ca_system_score_gemma":0.01390271,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.1656234,"about_ca_topic_score_gemma":0.2346768,"domain_scores_codex":[0.9991947,0.00009214057,0.00003671532,0.0001856571,0.00023031,0.000260472],"domain_scores_gemma":[0.9987831,0.0005705628,0.000113197,0.0001738102,0.0002439963,0.0001154295],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004636151,0.000297943,0.00227559,0.0002289445,0.00005811657,0.0001412951,0.0001332806,0.4911267,0.002357553,0.05956559,0.04732005,0.3960313],"study_design_scores_gemma":[0.0001066682,0.00004326822,0.0003558857,0.00001840947,0.00001753529,0.00004750639,0.00006211597,0.9661194,0.0009208454,0.02621773,0.006076679,0.00001395508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05225732,0.0004798873,0.8978487,0.002613666,0.0002464923,0.0007870868,0.001797959,0.005406528,0.03856234],"genre_scores_gemma":[0.2457951,0.0002179807,0.738288,0.0005662848,0.00007037862,0.0003847366,0.002302572,0.0005320362,0.01184284],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.1656234,"threshold_uncertainty_score":0.3293186,"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."}}