{"id":"W2170282755","doi":"10.1109/tr.2004.824834","title":"A Novel Approach to Determine Minimal Tie-Sets of Complex Network","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Reliability","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"ca_institutions":"Western University; University of Saskatchewan","funders":"","keywords":"Simple (philosophy); Tracing; Reliability (semiconductor); Computer science; Path (computing); Enumeration; Algorithm; Network analysis; Set (abstract data type); Complex network; Mathematical optimization; Mathematics; Discrete mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002454635,0.0001975362,0.0002927902,0.00007516822,0.00007734367,0.00001328186,0.0001655895,0.000125323,0.00003146036],"category_scores_gemma":[0.00001695011,0.0001963438,0.0001431747,0.0004337142,0.00009430733,0.0001089233,0.000001173526,0.0002091466,0.00001612292],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001881865,"about_ca_system_score_gemma":0.00003332786,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007442939,"about_ca_topic_score_gemma":0.00003261236,"domain_scores_codex":[0.9987409,0.00002065541,0.0004246512,0.0003130122,0.0001914831,0.0003092687],"domain_scores_gemma":[0.9991652,0.00006576782,0.00003454396,0.0005067268,0.0001016137,0.0001261123],"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.00006997951,0.00042533,0.00000836342,0.0001166623,0.00001731186,2.110901e-7,0.0001909124,0.9908306,0.003258533,0.00005428927,0.0001194897,0.004908288],"study_design_scores_gemma":[0.003086095,0.0007600432,0.007560124,0.0002098334,0.0001279534,0.00002835877,0.0001423985,0.9470621,0.03647967,0.001437037,0.002101028,0.001005327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09691743,0.000006834336,0.8988145,0.00009734042,0.0003639757,0.0005086919,0.000061204,0.0002066069,0.003023389],"genre_scores_gemma":[0.8664876,0.00001346455,0.1332772,0.00006498426,0.00002645308,0.00007709442,0.000006519252,0.00002180444,0.00002488211],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7695702,"threshold_uncertainty_score":0.8006666,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02416801790329621,"score_gpt":0.2262834029071706,"score_spread":0.2021153850038744,"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."}}