{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001765607,0.0006876496,0.0006196268,0.0004016583,0.000879321,0.00270765,0.002331224,0.0003679933,0.003289501],"category_scores_gemma":[0.00009295031,0.0006450977,0.0002488035,0.001312914,0.0003618121,0.001418943,0.0008909435,0.001431799,0.003988767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001344611,"about_ca_system_score_gemma":0.001178562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004698525,"about_ca_topic_score_gemma":0.00003992441,"domain_scores_codex":[0.9934103,0.0003950901,0.0009529782,0.00159154,0.001512573,0.002137463],"domain_scores_gemma":[0.9956715,0.0009560294,0.0001452153,0.001508329,0.0007132732,0.001005679],"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.00003324001,0.0008327306,0.0009952937,0.0002459,0.0002118126,0.0001735341,0.006414375,0.009801586,0.003919107,0.0120546,0.0129729,0.952345],"study_design_scores_gemma":[0.001043028,0.0007770082,0.003575595,0.0001693745,0.00002475414,0.00009204222,0.0003560972,0.9906434,0.001711227,0.000397852,0.0003849228,0.0008247021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01197609,0.0004183651,0.9615363,0.003659676,0.0006960433,0.0009336267,0.00004405607,0.0003544566,0.02038136],"genre_scores_gemma":[0.5628055,0.00002524737,0.4214828,0.0004845777,0.00035242,0.00003926262,0.0000245681,0.00004755523,0.01473801],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9808418,"threshold_uncertainty_score":0.9996001,"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."}}