{"id":"W2771280031","doi":"10.1109/sdpc.2017.142","title":"A New Method for Finding Modules of Fault Trees","year":2017,"lang":"en","type":"article","venue":"2017 International Conference on Sensing, Diagnostics, Prognostics, and Control (SDPC)","topic":"Software Engineering Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Fault tree analysis; Computer science; Graph; Degree (music); Fault coverage; Tree (set theory); Time complexity; Graph theory; Algorithm; Theoretical computer science; Mathematics; Reliability engineering; Engineering","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.0004374395,0.001116975,0.001128015,0.003773887,0.0008817183,0.001009258,0.001542054,0.0009968414,0.004114989],"category_scores_gemma":[0.001953612,0.0005232253,0.001324003,0.002351932,0.0006056178,0.001960265,0.001216529,0.0009128542,0.001268044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004559248,"about_ca_system_score_gemma":0.001169388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002962336,"about_ca_topic_score_gemma":0.00301265,"domain_scores_codex":[0.999239,0.00008871307,0.00006021111,0.000239528,0.0003088233,0.00006381773],"domain_scores_gemma":[0.9992253,0.000206778,0.00007603233,0.0001073955,0.0003374251,0.00004708334],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000130003,0.00007004585,0.002096259,0.0004917452,0.0001085835,0.0002633159,0.0003105658,0.04502951,0.03699306,0.02486076,0.008037543,0.8816086],"study_design_scores_gemma":[0.000071954,0.0001904884,0.001936773,0.00008081678,0.0001296704,0.001346719,0.0001473199,0.9015317,0.02254718,0.0329898,0.03892127,0.0001063941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002327563,0.000215281,0.9960243,0.00003368116,0.0000466447,0.00005076569,0.00008533333,0.0005318485,0.0006845139],"genre_scores_gemma":[0.04774177,0.0003166785,0.9480726,0.000065206,0.00006141752,0.0001583544,0.000423985,0.0001795252,0.002980508],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.004114989,"threshold_uncertainty_score":0.01376599,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0605631249069194,"score_gpt":0.3587456126254758,"score_spread":0.2981824877185564,"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."}}