{"id":"W2054191858","doi":"10.1016/j.automatica.2013.06.023","title":"Structural controllability of multi-agent networks: Robustness against simultaneous failures","year":2013,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Network controllability; Robustness (evolution); Digraph; Computer science; Cardinality (data modeling); Graph; Observability; Multi-agent system; Graph theory; Mathematical optimization; Distributed computing; Topology (electrical circuits); Mathematics; Theoretical computer science; Discrete mathematics; Data mining; Artificial intelligence; Applied mathematics; Betweenness centrality","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003652645,0.0003388636,0.0006675686,0.00008840115,0.0001357304,0.000285074,0.001504151,0.0001513351,0.00006863989],"category_scores_gemma":[0.0006184866,0.0002776429,0.0001926468,0.0004018996,0.0001491996,0.0005688964,0.0002887226,0.0001731731,0.0001081149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001113178,"about_ca_system_score_gemma":0.0000782788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002178116,"about_ca_topic_score_gemma":0.00002918624,"domain_scores_codex":[0.9970434,0.0003128308,0.0009477568,0.0005571002,0.0005116552,0.0006272009],"domain_scores_gemma":[0.9967265,0.0008384091,0.0004340039,0.0013293,0.0004367054,0.0002350728],"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.00001358737,0.0002620556,0.001964027,0.000190821,0.0002806425,0.00004320647,0.00064234,0.9312484,0.002825636,0.00366521,0.000972592,0.05789151],"study_design_scores_gemma":[0.001437385,0.00005035847,0.007089562,0.00004884795,0.00001842617,0.000008353335,0.00007055339,0.9906056,0.0001566686,0.0001090108,0.0001194544,0.0002858101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2919256,0.0002360517,0.7040696,0.0007308672,0.0007237399,0.001508507,0.00001907912,0.0006221795,0.0001643864],"genre_scores_gemma":[0.9762455,0.000002523908,0.02332998,0.0001291812,0.00006216187,0.0001139562,0.00001365076,0.00001923219,0.00008387188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6843198,"threshold_uncertainty_score":0.9999676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01202746363750406,"score_gpt":0.2303045755390395,"score_spread":0.2182771119015355,"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."}}