{"id":"W6989303635","doi":"","title":"An AO* based exact algorithm for the Canadian traveler problem","year":2016,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Tree traversal; Markov process; Vertex (graph theory); Time complexity; Markov decision process; Node (physics); Graph; Graph traversal; Markov chain","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000119368,0.00008148176,0.00005762066,0.00006354308,0.0002790257,0.0002538586,0.0008235661,0.00005109224,0.02261997],"category_scores_gemma":[0.00009197125,0.00004459217,0.00004016308,0.000160245,0.000006330318,0.0003413382,0.00002791164,0.00005121528,0.0004270817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006425431,"about_ca_system_score_gemma":0.0005332846,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001025445,"about_ca_topic_score_gemma":0.02075921,"domain_scores_codex":[0.999172,0.00003689027,0.00009265933,0.0002256904,0.0001568289,0.0003159117],"domain_scores_gemma":[0.9990134,0.0001396787,0.00003152667,0.0004004225,0.0001842818,0.0002306624],"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":[6.855776e-7,0.00001627028,0.000004232257,0.00001204361,0.000004817674,0.000002669145,0.000117389,0.0003127097,0.00001611348,0.0004357383,0.3489361,0.6501413],"study_design_scores_gemma":[0.0002571526,0.00005477946,0.0002634468,0.00009303252,7.565616e-7,0.000001159507,0.000002220842,0.5565857,0.000163476,0.0001581152,0.4423214,0.00009875983],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[8.944299e-7,0.00004997903,0.8983083,0.01101995,0.0001032872,0.001532034,0.08400832,0.0002397981,0.004737481],"genre_scores_gemma":[0.09679367,0.000007604669,0.833881,0.01643141,0.0008126133,0.00539934,0.03374238,0.000146741,0.01278527],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6500425,"threshold_uncertainty_score":0.9971094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05115286638250015,"score_gpt":0.2776908501656091,"score_spread":0.2265379837831089,"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."}}