{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001085068,0.0009717789,0.0007037628,0.001098787,0.0004546157,0.0008214074,0.00104477,0.0007049093,0.001612375],"category_scores_gemma":[0.004360637,0.0002785348,0.0007009797,0.0008251337,0.001956344,0.002090716,0.0008999277,0.001050561,0.0001944922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006854655,"about_ca_system_score_gemma":0.00055858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001481033,"about_ca_topic_score_gemma":0.0009602252,"domain_scores_codex":[0.9993888,0.0002228476,0.00002958509,0.000121448,0.0001683506,0.00006894009],"domain_scores_gemma":[0.996287,0.003004313,0.0002925944,0.0001506785,0.0001845067,0.00008081005],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007640875,0.00003407041,0.0004666135,0.0002014585,0.00003378668,0.0001608922,0.0001194481,0.8193602,0.005250474,0.1460248,0.0004287379,0.0278432],"study_design_scores_gemma":[0.00001663064,0.00006375625,0.0001506655,0.00001472272,0.0000114396,0.00003847321,0.00002827912,0.9025885,0.001332218,0.0951803,0.0005632925,0.00001164485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01719485,0.0002331814,0.9807175,0.0001487281,0.00001691869,0.00003938566,0.00003211613,0.0001017795,0.001515518],"genre_scores_gemma":[0.8822497,0.00104485,0.1148081,0.00009314768,0.0001152399,0.0001890502,0.0001690658,0.00005263125,0.001278252],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001612375,"threshold_uncertainty_score":0.005738497,"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."}}