{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001646719,0.0001339163,0.0001516875,0.00003080467,0.00006807852,0.000035155,0.00009675458,0.0001462593,0.00002435983],"category_scores_gemma":[0.00003265511,0.0001297199,0.00008626415,0.0001761999,0.00004657578,0.0001396768,0.00001079008,0.0001303701,0.000003055441],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005738451,"about_ca_system_score_gemma":0.00001030285,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002624922,"about_ca_topic_score_gemma":0.00004191879,"domain_scores_codex":[0.9991773,0.0000120027,0.0002362628,0.0001779458,0.00007017716,0.0003262988],"domain_scores_gemma":[0.9995065,0.00009769805,0.00002699455,0.0002323143,0.00009406092,0.00004246964],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002527263,0.00001931746,0.000552203,0.00002473124,0.000007280793,2.848662e-7,0.00001025639,0.9875596,0.00002394318,0.002506029,0.008206065,0.001065038],"study_design_scores_gemma":[0.0004103337,0.0000455472,0.003124777,0.00001383922,0.00001357893,8.804519e-7,0.00001431069,0.98471,0.00009040214,0.0009287214,0.01048948,0.0001581583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1255634,0.0001886317,0.8676278,0.00005625596,0.0004966031,0.0004906455,0.00001650071,0.0005295656,0.005030652],"genre_scores_gemma":[0.9850762,0.00004516305,0.01417514,0.0000158282,0.0002491282,0.00007651273,0.0001554581,0.00002995674,0.0001765492],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8595129,"threshold_uncertainty_score":0.5289826,"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."}}