{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008787216,0.000459397,0.000599669,0.0008915497,0.0006321188,0.001374372,0.000760911,0.0007492604,0.00266485],"category_scores_gemma":[0.005130291,0.0006432833,0.0004473777,0.0006924424,0.001266749,0.001960242,0.0009108629,0.001123252,0.0002041967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001447539,"about_ca_system_score_gemma":0.00104562,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001320361,"about_ca_topic_score_gemma":0.002571537,"domain_scores_codex":[0.9994293,0.000166903,0.00002116588,0.000143919,0.0001139528,0.000124773],"domain_scores_gemma":[0.9954026,0.002653489,0.0006580083,0.0004398467,0.0003734495,0.0004726639],"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.0001555034,0.000156865,0.003402953,0.0001977547,0.00006157798,0.0002131567,0.000236457,0.3021317,0.01359281,0.6560885,0.004392378,0.01937046],"study_design_scores_gemma":[0.00003685697,0.0001030019,0.001240357,0.0000405601,0.00002878826,0.000233003,0.0001741125,0.3917192,0.003967782,0.5987871,0.003629414,0.00003984675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5139297,0.0004412809,0.4665333,0.001041127,0.000056102,0.00006933119,0.0004728804,0.000196498,0.01725962],"genre_scores_gemma":[0.9530052,0.000248553,0.04386124,0.0001464794,0.00003210889,0.00005214776,0.0001718912,0.00003920449,0.002443228],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.00266485,"threshold_uncertainty_score":0.0105027,"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."}}