{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004599117,0.00007537143,0.000134134,0.00001406933,0.00008391551,0.000007924297,0.0001700517,0.00006706554,0.0001291521],"category_scores_gemma":[0.0002718499,0.0000490035,0.0000672684,0.0001477625,0.00005830934,0.00001703685,0.00001097034,0.0001438252,0.000006722839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008582793,"about_ca_system_score_gemma":0.000008136652,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002031858,"about_ca_topic_score_gemma":0.000003748778,"domain_scores_codex":[0.9993724,0.0001048792,0.0002007202,0.0001145439,0.00007950397,0.0001279834],"domain_scores_gemma":[0.9980452,0.001297755,0.000104507,0.0004833305,0.00004135394,0.00002787043],"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.0000281612,0.0001112204,0.00005006948,0.000002172426,0.00000695749,1.049504e-7,0.00003474651,0.001064764,0.0002116151,0.9907893,0.006935274,0.0007655988],"study_design_scores_gemma":[0.0001447066,0.00008070534,0.005954002,0.00002201288,0.00001880561,4.751096e-7,0.0000299995,0.001815189,0.0006556867,0.9908389,0.0003766761,0.00006283743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9839962,0.00002446947,0.004070704,0.0009750907,0.00004660533,0.0003114698,0.000005263018,0.00005656437,0.01051367],"genre_scores_gemma":[0.9993219,0.000002757376,0.0002948303,0.0001763246,0.00006501706,0.00001343951,0.000002499284,0.00000565485,0.0001175354],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01532578,"threshold_uncertainty_score":0.1998305,"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."}}