{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006182924,0.0002990212,0.0004517156,0.0002519644,0.0003206055,0.0008896033,0.001470417,0.0001475672,0.00001427389],"category_scores_gemma":[0.02979443,0.0002914475,0.0001266826,0.000039026,0.0001762557,0.0003788615,0.0003085419,0.0002526137,0.00001540382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005388144,"about_ca_system_score_gemma":0.0002090748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003687677,"about_ca_topic_score_gemma":0.0001245765,"domain_scores_codex":[0.9978099,0.00005934405,0.0004349533,0.0006360093,0.0006127415,0.000447002],"domain_scores_gemma":[0.9914014,0.00596636,0.0004409509,0.0008419729,0.001106829,0.0002424889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001807918,0.0001677659,0.0251739,0.00007676751,0.0004249806,0.00007638458,0.000701897,0.0004366686,0.001200276,0.5591991,0.007827017,0.4045345],"study_design_scores_gemma":[0.004649266,0.0008167965,0.1036968,0.0007548796,0.00009959257,0.00003996262,0.00008013715,0.8312521,0.005833873,0.0469237,0.005083113,0.0007697653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003742301,0.0002021601,0.9888264,0.00364677,0.001601383,0.0005773033,0.0001198279,0.0001084113,0.001175455],"genre_scores_gemma":[0.8334874,0.0002697705,0.1652005,0.0001600031,0.0004138269,0.0000171576,0.00001358259,0.00002099366,0.0004167889],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8308154,"threshold_uncertainty_score":0.9999537,"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."}}