{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000634997,0.0008291067,0.0007067992,0.00218123,0.0007170328,0.0009422887,0.001644627,0.0005772249,0.003560475],"category_scores_gemma":[0.00342465,0.0004656199,0.0006142597,0.001212925,0.00055183,0.00209457,0.001105951,0.001055031,0.0006926893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005503461,"about_ca_system_score_gemma":0.0008281399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007594237,"about_ca_topic_score_gemma":0.001256905,"domain_scores_codex":[0.999632,0.00007030284,0.00002012305,0.00009582336,0.0001511663,0.00003055015],"domain_scores_gemma":[0.998857,0.0005147213,0.0001306542,0.0001437856,0.0003100232,0.00004381296],"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.00009265139,0.0001007596,0.002062911,0.0004693703,0.0001038547,0.0002557821,0.0003065465,0.4080686,0.01796999,0.2306213,0.003604298,0.3363439],"study_design_scores_gemma":[0.00001275313,0.00005137602,0.0003638701,0.00002774038,0.00002154113,0.0001870629,0.00004115094,0.8994221,0.004969385,0.0893827,0.005495734,0.0000246222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004025419,0.00004800429,0.9947312,0.00001991609,0.000009460155,0.00002452257,0.00005427029,0.00008471295,0.001002417],"genre_scores_gemma":[0.09976467,0.000232699,0.8973358,0.00003151185,0.00003439975,0.0002110434,0.0003280605,0.0001276269,0.001934209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003560475,"threshold_uncertainty_score":0.01191097,"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."}}