{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007969108,0.0002985744,0.0004349611,0.0004094575,0.00008921399,0.0002836098,0.001233132,0.0001418896,0.00001524267],"category_scores_gemma":[0.0001503794,0.0002707332,0.00009838922,0.001306415,0.000063269,0.0004948208,0.0001862928,0.0001432317,0.0005115311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001516564,"about_ca_system_score_gemma":0.00006777712,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003041381,"about_ca_topic_score_gemma":0.00003582645,"domain_scores_codex":[0.997116,0.0003995511,0.0007154251,0.0006647449,0.000489057,0.0006152129],"domain_scores_gemma":[0.9983402,0.00007795657,0.0001743647,0.001062928,0.0001097315,0.0002347566],"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.00005827892,0.00340778,0.01394287,0.001609793,0.0003809559,0.0002758782,0.06292976,0.02615797,0.001593042,0.8761156,0.007550291,0.005977768],"study_design_scores_gemma":[0.0009635469,0.00007696509,0.004587281,0.0001418998,0.00001707016,0.00003091303,0.0006992262,0.9920719,0.0001913247,0.000424806,0.0004124164,0.0003827056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005331688,0.0001045114,0.9903142,0.0001710867,0.0004453831,0.001413582,0.000005632788,0.0005910196,0.001622873],"genre_scores_gemma":[0.9589069,0.000001505885,0.04034708,0.0001849588,0.00002353193,0.0004131079,0.00001143014,0.00002754383,0.00008396737],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9659139,"threshold_uncertainty_score":0.9999745,"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."}}