{"id":"W4238730366","doi":"10.1002/net.20301","title":"On the roots of strongly connected reliability polynomials","year":2009,"lang":"en","type":"article","venue":"Networks","topic":"Graph theory and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Strongly connected component; Mathematics; Reliability (semiconductor); Vertex connectivity; Combinatorics; Simply connected space; Unit disk; Plane (geometry); Arc (geometry); Closure (psychology); Complex plane; Connected component; Discrete mathematics; Vertex (graph theory); Graph; Mathematical analysis; Geometry; Physics","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.001699547,0.0004803025,0.0006424516,0.001839271,0.000552451,0.001144615,0.0007961015,0.0007783815,0.00279546],"category_scores_gemma":[0.02684481,0.0003916126,0.0003184516,0.0009131478,0.002682776,0.00246652,0.001670472,0.001778574,0.0003747697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008376648,"about_ca_system_score_gemma":0.0004719567,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007536289,"about_ca_topic_score_gemma":0.0003528186,"domain_scores_codex":[0.998985,0.0003194295,0.00003169084,0.0002124441,0.0003208348,0.0001306175],"domain_scores_gemma":[0.981851,0.01369259,0.002074274,0.0006491311,0.001238717,0.0004942759],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000309749,0.00005270535,0.004248383,0.000215973,0.00003388957,0.0005275676,0.0008483495,0.1935141,0.01118252,0.7548628,0.001913551,0.03229046],"study_design_scores_gemma":[0.0000536554,0.00009068483,0.002293425,0.00005683875,0.00001818685,0.0003760119,0.0002429231,0.3739573,0.003146832,0.6180915,0.001615493,0.00005720686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4990859,0.0007606228,0.4899452,0.001134328,0.00006183828,0.0000518465,0.0003088301,0.0002520884,0.008399354],"genre_scores_gemma":[0.9898801,0.0002897435,0.008488252,0.00004083056,0.00007000741,0.00004218656,0.00006276608,0.00003403893,0.001092178],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00279546,"threshold_uncertainty_score":0.00935173,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02494561104413878,"score_gpt":0.2856444775692616,"score_spread":0.2606988665251229,"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."}}