{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007858359,0.0004044651,0.0009720724,0.0006894387,0.0006809757,0.0008718437,0.001228153,0.001092551,0.002944454],"category_scores_gemma":[0.007507759,0.0004166986,0.000504074,0.0008379914,0.001032655,0.002123922,0.002166574,0.0009726065,0.0003904581],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005773335,"about_ca_system_score_gemma":0.0007583466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001185007,"about_ca_topic_score_gemma":0.002057194,"domain_scores_codex":[0.9993464,0.0002132502,0.00002759751,0.00007607687,0.000206839,0.0001297304],"domain_scores_gemma":[0.9954895,0.002919775,0.0002371627,0.0008290133,0.0003970952,0.0001274441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001031695,0.0001099158,0.00382229,0.0003191055,0.0000796805,0.000531156,0.0004875966,0.7279035,0.01369486,0.082183,0.008569195,0.1612679],"study_design_scores_gemma":[0.00002221315,0.00003875106,0.0001657653,0.00001112907,0.00001142506,0.00007618441,0.00004941908,0.9331792,0.001860812,0.06351607,0.001063855,0.000005270021],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3909537,0.001291474,0.5923789,0.001293378,0.0001335094,0.000068042,0.0003526485,0.001807951,0.01172044],"genre_scores_gemma":[0.9078127,0.0001849895,0.08847482,0.0001020047,0.00002717815,0.00005083671,0.0002878822,0.0002071581,0.002852466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002944454,"threshold_uncertainty_score":0.009850144,"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."}}