{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":1051,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":1051,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"a363c91d08b1","filters":{"topic":"Distributed Control Multi-Agent Systems"}},"results":[{"id":"W2147326597","doi":"10.1109/tac.2004.841121","title":"Necessary and sufficient graphical conditions for formation control of unicycles","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1045,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Digraph; Control theory (sociology); Directed graph; Graph; Control (management); Computer science; Point (geometry); Key (lock); Strongly connected component; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01122485334909713,"gpt":0.2459037759734588,"spread":0.2346789226243617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752739,0.000223545,0.0004524523,0.0003162271,0.0002464482,0.0001067899,0.0003983351,0.0001128743,0.00001745701],"category_scores_gemma":[0.00002757023,0.000209461,0.0002195761,0.0002933493,0.0001032541,0.0006367463,0.000001704078,0.0001120106,0.00001624549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007536608,"about_ca_system_score_gemma":0.0000571587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535991,"about_ca_topic_score_gemma":0.00003686065,"domain_scores_codex":[0.9981113,0.0001549552,0.0007337983,0.0003209572,0.0003426533,0.0003363022],"domain_scores_gemma":[0.9980181,0.0008831425,0.0002800404,0.0004884541,0.000181619,0.0001485898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005188778,0.005315901,0.0001445095,0.001044714,0.001815008,0.00001377652,0.00409132,0.2972961,0.1083948,0.1053831,0.001443904,0.474538],"study_design_scores_gemma":[0.006785071,0.0002201954,0.0007740923,0.0000644853,0.0001305819,0.00002246528,0.00007148068,0.988173,0.002917636,0.0003641142,0.0002812823,0.0001956053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032381,0.00009001706,0.9637592,0.003246486,0.000285296,0.001476212,0.0004781619,0.0002941291,0.00004673466],"genre_scores_gemma":[0.9965372,0.000007274411,0.002520462,0.0003787587,0.00003119042,0.0004768083,0.000008126442,0.00001385787,0.00002631988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9662134,"threshold_uncertainty_score":0.854157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164642931","doi":"10.1109/tac.2013.2278132","title":"Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":831,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Lipschitz continuity; Directed graph; Mathematics; Convex optimization; Convex function; Strongly connected component; Regular polygon; Mathematical optimization; Discrete mathematics; Computer science; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.005451101247933281,"gpt":0.20317861172143,"spread":0.1977275104734967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005713417,0.0005051672,0.0008469462,0.0003299791,0.0003618677,0.0003702375,0.001030218,0.0002142169,0.000214433],"category_scores_gemma":[0.00007112822,0.0004658659,0.0003512891,0.0006475498,0.0000859503,0.000463917,0.000003217466,0.0002664182,0.0009061027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001833604,"about_ca_system_score_gemma":0.00007665135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002518528,"about_ca_topic_score_gemma":0.000005130911,"domain_scores_codex":[0.9964275,0.0005133633,0.0008569338,0.0007845024,0.0007403471,0.0006773723],"domain_scores_gemma":[0.9968189,0.0009297953,0.0003952665,0.00133909,0.0002179105,0.0002990642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002253133,0.001742376,0.00006653147,0.0001015598,0.0008476524,0.00003144494,0.0003381153,0.8625755,0.00567699,0.006887669,0.0025342,0.1189727],"study_design_scores_gemma":[0.006345206,0.0004001902,0.000307202,0.0001269171,0.00009633435,0.00001320971,0.000009069341,0.9897393,0.001522132,0.0001422375,0.0008251177,0.0004730806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001731746,0.00001454011,0.9913881,0.001608382,0.00130916,0.001212858,0.0002439019,0.001720615,0.0007706553],"genre_scores_gemma":[0.994702,0.000003622169,0.003644902,0.0008243907,0.00007132551,0.0003496151,0.00003598589,0.00004113686,0.0003270549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9929702,"threshold_uncertainty_score":0.9998718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3104550706","doi":"10.1184/r1/6468842.v1","title":"Gossip Algorithms for Distributed Signal Processing","year":2018,"lang":"en","type":"article","venue":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":729,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Gossip protocol; Bottleneck; Wireless sensor network; Signal processing; Distributed computing; Distributed algorithm; Algorithm; Wireless network; Wireless; Computer network; Real-time computing; Digital signal processing; Telecommunications; Embedded system","retraction":null,"screen_n_in":null,"score":{"opus":0.1029552204914749,"gpt":0.3251275833723791,"spread":0.2221723628809041,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.002505983,0.00081089,0.0009845487,0.002315215,0.003132372,0.0008931706,0.005464726,0.0006210959,0.00009123313],"category_scores_gemma":[0.000287565,0.000965844,0.000653377,0.006177221,0.00152828,0.003039922,0.00209481,0.001173694,0.0002765651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00272838,"about_ca_system_score_gemma":0.001904517,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00117718,"about_ca_topic_score_gemma":0.0004079808,"domain_scores_codex":[0.9906027,0.001539258,0.0005433547,0.002455352,0.002133576,0.002725806],"domain_scores_gemma":[0.9914632,0.001080303,0.0004465634,0.001902545,0.003729825,0.001377536],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.007536907,0.005517879,0.003065597,0.00239784,0.003488113,0.03134196,0.01257735,0.003127607,0.0566125,0.3373344,0.1721502,0.3648496],"study_design_scores_gemma":[0.00764834,0.001368794,0.0002248899,0.0003048029,0.0002180327,0.00009265754,0.007845412,0.2047962,0.007955948,0.0005745349,0.7673467,0.001623641],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01500321,0.0003215014,0.9541031,0.001625498,0.0008512532,0.002675636,0.000902919,0.001232668,0.02328422],"genre_scores_gemma":[0.9701797,0.0001717701,0.008386239,0.00006820152,0.0008883827,0.000006457957,0.0003625656,0.00009417141,0.01984251],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9551765,"threshold_uncertainty_score":0.9999162,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973184571","doi":"10.1109/jsac.2013.130413","title":"Resilient Asymptotic Consensus in Robust Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":713,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robustness (evolution); Redundancy (engineering); Distributed computing; Fault tolerance; Network topology; Computer network; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03176602887918567,"gpt":0.2648428637459382,"spread":0.2330768348667525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079602,0.0002224429,0.0003375921,0.0005250554,0.0002802725,0.0004352641,0.003246873,0.0001413974,0.00002043523],"category_scores_gemma":[0.0004197325,0.0002129249,0.00007774038,0.001926105,0.0000880147,0.0003356946,0.0002065973,0.001356596,0.0001402334],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005368078,"about_ca_system_score_gemma":0.0002474555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003076394,"about_ca_topic_score_gemma":0.0008206278,"domain_scores_codex":[0.9966552,0.001175474,0.0009335923,0.000296,0.0003752053,0.0005645665],"domain_scores_gemma":[0.9956483,0.001125979,0.0003808785,0.002103561,0.0005226509,0.0002186338],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006354103,0.003033425,0.06990242,0.00001694658,0.0002016593,0.0001687796,0.001361846,0.8342323,0.00179043,0.02593731,0.03805352,0.02523776],"study_design_scores_gemma":[0.001447548,0.0000857874,0.1377892,0.0003027387,0.000007272983,0.0002334295,0.0000613052,0.8578249,0.00003615884,0.0008242429,0.00109508,0.0002923662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4887887,0.004284402,0.4451005,0.03987127,0.003445848,0.003627832,0.00002205422,0.0007130928,0.01414629],"genre_scores_gemma":[0.992153,0.0002376391,0.00699707,0.0003285316,0.00006981861,0.00009788745,0.000008269644,0.00001733384,0.0000904449],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5033643,"threshold_uncertainty_score":0.8682826,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138296912","doi":"10.1080/00207170802108441","title":"Stabilisation of infinitesimally rigid formations of multi-robot networks","year":2008,"lang":"en","type":"article","venue":"International Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":548,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Infinitesimal; Rigidity (electromagnetism); Manifold (fluid mechanics); Mathematics; Graph; Notation; Directed graph; Enhanced Data Rates for GSM Evolution; Polygon (computer graphics); Control theory (sociology); Topology (electrical circuits); Computer science; Control (management); Combinatorics; Mathematical analysis; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02371961519822132,"gpt":0.2569810431252407,"spread":0.2332614279270193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135959,0.0001198219,0.0003627929,0.0003202343,0.00003781139,0.00003950361,0.001228144,0.00006404084,0.00001784998],"category_scores_gemma":[0.0004077571,0.0001060456,0.0002409118,0.000180299,0.00007530383,0.001024618,0.00005534454,0.0001565072,0.000004369986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008869788,"about_ca_system_score_gemma":0.0002210985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000298055,"about_ca_topic_score_gemma":0.000007567091,"domain_scores_codex":[0.9975196,0.0001257461,0.001294798,0.0001047909,0.000805456,0.0001495739],"domain_scores_gemma":[0.9952323,0.0003817232,0.001723701,0.0002249532,0.002356649,0.00008063995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008012171,0.001729689,0.08626487,0.0000484231,0.00224492,0.0001600845,0.003199877,0.8004357,0.03424397,0.04424595,0.0009003317,0.02572495],"study_design_scores_gemma":[0.009675617,0.0003094744,0.07525266,0.0001499495,0.00004703627,0.0003348754,0.00006198101,0.9101223,0.002078713,0.0003721213,0.001407706,0.0001875357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03747059,0.0002297742,0.9603499,0.0006119135,0.000873047,0.0001664412,0.00003369075,0.00001475692,0.0002498714],"genre_scores_gemma":[0.9914469,0.00003398439,0.008259622,0.0001030107,0.0001204989,0.000004780956,0.000005422432,0.000006195078,0.00001966019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9539762,"threshold_uncertainty_score":0.4324415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2048848526","doi":"10.1109/tie.2013.2245612","title":"A Decentralized Cooperative Control Scheme With Obstacle Avoidance for a Team of Mobile Robots","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":377,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mobile robot; Robot; Obstacle; Obstacle avoidance; Robot control; Polygon (computer graphics); Computer science; Robot kinematics; Simulation; Engineering; Artificial intelligence; Computer network; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.01806730161156593,"gpt":0.2364055783702505,"spread":0.2183382767586846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002687355,0.0003147167,0.0005662197,0.0001275965,0.0002245622,0.0001595866,0.000674126,0.0002387107,0.00003784677],"category_scores_gemma":[0.00003108498,0.0002714739,0.0001781688,0.0006391259,0.00008442672,0.0005940007,0.000001942389,0.0004999643,0.00002789798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003276601,"about_ca_system_score_gemma":0.0007633552,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001205042,"about_ca_topic_score_gemma":0.00009574294,"domain_scores_codex":[0.9975806,0.0001713146,0.0005797038,0.0005268714,0.0003929185,0.0007485804],"domain_scores_gemma":[0.9980444,0.0004002821,0.0002923244,0.0005975022,0.0004867329,0.0001787395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003170735,0.003287359,0.00007833564,0.00008540285,0.002188113,0.00000615575,0.001163239,0.7654766,0.1048389,0.01429057,0.004999916,0.1004147],"study_design_scores_gemma":[0.0403727,0.006491356,0.00001493479,0.0002102225,0.0001975663,0.00003372614,0.0002014755,0.7253344,0.2148881,0.0002391784,0.01100333,0.001012961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0174101,0.0001815334,0.9775771,0.0002933916,0.0004460376,0.003707765,0.0001588171,0.0001632885,0.00006194185],"genre_scores_gemma":[0.9939176,0.000020447,0.003308066,0.00009645263,0.00005671037,0.002293523,0.000006331017,0.00002976699,0.0002710529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9765075,"threshold_uncertainty_score":0.9999738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1991360560","doi":"10.1109/tnn.2010.2050601","title":"Neural-Network-Based Adaptive Leader-Following Control for Multiagent Systems With Uncertainties","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":340,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Artificial neural network; Multi-agent system; Control theory (sociology); Constraint (computer-aided design); Tracking error; Adaptive control; State (computer science); Control (management); Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01990881461671435,"gpt":0.2318356880729288,"spread":0.2119268734562145,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004747924,0.0005855564,0.0006757903,0.0001595363,0.0007159669,0.000511467,0.001024585,0.0002827779,0.000006410202],"category_scores_gemma":[0.000009887794,0.0004861897,0.000486081,0.0005851982,0.0001207206,0.0006012656,0.000003508771,0.000926559,0.00001046837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001021417,"about_ca_system_score_gemma":0.00008596302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001496343,"about_ca_topic_score_gemma":0.0003216094,"domain_scores_codex":[0.9964682,0.0002646857,0.0006348295,0.000939913,0.0005681467,0.001124157],"domain_scores_gemma":[0.9970829,0.001045169,0.000298435,0.001005109,0.0002445255,0.0003238708],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003297351,0.0001327706,0.00006316396,0.0000193596,0.0002110426,0.00003543516,0.00005305047,0.9906446,0.0002806363,0.0003125426,0.0003692208,0.007548428],"study_design_scores_gemma":[0.004353331,0.0006229358,0.00007721382,0.00009146262,0.0001421393,0.00002470808,0.00005303808,0.9934314,0.000179538,0.000008929243,0.000465678,0.0005495483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007030518,0.0001649717,0.9795939,0.0007305213,0.009327962,0.00239478,0.00006701219,0.0006619003,0.00002847732],"genre_scores_gemma":[0.9944686,0.000001930336,0.003070902,0.000592839,0.0005261229,0.001078589,0.00001140903,0.00006860297,0.0001810208],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9874381,"threshold_uncertainty_score":0.999759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2519129141","doi":"10.1016/j.automatica.2017.07.064","title":"Distributed Nash equilibrium seeking for aggregative games with coupled constraints","year":2017,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":322,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"National Key Research and Development Program of China; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Nash equilibrium; Convergence (economics); Lyapunov function; Mathematical optimization; Distributed algorithm; Computer science; Information exchange; Simple (philosophy); Variational inequality; Multi-agent system; Best response; Mathematics; Topology (electrical circuits); Distributed computing; Nonlinear system; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.02008389679764252,"gpt":0.2691156533546784,"spread":0.2490317565570359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042936,0.0002863584,0.0004719069,0.00005794077,0.0004817955,0.001146932,0.001888259,0.00009333388,0.00001683433],"category_scores_gemma":[0.0006113849,0.0002343865,0.0001154503,0.0001183405,0.0003928491,0.0008958738,0.0002899473,0.0001110827,0.00006579498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009198466,"about_ca_system_score_gemma":0.0001667599,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002889129,"about_ca_topic_score_gemma":0.0000130804,"domain_scores_codex":[0.9979585,0.00005234135,0.0004135849,0.0005518597,0.0004144628,0.0006092201],"domain_scores_gemma":[0.9968771,0.0004257465,0.000662547,0.001565304,0.0002810505,0.000188195],"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.0004926762,0.001715022,0.01748549,0.001918254,0.004616738,0.001007046,0.009196701,0.001256908,0.05224938,0.7050779,0.01998566,0.1849982],"study_design_scores_gemma":[0.003013412,0.0001761625,0.01395745,0.0003387781,0.00005007966,0.00004617372,0.00009584277,0.9774033,0.0009952702,0.002525114,0.0009723579,0.0004260838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03057719,0.000029284,0.9634503,0.002182632,0.0003923357,0.001151544,0.0002080109,0.0006128375,0.001395834],"genre_scores_gemma":[0.9752682,6.490999e-7,0.02410019,0.00008782634,0.00006915559,0.0002088679,0.00005238232,0.00002182937,0.0001908634],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761463,"threshold_uncertainty_score":0.99989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611964096","doi":"10.1109/tac.2018.2833140","title":"A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":313,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Monotonic function; Property (philosophy); Best response; Exploit; Game theory; Complete information; Dynamics (music); Equilibrium selection","retraction":null,"screen_n_in":null,"score":{"opus":0.01449515289141766,"gpt":0.2396485008260965,"spread":0.2251533479346789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006507309,0.0004090089,0.0005683146,0.0003403097,0.00031028,0.0004821761,0.001164813,0.0001774503,0.00006478932],"category_scores_gemma":[0.00002649762,0.0003904972,0.0002933205,0.0009641192,0.00008578361,0.000438937,0.000006179851,0.0002488453,0.0003400678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002321575,"about_ca_system_score_gemma":0.0001586684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005686747,"about_ca_topic_score_gemma":0.00002866062,"domain_scores_codex":[0.9967302,0.0003431151,0.0006430148,0.0007995789,0.0006777518,0.0008063249],"domain_scores_gemma":[0.9974212,0.0004425502,0.0002059215,0.001377547,0.0001806069,0.0003721572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001990492,0.002246753,0.00008092213,0.0001665386,0.0007138778,0.00003655774,0.001097967,0.7902448,0.01382815,0.001742066,0.003949217,0.1856942],"study_design_scores_gemma":[0.003207617,0.0002484139,0.0004183644,0.00009895881,0.00006659349,0.0000115448,0.00001195161,0.9940962,0.0006175801,0.00002942829,0.0007864607,0.0004069234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00332062,0.0000137547,0.9902861,0.0008660582,0.00185884,0.001368863,0.00003831042,0.00125811,0.0009894182],"genre_scores_gemma":[0.9865296,1.675536e-7,0.01031292,0.00220052,0.0002176977,0.0005093645,0.000002573759,0.0000406484,0.000186521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.983209,"threshold_uncertainty_score":0.9998547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2063403497","doi":"10.1109/cdc.2012.6426375","title":"Push-Sum Distributed Dual Averaging for convex optimization","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":311,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Asynchronous communication; Convergence (economics); Complement (music); Distributed algorithm; Dual (grammatical number); Convex optimization; Distributed computing; Mathematical optimization; Wireless; Protocol (science); Wireless sensor network; Theoretical computer science; Algorithm; Regular polygon; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02092312093004689,"gpt":0.2470919230095981,"spread":0.2261688020795513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000481811,0.0001745627,0.0002185927,0.0000677944,0.0001582032,0.0002430863,0.0004717109,0.00007963629,0.00004752747],"category_scores_gemma":[0.0001249294,0.0001598721,0.00009446964,0.0002761897,0.00002028909,0.001158404,0.000137079,0.0000670934,0.00008792047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009907488,"about_ca_system_score_gemma":0.00004009321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002124646,"about_ca_topic_score_gemma":0.00000133083,"domain_scores_codex":[0.9984387,0.0000634652,0.0003283219,0.0003073936,0.0002574023,0.000604691],"domain_scores_gemma":[0.9988506,0.0001529547,0.0001316893,0.0004873781,0.0001680936,0.0002092902],"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.00008162019,0.00105198,0.02116414,0.0002051415,0.0004657809,0.0000154605,0.001951426,0.1330687,0.003442057,0.7275988,0.08824771,0.02270724],"study_design_scores_gemma":[0.001215802,0.0000281045,0.00103935,0.00001152925,0.00001511605,0.00001432793,0.00004778398,0.973058,0.001095219,0.0001016678,0.02310213,0.0002709852],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005167798,0.00009096497,0.9948324,0.0009526761,0.001365566,0.0005631708,0.00007707693,0.0004361754,0.001165196],"genre_scores_gemma":[0.9431465,0.000001693661,0.05546226,0.0002690894,0.00026038,0.0001117222,0.0002403798,0.00001426934,0.0004936924],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9426298,"threshold_uncertainty_score":0.6519397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2148252440","doi":"10.1098/rsfs.2012.0033","title":"From behavioural analyses to models of collective motion in fish schools","year":2012,"lang":"en","type":"review","venue":"Interface Focus","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":288,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Workplace Health, Safety and Compensation Commission","funders":"Army Research Office; Office of Naval Research; Centre National de la Recherche Scientifique; National Science Foundation","keywords":"Ethology; Motion (physics); Dynamics (music); Collective motion; Set (abstract data type); Ecology; Cognitive psychology; Computer science; Cognitive science; Data science; Psychology; Artificial intelligence; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.1894890155143223,"gpt":0.3863537112683015,"spread":0.1968646957539792,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003402625,0.0004785939,0.001899606,0.0005611237,0.00003080871,0.0001661685,0.001856622,0.0003170236,0.00002432848],"category_scores_gemma":[0.00008791701,0.0004263195,0.0004375995,0.001155858,0.00002028631,0.0006870864,0.0003901623,0.0004549631,0.0001636077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007372244,"about_ca_system_score_gemma":0.0002521167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003423865,"about_ca_topic_score_gemma":0.0004262016,"domain_scores_codex":[0.9967638,0.0004820631,0.001124952,0.0007259342,0.0004331165,0.0004701096],"domain_scores_gemma":[0.9977583,0.0001876821,0.0006417165,0.00102833,0.0001893806,0.0001946054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001367865,0.0002744932,0.00006817195,0.0005916544,0.0003789764,0.0000145387,0.001077506,0.0007616695,0.00006757848,0.0001266729,0.001127628,0.9954974],"study_design_scores_gemma":[0.008470782,0.001864762,0.001640629,0.1512257,0.008345115,0.000165722,0.001172975,0.06215949,0.008105311,0.007401067,0.7381744,0.01127407],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"empirical","genre_scores_codex":[0.00009400413,0.6496841,0.347839,0.00004432032,0.0005617515,0.001004491,0.0005034697,0.00006039553,0.000208527],"genre_scores_gemma":[0.6391295,0.3500222,0.007973626,0.00002252374,0.0004386863,0.001301922,0.0001130344,0.0001618577,0.0008366975],"genre_candidate":"review","genre_consensus":null,"teacher_disagreement_score":0.9842234,"threshold_uncertainty_score":0.9998189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2899962524","doi":"10.1109/tsmc.2018.2875250","title":"Input-Based Event-Triggering Consensus of Multiagent Systems Under Denial-of-Service Attacks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":259,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Natural Science Foundation of Zhejiang Province","keywords":"Denial-of-service attack; Event (particle physics); Computer science; Computer security; Multi-agent system; Consensus; Denial; Distributed computing; Artificial intelligence; Psychology; World Wide Web; Physics; The Internet","retraction":null,"screen_n_in":null,"score":{"opus":0.02514848116404525,"gpt":0.2549696866138593,"spread":0.229821205449814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103779,0.0006141847,0.001251439,0.0005477465,0.0002769986,0.0003707227,0.001024348,0.0003883938,0.000005392843],"category_scores_gemma":[0.00001440888,0.000590615,0.0002438007,0.0009254102,0.0002500519,0.000179722,0.00001769328,0.0002961563,0.00008648509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002310938,"about_ca_system_score_gemma":0.0002373435,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004320871,"about_ca_topic_score_gemma":0.0002537145,"domain_scores_codex":[0.994364,0.00078745,0.002069019,0.0009400615,0.001144177,0.0006953008],"domain_scores_gemma":[0.9952834,0.0005082333,0.001159252,0.001627302,0.001040411,0.000381416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003991711,0.001571383,0.0006545662,0.007980492,0.001810401,0.00008520324,0.003316424,0.9220727,0.04115658,0.0172436,0.001294992,0.002414479],"study_design_scores_gemma":[0.003376198,0.0006283202,0.0002120137,0.002289993,0.0001785126,0.0001763773,0.001450432,0.9795787,0.009072212,0.000008123642,0.002263392,0.0007657763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09501059,0.001600601,0.892426,0.000123781,0.007753222,0.002072469,0.0002437837,0.0002626739,0.000506876],"genre_scores_gemma":[0.9985751,0.0000200743,0.0002776993,0.00004887589,0.0002231266,0.000217292,0.000006258692,0.00006639889,0.0005651613],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9035645,"threshold_uncertainty_score":0.9996545,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2292984388","doi":"10.1016/j.automatica.2015.12.029","title":"Distributed finite-time velocity-free attitude coordination control for spacecraft formations","year":2016,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":246,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Angular velocity; Spacecraft; Observer (physics); Control theory (sociology); Angular acceleration; Attitude control; Acceleration; Computer science; Control (management); Engineering; Physics; Control engineering; Aerospace engineering; Classical mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.01070040975221468,"gpt":0.2342283388769796,"spread":0.2235279291247649,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261516,0.0002437326,0.0003826485,0.0001347981,0.0002669617,0.0002541693,0.001403756,0.000122281,0.00004675368],"category_scores_gemma":[0.002062734,0.0001818067,0.0001696406,0.0003533449,0.00006304886,0.001093323,0.0001724517,0.0000632902,0.0007702223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002060456,"about_ca_system_score_gemma":0.0001100074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000784618,"about_ca_topic_score_gemma":0.000006531065,"domain_scores_codex":[0.997936,0.0001320434,0.000590658,0.0003843102,0.0004168456,0.0005401755],"domain_scores_gemma":[0.9962742,0.00171867,0.0003152761,0.001164104,0.0003532225,0.0001745123],"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.00009890942,0.000944899,0.001089695,0.0003626076,0.001002532,0.00002269592,0.001219669,0.0008226259,0.02095051,0.5916344,0.3024488,0.07940268],"study_design_scores_gemma":[0.006416153,0.0001284176,0.004611067,0.0001198945,0.0000574008,0.000008155542,0.00001341263,0.9584618,0.0004793246,0.01036504,0.01895626,0.000383116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009794348,0.00001985566,0.972904,0.02226379,0.0003076812,0.001203813,0.001037871,0.0008682148,0.0004153601],"genre_scores_gemma":[0.9720916,0.000001040297,0.02613704,0.0002465068,0.00008692302,0.000530988,0.0001150714,0.00002026449,0.0007706365],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9711121,"threshold_uncertainty_score":0.9899907,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983523909","doi":"10.1016/j.automatica.2009.06.006","title":"Multi-agent team cooperation: A game theory approach","year":2009,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":242,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Bargaining problem; Game theory; Pareto principle; Nash equilibrium; Minification; Cooperative game theory; Controller (irrigation); Computer science; Set (abstract data type); Function (biology); Complete information; Mathematics; Mathematical economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01761174270293917,"gpt":0.2488332357771742,"spread":0.2312214930742351,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435417,0.0002315293,0.0003023754,0.00008860626,0.0001326585,0.0004786404,0.001082496,0.00009343516,0.00003956018],"category_scores_gemma":[0.0001188126,0.0001975651,0.0001054657,0.000353841,0.00003882478,0.0006258641,0.00009649538,0.0001545236,0.0006382322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001498382,"about_ca_system_score_gemma":0.0001441808,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000297495,"about_ca_topic_score_gemma":0.000009224458,"domain_scores_codex":[0.9980145,0.000247448,0.000452384,0.000484798,0.0003822789,0.000418654],"domain_scores_gemma":[0.9984698,0.00009134553,0.0001319112,0.001032987,0.0001030345,0.0001709048],"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.00002666525,0.00295287,0.0002659296,0.00009398121,0.0002625455,0.00008357957,0.01455872,0.00327731,0.006473836,0.8225712,0.01974872,0.1296846],"study_design_scores_gemma":[0.001246168,0.0001111765,0.008560457,0.00003321957,0.00001930855,0.00005404408,0.0000746327,0.9824208,0.0002435118,0.001365856,0.005527312,0.0003434913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002740428,0.0001066145,0.9768974,0.0006529519,0.0002807698,0.0006141071,0.000003494567,0.0008940131,0.01781028],"genre_scores_gemma":[0.9000262,0.000001162179,0.09693826,0.0007752305,0.00006170179,0.00006498715,0.00001340261,0.000009479009,0.00210959],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9791435,"threshold_uncertainty_score":0.8203397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2968521751","doi":"10.1109/tnnls.2019.2927887","title":"Distributed Finite-Time Fault-Tolerant Containment Control for Multiple Unmanned Aerial Vehicles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shaanxi Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Convex hull; Differentiator; Fault tolerance; Computer science; Actuator; Controller (irrigation); Observer (physics); Lyapunov stability; Control engineering; Engineering; Regular polygon; Distributed computing; Control (management); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.008662269612981586,"gpt":0.2071755716616811,"spread":0.1985133020486995,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006419523,0.0004083837,0.0007083119,0.0001118688,0.0005724304,0.0005547683,0.0004668876,0.0002240554,0.000008817962],"category_scores_gemma":[0.00003029361,0.0003665253,0.0002442009,0.0002550189,0.00004653464,0.0003574501,0.000005593528,0.0005381621,0.00004610108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001045244,"about_ca_system_score_gemma":0.00002754464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001471833,"about_ca_topic_score_gemma":0.000008970201,"domain_scores_codex":[0.9969217,0.0005858269,0.0006719008,0.0007548391,0.000362519,0.0007032166],"domain_scores_gemma":[0.9971091,0.001713542,0.0003172052,0.0004783995,0.0001492547,0.0002325052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003615859,0.00009132559,0.0002617225,0.00005066891,0.0001423945,0.000007328164,0.0001046365,0.9936661,0.001220432,0.0001113156,0.0001203438,0.003862161],"study_design_scores_gemma":[0.006402505,0.000679292,0.0002116045,0.0001284671,0.00005046501,0.00002020269,0.0001069221,0.988252,0.00007404852,0.000002525867,0.003669329,0.0004026401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06888799,0.0002219332,0.9249076,0.000282803,0.003055341,0.002075271,0.0001659313,0.0003907172,0.00001242071],"genre_scores_gemma":[0.998485,0.000008972858,0.00008802164,0.0001123363,0.0002578529,0.0003623983,0.00005126904,0.00003952718,0.0005946529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.929597,"threshold_uncertainty_score":0.9998786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047083748","doi":"10.1109/tro.2011.2174493","title":"Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Robustness (evolution); Bounded function; Mobile robot; Control theory (sociology); Controller (irrigation); Computer science; Motion planning; Field (mathematics); Control engineering; Mathematics; Engineering; Artificial intelligence; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.04025656053264936,"gpt":0.2283417801497222,"spread":0.1880852196170728,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001977346,0.0001898841,0.0002120905,0.0004146362,0.0001681562,0.00007382848,0.0003576295,0.00008107437,0.000004616459],"category_scores_gemma":[0.00000335262,0.0002092394,0.00009087904,0.0004026542,0.00003405407,0.0003644272,0.000007126949,0.0002213104,0.00004158276],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001732032,"about_ca_system_score_gemma":0.00001496772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004128238,"about_ca_topic_score_gemma":0.000005633205,"domain_scores_codex":[0.9985635,0.00006903666,0.0002879176,0.0003957075,0.0002426082,0.0004412519],"domain_scores_gemma":[0.9993209,0.00005175752,0.00007462557,0.0004137091,0.00001229146,0.0001267155],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008137973,0.0002466186,0.0007210652,0.0000242545,0.000069978,0.00003945233,0.002999929,0.984543,0.001319076,0.000376045,0.000001434925,0.009651064],"study_design_scores_gemma":[0.001736677,0.0002475849,0.005642063,0.0003707474,0.00009753803,0.00005612487,0.00115341,0.9796115,0.01028937,0.00008477935,0.0000297937,0.0006804076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007454324,0.000102755,0.9906092,0.00009595401,0.001266352,0.0002401959,0.000002315181,0.00008546962,0.0001434327],"genre_scores_gemma":[0.9800278,0.00004369372,0.01960933,0.00002728692,0.00002910243,0.00003024361,4.213275e-7,0.00001631843,0.0002157911],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9725735,"threshold_uncertainty_score":0.8532536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2130758224","doi":"10.1109/allerton.2012.6483403","title":"Consensus-based distributed optimization: Practical issues and applications in large-scale machine learning","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":239,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Asynchronous communication; Computer science; Distributed computing; Consensus; Node (physics); Distributed algorithm; Gradient descent; Protocol (science); Optimization problem; Convex optimization; Mathematical optimization; Computer network; Regular polygon; Multi-agent system; Algorithm; Artificial intelligence; Mathematics; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01780270788303639,"gpt":0.2885679137061204,"spread":0.2707652058230841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005656352,0.0001465715,0.0002028017,0.00008280414,0.000144566,0.0001461015,0.0002099596,0.00007976417,0.00004877786],"category_scores_gemma":[0.0001770007,0.0001321076,0.00003092985,0.0004437008,0.00004017244,0.0003346674,0.0001180395,0.0001837632,0.00003204278],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004945957,"about_ca_system_score_gemma":0.00004308132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007294921,"about_ca_topic_score_gemma":0.00003486422,"domain_scores_codex":[0.9985952,0.0001951682,0.0002986972,0.0002976171,0.0002098184,0.0004034436],"domain_scores_gemma":[0.9989634,0.0003185405,0.0001066004,0.0003404998,0.00008472416,0.000186275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003367796,0.001445433,0.7864236,0.00007116,0.00005287624,0.00001565293,0.000638352,0.1054815,0.000218662,0.1025637,0.001663538,0.001391765],"study_design_scores_gemma":[0.0008724622,0.00001964128,0.008378536,0.000008766193,0.000008228959,0.00001233091,0.0001158197,0.9628109,0.000122037,0.00002371549,0.02745827,0.0001692773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001094786,0.0004033782,0.9937668,0.003403556,0.00006872365,0.000407915,0.00004328038,0.0002508088,0.0005607301],"genre_scores_gemma":[0.8989746,0.000007743725,0.1003039,0.0001343907,0.00006536115,0.00009551505,0.0002105874,0.00001001602,0.000197871],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8978798,"threshold_uncertainty_score":0.5387194,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2771382046","doi":"10.1109/tsmc.2017.2773634","title":"Event-Triggered Pinning Control for Consensus of Multiagent Systems With Quantized Information","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":225,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"Australian Research Council; Higher Education Discipline Innovation Project; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Multi-agent system; Consensus; Control (management); Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01940603524135505,"gpt":0.2456947239200316,"spread":0.2262886886786765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001262571,0.0005246421,0.001169649,0.000355888,0.0008027273,0.001693018,0.001017286,0.0002769454,8.421417e-7],"category_scores_gemma":[0.00003986616,0.0004464743,0.0002096878,0.0001682238,0.0001834001,0.0006808834,0.000008857177,0.0002282359,0.00002613757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001552828,"about_ca_system_score_gemma":0.0001512142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002963984,"about_ca_topic_score_gemma":0.00005114956,"domain_scores_codex":[0.9959233,0.0003758889,0.001638668,0.0006032328,0.0008422088,0.00061668],"domain_scores_gemma":[0.9948063,0.0004451421,0.001966629,0.001700521,0.0007815432,0.000299898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002493579,0.001177657,0.001266926,0.01097431,0.004516795,0.00009815938,0.005438944,0.8839045,0.008655972,0.06829661,0.003100779,0.01007584],"study_design_scores_gemma":[0.0112463,0.0007118543,0.0003186614,0.001648449,0.0002162165,0.0001772198,0.001269128,0.9789558,0.0005522936,0.000008310953,0.004227756,0.0006679776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01446561,0.0007417252,0.9745055,0.0001494822,0.004342552,0.004697184,0.0005586012,0.0002145137,0.0003248564],"genre_scores_gemma":[0.9979329,0.00002849734,0.0003533723,0.00002410208,0.0001072049,0.0009144003,0.00001126877,0.00004023361,0.00058809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9834672,"threshold_uncertainty_score":0.9997987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2676821827","doi":"10.1109/tie.2017.2711575","title":"Integral Sliding Mode Flight Controller Design for a Quadrotor and the Application in a Heterogeneous Multi-Agent System","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":209,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Integral sliding mode; Waypoint; Controller (irrigation); Inner loop; Bounded function; Computer science; Lyapunov stability; Lyapunov function; Sliding mode control; Loop (graph theory); Mathematics; Control (management); Artificial intelligence; Nonlinear system; Physics; Real-time computing","retraction":null,"screen_n_in":null,"score":{"opus":0.05596944780095627,"gpt":0.2879269052459633,"spread":0.231957457445007,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244563,0.000301872,0.0005123531,0.0001504936,0.0008819297,0.0005763491,0.001127569,0.0002806102,5.238504e-7],"category_scores_gemma":[0.00006299218,0.0002311745,0.0002057713,0.0001513052,0.0000853129,0.0003240145,0.000007334932,0.0005306926,0.000008346054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006593314,"about_ca_system_score_gemma":0.0002366159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005028525,"about_ca_topic_score_gemma":0.0004087879,"domain_scores_codex":[0.997565,0.0003760184,0.0005851918,0.0005970512,0.0002802379,0.0005965547],"domain_scores_gemma":[0.9980194,0.0004899747,0.0003881516,0.000885691,0.0001022218,0.0001145505],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01077977,0.001321274,0.0000499006,0.0001445305,0.001387263,0.00002854927,0.00231048,0.6752906,0.01302395,0.09374794,0.0002827738,0.2016329],"study_design_scores_gemma":[0.01705378,0.000212732,0.000003276158,0.00006782711,0.00006447093,0.00002499136,0.00004146552,0.973522,0.007891036,0.0001359917,0.0007478517,0.0002345873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002956026,0.0001468063,0.990378,0.0007202383,0.0007667757,0.004842993,0.00004333356,0.0001346178,0.00001117545],"genre_scores_gemma":[0.9949263,0.00002214171,0.001318159,0.00004285984,0.0001210761,0.003465964,0.000002035454,0.00002591417,0.00007551668],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9919703,"threshold_uncertainty_score":0.9427024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107723135","doi":"10.1109/tac.2010.2072570","title":"A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Computer science; Graph; Containment (computer programming); Convergence (economics); Property (philosophy); Class (philosophy); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Graph theory; Multi-agent system; Distributed computing; Mathematics; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02511481354304722,"gpt":0.2684260492816498,"spread":0.2433112357386025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001244837,0.0004061986,0.0009336909,0.0003583705,0.0001963252,0.0003948359,0.0009129887,0.0002802745,0.00001491985],"category_scores_gemma":[0.0001512091,0.0003910456,0.0003140761,0.0005618287,0.0001087212,0.001117081,0.000003297888,0.0003569169,0.00001574482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002087824,"about_ca_system_score_gemma":0.0003985174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005557791,"about_ca_topic_score_gemma":0.001268779,"domain_scores_codex":[0.9965624,0.000406439,0.001231531,0.0006419087,0.0005467011,0.0006110269],"domain_scores_gemma":[0.9961279,0.001602648,0.0005890387,0.001075593,0.0004307048,0.0001740974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001150919,0.007387191,0.00111332,0.001789387,0.001856324,0.00004345976,0.002040709,0.6449581,0.2341154,0.0807323,0.0003826298,0.02443027],"study_design_scores_gemma":[0.01480887,0.00028654,0.003227071,0.0001136446,0.00009409348,0.00001042514,0.0001647421,0.9792723,0.001074074,0.0003817598,0.0002274486,0.0003390036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07904457,0.00002916702,0.9129283,0.0004961282,0.00203259,0.00406465,0.0009559805,0.0004193104,0.00002928859],"genre_scores_gemma":[0.9954929,0.000001129584,0.002224878,0.00007056857,0.00003471901,0.002088993,0.00001555335,0.00002874351,0.00004248231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9164484,"threshold_uncertainty_score":0.9998541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2345097924","doi":"10.1109/tcyb.2015.2509646","title":"A Q-Learning Approach to Flocking With UAVs in a Stochastic Environment","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Flocking (texture); Reinforcement learning; Markov decision process; Computer science; Drone; Q-learning; Mathematical optimization; Markov process; Distributed computing; Artificial intelligence; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01222864924067867,"gpt":0.2000832340893112,"spread":0.1878545848486325,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001935618,0.0002104025,0.0002098823,0.0002150708,0.00009072213,0.00008047083,0.0004921363,0.00007064876,0.00001028349],"category_scores_gemma":[0.000006868663,0.0001547772,0.00005265294,0.0003353186,0.00003533421,0.0001568023,0.000005145791,0.0002083031,0.0002087647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002499162,"about_ca_system_score_gemma":0.00003786656,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004350558,"about_ca_topic_score_gemma":0.00002886416,"domain_scores_codex":[0.998268,0.0001019248,0.0002703499,0.0005279966,0.0004193453,0.0004123511],"domain_scores_gemma":[0.999095,0.0001371688,0.00006600774,0.000508389,0.00002509514,0.0001683684],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003795203,0.0003235631,0.00003917724,0.000006355514,0.00003392526,0.00001028202,0.001128264,0.9418593,0.002021508,0.0004863872,0.00001289258,0.05404036],"study_design_scores_gemma":[0.006820632,0.001711145,0.002194484,0.0006821871,0.00007459276,0.0001092978,0.0003372712,0.9770948,0.006230516,0.0001606656,0.00313375,0.001450677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01370424,0.000010153,0.9847373,0.0003202474,0.0001679551,0.0004607647,0.000008110486,0.0001327691,0.0004584115],"genre_scores_gemma":[0.9863148,0.000003998115,0.01274396,0.00005813924,0.00002307758,0.0001798665,4.663502e-7,0.00002265222,0.0006529829],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9726106,"threshold_uncertainty_score":0.6311629,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1965940578","doi":"10.1109/tie.2012.2235391","title":"Distributed Cohesive Motion Control of Flight Vehicle Formations","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Kinematics; Control theory (sociology); Motion control; Computer science; Double integrator; Context (archaeology); Rigidity (electromagnetism); Robot kinematics; Flocking (texture); Integrator; Mobile robot; Vehicle dynamics; Robot; Control engineering; Multi-agent system; Engineering; Control (management); Artificial intelligence; Aerospace engineering; Classical mechanics; Physics; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.02388290693635011,"gpt":0.2347146673313848,"spread":0.2108317603950347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005245905,0.0002579126,0.000386016,0.0002123819,0.0002712769,0.0000804266,0.0006101202,0.0003061781,0.000030185],"category_scores_gemma":[0.0000399126,0.0002582558,0.0002268249,0.0008633595,0.00005283883,0.001133332,0.000002921148,0.0005808197,0.00008421989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004612964,"about_ca_system_score_gemma":0.0002413951,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004221216,"about_ca_topic_score_gemma":0.00001325463,"domain_scores_codex":[0.9975096,0.0002549237,0.000672508,0.000279361,0.0005013256,0.0007822652],"domain_scores_gemma":[0.9983137,0.0002741609,0.000343393,0.0006223121,0.000219532,0.0002268636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001701649,0.01013382,0.001406403,0.0001471565,0.003353396,0.00001376873,0.003328056,0.3474639,0.1000981,0.1752505,0.009162975,0.3479402],"study_design_scores_gemma":[0.02068817,0.001540398,0.000560272,0.0001377232,0.0005548425,0.0000639744,0.0002117503,0.4786601,0.4682903,0.0005982901,0.02729041,0.001403837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009193292,0.0001375801,0.9870409,0.0006311689,0.001488766,0.0007477165,0.0004044128,0.000215985,0.0001401573],"genre_scores_gemma":[0.9993563,0.0000148034,0.0001672988,0.00006535154,0.0001671202,0.0001225375,0.00003251448,0.00001734548,0.00005667494],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9901631,"threshold_uncertainty_score":0.9999869,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140947684","doi":"10.1016/j.automatica.2005.08.001","title":"Pursuit formations of unicycles","year":2005,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":199,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada","keywords":"Modulo; Simple (philosophy); Control theory (sociology); Stability (learning theory); Control (management); Computer science; Mathematics; Artificial intelligence; Epistemology; Philosophy; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01035615058161306,"gpt":0.2368769162883277,"spread":0.2265207657067146,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002224367,0.0000792602,0.0001524006,0.00007695131,0.00005224668,0.00007604714,0.0008770538,0.0000353845,0.00003169202],"category_scores_gemma":[0.00006849015,0.0000716382,0.00005914996,0.0002388941,0.00002721755,0.0005924868,0.0001178891,0.00004255796,0.0003954897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003402419,"about_ca_system_score_gemma":0.00003590523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001117693,"about_ca_topic_score_gemma":0.000008215582,"domain_scores_codex":[0.9990243,0.00004167937,0.0003533473,0.0001200683,0.0002752979,0.0001853578],"domain_scores_gemma":[0.9990635,0.0001025307,0.0001410373,0.0005710077,0.00006127699,0.00006066578],"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.000001825021,0.000264552,0.0003599254,0.00008531561,0.00009428593,0.000003207676,0.001807424,0.0007365621,0.00563417,0.8156961,0.008942954,0.1663737],"study_design_scores_gemma":[0.0006443764,0.00003848494,0.009493478,0.00005768026,0.00001571602,0.00001580278,0.00006209995,0.9464329,0.00554996,0.002811238,0.03469004,0.0001882309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03075903,0.0001197762,0.9351619,0.005810334,0.000157409,0.0003369127,0.00001795657,0.0005850478,0.02705162],"genre_scores_gemma":[0.9598209,0.000001647358,0.03984816,0.0001111252,0.00002297898,0.00001928027,0.000003805921,0.000004156292,0.0001679691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9456964,"threshold_uncertainty_score":0.5083352,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3043172417","doi":"10.1109/tcyb.2020.3004572","title":"Prescribed-Time Event-Triggered Bipartite Consensus of Multiagent Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Project of Shandong Province Higher Educational Science and Technology Program; Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Bipartite graph; Lyapunov stability; Settling time; Multi-agent system; Control theory (sociology); Computer science; Lyapunov function; Algebraic graph theory; Mathematics; Control (management); Graph; Theoretical computer science; Artificial intelligence; Engineering; Control engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02538535915877381,"gpt":0.2325033385913612,"spread":0.2071179794325874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021678,0.0003021332,0.0004962917,0.000126428,0.0001027535,0.0001283988,0.0008444026,0.0001495922,0.00003836278],"category_scores_gemma":[0.0000234777,0.0003037083,0.0002427183,0.0005887304,0.00008569605,0.0001256525,0.00000758586,0.0002538708,0.0005318963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007990108,"about_ca_system_score_gemma":0.0001120058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001456911,"about_ca_topic_score_gemma":0.000009251912,"domain_scores_codex":[0.9972787,0.0002622531,0.0008293204,0.0005700767,0.0006387173,0.0004209345],"domain_scores_gemma":[0.9980665,0.0002555431,0.0002994518,0.000795816,0.0002323688,0.0003502864],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000218506,0.001173146,0.00004605571,0.0003316897,0.0007613314,0.0001085148,0.002911972,0.8489388,0.1227665,0.00208191,0.008311343,0.01235028],"study_design_scores_gemma":[0.00173474,0.000340641,0.00006010188,0.000101124,0.00009202599,0.00001344342,0.0000806844,0.9399017,0.0532395,0.00001526291,0.004058484,0.0003622609],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01672521,0.0002472765,0.9789488,0.001027093,0.001205823,0.0008512432,0.000285661,0.0003513839,0.0003574821],"genre_scores_gemma":[0.9969451,0.00002050951,0.002147175,0.0001599591,0.00006322707,0.00006287948,0.000004650135,0.00002915431,0.0005673505],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9802199,"threshold_uncertainty_score":0.9999415,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2344279181","doi":"10.1109/tcns.2015.2505149","title":"Distributed Online Convex Optimization on Time-Varying Directed Graphs","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":191,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Subgradient method; Network topology; Convex function; Computer science; Mathematical optimization; Lipschitz continuity; Sequence (biology); Strongly connected component; Convex optimization; Function (biology); Optimization problem; Topology (electrical circuits); Mathematics; Regular polygon; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02153765508310312,"gpt":0.232302752335776,"spread":0.2107650972526729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008395237,0.0004727768,0.001005506,0.0002945795,0.0002190722,0.0002092717,0.0009415072,0.0002626331,0.00001259125],"category_scores_gemma":[0.00004323571,0.0004485197,0.0002972315,0.001333998,0.00007503917,0.0004574787,0.000004554588,0.0003550157,0.00009140621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002608282,"about_ca_system_score_gemma":0.0001715431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001298946,"about_ca_topic_score_gemma":0.00001188786,"domain_scores_codex":[0.9957541,0.0007543339,0.001166153,0.0007188463,0.0009309078,0.0006756474],"domain_scores_gemma":[0.9964978,0.0006379005,0.0006602975,0.001106844,0.0006892314,0.0004079838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002720427,0.000429025,0.00003506292,0.00002724408,0.0003218646,0.00001670821,0.00006285116,0.9948161,0.0002332011,0.0005310658,0.002079532,0.001175268],"study_design_scores_gemma":[0.005319451,0.0004849205,0.00004274745,0.0003181041,0.0001023925,0.0000222369,0.00002484566,0.9922674,0.0001228387,0.00003341363,0.0008679288,0.0003937359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006452629,0.0003644342,0.9912965,0.0003286763,0.00410758,0.001358579,0.0006522458,0.0008921231,0.0003546104],"genre_scores_gemma":[0.9971828,0.00001333196,0.001864252,0.0001422081,0.0002594762,0.0001614997,0.0001187298,0.00004581326,0.0002118691],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9965376,"threshold_uncertainty_score":0.9997966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034114456","doi":"10.1016/j.automatica.2008.04.016","title":"Optimal consensus algorithms for cooperative team of agents subject to partial information","year":2008,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":187,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Robustness (evolution); Computer science; Adaptability; Multi-agent system; Minification; Fault tolerance; Information exchange; Consensus algorithm; Mathematical optimization; Control (management); Control theory (sociology); Distributed computing; Algorithm; Mathematics; Artificial intelligence; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03212601730101935,"gpt":0.2806417325183135,"spread":0.2485157152172942,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849573,0.0001482315,0.0002967147,0.0001088373,0.0001374931,0.00006746555,0.0004877652,0.00005975011,0.000009245622],"category_scores_gemma":[0.0003734355,0.0001357673,0.00008258242,0.0003087505,0.00005363327,0.0004030381,0.00009988084,0.00005005664,0.0001745511],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005669843,"about_ca_system_score_gemma":0.0001670273,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002797655,"about_ca_topic_score_gemma":0.0000016019,"domain_scores_codex":[0.9985258,0.00007382029,0.0005730024,0.0001889515,0.000335712,0.0003027399],"domain_scores_gemma":[0.9987373,0.0002124384,0.0001987269,0.0004065431,0.0003140957,0.0001309402],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006954113,0.002368387,0.002849738,0.0011221,0.001910062,0.0001414871,0.110775,0.135777,0.01298152,0.1161294,0.4953682,0.1198817],"study_design_scores_gemma":[0.001334305,0.0003049899,0.002235275,0.00003803171,0.00001167499,0.00003394085,0.0001103998,0.9821831,0.006429475,0.00002212621,0.007111374,0.000185283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1157695,0.000008066584,0.8810453,0.0004712867,0.0003708425,0.001182485,0.0001395399,0.0002158351,0.0007971489],"genre_scores_gemma":[0.8959508,6.865939e-7,0.1035377,0.0001953361,0.0000380824,0.0001657219,0.00002531721,0.000006351536,0.00007999378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8464061,"threshold_uncertainty_score":0.553643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034312826","doi":"10.1016/j.automatica.2012.08.044","title":"On consensus algorithms design for double integrator dynamics","year":2012,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":179,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Double integrator; Integrator; Ideal (ethics); Control theory (sociology); Consensus; Consensus algorithm; Multi-agent system; Computer science; State (computer science); Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Control (management); Law","retraction":null,"screen_n_in":null,"score":{"opus":0.04103071042194741,"gpt":0.2843955446725792,"spread":0.2433648342506317,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007037395,0.0001973609,0.0002638807,0.00008183137,0.0001307862,0.0001585991,0.0006307999,0.0000943818,0.000008903671],"category_scores_gemma":[0.0002124382,0.000165872,0.00009831467,0.0002142257,0.00003586187,0.0001957973,0.00006853559,0.0001104824,0.0003660685],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001810926,"about_ca_system_score_gemma":0.00007217423,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001476547,"about_ca_topic_score_gemma":0.000001879146,"domain_scores_codex":[0.9984603,0.0001126792,0.0003362287,0.0002651192,0.0002707867,0.0005549085],"domain_scores_gemma":[0.9981112,0.0008702149,0.0001410307,0.0005705901,0.0001061852,0.0002007258],"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.00004925652,0.0003825526,0.000114346,0.00006117881,0.0001303495,0.000007439865,0.000601038,0.0004764708,0.0002385315,0.9517688,0.01721181,0.02895823],"study_design_scores_gemma":[0.001353919,0.0001541041,0.0001457236,0.00003427278,0.00001772072,0.0000155109,0.00004821413,0.9925712,0.0008637554,0.002706513,0.001870352,0.0002186752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002431906,0.00005038514,0.9926888,0.0007646482,0.001077217,0.000940859,0.00002407457,0.0006179332,0.001404217],"genre_scores_gemma":[0.8301954,5.170888e-7,0.1688415,0.0001871467,0.00009105664,0.0002536283,0.0000154319,0.00001976044,0.0003955561],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9920948,"threshold_uncertainty_score":0.6764065,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2080183025","doi":"10.1109/tac.2014.2358071","title":"<inline-formula> <tex-math notation=\"TeX\">$H_{\\infty}$</tex-math></inline-formula> Consensus Achievement of Multi-Agent Systems With Directed and Switching Topology Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":164,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Mathematics; Network topology; Lyapunov function; Discrete mathematics; Algebraic number; Topology (electrical circuits); Algebra over a field; Computer science; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01154278150944019,"gpt":0.2317348626800201,"spread":0.22019208117058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002178723,0.001344982,0.002368526,0.0007849268,0.0008855597,0.0005601866,0.001402642,0.0005927661,0.00002201424],"category_scores_gemma":[0.0001801643,0.001151753,0.0005233372,0.001096494,0.0003079069,0.0006487924,0.00003884657,0.0006902157,0.0000943788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000529764,"about_ca_system_score_gemma":0.0003660805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003405714,"about_ca_topic_score_gemma":0.0009462371,"domain_scores_codex":[0.991062,0.00110157,0.003011168,0.001633441,0.001563118,0.001628684],"domain_scores_gemma":[0.9923383,0.002143264,0.001754061,0.002173652,0.0008850833,0.0007056132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008174286,0.004200754,0.0003407557,0.001611343,0.004541307,0.0002094828,0.004577908,0.7857079,0.04862086,0.03365507,0.0004032859,0.1153139],"study_design_scores_gemma":[0.01341826,0.0008843759,0.002040959,0.0007330252,0.0006390167,0.0002208125,0.0001078335,0.9787085,0.0004043927,0.00004661678,0.001700604,0.001095607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1664199,0.0005622735,0.8245426,0.0009748837,0.002292643,0.003525426,0.0002353992,0.001329792,0.0001170487],"genre_scores_gemma":[0.9864821,0.0000536728,0.01149563,0.0003696396,0.0002074001,0.0008123213,0.00005543341,0.0001371594,0.0003866607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8200622,"threshold_uncertainty_score":0.9999301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975876533","doi":"10.1109/taes.2012.6178065","title":"Distributed Attitude Coordination Control for Spacecraft Formation Flying","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":162,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Terminal sliding mode; Attitude control; Spacecraft; Lyapunov function; Controller (irrigation); Bounded function; Hyperbolic function; Manifold (fluid mechanics); Computer science; Sliding mode control; Engineering; Control (management); Control engineering; Mathematics; Nonlinear system; Physics; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01449487995831986,"gpt":0.2412103540354966,"spread":0.2267154740771767,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037117,0.0002893082,0.0003744745,0.0001494991,0.0005479892,0.0003155699,0.000298099,0.0001618809,0.000002183858],"category_scores_gemma":[0.00001473064,0.0002785605,0.0001385126,0.0003438652,0.00002772132,0.001145171,0.000002166174,0.0002242911,0.00003655695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004907597,"about_ca_system_score_gemma":0.00006974874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009431782,"about_ca_topic_score_gemma":0.00005898569,"domain_scores_codex":[0.9977695,0.0001560992,0.000409421,0.0003679252,0.0003327583,0.0009643352],"domain_scores_gemma":[0.9987301,0.0002384451,0.000230497,0.0004284027,0.0001612856,0.0002112225],"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.001769316,0.00497491,0.003321371,0.003299866,0.00445427,0.00001338691,0.01376577,0.1739166,0.281228,0.3672498,0.02289982,0.1231068],"study_design_scores_gemma":[0.0071484,0.0006105008,0.0003824025,0.0001809699,0.0001898953,0.0001355393,0.000597891,0.9628199,0.006767075,0.00008075249,0.02026586,0.0008208596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00803429,0.0009683868,0.9865947,0.001053119,0.001365748,0.001569395,0.0001167331,0.0002647128,0.00003285654],"genre_scores_gemma":[0.9983572,0.00004028961,0.0002351118,0.00007140147,0.0001462727,0.0007540432,0.00002367468,0.00002366311,0.0003482802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9903229,"threshold_uncertainty_score":0.9999667,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079012599","doi":"10.1109/acc.2012.6315661","title":"Robustness of information diffusion algorithms to locally bounded adversaries","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Bounded function; Computer science; Upper and lower bounds; Network topology; Topology (electrical circuits); Graph; Theoretical computer science; Graph theory; Scale-free network; Property (philosophy); Complex network; Algorithm; Distributed computing; Mathematics; Computer network; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01120254255454617,"gpt":0.2280251885207911,"spread":0.2168226459662449,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003471866,0.0001158578,0.000176109,0.0001268652,0.00006879619,0.0001282075,0.0005993537,0.00006069931,0.00001972467],"category_scores_gemma":[0.00007732268,0.00009682056,0.00004983281,0.0003764043,0.00002329871,0.002499099,0.0002547577,0.00004898765,0.0001147596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006410373,"about_ca_system_score_gemma":0.00004797275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001339661,"about_ca_topic_score_gemma":0.000008962844,"domain_scores_codex":[0.9987646,0.00004135455,0.0003662141,0.0001124264,0.0003972551,0.0003181769],"domain_scores_gemma":[0.9990277,0.00004714842,0.0001315942,0.0004308697,0.0001892376,0.0001734726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001279052,0.0009167488,0.01201375,0.0003062964,0.0001939227,0.000002966348,0.01253184,0.04162884,0.004461532,0.4417537,0.01943224,0.4666303],"study_design_scores_gemma":[0.001401567,0.0001085235,0.01624345,0.00005184209,0.00001264788,0.00001129837,0.0004708938,0.9500693,0.003596364,0.00009000811,0.02756819,0.0003758905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01133124,0.0000226427,0.9846895,0.0004138624,0.0009430575,0.0003053993,0.000007046084,0.0001450705,0.002142175],"genre_scores_gemma":[0.9367129,0.000001079214,0.06275903,0.0002237733,0.00006966328,0.00002082586,0.00001361643,0.000003707823,0.0001954715],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9253816,"threshold_uncertainty_score":0.3948228,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053362064","doi":"10.1109/tcst.2013.2264507","title":"Distributed Fault Detection and Isolation Filter Design for a Network of Heterogeneous Multiagent Systems","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Fault detection and isolation; Control theory (sociology); Linear matrix inequality; Lyapunov function; Residual; Transfer function; Filter (signal processing); Diagonal; Computer science; Isolation (microbiology); Constraint (computer-aided design); Fault (geology); Engineering; Mathematical optimization; Mathematics; Algorithm; Control (management); Actuator; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01468005528720408,"gpt":0.2174647791286227,"spread":0.2027847238414186,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005286745,0.0003906992,0.0007819155,0.0003641287,0.0003084766,0.0002223045,0.0005928397,0.0005338814,0.000002696232],"category_scores_gemma":[0.00004166276,0.0003688174,0.0001735359,0.0005310568,0.0001011133,0.0003836671,0.000006115917,0.0002488406,0.00002898847],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002176985,"about_ca_system_score_gemma":0.00004854193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003293777,"about_ca_topic_score_gemma":0.00003730191,"domain_scores_codex":[0.9969648,0.0003305138,0.001031563,0.0007283286,0.0002998016,0.0006450571],"domain_scores_gemma":[0.9972759,0.0005527441,0.0005670913,0.0008782174,0.0005881764,0.0001379021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001381467,0.0001921907,0.00004323321,0.000184689,0.0004895094,0.000005305281,0.00007290178,0.9299847,0.05177158,0.0007682434,0.0001671492,0.01618235],"study_design_scores_gemma":[0.003156597,0.0006988423,0.00003952023,0.0001263091,0.00008749902,0.0001253483,0.000053432,0.9885475,0.006107214,0.0001492044,0.0005918532,0.0003166663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007530937,0.0007092584,0.9827093,0.0003036662,0.002248997,0.005616816,0.0001966986,0.0006801201,0.000004184166],"genre_scores_gemma":[0.9929237,0.00001412228,0.002391976,0.00002427124,0.00008238179,0.004469857,0.000005899843,0.00003529917,0.00005254432],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9853927,"threshold_uncertainty_score":0.9998764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3165280930","doi":"10.1016/j.cja.2021.04.022","title":"A review on fault-tolerant cooperative control of multiple unmanned aerial vehicles","year":2021,"lang":"en","type":"review","venue":"Chinese Journal of Aeronautics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":157,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"State Key Laboratory of Synthetical Automation for Process Industries; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; Higher Education Discipline Innovation Project; Northeastern University; China Postdoctoral Science Foundation; Key Technologies Research and Development Program; National Natural Science Foundation of China","keywords":"Fault tolerance; Control (management); Collision avoidance; Computer science; Control engineering; State (computer science); Distributed computing; Engineering; Fault (geology); Collision; Artificial intelligence; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.03542768205325776,"gpt":0.3214920225570392,"spread":0.2860643405037815,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001576856,0.0008665132,0.006259015,0.000282642,0.0001035901,0.0001623305,0.002356688,0.0003353336,0.00001809882],"category_scores_gemma":[0.002141536,0.0005336146,0.001770967,0.0009796018,0.0001016202,0.0003346113,0.0002362396,0.001005267,0.00002985267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002680216,"about_ca_system_score_gemma":0.001324102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004586362,"about_ca_topic_score_gemma":0.000003941461,"domain_scores_codex":[0.9933431,0.001352963,0.00331771,0.0005039954,0.001026091,0.0004561129],"domain_scores_gemma":[0.991563,0.001453128,0.00411923,0.001100507,0.001462892,0.0003012629],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001365567,0.001489667,0.00002017879,0.05861947,0.004137174,0.0009838077,0.0003738617,0.001056656,0.00005945134,0.002240561,0.008016264,0.9228663],"study_design_scores_gemma":[0.004066959,0.0007227382,0.000009884744,0.1817006,0.001457216,0.0007233668,0.00001029737,0.005293305,0.000009531566,0.0000277736,0.8053037,0.0006746333],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.00002711629,0.9655021,0.03078841,0.0003112693,0.001950575,0.001113476,0.0002412997,0.00002756445,0.00003812166],"genre_scores_gemma":[0.00329021,0.9945775,0.0009502004,0.0003695913,0.0006446838,0.0000269143,0.00004877276,0.00005264604,0.00003943182],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.9221917,"threshold_uncertainty_score":0.9997115,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386902756","doi":"10.1109/tac.2023.3317505","title":"Event-Based Average Consensus of Disturbed MASs via Fully Distributed Sliding Mode Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Reachability; Double integrator; Consensus; Computer science; Lyapunov function; Sliding mode control; Convergence (economics); Multi-agent system; Integrator; Lyapunov stability; Event (particle physics); Topology (electrical circuits); Mathematics; Control (management); Nonlinear system; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01269888516936288,"gpt":0.2469724852578422,"spread":0.2342736000884793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008895393,0.000556161,0.00109001,0.0005339055,0.000349259,0.0001918916,0.001123217,0.0002246877,0.0000650704],"category_scores_gemma":[0.00009483723,0.0005416382,0.0006099531,0.00142011,0.000102071,0.0002429672,0.000004177109,0.0003097281,0.0003114228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002991504,"about_ca_system_score_gemma":0.000283169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001124286,"about_ca_topic_score_gemma":0.00003712427,"domain_scores_codex":[0.9952562,0.0006371252,0.00140427,0.0007831072,0.001008964,0.0009102776],"domain_scores_gemma":[0.9955567,0.001800614,0.0006011534,0.001409459,0.0003028829,0.0003291838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002158072,0.0005194427,0.00006914889,0.0002096268,0.0007186148,0.0001468708,0.0002132631,0.9141722,0.06676655,0.0006102588,0.0004877457,0.01587053],"study_design_scores_gemma":[0.01133441,0.0002156643,0.0005826871,0.0001640675,0.0001889192,0.00001486839,0.00003884864,0.9798017,0.006874064,0.00022197,0.00008908275,0.0004737584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01187542,0.00002648813,0.9793202,0.002012673,0.001441954,0.001750107,0.0017582,0.001769001,0.00004600855],"genre_scores_gemma":[0.9978728,0.000001598509,0.00115264,0.0002464612,0.00003949874,0.0004847929,0.00004218613,0.00004939193,0.0001106866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9859973,"threshold_uncertainty_score":0.9997035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2762304185","doi":"10.1109/tvt.2017.2760367","title":"Adaptive Leader–Follower Formation Control of Underactuated Surface Vessels Under Asymmetric Range and Bearing Constraints","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":153,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Backstepping; Control theory (sociology); Underactuation; Robustness (evolution); Parametric statistics; Lyapunov function; Adaptive control; Controller (irrigation); Bounded function; Tracking error; Robust control; Uniform boundedness; Computer science; Mathematics; Control system; Engineering; Nonlinear system; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.02368123692697624,"gpt":0.247227978627249,"spread":0.2235467417002727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273318,0.000241601,0.0004445031,0.000500869,0.0004730362,0.0001435379,0.0008247511,0.0003588631,0.000007639726],"category_scores_gemma":[0.00003670511,0.000241457,0.0001153941,0.0004395951,0.0004480463,0.0007779211,0.00001028707,0.0004012831,0.00004387464],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001072922,"about_ca_system_score_gemma":0.00005947027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006546151,"about_ca_topic_score_gemma":0.00003155301,"domain_scores_codex":[0.9983594,0.0000930907,0.0004237781,0.0004491665,0.0003038831,0.0003706116],"domain_scores_gemma":[0.9981236,0.0001610438,0.0004028463,0.001010027,0.0002220781,0.00008040441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005009134,0.002245451,0.001430672,0.0003172145,0.003349988,0.000318323,0.001419546,0.1701249,0.2418583,0.09113834,0.0001426692,0.4871536],"study_design_scores_gemma":[0.01452163,0.001057063,0.003740955,0.0003762592,0.0003368675,0.0003218664,0.001121104,0.7617038,0.2120659,0.003408461,0.0002374307,0.001108574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08777334,0.0001572963,0.908949,0.001771616,0.0003451306,0.0005429112,0.00004127103,0.0002685004,0.0001509484],"genre_scores_gemma":[0.9977736,0.00002699323,0.002041249,0.00006152295,0.0000069256,0.00003595074,0.00000191845,0.00001587462,0.00003591873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9100003,"threshold_uncertainty_score":0.9846331,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089274412","doi":"10.1002/rnc.5223","title":"Event‐triggered output synchronization for nonhomogeneous agent systems with periodic denial‐of‐service attacks","year":2020,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":150,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Denial-of-service attack; Control theory (sociology); Interrupt; Node (physics); Computer science; Controller (irrigation); Synchronization (alternating current); Event (particle physics); Control (management); Engineering; Computer network; Channel (broadcasting)","retraction":null,"screen_n_in":null,"score":{"opus":0.02118077728953745,"gpt":0.2430374271703406,"spread":0.2218566498808032,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003480556,0.0001822431,0.0004452821,0.000133705,0.00005970846,0.0002461518,0.0008697461,0.00007360017,0.000004531483],"category_scores_gemma":[0.0001565609,0.000144795,0.0001379853,0.0001661241,0.00002964765,0.0003736812,0.00006071099,0.000122823,0.000004428263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008346926,"about_ca_system_score_gemma":0.0002623095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002818132,"about_ca_topic_score_gemma":0.00001184671,"domain_scores_codex":[0.9980478,0.00008952655,0.0007734058,0.0002338795,0.0006682938,0.00018704],"domain_scores_gemma":[0.9965971,0.0001750823,0.0009235146,0.0001478052,0.001967527,0.0001890208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.005883427,0.0008747093,0.01421557,0.0007092754,0.005249138,0.0008453642,0.003680319,0.9057714,0.008307681,0.002480285,0.002989745,0.04899303],"study_design_scores_gemma":[0.007029114,0.0005192637,0.000334273,0.0001795395,0.0001019182,0.000251625,0.00009355018,0.9860659,0.0001493841,0.000008902505,0.005102998,0.0001635373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0263543,0.001124655,0.9650003,0.005846465,0.001006331,0.0004556419,0.0001730362,0.00002349827,0.00001581935],"genre_scores_gemma":[0.990978,0.00003365197,0.007414908,0.0005752278,0.0009233633,0.00001231191,0.00002151372,0.00001655203,0.00002444159],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9646237,"threshold_uncertainty_score":0.5904569,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2126877763","doi":"10.1109/tmech.2007.892820","title":"A Robust Hybrid Intelligent Position/Force Control Scheme for Cooperative Manipulators","year":2007,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":145,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Ottawa","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Computer science; Lyapunov stability; Fuzzy logic; Position (finance); Adaptive control; Control engineering; Lyapunov function; Parametric statistics; Robust control; Scheme (mathematics); A priori and a posteriori; Control system; Control (management); Engineering; Mathematics; Artificial intelligence; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.02812068825850511,"gpt":0.2540103922867407,"spread":0.2258897040282355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009847269,0.0004532904,0.000478115,0.000324373,0.0005540192,0.000263159,0.0009417714,0.0001766997,0.00003952907],"category_scores_gemma":[0.00002256019,0.0004591823,0.0004045255,0.0004812421,0.00005704521,0.0006352893,0.000007428439,0.0004487261,0.0001855242],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007172395,"about_ca_system_score_gemma":0.0002126704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003182856,"about_ca_topic_score_gemma":0.00007303821,"domain_scores_codex":[0.9967837,0.0001077221,0.0007793895,0.0008306924,0.00056125,0.0009372935],"domain_scores_gemma":[0.9977735,0.0003677226,0.0002271798,0.0008942658,0.0004109234,0.0003263859],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008764549,0.0017226,0.00002050834,0.0001404793,0.001266159,0.00008420843,0.0008107697,0.7282495,0.02305108,0.2080962,0.001362195,0.0343198],"study_design_scores_gemma":[0.004125015,0.0007907488,0.00001505845,0.00009100705,0.0001191529,0.00008239815,0.0002417607,0.9056557,0.0818015,0.000837241,0.005464471,0.0007759581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003274546,0.0001466293,0.9910929,0.00078387,0.001986353,0.001796663,0.0003064004,0.0004691797,0.0001434927],"genre_scores_gemma":[0.9698805,0.00001868743,0.02842422,0.0005542805,0.0001346314,0.0002762668,0.00003657318,0.00005220295,0.000622649],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.966606,"threshold_uncertainty_score":0.999786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1977335817","doi":"10.1109/ssp.2007.4301337","title":"Distributed Average Consensus using Probabilistic Quantization","year":2007,"lang":"en","type":"article","venue":"2007 IEEE/SP 14th Workshop on Statistical Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":143,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Quantization (signal processing); Probabilistic logic; Computer science; Computation; Distributed algorithm; Wireless sensor network; Consensus; Algorithm; Consensus algorithm; Theoretical computer science; Distributed computing; Artificial intelligence; Multi-agent system","retraction":null,"screen_n_in":null,"score":{"opus":0.04012101147101355,"gpt":0.3098272831243882,"spread":0.2697062716533747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001656991,0.0005800018,0.0006421842,0.0002542372,0.0006385376,0.0008224626,0.0008382386,0.0003061293,0.00008266234],"category_scores_gemma":[0.000806565,0.0005539792,0.0001097895,0.001401606,0.0002754499,0.0004124622,0.0001172336,0.0006251187,0.0001459407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005475502,"about_ca_system_score_gemma":0.000341882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003623876,"about_ca_topic_score_gemma":0.00001171345,"domain_scores_codex":[0.9945839,0.0002801954,0.001263933,0.001188431,0.001293711,0.001389824],"domain_scores_gemma":[0.9958745,0.001849464,0.0005265884,0.000582512,0.0005665663,0.0006003327],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001338011,0.002820406,0.001442738,0.001083139,0.0002958498,0.003153496,0.0008937838,0.287228,0.0117555,0.1689837,0.009500716,0.5115046],"study_design_scores_gemma":[0.001332016,0.0001230152,0.001008782,0.0005588263,0.00005711539,0.00008322443,0.0000790307,0.9918229,0.0005336429,0.002571114,0.00105435,0.0007759774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005672008,0.0001859721,0.9909179,0.0001854242,0.0007944542,0.0007213262,0.0002047849,0.0005161017,0.0008020794],"genre_scores_gemma":[0.9475016,0.000002267958,0.0515213,0.0002839464,0.0003960804,0.00001685501,0.0001371842,0.00005438856,0.00008635765],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9418296,"threshold_uncertainty_score":0.9996912,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166306230","doi":"10.1109/acc.2008.4586750","title":"Formation UAV flight control using virtual structure and motion synchronization","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":142,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Synchronization (alternating current); Controller (irrigation); Control theory (sociology); Computer science; Position (finance); Tracking (education); Nonlinear system; Motion control; Trajectory; Control engineering; Simulation; Control (management); Engineering; Artificial intelligence; Robot; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01254910050063562,"gpt":0.2060229525630338,"spread":0.1934738520623982,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001068482,0.000130568,0.0001580533,0.00009327986,0.0002768853,0.00009780261,0.0002088576,0.00008483334,0.00001552312],"category_scores_gemma":[0.00003437641,0.0001145642,0.00002812541,0.0002189327,0.0000336511,0.001580286,0.00004662555,0.00006445545,0.00001271024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001067579,"about_ca_system_score_gemma":0.00003869014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000390526,"about_ca_topic_score_gemma":0.00000727167,"domain_scores_codex":[0.9989429,0.00008297319,0.0002641836,0.0002448038,0.0002715391,0.0001936072],"domain_scores_gemma":[0.9993727,0.00003143151,0.0001347827,0.0002521176,0.0001351317,0.00007389765],"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.0001575806,0.0004775818,0.06351276,0.0003277615,0.0004775525,0.0002900224,0.01271552,0.1755074,0.2931395,0.3150884,0.005494964,0.132811],"study_design_scores_gemma":[0.001192399,0.00003540899,0.005638563,0.00001037382,0.000008892834,0.0002445882,0.00001777462,0.99041,0.002053223,0.0001137373,0.0001360089,0.0001390147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1797021,0.0000468039,0.8193672,0.0001318504,0.0002512657,0.0002513008,0.00001169408,0.0001435086,0.0000942414],"genre_scores_gemma":[0.9959318,0.000003704625,0.003756109,0.0001197672,0.00008471242,0.000003825109,0.00002479584,0.000006518196,0.00006873548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8162297,"threshold_uncertainty_score":0.4671793,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092590055","doi":"10.1109/tnnls.2012.2196710","title":"Neural Network-Based Distributed Attitude Coordination Control for Spacecraft Formation Flying With Input Saturation","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":133,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quaternion; Control theory (sociology); Spacecraft; Attitude control; Artificial neural network; Observer (physics); Controller (irrigation); Computer science; Lyapunov function; Control (management); Control engineering; Engineering; Mathematics; Artificial intelligence; Nonlinear system; Aerospace engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01441964624362754,"gpt":0.2275898633376544,"spread":0.2131702170940268,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008850921,0.0003536612,0.0004202336,0.0001302834,0.001138568,0.0005879427,0.0002381935,0.0001826891,0.000001431732],"category_scores_gemma":[0.00001800965,0.0003001976,0.0001232537,0.0004654184,0.00004084179,0.001461341,0.000002610651,0.0005421854,0.000002980352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001400868,"about_ca_system_score_gemma":0.00002187433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005977629,"about_ca_topic_score_gemma":0.00002962571,"domain_scores_codex":[0.9973649,0.0005897359,0.0005226481,0.0004188419,0.0003620967,0.0007417629],"domain_scores_gemma":[0.998196,0.0006232864,0.0004286254,0.0003077128,0.0002203968,0.0002239521],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001594517,0.00005624357,0.000916912,0.00006526566,0.00005734405,0.000001598164,0.0001303067,0.9893509,0.0001476997,0.000229289,0.0001543604,0.0087306],"study_design_scores_gemma":[0.00261978,0.0003879985,0.001166748,0.0001375307,0.00007868441,0.00004610779,0.0000798699,0.9941556,0.00002784311,0.000001209969,0.0009594654,0.0003391576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01685883,0.0003703294,0.9782619,0.0005714683,0.001974499,0.001525617,0.00002660936,0.0004037431,0.000007027154],"genre_scores_gemma":[0.9981669,0.000004289274,0.0005659485,0.0001285536,0.0004925748,0.0004404086,0.00009505469,0.00003344821,0.00007280916],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9813081,"threshold_uncertainty_score":0.999945,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2598136971","doi":"10.1109/tcst.2017.2679066","title":"Fault-Tolerant Cooperative Control Design of Multiple Wheeled Mobile Robots","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Robot; Mobile robot; Fault tolerance; Control theory (sociology); Actuator; Engineering; Extended Kalman filter; Control engineering; Fault detection and isolation; Feedback linearization; Fault (geology); Kalman filter; Collision avoidance; Computer science; Collision; Control (management); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01873898380513541,"gpt":0.2490524632874625,"spread":0.2303134794823271,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008913814,0.0005768004,0.001502333,0.0006574799,0.0009580004,0.0003878735,0.003134401,0.0006548565,0.00001035369],"category_scores_gemma":[0.0001430101,0.0005262124,0.0002927567,0.0003388698,0.0004170561,0.0007220572,0.00001183212,0.0006070266,0.0001562335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002205375,"about_ca_system_score_gemma":0.00022037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004095324,"about_ca_topic_score_gemma":0.0001170645,"domain_scores_codex":[0.9957703,0.0005507988,0.001234886,0.001032507,0.0005698879,0.0008415676],"domain_scores_gemma":[0.9941028,0.0007357033,0.00107757,0.003123688,0.0007692455,0.0001910395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003870462,0.0007205791,0.0001786221,0.00007258938,0.0009401279,0.00008844649,0.0001985007,0.8904312,0.08818994,0.003059599,0.0001656305,0.01556767],"study_design_scores_gemma":[0.01434148,0.0009787551,0.00008061564,0.0002050239,0.0001207801,0.00008921546,0.0001442586,0.9667195,0.01611857,0.00005441538,0.000611827,0.0005355666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003172148,0.0004583408,0.9873064,0.0007841878,0.002695241,0.004350216,0.0002765027,0.0008571952,0.00009977461],"genre_scores_gemma":[0.9954101,0.00001805176,0.001351412,0.00006096283,0.00006369099,0.002727403,0.00000169592,0.0000472194,0.0003194584],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.992238,"threshold_uncertainty_score":0.999719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1902963647","doi":"10.1002/rnc.3467","title":"Fault‐tolerant formation control of multiple UAVs in the presence of actuator faults","year":2015,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":130,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Actuator; Control theory (sociology); Convergence (economics); Fault (geology); Fault tolerance; Computer science; Process (computing); Control (management); Flight control surfaces; Control engineering; Generator (circuit theory); Engineering; Aerodynamics; Distributed computing; Artificial intelligence; Aerospace engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02710959129970058,"gpt":0.2610352928422551,"spread":0.2339257015425545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149141,0.0001256122,0.0003682766,0.0002133574,0.00001942482,0.00006502901,0.001171001,0.00006093577,0.000001834799],"category_scores_gemma":[0.0008163159,0.000084094,0.0001227985,0.0001377579,0.00005678797,0.0008244722,0.00004818453,0.0001787344,0.000001824448],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004843745,"about_ca_system_score_gemma":0.0001350611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006357535,"about_ca_topic_score_gemma":0.00003503828,"domain_scores_codex":[0.9976624,0.0002338749,0.0009275188,0.0001207954,0.0009030242,0.0001523475],"domain_scores_gemma":[0.9968516,0.0006274519,0.0009611408,0.0001939168,0.001280111,0.00008577165],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.01450798,0.005501194,0.21334,0.0003502622,0.003328275,0.001076144,0.03464461,0.5005342,0.05999284,0.01621884,0.003989718,0.1465159],"study_design_scores_gemma":[0.01273852,0.0002456621,0.005096205,0.0001475657,0.0000265567,0.0001725234,0.0004800225,0.9791465,0.0006231719,0.0001189257,0.00111001,0.00009436741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3377146,0.0004409161,0.6581589,0.002455362,0.0007221852,0.0003357018,0.000104092,0.000007515935,0.00006068335],"genre_scores_gemma":[0.9962413,0.00001778453,0.00338658,0.0001303474,0.0002019576,0.000005668795,0.000004287623,0.000004639692,0.000007376446],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6585267,"threshold_uncertainty_score":0.3429254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096224892","doi":"10.1109/tcst.2009.2032921","title":"Team Consensus for a Network of Unmanned Vehicles in Presence of Actuator Faults","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Actuator; Control theory (sociology); Fault (geology); Trajectory; Controller (irrigation); Fault tolerance; Engineering; Float (project management); Stability (learning theory); Computer science; Control engineering; Control (management); Distributed computing; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01074671491230553,"gpt":0.2412901855819019,"spread":0.2305434706695964,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006391882,0.000277679,0.0009464,0.0005110365,0.00008762026,0.00002240818,0.001078351,0.0004184333,7.663958e-7],"category_scores_gemma":[0.00009435235,0.000270198,0.0001932555,0.0009058992,0.0001480568,0.0001295261,0.00000319523,0.0002683501,0.000005459862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001177871,"about_ca_system_score_gemma":0.0001425667,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000144137,"about_ca_topic_score_gemma":0.0001386769,"domain_scores_codex":[0.997241,0.0001811206,0.001139506,0.0005541921,0.0003048727,0.0005793055],"domain_scores_gemma":[0.9972352,0.0007678966,0.0005695057,0.0009977508,0.0003535207,0.00007617162],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002270981,0.00294412,0.001200747,0.0006411856,0.0009565589,0.00006163028,0.0007314184,0.520038,0.2461463,0.1100063,0.001563857,0.1134388],"study_design_scores_gemma":[0.01714281,0.002970479,0.0008472482,0.0008954405,0.0001186311,0.00009813218,0.0003857634,0.9349612,0.03698019,0.003858229,0.001021165,0.0007207011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06151016,0.000364588,0.9329901,0.001299354,0.0009203806,0.002383491,0.0001341365,0.0003319456,0.0000657967],"genre_scores_gemma":[0.9976165,0.000007442088,0.001840637,0.00003838728,0.00003430357,0.0003887399,0.000001067724,0.00001441658,0.00005851698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9361063,"threshold_uncertainty_score":0.999975,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2034754696","doi":"10.1371/journal.pcbi.1002894","title":"Starling Flock Networks Manage Uncertainty in Consensus at Low Cost","year":2013,"lang":"en","type":"article","venue":"PLoS Computational Biology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":127,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Army Research Office; Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; Office of Naval Research; Princeton University; Air Force Office of Scientific Research; City University of New York; National Science Foundation","keywords":"Flocking (texture); Flock; Robustness (evolution); Parameterized complexity; Starling; Computer science; Group cohesiveness; Econometrics; Mathematics; Biology; Algorithm; Ecology; Psychology; Social psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01819828734327489,"gpt":0.2364378643344134,"spread":0.2182395769911385,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002180965,0.0002029123,0.0003191188,0.000156255,0.0001138091,0.00009385576,0.0006375032,0.0001384671,0.00006016529],"category_scores_gemma":[0.00008931195,0.0001933418,0.00006400207,0.0003432811,0.00009682848,0.0001169793,0.0003172503,0.0001822642,0.000496693],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000251371,"about_ca_system_score_gemma":0.00005599905,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002567343,"about_ca_topic_score_gemma":0.00007204289,"domain_scores_codex":[0.9979862,0.0002890576,0.0004932717,0.0005470122,0.000180562,0.0005038806],"domain_scores_gemma":[0.9982964,0.0008921031,0.0001732902,0.0003086645,0.0002070898,0.0001224844],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001461071,0.0001037374,0.009871026,0.00001410959,0.00006331968,0.00002764961,0.0001055043,0.9658787,0.000352983,0.01751543,0.001153138,0.004899806],"study_design_scores_gemma":[0.0009341569,0.00003376275,0.01389602,0.0000275355,0.00000351534,0.00001444637,0.00001692503,0.9802793,0.0000134425,0.004098999,0.0004757381,0.0002061523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3934476,0.0001764862,0.6020178,0.001887104,0.0006480204,0.00109114,0.00004262419,0.0002305621,0.0004586111],"genre_scores_gemma":[0.993264,0.000002932246,0.005532617,0.0006570228,0.00009169092,0.0001317769,0.0002318419,0.00001034486,0.00007772641],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5998164,"threshold_uncertainty_score":0.788425,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026694617","doi":"10.1109/tac.2013.2270053","title":"Synchronization of Lagrangian Systems With Irregular Communication Delays","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Synchronization (alternating current); Convergence (economics); Position (finance); Computer science; Graph; Control theory (sociology); Scheme (mathematics); Directed graph; Spanning tree; Telecommunications network; Information flow; Mathematics; Topology (electrical circuits); Theoretical computer science; Control (management); Algorithm; Artificial intelligence; Computer network; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007080359854198285,"gpt":0.2009796336716085,"spread":0.1938992738174102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140053,0.0002318308,0.0004232539,0.0002229719,0.0001820195,0.0002232965,0.0008174303,0.0001050344,0.00005584921],"category_scores_gemma":[0.000009251495,0.000194537,0.0001067079,0.0005277457,0.00007415663,0.0007118794,0.000002209651,0.0001208682,0.000185606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001358294,"about_ca_system_score_gemma":0.0000918544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004919435,"about_ca_topic_score_gemma":0.00004200984,"domain_scores_codex":[0.9979761,0.000324722,0.0006139022,0.0003016616,0.0004905248,0.0002931132],"domain_scores_gemma":[0.9975622,0.0003017792,0.0003612491,0.001289164,0.0003651717,0.000120407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006676304,0.001692448,0.0002448694,0.0007359965,0.00156197,0.00001336687,0.002391742,0.7026432,0.01084921,0.01097733,0.000875582,0.2679476],"study_design_scores_gemma":[0.002338671,0.0001629446,0.0006160465,0.0002353816,0.00008219248,0.00002404527,0.0001030279,0.9955426,0.0005856097,0.00005157258,0.00005583144,0.0002020862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007492337,0.0001470373,0.9891241,0.0005963176,0.0002892582,0.001637891,0.00002748123,0.0004368233,0.0002487429],"genre_scores_gemma":[0.9955782,0.000005666557,0.003651032,0.00006608503,0.00001194472,0.0005306285,0.000005851753,0.00002181335,0.0001287503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9880859,"threshold_uncertainty_score":0.7932987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2789411207","doi":"10.1109/tcyb.2018.2804759","title":"New Results on Sliding-Mode Control for Takagi–Sugeno Fuzzy Multiagent Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":116,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Control theory (sociology); Weighting; Fuzzy logic; Mathematical optimization; Mathematics; Controller (irrigation); Constraint (computer-aided design); Fuzzy control system; Computer science; Control (management); Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02593210850899168,"gpt":0.2714775517240211,"spread":0.2455454432150294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000497391,0.0004703544,0.0005115702,0.0002615881,0.000416404,0.00042018,0.001211634,0.0002618662,0.00001038311],"category_scores_gemma":[0.00005258931,0.0004548824,0.0002966501,0.0004194865,0.00006157358,0.000238752,0.000004542823,0.0003015451,0.0006431472],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000312919,"about_ca_system_score_gemma":0.0001982243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005442267,"about_ca_topic_score_gemma":0.0001940057,"domain_scores_codex":[0.996445,0.0001866139,0.0008656959,0.0009883543,0.0007202648,0.0007940771],"domain_scores_gemma":[0.996729,0.0006296372,0.0003216747,0.001462169,0.0004019949,0.0004555772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.004298628,0.003214872,0.00002459701,0.0002960798,0.002071487,0.0001022526,0.006930511,0.573075,0.03153853,0.08003435,0.1059893,0.1924244],"study_design_scores_gemma":[0.01365531,0.002471038,0.00009055961,0.0002708625,0.0001830939,0.00003234923,0.0000858156,0.8903534,0.02540541,0.0003362288,0.06614165,0.0009742719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009034653,0.00007161464,0.9863994,0.0009384893,0.006854381,0.001880153,0.0007369429,0.0004923462,0.001723269],"genre_scores_gemma":[0.9859596,0.00001547754,0.008274996,0.0003521968,0.000683481,0.0002346118,0.00001231493,0.00005895807,0.004408387],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9850561,"threshold_uncertainty_score":0.9997903,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116066327","doi":"10.1109/tsp.2010.2043127","title":"Optimization and Analysis of Distributed Averaging With Short Node Memory","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Rate of convergence; Node (physics); Algorithm; Acceleration; Mathematics; Network topology; Computer science; Grid; Mathematical optimization; Focus (optics); Series (stratigraphy); Topology (electrical circuits); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01108059728990224,"gpt":0.2313950402271037,"spread":0.2203144429372014,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002327185,0.0001713278,0.0003019145,0.0003841845,0.000237022,0.0002001959,0.0002886625,0.00007600226,0.00001823735],"category_scores_gemma":[0.000002855571,0.0001506371,0.00007750744,0.00147477,0.00007899703,0.0006540702,0.000002450867,0.0002490568,9.243205e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002982957,"about_ca_system_score_gemma":0.00008195131,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002374887,"about_ca_topic_score_gemma":0.00002954104,"domain_scores_codex":[0.9986779,0.00004307373,0.0003127799,0.0003966408,0.0003563437,0.0002132237],"domain_scores_gemma":[0.9991791,0.00007612291,0.0001316103,0.0002914163,0.0002181691,0.0001035484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002505509,0.0000994328,0.000265969,0.00003199191,0.0002525564,0.000004948415,0.0002658039,0.9432899,0.0138223,0.00001608379,0.000001483791,0.04192445],"study_design_scores_gemma":[0.000348949,0.00003646217,0.0004221308,0.00004584134,0.0003627882,0.00001095228,0.00004888371,0.9769571,0.02158549,0.000005079319,0.000006758477,0.0001695546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02286593,0.00002071912,0.9765344,0.00008706362,0.00008243402,0.0001446145,0.00004988759,0.0001307512,0.00008423784],"genre_scores_gemma":[0.9759953,0.000001690847,0.02389594,0.00003280908,0.00001232567,0.0000204284,0.00001610538,0.00001111958,0.00001428144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9531294,"threshold_uncertainty_score":0.6142805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2163525955","doi":"10.1109/acc.2012.6315289","title":"Distributed dual averaging for convex optimization under communication delays","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":110,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Logarithm; Bounded function; Computer science; Dual (grammatical number); Convex optimization; Distributed algorithm; Regular polygon; Mathematical optimization; Upper and lower bounds; Mathematics; Algorithm; Applied mathematics; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02651990947179115,"gpt":0.2595118323728425,"spread":0.2329919229010514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005583705,0.0001420124,0.0001715303,0.00005880076,0.0002198862,0.0002070918,0.0005835345,0.00007790888,0.00002722488],"category_scores_gemma":[0.00006933275,0.0001352469,0.00006937152,0.0002441616,0.00002578707,0.001150404,0.0001747944,0.00007466022,0.0000471467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001284987,"about_ca_system_score_gemma":0.00003464828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003640566,"about_ca_topic_score_gemma":0.000003580929,"domain_scores_codex":[0.9987429,0.0001147584,0.0003152435,0.0002156105,0.0002020657,0.0004094123],"domain_scores_gemma":[0.9985441,0.000235924,0.0001496283,0.0007365634,0.0001956388,0.0001381584],"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.00002233017,0.0003451668,0.003018142,0.00003745332,0.0001504773,7.03052e-7,0.0007908202,0.2165093,0.0007428596,0.7625572,0.01219593,0.003629642],"study_design_scores_gemma":[0.0009826644,0.00001674999,0.001191878,0.00001237596,0.00001545838,0.00000932076,0.000109878,0.9918321,0.0004233226,0.000384903,0.004817417,0.0002038939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006736949,0.0001742822,0.9954727,0.001493038,0.0003887081,0.0005062478,0.00004277969,0.0003298373,0.0009187619],"genre_scores_gemma":[0.9149075,0.000005719052,0.08399112,0.0003276433,0.00006802625,0.00009968155,0.0004344418,0.00001144298,0.0001544695],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9142337,"threshold_uncertainty_score":0.5515206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2751593041","doi":"10.1109/tcyb.2017.2731601","title":"Scaled Group Consensus in Multiagent Systems With First/Second-Order Continuous Dynamics","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Subnetwork; Multi-agent system; Group (periodic table); Lyapunov function; Stability theory; Consensus; Lyapunov stability; Uniform consensus; Graph theory; Computer science; Order (exchange); Directed graph; Graph; Stability (learning theory); Mathematical optimization; Mathematics; Theoretical computer science; Artificial intelligence; Algorithm; Nonlinear system; Control (management); Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01290294976963088,"gpt":0.2264547223004822,"spread":0.2135517725308513,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003424482,0.0004057109,0.0005409798,0.0002107121,0.0005278988,0.0007738769,0.001436434,0.0002158474,0.00001993492],"category_scores_gemma":[0.0000278411,0.0003777023,0.0001156514,0.0002436607,0.0002105631,0.0002634847,0.00001099666,0.0004348402,0.000117826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003486701,"about_ca_system_score_gemma":0.0001083981,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001432879,"about_ca_topic_score_gemma":0.0217985,"domain_scores_codex":[0.9973263,0.0001417826,0.0006258256,0.0007440629,0.000531208,0.0006308333],"domain_scores_gemma":[0.996914,0.0003189824,0.0003907616,0.001921163,0.0002242531,0.0002308683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001249672,0.008471788,0.01553378,0.001186945,0.001996016,0.003550515,0.005198744,0.8357164,0.001751882,0.03336203,0.002783711,0.08919854],"study_design_scores_gemma":[0.005827574,0.000373292,0.007058631,0.0003713642,0.00005833989,0.0001384786,0.0001873422,0.982915,0.000408256,0.00003835532,0.001917247,0.0007061188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05737487,0.0000826238,0.9366642,0.0006307994,0.002217241,0.001104324,0.000163701,0.000230824,0.001531376],"genre_scores_gemma":[0.9936184,0.00002282156,0.004313947,0.00005718076,0.00004353414,0.0001842912,0.000006295485,0.00004263113,0.001710929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9362435,"threshold_uncertainty_score":0.9998675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1933691875","doi":"10.1002/rob.21597","title":"Multirobot Cooperative Learning for Semiautonomous Control in Urban Search and Rescue Applications","year":2015,"lang":"en","type":"article","venue":"Journal of Field Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Task (project management); Reinforcement learning; Computer science; Urban search and rescue; Robot; Artificial intelligence; Search and rescue; Human–computer interaction; Control (management); Mobile robot; Engineering; Systems engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03176414544123482,"gpt":0.2898487418791277,"spread":0.2580845964378928,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008383115,0.00009656016,0.0002750849,0.0001216318,0.00006649092,0.0001290766,0.0003810628,0.00008939178,5.247917e-7],"category_scores_gemma":[0.0003618083,0.00008391769,0.00005288194,0.0001575354,0.00002118588,0.0002598741,0.00005391352,0.0003607001,0.00000217979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008700381,"about_ca_system_score_gemma":0.0001993989,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002738647,"about_ca_topic_score_gemma":0.00002567571,"domain_scores_codex":[0.9989257,0.0001287007,0.0003946377,0.0001449205,0.0002002977,0.000205731],"domain_scores_gemma":[0.9986429,0.0004243146,0.0001262002,0.0001641562,0.0004756543,0.0001668146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000655324,0.00009985708,0.005915635,0.00002492359,0.00005527555,0.00002645686,0.001456437,0.9759135,0.0007231222,0.00699561,0.001452547,0.007271092],"study_design_scores_gemma":[0.003512352,0.0004894771,0.0004916867,0.0000459665,0.00001606168,0.00006035698,0.0003073752,0.9913961,0.0002365033,0.0001003153,0.003222034,0.0001218105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001850153,0.0004292071,0.9927675,0.004282858,0.000173689,0.0004047784,0.000001937842,0.00001395312,0.00007590518],"genre_scores_gemma":[0.964953,0.00001470882,0.03440055,0.0002217432,0.0001763959,0.00001792687,0.000001019023,0.000006752166,0.0002078684],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9631029,"threshold_uncertainty_score":0.3422064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2151901719","doi":"10.1145/2185505.2185507","title":"Consensus of multi-agent networks in the presence of adversaries using only local information","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Robustness (evolution); Resilience (materials science); Computer security; Protocol (science); Graph; Computer network; Distributed computing; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03050554325969779,"gpt":0.2601470680246756,"spread":0.2296415247649778,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008349343,0.00009840111,0.000180085,0.00007956314,0.00003586126,0.00003719526,0.0006164733,0.00005999019,0.000003551014],"category_scores_gemma":[0.0001122856,0.00006890392,0.0000504634,0.0003606073,0.0001186762,0.0007588194,0.0001373487,0.00008935008,0.000005504739],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004177635,"about_ca_system_score_gemma":0.00007560645,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009464815,"about_ca_topic_score_gemma":0.00007214541,"domain_scores_codex":[0.9986297,0.0001826248,0.000511185,0.00008698131,0.0003156845,0.0002737684],"domain_scores_gemma":[0.9988654,0.0002718249,0.0002749384,0.0004233372,0.0001193514,0.00004515954],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009151149,0.0008212807,0.1546201,0.0002415912,0.0001320521,0.000007170987,0.02657183,0.6231862,0.000913795,0.1365019,0.001634844,0.05527773],"study_design_scores_gemma":[0.0005757934,0.00001877285,0.02409084,0.00003447859,0.000006666389,0.00001335324,0.001457456,0.9729716,0.0003444719,0.00001041851,0.0003978187,0.00007838385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05403655,0.0001658472,0.9446546,0.00008964665,0.0003176079,0.0003290386,0.000006154532,0.00002216419,0.0003783211],"genre_scores_gemma":[0.9919704,0.000002194551,0.007914363,0.00007702812,0.00001723975,0.000004803561,0.00000337276,0.00000205006,0.000008555633],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9379339,"threshold_uncertainty_score":0.280982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}