{"id":"W2026586100","doi":"10.1016/j.automatica.2011.03.014","title":"Solving a modified consensus problem of linear multi-agent systems","year":2011,"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":"University of Saskatchewan","funders":"","keywords":"Consensus; Multi-agent system; Matrix (chemical analysis); State (computer science); Protocol (science); Mathematics; Linear system; Directed graph; State-transition matrix; Network topology; Mathematical optimization; Graph; Control theory (sociology); Laplacian matrix; Spanning tree; Computer science; Topology (electrical circuits); Symmetric matrix; Algorithm; Control (management); Discrete mathematics; Artificial intelligence","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.0006412545,0.0002416593,0.0004987649,0.0001407973,0.0001039062,0.00007738295,0.001081598,0.0001144281,0.00001190407],"category_scores_gemma":[0.0001147249,0.0002141725,0.0001300002,0.0003321297,0.00007986668,0.0001759574,0.0002396892,0.0001220995,0.0002073143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006484436,"about_ca_system_score_gemma":0.0001220379,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004387715,"about_ca_topic_score_gemma":0.000006511651,"domain_scores_codex":[0.9975362,0.0002179609,0.0009046337,0.0004323625,0.0004373781,0.000471394],"domain_scores_gemma":[0.9979326,0.0001705986,0.000474902,0.001013847,0.0002339047,0.0001741865],"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.0001153981,0.005138739,0.005314841,0.005021326,0.002285473,0.0007972575,0.0527137,0.01126986,0.05242411,0.8315911,0.007817422,0.02551081],"study_design_scores_gemma":[0.001063435,0.00008260507,0.001625686,0.00021758,0.00002881582,0.00003843241,0.0001463736,0.9948372,0.00127359,0.0002001063,0.0002384511,0.0002477243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02785385,0.0002733888,0.9622576,0.0001134291,0.00069272,0.001289509,0.00002841161,0.000870135,0.006621001],"genre_scores_gemma":[0.8572521,0.000001703136,0.1423442,0.00002428648,0.00002580845,0.00008830494,0.000002929753,0.00001770949,0.0002430005],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9835674,"threshold_uncertainty_score":0.8733702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06412674146181026,"score_gpt":0.2562315195572753,"score_spread":0.1921047780954651,"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."}}