{"id":"W2116901449","doi":"10.1109/cdc.2010.5717154","title":"On the structural controllability of multi-agent systems subject to failure: A graph-theoretic approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Controllability; Network controllability; Graph; Computer science; Multi-agent system; Information flow; Topology (electrical circuits); Graph theory; Distributed computing; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Applied mathematics","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.001704817,0.0003489899,0.0005491904,0.0001522437,0.0001777635,0.0003241989,0.002338417,0.0001413786,0.00003357894],"category_scores_gemma":[0.0006376996,0.0002028869,0.000242865,0.0007219816,0.0001881955,0.0001837871,0.0002463339,0.0003755343,0.00007242283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005936959,"about_ca_system_score_gemma":0.0000820409,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003829375,"about_ca_topic_score_gemma":0.0001105179,"domain_scores_codex":[0.9967481,0.0005106484,0.0006969096,0.0007594004,0.0007326673,0.0005522519],"domain_scores_gemma":[0.9962694,0.0007004219,0.0002629212,0.002193999,0.0003235648,0.0002496649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004626048,0.000158826,0.001203333,0.00006033372,0.00009938629,0.000002885328,0.0005945961,0.001923216,0.01913813,0.9756093,0.0007300323,0.0004336861],"study_design_scores_gemma":[0.00402919,0.0003991775,0.01093693,0.00005126508,0.00005124036,0.00005680853,0.0006804258,0.9729254,0.004986849,0.00423253,0.000810926,0.0008392555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.393214,0.00003549001,0.5997098,0.001182696,0.001554986,0.002732639,0.00005400631,0.0002528258,0.001263587],"genre_scores_gemma":[0.9937518,2.537874e-7,0.005588062,0.0001951926,0.00006277722,0.0002433158,0.000005071,0.00001656155,0.000137],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9713768,"threshold_uncertainty_score":0.8273489,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01377082181984447,"score_gpt":0.2321542177371876,"score_spread":0.2183833959173431,"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."}}