{"id":"W4246352112","doi":"10.1002/net.20148","title":"Uniformly optimal digraphs for strongly connected reliability","year":2006,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Digraph; Counterexample; Conjecture; Combinatorics; Vertex (graph theory); Strongly connected component; Reliability (semiconductor); Mathematics; Enhanced Data Rates for GSM Evolution; Graph; Simple (philosophy); Connectivity; Terminal (telecommunication); Vertex connectivity; Directed graph; Discrete mathematics; Computer science","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.0008778275,0.0004901885,0.0005762681,0.00118544,0.0006437721,0.0009142081,0.0005465869,0.0006459884,0.003870652],"category_scores_gemma":[0.006242489,0.0004944552,0.0004031424,0.0006065091,0.0008135724,0.001265464,0.0008609249,0.0007422365,0.000315451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001675106,"about_ca_system_score_gemma":0.0008485569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001383357,"about_ca_topic_score_gemma":0.002290132,"domain_scores_codex":[0.9995195,0.000133882,0.00003543567,0.000141748,0.00007757377,0.00009193052],"domain_scores_gemma":[0.9971164,0.001511666,0.0003598882,0.0003525711,0.0003007449,0.0003586099],"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.0005350456,0.0002329767,0.005855475,0.0004820812,0.0001172594,0.0003167605,0.0004780286,0.248921,0.01116932,0.6310596,0.01204258,0.0887899],"study_design_scores_gemma":[0.0001109077,0.0001818754,0.002986837,0.00007234228,0.00007817851,0.0002469374,0.0001705229,0.338505,0.005383515,0.6439137,0.008311586,0.00003872746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5404692,0.0008455503,0.4325697,0.001581411,0.00009752892,0.0002257334,0.001410796,0.0005737721,0.02222626],"genre_scores_gemma":[0.9298481,0.00036606,0.06508986,0.0002394093,0.00002987411,0.0001395206,0.0005561875,0.00004092355,0.003690012],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003870652,"threshold_uncertainty_score":0.01294869,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.003128728090929827,"score_gpt":0.1755940877869229,"score_spread":0.1724653596959931,"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."}}