{"id":"W1996317753","doi":"10.1007/s00224-005-1252-0","title":"Efficient Exploration of Faulty Trees","year":2006,"lang":"en","type":"article","venue":"Theory of Computing Systems","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Overhead (engineering); Node (physics); Competitive analysis; Tree (set theory); Computation; Algorithm; Situated; Enhanced Data Rates for GSM Evolution; Fault tree analysis; Mathematics; Artificial intelligence; Combinatorics; Engineering; Upper and lower bounds","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.001292508,0.00007775205,0.0001943839,0.0001215123,0.00006064454,0.00003912418,0.0003826633,0.00003213549,0.000002240476],"category_scores_gemma":[0.00002727168,0.00006801562,0.00004758942,0.0003333351,0.0000614184,0.00009747769,0.00008679322,0.00004470427,0.000006791165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000016442,"about_ca_system_score_gemma":0.00003078896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004638445,"about_ca_topic_score_gemma":0.000001056186,"domain_scores_codex":[0.9986641,0.0003094674,0.0004327587,0.0001581693,0.0002938848,0.0001415926],"domain_scores_gemma":[0.9990001,0.0002022332,0.0002786773,0.0003042863,0.0001887352,0.00002601755],"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.000002594298,0.00004224242,0.00004403478,0.00003561952,0.000003784212,2.680334e-7,0.0007894951,0.563172,0.0008416718,0.4337524,0.00004306941,0.00127288],"study_design_scores_gemma":[0.0002339207,0.00005739076,0.000502019,0.0001092513,0.000002205147,0.000002441239,0.0001626777,0.9921771,0.001745637,0.004858221,0.00007316447,0.00007601627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08660263,0.0001318489,0.9078715,0.0000405742,0.0002604809,0.000180929,0.000001171137,0.0000927435,0.004818152],"genre_scores_gemma":[0.9915378,8.458861e-7,0.008192117,0.000006026846,0.00004741249,0.000001861967,0.000002352858,0.000005208306,0.0002063525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9049352,"threshold_uncertainty_score":0.2773596,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02876237430597233,"score_gpt":0.2608479320143923,"score_spread":0.23208555770842,"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."}}