{"id":"W4372352878","doi":"10.1002/net.22150","title":"Existence of optimally‐greatest digraphs for strongly connected node reliability","year":2023,"lang":"en","type":"article","venue":"Networks","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Strongly connected component; Node (physics); Reliability (semiconductor); Mathematics; Combinatorics; Directed graph; Graph; Discrete mathematics; Computer science","routes":{"ca_aff":true,"ca_fund":true,"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.0002520306,0.0001190252,0.0001969007,0.00004896775,0.00004252828,0.00001474843,0.0001336438,0.0001212743,0.00001557277],"category_scores_gemma":[0.0001563958,0.000116411,0.00008825241,0.0004378124,0.00007022957,0.0000983506,0.00002064012,0.0001056882,0.000004812936],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003172477,"about_ca_system_score_gemma":0.0000110203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001137266,"about_ca_topic_score_gemma":0.00001064689,"domain_scores_codex":[0.9991546,0.00001516091,0.0002657682,0.0001892861,0.00008379552,0.0002913844],"domain_scores_gemma":[0.9992432,0.0002287505,0.00003995249,0.0003006987,0.0001376578,0.0000497158],"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.00002699295,0.00001224558,0.001680097,0.00009296003,0.00001349328,4.710562e-7,0.00005492878,0.9945777,0.0000810198,0.0006757898,0.001510263,0.001274048],"study_design_scores_gemma":[0.0002966639,0.00005493484,0.006713048,0.00005072283,0.00001437186,4.735131e-7,0.0000402117,0.9911915,0.0001686741,0.0005372345,0.0008111784,0.0001209972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4714086,0.0002354905,0.5199009,0.0001541079,0.0009622762,0.001059575,0.0000688701,0.001378342,0.004831819],"genre_scores_gemma":[0.9873628,0.0002413503,0.01196704,0.00001051767,0.00006735171,0.00009253997,0.0001101699,0.00002964122,0.0001185834],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5159541,"threshold_uncertainty_score":0.4747101,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0112058962679393,"score_gpt":0.2177787276150238,"score_spread":0.2065728313470845,"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."}}