{"id":"W2322933176","doi":"10.3182/20120523-3-ro-2023.00312","title":"Algorithms for Generating Minimal Cutsets in R-networks","year":2012,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Software Reliability and Analysis Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université Laval","funders":"","keywords":"Correctness; Binary decision diagram; Benchmark (surveying); Set (abstract data type); Reliability (semiconductor); Computer science; Reduction (mathematics); Process (computing); Algorithm; Computation; Binary number; Theoretical computer science; Mathematics; Arithmetic","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.001246,0.0001522865,0.0002361637,0.0001775851,0.0001695715,0.0002831625,0.0006496581,0.000114803,0.000009820754],"category_scores_gemma":[0.0004811276,0.0001431986,0.000113544,0.0006850497,0.00005185747,0.0011274,0.0002496574,0.0002008969,0.00001669094],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008119417,"about_ca_system_score_gemma":0.00004097574,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003776496,"about_ca_topic_score_gemma":0.000004724015,"domain_scores_codex":[0.9981454,0.00001440566,0.0003084391,0.0004043785,0.0003232987,0.0008040717],"domain_scores_gemma":[0.9992115,0.0001743698,0.00007832564,0.0001539831,0.0002040393,0.0001778132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001984305,0.0004080678,0.5457806,0.0001679079,0.00006425312,0.000002365806,0.003873951,0.0005316789,0.00163672,0.009119798,0.005697906,0.4326969],"study_design_scores_gemma":[0.0002985245,0.00006844724,0.009630705,0.00002981498,0.000006382194,0.00000757341,0.0001401294,0.9838332,0.001109787,0.0005674253,0.004069967,0.0002380627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4455583,0.001355903,0.5508437,0.0007471661,0.0003092782,0.0004590357,0.000002895704,0.0002514443,0.0004723304],"genre_scores_gemma":[0.8377913,0.00002994065,0.1612073,0.000114505,0.0004528142,0.0001308161,0.000002797882,0.00001248974,0.0002580257],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9833015,"threshold_uncertainty_score":0.5839471,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03098229390699895,"score_gpt":0.3029031044848208,"score_spread":0.2719208105778219,"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."}}