{"id":"W2070221063","doi":"10.1016/j.automatica.2011.02.051","title":"Leader localization in multi-agent systems subject to failure: A graph-theoretic approach","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Graph; Undirected graph; Multi-agent system; Network controllability; Information flow; Computer science; Mathematical optimization; Link (geometry); Graph theory; Subject (documents); Theoretical computer science; Mathematics; Distributed computing; Artificial intelligence; Combinatorics; Computer network; Applied mathematics","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.001615622,0.001222978,0.001863044,0.002590245,0.001291645,0.001966404,0.00270662,0.002365904,0.003416917],"category_scores_gemma":[0.006878961,0.0007937314,0.00111135,0.001727625,0.0031011,0.003418296,0.002329545,0.001306881,0.0003772952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001534576,"about_ca_system_score_gemma":0.00111129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003974317,"about_ca_topic_score_gemma":0.002711325,"domain_scores_codex":[0.9992617,0.000373178,0.00002606968,0.0001207911,0.0001295645,0.00008864896],"domain_scores_gemma":[0.9948928,0.003564669,0.0006486942,0.000164431,0.0004643423,0.0002650088],"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.00006543165,0.00005261042,0.0005135297,0.0001690089,0.00008156438,0.0002084648,0.0002059465,0.693539,0.0009434994,0.293326,0.00216424,0.008730575],"study_design_scores_gemma":[0.00001729983,0.00002749596,0.0001295436,0.00001266435,0.00002023074,0.00002603099,0.00006997368,0.8553945,0.0001366207,0.1437367,0.0004154092,0.00001362815],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04307234,0.0008244913,0.9463643,0.00153658,0.0001008838,0.0000675476,0.00009557259,0.0001504896,0.007787909],"genre_scores_gemma":[0.9313965,0.002018111,0.055937,0.000352381,0.0003102556,0.0001964253,0.0001688041,0.0001372045,0.009483239],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003974317,"threshold_uncertainty_score":0.01143074,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04198307313938692,"score_gpt":0.2422317105203348,"score_spread":0.2002486373809478,"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."}}