{"id":"W4248853006","doi":"10.1002/net.20060","title":"The strongly connected reliability of complete digraphs","year":2005,"lang":"en","type":"article","venue":"Networks","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Vertex connectivity; Vertex (graph theory); Strongly connected component; Combinatorics; Fist; Mathematics; Reliability (semiconductor); Connected component; Connectivity; Discrete mathematics; Computer science; Graph","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.001347827,0.0004711063,0.0006362697,0.002089969,0.00052658,0.001157556,0.000757149,0.0006356679,0.001592514],"category_scores_gemma":[0.01533274,0.0005815013,0.0004421226,0.0009591605,0.001443563,0.002021844,0.001070435,0.000705496,0.0002491142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001127104,"about_ca_system_score_gemma":0.0005795681,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001795033,"about_ca_topic_score_gemma":0.001279159,"domain_scores_codex":[0.9990124,0.0003828263,0.00005016708,0.0001868466,0.0002534383,0.0001143473],"domain_scores_gemma":[0.9874833,0.008677702,0.001240876,0.0009077729,0.001196527,0.0004939982],"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.0003486167,0.00005829691,0.007233992,0.0002251102,0.0001097302,0.0005004056,0.0006418488,0.695053,0.00413993,0.2514309,0.002542505,0.03771552],"study_design_scores_gemma":[0.00002604858,0.00006460526,0.001774397,0.00002343179,0.0000268859,0.0001567301,0.00007616834,0.6399025,0.001419251,0.3553207,0.001186993,0.00002224276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5647514,0.0003164624,0.4279401,0.0004802255,0.00002971691,0.00008473355,0.0005806314,0.0003438648,0.005472894],"genre_scores_gemma":[0.9831818,0.000181402,0.01518173,0.00004213929,0.0000288076,0.00006004288,0.0002825244,0.00002765199,0.001013963],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.002089969,"threshold_uncertainty_score":0.008177757,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01125366267086698,"score_gpt":0.2199192064679363,"score_spread":0.2086655437970693,"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."}}