{"id":"W2040973615","doi":"10.5555/777092.777204","title":"Optimal depth-first strategies for and-or trees","year":2002,"lang":"en","type":"article","venue":"","topic":"Software Testing and Debugging Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto; University of Alberta","funders":"","keywords":"Probabilistic logic; Computer science; Node (physics); Set (abstract data type); Tree (set theory); Task (project management); Test (biology); Sequence (biology); Focus (optics); Algorithm; Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics","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":[],"consensus_categories":[],"category_scores_codex":[0.00008796012,0.0000846754,0.00008726567,0.00004836097,0.0001183198,0.0002500943,0.000301347,0.00003490955,0.00001781043],"category_scores_gemma":[0.00008709692,0.00006062684,0.00002518698,0.0001019781,0.00003487443,0.0003066636,0.00008123839,0.00003428089,0.000006637806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000006748876,"about_ca_system_score_gemma":0.00001211186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003708996,"about_ca_topic_score_gemma":0.0000576647,"domain_scores_codex":[0.9994419,0.000007034678,0.00009252675,0.0002153852,0.00007374949,0.0001693786],"domain_scores_gemma":[0.9993308,0.0003343413,0.00002407045,0.0002326327,0.00003110516,0.00004701172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001795624,0.0001821292,0.004839116,0.00007587415,0.00002733366,0.00002862259,0.002536872,0.0001807823,0.00005204114,0.1988752,0.4760038,0.3171802],"study_design_scores_gemma":[0.0006011767,0.0009405982,0.002459855,0.00006885802,0.00001023706,0.0001419775,0.00006259418,0.9004582,0.0007837287,0.07711989,0.01682983,0.0005230107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003195493,0.000123854,0.9834391,0.0008798071,0.00005244499,0.0001090169,5.982262e-7,0.00823205,0.00396761],"genre_scores_gemma":[0.3846311,0.00001069423,0.6145164,0.0001579141,0.00002438496,0.00002656892,1.811823e-7,0.00000433793,0.0006284269],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9002774,"threshold_uncertainty_score":0.2472291,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06138138110326721,"score_gpt":0.28324691919071,"score_spread":0.2218655380874428,"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."}}