{"id":"W7124144430","doi":"10.65109/cnvj1841","title":"Stratified tree search: a novel suboptimal heuristic search algorithm","year":2013,"lang":"","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina; University of Alberta","funders":"","keywords":"Beam search; Incremental heuristic search; Heuristics; Heuristic; Benchmark (surveying); Partition (number theory); Null-move heuristic; Search algorithm; Consistent heuristic","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00153217,0.0007533528,0.001317408,0.001089936,0.0006968922,0.001062002,0.001929983,0.001429986,0.003927235],"category_scores_gemma":[0.004212291,0.0006009999,0.0009768636,0.001881003,0.0009947612,0.001719846,0.001486145,0.0009793787,0.001288419],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009638053,"about_ca_system_score_gemma":0.002844873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00465667,"about_ca_topic_score_gemma":0.006376651,"domain_scores_codex":[0.9991195,0.0003233142,0.00006014331,0.0001341734,0.0002544872,0.0001083188],"domain_scores_gemma":[0.9988409,0.0005296394,0.000114251,0.0002148886,0.0002314819,0.00006878976],"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.0003701787,0.0001206864,0.002602121,0.0002480734,0.0001438351,0.000168878,0.0002957608,0.6085278,0.006891075,0.07336405,0.01428639,0.2929812],"study_design_scores_gemma":[0.00005406764,0.00007000277,0.000134846,0.00002118598,0.00003147827,0.00007092047,0.00002861183,0.973797,0.001105915,0.02091546,0.003757301,0.00001318498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009836418,0.0003306244,0.9854047,0.000211045,0.00004986011,0.00008858721,0.0001250811,0.0007173323,0.003236363],"genre_scores_gemma":[0.1592608,0.000331168,0.8358716,0.0003216684,0.00004545854,0.0003281942,0.0004954427,0.0002259801,0.003119826],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00465667,"threshold_uncertainty_score":0.01313788,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05923169961973687,"score_gpt":0.2730492176920225,"score_spread":0.2138175180722856,"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."}}