{"meta":{"query_hash":"a363c91d08b1","filters":{"topic":"Distributed Control Multi-Agent Systems"},"cohort_total":1051,"direct_labels_cover":0,"predictions_cover":1051,"exported":1051,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/a363c91d08b1","api":"https://metacan.xera.ac/api/v1/cohort?topic=Distributed+Control+Multi-Agent+Systems"},"results":[{"id":"W1173300","doi":"10.1007/978-1-4419-1549-8_7","title":"LQ Decentralized Controllers with Disturbance Rejection Property for Hierarchical Systems","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Disturbance (geology); Property (philosophy); Control theory (sociology); Computer science; Decentralised system; Control engineering; Engineering; Control (management); Biology; Artificial intelligence; Philosophy","score_opus":0.02860097117786742,"score_gpt":0.2150612487514245,"score_spread":0.18646027757355707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1173300","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000018949644,0.00071494235,0.74884224,0.00033024474,0.0015701306,0.00405333,0.00011003888,0.00056153187,0.24381568],"genre_scores_gemma":[0.036967807,0.00009498886,0.005713274,0.00021260984,0.00042524093,0.0010414295,0.0001484267,0.00014480157,0.9552514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963132,0.000087485794,0.00085552654,0.0013133484,0.00069772464,0.0007327255],"domain_scores_gemma":[0.9969747,0.00019278069,0.0006431226,0.0013705253,0.0004869374,0.00033194208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004538731,0.0007393013,0.0011950781,0.00017610728,0.00021995114,0.00044587447,0.0013988069,0.00047816682,0.00004125588],"category_scores_gemma":[0.00004933479,0.00042983866,0.00034819893,0.00007741096,0.00014515706,0.00039897332,0.00012997595,0.00040248007,0.00011738745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079322414,0.00007991771,0.000022555592,0.00026418862,0.0007014523,0.000057125297,0.00010895129,0.000090747,0.00003895906,0.9765979,0.014540589,0.0067043924],"study_design_scores_gemma":[0.0073720575,0.00071151357,0.000032518437,0.0007316121,0.00019151949,0.00013678768,0.000009115015,0.046163406,0.000026167692,0.0036207472,0.9397121,0.0012924735],"about_ca_topic_score_codex":0.0002541591,"about_ca_topic_score_gemma":0.00007205196,"teacher_disagreement_score":0.97297716,"about_ca_system_score_codex":0.0003292983,"about_ca_system_score_gemma":0.00029203942,"threshold_uncertainty_score":0.99981534},"labels":[],"label_agreement":null},{"id":"W1479896329","doi":"","title":"Simple iteration-optimal distributed optimization","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Separable space; Mathematical optimization; Matching (statistics); Computer science; Simple (philosophy); Computation; Distributed algorithm; Convex function; Function (biology); Node (physics); Algorithm; Mathematics; Topology (electrical circuits); Regular polygon; Distributed computing; Combinatorics","score_opus":0.008917104757058777,"score_gpt":0.21696386556148034,"score_spread":0.20804676080442155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1479896329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022367355,0.000015739557,0.9935582,0.0010719291,0.00023132098,0.00043805494,0.000021747877,0.00048433463,0.0019418914],"genre_scores_gemma":[0.9365002,0.0000011976194,0.062183633,0.00030122476,0.00006947565,0.00011389216,0.00029440675,0.000008784013,0.00052722055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986828,0.00006516784,0.00032428055,0.0003494534,0.00026373728,0.00031453892],"domain_scores_gemma":[0.99889153,0.00006242772,0.00009722062,0.00055658916,0.00025511198,0.00013714055],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001206864,0.00014879447,0.00015146559,0.00006505142,0.0001275142,0.0007850247,0.0006389464,0.00006516551,0.0005578471],"category_scores_gemma":[0.00006553903,0.00013024508,0.00005921062,0.00037845678,0.000017018197,0.0015373356,0.00012959374,0.00006492387,0.00083604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004160833,0.00020408933,0.0026496514,0.000016305756,0.000072895244,0.00000938913,0.00023347842,0.8307135,0.0019747363,0.071331315,0.08423854,0.008551958],"study_design_scores_gemma":[0.00041661828,0.000025836713,0.0018334647,0.0000035012092,0.0000030612348,0.0000048128295,0.000020106978,0.9936761,0.0003563805,0.00019886126,0.00329318,0.00016807427],"about_ca_topic_score_codex":0.00015647536,"about_ca_topic_score_gemma":0.00000389906,"teacher_disagreement_score":0.9342634,"about_ca_system_score_codex":0.00006221179,"about_ca_system_score_gemma":0.00003644399,"threshold_uncertainty_score":0.99994195},"labels":[],"label_agreement":null},{"id":"W1484217450","doi":"","title":"Formation control of car-like autonomous vehicles under communication delay","year":2012,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Robot; Controller (irrigation); Control theory (sociology); Collision; Mobile robot; Channel (broadcasting); Computer science; Transmission (telecommunications); Collision avoidance; Constant (computer programming); Control (management); Control engineering; Engineering; Computer network; Artificial intelligence; Telecommunications","score_opus":0.01990053870602351,"score_gpt":0.2507146027637263,"score_spread":0.2308140640577028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484217450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11072877,0.0017154547,0.8836437,0.0011028053,0.0005014479,0.0007387368,0.00006649642,0.00023981204,0.0012627725],"genre_scores_gemma":[0.998268,0.000021308017,0.0008797809,0.00047886136,0.00008626052,0.00013477929,0.000040721534,0.000017905872,0.00007238235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733263,0.00048376896,0.0008231598,0.00031678446,0.00045853006,0.00058511976],"domain_scores_gemma":[0.9965991,0.00050255295,0.0006334357,0.0014408064,0.0005804549,0.00024366395],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009727292,0.00034471927,0.0006335878,0.00015817158,0.00018734284,0.00019272037,0.0016523268,0.00016456435,0.00002847526],"category_scores_gemma":[0.00014650534,0.00028960538,0.00017649018,0.0003423064,0.0001194418,0.0020875263,0.00016316418,0.00024540408,0.00011428407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045932355,0.0015892382,0.124518014,0.00038447982,0.0010483507,0.000012905839,0.009622804,0.009311055,0.13444816,0.6666003,0.0017191035,0.050286263],"study_design_scores_gemma":[0.008295689,0.00010957625,0.07772081,0.00010102895,0.000087382774,0.0000503205,0.0001714524,0.9079383,0.0006339556,0.0026343295,0.0016292945,0.00062788],"about_ca_topic_score_codex":0.00013137392,"about_ca_topic_score_gemma":0.00003237543,"teacher_disagreement_score":0.8986272,"about_ca_system_score_codex":0.00013710956,"about_ca_system_score_gemma":0.00015203186,"threshold_uncertainty_score":0.9999556},"labels":[],"label_agreement":null},{"id":"W1512335038","doi":"10.23919/ecc.2009.7074866","title":"Coordinated 3D path following control for a team of UAVs with reference velocity recovery","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Path (computing); Kinematics; Controller (irrigation); Computer science; Control theory (sociology); Position (finance); Trajectory; Track (disk drive); Work (physics); Control (management); Scheme (mathematics); Control engineering; Simulation; Engineering; Artificial intelligence; Mathematics","score_opus":0.013402435064030637,"score_gpt":0.23318144895842027,"score_spread":0.21977901389438964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512335038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01753954,0.00005627644,0.97446847,0.00040388232,0.00015748444,0.00087434595,0.000058660884,0.00024169132,0.0061996547],"genre_scores_gemma":[0.9691523,0.0000011682622,0.030061174,0.0003263104,0.000019690935,0.00005236377,0.000013146326,0.000008132806,0.00036574487],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829006,0.00008200496,0.00042637426,0.00046987133,0.0003187681,0.0004129035],"domain_scores_gemma":[0.9985381,0.00022900746,0.00024692138,0.00061905704,0.00025605113,0.000110896704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053225725,0.00021057569,0.00048184427,0.00008527263,0.00009332824,0.00010889457,0.0007848434,0.00009572151,0.0000042974284],"category_scores_gemma":[0.00013790501,0.00016104717,0.00013726283,0.000368334,0.000020992036,0.0005204946,0.00003571528,0.000100284014,0.000009286163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003351277,0.003294201,0.016024612,0.00039832512,0.0024044008,0.00020470016,0.0014500768,0.0058784005,0.07948369,0.35959902,0.021029398,0.5068819],"study_design_scores_gemma":[0.029556045,0.006184973,0.027031235,0.00061748136,0.00023895052,0.000042021646,0.00020560622,0.9124178,0.0075442693,0.0045719924,0.009848121,0.0017414504],"about_ca_topic_score_codex":0.00008529169,"about_ca_topic_score_gemma":0.000019667881,"teacher_disagreement_score":0.9516127,"about_ca_system_score_codex":0.000081164304,"about_ca_system_score_gemma":0.00014590139,"threshold_uncertainty_score":0.6567313},"labels":[],"label_agreement":null},{"id":"W1525108893","doi":"10.1109/acc.2015.7171805","title":"Stability analysis of dynamic decision-making for vehicle heading control","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Heading (navigation); Vehicle dynamics; Convergence (economics); Stability (learning theory); Computer science; Probabilistic logic; Dynamic decision-making; Control theory (sociology); Control (management); Model predictive control; Mathematical optimization; Engineering; Mathematics; Artificial intelligence; Machine learning; Aerospace engineering","score_opus":0.031184387501952446,"score_gpt":0.3097823149640808,"score_spread":0.27859792746212836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525108893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09681759,0.00007073004,0.9018469,0.00016481044,0.00022798996,0.00040713375,0.0000585587,0.000106164,0.00030014405],"genre_scores_gemma":[0.96940774,2.10614e-7,0.030442836,0.00007544691,0.000011165197,0.000034592733,0.0000052482405,0.0000058432893,0.000016892802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982342,0.000097912256,0.00054313184,0.00042329688,0.00040238086,0.0002990902],"domain_scores_gemma":[0.9972099,0.0011686856,0.00021136683,0.00082090875,0.00045305226,0.00013608867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014811329,0.00012771138,0.00050783803,0.00022561621,0.00005518715,0.00010319686,0.00079317944,0.000057738987,0.000012173946],"category_scores_gemma":[0.00079791655,0.00010996057,0.00026901692,0.0010867302,0.000028309467,0.00036252412,0.00009840999,0.00004791123,0.000008799071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010445028,0.0015677167,0.1637791,0.00019632002,0.008377957,0.000025756366,0.0049662488,0.15064849,0.022536885,0.13805106,0.0023305244,0.50647545],"study_design_scores_gemma":[0.0012475181,0.000058371726,0.0073287846,0.00001514174,0.00016383106,5.0161475e-7,0.00011822098,0.9891994,0.00010567213,0.0015378483,0.00010706837,0.00011764252],"about_ca_topic_score_codex":0.00007247048,"about_ca_topic_score_gemma":0.00020972073,"teacher_disagreement_score":0.8725902,"about_ca_system_score_codex":0.00019237387,"about_ca_system_score_gemma":0.00009629672,"threshold_uncertainty_score":0.44840622},"labels":[],"label_agreement":null},{"id":"W1535589088","doi":"10.1002/asjc.734","title":"Reconfigurable Synchronization Control of Networked <scp>E</scp>uler‐<scp>L</scp>agrange Systems with Switching Communication Topologies","year":2013,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"","keywords":"Synchronization (alternating current); Network topology; Actuator; Control theory (sociology); State (computer science); Topology (electrical circuits); Telecommunications network; Computer science; Control (management); Engineering; Control engineering; Distributed computing; Computer network","score_opus":0.008599919971553203,"score_gpt":0.20451901921008495,"score_spread":0.19591909923853174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535589088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020873008,0.0060874615,0.9644038,0.0015394449,0.0009102614,0.0014899023,0.00001896514,0.00013036233,0.0045467806],"genre_scores_gemma":[0.99751204,0.00008907487,0.0015593015,0.00017209211,0.000289757,0.000088573186,0.000008558192,0.00004040838,0.00024019908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99508977,0.0011654238,0.0017646695,0.0003788842,0.0008460019,0.00075525756],"domain_scores_gemma":[0.9913595,0.0021567862,0.0032798857,0.0011798507,0.0017028113,0.00032120233],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019571742,0.00043923885,0.0012783393,0.0003536461,0.0002776808,0.0007244386,0.0022774471,0.000239382,0.000007466275],"category_scores_gemma":[0.0013142092,0.0003448215,0.00027385878,0.00058642024,0.00013596566,0.002108219,0.0000563766,0.000584828,0.000042960284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004300576,0.0024991976,0.10103061,0.0016186065,0.012985845,0.00049925415,0.02620744,0.43705434,0.03232351,0.08556648,0.07325541,0.22652924],"study_design_scores_gemma":[0.023285663,0.0019418898,0.015419574,0.0020813493,0.00057090353,0.0008616104,0.009109932,0.93399554,0.00050470163,0.0017233593,0.0101524815,0.00035296718],"about_ca_topic_score_codex":0.00019954094,"about_ca_topic_score_gemma":0.000021358357,"teacher_disagreement_score":0.97663903,"about_ca_system_score_codex":0.00019877507,"about_ca_system_score_gemma":0.00029649073,"threshold_uncertainty_score":0.9999004},"labels":[],"label_agreement":null},{"id":"W1535667553","doi":"10.1007/978-3-642-22427-0_7","title":"A Centralized Framework to Multi-robots Formation Control: Theory and Application","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Robot; Group (periodic table); Consistency (knowledge bases); Controller (irrigation); Perspective (graphical); Property (philosophy); Graph; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Distributed computing; Theoretical computer science; Computer network; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.016302015788813656,"score_gpt":0.2504416907569624,"score_spread":0.23413967496814872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1535667553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000028916831,0.00042767837,0.99578524,0.0005535313,0.000999193,0.0015906007,0.000019659827,0.0002499837,0.00034521738],"genre_scores_gemma":[0.5722135,0.000030382284,0.42484742,0.0024013922,0.0002462536,0.00010005537,0.000011084215,0.00003924949,0.000110665234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630153,0.00013471837,0.00067896774,0.001438302,0.0007235518,0.00072291866],"domain_scores_gemma":[0.99676704,0.0007008759,0.00042701454,0.0014869233,0.00028400734,0.00033413776],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017065209,0.0005498119,0.0006317426,0.00061833934,0.00024589774,0.0005658147,0.002531808,0.00042111374,0.000008343723],"category_scores_gemma":[0.00027819184,0.0005048616,0.00010950042,0.00048649576,0.00031117356,0.0008136371,0.0006760465,0.0005707742,0.000103897626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055099474,0.000053091786,0.000069533715,0.00006264435,0.000028141872,0.000021392316,0.0025733735,0.011281774,0.00048548434,0.33744803,0.000017704688,0.64790374],"study_design_scores_gemma":[0.0013583398,0.00015367023,0.00069066905,0.0006101434,0.000026587717,0.00006242999,5.4335027e-7,0.69915944,0.0005335732,0.2946517,0.0017955325,0.00095737644],"about_ca_topic_score_codex":0.00003297664,"about_ca_topic_score_gemma":0.000035352507,"teacher_disagreement_score":0.68787766,"about_ca_system_score_codex":0.00028924175,"about_ca_system_score_gemma":0.00016343885,"threshold_uncertainty_score":0.9997403},"labels":[],"label_agreement":null},{"id":"W1547102391","doi":"10.1007/978-3-642-13651-1_23","title":"Fast Decentralized Averaging via Multi-scale Gossip","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Logarithm; Pairwise comparison; Computation; Partition (number theory); Graph; Binary logarithm; Theoretical computer science; Random graph; Algorithm; Combinatorics; Mathematics; Artificial intelligence","score_opus":0.014253015160981743,"score_gpt":0.24077551345586343,"score_spread":0.2265224982948817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1547102391","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008744824,0.00041768566,0.9902348,0.00071709463,0.006074689,0.00086428726,0.000023788327,0.00047891235,0.0011013026],"genre_scores_gemma":[0.17940082,0.000038265607,0.81711996,0.0015752319,0.00079170096,0.000039547904,0.000029213668,0.000104066654,0.000901175],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9931998,0.00008360105,0.0010161059,0.002599485,0.0016015915,0.0014994094],"domain_scores_gemma":[0.9953011,0.0004152617,0.00060773257,0.002745397,0.0004183544,0.0005121333],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012271893,0.000990035,0.0010346342,0.00088109414,0.0005091592,0.0014244085,0.006688928,0.00071216805,0.00005508955],"category_scores_gemma":[0.000110484034,0.00093260064,0.00032413463,0.00076785486,0.00085057394,0.0009917996,0.0017846102,0.0018461174,0.00027781303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001570973,0.00015175762,0.00042291768,0.00008604169,0.000052978277,0.0003405284,0.0017200991,0.015545612,0.012868987,0.0035931407,0.000039383835,0.9651628],"study_design_scores_gemma":[0.001535655,0.000077983444,0.00041207223,0.0004262566,0.000019444726,0.00019768352,2.323583e-7,0.97058827,0.005192606,0.012451498,0.007717545,0.0013807614],"about_ca_topic_score_codex":0.00010129799,"about_ca_topic_score_gemma":0.00030289614,"teacher_disagreement_score":0.9637821,"about_ca_system_score_codex":0.00051384466,"about_ca_system_score_gemma":0.0006046271,"threshold_uncertainty_score":0.9996122},"labels":[],"label_agreement":null},{"id":"W1551388113","doi":"10.1109/med.2015.7158778","title":"Cooperative Unmanned Aerial Vehicles formation via decentralized LBMPC","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Flocking (texture); Robustness (evolution); Trajectory; Computer science; Control theory (sociology); Convergence (economics); Decentralised system; Control engineering; Control (management); Engineering; Artificial intelligence","score_opus":0.03353710614665366,"score_gpt":0.2569460163704648,"score_spread":0.22340891022381115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551388113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02239174,0.0000695852,0.9713604,0.001176889,0.0010343607,0.00044546265,0.000007704016,0.0003909761,0.003122903],"genre_scores_gemma":[0.99322015,0.0000026980883,0.0059816977,0.000303158,0.00009687561,0.000036545152,0.000032481203,0.0000071169425,0.00031929437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984952,0.00018383187,0.00034189693,0.00026518927,0.00037602306,0.00033782658],"domain_scores_gemma":[0.9989071,0.000045325538,0.000112359754,0.00040060017,0.00030463547,0.00022997467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037599105,0.00015479028,0.00021003862,0.00006111551,0.000087583714,0.00032605458,0.0006385498,0.00006976186,0.000020694974],"category_scores_gemma":[0.00009776893,0.00012734035,0.000053137832,0.0002933732,0.000025839623,0.0014342195,0.00012813919,0.00006416596,0.0005653879],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007992856,0.0010376925,0.0011433138,0.00007934267,0.00041727626,0.00013628819,0.016130107,0.008383451,0.093212515,0.551381,0.22769052,0.09958921],"study_design_scores_gemma":[0.008277377,0.00024056052,0.0004594284,0.000025378593,0.000016373819,0.000041890406,0.00032501685,0.9094414,0.04119806,0.0018110055,0.037639868,0.0005236267],"about_ca_topic_score_codex":0.00011486084,"about_ca_topic_score_gemma":0.000046636247,"teacher_disagreement_score":0.9708284,"about_ca_system_score_codex":0.00013774807,"about_ca_system_score_gemma":0.000096423515,"threshold_uncertainty_score":0.7267106},"labels":[],"label_agreement":null},{"id":"W1551426843","doi":"10.1109/icuas.2015.7152394","title":"Formation control of multiple quadrotors based on leader-follower method","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Linear-quadratic regulator; Trajectory; Sliding mode control; Position (finance); Attitude control; Inner loop; Loop (graph theory); Control (management); Computer science; Tracking (education); Controller (irrigation); Control system; Engineering; Control engineering; Nonlinear system; Mathematics; Artificial intelligence; Physics; Psychology","score_opus":0.04518108035675423,"score_gpt":0.2824118157898081,"score_spread":0.2372307354330539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1551426843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007325238,0.000015462903,0.99253327,0.000945245,0.00046589033,0.0006695878,0.000016437298,0.00020201602,0.004419596],"genre_scores_gemma":[0.95214355,7.9318774e-8,0.047054704,0.000493218,0.000032177104,0.00006812253,0.0000088396355,0.000008245778,0.00019103664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981156,0.00030284986,0.00044828153,0.00027841426,0.00058422727,0.00027063204],"domain_scores_gemma":[0.9982643,0.0003970065,0.00023115623,0.0006808513,0.00025453686,0.00017211461],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00115679,0.00016166673,0.0003053825,0.00015583567,0.00003688523,0.00007245069,0.00065823726,0.00008282851,0.0000122787815],"category_scores_gemma":[0.00038789416,0.00013125307,0.00012613194,0.00029174067,0.00001850374,0.00057178887,0.000036972244,0.00008322605,0.00013616057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018487839,0.004444405,0.034762982,0.00050494645,0.0006603933,0.00010324087,0.007726839,0.47681406,0.05942205,0.1833886,0.084791236,0.14553244],"study_design_scores_gemma":[0.0046156105,0.00018947209,0.00037002793,0.000021127029,0.000008552578,0.000001985741,0.00010167752,0.9821651,0.00858937,0.000097865566,0.0036897666,0.00014947436],"about_ca_topic_score_codex":0.00015619262,"about_ca_topic_score_gemma":0.00001916635,"teacher_disagreement_score":0.95141107,"about_ca_system_score_codex":0.00010026539,"about_ca_system_score_gemma":0.000093599134,"threshold_uncertainty_score":0.53523445},"labels":[],"label_agreement":null},{"id":"W1552603638","doi":"","title":"Model-based coordination control of networked spacecraft formations by integrator backstepping","year":2011,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Backstepping; Spacecraft; Control theory (sociology); Integrator; Controller (irrigation); Computer science; Double integrator; Position (finance); Representation (politics); Control engineering; Control (management); Engineering; Adaptive control; Artificial intelligence; Aerospace engineering","score_opus":0.024218808153933902,"score_gpt":0.23318107762309734,"score_spread":0.20896226946916344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1552603638","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01136259,0.00022172401,0.9836266,0.0007043487,0.00038053497,0.0009786327,0.00015587377,0.00030043066,0.0022692522],"genre_scores_gemma":[0.99634254,0.0000033451895,0.0028379855,0.00032946313,0.000044486475,0.00021506098,0.000053981123,0.000022136672,0.00015102887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726325,0.0003091088,0.0008850839,0.00053213665,0.00046364914,0.0005467537],"domain_scores_gemma":[0.99683535,0.00031983724,0.00067649485,0.0008724675,0.0010466492,0.00024920612],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006804982,0.00043496853,0.00076055835,0.00020888797,0.00017881855,0.00017344054,0.0014715631,0.00017998551,0.000041244064],"category_scores_gemma":[0.0003996495,0.00036385513,0.00022396461,0.00056660664,0.000124124,0.0010565886,0.00007568988,0.00030025898,0.000039381903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00185088,0.0032422012,0.11567873,0.00078921154,0.0018935584,0.000052115232,0.009878766,0.12887457,0.22318472,0.4493067,0.011544007,0.053704537],"study_design_scores_gemma":[0.0058672717,0.00012661851,0.0012764087,0.0000845486,0.000044914876,0.000002331387,0.000036770864,0.9898607,0.00038475354,0.0017503325,0.00021185105,0.0003535121],"about_ca_topic_score_codex":0.000105132516,"about_ca_topic_score_gemma":0.000048285594,"teacher_disagreement_score":0.9849799,"about_ca_system_score_codex":0.000094126786,"about_ca_system_score_gemma":0.00032382185,"threshold_uncertainty_score":0.9998813},"labels":[],"label_agreement":null},{"id":"W1553158584","doi":"10.1002/acs.2400","title":"Neural adaptive control for leader–follower flocking of networked nonholonomic agents with unknown nonlinear dynamics","year":2013,"lang":"en","type":"article","venue":"International Journal of Adaptive Control and Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Flocking (texture); Nonholonomic system; Control theory (sociology); Nonlinear system; Computer science; Control engineering; Adaptive control; Artificial neural network; Dynamics (music); Control (management); Engineering; Robot; Mobile robot; Artificial intelligence; Psychology; Physics","score_opus":0.017139912238251485,"score_gpt":0.24298959452156033,"score_spread":0.22584968228330884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553158584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047445517,0.00070021197,0.94956666,0.0011842826,0.0004054475,0.0005307215,0.000048727878,0.000020661953,0.0000977824],"genre_scores_gemma":[0.9876583,0.0000052819823,0.011431936,0.00034553473,0.0004591625,0.000028628388,0.000005513396,0.000022121165,0.00004347992],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976718,0.000120136814,0.00089939643,0.0003242122,0.0006268833,0.00035757056],"domain_scores_gemma":[0.99533427,0.0003465705,0.0014204116,0.00011701673,0.0026130665,0.00016867965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051249395,0.00028747434,0.00063015346,0.000233119,0.00012345747,0.00034033347,0.00090736535,0.000090659916,0.000007852327],"category_scores_gemma":[0.00006107072,0.00022009647,0.0002062716,0.0001342994,0.0001397434,0.0014569188,0.000061821615,0.00027491656,0.0000018671113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011417579,0.0011155414,0.008921749,0.00014300732,0.0063028005,0.0003706616,0.0023565271,0.24206908,0.015378973,0.009081951,0.0006329267,0.7022092],"study_design_scores_gemma":[0.009063398,0.00083483243,0.0024787504,0.00035120914,0.00010061854,0.00012938237,0.00024312966,0.98595625,0.00008474541,0.00043189136,0.00010029995,0.00022551359],"about_ca_topic_score_codex":0.000040355317,"about_ca_topic_score_gemma":0.000014769886,"teacher_disagreement_score":0.94021285,"about_ca_system_score_codex":0.0001725043,"about_ca_system_score_gemma":0.0002382007,"threshold_uncertainty_score":0.89752734},"labels":[],"label_agreement":null},{"id":"W1560616049","doi":"10.1108/20496421311298125","title":"A robust semi‐decentralized fault detection strategy for multi‐agent systems","year":2013,"lang":"en","type":"article","venue":"International Journal of Intelligent Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fault detection and isolation; Computer science; Multi-agent system; Fault (geology); Distributed computing; Mathematical optimization; Linear system; Control theory (sociology); Mathematics; Artificial intelligence; Control (management)","score_opus":0.07538210940301131,"score_gpt":0.3024004050127411,"score_spread":0.2270182956097298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1560616049","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010664537,0.0022757594,0.9656954,0.00037852433,0.018784953,0.0018726673,0.00006798628,0.00012700727,0.00013318908],"genre_scores_gemma":[0.9952793,0.00015312019,0.0021709339,0.0000740552,0.0010738585,0.00028233757,0.000024616631,0.000043924156,0.0008978482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99444515,0.00038784035,0.0024717106,0.000531748,0.0015222864,0.00064124545],"domain_scores_gemma":[0.99232054,0.00031569743,0.0020420789,0.0005279521,0.0043863477,0.000407412],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013985492,0.0004487235,0.0007610119,0.0006366812,0.00013921637,0.0019412215,0.0028094563,0.00023500963,0.00002520804],"category_scores_gemma":[0.00037804828,0.00037956174,0.0005509921,0.00031314394,0.000046694964,0.0015348764,0.00014765849,0.00034277388,0.00020814985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004705696,0.0014504677,0.00085617125,0.00041321898,0.004090242,0.0002748624,0.0013372627,0.88415474,0.029001903,0.026588399,0.016005313,0.035356868],"study_design_scores_gemma":[0.0027794715,0.0004065311,0.00019986797,0.0005932481,0.00005108936,0.00087019725,0.0013311999,0.96556884,0.0040858765,0.00010267611,0.02355955,0.00045144395],"about_ca_topic_score_codex":0.0007003954,"about_ca_topic_score_gemma":0.000023990855,"teacher_disagreement_score":0.9846148,"about_ca_system_score_codex":0.00092842587,"about_ca_system_score_gemma":0.00019018353,"threshold_uncertainty_score":0.99986565},"labels":[],"label_agreement":null},{"id":"W1562702492","doi":"10.5772/13999","title":"A Reinforcement Learning Approach to Intelligent Goal Coordination of Two-Level Large-Scale Control Systems","year":2011,"lang":"en","type":"book-chapter","venue":"InTech eBooks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of British Columbia","funders":"","keywords":"Reinforcement learning; Scale (ratio); Control (management); Computer science; Artificial intelligence; Geography; Cartography","score_opus":0.038212957448432255,"score_gpt":0.24568765749933635,"score_spread":0.2074747000509041,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562702492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000007647943,0.00011276901,0.6508043,0.00001520122,0.00070076203,0.0016997553,0.00006425388,0.00021419417,0.34638113],"genre_scores_gemma":[0.7035717,0.0000020613422,0.0020301102,0.00006823576,0.00015007753,0.00030339204,0.000042318126,0.00006464928,0.29376745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958004,0.00012394252,0.001471185,0.0009734519,0.0009831169,0.0006479214],"domain_scores_gemma":[0.99642515,0.00010885607,0.0011108479,0.0012729755,0.0007936309,0.00028856192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012264872,0.00066836685,0.001127814,0.0005781212,0.00013197222,0.00020039445,0.0019171436,0.00043803043,0.000023821089],"category_scores_gemma":[0.000070284455,0.0006536604,0.0003771711,0.00006399127,0.00008123198,0.00014011157,0.0005735893,0.0007217781,0.00026400515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013802077,0.00015014557,0.000020122028,0.00059386995,0.0008968343,0.000030817533,0.004167617,0.0061666155,0.0077727195,0.9610305,0.0006100738,0.018422691],"study_design_scores_gemma":[0.0077771177,0.0018872191,0.000015288402,0.004089721,0.00044565529,0.00017269532,0.0005020285,0.48360887,0.01814935,0.0060760346,0.4737087,0.0035673063],"about_ca_topic_score_codex":0.0002528177,"about_ca_topic_score_gemma":0.00001691406,"teacher_disagreement_score":0.95495445,"about_ca_system_score_codex":0.00044143698,"about_ca_system_score_gemma":0.00018123326,"threshold_uncertainty_score":0.99959147},"labels":[],"label_agreement":null},{"id":"W1564217487","doi":"","title":"Finite-time consensus of multi-agent systems with directed and intermittent links","year":2011,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multi-agent system; Topology (electrical circuits); Spanning tree; Consensus; Simple (philosophy); Network topology; Computer science; Tree (set theory); Protocol (science); State (computer science); Nonlinear system; Mathematics; Distributed computing; Discrete mathematics; Algorithm; Combinatorics; Artificial intelligence; Physics; Computer network","score_opus":0.028249807685420333,"score_gpt":0.22614195563215297,"score_spread":0.19789214794673265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1564217487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26216888,0.0012306686,0.73067874,0.00026499585,0.0007996753,0.00184409,0.00018484595,0.0006824239,0.002145705],"genre_scores_gemma":[0.9970316,0.000010387078,0.0023591022,0.00007845245,0.00003921711,0.00011459029,0.000009985126,0.000024067209,0.00033255445],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728125,0.00033415182,0.0007663484,0.0007353208,0.00039619667,0.00048674742],"domain_scores_gemma":[0.9969203,0.00045681142,0.0005532204,0.0010267608,0.0007426317,0.00030028826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004460393,0.0004697837,0.0009341812,0.00019248291,0.000097801276,0.00018142405,0.0010524325,0.00021192919,0.000023872462],"category_scores_gemma":[0.0003540765,0.0003318079,0.00010356054,0.00035454344,0.0002496406,0.00023500394,0.00021109084,0.00033527947,0.000056597983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004848423,0.0063968524,0.64323443,0.0028813886,0.007400802,0.0029364713,0.03679971,0.0048400797,0.13883427,0.06944163,0.0015166537,0.080869295],"study_design_scores_gemma":[0.00611181,0.000339371,0.06496331,0.00028174577,0.000067477624,0.000069241294,0.000067742956,0.9272586,0.00017465465,0.000079506164,0.0001088681,0.00047763655],"about_ca_topic_score_codex":0.00038277145,"about_ca_topic_score_gemma":0.000044826178,"teacher_disagreement_score":0.92241853,"about_ca_system_score_codex":0.000042284137,"about_ca_system_score_gemma":0.00017059303,"threshold_uncertainty_score":0.9999134},"labels":[],"label_agreement":null},{"id":"W1574274881","doi":"10.1109/icuas.2015.7152346","title":"Fault tolerant cooperative control of multiple UAVs-UGVs under actuator faults","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Robot; Fault tolerance; Feedback linearization; Computer science; Linear-quadratic regulator; Fault (geology); Linearization; Control engineering; Controller (irrigation); Control (management); Engineering; Artificial intelligence; Nonlinear system; Distributed computing","score_opus":0.03209998623750195,"score_gpt":0.25534828783396385,"score_spread":0.2232483015964619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574274881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041072946,0.00012283845,0.9530764,0.0011635965,0.0007272603,0.00076955237,0.00008258588,0.000272308,0.002712471],"genre_scores_gemma":[0.993787,0.0000011770927,0.004458715,0.00055401714,0.00007784553,0.00005806529,0.000013776518,0.00001599259,0.001033448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974451,0.00023423637,0.0006264669,0.00054891995,0.0006739897,0.0004713078],"domain_scores_gemma":[0.99738544,0.0003341025,0.00024522544,0.0008680388,0.00079879473,0.0003684237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005351501,0.00029140172,0.0005655323,0.000104115155,0.00007291638,0.000117076765,0.0011256017,0.00012917187,0.000027768272],"category_scores_gemma":[0.000336681,0.00022616725,0.0001321854,0.00037746446,0.00008067392,0.00065461034,0.00016499218,0.00014689582,0.00028763284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017266527,0.005093729,0.02041268,0.0002383044,0.003116539,0.0003503989,0.019728081,0.14451182,0.15559985,0.5356256,0.06980675,0.043789636],"study_design_scores_gemma":[0.013119152,0.00036579,0.0013776877,0.000048618964,0.000029913339,0.000022617625,0.0011395841,0.9635894,0.012699163,0.00030285856,0.006753613,0.0005516399],"about_ca_topic_score_codex":0.000367674,"about_ca_topic_score_gemma":0.00012205028,"teacher_disagreement_score":0.952714,"about_ca_system_score_codex":0.00013029046,"about_ca_system_score_gemma":0.0002788758,"threshold_uncertainty_score":0.9222833},"labels":[],"label_agreement":null},{"id":"W1585857718","doi":"10.1002/jgt.21628","title":"Average Degree in Graph Powers","year":2012,"lang":"en","type":"article","venue":"Journal of Graph Theory","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Combinatorics; Degree (music); Vertex (graph theory); Graph; Simple graph; Discrete mathematics; Connectivity; Physics","score_opus":0.020263659298784507,"score_gpt":0.24347709745190657,"score_spread":0.22321343815312206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585857718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16245742,0.0042834985,0.8217781,0.00045691608,0.0037381083,0.00019675399,0.000005591207,0.000053669926,0.0070299036],"genre_scores_gemma":[0.9979055,0.00003994307,0.0015974803,0.00021436205,0.00015762256,0.0000023991313,4.168012e-7,0.000010105527,0.00007220431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.997862,0.00047250983,0.0006164473,0.00013443369,0.00045355118,0.00046109757],"domain_scores_gemma":[0.99847984,0.00026479384,0.00048990536,0.00040309018,0.000118627504,0.00024374714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003518245,0.00016065175,0.00032669643,0.00063280656,0.00005502596,0.00008438808,0.0011360998,0.00008105574,0.000025792126],"category_scores_gemma":[0.00015697104,0.0001291724,0.00028732105,0.00065911614,0.00005815335,0.0011996327,0.00008575183,0.0003433197,0.000033694083],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026367427,0.00087274937,0.06758016,0.00004297731,0.00037923848,0.0004316791,0.0047246367,0.00048167683,0.0049595507,0.85536087,0.0038470204,0.06105579],"study_design_scores_gemma":[0.011908473,0.00084524264,0.5300707,0.0007256138,0.000122536,0.0023645102,0.0015747119,0.0012907533,0.00304266,0.42645466,0.019922048,0.0016780774],"about_ca_topic_score_codex":0.0000067367123,"about_ca_topic_score_gemma":0.0000029954938,"teacher_disagreement_score":0.835448,"about_ca_system_score_codex":0.000069326736,"about_ca_system_score_gemma":0.000053342654,"threshold_uncertainty_score":0.5267498},"labels":[],"label_agreement":null},{"id":"W1599321600","doi":"10.1007/978-3-642-11876-0_38","title":"Heuristic Formation Control in Multi-robot Systems Using Local Communication and Limited Identification","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Identification (biology); Heuristic; Robot; Control (management); Artificial intelligence; Human–computer interaction; Distributed computing","score_opus":0.031096290953244756,"score_gpt":0.2609575250829146,"score_spread":0.22986123412966983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1599321600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003508428,0.0010457606,0.9955265,0.00027518155,0.0013657717,0.0012332589,0.000018482058,0.00013153507,0.00005264921],"genre_scores_gemma":[0.9313666,0.00003414434,0.0682314,0.00016962939,0.00008281964,0.00003190916,0.000030395922,0.000025900614,0.000027190034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962441,0.00018947017,0.0011368176,0.0011027106,0.0007827082,0.0005442432],"domain_scores_gemma":[0.9963177,0.0005829825,0.0008062098,0.0017120021,0.0004258396,0.00015526003],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001944264,0.00047632214,0.00063538173,0.0010513968,0.00031152242,0.0011851597,0.0023592128,0.00049531745,0.0000014014222],"category_scores_gemma":[0.00018742884,0.0004814842,0.0000715315,0.0005831331,0.0006101268,0.0013976304,0.00056198286,0.0009868125,0.000017664379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036585265,0.00019253774,0.0006230056,0.000442759,0.00004335246,0.00008623567,0.0024006313,0.6140319,0.018327825,0.018965831,0.000007675066,0.34484163],"study_design_scores_gemma":[0.001064563,0.000033734104,0.0008516446,0.00061589625,0.00001451995,0.00010218158,0.0000011787243,0.9937173,0.00031477184,0.0027103517,0.000120485034,0.0004533605],"about_ca_topic_score_codex":0.0002950876,"about_ca_topic_score_gemma":0.00038546993,"teacher_disagreement_score":0.9310158,"about_ca_system_score_codex":0.0006012077,"about_ca_system_score_gemma":0.00023774338,"threshold_uncertainty_score":0.9998517},"labels":[],"label_agreement":null},{"id":"W1607444056","doi":"10.1109/icsmc.2005.1571398","title":"An optimization algorithm for the coordinated hybrid agent framework","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Optimization problem; Multi-agent system; Mathematical optimization; Optimization algorithm; Complex system; Hybrid system; Homogeneous; Distributed computing; Algorithm; Mathematics; Artificial intelligence","score_opus":0.014351539492314574,"score_gpt":0.26483792779157644,"score_spread":0.25048638829926184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607444056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000039220726,0.00011151601,0.9945073,0.0033970962,0.00058970414,0.00070172217,0.00002345756,0.0003747117,0.00025523375],"genre_scores_gemma":[0.32176763,0.00000673136,0.6763405,0.000942728,0.00030006043,0.0001426888,0.000032678578,0.000012785656,0.00045415442],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881464,0.000065765445,0.0002533231,0.0003496115,0.00021420163,0.00030248196],"domain_scores_gemma":[0.9986279,0.00022999902,0.00009616271,0.0007712552,0.00017276057,0.0001019385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039122583,0.0001381905,0.0001350613,0.00004311965,0.00022280609,0.00038357315,0.0011412731,0.00005418266,0.00005144414],"category_scores_gemma":[0.000056369467,0.00009523548,0.000074347976,0.00023562498,0.000021630618,0.00054446893,0.00006920673,0.000085140644,0.00005826763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003869272,0.00013129704,0.0000151066615,0.000002888057,0.000051145114,0.0000024033113,0.00012228497,0.33542556,0.000041829637,0.022184528,0.006763687,0.6352554],"study_design_scores_gemma":[0.00042732753,0.000052084393,0.00004611953,0.0000069486305,0.000010782839,0.0000066221,0.000024672348,0.97992,0.00056387775,0.00022241447,0.018582292,0.00013682466],"about_ca_topic_score_codex":0.000029418363,"about_ca_topic_score_gemma":0.0000033460683,"teacher_disagreement_score":0.6444945,"about_ca_system_score_codex":0.000072776944,"about_ca_system_score_gemma":0.000035317553,"threshold_uncertainty_score":0.38835904},"labels":[],"label_agreement":null},{"id":"W1609070905","doi":"10.1109/tmc.2015.2393856","title":"Decentralized and Parallel Constructionsfor Optimally Rigid Graphs in","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Pain Society; National Science Foundation","keywords":"Computer science; Bidding; Cardinality (data modeling); Mathematical optimization; Rigidity (electromagnetism); Enhanced Data Rates for GSM Evolution; Greedy algorithm; Constant (computer programming); Graph; Theoretical computer science; Distributed computing; Algorithm; Mathematics","score_opus":0.022193717385069273,"score_gpt":0.2601645338487912,"score_spread":0.2379708164637219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609070905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12024641,0.00018969228,0.8772943,0.00013402966,0.0010528812,0.0005857562,0.000012196311,0.00028055586,0.00020420422],"genre_scores_gemma":[0.9576393,0.00002581303,0.042106654,0.00008869149,0.000018314498,0.00007430017,0.0000020367324,0.00001430885,0.000030601066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980158,0.00017564205,0.0005062073,0.00054283056,0.00029911572,0.00046039588],"domain_scores_gemma":[0.9988788,0.000189558,0.00012517768,0.000426118,0.00011651286,0.00026387797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044650034,0.00023584413,0.00032450334,0.0002953531,0.00018755345,0.00021542919,0.00044909146,0.00009974581,0.00000533239],"category_scores_gemma":[0.000011414027,0.0002449943,0.000096387055,0.0006153075,0.00009225009,0.00039320905,0.0000076164138,0.00028246167,0.00003158979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000918513,0.00047958386,0.0015373976,0.000036838683,0.00010475805,0.00006638949,0.0016771851,0.83820677,0.0005645241,0.0068371613,0.00018792195,0.15020962],"study_design_scores_gemma":[0.0054856217,0.0002464639,0.00071276433,0.00012016963,0.00002238105,0.00021543373,0.00043658444,0.98925894,0.00082688866,0.0009975395,0.0011828599,0.0004943229],"about_ca_topic_score_codex":0.00012029265,"about_ca_topic_score_gemma":0.000043478663,"teacher_disagreement_score":0.83739287,"about_ca_system_score_codex":0.000136256,"about_ca_system_score_gemma":0.000120645454,"threshold_uncertainty_score":0.99905777},"labels":[],"label_agreement":null},{"id":"W16170269","doi":"10.1007/978-3-642-21538-4_13","title":"Nonlinear Maneuvering Control of Rigid Formations of Fixed Wing UAVs","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fixed wing; Scheme (mathematics); Control theory (sociology); Wing; Nonlinear system; Control (management); Computer science; Control engineering; Engineering; Aerospace engineering; Mathematics; Artificial intelligence","score_opus":0.019222891120044622,"score_gpt":0.22937699827722838,"score_spread":0.21015410715718374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16170269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024627012,0.00025091477,0.9942378,0.00011929547,0.0011460489,0.00058470207,0.00006130078,0.000099638404,0.0032540672],"genre_scores_gemma":[0.8569948,0.000012218163,0.14258865,0.00015431317,0.00013747285,0.000009921464,0.000008332374,0.000024360259,0.00006991871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963854,0.000048412265,0.001150506,0.00087161467,0.0009722192,0.000571854],"domain_scores_gemma":[0.99638975,0.00046025615,0.0009719602,0.001552066,0.00048180684,0.0001441592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009324652,0.00046221164,0.000904279,0.000823341,0.00013173842,0.00013764786,0.0035732824,0.0002799304,0.000017308388],"category_scores_gemma":[0.00012114944,0.000436383,0.00024043274,0.0005226724,0.00050763314,0.00081441255,0.00072142895,0.00048187363,0.00002075659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000088709465,0.00041859347,0.0009762524,0.0011773756,0.00035512718,0.00017690228,0.0068625202,0.12780361,0.017077427,0.14179115,0.00004919862,0.70322317],"study_design_scores_gemma":[0.0013226528,0.00026963628,0.00029093574,0.0011039963,0.000037018443,0.00005467716,5.944684e-7,0.9659315,0.011302243,0.017681913,0.0012881884,0.0007166694],"about_ca_topic_score_codex":0.00007995464,"about_ca_topic_score_gemma":0.00003083619,"teacher_disagreement_score":0.8567485,"about_ca_system_score_codex":0.00016644795,"about_ca_system_score_gemma":0.0003985394,"threshold_uncertainty_score":0.9998088},"labels":[],"label_agreement":null},{"id":"W163698839","doi":"","title":"Flight control of helicopter groups using nonlinear model predictive control","year":2007,"lang":"en","type":"article","venue":"International Conference on Control Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Heading (navigation); Control theory (sociology); Position (finance); Model predictive control; Control (management); Nonlinear system; Group (periodic table); Nonlinear model; Attitude control; Computer science; Control engineering; Engineering; Artificial intelligence; Aerospace engineering; Physics","score_opus":0.032905697965794435,"score_gpt":0.30070414440195653,"score_spread":0.2677984464361621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W163698839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014112323,0.000060879873,0.98462456,0.002188733,0.00039446232,0.0017406021,0.0011299837,0.00020900818,0.00824053],"genre_scores_gemma":[0.9900052,0.0000073030587,0.007941619,0.001047518,0.00035204575,0.00044926323,0.000053855303,0.000027226502,0.00011596141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643576,0.00010525834,0.001110608,0.00080554053,0.0009978919,0.00054496084],"domain_scores_gemma":[0.99594337,0.0004907939,0.0007289656,0.00095504837,0.0016208478,0.00026096893],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008781629,0.0003891675,0.0005850686,0.00038896847,0.00017374306,0.00019499587,0.0020612888,0.00019836673,0.000046277954],"category_scores_gemma":[0.00010633104,0.0003781914,0.00026243727,0.00032885768,0.00015736393,0.0005571748,0.00008938908,0.0003244271,0.00010809403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005218038,0.0007173501,0.0013335405,0.000016694063,0.0006253557,0.0000103791,0.00017102771,0.05187883,0.044595312,0.8941134,0.000083976265,0.0059323222],"study_design_scores_gemma":[0.0060638264,0.00011336548,0.00090406294,0.000054241464,0.0000735792,0.000012497275,0.00004393369,0.9861772,0.000841149,0.004324423,0.0010759437,0.00031579248],"about_ca_topic_score_codex":0.000046742793,"about_ca_topic_score_gemma":0.000021975597,"teacher_disagreement_score":0.988594,"about_ca_system_score_codex":0.00027601336,"about_ca_system_score_gemma":0.0002864945,"threshold_uncertainty_score":0.999867},"labels":[],"label_agreement":null},{"id":"W1661201301","doi":"10.1109/tsipn.2015.2471846","title":"Error Propagation in Gossip-Based Distributed Particle Filters","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Public Works and Government Services Canada","keywords":"Gossip; Particle filter; Function (biology); Filter (signal processing); Stability (learning theory); Exponential function; Applied mathematics; Algorithm; Computer science; Mathematics; Upper and lower bounds; Statistics; Mathematical optimization; Mathematical analysis; Machine learning","score_opus":0.020358693069847326,"score_gpt":0.2360437830662466,"score_spread":0.21568508999639927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1661201301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0093696965,0.00004799565,0.9894074,0.00033935133,0.00023679585,0.00027978444,0.00002039256,0.00016840566,0.00013018634],"genre_scores_gemma":[0.99871117,0.0000027949654,0.0005961422,0.00053659617,0.000020818718,0.00007879195,0.000037493992,0.0000052107443,0.000010963217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868894,0.00007078434,0.00045790212,0.0001795217,0.00033063634,0.0002721911],"domain_scores_gemma":[0.9992566,0.0000466757,0.00023117768,0.00016238881,0.00014280438,0.00016036372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038046608,0.00015800609,0.00015877718,0.00012614015,0.00015754924,0.0004534195,0.00020034751,0.00010432396,0.000008225617],"category_scores_gemma":[0.000009254912,0.00014356527,0.00003434928,0.0006391248,0.00004255811,0.004342247,0.0000025332156,0.00021704275,0.000019018167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103145845,0.000096298994,0.00012828503,0.000035482124,0.000008903503,0.0000019330294,0.000635604,0.87603337,0.000038706527,0.00025091413,0.00024366388,0.12242369],"study_design_scores_gemma":[0.0016382469,0.00009537951,0.0007345038,0.00008883803,0.00000797508,0.0000037690397,0.00009972952,0.9953117,0.0007901966,0.00003426567,0.0010198606,0.00017558651],"about_ca_topic_score_codex":0.000030980915,"about_ca_topic_score_gemma":0.000008627295,"teacher_disagreement_score":0.9893415,"about_ca_system_score_codex":0.00012681322,"about_ca_system_score_gemma":0.00013781662,"threshold_uncertainty_score":0.5854421},"labels":[],"label_agreement":null},{"id":"W1814829895","doi":"10.1109/tsipn.2016.2620440","title":"Efficient Distributed Online Prediction and Stochastic Optimization With Approximate Distributed Averaging","year":2016,"lang":"en","type":"preprint","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Regret; Gossip; Scaling; Distributed algorithm; Computer science; Mathematics; Upper and lower bounds; Eigenvalues and eigenvectors; Random walk; Computation; Matrix (chemical analysis); Mathematical optimization; Combinatorics; Discrete mathematics; Algorithm; Distributed computing","score_opus":0.008005984302644301,"score_gpt":0.20533402556592514,"score_spread":0.19732804126328085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1814829895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013537861,0.00013782071,0.9948248,0.00021927671,0.0005007527,0.0008157638,0.0016309144,0.0004834129,0.000033426695],"genre_scores_gemma":[0.99581176,0.000041643547,0.0027983747,0.00012389653,0.00008848483,0.000154183,0.00094892544,0.000021338652,0.000011420928],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975474,0.00008381724,0.00080130546,0.00056093006,0.00056695216,0.0004396314],"domain_scores_gemma":[0.9982403,0.000096550204,0.0006829981,0.0003639005,0.00039501794,0.00022125342],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00029560045,0.0005055034,0.00044330262,0.00029558103,0.0005596921,0.00109508,0.00032526266,0.00034046613,0.0000111729705],"category_scores_gemma":[0.0000070409424,0.0003948309,0.00007181247,0.00044552973,0.00012027125,0.0017576271,0.000031303785,0.00064621575,0.0000019330075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011739367,0.000089205,0.000008660837,0.00018815024,0.000073376425,0.0000012685487,0.00022610465,0.96766037,0.000004320001,0.00008083671,0.000034040822,0.03151627],"study_design_scores_gemma":[0.0016127165,0.00010688238,0.00022140266,0.0012612677,0.000103017526,0.00003317621,0.000042608302,0.9960587,0.000025425614,0.000051041538,0.00004942291,0.00043433392],"about_ca_topic_score_codex":0.000010098985,"about_ca_topic_score_gemma":0.0000014501379,"teacher_disagreement_score":0.99445796,"about_ca_system_score_codex":0.00021550617,"about_ca_system_score_gemma":0.00016295756,"threshold_uncertainty_score":0.9999419},"labels":[],"label_agreement":null},{"id":"W1831628916","doi":"","title":"A Survey on multi-robot systems","year":2012,"lang":"en","type":"article","venue":"World Automation Congress","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Computer science; Task (project management); Sensor fusion; Focus (optics); Robot control; Human–computer interaction; Mobile robot; Artificial intelligence; Robot kinematics; State (computer science); Control engineering; Engineering; Systems engineering","score_opus":0.052299954646430016,"score_gpt":0.2929430019576612,"score_spread":0.2406430473112312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1831628916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011141198,0.0010050593,0.9594127,0.00062949135,0.019614113,0.001556741,0.00015713632,0.0022136085,0.0042699687],"genre_scores_gemma":[0.99350893,0.0000012745409,0.0013152579,0.0001626282,0.00019552786,0.000108979104,0.00007160035,0.000018918725,0.004616862],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974062,0.0006155526,0.00049976923,0.00037575318,0.0005420878,0.00056067365],"domain_scores_gemma":[0.9979176,0.0004306161,0.0003406521,0.00086228555,0.00021176628,0.00023710488],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001386556,0.0002451773,0.00031957324,0.00030118815,0.0001671524,0.0004761292,0.00086488953,0.000072652336,0.000017494396],"category_scores_gemma":[0.0002112821,0.00022374705,0.000075451826,0.00074517034,0.000031547574,0.00095064926,0.00012284603,0.00014673767,0.0013364315],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091971866,0.0034059759,0.35900128,0.00044847102,0.00076239964,0.00007274087,0.0034053968,0.029776111,0.0028187903,0.3482784,0.15135472,0.100583754],"study_design_scores_gemma":[0.00094727904,0.000018568066,0.45034188,0.00010663037,0.000007032919,0.000005306295,0.000012131617,0.5325589,0.00020912489,0.0000037764546,0.015476929,0.00031243486],"about_ca_topic_score_codex":0.00032718733,"about_ca_topic_score_gemma":0.0001922919,"teacher_disagreement_score":0.98236775,"about_ca_system_score_codex":0.00016413195,"about_ca_system_score_gemma":0.00004564797,"threshold_uncertainty_score":0.99944115},"labels":[],"label_agreement":null},{"id":"W1861432007","doi":"10.23919/ecc.2013.6669512","title":"Distributed estimation and control for large population stochastic multi-agent systems with coupling in the measurements","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Linear-quadratic-Gaussian control; Control theory (sociology); Kalman filter; Computer science; Population; State (computer science); Gaussian; Exponential stability; Stability (learning theory); Controller (irrigation); Linear system; Quadratic equation; Exponential function; Coupling (piping); Mathematical optimization; Mathematics; Nonlinear system; Optimal control; Control (management); Algorithm; Engineering; Artificial intelligence; Machine learning","score_opus":0.034316619571306536,"score_gpt":0.25863000807407033,"score_spread":0.22431338850276378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1861432007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030341564,0.000096002055,0.96524304,0.00035173303,0.0001749709,0.0036396917,0.000048871683,0.00009896517,0.000005187259],"genre_scores_gemma":[0.9948259,2.43627e-7,0.0038867076,0.00007276767,0.000022683884,0.0010621824,0.00010668343,0.000009852694,0.00001299769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834615,0.00009280709,0.00040710144,0.000357812,0.00042508577,0.0003710658],"domain_scores_gemma":[0.9989217,0.00022366468,0.00019582258,0.00037031533,0.00021543198,0.00007305439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009921219,0.00018486714,0.00024714373,0.00007862819,0.00017447882,0.0005442594,0.00038573297,0.000058919162,0.000001366086],"category_scores_gemma":[0.00014019893,0.00011707665,0.000030728643,0.00022682121,0.000011608474,0.0006116338,0.000030127656,0.00007474047,0.000011838881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223765,0.000523846,0.057162054,0.0002118033,0.00016663526,0.0000038060832,0.0006916427,0.91905004,0.0007224063,0.01954195,0.00035519435,0.0015084117],"study_design_scores_gemma":[0.004011765,0.0000611093,0.066070475,0.000064215,0.000020083082,0.0000057560305,0.00015623876,0.92940116,0.000004585998,0.000049103714,0.000011027813,0.00014448958],"about_ca_topic_score_codex":0.000717844,"about_ca_topic_score_gemma":0.00013321471,"teacher_disagreement_score":0.96448433,"about_ca_system_score_codex":0.00011838624,"about_ca_system_score_gemma":0.000022152217,"threshold_uncertainty_score":0.5248306},"labels":[],"label_agreement":null},{"id":"W1897703775","doi":"10.1109/cca.2015.7320674","title":"Distributed coordination of linear second-order multi-agent systems with communication constraints","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Computer science; Double integrator; Interconnection; Network packet; Control theory (sociology); Distributed computing; Process (computing); Multi-agent system; Telecommunications network; Control (management); Integrator; State (computer science); Graph; Graph theory; Topology (electrical circuits); Mathematics; Computer network; Theoretical computer science; Bandwidth (computing); Algorithm","score_opus":0.03934068674205789,"score_gpt":0.2651706161573149,"score_spread":0.22582992941525704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1897703775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008089073,0.00020872075,0.98803467,0.00040871944,0.00029221998,0.0007714904,0.00013327434,0.00025608682,0.0018057374],"genre_scores_gemma":[0.9668337,0.0000020219109,0.032198012,0.000038604423,0.000019246834,0.00006639497,0.00021658381,0.000013212733,0.000612237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997897,0.00030960276,0.00060872716,0.00036430292,0.00052403647,0.00029629888],"domain_scores_gemma":[0.9966927,0.00012526909,0.00044822882,0.0011637324,0.0013470742,0.00022299269],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008451507,0.00021780207,0.00037663203,0.00011484853,0.000090972746,0.0001413269,0.0010731751,0.00010776514,0.000019582501],"category_scores_gemma":[0.00015691244,0.00017657755,0.000049199454,0.0006308494,0.00016566542,0.0005881219,0.0001913829,0.0001386272,0.0000699362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005376945,0.0074944627,0.07495471,0.0014408104,0.0029736082,0.00018039846,0.013438277,0.13695842,0.017817432,0.64758015,0.06841243,0.02821163],"study_design_scores_gemma":[0.005089005,0.00019214531,0.0024871004,0.00012741979,0.000027033906,0.000053548378,0.0011516738,0.98323673,0.0011071841,0.000039210234,0.0061151334,0.0003737886],"about_ca_topic_score_codex":0.00029590382,"about_ca_topic_score_gemma":0.00008804448,"teacher_disagreement_score":0.95874465,"about_ca_system_score_codex":0.00016897713,"about_ca_system_score_gemma":0.00023892324,"threshold_uncertainty_score":0.7200623},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.027109591299700583,"score_gpt":0.2610352928422551,"score_spread":0.2339257015425545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1902963647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3377146,0.0004409161,0.6581589,0.0024553624,0.00072218524,0.00033570177,0.000104092025,0.000007515935,0.000060683353],"genre_scores_gemma":[0.99624133,0.00001778453,0.0033865797,0.00013034735,0.00020195756,0.000005668795,0.0000042876227,0.0000046396917,0.000007376446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976624,0.00023387492,0.0009275188,0.00012079539,0.00090302416,0.00015234754],"domain_scores_gemma":[0.9968516,0.0006274519,0.0009611408,0.00019391677,0.001280111,0.00008577165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014914103,0.00012561223,0.00036827655,0.00021335737,0.000019424815,0.00006502901,0.0011710011,0.00006093577,0.0000018347994],"category_scores_gemma":[0.0008163159,0.000084094,0.00012279853,0.00013775787,0.00005678797,0.00082447217,0.000048184535,0.0001787344,0.0000018244475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014507984,0.005501194,0.21334001,0.00035026224,0.0033282754,0.0010761437,0.034644607,0.5005342,0.059992842,0.016218845,0.0039897184,0.14651594],"study_design_scores_gemma":[0.01273852,0.0002456621,0.005096205,0.00014756573,0.000026556701,0.00017252336,0.00048002254,0.9791465,0.00062317186,0.000118925724,0.0011100104,0.00009436741],"about_ca_topic_score_codex":0.00006357535,"about_ca_topic_score_gemma":0.000035038276,"teacher_disagreement_score":0.6585267,"about_ca_system_score_codex":0.00004843745,"about_ca_system_score_gemma":0.00013506108,"threshold_uncertainty_score":0.34292537},"labels":[],"label_agreement":null},{"id":"W192747414","doi":"10.22215/etd/2009-06308","title":"Analysis and design of swarm-based robots using game theory","year":2009,"lang":"en","type":"dissertation","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Library and Archives Canada","funders":"","keywords":"Computer science; Game theory; Humanities; Artificial intelligence; Engineering; Mathematics; Art; Mathematical economics","score_opus":0.024432023126255458,"score_gpt":0.2745481256284227,"score_spread":0.2501161025021672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W192747414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062440885,0.00044626804,0.99198896,0.000014030876,0.00017093681,0.0003730621,0.0000087933395,0.000097262055,0.0006565779],"genre_scores_gemma":[0.9492021,0.0000079132205,0.049547695,0.000064963984,0.000025364623,0.000012007461,0.0001874635,0.00001584325,0.0009366533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979098,0.0003531037,0.0005210403,0.0005514478,0.00041268475,0.00025195561],"domain_scores_gemma":[0.9982152,0.00026184754,0.000516078,0.0006839287,0.00022884952,0.00009410972],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069345563,0.0002884238,0.00068647886,0.0006567764,0.00005041863,0.0001567003,0.000686003,0.00022058081,0.000011822598],"category_scores_gemma":[0.00006917193,0.00026106118,0.00022600411,0.0010848128,0.000020799489,0.00019391411,0.000021391306,0.00011954736,0.0000043453297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022373705,0.00031028275,0.00083390967,0.00029284562,0.0025928544,0.000045834833,0.0008472709,0.9028392,0.010851185,0.013264807,0.00009286726,0.06780523],"study_design_scores_gemma":[0.00047802157,0.000054421733,0.00653093,0.00009048926,0.00078794797,0.000001117923,0.00006806476,0.98595685,0.0051237363,0.00058300165,0.0000060897187,0.00031931727],"about_ca_topic_score_codex":0.00019194328,"about_ca_topic_score_gemma":0.000060537714,"teacher_disagreement_score":0.942958,"about_ca_system_score_codex":0.000053540232,"about_ca_system_score_gemma":0.0001979023,"threshold_uncertainty_score":0.99998415},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03176414544123482,"score_gpt":0.2898487418791277,"score_spread":0.25808459643789283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933691875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018501526,0.00042920708,0.9927675,0.004282858,0.00017368904,0.00040477837,0.0000019378422,0.000013953125,0.00007590518],"genre_scores_gemma":[0.964953,0.000014708823,0.034400553,0.00022174323,0.0001763959,0.00001792687,0.0000010190232,0.0000067521655,0.00020786836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989257,0.00012870073,0.00039463767,0.00014492049,0.00020029767,0.00020573102],"domain_scores_gemma":[0.99864286,0.00042431464,0.00012620018,0.00016415618,0.00047565432,0.00016681456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008383115,0.00009656016,0.00027508487,0.0001216318,0.00006649092,0.00012907662,0.00038106283,0.00008939178,5.2479174e-7],"category_scores_gemma":[0.00036180834,0.000083917694,0.000052881936,0.00015753544,0.000021185879,0.0002598741,0.000053913518,0.0003607001,0.0000021797896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065532404,0.00009985708,0.005915635,0.00002492359,0.000055275552,0.000026456863,0.001456437,0.9759135,0.00072312215,0.00699561,0.0014525473,0.007271092],"study_design_scores_gemma":[0.003512352,0.0004894771,0.0004916867,0.000045966495,0.000016061682,0.000060356982,0.00030737525,0.99139607,0.00023650326,0.00010031531,0.0032220338,0.000121810524],"about_ca_topic_score_codex":0.000027386466,"about_ca_topic_score_gemma":0.000025675712,"teacher_disagreement_score":0.9631029,"about_ca_system_score_codex":0.00008700381,"about_ca_system_score_gemma":0.00019939894,"threshold_uncertainty_score":0.34220642},"labels":[],"label_agreement":null},{"id":"W1934455175","doi":"10.1002/acs.2353","title":"Adaptive range‐measurement‐based target pursuit","year":2012,"lang":"en","type":"article","venue":"International Journal of Adaptive Control and Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Adaptive control; Identifier; Motion control; Computer science; Controller (irrigation); Artificial intelligence; Robot; Control (management)","score_opus":0.03502300733819845,"score_gpt":0.25576985631919863,"score_spread":0.22074684898100017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1934455175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011926456,0.006243963,0.989574,0.0014651997,0.00072861847,0.00016075067,0.000018866178,0.000032514243,0.0005834096],"genre_scores_gemma":[0.98761487,0.00000561308,0.010855523,0.00063577003,0.0008438351,0.000009207628,0.0000011189592,0.000012943793,0.000021089967],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99686146,0.00020487567,0.00065002986,0.00021718198,0.0016834524,0.0003830029],"domain_scores_gemma":[0.99618286,0.00014006539,0.0008587677,0.000101002064,0.0024366253,0.00028066352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001822387,0.00023357048,0.0003859036,0.00027538635,0.00012532431,0.0003956796,0.0010064702,0.00007461215,0.000018341821],"category_scores_gemma":[0.00013556112,0.00019084803,0.00016898783,0.00014953004,0.00007839127,0.0021204208,0.00007426058,0.00028571833,0.000009235759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005709383,0.0024930174,0.031194579,0.00010932803,0.0040137917,0.0007501052,0.0043400447,0.010833777,0.07480941,0.030046307,0.0030629323,0.8326373],"study_design_scores_gemma":[0.018164475,0.0009963013,0.031239172,0.001036683,0.00020636083,0.0005422114,0.00059405575,0.9335972,0.0021629208,0.00324038,0.007316878,0.00090333313],"about_ca_topic_score_codex":0.000010202814,"about_ca_topic_score_gemma":0.0000012345173,"teacher_disagreement_score":0.98642224,"about_ca_system_score_codex":0.00023729597,"about_ca_system_score_gemma":0.0003249502,"threshold_uncertainty_score":0.7782557},"labels":[],"label_agreement":null},{"id":"W1935330946","doi":"10.48550/arxiv.1506.05713","title":"Destructive nodes in multi-agent controllability","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Controllability; Computer science; Business; Distributed computing; Mathematics; Applied mathematics","score_opus":0.13099692010393088,"score_gpt":0.2168421006967643,"score_spread":0.08584518059283341,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1935330946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34966832,0.00014700441,0.64680415,0.000085389154,0.00095024734,0.0009775565,0.00008760289,0.00031244426,0.00096730463],"genre_scores_gemma":[0.99764544,0.00002124969,0.0017238483,0.000048546703,0.000054408323,0.000009006526,0.000033693057,0.000024220115,0.00043958437],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99585193,0.0007148726,0.0005309391,0.0019837231,0.00021895581,0.00069959735],"domain_scores_gemma":[0.9960703,0.00019884064,0.0004968448,0.0022771796,0.00056666834,0.0003901709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010271962,0.0005734807,0.00088353734,0.00039555426,0.000096956726,0.00022528665,0.0028307363,0.00050207396,0.000011916272],"category_scores_gemma":[0.00029355835,0.00065628806,0.00030827854,0.00082864333,0.00018376378,0.0005962188,0.002434231,0.0008373444,0.00018384798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024320392,0.00094848307,0.10634283,0.00021237088,0.00039409185,0.0016052385,0.0010928237,0.77914023,0.00022297229,0.10832136,0.00038681144,0.0010896025],"study_design_scores_gemma":[0.0046544704,0.000037786045,0.030340994,0.00012161379,0.000059934184,0.000006374921,0.00027174904,0.9477233,0.00006268954,0.015781133,0.0001711373,0.00076880277],"about_ca_topic_score_codex":0.0012108195,"about_ca_topic_score_gemma":0.0005018262,"teacher_disagreement_score":0.6479771,"about_ca_system_score_codex":0.0016292352,"about_ca_system_score_gemma":0.0006551923,"threshold_uncertainty_score":0.99958885},"labels":[],"label_agreement":null},{"id":"W1964922145","doi":"10.1016/s0005-1098(02)00076-6","title":"Stabilization with control networks","year":2002,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Simple (philosophy); Measure (data warehouse); Class (philosophy); Control theory (sociology); Control (management); Computer science; Transmission (telecommunications); Networked control system; Control engineering; Engineering; Artificial intelligence; Telecommunications","score_opus":0.008462744270786882,"score_gpt":0.17499610803684193,"score_spread":0.16653336376605504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964922145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015748783,0.00012337338,0.9921063,0.0011002265,0.00016592485,0.00036778348,0.000002593492,0.0006583371,0.0039005582],"genre_scores_gemma":[0.9935432,0.000002448616,0.005831189,0.0003141146,0.0000470341,0.000052944357,0.0000029844346,0.000010677629,0.00019537687],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987861,0.000106254345,0.00024941514,0.0002650902,0.00029179928,0.00030134578],"domain_scores_gemma":[0.99893504,0.00014880847,0.00011546225,0.00061877683,0.00008319609,0.00009873943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017938502,0.00013249862,0.00019340204,0.000046864363,0.00008914071,0.00020074433,0.0005185266,0.000051817206,0.00009112618],"category_scores_gemma":[0.000049285194,0.00010310951,0.000036024707,0.00035207949,0.00003166651,0.0003899105,0.000035629513,0.00007220669,0.00025493477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048141228,0.0016484275,0.022233674,0.00024285587,0.0008600848,0.00031910045,0.004455989,0.16524018,0.0008005356,0.49352446,0.05771539,0.25291115],"study_design_scores_gemma":[0.0010193508,0.0000702768,0.002598337,0.00002570572,0.000012588111,0.0000150830565,0.000008333064,0.9944007,0.000012448751,0.00011007314,0.0015879737,0.00013915692],"about_ca_topic_score_codex":0.000006444669,"about_ca_topic_score_gemma":0.000004442905,"teacher_disagreement_score":0.99196833,"about_ca_system_score_codex":0.0000430758,"about_ca_system_score_gemma":0.000012162528,"threshold_uncertainty_score":0.4204684},"labels":[],"label_agreement":null},{"id":"W1964979624","doi":"10.1007/s11036-009-0187-0","title":"A Fast Formation Flocking Scheme for a Group of Interactive Distributed Mobile Nodes in Autonomous Networks","year":2009,"lang":"en","type":"article","venue":"Mobile Networks and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Flocking (texture); Computer science; Distributed computing; Computer network; Scheme (mathematics); Swarm behaviour; Node (physics); Scalability; Communication in small groups; Topology (electrical circuits); Artificial intelligence; Mathematics","score_opus":0.007218675751999588,"score_gpt":0.24383676532577747,"score_spread":0.2366180895737779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964979624","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006689245,0.0007554058,0.98982704,0.000058541707,0.00005964699,0.002383562,0.00005832014,0.000103155915,0.000065069726],"genre_scores_gemma":[0.99228734,0.00005549158,0.0024812694,0.000056664696,0.00012306293,0.0046984283,0.00028256702,0.000008476417,0.0000067005844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986432,0.000039619987,0.00051504164,0.00037173164,0.00010136545,0.00032901464],"domain_scores_gemma":[0.99892956,0.00018497405,0.00028766168,0.00040301477,0.00011537591,0.00007943157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002494588,0.00017259279,0.0002929898,0.000087424385,0.00014291822,0.00013274669,0.00039951073,0.00010778979,0.0000013454096],"category_scores_gemma":[0.000008139121,0.00017319169,0.000079838195,0.0005367629,0.00003370664,0.00047032954,0.00008023837,0.00014728475,0.00000103544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025368163,0.000311016,0.00030541007,0.000024360777,0.000021373024,6.3077505e-7,0.00014935045,0.74773794,0.00035617358,0.014200245,0.00019542905,0.23667268],"study_design_scores_gemma":[0.00076532917,0.000125456,0.0020905144,0.00006463856,0.0000097088605,0.0000049351233,0.00013400549,0.9915862,0.000050452574,0.00037110248,0.004633132,0.00016453343],"about_ca_topic_score_codex":0.0000188252,"about_ca_topic_score_gemma":0.00001712114,"teacher_disagreement_score":0.98734576,"about_ca_system_score_codex":0.000094557625,"about_ca_system_score_gemma":0.000017076327,"threshold_uncertainty_score":0.7062552},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02388290693635011,"score_gpt":0.23471466733138482,"score_spread":0.2108317603950347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965940578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009193292,0.00013758012,0.98704094,0.0006311689,0.0014887658,0.0007477165,0.00040441283,0.00021598495,0.00014015725],"genre_scores_gemma":[0.9993563,0.000014803399,0.00016729879,0.00006535154,0.0001671202,0.00012253755,0.000032514483,0.000017345485,0.000056674944],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975096,0.0002549237,0.00067250803,0.00027936097,0.00050132565,0.0007822652],"domain_scores_gemma":[0.9983137,0.0002741609,0.00034339295,0.00062231213,0.00021953197,0.00022686363],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005245905,0.0002579126,0.00038601604,0.00021238188,0.00027127686,0.0000804266,0.00061012025,0.00030617812,0.000030184998],"category_scores_gemma":[0.000039912604,0.0002582558,0.00022682488,0.00086335954,0.000052838826,0.0011333323,0.0000029211478,0.0005808197,0.00008421989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017016489,0.010133823,0.0014064034,0.00014715648,0.0033533964,0.000013768726,0.0033280563,0.34746394,0.10009815,0.1752505,0.009162975,0.3479402],"study_design_scores_gemma":[0.020688167,0.0015403976,0.000560272,0.0001377232,0.00055484247,0.0000639744,0.0002117503,0.47866008,0.46829027,0.0005982901,0.027290408,0.0014038368],"about_ca_topic_score_codex":0.000042212163,"about_ca_topic_score_gemma":0.000013254634,"teacher_disagreement_score":0.9901631,"about_ca_system_score_codex":0.00046129635,"about_ca_system_score_gemma":0.00024139513,"threshold_uncertainty_score":0.99998695},"labels":[],"label_agreement":null},{"id":"W1966027056","doi":"10.1109/camsap.2013.6714015","title":"Performance comparison of randomized gossip, broadcast gossip and collection tree protocol for distributed averaging","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Gossip protocol; Computer science; Computer network; Latency (audio); Tree (set theory); Broadcasting (networking); Protocol (science); Overhead (engineering); Wireless sensor network; Distributed computing; Telecommunications; Mathematics","score_opus":0.02473046595666882,"score_gpt":0.2909758156409003,"score_spread":0.26624534968423147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966027056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010970792,0.000011711102,0.8375471,0.00030527337,0.00014408046,0.14954852,0.000013666298,0.00018861948,0.0012702133],"genre_scores_gemma":[0.7542424,6.2278906e-7,0.0068479152,0.000020631422,0.00003721431,0.23834226,0.000015556587,0.000010297713,0.00048306776],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978097,0.00017750746,0.0008959753,0.00042739016,0.0003119065,0.0003775383],"domain_scores_gemma":[0.9981578,0.00043336125,0.0004912129,0.00041906576,0.00037189087,0.00012665194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000723963,0.00023908085,0.0008717045,0.00012324388,0.00023650829,0.00033592677,0.00047432136,0.00009083429,0.000028838618],"category_scores_gemma":[0.0001796455,0.0001855237,0.00016112524,0.00038788674,0.000110015964,0.00077631813,0.00012517854,0.00009929644,0.000016440936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03910176,0.002936007,0.0669508,0.0039743152,0.0014957496,0.000003935515,0.0071443277,0.0053888247,0.031065093,0.026378993,0.09482246,0.72073776],"study_design_scores_gemma":[0.09691807,0.00013559648,0.0023064762,0.000079388126,0.000017669869,0.0000049855907,0.000061659586,0.8939238,0.004569302,0.00012939972,0.0016500448,0.00020360675],"about_ca_topic_score_codex":0.00018542401,"about_ca_topic_score_gemma":0.000012816288,"teacher_disagreement_score":0.88853496,"about_ca_system_score_codex":0.00007999282,"about_ca_system_score_gemma":0.00007341125,"threshold_uncertainty_score":0.7565437},"labels":[],"label_agreement":null},{"id":"W1966589386","doi":"10.1109/cdc.2011.6160852","title":"Structural controllability of multi-agent systems subject to simultaneous failure of links and agents","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Controllability; Network controllability; Computer science; Graph; Multi-agent system; Information flow; Graph theory; Mathematical optimization; Joint (building); Reliability (semiconductor); Distributed computing; Theoretical computer science; Topology (electrical circuits); Mathematics; Artificial intelligence; Applied mathematics; Engineering; Combinatorics","score_opus":0.03451076999042861,"score_gpt":0.2510368361942041,"score_spread":0.21652606620377546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966589386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7673551,0.00020314359,0.22970511,0.0000710492,0.0006528654,0.001503371,0.000096886164,0.00013312566,0.00027936432],"genre_scores_gemma":[0.9917455,0.0000016787878,0.007973987,0.00004366345,0.000023492848,0.0000274578,0.0000036267465,0.000012465258,0.000168171],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974217,0.00024218389,0.0008936893,0.0005928232,0.00045129683,0.000398337],"domain_scores_gemma":[0.997617,0.00027690828,0.00036844978,0.0009856473,0.0004789672,0.00027300618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000517371,0.0002781785,0.0007077364,0.00013877703,0.000056390207,0.00006304435,0.0009734272,0.00020109689,0.000022831095],"category_scores_gemma":[0.00035111472,0.00022314998,0.000121333884,0.00033713962,0.00009041743,0.00023207632,0.0003127693,0.00015522592,0.000015778072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016777023,0.0028671012,0.45213857,0.0044551063,0.003304194,0.00048131455,0.052708194,0.046895754,0.3152516,0.079548754,0.0018806898,0.038791046],"study_design_scores_gemma":[0.0037907152,0.0005163064,0.033143725,0.0001039078,0.000052583797,0.000037165726,0.0006520779,0.9521592,0.008769062,0.00006474827,0.000224099,0.00048638097],"about_ca_topic_score_codex":0.001392827,"about_ca_topic_score_gemma":0.00016669628,"teacher_disagreement_score":0.9052635,"about_ca_system_score_codex":0.00006361071,"about_ca_system_score_gemma":0.00006246059,"threshold_uncertainty_score":0.9099792},"labels":[],"label_agreement":null},{"id":"W1966982017","doi":"10.1109/icinfa.2013.6720510","title":"A PSO-based approach with fuzzy obstacle avoidance for cooperative multi-robots in unknown environments","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Obstacle avoidance; Robot; Trajectory; Computer science; Fuzzy logic; Smoothness; Obstacle; Artificial intelligence; Motion planning; Task (project management); Collision avoidance; Mobile robot; Field (mathematics); Robotics; Engineering; Mathematics","score_opus":0.02046367764787351,"score_gpt":0.2246264017097004,"score_spread":0.2041627240618269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966982017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010433129,0.0000620394,0.98526293,0.0003758011,0.00009550836,0.0024447155,0.000014353633,0.00011571208,0.0011957975],"genre_scores_gemma":[0.82039857,7.795373e-7,0.17571038,0.0003396325,0.000017707138,0.0014394057,0.000025618967,0.000018681229,0.0020492396],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789035,0.00013098112,0.00036509123,0.0007443094,0.0003114813,0.0005577812],"domain_scores_gemma":[0.99879724,0.00014546806,0.00013088979,0.00069384906,0.00007640388,0.0001561775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024131135,0.0002846452,0.00033669212,0.00009707879,0.00010968937,0.00024273104,0.00085213553,0.000088428475,0.000013769056],"category_scores_gemma":[0.00004003149,0.00021627682,0.000060021168,0.00034901634,0.00007139043,0.0007455247,0.000089225345,0.00013479363,0.00016002348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003455909,0.009333683,0.03279888,0.0004180484,0.00049799756,0.00006743541,0.004833585,0.76842725,0.047426894,0.0860019,0.006437256,0.043411497],"study_design_scores_gemma":[0.0058193705,0.000174271,0.00888935,0.00003778043,0.000005666427,0.0000033864856,0.00010925918,0.98112965,0.002090447,0.00003519622,0.0013186154,0.0003870177],"about_ca_topic_score_codex":0.0002632453,"about_ca_topic_score_gemma":0.000104809464,"teacher_disagreement_score":0.80996543,"about_ca_system_score_codex":0.00016714216,"about_ca_system_score_gemma":0.00008654611,"threshold_uncertainty_score":0.8819513},"labels":[],"label_agreement":null},{"id":"W1967052305","doi":"10.1080/00207721.2012.669869","title":"Backstepping-based synchronisation of uncertain networked Lagrangian systems","year":2012,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Division of Emerging Frontiers in Research and Innovation; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Backstepping; Convergence (economics); Control theory (sociology); Integrator; Network topology; Lagrangian; Spanning tree; Computer science; Mathematical optimization; Consensus; Multi-agent system; Mathematics; Adaptive control; Control (management); Applied mathematics","score_opus":0.022431259667614587,"score_gpt":0.2815673897711038,"score_spread":0.2591361301034892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967052305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398102,0.002614475,0.9259812,0.00068333617,0.028799294,0.00042757366,0.000021271528,0.000055353477,0.0016072784],"genre_scores_gemma":[0.99738145,0.000007705535,0.0013066474,0.0000434237,0.0011893088,0.000009414829,0.0000025347338,0.000009282159,0.00005024902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995097,0.0002457271,0.0012979773,0.00025454507,0.00260952,0.00049523724],"domain_scores_gemma":[0.9946386,0.0002699682,0.0019265419,0.0004479179,0.0024129776,0.00030395176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048601534,0.00019166498,0.00041086713,0.0006825175,0.000116981966,0.00054158387,0.0034301684,0.000077211895,0.000004331272],"category_scores_gemma":[0.00033899496,0.00015930877,0.00016199662,0.00088318577,0.00023361956,0.002539382,0.00014326039,0.0001682949,0.00002559165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016146888,0.00091655157,0.05461929,0.0003623253,0.0006242831,0.00013902788,0.0025104065,0.6917425,0.06527577,0.1686863,0.0052821226,0.009679983],"study_design_scores_gemma":[0.002519235,0.00023065736,0.008416804,0.0018009804,0.000042655003,0.00073763286,0.0008929711,0.9651422,0.0019414125,0.000051142553,0.01774694,0.00047739447],"about_ca_topic_score_codex":0.00023882059,"about_ca_topic_score_gemma":0.0000019428348,"teacher_disagreement_score":0.9575712,"about_ca_system_score_codex":0.00069418404,"about_ca_system_score_gemma":0.000685894,"threshold_uncertainty_score":0.6496423},"labels":[],"label_agreement":null},{"id":"W1967389814","doi":"10.1109/tac.2013.2251792","title":"Connectivity Preservation in Nonholonomic Multi-Agent Systems: A Bounded Distributed Control Strategy","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Multi-agent system; Strongly connected component; Controller (irrigation); Enhanced Data Rates for GSM Evolution; Nonholonomic system; Control theory (sociology); Computer science; Position (finance); Range (aeronautics); Zero (linguistics); Decentralised system; Topology (electrical circuits); Control (management); Mathematics; Mobile robot; Robot; Engineering; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.022131207570942356,"score_gpt":0.2453130023142056,"score_spread":0.22318179474326325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967389814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10662129,0.00008245251,0.8854326,0.0008225095,0.0012274696,0.004589276,0.0003380475,0.00082888146,0.000057455345],"genre_scores_gemma":[0.99564534,0.000003608331,0.00066084083,0.00022126248,0.000042408108,0.0032180925,0.00001668426,0.000040097333,0.00015164693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951946,0.0009488501,0.0013823366,0.0009460315,0.00060468493,0.0009235003],"domain_scores_gemma":[0.9965433,0.00096919085,0.00051153626,0.0013537734,0.0003007721,0.00032141214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009218159,0.00057334045,0.00100441,0.00044579737,0.00028410484,0.00092956127,0.0011381038,0.00028302128,0.00010336338],"category_scores_gemma":[0.00008398594,0.00055869506,0.0002868653,0.0007183296,0.000086797685,0.0018936101,0.00000560698,0.0004072864,0.0007041299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019671007,0.0043611843,0.0011908014,0.00040708392,0.0012055456,0.00013051779,0.00079947594,0.9265773,0.012389413,0.0033620438,0.00076569716,0.048614193],"study_design_scores_gemma":[0.01332436,0.00022281166,0.016649231,0.00013801192,0.000070792856,0.000029335046,0.00010114627,0.9685621,0.00017578877,0.00013583803,0.000087692846,0.0005028458],"about_ca_topic_score_codex":0.0024326271,"about_ca_topic_score_gemma":0.00042835771,"teacher_disagreement_score":0.8890241,"about_ca_system_score_codex":0.00085125247,"about_ca_system_score_gemma":0.00027126964,"threshold_uncertainty_score":0.9996865},"labels":[],"label_agreement":null},{"id":"W1971952804","doi":"10.1002/rnc.2846","title":"Corrections to: ‘Distributed consensus control for multi‐agent systems using terminal sliding mode and Chebyshev neural networks’","year":2012,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Artificial neural network; Terminal (telecommunication); Computer science; Consensus; Terminal sliding mode; Mode (computer interface); Control (management); Chebyshev filter; Sliding mode control; Multi-agent system; Artificial intelligence; Nonlinear system; Computer network; Physics","score_opus":0.05010921817918933,"score_gpt":0.3105438471899489,"score_spread":0.26043462901075953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971952804","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10209177,0.0011583084,0.8899739,0.00075537484,0.005105071,0.00053780223,0.0003436353,0.000030839976,0.0000033026904],"genre_scores_gemma":[0.97991914,0.000012531115,0.018027727,0.00024600563,0.001720957,0.0000205267,0.000012279175,0.000018047951,0.000022790058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979029,0.00016578825,0.00082006847,0.0002502679,0.00040849153,0.00045246727],"domain_scores_gemma":[0.9973274,0.0004891493,0.0006129741,0.00016144308,0.0009952679,0.00041378688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091277465,0.00024856106,0.0005039062,0.00024025347,0.0001817665,0.0004342412,0.0004896691,0.000105873456,0.0000015482685],"category_scores_gemma":[0.0003674607,0.00022138264,0.00016535865,0.00012413254,0.000041400075,0.00048747816,0.000079976795,0.00022843957,0.0000011123957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011667508,0.0004696591,0.03842268,0.000045129786,0.0013380916,0.00014579877,0.00044937764,0.9418881,0.0054139597,0.001788923,0.0006043724,0.008267147],"study_design_scores_gemma":[0.006577209,0.00012649932,0.0019322676,0.00010678821,0.00012303931,0.0012374995,0.0001351103,0.98854125,0.000029898252,0.000004534935,0.0009728669,0.00021301581],"about_ca_topic_score_codex":0.000060887603,"about_ca_topic_score_gemma":0.0000071362815,"teacher_disagreement_score":0.87782735,"about_ca_system_score_codex":0.00017169767,"about_ca_system_score_gemma":0.00007496199,"threshold_uncertainty_score":0.9027722},"labels":[],"label_agreement":null},{"id":"W1972020554","doi":"10.1109/cdc.2008.4738760","title":"Stabilization of infinitesimally rigid formations of multi-robot networks","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":93,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Infinitesimal; Rigidity (electromagnetism); Robot; Control theory (sociology); Manifold (fluid mechanics); Graph; Stability (learning theory); Mathematics; Computer science; Topology (electrical circuits); Control (management); Mathematical analysis; Artificial intelligence; Physics; Engineering; Combinatorics","score_opus":0.03689090484723105,"score_gpt":0.24115940572628036,"score_spread":0.2042685008790493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972020554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010548527,0.000060760638,0.986905,0.000057247973,0.00012150633,0.00026912696,0.000009764864,0.00009933321,0.001928754],"genre_scores_gemma":[0.9596076,0.000013861601,0.04018899,0.00003481664,0.0000089244895,0.000012382584,0.000018565297,0.000004947563,0.00010992399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987713,0.00006249432,0.00058014574,0.00016000794,0.00024773748,0.00017832364],"domain_scores_gemma":[0.9986895,0.000117665106,0.0002997999,0.00048869045,0.00034744132,0.000056915345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020257464,0.00010092833,0.00021729208,0.00011154042,0.00006429471,0.000017206852,0.0005334108,0.00006081616,0.00001880901],"category_scores_gemma":[0.000092277005,0.000090979185,0.00007504645,0.0005279536,0.00005854043,0.0005923977,0.000098095756,0.000053120915,0.000011937959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032796666,0.001314742,0.08373165,0.00019041657,0.00018507264,0.000009129937,0.003467045,0.6984952,0.014084284,0.18707052,0.0014783511,0.009940806],"study_design_scores_gemma":[0.00078206084,0.000055481254,0.022167463,0.00001891709,0.000005356907,0.0000068171585,0.000030507561,0.97406435,0.0024131835,0.000040524825,0.0003104866,0.00010486454],"about_ca_topic_score_codex":0.00009204286,"about_ca_topic_score_gemma":0.00003520027,"teacher_disagreement_score":0.94905907,"about_ca_system_score_codex":0.000024578756,"about_ca_system_score_gemma":0.000076955,"threshold_uncertainty_score":0.37100235},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03176602887918567,"score_gpt":0.2648428637459382,"score_spread":0.2330768348667525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973184571","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4887887,0.0042844024,0.44510052,0.039871268,0.0034458484,0.0036278323,0.000022054219,0.0007130928,0.01414629],"genre_scores_gemma":[0.992153,0.00023763913,0.00699707,0.0003285316,0.00006981861,0.00009788745,0.000008269644,0.000017333841,0.0000904449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665517,0.001175474,0.0009335923,0.00029599998,0.00037520533,0.00056456646],"domain_scores_gemma":[0.9956483,0.0011259787,0.00038087854,0.0021035613,0.0005226509,0.00021863382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079602,0.00022244289,0.0003375921,0.0005250554,0.0002802725,0.00043526405,0.0032468732,0.00014139735,0.000020435233],"category_scores_gemma":[0.00041973247,0.00021292492,0.000077740384,0.001926105,0.0000880147,0.00033569458,0.00020659727,0.0013565965,0.00014023343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006354103,0.0030334247,0.06990242,0.000016946584,0.00020165928,0.00016877963,0.0013618465,0.83423233,0.0017904297,0.025937311,0.038053524,0.025237761],"study_design_scores_gemma":[0.001447548,0.0000857874,0.13778919,0.00030273868,0.000007272983,0.00023342953,0.0000613052,0.85782486,0.000036158843,0.00082424295,0.0010950804,0.00029236623],"about_ca_topic_score_codex":0.00030763942,"about_ca_topic_score_gemma":0.0008206278,"teacher_disagreement_score":0.5033643,"about_ca_system_score_codex":0.0005368078,"about_ca_system_score_gemma":0.0002474555,"threshold_uncertainty_score":0.8682826},"labels":[],"label_agreement":null},{"id":"W1973780831","doi":"10.1115/imece2010-40740","title":"Distributed Cohesive Motion Control of Quadrotor Vehicle Formations","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Kinematics; Context (archaeology); Scheme (mathematics); Swarm behaviour; Computer science; Motion (physics); Vehicle dynamics; Set (abstract data type); Focus (optics); Control theory (sociology); Motion control; Control (management); Control engineering; Task (project management); Distributed computing; Engineering; Mathematics; Artificial intelligence; Robot; Aerospace engineering","score_opus":0.007999273727243657,"score_gpt":0.22204054784148952,"score_spread":0.21404127411424587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973780831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03823615,0.0000072918315,0.9583272,0.000926453,0.0004916501,0.0005991663,0.00019048265,0.00021680893,0.0010048223],"genre_scores_gemma":[0.9967957,3.2623953e-7,0.002874899,0.000085465734,0.000044429533,0.0000777686,0.000045706078,0.0000055190276,0.000070173366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987176,0.000066188026,0.00043562453,0.00022234765,0.0003006726,0.00025757693],"domain_scores_gemma":[0.99850786,0.00015539309,0.00023758736,0.00064982637,0.0003293222,0.00011999128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003151239,0.00012648446,0.00022627301,0.00007919179,0.00009461758,0.000097163924,0.0007197399,0.00009143851,0.000051986663],"category_scores_gemma":[0.0001866384,0.000110981804,0.000101918675,0.00031236775,0.00004700313,0.0007365193,0.00006520994,0.00014657204,0.00013246825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033388875,0.00053261046,0.013973627,0.000060502713,0.0001533633,0.00000789179,0.00046986845,0.0007529674,0.29314458,0.6723376,0.0036139535,0.01491965],"study_design_scores_gemma":[0.0035192596,0.00009858886,0.047992066,0.000015232528,0.000025925554,0.000014198265,0.000081057995,0.9144626,0.027612766,0.0013256336,0.004549055,0.00030357312],"about_ca_topic_score_codex":0.0001122277,"about_ca_topic_score_gemma":0.000049109047,"teacher_disagreement_score":0.9585596,"about_ca_system_score_codex":0.000029827137,"about_ca_system_score_gemma":0.000051982326,"threshold_uncertainty_score":0.45257068},"labels":[],"label_agreement":null},{"id":"W1975136088","doi":"10.1109/iccas.2013.6703867","title":"Adaptive formation control and target tracking in a class of multi-agent systems: Formation maneuvers","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Control reconfiguration; Computer science; Nonlinear system; Bounding overwatch; Multi-agent system; Fuzzy control system; Tracking (education); Adaptive control; Position (finance); Sliding mode control; Fuzzy logic; Control (management); Artificial intelligence","score_opus":0.02255028773333227,"score_gpt":0.2298317914836468,"score_spread":0.20728150375031454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975136088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032740764,0.00018517763,0.96455365,0.00022711181,0.0002092799,0.0014940652,0.000015071964,0.000091832,0.0004830677],"genre_scores_gemma":[0.99499214,0.0000057040597,0.0046860995,0.00006707047,0.000013065609,0.00017296393,0.0000088269935,0.0000064010464,0.000047709193],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830174,0.00019778518,0.00067779626,0.00023449116,0.00029712645,0.00029107125],"domain_scores_gemma":[0.9989589,0.0001086213,0.00035193766,0.00027988816,0.00021099728,0.00008966295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047412087,0.00016158157,0.0003121593,0.00021850495,0.000050225583,0.00019429318,0.00032593778,0.00008951354,0.0000051188467],"category_scores_gemma":[0.000045722143,0.00014123102,0.000048863356,0.00022797743,0.000025053243,0.0032274001,0.000058512767,0.000095786505,0.000043631648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044772995,0.0027837497,0.039704952,0.004764784,0.00092093693,0.00013175022,0.06331339,0.23403205,0.14420493,0.33753815,0.012218359,0.15993923],"study_design_scores_gemma":[0.002625949,0.000063397674,0.007996031,0.00008829055,0.0000058434675,0.000014452277,0.0014578215,0.98680824,0.0005868207,0.00006232483,0.00014529293,0.00014553129],"about_ca_topic_score_codex":0.0007874853,"about_ca_topic_score_gemma":0.000078106204,"teacher_disagreement_score":0.9622514,"about_ca_system_score_codex":0.0001674218,"about_ca_system_score_gemma":0.000024710998,"threshold_uncertainty_score":0.5759234},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014494879958319858,"score_gpt":0.24121035403549657,"score_spread":0.2267154740771767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975876533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00803429,0.0009683868,0.98659474,0.0010531186,0.0013657481,0.0015693946,0.000116733056,0.00026471275,0.000032856544],"genre_scores_gemma":[0.99835724,0.00004028961,0.00023511183,0.00007140147,0.00014627268,0.00075404317,0.00002367468,0.000023663111,0.00034828018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977695,0.00015609922,0.00040942105,0.00036792515,0.00033275833,0.00096433517],"domain_scores_gemma":[0.9987301,0.00023844514,0.000230497,0.00042840265,0.00016128557,0.00021122248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008037117,0.00028930823,0.00037447453,0.00014949906,0.00054798916,0.00031556992,0.00029809904,0.00016188092,0.000002183858],"category_scores_gemma":[0.0000147306355,0.0002785605,0.00013851257,0.00034386516,0.000027721322,0.0011451714,0.0000021661738,0.00022429106,0.00003655695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017693165,0.00497491,0.0033213708,0.0032998663,0.0044542695,0.000013386911,0.013765767,0.1739166,0.28122804,0.36724985,0.02289982,0.12310681],"study_design_scores_gemma":[0.0071484,0.0006105008,0.00038240248,0.00018096989,0.00018989533,0.00013553933,0.00059789105,0.9628199,0.0067670746,0.00008075249,0.020265859,0.0008208596],"about_ca_topic_score_codex":0.00009431782,"about_ca_topic_score_gemma":0.00005898569,"teacher_disagreement_score":0.99032295,"about_ca_system_score_codex":0.00049075973,"about_ca_system_score_gemma":0.00006974874,"threshold_uncertainty_score":0.9999667},"labels":[],"label_agreement":null},{"id":"W1975994434","doi":"10.1109/icra.2013.6630685","title":"Distributed coverage using geodesic metric for non-convex environments","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds National de la Recherche Luxembourg; Athens University of Economics and Business; Canadian Institute for Advanced Research","keywords":"Voronoi diagram; Geodesic; Weighted Voronoi diagram; Metric (unit); Convex hull; Computer science; Topology (electrical circuits); Euclidean distance; Mathematics; Regular polygon; Geometry; Combinatorics; Artificial intelligence; Engineering","score_opus":0.018884849879821686,"score_gpt":0.2340660598195961,"score_spread":0.2151812099397744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975994434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019400986,0.000053053944,0.97779024,0.00019784385,0.0004794862,0.0013963106,0.00007765994,0.00013367062,0.00047072527],"genre_scores_gemma":[0.9814717,0.0000030615743,0.017088693,0.0002652203,0.00006624165,0.00020167901,0.00007278737,0.000018998606,0.0008116001],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979278,0.000056929744,0.00043515002,0.00057625544,0.00038148416,0.00062237843],"domain_scores_gemma":[0.99854183,0.00020011565,0.0001893917,0.0007933154,0.00006239855,0.00021296028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026872507,0.00025625786,0.0003549975,0.000161698,0.00016836872,0.00040767292,0.0010376915,0.00010561197,0.00009908551],"category_scores_gemma":[0.00007225707,0.0002294721,0.0001555212,0.00054305466,0.000030932275,0.0010186555,0.00022615735,0.0000868599,0.0005480369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001349747,0.00434709,0.06540507,0.0007445807,0.00297575,0.00015491166,0.001179366,0.051760264,0.3958151,0.08053676,0.13401133,0.26293477],"study_design_scores_gemma":[0.0018209647,0.00006503153,0.012076609,0.000013475107,0.000023958994,0.000008086246,0.000017188586,0.9743281,0.0041332324,0.00057584146,0.0065497165,0.00038780316],"about_ca_topic_score_codex":0.00028507542,"about_ca_topic_score_gemma":0.0000016619821,"teacher_disagreement_score":0.9620707,"about_ca_system_score_codex":0.00023860238,"about_ca_system_score_gemma":0.000046181052,"threshold_uncertainty_score":0.9357601},"labels":[],"label_agreement":null},{"id":"W1976107231","doi":"10.1109/cdc.2012.6425817","title":"A continuous-time decentralized optimization scheme with positivity constraints","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Upper and lower bounds; Convergence (economics); Mathematical optimization; Scheme (mathematics); Computer science; Lyapunov function; Stability (learning theory); Function (biology); Dual (grammatical number); Optimization problem; Rate of convergence; Exponential stability; Mathematics","score_opus":0.007136010019964535,"score_gpt":0.20890704410008795,"score_spread":0.20177103408012342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976107231","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004890213,0.0000556176,0.9802368,0.00037424572,0.00016929791,0.00043046332,0.000011366337,0.0004262356,0.01340576],"genre_scores_gemma":[0.83666223,0.0000015450693,0.16263972,0.00020607107,0.000038488564,0.00002270619,0.000019836738,0.000010303126,0.00039906934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984369,0.00013810679,0.00023578008,0.0002933328,0.0003224406,0.0005734214],"domain_scores_gemma":[0.99892396,0.00008403784,0.0001327268,0.0004557823,0.00014328508,0.00026018778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039274787,0.00018514755,0.00026157103,0.000056780627,0.000089167734,0.00020603964,0.00043247122,0.00006995029,0.0002721626],"category_scores_gemma":[0.00004945439,0.00014658396,0.000053549677,0.00026190016,0.00008450755,0.0011197204,0.00008577325,0.000077598466,0.0002995842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046023197,0.0041829487,0.19956522,0.00012697342,0.001579218,0.00018064112,0.0029605406,0.013894546,0.053172804,0.65421295,0.0132624805,0.056401443],"study_design_scores_gemma":[0.0069416957,0.00016784846,0.008208802,0.000095814,0.00005249491,0.00027906397,0.000079633675,0.97337914,0.006391992,0.000039772316,0.0033934833,0.0009702564],"about_ca_topic_score_codex":0.000031855026,"about_ca_topic_score_gemma":0.0000017987602,"teacher_disagreement_score":0.9594846,"about_ca_system_score_codex":0.00007064473,"about_ca_system_score_gemma":0.00006343065,"threshold_uncertainty_score":0.59775203},"labels":[],"label_agreement":null},{"id":"W1976760821","doi":"10.1109/icca.2010.5524351","title":"Formation control of spacecraft flying with network-induced delays and packet dropouts","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Spacecraft; Control theory (sociology); Robustness (evolution); Network packet; Position (finance); Computer science; Lyapunov function; Circular orbit; Tracking (education); Exponential stability; Control (management); Aerospace engineering; Engineering; Physics","score_opus":0.007695122365576977,"score_gpt":0.20354013887631273,"score_spread":0.19584501651073574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976760821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18835376,0.000017371034,0.8093374,0.00059888785,0.0002236155,0.00033873174,0.0000037797308,0.0001052764,0.0010212257],"genre_scores_gemma":[0.9906541,0.0000010815813,0.009089233,0.00011103554,0.000067746296,0.000019754852,0.0000036825986,0.000007521927,0.000045824443],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988866,0.000054558535,0.0002755228,0.00023272622,0.00025573588,0.00029485158],"domain_scores_gemma":[0.9989862,0.000104364335,0.00020447346,0.00044231865,0.00014804129,0.00011459798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000411461,0.0001402681,0.00023992112,0.000055369186,0.00010700068,0.00013407468,0.00033220553,0.00007746416,0.000008127115],"category_scores_gemma":[0.000030693456,0.00010452141,0.00003284508,0.00019960833,0.000031328622,0.0007437361,0.00006508992,0.00014301925,0.000012051181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002215545,0.0002660365,0.06017643,0.00020395832,0.00039337232,0.000057956975,0.0029842458,0.0014247282,0.47023776,0.3424242,0.0030322499,0.11857749],"study_design_scores_gemma":[0.0033328189,0.00019300291,0.006688591,0.000047935355,0.000026053285,0.000072995404,0.000109458386,0.98359644,0.004606268,0.00037080012,0.00068046345,0.0002751489],"about_ca_topic_score_codex":0.00008204583,"about_ca_topic_score_gemma":0.00027279512,"teacher_disagreement_score":0.9821717,"about_ca_system_score_codex":0.000013309516,"about_ca_system_score_gemma":0.00003773559,"threshold_uncertainty_score":0.42622593},"labels":[],"label_agreement":null},{"id":"W1976997124","doi":"10.2316/journal.206.2011.1.206-3379","title":"INFORMATION SURFING FOR RADIATION MAP BUILDING","year":2011,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"U.S. Department of Energy","keywords":"Computer science; Situation awareness; Metric (unit); Mobile robot; Process (computing); Real-time computing; SIGNAL (programming language); Planar; Wireless sensor network; Human–computer interaction; Computer vision; Robot; Artificial intelligence; Computer network; Engineering; Computer graphics (images)","score_opus":0.018385583727572364,"score_gpt":0.25205020487683355,"score_spread":0.23366462114926118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976997124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008291496,0.000062230756,0.9886093,0.0009863235,0.0018358186,0.00010242378,0.0000059412423,0.000026476742,0.000079995545],"genre_scores_gemma":[0.8803398,0.000014860398,0.119409256,0.00008383532,0.00013055823,0.0000025885606,0.000009257888,0.0000028241034,0.000007007049],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990936,0.000029097608,0.0004551643,0.000051057697,0.00028775207,0.000083343904],"domain_scores_gemma":[0.99858093,0.000082752296,0.0006154486,0.0000666744,0.0006113767,0.000042828586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005973583,0.000064788306,0.00009835204,0.00021905618,0.000044976816,0.00023240736,0.00034374508,0.0000372176,0.0000021090514],"category_scores_gemma":[0.00016287676,0.000060262886,0.000054262924,0.000058484577,0.0000082844435,0.0021878327,0.000036197565,0.00004927841,0.0000033886497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010220054,0.00011820573,0.0030241099,0.00006736842,0.00033235946,0.000009241024,0.0047111297,0.030847182,0.0023520824,0.53243876,0.0014684888,0.42452887],"study_design_scores_gemma":[0.0014540326,0.00011102039,0.016540488,0.00010395409,0.000020038013,0.0000812696,0.00008544139,0.967886,0.0015132175,0.008144544,0.003930321,0.0001296995],"about_ca_topic_score_codex":0.000008153565,"about_ca_topic_score_gemma":4.9272137e-7,"teacher_disagreement_score":0.9370388,"about_ca_system_score_codex":0.00007103555,"about_ca_system_score_gemma":0.000041267285,"threshold_uncertainty_score":0.24574493},"labels":[],"label_agreement":null},{"id":"W1977206137","doi":"10.2316/journal.206.2011.1.206-3384","title":"COOPERATIVE ATTITUDE SYNCHRONIZATION FOR RIGID-BODY SPACECRAFT &lt;em&gt;VIA&lt;/em&gt; VARYING COMMUNICATION TOPOLOGY","year":2011,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backstepping; Control theory (sociology); Synchronization (alternating current); Quaternion; Piecewise; Nonlinear system; Stability theory; Lyapunov function; Topology (electrical circuits); Lyapunov stability; Spacecraft; Mathematics; Stability (learning theory); Computer science; Control (management); Adaptive control; Engineering; Physics; Mathematical analysis","score_opus":0.021562792328747006,"score_gpt":0.2723593289366953,"score_spread":0.25079653660794826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977206137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012534155,0.0003404435,0.9839967,0.0014954393,0.0010746367,0.00028734523,0.000013956736,0.000052438623,0.00020489334],"genre_scores_gemma":[0.92390287,0.00010214476,0.075559326,0.00013223576,0.00017028429,0.000011904592,0.000046427962,0.0000122645,0.00006257338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828726,0.00015806808,0.00070630404,0.00020199132,0.00046506262,0.00018133012],"domain_scores_gemma":[0.99700236,0.00019918614,0.0008910223,0.00021738,0.0016019034,0.00008811977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068085035,0.00016673225,0.00026185688,0.00026482204,0.00016891187,0.00031511227,0.0008489631,0.00010584494,0.000016359278],"category_scores_gemma":[0.0002083767,0.00015612315,0.000092445676,0.00014874729,0.00004932512,0.0011687558,0.00014391226,0.0001360595,0.000009857498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003446695,0.0013727383,0.0030079358,0.00013825136,0.0019070765,0.0000879813,0.014291842,0.14341584,0.037351783,0.71130025,0.0025935175,0.08418811],"study_design_scores_gemma":[0.0018384043,0.00021754371,0.0069227065,0.00015328031,0.000056545705,0.00018370342,0.00007662871,0.9843103,0.001250684,0.004034121,0.0007520616,0.00020400752],"about_ca_topic_score_codex":0.000013657148,"about_ca_topic_score_gemma":0.000028815884,"teacher_disagreement_score":0.91136867,"about_ca_system_score_codex":0.00019984595,"about_ca_system_score_gemma":0.000108395834,"threshold_uncertainty_score":0.6366517},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.040121011471013546,"score_gpt":0.30982728312438823,"score_spread":0.2697062716533747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977335817","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056720083,0.0001859721,0.99091786,0.00018542424,0.0007944542,0.00072132616,0.0002047849,0.00051610166,0.0008020794],"genre_scores_gemma":[0.9475016,0.0000022679578,0.051521305,0.00028394637,0.00039608037,0.000016855014,0.00013718422,0.000054388558,0.00008635765],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945839,0.0002801954,0.001263933,0.0011884306,0.0012937114,0.0013898239],"domain_scores_gemma":[0.9958745,0.0018494643,0.0005265884,0.000582512,0.0005665663,0.00060033274],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001656991,0.0005800018,0.0006421842,0.00025423724,0.00063853763,0.0008224626,0.00083823863,0.00030612934,0.000082662336],"category_scores_gemma":[0.000806565,0.00055397925,0.0001097895,0.0014016056,0.00027544994,0.00041246222,0.00011723358,0.00062511873,0.00014594068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013380111,0.0028204063,0.0014427379,0.0010831393,0.0002958498,0.0031534964,0.0008937838,0.28722805,0.011755496,0.1689837,0.009500716,0.5115046],"study_design_scores_gemma":[0.0013320164,0.00012301518,0.0010087824,0.00055882626,0.000057115387,0.00008322443,0.0000790307,0.9918229,0.00053364295,0.0025711143,0.0010543503,0.0007759774],"about_ca_topic_score_codex":0.00003623876,"about_ca_topic_score_gemma":0.000011713451,"teacher_disagreement_score":0.9418296,"about_ca_system_score_codex":0.00054755015,"about_ca_system_score_gemma":0.00034188203,"threshold_uncertainty_score":0.9996912},"labels":[],"label_agreement":null},{"id":"W1978109563","doi":"10.1109/icsmc.2012.6378162","title":"A game theoretical representation for the rendezvous problem","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Rendezvous; Computer science; Holonomic; Robot; Convergence (economics); Class (philosophy); Mathematical optimization; Point (geometry); Representation (politics); Game theory; Mobile robot; Holonomic constraints; Artificial intelligence; Mathematical economics; Mathematics; Engineering","score_opus":0.02732125851373627,"score_gpt":0.28886104969147886,"score_spread":0.26153979117774256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978109563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036664697,0.00012526415,0.98603123,0.0033863655,0.00044261533,0.0007548615,0.0000041540293,0.00018012233,0.008708712],"genre_scores_gemma":[0.9849518,0.0000020293808,0.013568317,0.00027194122,0.00019882212,0.00026814084,0.000004998176,0.00000655163,0.0007273864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893576,0.00008282374,0.00020112711,0.00020187469,0.00022660056,0.0003518116],"domain_scores_gemma":[0.9986689,0.0005202915,0.00006614382,0.00058530696,0.000074162,0.000085172825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006726817,0.00008790625,0.00010063919,0.00002353056,0.000086651286,0.00015823983,0.00064309186,0.000040217168,0.000028515567],"category_scores_gemma":[0.000111055226,0.000051108007,0.00006586321,0.00016808962,0.00005692715,0.0003911838,0.00010775945,0.0000556545,0.00009234788],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006131845,0.000038455662,0.00036300623,0.000005168793,0.000020553263,2.729546e-7,0.0003855804,0.000031589032,0.0002695826,0.9824818,0.0030731168,0.013324784],"study_design_scores_gemma":[0.002588384,0.00019417534,0.0071882643,0.000031494677,0.00007645237,0.000084148865,0.00041470423,0.81608987,0.004480178,0.08777444,0.080526605,0.00055130513],"about_ca_topic_score_codex":0.000019668416,"about_ca_topic_score_gemma":0.00000195579,"teacher_disagreement_score":0.98458517,"about_ca_system_score_codex":0.00002907242,"about_ca_system_score_gemma":0.000019316754,"threshold_uncertainty_score":0.2084124},"labels":[],"label_agreement":null},{"id":"W1979310056","doi":"10.1109/spawc.2012.6292959","title":"TOP-K selective gossip","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Gossip protocol; Convergence (economics); Aggregate (composite); Theoretical computer science; Algorithm","score_opus":0.014178643886222914,"score_gpt":0.24170883532708748,"score_spread":0.22753019144086456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979310056","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006192164,0.00015592236,0.89952505,0.00049494806,0.0008822891,0.0001709846,0.0000020373463,0.00039135834,0.09218527],"genre_scores_gemma":[0.99086416,4.764287e-7,0.0060860123,0.0002930141,0.00017761567,0.000021353484,0.0000013722874,0.000004613543,0.002551397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990134,0.000057792895,0.00013903623,0.0001860657,0.00019303644,0.0004106533],"domain_scores_gemma":[0.99928087,0.000056717843,0.000045393946,0.0004013866,0.000060276205,0.00015536266],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025919368,0.0000958653,0.00011310516,0.000044129527,0.0000643031,0.00010201298,0.0005385527,0.00004353389,0.00004137532],"category_scores_gemma":[0.000039795636,0.00007832148,0.000049346374,0.00029187242,0.000011939031,0.00076084526,0.00011242301,0.00006852086,0.0010508288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000641092,0.00032313808,0.05330889,0.000012589202,0.000102658785,0.0000072322314,0.0019938112,0.000036630478,0.004372819,0.83998585,0.053678893,0.046171095],"study_design_scores_gemma":[0.0039697587,0.00026244996,0.3162504,0.000043918175,0.000045923818,0.0001987681,0.0004208372,0.14281167,0.059790947,0.004193184,0.46998563,0.0020265048],"about_ca_topic_score_codex":0.00005623415,"about_ca_topic_score_gemma":0.0000034576688,"teacher_disagreement_score":0.984672,"about_ca_system_score_codex":0.000063734224,"about_ca_system_score_gemma":0.000029016517,"threshold_uncertainty_score":0.99972695},"labels":[],"label_agreement":null},{"id":"W1979944797","doi":"10.1115/1.4028687","title":"Cooperative Optimal Synchronization of Networked Uncertain Nonlinear Euler–Lagrange Heterogeneous Multi-Agent Systems With Switching Topologies","year":2014,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Synchronization (alternating current); Control theory (sociology); Network topology; Computer science; Nonlinear system; Parametric statistics; Optimal control; Adaptive control; Mathematical optimization; Multi-agent system; Controller (irrigation); Control (management); Topology (electrical circuits); Mathematics","score_opus":0.01830264684914609,"score_gpt":0.22785392162008566,"score_spread":0.20955127477093957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979944797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04035314,0.006848166,0.9499871,0.00015643316,0.0016367806,0.00093393435,0.000013661199,0.00005295191,0.000017796237],"genre_scores_gemma":[0.9978217,0.00005572619,0.0017594915,0.000024120298,0.00025047158,0.000037975038,0.000003357412,0.000024886218,0.000022274578],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955406,0.0009449721,0.0014231647,0.00038591935,0.0012581522,0.0004471595],"domain_scores_gemma":[0.9955486,0.00023692,0.0018334903,0.00044267546,0.0017401223,0.00019818306],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031062863,0.0003889988,0.0011151336,0.00022443084,0.00018290739,0.00036958978,0.00070808124,0.00013708456,8.530746e-7],"category_scores_gemma":[0.00023012463,0.0002734958,0.0001510517,0.00026710253,0.00007122196,0.00046454044,0.000056816807,0.00023537231,0.00000198845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037450524,0.0003151429,0.0027229618,0.0004554793,0.0014630127,0.00007275965,0.00083493104,0.9777093,0.009277049,0.00056481047,0.000039138664,0.006170933],"study_design_scores_gemma":[0.006224986,0.0010230654,0.00047772616,0.0009891709,0.00017765621,0.00032497532,0.0004821901,0.9897472,0.000049902865,0.0000019951658,0.00021479823,0.00028633367],"about_ca_topic_score_codex":0.00018645325,"about_ca_topic_score_gemma":0.000059684422,"teacher_disagreement_score":0.95746857,"about_ca_system_score_codex":0.0003803946,"about_ca_system_score_gemma":0.00020153911,"threshold_uncertainty_score":0.99997175},"labels":[],"label_agreement":null},{"id":"W1981756029","doi":"10.1109/ccece.2008.4564649","title":"Towards command and control networking of cooperative autonomous robotics for military applications (CARMA)","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robotics; Artificial intelligence; Computer science; Robot; Variety (cybernetics); Command and control; Control engineering; Distributed computing; Engineering; Telecommunications","score_opus":0.019707087260491685,"score_gpt":0.20595723059115648,"score_spread":0.18625014333066478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981756029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059928014,0.00067518116,0.99078363,0.0010020742,0.00014396996,0.0009814386,0.00004158945,0.0001288469,0.00025046387],"genre_scores_gemma":[0.9892677,0.00017213,0.009846485,0.00029744665,0.00015352438,0.0002198438,0.000009953412,0.0000172356,0.000015702099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817306,0.000015148418,0.0004090178,0.00058373297,0.0001908811,0.0006281811],"domain_scores_gemma":[0.99838555,0.00013141937,0.000101842175,0.00018064117,0.0005514983,0.00064904155],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017148397,0.0003296013,0.0005285793,0.00026747643,0.0002596292,0.00016466026,0.0005562557,0.00014320321,0.0000019529493],"category_scores_gemma":[0.000035435154,0.00033483724,0.000059744412,0.0003760319,0.000101983045,0.0002764624,0.0000715002,0.00027402872,0.000001255421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007554634,0.00014523012,0.0026268766,0.00034048973,0.00032490166,0.000027251852,0.0024041198,0.0076620067,0.001490794,0.8629735,0.00092987623,0.12099937],"study_design_scores_gemma":[0.00091869547,0.00040805145,0.002066039,0.0000786766,0.000021432377,0.000060881855,0.000015994765,0.9938576,0.00012077207,0.00046408613,0.0016258862,0.00036184874],"about_ca_topic_score_codex":0.00097280013,"about_ca_topic_score_gemma":0.00028209412,"teacher_disagreement_score":0.9861956,"about_ca_system_score_codex":0.00012740325,"about_ca_system_score_gemma":0.0005917418,"threshold_uncertainty_score":0.99991035},"labels":[],"label_agreement":null},{"id":"W1981860295","doi":"10.1109/acc.2012.6315666","title":"Convergence analysis for a class of bounded distributed connectivity preserving consensus algorithms for unicycles","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Convergence (economics); Nonlinear system; Signal-flow graph; Limit (mathematics); Mathematics; Computer science; Control theory (sociology); Graph; Class (philosophy); Algorithm; Control (management); Theoretical computer science","score_opus":0.053883153436002536,"score_gpt":0.30364402176582517,"score_spread":0.24976086832982264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981860295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04552726,0.00018641197,0.9504847,0.0005452247,0.00052380736,0.0012719989,0.0011249698,0.00018222662,0.00015341197],"genre_scores_gemma":[0.9572572,0.0000018487954,0.042050317,0.000045477267,0.00007152661,0.00027409254,0.00013507623,0.000012304551,0.00015215357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976478,0.00016454938,0.0006369721,0.0005030828,0.00032174075,0.00072582596],"domain_scores_gemma":[0.9959497,0.0018082419,0.0004365796,0.0009658208,0.00060342473,0.00023622284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295388,0.00024438225,0.0006758528,0.00018448623,0.0001762235,0.000112435024,0.001027824,0.00012818599,0.000018995388],"category_scores_gemma":[0.0007977135,0.00022524792,0.00045953205,0.0010229906,0.00009612736,0.00043664698,0.0002321786,0.000067734756,0.000004055163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004669983,0.002033082,0.20442204,0.00087317126,0.009938068,0.000004735229,0.0013009455,0.006431047,0.021276362,0.73071116,0.015033076,0.00750929],"study_design_scores_gemma":[0.0019177664,0.000093846415,0.01713513,0.000015537158,0.00038032202,0.0000034398565,0.00017217586,0.9643195,0.009165035,0.0014368788,0.0050116833,0.00034868263],"about_ca_topic_score_codex":0.0003755525,"about_ca_topic_score_gemma":0.00014872132,"teacher_disagreement_score":0.9578885,"about_ca_system_score_codex":0.00011319148,"about_ca_system_score_gemma":0.000110415014,"threshold_uncertainty_score":0.91853434},"labels":[],"label_agreement":null},{"id":"W1982096061","doi":"10.1007/s10846-013-9986-4","title":"A Distributed Deployment Strategy for Multi-Agent Systems Subject to Health Degradation and Communication Delays","year":2013,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Voronoi diagram; Software deployment; Distributed computing; Computer science; Collision avoidance; Multi-agent system; Autonomous agent; Wireless sensor network; Task (project management); Real-time computing; Collision; Engineering; Computer network; Computer security; Artificial intelligence; Mathematics","score_opus":0.07518497580232193,"score_gpt":0.31593741405582415,"score_spread":0.24075243825350223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982096061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008434235,0.008045186,0.97646904,0.001300611,0.0019641393,0.0036608106,0.000036308244,0.00008025285,0.000009410762],"genre_scores_gemma":[0.9834595,0.00024111243,0.015438971,0.000111837835,0.00016480638,0.00034637694,0.0000447255,0.000035876543,0.00015681761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950956,0.00073060393,0.002366136,0.00043774428,0.0007394459,0.0006304591],"domain_scores_gemma":[0.99483305,0.00042370902,0.0018782638,0.0008562419,0.0013497325,0.00065897626],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0024912294,0.00038229526,0.00095662614,0.0003798624,0.00027212294,0.0011883817,0.0012997452,0.0001297958,0.0000025262914],"category_scores_gemma":[0.00024601375,0.00031687113,0.00020833637,0.00046462836,0.00003474731,0.00080940744,0.00016712426,0.00024075061,0.000048886814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010680809,0.0010942044,0.0034990807,0.0012225185,0.0010438418,0.00002256035,0.0025318116,0.9169404,0.0018400011,0.026980855,0.021993726,0.022724207],"study_design_scores_gemma":[0.0014673715,0.0011180828,0.0027081105,0.0011924341,0.00006204861,0.00044842227,0.002638049,0.98717904,0.00018595005,0.000053855227,0.002524546,0.00042211718],"about_ca_topic_score_codex":0.0019931747,"about_ca_topic_score_gemma":0.00006371405,"teacher_disagreement_score":0.97502524,"about_ca_system_score_codex":0.00095548964,"about_ca_system_score_gemma":0.00029555758,"threshold_uncertainty_score":0.99992836},"labels":[],"label_agreement":null},{"id":"W1982567035","doi":"10.48550/arxiv.1105.1668","title":"Convergence Time Analysis of Quantized Gossip Consensus on Digraphs","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Ministry of Education, Culture, Sports, Science and Technology","keywords":"Convergence (economics); Gossip; Markov chain; Upper and lower bounds; Time complexity; Interval (graph theory); Markov process; Computer science; Mathematics; Lyapunov function; Algorithm; Mathematical optimization; Combinatorics","score_opus":0.08673103443744931,"score_gpt":0.1907673095906027,"score_spread":0.10403627515315339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982567035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6679498,0.00009286976,0.32214412,0.000057456644,0.0010298147,0.0006816212,0.00035618342,0.00043123713,0.0072569265],"genre_scores_gemma":[0.9980795,0.000040127732,0.0003371634,0.000037422524,0.000017710565,0.00000161615,0.000060005284,0.000015968648,0.0014105116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99682045,0.0004206135,0.00054569356,0.0015234477,0.0002220626,0.0004677137],"domain_scores_gemma":[0.99541056,0.00034508476,0.0009751896,0.0026352978,0.0003845806,0.0002492896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047078528,0.00047424974,0.001162754,0.0011406696,0.000102127124,0.000075290955,0.0029793421,0.00037561843,0.00014049938],"category_scores_gemma":[0.00009102164,0.0005259488,0.0009420694,0.0025335825,0.00024241088,0.00013371992,0.001062251,0.0004273839,0.00033311595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005060672,0.00093124434,0.022635214,0.00022114553,0.0126602715,0.001089689,0.0008448278,0.31327745,0.0017302014,0.644015,0.0017046238,0.00038421853],"study_design_scores_gemma":[0.0011185004,0.000100498924,0.009035459,0.00012151607,0.0017191732,0.0000016703548,0.0000391901,0.9820264,0.00061826117,0.004355966,0.00015929875,0.0007040671],"about_ca_topic_score_codex":0.000832165,"about_ca_topic_score_gemma":0.000054253618,"teacher_disagreement_score":0.6687489,"about_ca_system_score_codex":0.00014509204,"about_ca_system_score_gemma":0.00021758958,"threshold_uncertainty_score":0.9997192},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01761174270293917,"score_gpt":0.24883323577717423,"score_spread":0.23122149307423506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983523909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002740428,0.00010661449,0.97689736,0.00065295195,0.0002807698,0.0006141071,0.0000034945667,0.0008940131,0.017810278],"genre_scores_gemma":[0.9000262,0.0000011621789,0.09693826,0.0007752305,0.00006170179,0.00006498715,0.000013402612,0.000009479009,0.0021095902],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801445,0.000247448,0.00045238397,0.000484798,0.00038227887,0.00041865397],"domain_scores_gemma":[0.9984698,0.00009134553,0.00013191123,0.001032987,0.000103034465,0.00017090476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006435417,0.00023152931,0.00030237535,0.00008860626,0.0001326585,0.00047864037,0.0010824964,0.000093435156,0.00003956018],"category_scores_gemma":[0.0001188126,0.00019756508,0.00010546569,0.00035384102,0.000038824783,0.00062586414,0.00009649538,0.00015452356,0.0006382322],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026665251,0.00295287,0.00026592964,0.00009398121,0.0002625455,0.000083579565,0.01455872,0.0032773102,0.006473836,0.8225712,0.019748723,0.12968461],"study_design_scores_gemma":[0.0012461676,0.000111176516,0.008560457,0.000033219567,0.000019308549,0.000054044078,0.0000746327,0.9824208,0.00024351178,0.0013658556,0.0055273124,0.00034349132],"about_ca_topic_score_codex":0.000029749504,"about_ca_topic_score_gemma":0.000009224458,"teacher_disagreement_score":0.9791435,"about_ca_system_score_codex":0.0001498382,"about_ca_system_score_gemma":0.00014418077,"threshold_uncertainty_score":0.8203397},"labels":[],"label_agreement":null},{"id":"W1985382821","doi":"10.1155/2010/360925","title":"Cohesive Motion Control Algorithm for Formation of Multiple Autonomous Agents","year":2010,"lang":"en","type":"article","venue":"Journal of Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Directed graph; Vertex (graph theory); Graph; Kinematics; Path (computing); Shortest path problem; Algorithm; Topology (electrical circuits); Mathematics; Theoretical computer science; Combinatorics","score_opus":0.016995472819210457,"score_gpt":0.24892687894464222,"score_spread":0.23193140612543175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985382821","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00367645,0.000029630604,0.99344957,0.00044523092,0.0019529464,0.0003706292,0.000035707675,0.000018836834,0.000021019616],"genre_scores_gemma":[0.7823295,0.000002617244,0.21739942,0.000048950224,0.00018238605,0.0000042040156,0.0000042967663,0.0000072109024,0.000021392614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851435,0.000056603487,0.0007716534,0.00010502627,0.00035069516,0.00020163882],"domain_scores_gemma":[0.997157,0.0002482453,0.0013099984,0.00025406745,0.0009196848,0.000111042245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006675448,0.00011687871,0.00033621816,0.0001463376,0.00006199287,0.000078823534,0.0005892022,0.000098588935,0.0000019347497],"category_scores_gemma":[0.00032797558,0.00010241808,0.00019788342,0.000121638936,0.00002486546,0.0007701317,0.000031830878,0.0001920254,0.000004844819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015367498,0.0013668834,0.0037752162,0.00026464212,0.0005998358,0.000070034104,0.0020245854,0.35584846,0.084899224,0.012577139,0.005750928,0.53266937],"study_design_scores_gemma":[0.0033581082,0.00020748796,0.0017719707,0.000028655693,0.00004906531,0.000094474526,0.000032641245,0.9891031,0.004232645,0.00034824063,0.0006782903,0.00009536266],"about_ca_topic_score_codex":0.000004861024,"about_ca_topic_score_gemma":0.0000049891605,"teacher_disagreement_score":0.7786531,"about_ca_system_score_codex":0.00006909029,"about_ca_system_score_gemma":0.00008867676,"threshold_uncertainty_score":0.41764882},"labels":[],"label_agreement":null},{"id":"W1985525333","doi":"10.1109/tsp.2012.2215603","title":"Average-Consensus in a Deterministic Framework—Part I: Strong Connectivity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Node (physics); Computer science; Algorithm; Network topology; Consensus algorithm; Order (exchange); Path (computing); Discrete mathematics; Theoretical computer science; Mathematics; Computer network; Engineering","score_opus":0.03635120828199561,"score_gpt":0.2800239288123439,"score_spread":0.24367272053034827,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985525333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03409319,0.00013620513,0.96392566,0.00016397689,0.00075068517,0.0003068928,0.000018932365,0.0002457892,0.0003586471],"genre_scores_gemma":[0.9951348,0.0000012477799,0.0044140536,0.00013045131,0.00012426132,0.000095287716,8.420255e-7,0.000022681937,0.00007642237],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770594,0.00022664484,0.00046213332,0.00047732898,0.00040755852,0.000720385],"domain_scores_gemma":[0.9986088,0.0005241102,0.0001689437,0.00038903387,0.00008164667,0.0002274549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058622984,0.0002777921,0.00033176676,0.0002484823,0.00030211284,0.00026239932,0.00045941264,0.00016683959,0.00004233397],"category_scores_gemma":[0.000026611124,0.00028450816,0.00011166828,0.00060575746,0.000067308465,0.00075869786,0.000004169008,0.00057050126,0.00010650844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024283462,0.0028922958,0.0023555744,0.0003892609,0.00014947084,0.00019334462,0.0054576104,0.12631744,0.007264761,0.0026404965,0.00009037242,0.85200655],"study_design_scores_gemma":[0.0021867836,0.00022522299,0.002092158,0.0009452633,0.000058827776,0.00018905406,0.00027652294,0.9762011,0.015393263,0.00071103725,0.00063068763,0.001090037],"about_ca_topic_score_codex":0.000029742143,"about_ca_topic_score_gemma":0.000021155185,"teacher_disagreement_score":0.96104157,"about_ca_system_score_codex":0.00020828033,"about_ca_system_score_gemma":0.00015957984,"threshold_uncertainty_score":0.9999607},"labels":[],"label_agreement":null},{"id":"W1987557759","doi":"10.2316/journal.206.2010.3.206-3345","title":"FORMATION CONTROL AND SWITCHING FOR MULTIPLE ROBOTS IN UNCERTAIN ENVIRONMENTS","year":2010,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Robot; Control theory (sociology); Obstacle; Control (management); Computer science; Obstacle avoidance; Point (geometry); Tracking (education); Collision avoidance; Mobile robot; Artificial intelligence; Collision; Mathematics; Law; Computer security; Psychology","score_opus":0.009979738713702762,"score_gpt":0.24764624478156883,"score_spread":0.23766650606786607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987557759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12294828,0.00003623213,0.87437487,0.0018324645,0.00064572174,0.00014267991,0.0000060718035,0.000007421725,0.000006277177],"genre_scores_gemma":[0.9617846,0.000014286461,0.03802407,0.000073757095,0.000085388274,0.0000046989635,0.0000050672998,0.0000035163512,0.0000046160603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915016,0.000027305465,0.00039646245,0.00009022728,0.00024541968,0.000090424895],"domain_scores_gemma":[0.9992194,0.0001985141,0.00037655456,0.0000634052,0.00010263855,0.00003948415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000477687,0.00007159824,0.0001214549,0.00016185651,0.000037440142,0.00018978918,0.00023552179,0.000045335128,5.3557415e-7],"category_scores_gemma":[0.00021594971,0.00006447449,0.000032047832,0.000035142686,0.000010362219,0.0009120576,0.00003201871,0.00010441765,6.240403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016659974,0.00036372963,0.033051357,0.00006876821,0.00024532716,0.00004957214,0.0023470432,0.29972318,0.2996333,0.07880668,0.00017871117,0.28536573],"study_design_scores_gemma":[0.0021307762,0.000040210904,0.028060753,0.00005165018,0.0000063984144,0.000082824954,0.000024510338,0.96702236,0.0003206769,0.0019791387,0.00021665759,0.000064051],"about_ca_topic_score_codex":0.0000106409025,"about_ca_topic_score_gemma":0.000020383877,"teacher_disagreement_score":0.8388363,"about_ca_system_score_codex":0.000045999153,"about_ca_system_score_gemma":0.000018499166,"threshold_uncertainty_score":0.2629193},"labels":[],"label_agreement":null},{"id":"W1987917074","doi":"10.1109/tac.2014.2305952","title":"Average Consensus on Arbitrary Strongly Connected Digraphs With Time-Varying Topologies","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Strongly connected component; State (computer science); Topology (electrical circuits); Consensus; Computer science; Mathematics; Consensus algorithm; Mathematical optimization; Multi-agent system; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.0097763694579725,"score_gpt":0.21548738633582223,"score_spread":0.20571101687784973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987917074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044032343,0.000018139523,0.94887805,0.0015524462,0.00061918906,0.0010042408,0.00009301777,0.0017686168,0.0020339303],"genre_scores_gemma":[0.9953104,0.0000011931935,0.0034956483,0.0006324753,0.000039693015,0.00020795607,0.0000053341437,0.000034172597,0.00027308916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996935,0.00050093373,0.0006036053,0.0007052477,0.00060501165,0.0006501883],"domain_scores_gemma":[0.99629265,0.0019032123,0.00027544197,0.0011811913,0.00012965796,0.00021781932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040978246,0.0004703887,0.00068226125,0.00034400582,0.00037986765,0.0002960882,0.0008030455,0.0001527053,0.000107963024],"category_scores_gemma":[0.00005428781,0.00038611479,0.00022598801,0.000476799,0.00014928934,0.00024924357,0.0000030143785,0.00033997008,0.0003921207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013150282,0.0031905568,0.00019659752,0.00034007014,0.0033147184,0.000446485,0.0021880218,0.7108705,0.018718466,0.022790197,0.0019167488,0.2347126],"study_design_scores_gemma":[0.006280919,0.00087630085,0.00055926933,0.00017385068,0.00008385401,0.00005975245,0.00003314086,0.9888789,0.002137303,0.00022308982,0.00021665725,0.00047694816],"about_ca_topic_score_codex":0.000064490385,"about_ca_topic_score_gemma":0.000025079065,"teacher_disagreement_score":0.9512781,"about_ca_system_score_codex":0.000115621566,"about_ca_system_score_gemma":0.000119402386,"threshold_uncertainty_score":0.9998591},"labels":[],"label_agreement":null},{"id":"W1988995612","doi":"10.1115/1.4026173","title":"Distributed Full-State Observers With Limited Communication and Application to Cooperative Target Localization","year":2013,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Estimator; Convergence (economics); Network topology; Multi-agent system; State (computer science); Control theory (sociology); Decentralised system; Observer (physics); Sensor fusion; Bandwidth (computing); State observer; Distributed computing; Control (management); Artificial intelligence; Computer network; Mathematics; Algorithm","score_opus":0.00891583981488917,"score_gpt":0.19959886326662127,"score_spread":0.1906830234517321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988995612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025227828,0.0017651158,0.9697644,0.0015920531,0.0001345762,0.0014416716,0.000019232928,0.000038762922,0.000016348346],"genre_scores_gemma":[0.9985337,0.00004174467,0.0011165701,0.00010984849,0.000024092576,0.00013280901,0.000013774149,0.000011866826,0.000015582977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976984,0.00038989013,0.00072356267,0.00024847663,0.0007082351,0.00023143635],"domain_scores_gemma":[0.9965871,0.0000808281,0.0007370014,0.00038065886,0.0019782684,0.00023615596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012238248,0.00021079811,0.0004443837,0.00014791774,0.00017508992,0.0004911219,0.00042001036,0.00005980327,0.0000010410929],"category_scores_gemma":[0.00010147245,0.00015822954,0.000039534487,0.0003343881,0.00004159092,0.0007738519,0.000044167515,0.00013215227,0.000006055073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021422838,0.0013787255,0.07379519,0.0011072154,0.00502024,0.00005403523,0.007636584,0.5814064,0.24233104,0.011449569,0.004723362,0.06895534],"study_design_scores_gemma":[0.0038171925,0.00046542494,0.014879907,0.00034483348,0.00006288979,0.00007126842,0.0003810349,0.9789187,0.00004436208,0.00005927967,0.0007302443,0.00022486338],"about_ca_topic_score_codex":0.00013750953,"about_ca_topic_score_gemma":0.00006470359,"teacher_disagreement_score":0.9733059,"about_ca_system_score_codex":0.00026625302,"about_ca_system_score_gemma":0.00008812286,"threshold_uncertainty_score":0.6452413},"labels":[],"label_agreement":null},{"id":"W1989290986","doi":"10.1109/icuas.2013.6564802","title":"Coverage control in multi-vehicle systems subject to health degradation","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Software deployment; Task (project management); Convergence (economics); Trajectory; Degradation (telecommunications); Control (management); Vehicle dynamics; Function (biology); Distributed computing; Task analysis; Real-time computing; Engineering; Automotive engineering; Artificial intelligence","score_opus":0.023510888514081323,"score_gpt":0.26003968059749566,"score_spread":0.23652879208341435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989290986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029511927,0.00016401154,0.9628373,0.0037098643,0.00061964354,0.0023557206,0.000015541724,0.0002940736,0.0004919228],"genre_scores_gemma":[0.993464,0.0000029016642,0.0030933402,0.001936763,0.000036037472,0.000368047,0.00000975314,0.000013075216,0.0010760782],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974838,0.000359569,0.00063466094,0.0005331131,0.00038167092,0.00060717744],"domain_scores_gemma":[0.99854887,0.00014667622,0.0001648982,0.00068526156,0.00014444487,0.00030984276],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007558499,0.00020247324,0.00039888723,0.00021684615,0.00008718549,0.0005277069,0.00078915176,0.00006980136,0.000019918614],"category_scores_gemma":[0.000082756,0.00017967256,0.000058058744,0.0005942174,0.000010029865,0.00088160747,0.00008995111,0.00012145252,0.0012296955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014198055,0.0035271968,0.27612403,0.0007514761,0.00041021084,0.00015356028,0.0065113865,0.07942585,0.06972487,0.22190647,0.124736115,0.21658687],"study_design_scores_gemma":[0.003110428,0.00011817687,0.056275006,0.000057767975,0.0000015190254,0.0000068109553,0.00009434899,0.93812084,0.000102383776,0.000034682133,0.0018123672,0.00026565418],"about_ca_topic_score_codex":0.015431024,"about_ca_topic_score_gemma":0.0007375024,"teacher_disagreement_score":0.96395206,"about_ca_system_score_codex":0.00035231962,"about_ca_system_score_gemma":0.00013134001,"threshold_uncertainty_score":0.99954796},"labels":[],"label_agreement":null},{"id":"W1989300426","doi":"10.1109/tcst.2012.2208113","title":"Health-Aware Coverage Control With Application to a Team of Small UAVs","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Task (project management); Cover (algebra); Computer science; Variable (mathematics); Control (management); Real-time computing; Engineering; Artificial intelligence; Systems engineering","score_opus":0.008230648887425855,"score_gpt":0.22712842131153485,"score_spread":0.218897772424109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989300426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024954537,0.0004127802,0.9873501,0.0035980074,0.00097442366,0.003784963,0.00032255804,0.0009352,0.00012651407],"genre_scores_gemma":[0.9960583,0.000006403883,0.0010340889,0.00041022923,0.00007772852,0.0022623711,0.0000032138892,0.00004059484,0.00010711312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967124,0.00027162177,0.0009528768,0.0006735967,0.0004570783,0.00093242544],"domain_scores_gemma":[0.9968918,0.0002475327,0.00059116515,0.0015877833,0.00033330786,0.00034842652],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520722,0.00040745974,0.001068385,0.00081528776,0.00022905928,0.00006779657,0.001148129,0.0003512971,0.000002083724],"category_scores_gemma":[0.000015684953,0.00036161824,0.00014670668,0.0010405508,0.00009141478,0.00032133123,0.0000051083007,0.00039869823,0.00012734719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022877278,0.0067862454,0.0081875445,0.0014349262,0.0035894427,0.000036582514,0.0024327245,0.42266753,0.071312875,0.0943743,0.0020183614,0.38487172],"study_design_scores_gemma":[0.052258868,0.009427363,0.0024884813,0.0015641087,0.0005715002,0.0012716801,0.0011202741,0.84718066,0.018282348,0.00030236735,0.061877217,0.0036551526],"about_ca_topic_score_codex":0.00046836695,"about_ca_topic_score_gemma":0.00030407016,"teacher_disagreement_score":0.9935628,"about_ca_system_score_codex":0.00037403716,"about_ca_system_score_gemma":0.00018296005,"threshold_uncertainty_score":0.9998836},"labels":[],"label_agreement":null},{"id":"W1990537896","doi":"10.1016/j.jtbi.2014.03.014","title":"Ordering dynamics in collectively swimming Surf Scoters","year":2014,"lang":"en","type":"article","venue":"Journal of Theoretical Biology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polarization (electrochemistry); Statistical physics; Propulsion; Computer science; Biological system; Perturbation (astronomy); Physics; Biology; Chemistry","score_opus":0.005942084648341201,"score_gpt":0.23673275232836988,"score_spread":0.23079066768002868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990537896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12404589,0.000055768738,0.871661,0.0018225927,0.0008287829,0.00007429909,0.000002126414,0.000016614067,0.0014929292],"genre_scores_gemma":[0.9930331,0.0000053198437,0.0067066425,0.0001543249,0.0000855459,0.0000014525838,9.429073e-7,0.0000046822465,0.00000795821],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833184,0.0004820349,0.0005479689,0.00018300721,0.00013377385,0.00032138792],"domain_scores_gemma":[0.9986004,0.000675849,0.0002744477,0.00020658261,0.00013437375,0.00010833214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016256439,0.0001181842,0.00038322888,0.00021472204,0.000040404604,0.00005866542,0.0008443413,0.00011745528,0.000008563769],"category_scores_gemma":[0.0010628819,0.0000916904,0.0001041029,0.00031100743,0.00019815659,0.00013675049,0.00014261318,0.0002858477,0.000006755292],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042391883,0.000046937297,0.0064646713,0.0000052493187,0.000025534155,0.000018516457,0.00006933217,0.00016299769,0.0017817232,0.9850032,0.000021417804,0.0063580764],"study_design_scores_gemma":[0.002913561,0.0010015399,0.005282876,0.00015841844,0.00001965891,0.0003468775,0.0001310402,0.7211858,0.0011090157,0.26635617,0.001136049,0.00035901272],"about_ca_topic_score_codex":0.000011371929,"about_ca_topic_score_gemma":0.000009888881,"teacher_disagreement_score":0.86898726,"about_ca_system_score_codex":0.00025295018,"about_ca_system_score_gemma":0.000062756175,"threshold_uncertainty_score":0.3739026},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01990881461671435,"score_gpt":0.2318356880729288,"score_spread":0.21192687345621447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991360560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070305183,0.00016497172,0.9795939,0.00073052134,0.009327962,0.00239478,0.00006701219,0.0006619003,0.000028477318],"genre_scores_gemma":[0.99446857,0.0000019303363,0.003070902,0.000592839,0.0005261229,0.0010785889,0.000011409034,0.000068602974,0.00018102076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99646825,0.00026468575,0.0006348295,0.000939913,0.0005681467,0.001124157],"domain_scores_gemma":[0.9970829,0.0010451693,0.00029843496,0.0010051086,0.00024452546,0.00032387077],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047479235,0.00058555644,0.0006757903,0.00015953631,0.00071596686,0.00051146705,0.0010245846,0.0002827779,0.000006410202],"category_scores_gemma":[0.0000098877945,0.0004861897,0.00048608097,0.00058519817,0.00012072061,0.00060126564,0.000003508771,0.00092655903,0.00001046837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003297351,0.00013277064,0.000063163956,0.000019359599,0.0002110426,0.00003543516,0.000053050473,0.99064463,0.00028063628,0.00031254263,0.0003692208,0.0075484277],"study_design_scores_gemma":[0.004353331,0.0006229358,0.00007721382,0.00009146262,0.0001421393,0.000024708077,0.00005303808,0.99343145,0.00017953795,0.000008929243,0.00046567802,0.0005495483],"about_ca_topic_score_codex":0.00014963427,"about_ca_topic_score_gemma":0.0003216094,"teacher_disagreement_score":0.9874381,"about_ca_system_score_codex":0.00010214171,"about_ca_system_score_gemma":0.00008596302,"threshold_uncertainty_score":0.99975896},"labels":[],"label_agreement":null},{"id":"W1991876273","doi":"10.1109/cec.2010.5586369","title":"Co-evolutionary search path planning under constrained information-sharing for a cooperative unmanned aerial vehicle team","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Motion planning; Bandwidth (computing); Information exchange; Distributed computing; Domain (mathematical analysis); Information sharing; Artificial intelligence; Computer network; Robot; Mathematics","score_opus":0.023646226181744688,"score_gpt":0.2852166009617374,"score_spread":0.26157037477999273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991876273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0840062,0.000008065599,0.9058115,0.00069350615,0.0008725172,0.00105483,0.00014309233,0.00037005323,0.0070402725],"genre_scores_gemma":[0.98756194,2.4589016e-7,0.011338182,0.00035907092,0.00017608768,0.00013472882,0.00016145929,0.000008476133,0.00025977942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841124,0.00004516613,0.0004170506,0.00031999458,0.00034409636,0.00046242983],"domain_scores_gemma":[0.99868596,0.00024588927,0.00010701912,0.000427855,0.00037009717,0.00016315894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005294962,0.00018058291,0.00021544566,0.00012539246,0.00038898914,0.0004908603,0.00078911963,0.00012289433,0.000047296453],"category_scores_gemma":[0.0001340412,0.00016396347,0.00007457998,0.00024051339,0.000089372814,0.0017045904,0.00013137654,0.0002408533,0.0001378392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022865021,0.00023377236,0.0036734738,0.00008621078,0.00023216261,0.000009658549,0.0049715764,0.020796265,0.069331765,0.8714441,0.024988981,0.0040033986],"study_design_scores_gemma":[0.0036257852,0.0001421611,0.002584935,0.000028860051,0.0000066288026,0.000024080084,0.000919365,0.98247045,0.0028713197,0.0005134684,0.006477726,0.0003352292],"about_ca_topic_score_codex":0.00006645829,"about_ca_topic_score_gemma":0.0000075087237,"teacher_disagreement_score":0.96167415,"about_ca_system_score_codex":0.00007476165,"about_ca_system_score_gemma":0.00030429216,"threshold_uncertainty_score":0.6686237},"labels":[],"label_agreement":null},{"id":"W1991974811","doi":"10.1109/acc.2010.5531502","title":"Convergence analysis for a class of nonlinear consensus algorithms","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Class (philosophy); Nonlinear system; Computer science; Algorithm; Consensus algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.019459533519323863,"score_gpt":0.2698271677432324,"score_spread":0.2503676342239085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991974811","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030459432,0.000014504073,0.96674156,0.0006436841,0.0007962558,0.00034451822,0.000117039555,0.00011784063,0.00076518557],"genre_scores_gemma":[0.8217694,6.817318e-7,0.17749245,0.00007802963,0.000055012402,0.000029725328,0.000014437722,0.0000051678508,0.0005550999],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862915,0.000034233588,0.0004257792,0.0003805642,0.00025881254,0.00027143935],"domain_scores_gemma":[0.9981908,0.00028723196,0.00020161108,0.0008016595,0.00039953514,0.000119149016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004418752,0.00012978642,0.00035693063,0.00016999847,0.00005066564,0.000056214005,0.000860332,0.00008891634,0.000048348455],"category_scores_gemma":[0.00015890568,0.000111940375,0.00026229955,0.0008293672,0.00007313358,0.00009543411,0.00009461564,0.00009590686,0.000029852456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012921898,0.0013680593,0.076306894,0.00025047292,0.006537201,0.000058567264,0.0011121432,0.003961996,0.28644112,0.5635511,0.011581608,0.048701584],"study_design_scores_gemma":[0.00066618656,0.00004421848,0.0021701374,0.0000023483688,0.00009715264,0.0000040469504,0.000025750922,0.9807297,0.00912002,0.00015920919,0.0068332856,0.00014794923],"about_ca_topic_score_codex":0.0001978513,"about_ca_topic_score_gemma":0.00020167278,"teacher_disagreement_score":0.9767677,"about_ca_system_score_codex":0.000011501444,"about_ca_system_score_gemma":0.00008786793,"threshold_uncertainty_score":0.45647958},"labels":[],"label_agreement":null},{"id":"W1991983718","doi":"10.2514/1.55218","title":"Robust Attitude Coordination Control for Spacecraft Formation Flying Under Actuator Failures","year":2012,"lang":"en","type":"article","venue":"Journal of Guidance Control and Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Spacecraft; Actuator; Control theory (sociology); Attitude control; Aerospace engineering; Computer science; Control (management); Control engineering; Aeronautics; Engineering","score_opus":0.020026703238723558,"score_gpt":0.24757818574600401,"score_spread":0.22755148250728047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991983718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010635828,0.0013818543,0.980798,0.0056889826,0.00089790934,0.00048150352,0.00004330893,0.000036237787,0.00003638272],"genre_scores_gemma":[0.9830158,0.000017932787,0.01601953,0.00041269662,0.00042445128,0.000028086852,0.0000057613715,0.0000137887955,0.00006199958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817204,0.0001203518,0.00073399657,0.00015864192,0.00037954023,0.00043543728],"domain_scores_gemma":[0.9975533,0.00039705366,0.0009818041,0.00022556045,0.0006216648,0.00022065394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014687964,0.00020829808,0.00046543387,0.0001663283,0.00022494406,0.00028051902,0.00042585106,0.00011512143,0.0000013862962],"category_scores_gemma":[0.00030149738,0.00017274827,0.00017850203,0.00013752717,0.000035391164,0.0025804278,0.000033635366,0.00016378002,0.0000030621975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001997077,0.0012864973,0.067794,0.0008491923,0.002242082,0.000036725443,0.0038362432,0.07972976,0.034856457,0.6361344,0.009459041,0.16177855],"study_design_scores_gemma":[0.0073649767,0.00016513445,0.013867445,0.0000906748,0.00010131023,0.00011538794,0.00021002295,0.97522193,0.000021728283,0.00073134474,0.0018948984,0.00021516319],"about_ca_topic_score_codex":0.000010211823,"about_ca_topic_score_gemma":0.00003588506,"teacher_disagreement_score":0.9723799,"about_ca_system_score_codex":0.00027727347,"about_ca_system_score_gemma":0.00007402182,"threshold_uncertainty_score":0.70444703},"labels":[],"label_agreement":null},{"id":"W1992059535","doi":"10.1109/cdc.2012.6426051","title":"Detectability of multiple link failures in multi-agent systems under the agreement protocol","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Institutes of Natural Sciences","keywords":"Digraph; Link (geometry); Computer science; Directed graph; Protocol (science); Laplacian matrix; Algebraic number; Graph theory; Graph; Algebraic graph theory; Adjacency matrix; Theoretical computer science; Topology (electrical circuits); Mathematics; Discrete mathematics; Algorithm; Combinatorics; Computer network","score_opus":0.0508016675853996,"score_gpt":0.2956260326021341,"score_spread":0.2448243650167345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992059535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012467042,0.00013516693,0.8958377,0.0008362524,0.00071983936,0.089393884,0.000013324636,0.00016493745,0.00043182136],"genre_scores_gemma":[0.94104946,3.3817946e-7,0.0031444314,0.00005723076,0.00007537708,0.055505548,0.000001663679,0.000010249355,0.00015571598],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968943,0.00056579156,0.00088531704,0.00041333257,0.00059659244,0.0006446902],"domain_scores_gemma":[0.99766433,0.00035420677,0.00031167088,0.0013583265,0.00015379602,0.0001576782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019896158,0.00025378802,0.00036658265,0.0001030071,0.000090556154,0.0001255555,0.0013417106,0.00011080734,0.000024451476],"category_scores_gemma":[0.0001340919,0.00015869758,0.00013148917,0.00043832778,0.0000769368,0.0004937512,0.00039418708,0.00019072689,0.0000914058],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016844003,0.0057659773,0.8056878,0.0016273718,0.00048685813,0.000013747509,0.007488676,0.025765073,0.03407552,0.091995046,0.0011351223,0.025790397],"study_design_scores_gemma":[0.0072796643,0.0002053507,0.31390312,0.00017828646,0.00002038598,0.000014495606,0.0018216816,0.6430333,0.009524773,0.00009170074,0.023209073,0.0007181126],"about_ca_topic_score_codex":0.0022359362,"about_ca_topic_score_gemma":0.0006429908,"teacher_disagreement_score":0.92858243,"about_ca_system_score_codex":0.00022609651,"about_ca_system_score_gemma":0.000074178904,"threshold_uncertainty_score":0.64715},"labels":[],"label_agreement":null},{"id":"W1992065642","doi":"10.4236/ojop.2013.23009","title":"Two Agent Paths Planning Collaboration Based on the State Feedback Stackelberg Dynamic Game","year":2013,"lang":"en","type":"article","venue":"Open Journal of Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"Polytechnique Montréal","keywords":"Stackelberg competition; Deadlock; Computer science; Motion planning; Trajectory; Distributed computing; State space; State (computer science); Game theory; Architecture; Incentive; Sequential game; Robot; Artificial intelligence","score_opus":0.017138156569687903,"score_gpt":0.2752849058274562,"score_spread":0.25814674925776826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992065642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010718499,0.000046527974,0.9833985,0.0035294413,0.0005659202,0.0008235528,0.000007817117,0.000018827843,0.0008908911],"genre_scores_gemma":[0.9550284,0.000010938615,0.04400017,0.00054084026,0.000040566592,0.00003163583,0.000019099738,0.000016463666,0.00031185916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806184,0.00038790834,0.00060472195,0.00020211512,0.0005241682,0.00021925606],"domain_scores_gemma":[0.9975962,0.00017627681,0.00092983345,0.0004177285,0.0007649708,0.00011497771],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00096964824,0.00015852683,0.00022991405,0.00012899115,0.0001520556,0.0019084355,0.0013660149,0.000036150795,0.00009396417],"category_scores_gemma":[0.00015786811,0.000110404675,0.00005881663,0.0005347084,0.00002022308,0.0015619261,0.00011407138,0.0001653513,0.000051720832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029687715,0.00006199873,0.00009351574,0.0000034099235,0.000025201554,0.000012355985,0.00039992653,0.99487925,0.00026713833,0.00033531067,0.0011039935,0.0027882392],"study_design_scores_gemma":[0.0014941653,0.00018544875,0.0005991851,0.00013050044,0.000010475085,0.000010469998,0.00018357731,0.99658614,0.00014587225,0.00021826154,0.00030724154,0.00012866108],"about_ca_topic_score_codex":0.00003634071,"about_ca_topic_score_gemma":0.0000051110246,"teacher_disagreement_score":0.94430995,"about_ca_system_score_codex":0.00021552079,"about_ca_system_score_gemma":0.00024687062,"threshold_uncertainty_score":0.9991277},"labels":[],"label_agreement":null},{"id":"W1993359355","doi":"10.1109/icc.2012.6363674","title":"A constraint sufficient statistics based distributed particle filter for bearing only tracking","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle filter; Tracking (education); Computer science; Dimension (graph theory); Statistic; Node (physics); Bandwidth (computing); Control theory (sociology); Constraint (computer-aided design); Filter (signal processing); Algorithm; Mathematical optimization; Mathematics; Statistics; Engineering; Artificial intelligence; Computer network; Computer vision","score_opus":0.04162410505335497,"score_gpt":0.2740477261035307,"score_spread":0.23242362105017572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993359355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02045542,0.00004028388,0.9767324,0.00046446,0.00056458096,0.0006080186,0.000662297,0.00028966911,0.00018287508],"genre_scores_gemma":[0.92285633,1.9641043e-7,0.07649363,0.00027851138,0.00008665963,0.00007362304,0.00011588138,0.000013716654,0.000081430684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978976,0.000081918886,0.00045734787,0.0003515548,0.00034018312,0.00087138556],"domain_scores_gemma":[0.9983102,0.000499953,0.00014467069,0.0005330292,0.0002031164,0.0003090281],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073519006,0.00020210643,0.00024555917,0.000047095444,0.0001731673,0.00032592163,0.0005319765,0.000064326196,0.000054823155],"category_scores_gemma":[0.0002840721,0.00018281033,0.0001011183,0.0002402249,0.00005618607,0.00045870282,0.000096989,0.000097786535,0.00006922899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006087173,0.0016199246,0.04276043,0.00016358976,0.00016256851,0.000023549053,0.0013220763,0.0045328815,0.00929006,0.86768496,0.010242174,0.062136885],"study_design_scores_gemma":[0.0018440548,0.00009904454,0.017574396,0.000032218126,0.000029751263,0.000015416219,0.00015704795,0.9641825,0.008239183,0.00013894297,0.007303354,0.00038407397],"about_ca_topic_score_codex":0.000035586672,"about_ca_topic_score_gemma":0.00001566049,"teacher_disagreement_score":0.9596496,"about_ca_system_score_codex":0.00013107793,"about_ca_system_score_gemma":0.00012786278,"threshold_uncertainty_score":0.74547887},"labels":[],"label_agreement":null},{"id":"W1993753913","doi":"10.1109/jsac.2012.120608","title":"Adaptive Communication-Constrained Deployment of Unmanned Vehicle Systems","year":2012,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Overhead (engineering); Software deployment; Network packet; Distributed computing; Wireless; Wireless network; Robot; Mobile robot; Real-time computing; Computer network; Artificial intelligence; Telecommunications","score_opus":0.043064034559626825,"score_gpt":0.28720141255050674,"score_spread":0.24413737799087992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993753913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3512051,0.030199433,0.5663658,0.014225258,0.0044435584,0.0050362493,0.00026645116,0.0011590691,0.027099065],"genre_scores_gemma":[0.9915281,0.00037676113,0.0077678366,0.000086150896,0.0000638542,0.00009677841,0.000016194499,0.000020765565,0.0000435612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960962,0.001607784,0.0010788678,0.00018849355,0.0005140418,0.0005146139],"domain_scores_gemma":[0.99413145,0.0011643106,0.0008308459,0.0028569559,0.0007553977,0.00026101607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014815343,0.00023093638,0.0004320159,0.00041792466,0.0003860364,0.00016101796,0.0040172287,0.00012240579,0.0000062619815],"category_scores_gemma":[0.00025691188,0.0002221328,0.00011175307,0.0013864087,0.0001527767,0.0008180361,0.00026721973,0.00081748905,0.00004332634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039634056,0.0136347655,0.080206834,0.00011052713,0.0018884119,0.000029020337,0.015871631,0.029480383,0.027746702,0.7921391,0.012600175,0.025896091],"study_design_scores_gemma":[0.011829991,0.0011801874,0.12774551,0.0031736267,0.0002211794,0.0010292121,0.0036791174,0.8231482,0.006445777,0.0028384395,0.016551346,0.0021574025],"about_ca_topic_score_codex":0.00015240112,"about_ca_topic_score_gemma":0.000066477565,"teacher_disagreement_score":0.7936678,"about_ca_system_score_codex":0.0004318167,"about_ca_system_score_gemma":0.0002631797,"threshold_uncertainty_score":0.90583134},"labels":[],"label_agreement":null},{"id":"W1994831457","doi":"10.1109/vetecf.2010.5594523","title":"Detecting the Defective Nodes in Wireless Sensor Networks Using the Nonlinear Consensus of Median","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireless sensor network; Outlier; Estimator; Computer science; Algorithm; Nonlinear system; Algorithm design; Consensus algorithm; Scheme (mathematics); Wireless network; Distributed algorithm; Wireless; Mathematics; Computer network; Artificial intelligence; Distributed computing; Statistics","score_opus":0.017315975930108283,"score_gpt":0.2532128777136287,"score_spread":0.23589690178352044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994831457","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6823192,0.000019403806,0.31582952,0.00051170087,0.00062433927,0.0003281341,0.0000035272656,0.000050953306,0.00031319348],"genre_scores_gemma":[0.9910882,8.204695e-7,0.008635093,0.00009897142,0.00014532136,0.000009880162,5.3323447e-7,0.000009666517,0.00001149442],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985005,0.00027873658,0.0003621364,0.00027350904,0.00024303126,0.00034205033],"domain_scores_gemma":[0.9975233,0.0013737102,0.00021405022,0.00068569294,0.00015161252,0.000051602576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011397325,0.00014531813,0.00021692275,0.0000572885,0.00017338998,0.0001098994,0.00086501846,0.00009693044,0.0000037681943],"category_scores_gemma":[0.00026396834,0.00008015879,0.00008176871,0.00050961477,0.00016873502,0.00008398672,0.00018754421,0.00045514925,0.0000038600783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014900744,0.00053602277,0.15462063,0.00009960335,0.0005716611,0.00027800145,0.013839908,0.16961527,0.4800987,0.04183582,0.00016790384,0.13818745],"study_design_scores_gemma":[0.00037737182,0.000010476603,0.003054839,0.000021523738,0.000008403014,0.000055401553,0.00064297713,0.99073213,0.0049057268,0.000056243873,0.000029742345,0.0001051573],"about_ca_topic_score_codex":0.0014852601,"about_ca_topic_score_gemma":0.0031540766,"teacher_disagreement_score":0.82111686,"about_ca_system_score_codex":0.000030625393,"about_ca_system_score_gemma":0.00007474849,"threshold_uncertainty_score":0.32687807},"labels":[],"label_agreement":null},{"id":"W1995227418","doi":"10.1109/cgncc.2014.7007464","title":"Consensus based on learning game theory","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Game theory; Convergence (economics); Equivalence (formal languages); Computer science; Perspective (graphical); Mathematical optimization; Fictitious play; Potential game; Algorithmic game theory; Game complexity; Theoretical computer science; Artificial intelligence; Mathematical economics; Repeated game; Mathematics; Algorithm; Computational complexity theory; Discrete mathematics","score_opus":0.008916519068758356,"score_gpt":0.2139182952158879,"score_spread":0.20500177614712956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995227418","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002085471,0.000007225416,0.90426594,0.00094147195,0.00031765908,0.000114944916,8.148344e-7,0.00047635208,0.091790095],"genre_scores_gemma":[0.9930063,1.0771122e-7,0.003105231,0.0011125137,0.00005658822,0.000010274781,0.0000024496799,0.000008097424,0.0026984662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847037,0.00048739,0.00017886818,0.00032891062,0.00026471855,0.00026976544],"domain_scores_gemma":[0.9983554,0.0008415923,0.000078412515,0.00056721794,0.000057677968,0.000099714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009769503,0.00012390982,0.0001531005,0.000074450705,0.000072977266,0.00014053762,0.00054970785,0.00004952135,0.000047217854],"category_scores_gemma":[0.00043699646,0.00010105091,0.00006565214,0.00015357588,0.000030133437,0.000054787488,0.000057326946,0.00014082737,0.0008102434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028891545,0.00008552244,0.0013110451,0.000012157169,0.000020011157,0.000016305132,0.00010679195,0.024137037,0.001052884,0.90274507,0.0022471843,0.06823712],"study_design_scores_gemma":[0.00079032127,0.000113716706,0.0012131113,0.00001762596,0.0000029855312,0.0000031714228,0.000014370983,0.96907085,0.0005582883,0.0013292829,0.026733913,0.00015233623],"about_ca_topic_score_codex":0.000014461138,"about_ca_topic_score_gemma":0.000001712245,"teacher_disagreement_score":0.9909208,"about_ca_system_score_codex":0.000030412306,"about_ca_system_score_gemma":0.000032464635,"threshold_uncertainty_score":0.99996775},"labels":[],"label_agreement":null},{"id":"W1995649532","doi":"10.1007/s10846-013-9951-2","title":"Fault Tolerant Formations Control of UAVs Subject to Permanent and Intermittent Faults","year":2013,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Ministry of Education of the People's Republic of China; National Natural Science Foundation of China","keywords":"Fault tolerance; Fault (geology); Control (management); Scheme (mathematics); Control theory (sociology); Computer science; Engineering; Distributed computing; Geology; Artificial intelligence; Seismology; Mathematics","score_opus":0.015221396096091631,"score_gpt":0.24065047535459283,"score_spread":0.2254290792585012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995649532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08850504,0.0012587352,0.9051425,0.0011789411,0.002486401,0.0012014261,0.000009991872,0.00003148277,0.00018547881],"genre_scores_gemma":[0.9980881,0.000032973694,0.0012980715,0.00014813563,0.00018946748,0.000047621874,0.0000017086239,0.000015784308,0.00017812946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99605703,0.0002725512,0.0021358386,0.00027153513,0.0008312605,0.00043175794],"domain_scores_gemma":[0.996249,0.00030809632,0.0012629561,0.00054814917,0.0012030541,0.00042870064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000991846,0.0002953271,0.0009116324,0.00045495224,0.000083925435,0.00031029625,0.0011060569,0.00009688796,0.00001348665],"category_scores_gemma":[0.0001995134,0.00022111209,0.00027553443,0.00032113589,0.00004318336,0.00079835666,0.00014359498,0.00022732644,0.00012862017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028518925,0.001748866,0.014727911,0.0016519927,0.002736346,0.0002784046,0.021888483,0.81488097,0.031584993,0.025125552,0.017437827,0.06765348],"study_design_scores_gemma":[0.0026052904,0.0014326082,0.012482917,0.0021230697,0.00015746913,0.0018011238,0.003689916,0.97040105,0.0018518477,0.00013175205,0.0027048993,0.0006180752],"about_ca_topic_score_codex":0.00030267853,"about_ca_topic_score_gemma":0.000008154271,"teacher_disagreement_score":0.9095831,"about_ca_system_score_codex":0.00021770396,"about_ca_system_score_gemma":0.0001007032,"threshold_uncertainty_score":0.9016689},"labels":[],"label_agreement":null},{"id":"W1995900492","doi":"10.1109/acc.2012.6315588","title":"Cooperative control of multi-agent systems with limited angular field of view","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Double integrator; Controller (irrigation); Context (archaeology); Computer science; Containment (computer programming); Set (abstract data type); Consensus; Control theory (sociology); Position (finance); Multi-agent system; Control (management); Laplace operator; Integrator; Field (mathematics); Distributed computing; Artificial intelligence; Mathematics; Computer network; Bandwidth (computing)","score_opus":0.020959730406180762,"score_gpt":0.25288888764392947,"score_spread":0.2319291572377487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995900492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009125927,0.0026838488,0.98568964,0.00016103573,0.0004289559,0.00093889836,0.00003159287,0.00009154775,0.00084856676],"genre_scores_gemma":[0.9958574,0.000010419435,0.0035572262,0.00015376878,0.00004468929,0.000065005755,0.0000050835074,0.000010960473,0.00029544762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980752,0.00025962893,0.0005945949,0.00026677432,0.0004144301,0.00038941356],"domain_scores_gemma":[0.9979964,0.00027028352,0.0003568705,0.00074432296,0.0004610024,0.00017110913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005296757,0.00021417503,0.000604811,0.000100789875,0.000042030442,0.000046023844,0.00065404456,0.000090148824,0.000023635415],"category_scores_gemma":[0.00009900795,0.00014803975,0.00009265855,0.00041902548,0.000050531366,0.00046448177,0.000081403334,0.00009357705,0.000027758144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008180087,0.008938323,0.193572,0.0032843621,0.005891687,0.00011622764,0.01391192,0.026562069,0.1632508,0.54656476,0.0089225015,0.028167343],"study_design_scores_gemma":[0.014964602,0.0018916931,0.01282046,0.0009551835,0.00025937028,0.00008824191,0.001227336,0.8899069,0.065410726,0.00000655384,0.011291639,0.0011773227],"about_ca_topic_score_codex":0.00033254677,"about_ca_topic_score_gemma":0.00001395611,"teacher_disagreement_score":0.98673147,"about_ca_system_score_codex":0.000037358357,"about_ca_system_score_gemma":0.00006404894,"threshold_uncertainty_score":0.6036886},"labels":[],"label_agreement":null},{"id":"W1996400016","doi":"10.1007/s12555-012-9315-x","title":"Fault-tolerant shortest connection topology design for formation control","year":2014,"lang":"en","type":"article","venue":"International Journal of Control Automation and Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Connection (principal bundle); Control reconfiguration; Topology (electrical circuits); Fault tolerance; Computer science; Shortest path problem; Distributed computing; Path (computing); Controller (irrigation); Network topology; Control (management); Engineering; Computer network; Theoretical computer science; Embedded system; Artificial intelligence","score_opus":0.019044983304223037,"score_gpt":0.2649027729227014,"score_spread":0.24585778961847837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996400016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037267983,0.00024447017,0.9877805,0.0030686415,0.0042369543,0.00069991895,0.00002482971,0.00008295485,0.0001349159],"genre_scores_gemma":[0.9969853,0.000008336046,0.0017915011,0.00044483738,0.0006432355,0.00006812095,0.000009453254,0.000009615018,0.0000395623],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973764,0.0005043399,0.0011490964,0.00019032431,0.00057042553,0.0002094258],"domain_scores_gemma":[0.9959749,0.00094732124,0.0012340614,0.00017089139,0.0015691667,0.00010368536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023455904,0.00017199281,0.00046117467,0.00033430776,0.00010897235,0.000522626,0.00059864635,0.000113844704,0.000003969731],"category_scores_gemma":[0.00056710903,0.00014482804,0.00014646332,0.00008222648,0.000030010078,0.0012269669,0.000017568558,0.00010645746,0.000008070229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016442665,0.00049193774,0.002748141,0.00019600353,0.0021569317,0.00005170792,0.001945595,0.30938232,0.029416773,0.50783396,0.009906847,0.13422553],"study_design_scores_gemma":[0.0076796543,0.00033168597,0.0011981055,0.00008992072,0.000040317766,0.00053597515,0.00007083514,0.9791285,0.000111130874,0.0008162983,0.009858162,0.00013945164],"about_ca_topic_score_codex":0.000021868993,"about_ca_topic_score_gemma":0.0000046494124,"teacher_disagreement_score":0.99325854,"about_ca_system_score_codex":0.0001449923,"about_ca_system_score_gemma":0.00006718929,"threshold_uncertainty_score":0.5905916},"labels":[],"label_agreement":null},{"id":"W1996715445","doi":"10.1109/acc.2010.5531323","title":"Formation control of VTOL UAVs without linear-velocity measurements","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Control theory (sociology); Thrust; Torque; Angular velocity; Attitude control; Computer science; Control (management); Vehicle dynamics; Control engineering; Simulation; Engineering; Aerospace engineering; Physics","score_opus":0.03048006535633884,"score_gpt":0.25974820972020524,"score_spread":0.2292681443638664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996715445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028906984,0.000010214078,0.96510535,0.00044832288,0.000638573,0.00045276416,0.0000112068465,0.00017692972,0.004249625],"genre_scores_gemma":[0.98395,3.3776914e-7,0.01563898,0.0001477616,0.000060502232,0.000026980895,0.0000052821597,0.0000060216216,0.00016410984],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840873,0.000076788056,0.00045457314,0.00023618077,0.00056853204,0.00025521888],"domain_scores_gemma":[0.9985462,0.000046974797,0.00025979662,0.00064011925,0.0003985593,0.000108394874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007690657,0.00013839423,0.00025596793,0.000074664946,0.00006735337,0.000072915485,0.0008088364,0.00008959082,0.000029714782],"category_scores_gemma":[0.00015649988,0.00011492904,0.00008366022,0.00019487043,0.00003181791,0.00080097903,0.0000714688,0.00014961469,0.00011309503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009781259,0.0006974188,0.056595232,0.00017716414,0.00030692568,0.000006067662,0.0010877417,0.0004740301,0.80577934,0.06728592,0.0033395966,0.06415276],"study_design_scores_gemma":[0.004061852,0.0000747017,0.012531723,0.000025010939,0.000022729524,0.000013806172,0.00002156291,0.90818065,0.071256846,0.0002927106,0.0032345043,0.0002838804],"about_ca_topic_score_codex":0.00009417012,"about_ca_topic_score_gemma":0.00009531026,"teacher_disagreement_score":0.955043,"about_ca_system_score_codex":0.000030179346,"about_ca_system_score_gemma":0.00006321644,"threshold_uncertainty_score":0.46866703},"labels":[],"label_agreement":null},{"id":"W1997087276","doi":"10.1115/1.4006622","title":"A Target Tracking Approach for Nonholonomic Agents Based on Artificial Potentials and Sliding Mode Control","year":2012,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonholonomic system; Control theory (sociology); Constructive; Tracking (education); Computer science; Scheme (mathematics); Task (project management); Sliding mode control; Set (abstract data type); Control (management); Mode (computer interface); Control engineering; Artificial intelligence; Robot; Engineering; Mathematics; Mobile robot; Process (computing); Nonlinear system; Physics","score_opus":0.04413772361597356,"score_gpt":0.2591244539431792,"score_spread":0.2149867303272056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997087276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021711104,0.002342995,0.97238344,0.00032055366,0.0016501423,0.001453464,0.00005017787,0.00003620909,0.00005191618],"genre_scores_gemma":[0.99703735,0.00000513256,0.0021615352,0.00014846129,0.0005099662,0.00009859751,0.0000033249044,0.000026804757,0.000008823575],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964252,0.00047796554,0.0011852753,0.00035076533,0.0009371426,0.0006236636],"domain_scores_gemma":[0.99745333,0.00021697373,0.0011892231,0.00031334648,0.0004906172,0.00033653324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0055533005,0.00033831157,0.00091557304,0.00030719096,0.0002357335,0.0004761508,0.00044805405,0.00013739904,8.8010125e-7],"category_scores_gemma":[0.00023783393,0.0002801618,0.00025056294,0.00010741201,0.000026813332,0.00069414394,0.000021380421,0.00019867648,0.0000015619229],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007853594,0.005588088,0.06324562,0.0028362283,0.00788954,0.00010699197,0.0036186106,0.31472662,0.49358985,0.021562614,0.0017449444,0.077237286],"study_design_scores_gemma":[0.0082139205,0.0002949042,0.0033620994,0.0002155537,0.00021915526,0.00006738582,0.00013514202,0.9869013,0.00009433177,0.000049910137,0.00017031984,0.00027597853],"about_ca_topic_score_codex":0.000015928494,"about_ca_topic_score_gemma":0.0000014547057,"teacher_disagreement_score":0.97532624,"about_ca_system_score_codex":0.0003165958,"about_ca_system_score_gemma":0.00011313998,"threshold_uncertainty_score":0.9999651},"labels":[],"label_agreement":null},{"id":"W1998414357","doi":"10.1007/s10846-014-0031-z","title":"Coverage with a Team of Wheeled Mobile Robots","year":2014,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Mobile robot; Robot; Intuition; Engineering; Control engineering; Control system; Control (management); Computer science; Real-time computing; Artificial intelligence","score_opus":0.009793068330668073,"score_gpt":0.2248973909141046,"score_spread":0.21510432258343654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1998414357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01023274,0.0010956586,0.98430103,0.000075717595,0.0024015969,0.0006207008,0.0000035532305,0.000047150028,0.0012218504],"genre_scores_gemma":[0.9931285,0.00003926328,0.0060635484,0.00003909471,0.00034962266,0.000022458624,0.0000015020722,0.000027079703,0.00032893653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99575746,0.00046231775,0.0018021092,0.00033342766,0.0011934892,0.00045119776],"domain_scores_gemma":[0.9952301,0.00043485477,0.0021808378,0.0008592421,0.0009964459,0.00029854095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018473539,0.0003283013,0.0011413392,0.00035152037,0.00006994684,0.00025811506,0.0016398707,0.00012258514,0.000015332775],"category_scores_gemma":[0.00019231137,0.00023084268,0.00030185498,0.00052355585,0.00006343252,0.0005490236,0.00011228227,0.00029557786,0.000055642136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105127554,0.00048691191,0.0030523865,0.00031570523,0.00052065874,0.00007057889,0.0008847722,0.9683411,0.0025396827,0.013409067,0.001968525,0.008305466],"study_design_scores_gemma":[0.006554818,0.008345553,0.0021122308,0.005600256,0.00040921668,0.003856467,0.001749047,0.9311476,0.009609286,0.0005752963,0.028542353,0.0014979101],"about_ca_topic_score_codex":0.00008883042,"about_ca_topic_score_gemma":0.000007110147,"teacher_disagreement_score":0.98289573,"about_ca_system_score_codex":0.0002133421,"about_ca_system_score_gemma":0.00021200409,"threshold_uncertainty_score":0.9413491},"labels":[],"label_agreement":null},{"id":"W1999297938","doi":"10.1109/acc.2013.6580212","title":"Formation control of a team of single-integrator agents with measurement error","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Double integrator; Control theory (sociology); Observational error; Boundary (topology); Computer science; Workspace; Function (biology); Pairwise comparison; Obstacle; Obstacle avoidance; Magnitude (astronomy); Distance measurement; Control (management); Mathematics; Algorithm; Mathematical analysis; Physics; Statistics; Mobile robot; Artificial intelligence; Robot; Law","score_opus":0.034759349581989916,"score_gpt":0.22143686363924392,"score_spread":0.186677514057254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999297938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016919874,0.000030029443,0.97767305,0.00025151332,0.00009731279,0.0008433774,0.000007760823,0.000078949895,0.0040981323],"genre_scores_gemma":[0.9959255,3.0375833e-7,0.0038364031,0.00006527598,0.000009942012,0.00007299526,0.0000022091886,0.0000057199027,0.000081692524],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982957,0.000113256465,0.0004757076,0.0001796087,0.00073111005,0.00020457162],"domain_scores_gemma":[0.99826014,0.000037173544,0.0003630551,0.00040274553,0.0008552939,0.00008158623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004418885,0.00013254015,0.0002842466,0.00008804508,0.000027084141,0.000054968372,0.000492085,0.000040380008,0.000038504706],"category_scores_gemma":[0.00008134476,0.000088857734,0.000066819535,0.00021489887,0.000029897345,0.00069640647,0.00003573144,0.00005001115,0.00004600969],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017938681,0.0024961738,0.010282306,0.0005722645,0.0008292538,0.000005486255,0.0032046272,0.0015071342,0.8831903,0.025491495,0.020985486,0.051256143],"study_design_scores_gemma":[0.005859064,0.0010228226,0.0056820763,0.00027054426,0.000049124534,0.000011348872,0.00059678213,0.8605053,0.12387254,0.00017979377,0.0016175475,0.0003330623],"about_ca_topic_score_codex":0.0002209144,"about_ca_topic_score_gemma":0.00005129281,"teacher_disagreement_score":0.9790056,"about_ca_system_score_codex":0.000100135716,"about_ca_system_score_gemma":0.000056479003,"threshold_uncertainty_score":0.36235133},"labels":[],"label_agreement":null},{"id":"W1999673997","doi":"10.1109/acc.2013.6580066","title":"Formation flight of multiple fixed-wing unmanned aerial vehicles","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Redundancy (engineering); Fixed wing; Computer science; Wing; Simulation; Real-time computing; Aerospace engineering; Engineering","score_opus":0.013421883556349885,"score_gpt":0.20894965886272912,"score_spread":0.19552777530637924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999673997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29702798,0.00002817336,0.6978562,0.00076169666,0.0006571237,0.00054643967,0.0000073959186,0.00025395016,0.0028610846],"genre_scores_gemma":[0.99169415,0.0000010216843,0.007670785,0.00007418845,0.000072960436,0.000043277614,0.000010020614,0.0000055124046,0.0004280959],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988195,0.000066148,0.00040119383,0.00019837849,0.00026649053,0.00024833105],"domain_scores_gemma":[0.99906254,0.00010668409,0.00016329961,0.0004332706,0.00015935718,0.000074851945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018243068,0.000113697955,0.00018502516,0.00008097751,0.00006872241,0.00015949136,0.0006232554,0.000060299742,0.000052621075],"category_scores_gemma":[0.00007865121,0.00009390973,0.000073314026,0.00020006855,0.000020431211,0.0015365853,0.00013661326,0.000047672736,0.00037825888],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031385567,0.0003135467,0.0046816263,0.00019346786,0.00011725751,0.0000062054173,0.0022703868,0.0012336085,0.8261079,0.07092871,0.028430061,0.06568585],"study_design_scores_gemma":[0.0017791123,0.000062963336,0.0071489355,0.000039702372,0.0000053355097,0.0000054956336,0.00013635529,0.84037834,0.14544202,0.000559353,0.004208957,0.00023340195],"about_ca_topic_score_codex":0.00031570662,"about_ca_topic_score_gemma":0.000019648189,"teacher_disagreement_score":0.83914477,"about_ca_system_score_codex":0.000036940142,"about_ca_system_score_gemma":0.000021185551,"threshold_uncertainty_score":0.48618788},"labels":[],"label_agreement":null},{"id":"W2004184699","doi":"10.1117/12.669552","title":"UAV autonomy for complex environments","year":2006,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Flexibility (engineering); Context (archaeology); Situation awareness; Enabling; Command and control; Drone; Battlespace; Isolation (microbiology); Distributed computing; Computer security; Systems engineering; Engineering","score_opus":0.013654418023809458,"score_gpt":0.220197850756867,"score_spread":0.20654343273305753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004184699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.971433,0.000076831835,0.020297745,0.003399016,0.00041180765,0.001293188,0.000133679,0.00016623182,0.0027885418],"genre_scores_gemma":[0.607326,0.0000115167995,0.39034098,0.00015976517,0.0006712604,0.0005890578,0.000040749692,0.000067114015,0.0007935691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726856,1.5168748e-8,0.00086914905,0.0005609155,0.0007518066,0.000549571],"domain_scores_gemma":[0.9983265,0.00017830088,0.0005343322,0.00011115537,0.0007277706,0.00012194394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006421658,0.0003598702,0.0004740954,0.000096915726,0.00012331929,0.00025311182,0.002165938,0.00017403481,0.0000060867446],"category_scores_gemma":[0.00021006879,0.0003191793,0.00076023355,0.00026453575,0.00016416307,0.0008245784,0.0002814577,0.00018880323,0.000004343953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024477844,0.00013840108,0.0002483877,0.00017550735,0.00022363785,5.5330645e-8,0.000060480932,0.00025454504,0.3754391,0.6169673,0.0061614388,0.00030666313],"study_design_scores_gemma":[0.0051492355,0.00055679353,0.0070212414,0.00031386467,0.00022985709,0.00002717443,0.0004499592,0.7182412,0.12701374,0.008898399,0.13101298,0.0010855581],"about_ca_topic_score_codex":0.00001908165,"about_ca_topic_score_gemma":1.398905e-7,"teacher_disagreement_score":0.71798664,"about_ca_system_score_codex":0.00033209086,"about_ca_system_score_gemma":0.00004613682,"threshold_uncertainty_score":0.99992603},"labels":[],"label_agreement":null},{"id":"W2004938022","doi":"10.1109/ccece.2014.6901011","title":"Formation stabilization of nonholonomic robots using nonlinear model predictive control","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Model predictive control; Nonholonomic system; Control theory (sociology); Computer science; Nonlinear system; Nonlinear model; Robot; Limit (mathematics); Controller (irrigation); Control (management); Predictive power; Control engineering; Mobile robot; Engineering; Artificial intelligence; Mathematics","score_opus":0.019778065901318916,"score_gpt":0.2370736728187846,"score_spread":0.2172956069174657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004938022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038101356,0.000008473491,0.96047854,0.00007970579,0.00014036923,0.00037795302,0.000024075343,0.00011494646,0.0006745709],"genre_scores_gemma":[0.94791514,6.219745e-7,0.0519378,0.00006263846,0.000035879522,0.000010566851,0.000014073455,0.0000069492353,0.000016345452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988652,0.0001004469,0.00041459946,0.00022417601,0.00021202111,0.00018354117],"domain_scores_gemma":[0.99897027,0.0000694161,0.0002668738,0.00040813535,0.00022722712,0.000058052105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040394385,0.00011166044,0.00021666817,0.000092754264,0.00005380968,0.000056729943,0.0003880887,0.00006260605,0.0000024240153],"category_scores_gemma":[0.00007407894,0.000103050756,0.000057833455,0.00015373487,0.000022654125,0.0010341206,0.00005856607,0.000047846606,0.000011670414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012992932,0.000039575276,0.00027220784,0.000016067603,0.000012801756,8.802803e-8,0.00016958694,0.9792891,0.010728164,0.00854339,0.000022913551,0.00089307927],"study_design_scores_gemma":[0.0011818275,0.00005716552,0.0002550581,0.000017271226,0.000013413879,0.0000021439228,0.000017519944,0.99506354,0.0029315667,0.0003497463,0.000013966947,0.00009676435],"about_ca_topic_score_codex":0.000030399819,"about_ca_topic_score_gemma":0.00000701736,"teacher_disagreement_score":0.90981376,"about_ca_system_score_codex":0.00009948469,"about_ca_system_score_gemma":0.00005668298,"threshold_uncertainty_score":0.42022878},"labels":[],"label_agreement":null},{"id":"W2005146451","doi":"10.1109/iros.2005.1544985","title":"Distance based communication in the surveillance task in a multi-robot system","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Task (project management); Computer science; Robot; Attractor; Variance (accounting); State (computer science); Perspective (graphical); RADIUS; Tracking (education); Interference (communication); Communications system; Work (physics); Human–computer interaction; Artificial intelligence; Computer network; Channel (broadcasting); Engineering; Algorithm; Mathematics","score_opus":0.023229956044188496,"score_gpt":0.2549444112739098,"score_spread":0.23171445522972134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005146451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049641225,0.0004523299,0.98721635,0.0045699114,0.0000925493,0.00064744195,0.000008791818,0.00017947603,0.0018689984],"genre_scores_gemma":[0.9845613,0.0000039324564,0.014793694,0.00038392842,0.000015088264,0.00015055227,0.000012180888,0.000006475343,0.000072850475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779516,0.00077099,0.00047767113,0.00033337934,0.00030588033,0.00031690387],"domain_scores_gemma":[0.9978801,0.00037665825,0.00013797924,0.0015095079,0.000056189445,0.000039541814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016977964,0.00014782709,0.00022246136,0.0000975192,0.00007097543,0.00019147804,0.002184568,0.00005790153,0.0000022608633],"category_scores_gemma":[0.00006758746,0.000108955624,0.000047625042,0.0007191775,0.000032433694,0.00036468412,0.000096652126,0.00017833743,0.00008019671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111814465,0.0029179133,0.371158,0.000436682,0.000053976593,0.00014967629,0.009181508,0.16228049,0.0026803396,0.40480682,0.0040750825,0.042147692],"study_design_scores_gemma":[0.0013898491,0.000008181204,0.09841907,0.000081904225,6.827523e-7,0.0000040841956,0.0001967025,0.89661354,0.00003076378,0.0000070544193,0.003107816,0.00014033007],"about_ca_topic_score_codex":0.00080966443,"about_ca_topic_score_gemma":0.0105053615,"teacher_disagreement_score":0.97959715,"about_ca_system_score_codex":0.00027841065,"about_ca_system_score_gemma":0.000050151688,"threshold_uncertainty_score":0.58622384},"labels":[],"label_agreement":null},{"id":"W2005422432","doi":"10.1109/cdc.2011.6160772","title":"Distributed H&lt;inf&gt;&amp;#x221E;&lt;/inf&gt; optimal control of networked uncertain nonlinear Euler-Lagrange systems with switching communication network topologies","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"","keywords":"Network topology; Synchronization (alternating current); Control theory (sociology); Trajectory; Nonlinear system; Computer science; State (computer science); Controller (irrigation); Telecommunications network; Tracking (education); Topology (electrical circuits); Control engineering; Control (management); Mathematics; Engineering; Computer network; Algorithm; Artificial intelligence","score_opus":0.032828856149028425,"score_gpt":0.23748843563807417,"score_spread":0.20465957948904576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005422432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019219154,0.0023713429,0.9719885,0.00044637447,0.0009441294,0.0017120435,0.00017439507,0.0009189315,0.0022251413],"genre_scores_gemma":[0.9421854,0.000077332916,0.05657261,0.000115923285,0.00028478084,0.00022822905,0.0003097502,0.000053111176,0.00017285874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941378,0.0010115182,0.0016224557,0.0009648938,0.00091785315,0.0013454407],"domain_scores_gemma":[0.9934193,0.0010488929,0.0013069673,0.0030813168,0.0007994584,0.0003440903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020258036,0.00074305985,0.0013495075,0.00017308888,0.0005042936,0.00042095166,0.0036228567,0.00037698724,0.000040328923],"category_scores_gemma":[0.00021957337,0.0005897095,0.00028002515,0.0012467323,0.00029023984,0.0010495273,0.0006044788,0.0004987886,0.000073880066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024594772,0.0022173128,0.033434674,0.0006779662,0.0036789363,0.00014553386,0.005787229,0.66239053,0.0046709436,0.25614667,0.015205157,0.013185564],"study_design_scores_gemma":[0.005523623,0.00057054183,0.0047653713,0.0005736067,0.00021873378,0.00007914138,0.00044439538,0.9648028,0.00009253206,0.00030055695,0.021460382,0.001168337],"about_ca_topic_score_codex":0.0016966355,"about_ca_topic_score_gemma":0.00071188057,"teacher_disagreement_score":0.92296624,"about_ca_system_score_codex":0.00023182323,"about_ca_system_score_gemma":0.00021047679,"threshold_uncertainty_score":0.9996554},"labels":[],"label_agreement":null},{"id":"W2005630414","doi":"10.1109/ecc.2014.6862366","title":"Actuator fault accommodation strategy for a team of LTI multi-agent systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Accommodation; Multi-agent system; Computer science; Actuator; Fault (geology); Graph; Linear matrix inequality; Directed graph; Graph theory; Distributed computing; Mathematical optimization; Control (management); Mathematics; Artificial intelligence; Algorithm; Theoretical computer science","score_opus":0.0434249736836202,"score_gpt":0.2864028743470531,"score_spread":0.2429779006634329,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005630414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066081854,0.000049397077,0.98941433,0.00013665503,0.0008057787,0.0012597021,0.00006386952,0.00024461583,0.001417449],"genre_scores_gemma":[0.97398275,0.000001724839,0.024791962,0.000047848916,0.00010937604,0.00022553124,0.000036917987,0.000016394462,0.0007874753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794936,0.0001613163,0.00065938366,0.00047315858,0.00037496252,0.00038179164],"domain_scores_gemma":[0.9979638,0.00026743684,0.00037948502,0.0008964392,0.00034551206,0.00014733472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080539647,0.00022275969,0.00041463593,0.00012248746,0.00009068879,0.0002365783,0.0011004795,0.00012231024,0.0000066275074],"category_scores_gemma":[0.00018772035,0.00018669963,0.00014714396,0.00022319125,0.00002666834,0.00053193467,0.00012049005,0.00007558936,0.00006841052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010592348,0.0017433435,0.0018395361,0.0011207678,0.0005463149,0.000003248595,0.0012877298,0.04301234,0.076601475,0.703623,0.024599908,0.14551643],"study_design_scores_gemma":[0.0019815636,0.00016780799,0.00082852034,0.00004257567,0.000016087275,0.0000042200886,0.00013930503,0.98316723,0.0024608953,0.000105865176,0.010857363,0.00022854272],"about_ca_topic_score_codex":0.00023405901,"about_ca_topic_score_gemma":0.000036788973,"teacher_disagreement_score":0.96737456,"about_ca_system_score_codex":0.00008624523,"about_ca_system_score_gemma":0.00007947947,"threshold_uncertainty_score":0.761339},"labels":[],"label_agreement":null},{"id":"W2007718303","doi":"10.1109/ascc.2013.6606205","title":"Robust adaptive attitude synchronization of rigid body networks with unknown inertias","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronization (alternating current); Control theory (sociology); Inertia; Manifold (fluid mechanics); Lyapunov function; Computer science; Nonlinear system; Task (project management); Rigid body; Function (biology); Artificial intelligence; Engineering; Control (management); Channel (broadcasting)","score_opus":0.013421145225905356,"score_gpt":0.19028043863425,"score_spread":0.17685929340834466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007718303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029666333,0.000104522886,0.99138373,0.00023342973,0.00018087531,0.0005264778,0.0000017013533,0.0001878892,0.004414762],"genre_scores_gemma":[0.9761214,0.000003913454,0.02301441,0.00009149478,0.00006643539,0.00005677376,0.000012468336,0.000012065756,0.0006210398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858475,0.00008176897,0.00033350894,0.00036661106,0.00031943253,0.00031395486],"domain_scores_gemma":[0.99862176,0.000072879186,0.00020372908,0.0005892339,0.000401702,0.00011066802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014436127,0.00017850369,0.00025203533,0.000073061514,0.00006053205,0.00014102318,0.00068626145,0.00007725317,0.00007984029],"category_scores_gemma":[0.000020249268,0.00012936923,0.000044122808,0.00050861965,0.000055100965,0.0007978708,0.00013639688,0.00009570085,0.00009842989],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031908585,0.000411788,0.013217104,0.00004403036,0.0003555659,0.000016923523,0.00029972097,0.80524766,0.00087143143,0.15643741,0.009554519,0.013511919],"study_design_scores_gemma":[0.00065955985,0.00017261293,0.009036907,0.00005294537,0.000012668167,0.0000086612,0.000023041142,0.9893723,0.00018001578,0.000040872183,0.000258181,0.00018224178],"about_ca_topic_score_codex":0.0006505752,"about_ca_topic_score_gemma":0.000106680294,"teacher_disagreement_score":0.9731548,"about_ca_system_score_codex":0.00007391541,"about_ca_system_score_gemma":0.000071125796,"threshold_uncertainty_score":0.5275524},"labels":[],"label_agreement":null},{"id":"W2007723076","doi":"10.1109/cdc.2012.6426307","title":"Adaptive docking using range measurements","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adaptive control; Control theory (sociology); Computer science; Motion control; Convergence (economics); Equivalence (formal languages); Artificial intelligence; Mathematics; Control (management); Robot","score_opus":0.1748591122245565,"score_gpt":0.2980854527249,"score_spread":0.1232263405003435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007723076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014561764,0.00030117974,0.9717547,0.000052069598,0.0010356819,0.00022584056,0.0000017242807,0.00021375983,0.01185328],"genre_scores_gemma":[0.98086107,3.530912e-7,0.018702416,0.000144287,0.00016678986,0.000009337386,6.6914185e-7,0.0000076006086,0.00010749345],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985562,0.0001076078,0.00020326403,0.00021371525,0.00044160167,0.0004775986],"domain_scores_gemma":[0.9992184,0.000033395525,0.00009110571,0.00040811358,0.0000953003,0.0001536895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006100187,0.00012889621,0.00015032287,0.00006603201,0.00010688251,0.00011405222,0.00054273196,0.000043014905,0.000026526839],"category_scores_gemma":[0.000032699914,0.00011199412,0.000062689105,0.00023858252,0.000012167217,0.0011306851,0.00015514507,0.00006408654,0.0002016264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006815399,0.0012586856,0.63381296,0.000081519385,0.0009286177,0.000039756604,0.0068936963,0.003959194,0.06260133,0.1924263,0.0063498346,0.09157996],"study_design_scores_gemma":[0.0038665922,0.00008332565,0.05667813,0.00015685541,0.00007466027,0.000071802286,0.00035277422,0.9183704,0.01019897,0.00037960883,0.008493962,0.0012728691],"about_ca_topic_score_codex":0.00014682287,"about_ca_topic_score_gemma":0.0000054764764,"teacher_disagreement_score":0.9662993,"about_ca_system_score_codex":0.00014453135,"about_ca_system_score_gemma":0.000028493898,"threshold_uncertainty_score":0.45669878},"labels":[],"label_agreement":null},{"id":"W2008943153","doi":"10.1109/acc.2013.6580681","title":"Distributed coordination of a network of nonidentical agents with limited communication capabilities in the presence of fixed obstacles","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Voronoi diagram; Computer science; Visibility; Obstacle; Software deployment; Function (biology); Distributed computing; Mathematical optimization; Topology (electrical circuits); Mathematics; Geography","score_opus":0.01689684829079282,"score_gpt":0.233626136433355,"score_spread":0.21672928814256218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008943153","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73736113,0.00010616815,0.2598964,0.0010737976,0.000045801182,0.0010156751,0.000026240506,0.000031092484,0.00044370472],"genre_scores_gemma":[0.99624926,0.000005091578,0.0035727208,0.000017154782,0.0000048921,0.00007839112,0.00003832972,0.0000037425305,0.000030437966],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99816126,0.00045023218,0.0005933077,0.00017007897,0.00043466417,0.00019043728],"domain_scores_gemma":[0.9972285,0.0008924512,0.00037025093,0.000957231,0.0005219853,0.000029562396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006271624,0.00010497194,0.00027315976,0.00005121324,0.000035537232,0.00004948715,0.0012923862,0.000051966537,0.000016381371],"category_scores_gemma":[0.00030089507,0.00006933793,0.00004822264,0.000729375,0.00020719177,0.00045264798,0.000158453,0.00008401401,0.0000024075885],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017438752,0.0026071356,0.542732,0.00073904643,0.00035624797,0.0000048765846,0.014597839,0.028334195,0.008713559,0.38300043,0.012125074,0.0066151884],"study_design_scores_gemma":[0.0010507419,0.00015791731,0.54152775,0.00022690554,0.000017380193,0.0000026639968,0.0014548027,0.45195585,0.0015670465,0.0018666508,0.000050095616,0.00012219163],"about_ca_topic_score_codex":0.0020600515,"about_ca_topic_score_gemma":0.00022542733,"teacher_disagreement_score":0.42362165,"about_ca_system_score_codex":0.000034565826,"about_ca_system_score_gemma":0.000046544526,"threshold_uncertainty_score":0.31141955},"labels":[],"label_agreement":null},{"id":"W2011233591","doi":"10.1016/j.sysconle.2015.02.006","title":"Motion coordination of thrust-propelled underactuated vehicles with intermittent and delayed communications","year":2015,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Blackout; Underactuation; Network packet; Control theory (sociology); Bounded function; Computer science; Thrust; Telecommunications network; Directed graph; Graph; Control (management); Computer network; Engineering; Mathematics; Algorithm; Artificial intelligence; Aerospace engineering; Theoretical computer science","score_opus":0.026265640992375005,"score_gpt":0.23390316505889663,"score_spread":0.20763752406652164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011233591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27184635,0.00053671654,0.7177505,0.007423754,0.00035119615,0.0015425946,0.000026121907,0.00019409372,0.00032865416],"genre_scores_gemma":[0.9987585,0.0000028767663,0.00070987997,0.00028232377,0.000033980945,0.00011337265,0.00003745505,0.000017460288,0.000044149758],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977794,0.0005453907,0.0005834935,0.00036903706,0.00045555164,0.00026709214],"domain_scores_gemma":[0.9975393,0.00021228235,0.0005313948,0.001121015,0.00043861434,0.0001573966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079752767,0.00021753779,0.0004548115,0.00016929152,0.00008606111,0.00022216355,0.000865098,0.00007323494,0.0000014099453],"category_scores_gemma":[0.00006625088,0.00017584104,0.000053312586,0.00029079328,0.00010816727,0.0005617892,0.00013449509,0.00015037213,0.000036604528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00223733,0.0017570477,0.10261391,0.0010538921,0.005599167,0.00017410408,0.01579358,0.05860141,0.59402406,0.133622,0.020235028,0.06428849],"study_design_scores_gemma":[0.010518672,0.00034158397,0.0064700074,0.00026104331,0.00010154248,0.00007687641,0.0009270941,0.97945803,0.00020379196,0.00005431196,0.0011774477,0.0004095732],"about_ca_topic_score_codex":0.0007185747,"about_ca_topic_score_gemma":0.000029356157,"teacher_disagreement_score":0.92085665,"about_ca_system_score_codex":0.00016413539,"about_ca_system_score_gemma":0.00006022738,"threshold_uncertainty_score":0.71705896},"labels":[],"label_agreement":null},{"id":"W2011547255","doi":"10.1109/smc.2013.470","title":"Cluster Synchronization of Predator Prey Robots","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Robot; Computer science; Workspace; Mobile robot; Synchronization (alternating current); Distributed computing; Task (project management); Network topology; Artificial intelligence; Set (abstract data type); Robotics; Topology (electrical circuits); Engineering; Computer network","score_opus":0.008530217716018938,"score_gpt":0.21103004747819729,"score_spread":0.20249982976217834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011547255","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009199477,0.00004304271,0.9856577,0.00047716527,0.00027807747,0.00050787785,0.0000026554515,0.00015155769,0.0036824602],"genre_scores_gemma":[0.9833639,0.0000014261402,0.015086487,0.00012558965,0.00003403081,0.00004593499,0.000007068198,0.0000058509177,0.0013296888],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989949,0.00005938268,0.00031136003,0.00022846807,0.00022457058,0.00018133821],"domain_scores_gemma":[0.99900746,0.000050974646,0.00012949509,0.00054111134,0.0002010679,0.00006987979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013003511,0.00009042182,0.00013807394,0.000051684347,0.00002698762,0.000116808,0.00061747927,0.000052039417,0.00014696189],"category_scores_gemma":[0.000060949165,0.00007424887,0.000039762268,0.00020592456,0.000016743388,0.0008072522,0.00015259667,0.00003552132,0.0004643471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029581695,0.001530601,0.093770504,0.0007333765,0.0006047331,0.000010712759,0.003291873,0.051282972,0.039442122,0.25418547,0.29691318,0.25820488],"study_design_scores_gemma":[0.00062742375,0.000047758123,0.012408881,0.00002617998,0.0000052499167,0.000003885791,0.000015077142,0.98312485,0.0026946324,0.00038667014,0.00051709753,0.0001423101],"about_ca_topic_score_codex":0.00011828655,"about_ca_topic_score_gemma":0.000011813861,"teacher_disagreement_score":0.9741644,"about_ca_system_score_codex":0.00003502924,"about_ca_system_score_gemma":0.00003905111,"threshold_uncertainty_score":0.5968397},"labels":[],"label_agreement":null},{"id":"W2011874120","doi":"10.1155/2014/818701","title":"Modeling of Task Planning for Multirobot System Using Reputation Mechanism","year":2014,"lang":"en","type":"article","venue":"The Scientific World JOURNAL","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Reputation; Computer science; Robot; Task (project management); Decomposition; Function (biology); Simulation; Human–computer interaction; Artificial intelligence; Engineering; Systems engineering","score_opus":0.0480044702684622,"score_gpt":0.2791875968550801,"score_spread":0.2311831265866179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011874120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034966048,0.00009704639,0.960256,0.00018559957,0.0039862525,0.0003245078,0.0000068926965,0.000067024244,0.00011065272],"genre_scores_gemma":[0.96079534,1.6450106e-7,0.03867996,0.000017657336,0.000230924,0.000007962707,0.000002828174,0.000011820055,0.00025335385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767625,0.00027469388,0.0006825845,0.0003506152,0.00062718696,0.00038864044],"domain_scores_gemma":[0.9981245,0.00017676961,0.0005482885,0.00060455693,0.0004453852,0.0001004919],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060878913,0.0001428622,0.00025535867,0.00034527658,0.0010476715,0.0009584436,0.0012298528,0.000033391858,0.0000010787231],"category_scores_gemma":[0.00015111589,0.000102592865,0.0001639873,0.00062079646,0.000055005676,0.00052232237,0.00012213766,0.0001773669,0.0000062830622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013384275,0.000020696976,0.000014332423,0.000049583603,0.000035818146,0.0000024428587,0.0011463457,0.90710896,0.041070886,0.048298612,0.00011792248,0.0021210406],"study_design_scores_gemma":[0.00059125153,0.00001838291,0.0000064211017,0.00029458056,0.000029449755,0.00009582827,0.0003842115,0.9937559,0.0014486985,0.0031146372,0.00014725223,0.00011338288],"about_ca_topic_score_codex":0.00001730919,"about_ca_topic_score_gemma":0.0000046279056,"teacher_disagreement_score":0.9258293,"about_ca_system_score_codex":0.00013813422,"about_ca_system_score_gemma":0.00009773938,"threshold_uncertainty_score":0.9242294},"labels":[],"label_agreement":null},{"id":"W2012339379","doi":"10.2316/journal.206.2011.1.206-3417","title":"DEVELOPMENT OF A COMPREHENSIVE SOFTWARE SYSTEM FOR IMPLEMENTING COOPERATIVE CONTROL OF MULTIPLE UNMANNED AERIAL VEHICLES","year":2011,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Software deployment; Software; Architecture; Focus (optics); Computer science; Software architecture; Real-time computing; Embedded system; Control (management); Systems engineering; Control software; Engineering; Software engineering; Operating system; Artificial intelligence","score_opus":0.03729884440725432,"score_gpt":0.26582143965573907,"score_spread":0.22852259524848476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012339379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17239201,0.00004739055,0.8267305,0.000044982422,0.0005447637,0.00018598618,0.00003521003,0.0000126087,0.000006552419],"genre_scores_gemma":[0.82042474,0.0000014506343,0.17950048,0.000008343893,0.000047921603,0.0000046707332,0.0000071768463,0.00000385064,0.000001338899],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985921,0.00004808326,0.00083879865,0.00009390249,0.00032407814,0.00010304167],"domain_scores_gemma":[0.99698,0.00016966306,0.0011716466,0.00006895743,0.0015714242,0.00003831136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034802544,0.000087735854,0.0002595748,0.00013547436,0.00005142,0.0000454499,0.00034528627,0.000033464832,0.000001046694],"category_scores_gemma":[0.00008541019,0.000076388686,0.00006990805,0.000054108517,0.000021737986,0.00029267388,0.00006149909,0.000038213024,3.4514133e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021014938,0.001504315,0.02541897,0.0014663488,0.007084366,0.00006803044,0.0412273,0.08235282,0.42762992,0.21679233,0.00027664265,0.19407746],"study_design_scores_gemma":[0.010332594,0.00034925353,0.022042057,0.000824704,0.000079712605,0.00007722476,0.0019332094,0.88678116,0.07677751,0.00024315319,0.00032671427,0.00023270557],"about_ca_topic_score_codex":0.000009283924,"about_ca_topic_score_gemma":0.0000046670716,"teacher_disagreement_score":0.80442834,"about_ca_system_score_codex":0.00006270422,"about_ca_system_score_gemma":0.00011281702,"threshold_uncertainty_score":0.31150404},"labels":[],"label_agreement":null},{"id":"W2014143213","doi":"10.2316/journal.206.2011.1.206-0001","title":"PREFACE: SPECIAL ISSUE ON NEW ADVANCES IN NONLINEAR AND OPTIMAL CONTROLS OF ROBOTIC AND AUTONOMOUS SYSTEMS","year":2011,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Nonlinear system; Control engineering; Engineering; Physics","score_opus":0.015118927941882451,"score_gpt":0.2557618711183249,"score_spread":0.24064294317644241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014143213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14831045,0.0033847792,0.84144294,0.0014591806,0.003953235,0.00048093317,0.00001816353,0.000033889904,0.0009164177],"genre_scores_gemma":[0.97708744,0.0002640351,0.021907518,0.000024374438,0.00066384237,0.0000011555113,0.0000017938429,0.0000051433285,0.00004468445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988658,0.000049746777,0.0005442104,0.00013138879,0.00031248666,0.000096369964],"domain_scores_gemma":[0.9990176,0.00008603001,0.00053811475,0.00007607801,0.00020461433,0.000077539764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002869317,0.000101283185,0.0002554457,0.00020960682,0.000019585685,0.00012745326,0.00025244695,0.00004787633,0.000003601929],"category_scores_gemma":[0.00007189667,0.00008753179,0.00002822452,0.000060547904,0.000032725042,0.0006804942,0.000053319156,0.00009321744,0.0000013259145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003615703,0.00050600484,0.010782645,0.00014616842,0.0003427659,0.00016964211,0.0043819556,0.63109624,0.0011732307,0.09451031,0.00028905208,0.25624043],"study_design_scores_gemma":[0.0023665447,0.00038430217,0.02589878,0.00035103955,0.000019860763,0.00019576841,0.0001013549,0.96879476,0.00018634631,0.00053902896,0.0010372845,0.00012489969],"about_ca_topic_score_codex":0.000031602773,"about_ca_topic_score_gemma":0.000005906233,"teacher_disagreement_score":0.828777,"about_ca_system_score_codex":0.00004402705,"about_ca_system_score_gemma":0.000059509366,"threshold_uncertainty_score":0.3569443},"labels":[],"label_agreement":null},{"id":"W2015523755","doi":"10.1115/dscc2011-6101","title":"Formation Control of Platoons of Mobile Sensors With Intermittent Communications","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Platoon; Computer science; Bandwidth (computing); Network topology; Distributed computing; Estimator; Sensor fusion; Mobile telephony; Multi-agent system; State (computer science); Real-time computing; Motion control; Computer network; Control (management); Mobile radio; Artificial intelligence; Algorithm; Mathematics","score_opus":0.033381578360413236,"score_gpt":0.22983615430510973,"score_spread":0.1964545759446965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015523755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043376695,0.000058766775,0.94792604,0.00007687327,0.000046208046,0.00047259626,0.000025555875,0.000070492584,0.00794674],"genre_scores_gemma":[0.98709214,0.000003992024,0.012754309,0.000030435998,0.0000025210072,0.000057335583,0.0000051554957,0.000003906327,0.000050229526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991178,0.000081158614,0.00040434493,0.0001092586,0.00016642292,0.000121051205],"domain_scores_gemma":[0.9981935,0.00008464056,0.00031025326,0.0011473874,0.00021922433,0.000044991033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019163123,0.000082158265,0.00020881255,0.00008233302,0.0000325254,0.000012454955,0.0009821185,0.000031006704,0.000014557666],"category_scores_gemma":[0.00001321263,0.000061660234,0.00005427706,0.00017571897,0.00008212151,0.00039095813,0.000118836615,0.00005264417,0.000014608851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002914518,0.0030105752,0.0350899,0.0003675607,0.0009772171,0.000013001471,0.032591395,0.002000088,0.037451167,0.8326328,0.0022036934,0.0533712],"study_design_scores_gemma":[0.00508635,0.0009858088,0.01739024,0.00020951017,0.00008564355,0.000059311165,0.002288619,0.9140627,0.057046477,0.00040427633,0.0019752681,0.00040579858],"about_ca_topic_score_codex":0.00014396044,"about_ca_topic_score_gemma":0.000041029172,"teacher_disagreement_score":0.9437154,"about_ca_system_score_codex":0.00001985146,"about_ca_system_score_gemma":0.000028689023,"threshold_uncertainty_score":0.25144315},"labels":[],"label_agreement":null},{"id":"W2015787580","doi":"10.1155/2012/150250","title":"Consensus Formation Control for a Class of Networked Multiple Mobile Robot Systems","year":2012,"lang":"en","type":"article","venue":"Journal of Control Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Mobile robot; Linear matrix inequality; Class (philosophy); Control theory (sociology); Control (management); Computer science; Constant (computer programming); Robot; Matrix (chemical analysis); Lyapunov function; Control engineering; Engineering; Mathematics; Mathematical optimization; Artificial intelligence; Nonlinear system","score_opus":0.011051274353940935,"score_gpt":0.2167529953399863,"score_spread":0.20570172098604536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015787580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06487977,0.002057792,0.93087614,0.00012318735,0.0014418181,0.0005637919,0.000011362369,0.00002646146,0.000019666772],"genre_scores_gemma":[0.9967441,0.000009541312,0.0028863742,0.000031345236,0.0002793538,0.00003795007,2.8186952e-7,0.0000068655268,0.0000041856592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980423,0.000041475203,0.0007313923,0.00012687009,0.0005519395,0.000506062],"domain_scores_gemma":[0.99759775,0.00056442665,0.00059862307,0.00020358713,0.00076925854,0.0002663746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032868083,0.00014386718,0.00046078555,0.0002527239,0.00010417781,0.0001671231,0.00053669995,0.00005652481,2.807548e-7],"category_scores_gemma":[0.000576284,0.00011599889,0.000102634105,0.0003715682,0.00007067722,0.001352259,0.00003047056,0.000111114816,7.6163707e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012019206,0.00008824533,0.0021666302,0.00017659464,0.000112477996,0.0000040882464,0.00054055377,0.78060085,0.20443207,0.0059944824,0.0002572488,0.005506548],"study_design_scores_gemma":[0.003760043,0.00018412143,0.002007405,0.00010310497,0.000035273944,0.0001326463,0.00009695712,0.990984,0.0005386954,0.00000743814,0.0020257535,0.00012453772],"about_ca_topic_score_codex":0.000008570237,"about_ca_topic_score_gemma":5.511754e-7,"teacher_disagreement_score":0.9318643,"about_ca_system_score_codex":0.00011365244,"about_ca_system_score_gemma":0.000114410526,"threshold_uncertainty_score":0.47302973},"labels":[],"label_agreement":null},{"id":"W2019043173","doi":"10.1109/ascc.2013.6606221","title":"Adaptive control of a three-agent surveillance swarm with constant speed constraint","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Constant (computer programming); Control theory (sociology); Controller (irrigation); Swarm behaviour; Computer science; Constraint (computer-aided design); Task (project management); Control (management); Adaptive control; Multi-agent system; Artificial intelligence; Mathematics; Engineering","score_opus":0.016645060688424817,"score_gpt":0.20689956205055698,"score_spread":0.19025450136213218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019043173","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023203025,0.00012933339,0.96202415,0.0008997541,0.000218261,0.0014751937,0.00006908277,0.00022146225,0.011759726],"genre_scores_gemma":[0.99247515,0.0000021617461,0.0070649376,0.00022229072,0.000027106873,0.00005471911,0.0000035949665,0.000012444292,0.00013757517],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767804,0.00014345464,0.00057542307,0.0005318763,0.00055840827,0.000512784],"domain_scores_gemma":[0.9976826,0.00031252118,0.000363047,0.00082417636,0.00059183873,0.0002258748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042097757,0.00028661077,0.0005891776,0.00009059924,0.00006186601,0.00014521214,0.0008745612,0.00007389007,0.00013836916],"category_scores_gemma":[0.00005126207,0.0002024684,0.00010939007,0.00033979767,0.00029630473,0.00036732305,0.000102358514,0.00013112431,0.00022210786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039350212,0.0010602637,0.08310679,0.0001349448,0.0019241256,0.00024257283,0.00088730245,0.003937727,0.030098738,0.8409169,0.004291256,0.033005893],"study_design_scores_gemma":[0.014499785,0.0014220183,0.054456018,0.00020892888,0.000047190704,0.00018099279,0.00078817946,0.92034376,0.0036460438,0.0023266082,0.00082786847,0.0012525967],"about_ca_topic_score_codex":0.0010190647,"about_ca_topic_score_gemma":0.0002449957,"teacher_disagreement_score":0.96927214,"about_ca_system_score_codex":0.00008277354,"about_ca_system_score_gemma":0.00021669184,"threshold_uncertainty_score":0.82564217},"labels":[],"label_agreement":null},{"id":"W2019989461","doi":"10.1016/j.jfranklin.2014.11.021","title":"Distributed formation control of networked Euler–Lagrange systems with fault diagnosis","year":2014,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Trajectory; Nonlinear system; Bounded function; Workspace; Fault (geology); Computer science; Noise (video); Tracking (education); Fault tolerance; Control engineering; Control (management); Mathematics; Engineering; Distributed computing; Artificial intelligence","score_opus":0.011353518631305121,"score_gpt":0.20864618200044796,"score_spread":0.19729266336914283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019989461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02917516,0.0006046572,0.96423775,0.001180497,0.003976947,0.00057801406,0.000059370046,0.000038111077,0.00014951728],"genre_scores_gemma":[0.99844784,0.000031110067,0.0009031662,0.00010678079,0.0004348123,0.000043115255,0.0000059670897,0.000010665163,0.00001653565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971443,0.00039086532,0.0011105646,0.00017575576,0.0008593607,0.00031918834],"domain_scores_gemma":[0.9961775,0.00032855276,0.0019480741,0.0007021307,0.0006990817,0.00014464842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001396675,0.000228262,0.0006342083,0.00012553483,0.00017736139,0.00019586606,0.0018390167,0.00011214424,0.0000019370784],"category_scores_gemma":[0.00035097575,0.00013325007,0.00026902495,0.00058101455,0.0001163065,0.0013515853,0.00009257439,0.00030659366,0.000008653977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052472664,0.000600966,0.02354615,0.000462393,0.0012021059,0.00006196542,0.0008130542,0.9094347,0.001318939,0.032659028,0.01205699,0.017318996],"study_design_scores_gemma":[0.009685204,0.0005327334,0.012790927,0.0015775673,0.00033968236,0.00042621238,0.00006282878,0.86152804,0.00076677074,0.00025711695,0.11160723,0.00042570702],"about_ca_topic_score_codex":0.00008319326,"about_ca_topic_score_gemma":0.0000324445,"teacher_disagreement_score":0.9692727,"about_ca_system_score_codex":0.0001202901,"about_ca_system_score_gemma":0.00010325138,"threshold_uncertainty_score":0.543378},"labels":[],"label_agreement":null},{"id":"W2020887976","doi":"10.1109/allerton.2014.7028465","title":"Distributed subgradient-push online convex optimization on time-varying directed graphs","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Subgradient method; Regret; Sequence (biology); Mathematical optimization; Convex function; Computer science; Convex optimization; Class (philosophy); State (computer science); Function (biology); Regular polygon; Strongly connected component; Topology (electrical circuits); Mathematics; Algorithm; Artificial intelligence; Combinatorics; Machine learning","score_opus":0.010542373894396972,"score_gpt":0.21716447532473593,"score_spread":0.20662210143033896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020887976","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005445835,0.000030177856,0.98723793,0.0010438532,0.0006696825,0.00044916343,0.00012747661,0.0018269507,0.0031689154],"genre_scores_gemma":[0.97263074,0.0000056530553,0.024513789,0.0006493785,0.00010230332,0.000034745168,0.0013448363,0.000029715848,0.00068886555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974214,0.0002789929,0.00051542645,0.000725159,0.0005058012,0.0005532494],"domain_scores_gemma":[0.9979822,0.00028550407,0.00023337506,0.0009839686,0.00026366292,0.00025126553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036883514,0.00032015995,0.00040967343,0.00020674482,0.00019992112,0.00029089802,0.0010398553,0.00012919494,0.000093823786],"category_scores_gemma":[0.0002991279,0.00028577234,0.00014203084,0.0009677784,0.000047701124,0.00044786007,0.00015429496,0.00017162105,0.0003094714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025612317,0.003643903,0.0069824387,0.0001452694,0.0007175708,0.00008741076,0.00074308907,0.5876559,0.010092383,0.2852793,0.05287616,0.05152043],"study_design_scores_gemma":[0.0014351393,0.00012792135,0.0016302336,0.000044220207,0.00001553587,0.0000063875536,0.000004977731,0.9918708,0.0006166568,0.00023523264,0.0036626272,0.0003502705],"about_ca_topic_score_codex":0.000070686074,"about_ca_topic_score_gemma":0.000008424642,"teacher_disagreement_score":0.9671849,"about_ca_system_score_codex":0.00010477139,"about_ca_system_score_gemma":0.000035861784,"threshold_uncertainty_score":0.99995947},"labels":[],"label_agreement":null},{"id":"W2021213415","doi":"10.1115/detc2011-48651","title":"Voronoi-Based Coverage Control for Multi-Quadrotor UAVs","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Voronoi diagram; Position (finance); Stability (learning theory); Computer science; Integrator; Controller (irrigation); Control theory (sociology); Planar; Drone; Double integrator; Mathematical optimization; Control (management); Mathematics; Artificial intelligence","score_opus":0.06146410985285336,"score_gpt":0.2608213047106316,"score_spread":0.19935719485777822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021213415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064708106,0.00004765399,0.9931349,0.00022262975,0.0008072226,0.0019159337,0.00009080737,0.00051619054,0.002617591],"genre_scores_gemma":[0.9152378,4.841398e-7,0.08188619,0.0011013366,0.00007467051,0.0006149658,0.000011616534,0.000021147549,0.0010518174],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804723,0.00010505049,0.00044228588,0.0005842097,0.00025954226,0.0005616657],"domain_scores_gemma":[0.99827605,0.00019466109,0.00018136529,0.00093017344,0.00020054072,0.00021721279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004927404,0.00025865494,0.00035842182,0.00009486731,0.00012710181,0.00015166082,0.0012739525,0.00011357492,0.00011182836],"category_scores_gemma":[0.0001250314,0.00022403449,0.00023098275,0.00015797654,0.000036837882,0.0004585491,0.000063686224,0.000086493106,0.00030519266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011901564,0.0051867864,0.024281973,0.00050206616,0.0010373391,0.00019127644,0.0020719818,0.0015135069,0.020121528,0.81977355,0.028386831,0.09574298],"study_design_scores_gemma":[0.011065392,0.00025782673,0.005226976,0.000020287249,0.000024858678,0.0000033165975,0.000013194621,0.96478206,0.0045243003,0.00030110966,0.013332682,0.00044799625],"about_ca_topic_score_codex":0.0002193176,"about_ca_topic_score_gemma":0.000045671677,"teacher_disagreement_score":0.9632686,"about_ca_system_score_codex":0.000086013555,"about_ca_system_score_gemma":0.00012356699,"threshold_uncertainty_score":0.91358614},"labels":[],"label_agreement":null},{"id":"W2022745069","doi":"10.1109/cdc.2014.7039537","title":"Nash equilibrium seeking by a gossip-based algorithm","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Gossip; Computer science; Best response; Asynchronous communication; Convergence (economics); Distributed algorithm; Algorithm; Correlated equilibrium; Game theory; Mathematical optimization; Epsilon-equilibrium; Graph; Set (abstract data type); Potential game; Theoretical computer science; Equilibrium selection; Mathematics; Repeated game; Distributed computing; Mathematical economics; Computer network","score_opus":0.007021373110070756,"score_gpt":0.2120941586840017,"score_spread":0.20507278557393094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022745069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050041906,0.00011352913,0.98556846,0.0011061289,0.00062141276,0.00020389205,0.000014269065,0.0007112285,0.011160661],"genre_scores_gemma":[0.9071191,6.7162716e-7,0.08921345,0.0016722444,0.00019472484,0.000047619902,0.000029748424,0.000023781313,0.0016986722],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997999,0.00016266215,0.00032499508,0.0005463945,0.0004519776,0.00051495753],"domain_scores_gemma":[0.9985337,0.00017645794,0.00012184683,0.00087759667,0.00009306612,0.00019731844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005653133,0.00020814857,0.00025315772,0.00007604273,0.00008432575,0.0004460869,0.0012750326,0.00008789583,0.00003595623],"category_scores_gemma":[0.000057242727,0.00018627744,0.00010689012,0.00034655558,0.00003390508,0.0004259121,0.00018955456,0.00011402929,0.00041578079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068601485,0.00027141583,0.0005697182,0.000045986337,0.000065000786,0.000020227,0.00016592632,0.00025456896,0.04777929,0.02983042,0.063035995,0.8579546],"study_design_scores_gemma":[0.0008992912,0.000053526408,0.000094024756,0.000019509742,0.0000043501586,0.0000044759595,0.0000061494497,0.9143156,0.0028965313,0.00017804881,0.08128657,0.00024195974],"about_ca_topic_score_codex":0.000092409835,"about_ca_topic_score_gemma":0.0000034427549,"teacher_disagreement_score":0.914061,"about_ca_system_score_codex":0.0000641969,"about_ca_system_score_gemma":0.000055374632,"threshold_uncertainty_score":0.7596174},"labels":[],"label_agreement":null},{"id":"W2023008986","doi":"10.1016/j.conengprac.2014.12.003","title":"Robust distributed attitude synchronization of multiple three-DOF experimental helicopters","year":2015,"lang":"en","type":"article","venue":"Control Engineering Practice","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Synchronization (alternating current); Estimator; Tracking error; Controller (irrigation); Tracking (education); Computer science; Stability theory; Control engineering; Engineering; Control (management); Mathematics; Artificial intelligence; Topology (electrical circuits); Nonlinear system","score_opus":0.02939735538504327,"score_gpt":0.24069922385862672,"score_spread":0.21130186847358345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023008986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018335732,0.0011177867,0.9943771,0.00055650284,0.001023243,0.00051417446,0.000049635284,0.00038847918,0.00013955162],"genre_scores_gemma":[0.9821677,0.0000029088394,0.01746967,0.00008040636,0.000121898425,0.00007745638,0.000041537325,0.000027698312,0.00001069102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798477,0.000109755354,0.00051467185,0.00042616806,0.00055563287,0.00040899837],"domain_scores_gemma":[0.9977516,0.00047269175,0.00034781755,0.0007271784,0.0004401051,0.0002606113],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006909139,0.000271475,0.0003884089,0.00011824188,0.00005257808,0.00017084136,0.00078810373,0.00010767038,0.0000040403716],"category_scores_gemma":[0.0023755198,0.0002863657,0.00009492091,0.00042818274,0.000029434277,0.0016025282,0.00014314555,0.00018541828,0.000048576992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008219797,0.0002517265,0.0006264478,0.000033947486,0.00018859138,0.000032970733,0.00024373812,0.99003553,0.0048523555,0.0024440342,0.00033062752,0.00087783195],"study_design_scores_gemma":[0.0041731237,0.00013027902,0.0007566971,0.00004946559,0.000047012898,0.000040903364,0.00008214367,0.9883682,0.001295245,0.0000032962241,0.004775813,0.00027777872],"about_ca_topic_score_codex":0.00018940103,"about_ca_topic_score_gemma":0.0000061703568,"teacher_disagreement_score":0.98033416,"about_ca_system_score_codex":0.00031506296,"about_ca_system_score_gemma":0.00012659654,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W2023634396","doi":"10.1145/2401603.2401652","title":"Structural controllability of multi-agent networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Network controllability; Computer science; Multi-agent system; Distributed computing; Graph theory; Graph; Work (physics); Complex network; Theoretical computer science; Artificial intelligence; Mathematics; Engineering; Applied mathematics","score_opus":0.027724265287410375,"score_gpt":0.2603585976329306,"score_spread":0.23263433234552025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023634396","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065621376,0.0006225171,0.930602,0.00015072049,0.0015797857,0.00044317284,0.000009327208,0.00019181546,0.0007792657],"genre_scores_gemma":[0.9902482,0.0000016287199,0.009289791,0.00010742647,0.00012840886,0.000018606917,0.000004689585,0.0000070385513,0.00019420114],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821925,0.0001759933,0.0004863345,0.00027681515,0.00029629437,0.0005452977],"domain_scores_gemma":[0.9984419,0.000144636,0.00019510274,0.00084016373,0.0001515095,0.00022673902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006450171,0.00017707428,0.00034509535,0.00004641262,0.00006199001,0.000057295307,0.00082306744,0.00008691897,0.000057796686],"category_scores_gemma":[0.000097772885,0.00013764639,0.00014054461,0.00025240955,0.000056422803,0.00059233076,0.00021383123,0.000104048835,0.000042381867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094623196,0.00095488364,0.6464174,0.00012262972,0.0005225078,0.000008495666,0.0018741826,0.020630397,0.009192788,0.24740957,0.003228095,0.06954444],"study_design_scores_gemma":[0.0016972919,0.000032285294,0.13970514,0.0000073183705,0.000012786225,0.0000074229533,0.000036647456,0.8566121,0.0007227914,0.00005200317,0.0009032327,0.000210978],"about_ca_topic_score_codex":0.00012931431,"about_ca_topic_score_gemma":0.000014735638,"teacher_disagreement_score":0.9246268,"about_ca_system_score_codex":0.000070441994,"about_ca_system_score_gemma":0.000028088127,"threshold_uncertainty_score":0.5613057},"labels":[],"label_agreement":null},{"id":"W2023813658","doi":"10.1117/12.604337","title":"Command, control, and autonomous swarms","year":2005,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Swarm behaviour; Computer science; Bandwidth (computing); Dependency (UML); Predictability; Robot; Distributed computing; Control (management); Command and control; Swarm robotics; Swarm intelligence; Control engineering; Artificial intelligence; Particle swarm optimization; Engineering; Computer network; Telecommunications","score_opus":0.00935625635779336,"score_gpt":0.21762642300690302,"score_spread":0.20827016664910966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023813658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.985163,0.00022898526,0.0027311295,0.008847444,0.0002718914,0.0006553028,0.000052969335,0.00018300618,0.001866295],"genre_scores_gemma":[0.89064497,0.00004838604,0.108170025,0.000296694,0.0004459327,0.000150001,0.0000042382,0.00003747271,0.00020226107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975943,1.9922952e-8,0.0007602949,0.00049043616,0.000679587,0.00047534288],"domain_scores_gemma":[0.9979112,0.00018971782,0.000431108,0.00010157102,0.0011814132,0.00018500008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079905125,0.00033674345,0.00049952575,0.00010005869,0.000109526176,0.00031023883,0.0017482954,0.00017765875,0.000003911067],"category_scores_gemma":[0.00033240372,0.00028152758,0.00046555288,0.00026951704,0.00019083284,0.0011010321,0.00028144012,0.0002872217,0.000004197389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046054516,0.00012906063,0.0005283545,0.00020013824,0.00043023776,1.3879371e-7,0.00025409707,0.00021030252,0.19583857,0.79677707,0.0035843917,0.0020015961],"study_design_scores_gemma":[0.0070313495,0.000573862,0.003805651,0.00040445648,0.00025004783,0.00009032427,0.00070146867,0.8927178,0.04577358,0.0024306732,0.04522998,0.0009908511],"about_ca_topic_score_codex":0.000012277989,"about_ca_topic_score_gemma":3.1670038e-7,"teacher_disagreement_score":0.89250743,"about_ca_system_score_codex":0.00017865805,"about_ca_system_score_gemma":0.000036498546,"threshold_uncertainty_score":0.9999637},"labels":[],"label_agreement":null},{"id":"W2023881335","doi":"10.3182/20100826-3-tr-4015.00019","title":"Immersion and Invariance Based Adaptive Control of Three Dimensional Autonomous Vehicle Maneuvers","year":2010,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Kinematics; Parametric statistics; Inertial frame of reference; Immersion (mathematics); Adaptive control; Motion control; Controller (irrigation); Control engineering; Engineering; Euler angles; Reference frame; Computer science; Frame (networking); Inertial measurement unit; Control system; Control (management); Artificial intelligence; Mathematics","score_opus":0.010141509505677337,"score_gpt":0.20073138974741464,"score_spread":0.19058988024173731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023881335","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8876514,0.00013819333,0.10884343,0.0013208045,0.00059910404,0.00062236626,0.000040335417,0.00019990173,0.0005844901],"genre_scores_gemma":[0.9901781,6.3231056e-7,0.009468521,0.00019168106,0.000052726526,0.000033505366,0.0000022480808,0.000013248811,0.00005935574],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983732,0.000012333232,0.00033249112,0.00053401076,0.0003988763,0.0003490565],"domain_scores_gemma":[0.9988671,0.00011340397,0.00029845213,0.0002341098,0.00032237323,0.00016453899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003944527,0.00021256598,0.00032944407,0.000110427885,0.00014139003,0.00012647305,0.0006203713,0.00013313661,0.000016359909],"category_scores_gemma":[0.00008215916,0.00020279545,0.00007623335,0.0002365848,0.0001578988,0.00069766864,0.00015185846,0.0002488912,0.000026223544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003814529,0.00040437488,0.19074427,0.00019189453,0.00023106301,0.000030623058,0.00069857517,0.00033259194,0.682149,0.08819106,0.0025521633,0.034092937],"study_design_scores_gemma":[0.0025545477,0.00019848501,0.049363304,0.0000571832,0.000027472826,0.00001566327,0.00005759168,0.9385263,0.007934221,0.000517678,0.00046158023,0.000286015],"about_ca_topic_score_codex":0.00017474209,"about_ca_topic_score_gemma":0.000018882605,"teacher_disagreement_score":0.9381937,"about_ca_system_score_codex":0.00003975145,"about_ca_system_score_gemma":0.00011084257,"threshold_uncertainty_score":0.8269758},"labels":[],"label_agreement":null},{"id":"W2023914694","doi":"10.1109/padsw.2014.7097915","title":"Sensor deployment by a robot in an unknown orthogonal region: Achieving full coverage","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; Carleton University","funders":"","keywords":"Software deployment; Robot; Computer science; Mobile robot; Wireless sensor network; Orientation (vector space); Real-time computing; Global Positioning System; Region of interest; Distributed computing; Artificial intelligence; Computer network; Telecommunications; Mathematics","score_opus":0.01596492101862465,"score_gpt":0.2355985128547672,"score_spread":0.21963359183614256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023914694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07869608,0.00005422722,0.9160924,0.0015977622,0.00041665655,0.00031627124,0.0000038736616,0.00030968708,0.002513018],"genre_scores_gemma":[0.9941506,0.0000038071075,0.004204314,0.0006441142,0.0001322716,0.000037440874,0.000018031085,0.000016534936,0.000792931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976159,0.00037357846,0.00043840878,0.000661875,0.00041254383,0.00049769593],"domain_scores_gemma":[0.99859077,0.00013013519,0.0001338515,0.00085376453,0.000066485845,0.00022501366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005809237,0.00023141333,0.00030085724,0.000101885154,0.00009072526,0.0003124189,0.00090175326,0.00009134901,0.000014841232],"category_scores_gemma":[0.00005429793,0.00020797628,0.00007626444,0.0003194862,0.000024444676,0.00068498857,0.00019584662,0.00016846668,0.00010399325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026858828,0.0027131767,0.11119207,0.00017801311,0.00020332403,0.00042747418,0.0017953843,0.022994747,0.085404366,0.39820972,0.036069546,0.3405436],"study_design_scores_gemma":[0.0045653973,0.00062693807,0.01733871,0.00012417856,0.000015309855,0.00015296179,0.00005258064,0.88833505,0.0009581739,0.00044226984,0.086288534,0.0010998909],"about_ca_topic_score_codex":0.000096550415,"about_ca_topic_score_gemma":0.0002465131,"teacher_disagreement_score":0.91545445,"about_ca_system_score_codex":0.00011674443,"about_ca_system_score_gemma":0.000043434462,"threshold_uncertainty_score":0.8481026},"labels":[],"label_agreement":null},{"id":"W2026586100","doi":"10.1016/j.automatica.2011.03.014","title":"Solving a modified consensus problem of linear multi-agent systems","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Consensus; Multi-agent system; Matrix (chemical analysis); State (computer science); Protocol (science); Mathematics; Linear system; Directed graph; State-transition matrix; Network topology; Mathematical optimization; Graph; Control theory (sociology); Laplacian matrix; Spanning tree; Computer science; Topology (electrical circuits); Symmetric matrix; Algorithm; Control (management); Discrete mathematics; Artificial intelligence","score_opus":0.06412674146181026,"score_gpt":0.2562315195572753,"score_spread":0.19210477809546506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026586100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027853847,0.00027338884,0.96225756,0.0001134291,0.00069272,0.0012895091,0.000028411607,0.000870135,0.0066210013],"genre_scores_gemma":[0.85725206,0.0000017031361,0.14234422,0.000024286484,0.00002580845,0.00008830494,0.0000029297532,0.000017709492,0.00024300045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753624,0.00021796094,0.0009046337,0.00043236255,0.00043737813,0.00047139396],"domain_scores_gemma":[0.99793255,0.00017059856,0.00047490202,0.0010138473,0.00023390474,0.00017418647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006412545,0.00024165933,0.00049876486,0.00014079726,0.00010390617,0.000077382945,0.0010815976,0.00011442815,0.000011904069],"category_scores_gemma":[0.00011472495,0.00021417253,0.0001300002,0.00033212974,0.00007986668,0.00017595742,0.00023968917,0.00012209949,0.00020731428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115398136,0.0051387385,0.0053148414,0.005021326,0.0022854728,0.0007972575,0.052713703,0.011269857,0.05242411,0.83159107,0.007817422,0.025510808],"study_design_scores_gemma":[0.0010634346,0.00008260507,0.0016256862,0.00021757996,0.00002881582,0.000038432412,0.00014637357,0.9948372,0.0012735898,0.00020010627,0.00023845107,0.00024772427],"about_ca_topic_score_codex":0.00043877147,"about_ca_topic_score_gemma":0.0000065116515,"teacher_disagreement_score":0.98356736,"about_ca_system_score_codex":0.00006484436,"about_ca_system_score_gemma":0.00012203788,"threshold_uncertainty_score":0.8733702},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.007080359854198285,"score_gpt":0.2009796336716085,"score_spread":0.19389927381741023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026694617","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074923374,0.00014703728,0.9891241,0.0005963176,0.0002892582,0.0016378914,0.000027481232,0.00043682326,0.0002487429],"genre_scores_gemma":[0.9955782,0.0000056665567,0.003651032,0.00006608503,0.000011944724,0.0005306285,0.0000058517526,0.00002181335,0.00012875028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797606,0.00032472197,0.0006139022,0.00030166164,0.0004905248,0.0002931132],"domain_scores_gemma":[0.9975622,0.00030177916,0.00036124908,0.0012891643,0.00036517167,0.00012040702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031400533,0.0002318308,0.00042325392,0.00022297185,0.00018201947,0.0002232965,0.00081743026,0.00010503444,0.00005584921],"category_scores_gemma":[0.000009251495,0.00019453696,0.000106707914,0.0005277457,0.00007415663,0.0007118794,0.0000022096513,0.00012086819,0.00018560603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066763045,0.0016924476,0.0002448694,0.0007359965,0.0015619699,0.000013366871,0.0023917418,0.70264316,0.0108492095,0.010977328,0.00087558205,0.26794758],"study_design_scores_gemma":[0.0023386707,0.00016294459,0.00061604654,0.00023538164,0.00008219248,0.000024045266,0.0001030279,0.9955426,0.0005856097,0.000051572584,0.000055831435,0.00020208623],"about_ca_topic_score_codex":0.0004919435,"about_ca_topic_score_gemma":0.000042009837,"teacher_disagreement_score":0.98808587,"about_ca_system_score_codex":0.00013582935,"about_ca_system_score_gemma":0.000091854396,"threshold_uncertainty_score":0.7932987},"labels":[],"label_agreement":null},{"id":"W2027395072","doi":"10.1109/rose.2013.6698432","title":"Auction-based node selection of optimal and concurrent responses for a risk-aware robotic sensor network","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Larus Technologies (Canada); Université du Québec en Outaouais; University of Ottawa","funders":"","keywords":"Computer science; Node (physics); Genetic algorithm; Metric (unit); Network topology; Risk management; Computer network; Distributed computing; Engineering; Machine learning","score_opus":0.01661682116357374,"score_gpt":0.24733330020937513,"score_spread":0.2307164790458014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027395072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034763843,0.000055700264,0.96330184,0.00044495318,0.0004519852,0.000800185,0.000016382392,0.00014921487,0.000015886826],"genre_scores_gemma":[0.9478722,0.0000027192157,0.05153756,0.000055226363,0.00009711551,0.00014990028,0.000007659429,0.000008814327,0.00026880132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987162,0.00017440142,0.0003170678,0.0003350544,0.00016978166,0.00028753592],"domain_scores_gemma":[0.9986083,0.0005228738,0.00022337041,0.00024314264,0.00030818852,0.00009412883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031913488,0.00014040714,0.0002353069,0.00007163485,0.00013502546,0.00012788402,0.00020746254,0.00006487544,0.000022849212],"category_scores_gemma":[0.00013117504,0.00012237993,0.00007465281,0.000238918,0.000037843685,0.00024592757,0.000039268023,0.00007236454,0.000015724923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017170177,0.0002212673,0.025209948,0.0001767932,0.00018560853,0.0000014576793,0.00023006565,0.9360565,0.002109115,0.0029830853,0.014526812,0.01812766],"study_design_scores_gemma":[0.0010389759,0.00016198221,0.012170992,0.000029834677,0.000022519083,0.000005495624,0.00003613447,0.9852682,0.00070502405,0.000038316484,0.00038604948,0.00013648956],"about_ca_topic_score_codex":0.00026947545,"about_ca_topic_score_gemma":0.000023658202,"teacher_disagreement_score":0.91310835,"about_ca_system_score_codex":0.000046834688,"about_ca_system_score_gemma":0.00008152766,"threshold_uncertainty_score":0.49905086},"labels":[],"label_agreement":null},{"id":"W2027426398","doi":"10.1109/cdc.2012.6426038","title":"Efficiently reaching consensus on the largest entries of a vector","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Asynchronous communication; Computer science; State (computer science); Convergence (economics); A priori and a posteriori; Graph; Mathematics; Mathematical optimization; Theoretical computer science; Algorithm","score_opus":0.02731953146787797,"score_gpt":0.23790295803880637,"score_spread":0.2105834265709284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027426398","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65516156,0.00058922346,0.29319865,0.010659142,0.002749476,0.0010361458,0.0000504874,0.0004894176,0.036065873],"genre_scores_gemma":[0.9985678,6.464768e-7,0.00074674876,0.00024221167,0.00006704395,0.000011011574,0.0000013941905,0.000005146464,0.00035799714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9987441,0.00018889164,0.000237447,0.00016434376,0.00032316192,0.0003420618],"domain_scores_gemma":[0.998433,0.00072635594,0.00012846572,0.00057111296,0.00006070422,0.00008033878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086011115,0.00011155684,0.00015569162,0.000047087655,0.000105247396,0.00007228691,0.00062428,0.00003615831,0.000022632825],"category_scores_gemma":[0.00031900802,0.0000665403,0.00006981934,0.00021021125,0.00005026375,0.00009515039,0.0001185037,0.00009980198,0.00016589342],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012199709,0.00023933747,0.0043125064,0.000012954168,0.00004532685,0.0000030179222,0.0012590272,0.00006786674,0.0062895087,0.9810015,0.0055237766,0.0012329776],"study_design_scores_gemma":[0.008602368,0.0010823526,0.1756996,0.0006920808,0.00016842749,0.00022176855,0.0031984884,0.26073706,0.2983988,0.0012849254,0.24726048,0.0026536586],"about_ca_topic_score_codex":0.00009197776,"about_ca_topic_score_gemma":0.0000041146222,"teacher_disagreement_score":0.9797166,"about_ca_system_score_codex":0.00003578343,"about_ca_system_score_gemma":0.0000290408,"threshold_uncertainty_score":0.27134347},"labels":[],"label_agreement":null},{"id":"W2027899220","doi":"10.1360/aas-007-0947","title":"Robust Leader-follower Formation Control of Mobile Robots Based on a Second Order Kinematics Model","year":2007,"lang":"en","type":"article","venue":"Acta Automatica Sinica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Kinematics; Linearization; Robot; Mobile robot; Nonlinear system; Controller (irrigation); Robust control; Feedback linearization; Acceleration; Parametric statistics; Computer science; Control engineering; Engineering; Control system; Mathematics; Artificial intelligence; Control (management)","score_opus":0.028347022207103754,"score_gpt":0.25796254684645825,"score_spread":0.2296155246393545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027899220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017818667,0.000018808456,0.9747671,0.0008342696,0.00026525225,0.0012661027,0.00004316972,0.00037486004,0.004611794],"genre_scores_gemma":[0.91001916,6.7578316e-7,0.08897142,0.00069002237,0.000030867468,0.000092529524,0.000022392198,0.000027109498,0.00014584104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99649346,0.00014987864,0.0014300888,0.0004556483,0.000860631,0.00061030925],"domain_scores_gemma":[0.9961139,0.0010478399,0.00078275317,0.0015037648,0.00036463974,0.00018709565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015779773,0.00033977823,0.00071527075,0.00026972848,0.00011205072,0.00015110656,0.0011760595,0.00021673163,0.00007401781],"category_scores_gemma":[0.00045428335,0.0003034555,0.00021050172,0.0006218819,0.00007809438,0.00075987575,0.00009033012,0.00022565383,0.00009157167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015911873,0.0022345323,0.00023294004,0.00087780587,0.00034791735,0.000037540492,0.0019312007,0.9415206,0.023439882,0.01160528,0.011105847,0.0065073585],"study_design_scores_gemma":[0.002694891,0.0002196095,0.0006779697,0.00016719534,0.000051285104,0.000006715649,0.000048731825,0.9938014,0.0015589144,0.00018534518,0.00028605186,0.00030184572],"about_ca_topic_score_codex":0.000005397865,"about_ca_topic_score_gemma":0.0000115769035,"teacher_disagreement_score":0.89220047,"about_ca_system_score_codex":0.0001330872,"about_ca_system_score_gemma":0.00020138398,"threshold_uncertainty_score":0.99994177},"labels":[],"label_agreement":null},{"id":"W2028556857","doi":"10.1109/ccece.2012.6335001","title":"Data aggregation in wireless sensor networks: A comparison of collection tree protocols and gossip algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip protocol; Gossip; Computer science; Dissemination; Computer network; Wireless sensor network; Overhead (engineering); Distributed computing; Data aggregator; Tree (set theory); Wireless network; Pairwise comparison; Wireless; Scalability; Mathematics; Telecommunications","score_opus":0.07914663642650595,"score_gpt":0.34289637242681587,"score_spread":0.26374973600030993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028556857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017455775,0.00013325714,0.9738951,0.00012975422,0.00023739203,0.0075613544,0.000017676102,0.000098733,0.00047098292],"genre_scores_gemma":[0.9857776,0.0000032329237,0.012741574,0.000015490805,0.00009429379,0.0011923095,0.000036820973,0.0000071058507,0.00013154163],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984855,0.000181482,0.00046878727,0.00032147183,0.00024856208,0.00029418868],"domain_scores_gemma":[0.9987507,0.00012256316,0.00024796923,0.00072115875,0.00006699961,0.00009064761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000727238,0.00012687236,0.00030012676,0.00010671104,0.00005656652,0.00010618634,0.00057512516,0.00008577568,0.0000030142953],"category_scores_gemma":[0.00004908706,0.000113851456,0.000019194737,0.0005817606,0.000033226792,0.0010162273,0.00025268682,0.00010264477,0.0000044035096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009875467,0.0013380081,0.49232346,0.00017269033,0.00008628647,0.0000043400764,0.001887875,0.0011627527,0.0020203,0.007027246,0.0061270026,0.48775128],"study_design_scores_gemma":[0.0010669597,0.00005519998,0.038143374,0.00008315265,0.000005012907,0.000006581755,0.0001061775,0.9585662,0.00074995,0.000012231921,0.0010801092,0.00012504119],"about_ca_topic_score_codex":0.00024756265,"about_ca_topic_score_gemma":0.0003043275,"teacher_disagreement_score":0.96832186,"about_ca_system_score_codex":0.000060535676,"about_ca_system_score_gemma":0.000036072965,"threshold_uncertainty_score":0.46427277},"labels":[],"label_agreement":null},{"id":"W2028706080","doi":"10.1109/acc.2012.6314712","title":"Average consensus on arbitrary strongly connected digraphs with dynamic topologies","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Computer science; Topology (electrical circuits); Computer network; Discrete mathematics; Combinatorics; Distributed computing; Mathematics","score_opus":0.012529828431295967,"score_gpt":0.23159370498543733,"score_spread":0.21906387655414136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028706080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60553217,0.00032586307,0.34458914,0.0020517954,0.0012478817,0.00084571645,0.00005691055,0.0018210727,0.043529443],"genre_scores_gemma":[0.9931095,0.0000025431555,0.0058236327,0.0002931387,0.000037520666,0.000031343574,0.000015342954,0.000013374238,0.0006735793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9981822,0.00014248118,0.00026345262,0.00039582627,0.000342071,0.0006739937],"domain_scores_gemma":[0.9984462,0.0003520325,0.00012519097,0.00080636435,0.00007414806,0.00019603675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021353562,0.00026142132,0.00028114085,0.00012955726,0.000120333076,0.0001478311,0.00069103687,0.00008839267,0.00004040452],"category_scores_gemma":[0.000058043122,0.00018685216,0.00007561797,0.00033437437,0.00010815902,0.00033143506,0.00010470187,0.00018870433,0.00018506311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029919675,0.0011285126,0.05127103,0.0000659299,0.00062468206,0.00026801863,0.0013213478,0.0020990886,0.0035617573,0.9217242,0.006381897,0.01125432],"study_design_scores_gemma":[0.016791003,0.0034484046,0.5374842,0.0003532434,0.0001352261,0.00080817204,0.002788758,0.3991218,0.009501326,0.0033335323,0.021641573,0.0045927633],"about_ca_topic_score_codex":0.00009101379,"about_ca_topic_score_gemma":0.000044476932,"teacher_disagreement_score":0.9183907,"about_ca_system_score_codex":0.00007079508,"about_ca_system_score_gemma":0.00005824751,"threshold_uncertainty_score":0.76196104},"labels":[],"label_agreement":null},{"id":"W2029227746","doi":"10.1109/ecc.2014.6862268","title":"Simultaneous fault detection and control design for a network of multi-agent systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fault detection and isolation; Matrix (chemical analysis); Multi-agent system; Fault (geology); Control theory (sociology); Algorithm; Control (management); Artificial intelligence","score_opus":0.01911581848987538,"score_gpt":0.23215766241537225,"score_spread":0.21304184392549688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029227746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011023572,0.00033344698,0.99557847,0.00006143455,0.0008755205,0.0017734086,0.000011550383,0.00020792823,0.00005589852],"genre_scores_gemma":[0.97347766,0.0000036020058,0.025865,0.00007485906,0.0001518821,0.00020518017,0.000001658574,0.000015015701,0.00020513682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980537,0.00033060994,0.0005182555,0.0004483756,0.00023798297,0.0004110726],"domain_scores_gemma":[0.9971519,0.001625052,0.0002847389,0.00048855,0.0003075072,0.00014225197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658435,0.00020608222,0.00043560562,0.000050690393,0.00012998961,0.00016061997,0.00044106136,0.000116810654,9.175608e-7],"category_scores_gemma":[0.00048326657,0.00017488838,0.00008863674,0.00017931046,0.000035225505,0.00017759197,0.000055488137,0.0000657678,0.000009951128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016054882,0.00015532903,0.00024298654,0.00022941084,0.0002160749,0.0000058859487,0.0002006868,0.90025944,0.02170749,0.012316385,0.00037051193,0.06413524],"study_design_scores_gemma":[0.0031091317,0.0003229411,0.00008840437,0.000037736136,0.000030019717,0.0000171654,0.00002221872,0.9921509,0.0008884335,0.000098841,0.0030430697,0.00019111446],"about_ca_topic_score_codex":0.00012807146,"about_ca_topic_score_gemma":0.000025729305,"teacher_disagreement_score":0.97237533,"about_ca_system_score_codex":0.00005619591,"about_ca_system_score_gemma":0.000027753173,"threshold_uncertainty_score":0.7131741},"labels":[],"label_agreement":null},{"id":"W2030049904","doi":"10.1109/aero.2007.352757","title":"A Novel Leader-Follower Framework for Control of Helicopter Formation","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Control (management); Gradient descent; Control engineering; Internal model; Computer science; Grid; Model predictive control; Nonlinear system; Work (physics); Function (biology); Descent (aeronautics); Engineering; Artificial intelligence; Mathematics; Artificial neural network","score_opus":0.02931440470571413,"score_gpt":0.2794712603783199,"score_spread":0.25015685567260576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2030049904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089186605,0.000051515766,0.9954915,0.00085947715,0.000542511,0.0007062541,0.000023790686,0.00013010777,0.0013029478],"genre_scores_gemma":[0.84140825,3.5456776e-7,0.15766402,0.00063380314,0.00007930245,0.00003535055,0.0000047813887,0.000006882319,0.000167237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862003,0.000014411378,0.00049546297,0.00022693005,0.0002825498,0.00036061037],"domain_scores_gemma":[0.9985964,0.0004179974,0.00021476415,0.0004651984,0.00022080868,0.000084850086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007345306,0.00012966475,0.00024175197,0.000105802515,0.00005174794,0.00007102653,0.0005615534,0.00012200159,0.000011524485],"category_scores_gemma":[0.00016511483,0.00011036415,0.00014843588,0.00021607896,0.000021639766,0.0005511735,0.000039977982,0.00007371721,0.00003699145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012676051,0.0003208088,0.00047787855,0.000104901876,0.00011586337,0.0000024313092,0.00090474746,0.00025962834,0.039702658,0.92717576,0.0014701956,0.029338391],"study_design_scores_gemma":[0.015873827,0.0006503574,0.00716919,0.000287523,0.00007790362,0.000046364283,0.00061091746,0.86826825,0.06100956,0.011272121,0.033713993,0.0010199812],"about_ca_topic_score_codex":0.000020718848,"about_ca_topic_score_gemma":0.000014416922,"teacher_disagreement_score":0.9159036,"about_ca_system_score_codex":0.000046440822,"about_ca_system_score_gemma":0.00002541419,"threshold_uncertainty_score":0.45005193},"labels":[],"label_agreement":null},{"id":"W2031237518","doi":"10.1016/j.jfranklin.2013.05.031","title":"Robust cooperative control for a group of mobile robots with quantized information exchange","year":2013,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mobile robot; Trajectory; Backstepping; Centroid; Controller (irrigation); Information exchange; Group (periodic table); Computer science; Robot; Control theory (sociology); Graph theory; Graph; Topology (electrical circuits); Control (management); Mathematics; Artificial intelligence; Theoretical computer science; Adaptive control; Combinatorics; Telecommunications","score_opus":0.018103186338360007,"score_gpt":0.2217331640133125,"score_spread":0.2036299776749525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031237518","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024271637,0.0002140334,0.971367,0.000714646,0.0014611165,0.001809745,0.000028837148,0.000018329341,0.00011464397],"genre_scores_gemma":[0.9818249,0.000012144971,0.01748946,0.00026441237,0.00013467656,0.00021711804,0.0000031285851,0.0000064655637,0.000047690428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983435,0.00010699845,0.0007934296,0.00010286379,0.00044078106,0.0002124111],"domain_scores_gemma":[0.9971316,0.00013265393,0.0012151327,0.00037459293,0.0010608636,0.000085198226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006723843,0.00015761069,0.00044607744,0.00012522559,0.00013198482,0.00018530019,0.0010916985,0.00006974801,0.000009403469],"category_scores_gemma":[0.0001647262,0.00008870803,0.00019094933,0.0003090777,0.00009291262,0.003110738,0.00006680125,0.00017154502,0.0000128154525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011160499,0.0007329903,0.0018609143,0.00052018574,0.0016142672,0.000014754917,0.0054881033,0.8881765,0.010503039,0.038460545,0.015771452,0.035741176],"study_design_scores_gemma":[0.038790382,0.0028877598,0.008607294,0.0011584834,0.0003168658,0.00032493932,0.0005062034,0.8918895,0.0029543126,0.00069940323,0.051148273,0.00071656465],"about_ca_topic_score_codex":0.00009004914,"about_ca_topic_score_gemma":0.000028683613,"teacher_disagreement_score":0.95755327,"about_ca_system_score_codex":0.0000668587,"about_ca_system_score_gemma":0.0001588757,"threshold_uncertainty_score":0.36174086},"labels":[],"label_agreement":null},{"id":"W2031729762","doi":"10.1016/j.automatica.2007.09.005","title":"Stabilization of decentralized control systems by means of periodic feedback","year":2007,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Quotient; LTI system theory; Mathematics; Decentralised system; Observable; Sampling (signal processing); Controller (irrigation); Discrete time and continuous time; Control system; Mode (computer interface); Linear system; Control (management); Computer science; Engineering; Pure mathematics; Mathematical analysis; Physics","score_opus":0.007866528042605035,"score_gpt":0.23055450573193345,"score_spread":0.2226879776893284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031729762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058675468,0.00055096153,0.9385626,0.00012890487,0.0003860637,0.0007150421,0.00006608886,0.00019189135,0.00072303193],"genre_scores_gemma":[0.99688894,0.000006146178,0.0029745656,0.000027117714,0.000013349302,0.0000163633,0.000015183127,0.000011825421,0.00004651174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758285,0.00018054164,0.0010069491,0.00026583014,0.0005904719,0.0003733686],"domain_scores_gemma":[0.998013,0.00034615074,0.0005587895,0.00067686103,0.0002774317,0.00012772786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001019394,0.00016677716,0.0005216697,0.00010461991,0.00004691901,0.00006834295,0.00072217046,0.00009501205,0.000022786877],"category_scores_gemma":[0.00022038903,0.00015158854,0.0001046811,0.00044698932,0.00008791635,0.00026693754,0.000047408394,0.000057811518,0.000025240559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035096213,0.0031574222,0.040161077,0.004372547,0.0016785362,0.000050637536,0.0138521725,0.012231839,0.48461023,0.3849031,0.019906139,0.034725327],"study_design_scores_gemma":[0.0044784416,0.00017250197,0.008957862,0.00023852772,0.000069693655,0.000012342815,0.00034922437,0.973218,0.009657479,0.00014295639,0.0024011547,0.00030182107],"about_ca_topic_score_codex":0.00011122037,"about_ca_topic_score_gemma":0.000006730766,"teacher_disagreement_score":0.96098614,"about_ca_system_score_codex":0.00008040645,"about_ca_system_score_gemma":0.00008227552,"threshold_uncertainty_score":0.6181601},"labels":[],"label_agreement":null},{"id":"W2031749751","doi":"10.1109/cdc.2011.6160352","title":"Distributed circular formation stabilization of unicycles part I: Undirected information flow graph","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Traverse; Control theory (sociology); Kinematics; Graph; Undirected graph; Flow (mathematics); Information flow; Computer science; Connectivity; Mathematics; Topology (electrical circuits); Control (management); Combinatorics; Geometry; Physics; Artificial intelligence; Geodesy","score_opus":0.02556676581444768,"score_gpt":0.20051982870051205,"score_spread":0.17495306288606438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031749751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014037297,0.000025952966,0.98244125,0.000056691828,0.0002927733,0.00043351226,0.000101186095,0.00037729138,0.002234075],"genre_scores_gemma":[0.99139005,0.000010219682,0.0078108963,0.0000386851,0.000011229772,0.000034143908,0.00069147063,0.0000050560266,0.000008255274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984059,0.00012602287,0.0006905204,0.0001663582,0.00037267763,0.00023853857],"domain_scores_gemma":[0.99845505,0.000038302373,0.00038229764,0.00058937806,0.00044966702,0.000085304724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036008086,0.00014879182,0.00020539625,0.00020662381,0.00008020403,0.00008785225,0.0005536513,0.000090798516,0.00004662414],"category_scores_gemma":[0.000123743,0.00013694495,0.00008553073,0.0008757637,0.000034843666,0.0036568763,0.00008560081,0.000058242353,0.00005531066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021364664,0.0015784337,0.023403246,0.0013571274,0.00069211284,0.000013463789,0.02237399,0.013493367,0.010555413,0.7074722,0.0127105275,0.20613647],"study_design_scores_gemma":[0.0019324162,0.00012503778,0.026983814,0.00009227472,0.00004423898,0.000012370778,0.000531285,0.9245819,0.031818192,0.004422894,0.00893971,0.0005159046],"about_ca_topic_score_codex":0.0001366682,"about_ca_topic_score_gemma":0.000029368854,"teacher_disagreement_score":0.97735274,"about_ca_system_score_codex":0.000074897405,"about_ca_system_score_gemma":0.000043744833,"threshold_uncertainty_score":0.5584453},"labels":[],"label_agreement":null},{"id":"W2032056893","doi":"10.1049/iet-cta.2011.0600","title":"Distributed output regulation of switching multi‐agent systems subject to input saturation","year":2013,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Saturation (graph theory); Computer science; Multi-agent system; Control engineering; Subject (documents); Control (management); Engineering; Mathematics; Artificial intelligence","score_opus":0.01076799891568193,"score_gpt":0.233261761988979,"score_spread":0.22249376307329707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032056893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01600378,0.00026183497,0.9798321,0.00061903935,0.00015757643,0.0027039046,0.00011764776,0.00017622438,0.00012788885],"genre_scores_gemma":[0.9965494,0.000004176216,0.001368369,0.00013398098,0.00011020585,0.0016191019,0.00006282358,0.000012033092,0.00013990891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981015,0.00036463348,0.0005727989,0.00045158903,0.00023914252,0.00027034918],"domain_scores_gemma":[0.9980256,0.00044666923,0.00030754818,0.0007279777,0.00031465554,0.00017752522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000904471,0.00019812757,0.00032410483,0.00012178099,0.00022654404,0.00029035413,0.0005019959,0.00009681135,0.0000046745513],"category_scores_gemma":[0.000129534,0.00017946608,0.00007418492,0.00039216646,0.00003601229,0.0004997213,0.00008005878,0.000106937085,0.00008516744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052094238,0.00019108584,0.0007372481,0.00007401435,0.0001256924,5.301875e-7,0.00056538964,0.007682613,0.10775392,0.8378654,0.0003872672,0.044564724],"study_design_scores_gemma":[0.0056804554,0.0001957534,0.104721114,0.00020342822,0.0001503537,0.00003071402,0.00070380326,0.8447033,0.003020342,0.023731867,0.015845345,0.0010135297],"about_ca_topic_score_codex":0.000107545384,"about_ca_topic_score_gemma":0.0000050495655,"teacher_disagreement_score":0.98054564,"about_ca_system_score_codex":0.00006357804,"about_ca_system_score_gemma":0.000035821537,"threshold_uncertainty_score":0.73184144},"labels":[],"label_agreement":null},{"id":"W2032161112","doi":"10.1109/tsp.2013.2239992","title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Kempe Foundation","keywords":"Gossip; Computer science; Hierarchy; Key (lock); Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.015813264038462612,"score_gpt":0.2439209205638457,"score_spread":0.2281076565253831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032161112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039621033,0.000118067655,0.95817244,0.00028165072,0.0004316524,0.0010537715,0.00001031225,0.00025196094,0.00005912625],"genre_scores_gemma":[0.9938248,0.000004500459,0.0053429897,0.00015860032,0.0000473434,0.00051572564,0.0000038592916,0.000029189552,0.00007298795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764377,0.000114052295,0.00054576603,0.0006192438,0.0003500441,0.0007271431],"domain_scores_gemma":[0.99892664,0.00023458824,0.00016669411,0.00031004363,0.00017627116,0.00018573787],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035674797,0.00028459364,0.00034470033,0.0002142923,0.00036927988,0.00058382156,0.00058900146,0.00013315132,0.000026875436],"category_scores_gemma":[0.000004237825,0.000273795,0.0001492195,0.0006383315,0.000051824245,0.0006381576,0.000003751648,0.00030392493,0.000038067596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047206966,0.0003717837,0.000044083754,0.00007947497,0.000025515323,0.0000072494586,0.0006904145,0.5582354,0.0051051793,0.00007551279,0.00006180669,0.4352564],"study_design_scores_gemma":[0.0021560153,0.00004416238,0.000253212,0.0002584127,0.000013462573,0.000008576197,0.00008004785,0.98976743,0.0069788923,0.00005986861,0.000069623966,0.00031028676],"about_ca_topic_score_codex":0.00007783734,"about_ca_topic_score_gemma":0.000023534923,"teacher_disagreement_score":0.9542038,"about_ca_system_score_codex":0.0002053692,"about_ca_system_score_gemma":0.00009293009,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W2033028559","doi":"10.1109/acc.2014.6859035","title":"Optimality and stability of event triggered consensus state estimation for wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Wireless sensor network; Asynchronous communication; Computer science; Estimator; Scalability; Filter (signal processing); Event (particle physics); Real-time computing; Consensus; Node (physics); State (computer science); Wireless; Covariance; Distributed computing; Algorithm; Computer network; Multi-agent system; Engineering; Mathematics; Artificial intelligence; Telecommunications","score_opus":0.018864341845310443,"score_gpt":0.25616494751114477,"score_spread":0.23730060566583433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033028559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23382995,0.00001909711,0.76490945,0.00028619746,0.00014796728,0.00061104755,0.000031811138,0.000081679944,0.0000827929],"genre_scores_gemma":[0.94930416,0.0000014010003,0.050565798,0.000036040332,0.000013502688,0.000035067722,0.000010417403,0.0000057528855,0.00002784972],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984213,0.00023841985,0.000517928,0.0003780978,0.00018838566,0.00025587395],"domain_scores_gemma":[0.9981574,0.00070763216,0.00025979654,0.0005246235,0.00024413841,0.000106400264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014192803,0.00013769919,0.00033430455,0.000033513163,0.000065341155,0.000074152515,0.0002471731,0.000057130525,0.0000030486433],"category_scores_gemma":[0.00020622318,0.000119519835,0.00006994841,0.00012331898,0.00007264643,0.00011926443,0.000079500736,0.000052817108,0.0000014556491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001000244,0.0012683616,0.01971748,0.0015275079,0.000499555,0.0000065724703,0.0017433276,0.2352507,0.01599285,0.1464279,0.002146332,0.57441914],"study_design_scores_gemma":[0.0013336707,0.000094321585,0.004048311,0.000016400329,0.000010445526,0.0000021246715,0.000018430681,0.99076194,0.0026838365,0.000830819,0.00007164976,0.00012805674],"about_ca_topic_score_codex":0.00011337358,"about_ca_topic_score_gemma":0.000019025156,"teacher_disagreement_score":0.7555112,"about_ca_system_score_codex":0.000041301617,"about_ca_system_score_gemma":0.000039690905,"threshold_uncertainty_score":0.48738775},"labels":[],"label_agreement":null},{"id":"W2033656162","doi":"10.1016/j.automatica.2006.06.023","title":"Trajectory tracking of leader–follower formations characterized by constant line-of-sight angles","year":2006,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; McGill University; Defence Research and Development Canada","funders":"","keywords":"Control theory (sociology); Mathematics; Jacobian matrix and determinant; Kinematics; Nonlinear system; Computer science; Applied mathematics; Control (management)","score_opus":0.01427781561536468,"score_gpt":0.22785223956535963,"score_spread":0.21357442394999496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033656162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12532519,0.0005510767,0.8663352,0.0004864093,0.00038934711,0.0008395641,0.00021615518,0.00043837016,0.0054186876],"genre_scores_gemma":[0.992842,0.0000028887532,0.006840465,0.000035667552,0.00003295359,0.00004657874,0.000044826702,0.00001054589,0.00014405629],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819183,0.00009761783,0.00085361756,0.00020777457,0.00037098734,0.00027816652],"domain_scores_gemma":[0.9986095,0.00022650682,0.00048219025,0.0004865594,0.0001397177,0.000055533514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027293875,0.00016713882,0.0004264022,0.00012420768,0.00006631027,0.000072362775,0.0005876301,0.00008025964,0.000029199256],"category_scores_gemma":[0.00004448615,0.00015033656,0.00014920789,0.00032753183,0.00009347283,0.0005693138,0.000049071925,0.0000790489,0.000027099955],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028603674,0.0013640138,0.001383318,0.00078785577,0.00030242282,0.000025840309,0.0029145624,0.0001533725,0.8759,0.075018,0.0063222703,0.035799745],"study_design_scores_gemma":[0.008890787,0.0005026522,0.021329256,0.0011172192,0.0002443044,0.00008133116,0.0006392662,0.62454534,0.30706778,0.00298686,0.030959288,0.0016359478],"about_ca_topic_score_codex":0.000038316437,"about_ca_topic_score_gemma":0.000005864398,"teacher_disagreement_score":0.8675168,"about_ca_system_score_codex":0.000035793582,"about_ca_system_score_gemma":0.000081479266,"threshold_uncertainty_score":0.61305475},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03212601730101935,"score_gpt":0.28064173251831354,"score_spread":0.24851571521729418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034114456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11576953,0.000008066584,0.8810453,0.00047128674,0.00037084246,0.0011824849,0.00013953992,0.00021583505,0.0007971489],"genre_scores_gemma":[0.8959508,6.8659386e-7,0.10353771,0.00019533609,0.000038082402,0.00016572188,0.000025317215,0.0000063515363,0.00007999378],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985258,0.000073820294,0.0005730024,0.00018895153,0.00033571196,0.00030273988],"domain_scores_gemma":[0.9987373,0.00021243836,0.00019872692,0.00040654314,0.00031409567,0.00013094023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002849573,0.0001482315,0.00029671466,0.000108837325,0.0001374931,0.000067465546,0.00048776515,0.00005975011,0.000009245622],"category_scores_gemma":[0.0003734355,0.0001357673,0.00008258242,0.00030875046,0.00005363327,0.0004030381,0.00009988084,0.00005005664,0.00017455111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00069541135,0.0023683866,0.0028497383,0.0011220999,0.0019100623,0.00014148714,0.110775,0.135777,0.01298152,0.11612939,0.4953682,0.1198817],"study_design_scores_gemma":[0.0013343047,0.00030498992,0.002235275,0.000038031707,0.000011674989,0.000033940854,0.00011039976,0.9821831,0.0064294753,0.000022126213,0.0071113743,0.00018528302],"about_ca_topic_score_codex":0.000027976546,"about_ca_topic_score_gemma":0.0000016019001,"teacher_disagreement_score":0.8464061,"about_ca_system_score_codex":0.000056698434,"about_ca_system_score_gemma":0.00016702733,"threshold_uncertainty_score":0.553643},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.04103071042194741,"score_gpt":0.28439554467257916,"score_spread":0.24336483425063174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034312826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002431906,0.000050385137,0.9926888,0.0007646482,0.0010772172,0.000940859,0.000024074574,0.0006179332,0.0014042171],"genre_scores_gemma":[0.8301954,5.170888e-7,0.1688415,0.00018714668,0.00009105664,0.00025362827,0.000015431899,0.000019760437,0.0003955561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984603,0.000112679176,0.00033622872,0.00026511925,0.00027078672,0.0005549085],"domain_scores_gemma":[0.99811125,0.0008702149,0.00014103066,0.0005705901,0.00010618515,0.00020072583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070373947,0.0001973609,0.00026388068,0.00008183137,0.00013078615,0.00015859908,0.00063079986,0.0000943818,0.000008903671],"category_scores_gemma":[0.00021243823,0.00016587203,0.00009831467,0.00021422569,0.00003586187,0.00019579734,0.00006853559,0.00011048244,0.0003660685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049256523,0.00038255256,0.00011434604,0.00006117881,0.00013034948,0.0000074398654,0.000601038,0.0004764708,0.00023853153,0.9517688,0.017211812,0.02895823],"study_design_scores_gemma":[0.0013539193,0.00015410407,0.00014572362,0.000034272784,0.000017720724,0.000015510903,0.000048214133,0.99257123,0.0008637554,0.002706513,0.001870352,0.00021867517],"about_ca_topic_score_codex":0.000014765466,"about_ca_topic_score_gemma":0.0000018791461,"teacher_disagreement_score":0.99209476,"about_ca_system_score_codex":0.00018109256,"about_ca_system_score_gemma":0.00007217423,"threshold_uncertainty_score":0.6764065},"labels":[],"label_agreement":null},{"id":"W2034335675","doi":"10.1002/cjce.22090","title":"Distributed estimation for a class of nonlinear systems with application to Navier‐Stokes flow estimation","year":2014,"lang":"en","type":"article","venue":"The Canadian Journal of Chemical Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Mitacs","keywords":"Estimation; Class (philosophy); Nonlinear system; Flow (mathematics); Computer science; Applied mathematics; Mathematics; Control theory (sociology); Mathematical optimization; Artificial intelligence; Economics; Physics; Geometry; Control (management)","score_opus":0.005536342790150377,"score_gpt":0.19652152383717944,"score_spread":0.19098518104702905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034335675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018425621,0.000041138606,0.98003787,0.0009379572,0.00015850051,0.0003313157,0.00004277984,0.00001913416,0.0000057082407],"genre_scores_gemma":[0.92288303,6.749738e-8,0.07693797,0.000018301802,0.00009504869,0.000030066114,0.000023473041,0.000010481053,0.0000015622721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990305,0.00001938088,0.00040367377,0.00011045057,0.00022171125,0.0002143162],"domain_scores_gemma":[0.99869037,0.00015912231,0.00024512157,0.00029993837,0.0003190247,0.00028643708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005063416,0.000113170856,0.0002356664,0.000108582746,0.00004693085,0.000103094666,0.0006633964,0.000054999506,2.575591e-7],"category_scores_gemma":[0.0004946775,0.00008483002,0.000054413184,0.000287623,0.000019462186,0.00018363315,0.000015314381,0.00011512262,0.000001768576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009681659,0.0000053735043,0.000012389028,0.00006881602,0.00002749056,7.522917e-7,0.00010082153,0.9825839,0.009367662,0.0020980954,0.00011248826,0.005612553],"study_design_scores_gemma":[0.00038194098,0.000057671215,0.00003815203,0.00016597119,0.000022105565,0.000044009645,0.0000039276797,0.99082655,0.0074843755,0.000055813787,0.0008262728,0.00009321667],"about_ca_topic_score_codex":0.00031226157,"about_ca_topic_score_gemma":0.00004705095,"teacher_disagreement_score":0.9044574,"about_ca_system_score_codex":0.00022034108,"about_ca_system_score_gemma":0.00018324828,"threshold_uncertainty_score":0.34592676},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.018198287343274888,"score_gpt":0.23643786433441336,"score_spread":0.21823957699113847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034754696","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39344764,0.00017648624,0.6020178,0.0018871045,0.0006480204,0.0010911399,0.000042624193,0.00023056209,0.00045861115],"genre_scores_gemma":[0.993264,0.000002932246,0.0055326167,0.0006570228,0.00009169092,0.00013177688,0.00023184194,0.000010344859,0.000077726414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979862,0.00028905764,0.00049327174,0.0005470122,0.00018056195,0.0005038806],"domain_scores_gemma":[0.9982964,0.00089210307,0.00017329016,0.00030866454,0.00020708978,0.00012248442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021809645,0.00020291227,0.00031911882,0.00015625505,0.00011380914,0.00009385576,0.0006375032,0.00013846712,0.000060165286],"category_scores_gemma":[0.00008931195,0.00019334182,0.00006400207,0.00034328114,0.00009682848,0.00011697929,0.00031725032,0.00018226422,0.000496693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014610713,0.00010373742,0.009871026,0.000014109587,0.000063319676,0.000027649607,0.00010550426,0.96587867,0.00035298304,0.017515432,0.0011531379,0.0048998063],"study_design_scores_gemma":[0.0009341569,0.000033762753,0.013896018,0.000027535496,0.00000351534,0.000014446369,0.000016925027,0.9802793,0.0000134425,0.004098999,0.00047573808,0.00020615227],"about_ca_topic_score_codex":0.0002567343,"about_ca_topic_score_gemma":0.000072042894,"teacher_disagreement_score":0.5998164,"about_ca_system_score_codex":0.00025137104,"about_ca_system_score_gemma":0.00005599905,"threshold_uncertainty_score":0.788425},"labels":[],"label_agreement":null},{"id":"W2035537441","doi":"10.1109/icif.2010.5712070","title":"Asynchronous distributed particle filter via decentralized evaluation of Gaussian products","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Particle filter; Robustness (evolution); Asynchronous communication; Wireless sensor network; Distributed computing; Gaussian; Network topology; Algorithm; Computation; Kalman filter; Computer network; Artificial intelligence","score_opus":0.024005038547140842,"score_gpt":0.2699644821667171,"score_spread":0.24595944361957625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035537441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26398054,0.000055591416,0.73156464,0.0016521523,0.0009731954,0.00084073335,0.000028910692,0.00020946069,0.00069479307],"genre_scores_gemma":[0.98951113,9.2542456e-7,0.010219379,0.00004503371,0.00006302937,0.000069237605,0.00005288272,0.000009361362,0.000029005336],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975684,0.00022106284,0.00048498748,0.00046750877,0.0008310307,0.00042698323],"domain_scores_gemma":[0.9977921,0.000059622005,0.00021710184,0.0011073911,0.0006667411,0.00015699399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013545257,0.00017210197,0.00024915056,0.000046607933,0.00007305585,0.00012037689,0.0007725413,0.00008501322,0.0002610386],"category_scores_gemma":[0.0004244163,0.00014450809,0.00007145878,0.00051682704,0.000059779268,0.000520728,0.00011826144,0.00013420358,0.00013817642],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005022152,0.0010319157,0.010180997,0.00007140196,0.00019269717,0.0000115575795,0.00066806213,0.0008766371,0.7487,0.10329942,0.0037241387,0.13119292],"study_design_scores_gemma":[0.0028326402,0.000068771915,0.03854112,0.00001460401,0.00006412756,0.00002090155,0.000017954002,0.71678084,0.23788938,0.0016225529,0.0018540851,0.00029301998],"about_ca_topic_score_codex":0.000101951155,"about_ca_topic_score_gemma":0.0000886752,"teacher_disagreement_score":0.7255306,"about_ca_system_score_codex":0.00006902126,"about_ca_system_score_gemma":0.0002008663,"threshold_uncertainty_score":0.58928686},"labels":[],"label_agreement":null},{"id":"W2035537516","doi":"10.1109/aero.2007.352851","title":"Towards Full Formation Control of an Autonomous Helicopters Group","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Robustness (evolution); Control theory (sociology); Control (management); Sliding mode control; Control engineering; Work (physics); Computer science; Robust control; Control system; Engineering; Nonlinear system","score_opus":0.01168536602980711,"score_gpt":0.23951426880447624,"score_spread":0.22782890277466913,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035537516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04890989,0.000033712033,0.9449131,0.00020614437,0.00037751056,0.0003310445,0.000010412285,0.0002570407,0.0049611535],"genre_scores_gemma":[0.9833014,6.5651994e-7,0.016286822,0.00028124943,0.000054893506,0.0000109580515,0.00001380138,0.000006114781,0.000044112687],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984879,0.00006349446,0.0005181688,0.00024755372,0.00033969074,0.00034319298],"domain_scores_gemma":[0.998908,0.0000443848,0.00021151491,0.0005559382,0.00012735912,0.00015283024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010048896,0.00013606156,0.00022899757,0.00013853968,0.00004996984,0.00009703876,0.0007600158,0.00007390463,0.000015580275],"category_scores_gemma":[0.000021696404,0.00012013257,0.000083401406,0.000229602,0.000025802583,0.0012442372,0.00005808141,0.000064015316,0.000053771713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015603378,0.00049137033,0.00026425807,0.000085635744,0.000103093094,0.0000442908,0.0014913582,0.0007722511,0.08225322,0.2199735,0.0003401677,0.6940248],"study_design_scores_gemma":[0.0041733766,0.000691852,0.011773689,0.000025744786,0.000019428948,0.00006456682,0.00033089903,0.9596501,0.01875795,0.00046312655,0.0036505077,0.00039876503],"about_ca_topic_score_codex":0.00025669276,"about_ca_topic_score_gemma":0.00010249917,"teacher_disagreement_score":0.95887786,"about_ca_system_score_codex":0.000100083926,"about_ca_system_score_gemma":0.000034964472,"threshold_uncertainty_score":0.4898864},"labels":[],"label_agreement":null},{"id":"W2037347151","doi":"10.2316/journal.206.2011.3.206-3383","title":"SWARM AGGREGATION AND FORMATION CONTROL FOR ROBOTS WITH LIMITED PERCEPTION","year":2011,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Swarm robotics; Aggregate (composite); Robot; Swarm behaviour; Perception; Computer science; Set (abstract data type); Simple (philosophy); Control (management); Collective behavior; Range (aeronautics); Human–computer interaction; Artificial intelligence; Engineering; Psychology; Neuroscience; Nanotechnology; Sociology","score_opus":0.020547990892956676,"score_gpt":0.23599936880700012,"score_spread":0.21545137791404345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037347151","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055141907,0.00004661462,0.9431016,0.001070772,0.00035894092,0.00019943314,0.000006067241,0.000027550266,0.000047144975],"genre_scores_gemma":[0.9234165,0.00003762292,0.07633455,0.00008856545,0.00009132536,0.0000063726734,0.000010905361,0.000005175817,0.000008995134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908227,0.00003824687,0.00037905117,0.000106202286,0.00030301925,0.000091196656],"domain_scores_gemma":[0.99845695,0.00006617924,0.0005618735,0.00007311296,0.00078402535,0.000057870802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003344787,0.000091770686,0.00013475538,0.00019427863,0.000058797483,0.00019479835,0.0002077385,0.000046365793,0.0000014071935],"category_scores_gemma":[0.00006222656,0.00007372999,0.00003744561,0.00006448596,0.000021354546,0.0014136214,0.00002034607,0.000057386318,0.0000011931874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010442849,0.0005915642,0.011776862,0.00018666608,0.0009779801,0.00005817707,0.011170954,0.0885007,0.01066214,0.16217342,0.00059429015,0.7122629],"study_design_scores_gemma":[0.0029048459,0.00033752457,0.03990258,0.00014052104,0.0000426066,0.00030651747,0.00011239776,0.95326036,0.00050301134,0.0022827936,0.00009319423,0.0001136281],"about_ca_topic_score_codex":0.000008002139,"about_ca_topic_score_gemma":0.000004636654,"teacher_disagreement_score":0.86827457,"about_ca_system_score_codex":0.00006444888,"about_ca_system_score_gemma":0.000028046215,"threshold_uncertainty_score":0.3006622},"labels":[],"label_agreement":null},{"id":"W2038820425","doi":"10.1016/j.procs.2013.06.015","title":"Gossiping Based Distributed Plan Monitoring","year":2013,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Computer science; Gossip; Distributed computing; Plan (archaeology); Protocol (science); Process (computing); Information sharing; Real-time computing; Operating system","score_opus":0.018486898909161883,"score_gpt":0.2285711135837101,"score_spread":0.21008421467454821,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038820425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034790855,0.00006274373,0.95998037,0.0010520251,0.0025029338,0.0005911244,0.000008245623,0.0008026144,0.0002090992],"genre_scores_gemma":[0.88320917,0.0000011489807,0.116005555,0.00022417598,0.00038909778,0.00013912638,0.000005854785,0.000012070145,0.000013820798],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99607956,0.000055955075,0.00048746192,0.0011580468,0.0011280807,0.0010909195],"domain_scores_gemma":[0.997385,0.00017094897,0.00022710317,0.001107244,0.00059472927,0.00051492563],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00076578965,0.00032501333,0.00030544706,0.00031487888,0.000556992,0.0022240886,0.0042337617,0.00007533431,0.000009846766],"category_scores_gemma":[0.000149906,0.00029760093,0.00008981879,0.002209026,0.00025652425,0.0030983756,0.00077826536,0.00023037668,0.000454051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000226461,0.0010440421,0.20361102,0.0004765819,0.000119116106,0.00017952106,0.0034728355,0.028184455,0.08022307,0.033037018,0.0132154515,0.63641423],"study_design_scores_gemma":[0.00053198135,0.000062738145,0.048983045,0.00009703478,0.0000035097153,0.000021984912,0.000011905388,0.94177806,0.0069497377,0.00039327948,0.0007563324,0.0004103756],"about_ca_topic_score_codex":0.00006834396,"about_ca_topic_score_gemma":6.824314e-7,"teacher_disagreement_score":0.91359365,"about_ca_system_score_codex":0.0002379945,"about_ca_system_score_gemma":0.00048209765,"threshold_uncertainty_score":0.9999476},"labels":[],"label_agreement":null},{"id":"W2039154706","doi":"10.1016/j.conengprac.2013.04.004","title":"Robust formation control without velocity measurement of the leader robot","year":2013,"lang":"en","type":"article","venue":"Control Engineering Practice","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Control theory (sociology); Trajectory; Backstepping; Controller (irrigation); Robot; Mobile robot; Tracking (education); Control engineering; Computer science; Lyapunov function; Artificial neural network; Engineering; Control (management); Adaptive control; Artificial intelligence; Nonlinear system","score_opus":0.028949218111052912,"score_gpt":0.20809161133456808,"score_spread":0.17914239322351516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039154706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027991208,0.00034459255,0.9908266,0.005864617,0.00083962106,0.0012149286,0.000006150899,0.00020318016,0.00042041173],"genre_scores_gemma":[0.99235624,0.00000282757,0.006829907,0.00043930896,0.00009694917,0.00021191435,9.3235184e-7,0.000018885088,0.000043061016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757403,0.00025241746,0.0005705014,0.0002959651,0.00088915764,0.00041794736],"domain_scores_gemma":[0.9971638,0.000432014,0.0004968428,0.00088671985,0.0009057416,0.00011491128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013843816,0.0002449518,0.00036641138,0.000076221986,0.00010583482,0.00023564238,0.0010286045,0.00009832671,0.000008524971],"category_scores_gemma":[0.0023383845,0.00018827079,0.00014293463,0.00030586804,0.000027716664,0.002402703,0.00008091756,0.0003033028,0.00008625819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030897554,0.0001285816,0.00020576363,0.000096464995,0.00029576404,0.000002277021,0.00029843682,0.96431655,0.025511477,0.004216935,0.00072126347,0.0041756197],"study_design_scores_gemma":[0.0028925678,0.000035302648,0.008344303,0.00007349166,0.00008849224,0.000027464406,0.000039624025,0.9830727,0.00062165817,0.0000118396,0.0045851283,0.00020745587],"about_ca_topic_score_codex":0.00015123846,"about_ca_topic_score_gemma":0.000005039608,"teacher_disagreement_score":0.9920763,"about_ca_system_score_codex":0.00022481818,"about_ca_system_score_gemma":0.00009163166,"threshold_uncertainty_score":0.767746},"labels":[],"label_agreement":null},{"id":"W2039210060","doi":"10.1016/j.robot.2005.10.004","title":"Experiments in multirobot coordination","year":2005,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Aerospace; Robot; Control (management); Work (physics); Artificial intelligence; Aerospace engineering","score_opus":0.018287621821446293,"score_gpt":0.24844820980336643,"score_spread":0.23016058798192013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039210060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023325186,0.002773398,0.96670234,0.0019269662,0.0016175698,0.0010800415,0.000009693571,0.00033014416,0.0022346403],"genre_scores_gemma":[0.99342835,0.00000797442,0.005497718,0.000051103227,0.00012275923,0.000055039814,0.000006534742,0.000012374241,0.0008181255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845755,0.00009380006,0.00047898368,0.00040681058,0.00021463721,0.0003482375],"domain_scores_gemma":[0.99923044,0.000051652874,0.00015531993,0.0003921833,0.000056463712,0.00011393926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003462647,0.00018126213,0.00029383926,0.00014746682,0.00008661153,0.00034422323,0.00040415503,0.00009236448,0.0000014831398],"category_scores_gemma":[0.000019009947,0.00017786126,0.000037536567,0.00020048754,0.000020704565,0.00042935807,0.00012171087,0.00009636741,0.000062738065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008563247,0.0005732432,0.008478809,0.00012830787,0.0000769564,0.0000749437,0.002630596,0.6900429,0.0066809766,0.25392935,0.0009397441,0.036435567],"study_design_scores_gemma":[0.00102162,0.000031788888,0.0017160445,0.0000593126,0.0000034123286,0.000027288555,0.000087756394,0.99109346,0.00016911577,0.000024923447,0.0055457023,0.00021958783],"about_ca_topic_score_codex":0.00023892087,"about_ca_topic_score_gemma":0.000026576416,"teacher_disagreement_score":0.9701032,"about_ca_system_score_codex":0.00021414459,"about_ca_system_score_gemma":0.0000429234,"threshold_uncertainty_score":0.7252972},"labels":[],"label_agreement":null},{"id":"W2040069990","doi":"10.1109/allerton.2012.6483385","title":"Theorems about ergodicity and class-ergodicity of chains with applications in known consensus models","year":2012,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Ergodicity; Class (philosophy); Mathematics; Property (philosophy); Statistical physics; Limiting; Applied mathematics; Chain (unit); Mathematical economics; Discrete mathematics; Computer science; Statistics; Physics; Artificial intelligence","score_opus":0.024938734968723463,"score_gpt":0.24823593046708228,"score_spread":0.22329719549835883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040069990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051251393,0.0009413473,0.93350714,0.00037291992,0.00017292134,0.0018023722,0.00015872065,0.0002151272,0.011578053],"genre_scores_gemma":[0.98939705,0.00005105371,0.009805587,0.000055028693,0.000065586355,0.00037116004,0.0000437514,0.000022351323,0.00018846062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697196,0.00024918732,0.00078592374,0.00094440294,0.0005047184,0.00054378796],"domain_scores_gemma":[0.9969393,0.00032525364,0.00056158553,0.0016980091,0.00021790716,0.00025793386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000869242,0.00046797417,0.00087748806,0.000263169,0.000083363084,0.00013977953,0.0013165643,0.00039953974,0.000005889455],"category_scores_gemma":[0.00003123752,0.0003672493,0.0001089226,0.0003705422,0.00036295102,0.0001845173,0.0010914494,0.0006107262,0.000005410702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003368975,0.00040025366,0.008165603,0.00025119417,0.00013016126,0.000005375397,0.0010252333,0.012420788,0.00019082341,0.97453886,0.00011906687,0.0027189376],"study_design_scores_gemma":[0.0018327322,0.00006218613,0.018035153,0.00038355245,0.00007340347,0.000025987232,0.00017921113,0.95624393,0.00041854687,0.021251867,0.000637875,0.0008555517],"about_ca_topic_score_codex":0.0017123529,"about_ca_topic_score_gemma":0.0006680948,"teacher_disagreement_score":0.953287,"about_ca_system_score_codex":0.00014986268,"about_ca_system_score_gemma":0.00032515277,"threshold_uncertainty_score":0.9998779},"labels":[],"label_agreement":null},{"id":"W2041154391","doi":"10.1109/acc.2013.6580459","title":"A distributed control strategy for connectivity preservation of multi-agent systems subject to actuator saturation","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Actuator; Control theory (sociology); Bounded function; Computer science; Position (finance); Saturation (graph theory); Integrator; Multi-agent system; Control (management); Protocol (science); Control engineering; Engineering; Mathematics; Artificial intelligence; Computer network; Bandwidth (computing)","score_opus":0.03831008165610763,"score_gpt":0.27204411249766225,"score_spread":0.2337340308415546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041154391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084664755,0.000048169313,0.90805846,0.0006092046,0.0005477108,0.0054124603,0.00035890721,0.00024166751,0.000058661262],"genre_scores_gemma":[0.99322957,7.589893e-7,0.004660382,0.00009180543,0.00007579948,0.0015896023,0.00012052559,0.000016113087,0.00021544885],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975128,0.0002484222,0.0007515033,0.0005879576,0.00042522897,0.00047408085],"domain_scores_gemma":[0.99698627,0.0005441094,0.00040158365,0.0007885435,0.001046445,0.00023303756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006634265,0.000274176,0.00051544316,0.00013421319,0.00011567307,0.00044765143,0.00078832434,0.00014120675,0.000013493989],"category_scores_gemma":[0.0005960531,0.00023320591,0.00014829387,0.00045227841,0.000022577906,0.0014954037,0.000085832755,0.00008419079,0.000067267596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058651774,0.0026223813,0.011868387,0.0012657368,0.0014149209,0.000011199308,0.0017311417,0.1308568,0.5489752,0.23749915,0.036062196,0.027106324],"study_design_scores_gemma":[0.003307553,0.0003269614,0.031236364,0.000041548145,0.000024015471,0.000003802745,0.00012813538,0.95990205,0.0037593185,0.00011931879,0.0008482509,0.00030270044],"about_ca_topic_score_codex":0.0019470836,"about_ca_topic_score_gemma":0.00014184142,"teacher_disagreement_score":0.9085648,"about_ca_system_score_codex":0.00019670454,"about_ca_system_score_gemma":0.00013140908,"threshold_uncertainty_score":0.9509861},"labels":[],"label_agreement":null},{"id":"W2042097059","doi":"10.1109/ais.2010.5547036","title":"Applying anti-flocking model in mobile surveillance systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Ontario","keywords":"Flocking (texture); Mobility model; Computer science; Robustness (evolution); Scalability; Distributed computing; Mobile computing; Mobile telephony; Real-time computing; Mobile radio; Computer network; Database","score_opus":0.013308478865261745,"score_gpt":0.24135556435093306,"score_spread":0.22804708548567132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042097059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15613405,0.00017040882,0.8355881,0.0000607366,0.0015133142,0.0011751875,0.000008836362,0.00043985556,0.0049095023],"genre_scores_gemma":[0.9943433,0.000004040017,0.004553337,0.00005234282,0.00007960087,0.000637774,0.0000041820563,0.000014124791,0.0003113162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980704,0.00007482699,0.00045187527,0.0005429725,0.00036333565,0.0004965915],"domain_scores_gemma":[0.9986432,0.00011165191,0.00012765036,0.0009112212,0.00009396205,0.00011226835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088275725,0.00019102539,0.00033768846,0.00015204684,0.00008426064,0.000381181,0.0011905085,0.0001170883,0.0000050233066],"category_scores_gemma":[0.000047736994,0.00017572769,0.00006062683,0.0004563963,0.000022265987,0.0005121057,0.0002159528,0.00028985643,0.00009383264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067754263,0.00027765668,0.10089149,0.00014821734,0.00004433266,0.00008766523,0.0006210022,0.6081548,0.11815527,0.14577636,0.0012037504,0.024632683],"study_design_scores_gemma":[0.00046396567,0.000007892145,0.001513563,0.000020605024,7.7064726e-7,0.000015790161,0.000040055304,0.9947426,0.00022928731,0.00008253935,0.002655082,0.00022789395],"about_ca_topic_score_codex":0.00035094967,"about_ca_topic_score_gemma":0.00021877611,"teacher_disagreement_score":0.8382092,"about_ca_system_score_codex":0.00005012401,"about_ca_system_score_gemma":0.00007199606,"threshold_uncertainty_score":0.7165967},"labels":[],"label_agreement":null},{"id":"W2042852455","doi":"10.1243/09596518jsce914","title":"Coordinated path-following control for a group of mobile robots with velocity recovery","year":2010,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part I Journal of Systems and Control Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Mobile robot; Path (computing); Robot; Computer science; Lyapunov function; Control theory (sociology); Control (management); Graph; Group (periodic table); Simulation; Topology (electrical circuits); Mathematics; Artificial intelligence; Theoretical computer science; Computer network; Combinatorics","score_opus":0.005295557074259885,"score_gpt":0.18588790207364247,"score_spread":0.1805923449993826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042852455","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1912514,0.00045222233,0.8057302,0.00007267167,0.0016629762,0.0007604414,0.000029972327,0.000029639334,0.000010467715],"genre_scores_gemma":[0.9957048,0.000009460186,0.0040787715,0.0000065894333,0.00012289824,0.000057778154,4.71856e-7,0.000015233674,0.000003952862],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979103,0.000013514303,0.0011211684,0.0001989539,0.00048659512,0.0002694676],"domain_scores_gemma":[0.99754936,0.00020875913,0.0011477133,0.000165671,0.00078587135,0.0001426577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016507755,0.00023396779,0.00091690785,0.00017293061,0.000060167076,0.00005735187,0.0006629668,0.00015807158,3.4130838e-7],"category_scores_gemma":[0.00051797414,0.00016361359,0.00031862885,0.0003111538,0.00004778962,0.0006001135,0.000044566877,0.00031920968,7.439772e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038355484,0.00016331326,0.0002700429,0.001031505,0.00094956334,0.000004062526,0.00013168431,0.27033547,0.61311144,0.1125915,0.000036138765,0.000991765],"study_design_scores_gemma":[0.009009445,0.0011163065,0.00024851025,0.0018991531,0.00031317,0.00017495448,0.00013999388,0.97036433,0.015829163,0.000088262605,0.00051282026,0.0003039112],"about_ca_topic_score_codex":0.000017475804,"about_ca_topic_score_gemma":5.8633816e-7,"teacher_disagreement_score":0.80445343,"about_ca_system_score_codex":0.000050225688,"about_ca_system_score_gemma":0.000084795065,"threshold_uncertainty_score":0.66719687},"labels":[],"label_agreement":null},{"id":"W2043547735","doi":"10.1109/camsap.2011.6136005","title":"A consensus/fusion based distributed implementation of the particle filter","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle filter; Gaussian; Sensor fusion; Computer science; Filter (signal processing); Fusion; Tracking (education); Wireless sensor network; Fusion center; Algorithm; Control theory (sociology); Artificial intelligence; Telecommunications; Computer network; Physics; Computer vision; Wireless","score_opus":0.03863199220368192,"score_gpt":0.2588960893987723,"score_spread":0.22026409719509038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043547735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38645867,0.000008216818,0.61051166,0.001139718,0.00031165828,0.0004803161,0.000087696135,0.00012181502,0.000880269],"genre_scores_gemma":[0.99682546,1.362906e-7,0.0028737332,0.00020116715,0.000008083751,0.000022193177,0.000008358864,0.0000038612716,0.000057023244],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998883,0.00013838704,0.00032203132,0.0001997559,0.000246178,0.00021063049],"domain_scores_gemma":[0.9989825,0.000060923612,0.00016528773,0.00061801134,0.00011732451,0.000055950044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025021817,0.00009158831,0.00011511317,0.000015277199,0.00007089627,0.000030636842,0.0005849177,0.000029707748,0.00024156141],"category_scores_gemma":[0.0000310359,0.000059576978,0.00008165193,0.0003016208,0.0000417748,0.000104644794,0.00014239395,0.00004159688,0.000031949552],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010934282,0.0009616339,0.56838363,0.00009469339,0.00019401923,0.000026424403,0.003931165,0.0002310408,0.16310552,0.19693391,0.03482441,0.0312042],"study_design_scores_gemma":[0.0024775127,0.00010502751,0.45331663,0.000025435225,0.00002505393,0.000005463746,0.00038503463,0.15941985,0.38211387,0.0005282481,0.0013812508,0.00021662051],"about_ca_topic_score_codex":0.00055943255,"about_ca_topic_score_gemma":0.00011057999,"teacher_disagreement_score":0.61036676,"about_ca_system_score_codex":0.000029051342,"about_ca_system_score_gemma":0.00006850754,"threshold_uncertainty_score":0.2644928},"labels":[],"label_agreement":null},{"id":"W2043577810","doi":"10.1049/iet-cta.2013.0747","title":"Robust adaptive attitude synchronisation of rigid body networks on <i>SO</i> (3)","year":2014,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Synchronization (alternating current); Computer science; Control engineering; Engineering; Artificial intelligence; Control (management); Telecommunications","score_opus":0.009430191973431036,"score_gpt":0.2144016605669671,"score_spread":0.20497146859353607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2043577810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000689344,0.00023005079,0.9947383,0.00032590635,0.00008634504,0.0007452188,0.00003289611,0.000116365714,0.0030355807],"genre_scores_gemma":[0.9978946,0.000013035268,0.00086170505,0.00047089643,0.00020662491,0.0004583523,0.0000152141,0.000009927337,0.00006967948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851483,0.00036081596,0.00032166735,0.00039827448,0.00017595763,0.00022846927],"domain_scores_gemma":[0.99792755,0.00094111095,0.00024367475,0.0006749549,0.00011161957,0.00010111863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010154191,0.00016624393,0.00026960514,0.000056154822,0.00024122973,0.000102754035,0.0005076893,0.00008752275,0.000005832303],"category_scores_gemma":[0.000050044124,0.00015073485,0.00007429593,0.00019195107,0.00013993906,0.00018482216,0.000049200597,0.00013001479,0.00003098807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051533527,0.00009866426,0.000087616296,0.0000073418364,0.00005396683,2.2531461e-7,0.00004502556,0.016966987,0.00086925406,0.961592,0.0001023468,0.020125005],"study_design_scores_gemma":[0.0033554728,0.00033127726,0.0035222806,0.00006705686,0.00009847167,0.000008757436,0.000047518315,0.9163069,0.0003640769,0.053585175,0.021906555,0.00040641823],"about_ca_topic_score_codex":0.000010457165,"about_ca_topic_score_gemma":0.0000032068274,"teacher_disagreement_score":0.9972052,"about_ca_system_score_codex":0.000031512656,"about_ca_system_score_gemma":0.000030648494,"threshold_uncertainty_score":0.6146789},"labels":[],"label_agreement":null},{"id":"W2044544186","doi":"10.1145/2811411.2811550","title":"Maximum reward collection problem","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cluster analysis; Discounting; Computer science; Set (abstract data type); Cluster (spacecraft); Mathematical optimization; Controller (irrigation); Value (mathematics); Trajectory; Artificial intelligence; Mathematics; Machine learning","score_opus":0.03227946666415932,"score_gpt":0.24151584318521893,"score_spread":0.2092363765210596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044544186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008151702,0.000039984854,0.90425515,0.0020245377,0.0007635143,0.0003092397,0.0000012812114,0.00055793545,0.09123319],"genre_scores_gemma":[0.93220216,0.0000013538634,0.05281197,0.00030704227,0.000110141504,0.00007286706,0.000005139966,0.0000100326015,0.014479316],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99888945,0.000070448485,0.00020117749,0.00028389785,0.00031623724,0.00023880776],"domain_scores_gemma":[0.99913305,0.00002082424,0.00006492422,0.00043307283,0.0001750191,0.00017310298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041044023,0.00009676434,0.00012425124,0.000072155504,0.00005635533,0.00019717454,0.00054540974,0.00005160944,0.000011319969],"category_scores_gemma":[0.000045436034,0.00008270676,0.000040164894,0.0004703994,0.000011722426,0.00042071854,0.000120174176,0.000060443326,0.0006433145],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004055338,0.0003079563,0.005343435,0.000033396227,0.0000983902,0.000060848026,0.0018374597,0.0009168313,0.0014478453,0.17698823,0.7760151,0.03690997],"study_design_scores_gemma":[0.006165992,0.00062007835,0.002464805,0.000052232106,0.000021674583,0.00019460254,0.00038226708,0.36318433,0.0033868568,0.046446465,0.57606673,0.0010139963],"about_ca_topic_score_codex":0.00020741398,"about_ca_topic_score_gemma":0.000035705103,"teacher_disagreement_score":0.93138695,"about_ca_system_score_codex":0.00013612522,"about_ca_system_score_gemma":0.00012637807,"threshold_uncertainty_score":0.8268721},"labels":[],"label_agreement":null},{"id":"W2045666956","doi":"10.1007/s10514-009-9163-6","title":"Experimental test of a robust formation controller for marine unmanned surface vessels","year":2009,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Underactuation; Control theory (sociology); Computer science; Robustness (evolution); Kinematics; Actuator; Robust control; Nonholonomic system; Controller (irrigation); Nonlinear system; Robot; Mobile robot; Control (management); Artificial intelligence; Physics","score_opus":0.021106634109607312,"score_gpt":0.2498163698041075,"score_spread":0.2287097356945002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045666956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024086088,0.0002059511,0.97111267,0.0010971635,0.00031404948,0.0013742893,0.00003634884,0.00027049644,0.0015029714],"genre_scores_gemma":[0.9750928,0.0000016072639,0.02418462,0.00018579191,0.00004985273,0.00005221091,0.000038984355,0.000011512408,0.0003825738],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832994,0.0000465976,0.00063152553,0.00036096794,0.0002321697,0.00039882722],"domain_scores_gemma":[0.99868596,0.00019204424,0.000374175,0.00047838813,0.00016693643,0.00010251248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031543872,0.00021900199,0.0004169973,0.000077047116,0.00010960285,0.00012307987,0.0006957331,0.00008917928,0.000009613676],"category_scores_gemma":[0.00008275162,0.00021333009,0.00014436514,0.00021672194,0.000024520483,0.00075104105,0.00009572117,0.0000663747,0.00003061215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027048544,0.0026633246,0.00081006245,0.00012802191,0.00019507401,0.000022795015,0.0024643037,0.3143654,0.5671162,0.054176256,0.0065857423,0.051202327],"study_design_scores_gemma":[0.0046921913,0.00069209817,0.0032117998,0.00003471091,0.000017856471,0.00001834359,0.00006220738,0.9006229,0.088979214,0.0004419842,0.0009069871,0.00031970706],"about_ca_topic_score_codex":0.000036162724,"about_ca_topic_score_gemma":0.0000040093996,"teacher_disagreement_score":0.95100677,"about_ca_system_score_codex":0.00015208698,"about_ca_system_score_gemma":0.000065244836,"threshold_uncertainty_score":0.86993486},"labels":[],"label_agreement":null},{"id":"W2045701250","doi":"10.1142/s0129183101001729","title":"ON THE MAP NAVIGATION USING THE LAPLACE EQUATION","year":2001,"lang":"en","type":"article","venue":"International Journal of Modern Physics C","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Cellular automaton; Laplace's equation; Laplace transform; Computer science; Field (mathematics); Boundary (topology); Boundary value problem; Applied mathematics; Algorithm; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.05290426780823641,"score_gpt":0.29384108706927686,"score_spread":0.24093681926104044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045701250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08124084,0.000047125348,0.9103531,0.0066909725,0.0012782433,0.000089595094,0.0000040776445,0.000012689333,0.00028335664],"genre_scores_gemma":[0.99802923,0.000003962149,0.0007711651,0.00046407446,0.0006592044,0.000002491362,0.0000034267669,0.0000067128485,0.000059708495],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983698,0.00013511766,0.00032038495,0.000109635555,0.0009490955,0.00011593203],"domain_scores_gemma":[0.9982625,0.0003345765,0.0005509232,0.00024340424,0.00057751324,0.000031053518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057896454,0.000094236755,0.00009388628,0.00003806172,0.00010552076,0.0003020293,0.0014221395,0.00002569444,0.000004988574],"category_scores_gemma":[0.000067855945,0.000055212528,0.00011453033,0.00011349153,0.000026111013,0.0005682822,0.0000812044,0.00020572246,0.000025577712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011144826,0.0002600757,0.0005132406,0.0000037478737,0.0003853059,0.000074877964,0.0018098366,0.32370418,0.013668351,0.58244985,0.0017321666,0.07528692],"study_design_scores_gemma":[0.00039322826,0.00002744599,0.0001401272,0.000081895494,0.000009721347,0.000081899394,0.000028869776,0.8668711,0.0009480837,0.13067815,0.00067526207,0.000064210246],"about_ca_topic_score_codex":0.000012812055,"about_ca_topic_score_gemma":7.718073e-7,"teacher_disagreement_score":0.9167884,"about_ca_system_score_codex":0.00016504641,"about_ca_system_score_gemma":0.000071767434,"threshold_uncertainty_score":0.29124755},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.04025656053264936,"score_gpt":0.22834178014972217,"score_spread":0.1880852196170728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047083748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074543236,0.00010275504,0.9906092,0.00009595401,0.0012663525,0.00024019586,0.0000023151806,0.00008546962,0.00014343273],"genre_scores_gemma":[0.9800278,0.000043693723,0.019609328,0.000027286917,0.00002910243,0.000030243607,4.213275e-7,0.000016318434,0.00021579112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856347,0.00006903666,0.00028791762,0.0003957075,0.00024260822,0.0004412519],"domain_scores_gemma":[0.9993209,0.000051757517,0.00007462557,0.00041370915,0.000012291463,0.00012671552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019773457,0.00018988407,0.00021209053,0.00041463616,0.00016815623,0.00007382848,0.00035762947,0.000081074366,0.0000046164587],"category_scores_gemma":[0.0000033526196,0.00020923941,0.00009087904,0.0004026542,0.000034054072,0.0003644272,0.000007126949,0.00022131042,0.000041582764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008137973,0.00024661855,0.00072106515,0.000024254497,0.000069978,0.00003945233,0.002999929,0.98454297,0.001319076,0.000376045,0.0000014349255,0.009651064],"study_design_scores_gemma":[0.0017366767,0.00024758495,0.0056420635,0.0003707474,0.00009753803,0.000056124867,0.0011534098,0.9796115,0.010289366,0.00008477935,0.000029793702,0.00068040757],"about_ca_topic_score_codex":0.000041282383,"about_ca_topic_score_gemma":0.000005633205,"teacher_disagreement_score":0.9725735,"about_ca_system_score_codex":0.00017320324,"about_ca_system_score_gemma":0.000014967715,"threshold_uncertainty_score":0.8532536},"labels":[],"label_agreement":null},{"id":"W2047604387","doi":"10.1016/j.physd.2007.10.009","title":"Minimal mechanisms for school formation in self-propelled particles","year":2007,"lang":"en","type":"article","venue":"Physica D Nonlinear Phenomena","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Aggregate (composite); Stability (learning theory); Motion (physics); Context (archaeology); Construct (python library); Mathematics; Computer science; Physics; Classical mechanics; Geology; Nanotechnology","score_opus":0.017469020178607592,"score_gpt":0.251679300712406,"score_spread":0.23421028053379842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047604387","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07614268,0.000043273474,0.920179,0.00052645634,0.00022347136,0.0012333288,0.000028175733,0.00033654898,0.0012870241],"genre_scores_gemma":[0.88981026,0.0000017239539,0.10938997,0.00015186088,0.00043719576,0.000106518586,0.000031994252,0.000018984749,0.000051500127],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981612,0.000055487402,0.0005004098,0.00039652127,0.00029740066,0.0005889655],"domain_scores_gemma":[0.99889266,0.0001447721,0.00019062977,0.00048201173,0.000119145865,0.00017079797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070508424,0.00019798058,0.0002772869,0.00012751688,0.00009569798,0.00014389993,0.00066343247,0.00004865539,0.0000050841672],"category_scores_gemma":[0.00006528677,0.000187189,0.000101163365,0.00045390258,0.000014933578,0.00084404746,0.00012153368,0.000108720466,0.00022603408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007366685,0.0053992905,0.00045252097,0.0005458646,0.00033967276,0.000068447865,0.00879741,0.0015141366,0.545329,0.2651425,0.0024720025,0.1692025],"study_design_scores_gemma":[0.003757662,0.0002580396,0.0008606039,0.000032149754,0.000018629482,0.000004255645,0.00024595924,0.9319404,0.04802821,0.006608732,0.007812153,0.00043321922],"about_ca_topic_score_codex":0.000015550333,"about_ca_topic_score_gemma":0.000018708033,"teacher_disagreement_score":0.93042624,"about_ca_system_score_codex":0.00017775067,"about_ca_system_score_gemma":0.000050720017,"threshold_uncertainty_score":0.7633346},"labels":[],"label_agreement":null},{"id":"W2047608312","doi":"10.1016/j.automatica.2010.06.009","title":"Stabilization of sets with application to multi-vehicle coordinated motion","year":2010,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lyapunov function; Control theory (sociology); Control-Lyapunov function; Nonlinear system; Exponential stability; Dynamical systems theory; Lyapunov redesign; State vector; Computer science; LTI system theory; Mathematics; Linear system; Control (management); Artificial intelligence","score_opus":0.007494929443777977,"score_gpt":0.24154574888244357,"score_spread":0.2340508194386656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047608312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23403603,0.00000190631,0.76445514,0.00043263848,0.00008629535,0.00057550555,0.0000075040443,0.00027283398,0.00013213907],"genre_scores_gemma":[0.9421763,9.674896e-8,0.057624582,0.00004286034,0.000009254176,0.00009442002,0.000017963781,0.000009595649,0.000024919365],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894166,0.000052050906,0.00029431484,0.00028063828,0.00025414783,0.00017719228],"domain_scores_gemma":[0.9987407,0.0000584705,0.00017059462,0.00067290996,0.00025926725,0.000098066645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026196963,0.0001087351,0.00016414594,0.000091050395,0.000055500805,0.00006140088,0.00046633385,0.00006258941,0.000008737097],"category_scores_gemma":[0.00010441653,0.00009343079,0.000024127778,0.0005877441,0.00002819808,0.0003045291,0.00006536441,0.00007584726,0.00009791924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024907014,0.0008296792,0.013648244,0.00018236927,0.00007248733,0.0000038483327,0.0024717567,0.003989934,0.7874797,0.06071207,0.00038809108,0.1301969],"study_design_scores_gemma":[0.0006225815,0.00006471199,0.04203889,0.000020316507,0.000008429905,0.0000037773257,0.00002261799,0.93949556,0.017291788,0.00013238646,0.00017921449,0.00011969345],"about_ca_topic_score_codex":0.000079005884,"about_ca_topic_score_gemma":0.00007901347,"teacher_disagreement_score":0.9355056,"about_ca_system_score_codex":0.000028980168,"about_ca_system_score_gemma":0.000038294747,"threshold_uncertainty_score":0.38099968},"labels":[],"label_agreement":null},{"id":"W2048255852","doi":"10.1109/wcica.2014.7052858","title":"A potential field-based PSO approach for cooperative target searching of multi-robots","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Flexibility (engineering); Particle swarm optimization; Computer science; Swarm robotics; Field (mathematics); Fitness function; Potential field; Mobile robot; Function (biology); Artificial intelligence; Swarm behaviour; Machine learning; Mathematics; Genetic algorithm","score_opus":0.02136146213270044,"score_gpt":0.26708134639703796,"score_spread":0.24571988426433752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048255852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007913019,0.000018222157,0.9966236,0.00042001437,0.00021249488,0.00072528824,0.000018085459,0.00012147546,0.0010695461],"genre_scores_gemma":[0.6242395,1.1473124e-7,0.37520546,0.0002102414,0.000043610704,0.00006304312,0.000020188965,0.000006892767,0.00021096806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983807,0.00020351162,0.00036320844,0.00042559014,0.0002818568,0.00034510717],"domain_scores_gemma":[0.9987264,0.00027292973,0.00013305995,0.00050673523,0.00025298444,0.00010786373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007237267,0.0001594894,0.0002992584,0.00009160721,0.00011866564,0.0001257504,0.0008325608,0.00007921596,0.000010764555],"category_scores_gemma":[0.00028555267,0.00013210923,0.00013824052,0.00018723971,0.000031271276,0.00023005057,0.0001132927,0.000105197425,0.000008462371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021971305,0.0017056597,0.0013203342,0.0005081587,0.00030480349,0.0000073463116,0.0013197217,0.7739752,0.067131944,0.1144608,0.0062556937,0.032790635],"study_design_scores_gemma":[0.0021258846,0.0001866732,0.00015286142,0.000013090104,0.0000065278223,0.0000015065048,0.000031582287,0.9804349,0.016464857,0.000064870204,0.00036253914,0.0001547044],"about_ca_topic_score_codex":0.00010946917,"about_ca_topic_score_gemma":0.000005945282,"teacher_disagreement_score":0.6234482,"about_ca_system_score_codex":0.000023490333,"about_ca_system_score_gemma":0.00008810163,"threshold_uncertainty_score":0.5387258},"labels":[],"label_agreement":null},{"id":"W2048585016","doi":"10.1109/acc.2012.6314631","title":"Distributed and cooperative estimation of formation flight of unmanned vehicles subject to faults and unreliable information","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Digraph; Supervisor; Observability; Estimator; Computer science; Observer (physics); Estimation; Process (computing); Set (abstract data type); Control theory (sociology); Path (computing); Actuator; Control (management); Artificial intelligence; Mathematics; Engineering; Statistics","score_opus":0.008958076600972269,"score_gpt":0.23033948286190528,"score_spread":0.221381406260933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048585016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31316882,0.000041974945,0.68590325,0.00017979219,0.00006735485,0.0003342977,0.000051392086,0.000036449237,0.00021665389],"genre_scores_gemma":[0.99339867,0.000004791313,0.006419867,0.000039596314,0.000005957389,0.000017921808,0.00009755881,0.000002256848,0.000013398132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904096,0.00005479874,0.00043193204,0.00009268539,0.00020542115,0.00017419591],"domain_scores_gemma":[0.99916613,0.00009907019,0.00021295907,0.00018638182,0.00023732385,0.00009815198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037947172,0.00010415257,0.0001939721,0.00012457938,0.000058452533,0.00005693732,0.0001411694,0.000051168056,0.0000019500258],"category_scores_gemma":[0.00016798206,0.00008715735,0.000016944585,0.0003441144,0.000027643187,0.003669307,0.0000949206,0.000027142441,0.000009757087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053578534,0.00075020216,0.035245996,0.0020092742,0.0003426243,0.0000013082819,0.052210238,0.04560775,0.08597213,0.5870894,0.007986497,0.18224876],"study_design_scores_gemma":[0.001319597,0.000204659,0.0431095,0.00009235744,0.000017912953,0.000009402671,0.0004880972,0.829024,0.124752976,0.00015907432,0.0006224937,0.00019991588],"about_ca_topic_score_codex":0.00010299876,"about_ca_topic_score_gemma":0.0000070922915,"teacher_disagreement_score":0.7834163,"about_ca_system_score_codex":0.000033290642,"about_ca_system_score_gemma":0.000019220242,"threshold_uncertainty_score":0.35541734},"labels":[],"label_agreement":null},{"id":"W2048648163","doi":"10.1109/tac.2012.2215512","title":"Adaptive Deployment of Mobile Robotic Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Probabilistic logic; Distributed computing; Software deployment; A priori and a posteriori; Event (particle physics); Mobile robot; Routing (electronic design automation); Mathematical optimization; Simple (philosophy); Robot; Artificial intelligence; Mathematics","score_opus":0.015515320017728653,"score_gpt":0.23668571697087326,"score_spread":0.2211703969531446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048648163","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002508167,0.00028598675,0.9937232,0.00010344382,0.0016569506,0.0011113924,0.000017304137,0.00043185905,0.00016169938],"genre_scores_gemma":[0.99567765,0.000005018616,0.0034639426,0.00013917526,0.00005757196,0.00052319985,8.268161e-7,0.000021822905,0.00011076395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977927,0.00024538237,0.00064806244,0.00029195577,0.0004489625,0.00057292474],"domain_scores_gemma":[0.9981529,0.00045612126,0.0002718896,0.0007861348,0.00009891786,0.00023399832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047762986,0.0002617888,0.0005266822,0.0001703073,0.00012292285,0.000055141332,0.0006043139,0.000107684864,0.00007617069],"category_scores_gemma":[0.0000076281176,0.00023905835,0.00024901112,0.0003912437,0.000051396528,0.00048574727,0.0000028540064,0.00016056164,0.00013862926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003189386,0.0011516425,0.00006423869,0.000038900253,0.00045615307,0.0000048007078,0.00065108115,0.8470079,0.0008596502,0.0013730734,0.00018086423,0.14817986],"study_design_scores_gemma":[0.0019610769,0.00023857171,0.00057257613,0.00007258638,0.00011410897,0.000014492379,0.0000600669,0.995665,0.0009868223,0.000022396634,0.000075360666,0.00021690929],"about_ca_topic_score_codex":0.000046390218,"about_ca_topic_score_gemma":0.000009097179,"teacher_disagreement_score":0.9931695,"about_ca_system_score_codex":0.00015490441,"about_ca_system_score_gemma":0.00005960781,"threshold_uncertainty_score":0.97485167},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018067301611565927,"score_gpt":0.23640557837025047,"score_spread":0.21833827675868456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048848526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017410103,0.00018153335,0.97757715,0.00029339155,0.00044603756,0.0037077651,0.00015881713,0.00016328847,0.00006194185],"genre_scores_gemma":[0.99391764,0.000020447,0.003308066,0.00009645263,0.000056710367,0.002293523,0.0000063310167,0.000029766992,0.00027105294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975806,0.00017131459,0.00057970383,0.0005268714,0.00039291853,0.0007485804],"domain_scores_gemma":[0.99804443,0.0004002821,0.0002923244,0.0005975022,0.00048673287,0.00017873949],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002687355,0.00031471666,0.0005662197,0.00012759655,0.00022456223,0.00015958656,0.000674126,0.00023871071,0.00003784677],"category_scores_gemma":[0.000031084983,0.00027147392,0.00017816878,0.00063912594,0.00008442672,0.0005940007,0.0000019423887,0.0004999643,0.000027897984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031707347,0.0032873591,0.00007833564,0.00008540285,0.0021881126,0.0000061557503,0.0011632392,0.76547664,0.10483889,0.014290571,0.0049999156,0.10041466],"study_design_scores_gemma":[0.040372703,0.006491356,0.000014934787,0.00021022254,0.00019756633,0.000033726144,0.00020147552,0.7253344,0.21488814,0.0002391784,0.011003331,0.001012961],"about_ca_topic_score_codex":0.00012050421,"about_ca_topic_score_gemma":0.00009574294,"teacher_disagreement_score":0.97650754,"about_ca_system_score_codex":0.0003276601,"about_ca_system_score_gemma":0.0007633552,"threshold_uncertainty_score":0.9999738},"labels":[],"label_agreement":null},{"id":"W2049903316","doi":"10.1109/iswpc.2008.4556312","title":"Greedy gossip with eavesdropping","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Wireless sensor network; Computer science; Gossip protocol; Network topology; Node (physics); Computer network; Greedy algorithm; Wireless network; Consensus algorithm; Distributed computing; Wireless; Algorithm; Engineering; Telecommunications","score_opus":0.01930724799234034,"score_gpt":0.18710482086439917,"score_spread":0.16779757287205882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049903316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02588727,0.00004903906,0.9381244,0.000595099,0.00019747423,0.00017009508,0.0000013210134,0.00045805384,0.034517225],"genre_scores_gemma":[0.97976506,0.000001965322,0.01610865,0.00027332522,0.000059976206,0.000014891299,0.0000017050847,0.0000074008026,0.0037670205],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882966,0.000035875957,0.00017429247,0.00033652128,0.00031773598,0.00030590923],"domain_scores_gemma":[0.9990908,0.000035950205,0.000064574524,0.00061338703,0.000075380696,0.00011991579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000110723995,0.00012847416,0.00015616411,0.00006125292,0.00015896725,0.00009304119,0.00073238864,0.0000354093,0.000022864337],"category_scores_gemma":[0.000013851118,0.00009278727,0.00004084977,0.0003412005,0.000047289774,0.00047756569,0.000101039936,0.00007737433,0.00036540884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104637875,0.0009913467,0.15179928,0.0001227827,0.00070868543,0.004627639,0.006706728,0.0028512988,0.018743016,0.6740307,0.072056375,0.067257516],"study_design_scores_gemma":[0.009795355,0.00093893247,0.241436,0.0002234766,0.00003806485,0.0041657267,0.00030397213,0.61875826,0.009194377,0.0008967449,0.11151806,0.002731051],"about_ca_topic_score_codex":0.00014158615,"about_ca_topic_score_gemma":0.000020498095,"teacher_disagreement_score":0.9538778,"about_ca_system_score_codex":0.00004030452,"about_ca_system_score_gemma":0.00007335187,"threshold_uncertainty_score":0.46967134},"labels":[],"label_agreement":null},{"id":"W2050895525","doi":"10.3182/20130902-3-cn-3020.00051","title":"Average Consensus in Multi-Agent Systems with Non-uniform Time-Varying Delays and Random Packet Losses","year":2013,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Topology (electrical circuits); Bernoulli's principle; Multi-agent system; Bounded function; Network topology; Mathematics; Network packet; Control theory (sociology); Discretization; Stability (learning theory); Integrator; Computer science; Mathematical optimization; Mathematical analysis; Bandwidth (computing); Engineering","score_opus":0.012433477669195144,"score_gpt":0.21458956808122567,"score_spread":0.20215609041203053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050895525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87876666,0.0007382389,0.113569744,0.0005774239,0.00038859816,0.0030769934,0.000029337893,0.00049764814,0.0023553807],"genre_scores_gemma":[0.9896951,0.00002272696,0.008803889,0.000081933285,0.00006208137,0.00034828685,0.0000071127783,0.000036918245,0.0009419543],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715525,0.00003518686,0.00066310994,0.0008368635,0.0005115606,0.0007980421],"domain_scores_gemma":[0.9984212,0.00015809218,0.000363377,0.00032673162,0.0004345631,0.00029604565],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005814868,0.00045015686,0.00068752473,0.00027422621,0.00021541966,0.0012964993,0.0007252768,0.00016126213,0.000014041779],"category_scores_gemma":[0.00014055592,0.00037137602,0.00006821468,0.0005294989,0.00013753073,0.0011635993,0.0002644327,0.00026638468,0.000280873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012111554,0.002538771,0.7487156,0.005565866,0.0020898378,0.0011928241,0.037048724,0.016433692,0.09621798,0.0077962424,0.039964717,0.041224606],"study_design_scores_gemma":[0.0072420416,0.00015415954,0.0077583655,0.00046506297,0.000021376705,0.00023283984,0.0005190457,0.9818544,0.0005314702,0.000052757423,0.00055569113,0.0006127871],"about_ca_topic_score_codex":0.0011318573,"about_ca_topic_score_gemma":0.000020853728,"teacher_disagreement_score":0.9654207,"about_ca_system_score_codex":0.00016131037,"about_ca_system_score_gemma":0.00009198183,"threshold_uncertainty_score":0.9998738},"labels":[],"label_agreement":null},{"id":"W2051898446","doi":"10.1109/cdc.2014.7040091","title":"Cooperative receding horizon control for multi-target interception in uncertain environments","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Interception; Tracking (education); Horizon; Set (abstract data type); Controller (irrigation); Trajectory; Control (management); Routing (electronic design automation); Sequence (biology); Vehicle dynamics; Control theory (sociology); Artificial intelligence; Engineering; Mathematics; Computer network; Aerospace engineering","score_opus":0.03140240708451065,"score_gpt":0.27534551733880336,"score_spread":0.24394311025429272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051898446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005479908,0.000016055737,0.99203026,0.00038336642,0.0004953356,0.0009664016,0.000016053224,0.00009279,0.000519839],"genre_scores_gemma":[0.95395935,0.0000022312709,0.044823732,0.00023690792,0.00007722363,0.0002759212,0.000024563391,0.0000121326075,0.00058793626],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982771,0.00023043137,0.00039928834,0.00051304966,0.00019179021,0.00038832182],"domain_scores_gemma":[0.9991855,0.00020173086,0.000120825986,0.00035758523,0.000040172068,0.000094174204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008280303,0.00019368342,0.00029486563,0.000112567344,0.00008003338,0.0001318548,0.0005670796,0.00009341495,0.000020315025],"category_scores_gemma":[0.00020775961,0.00017193615,0.0000723524,0.00015301809,0.000026911524,0.0004970642,0.00007456168,0.000104703766,0.000100068006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059743115,0.0021556087,0.03427492,0.00016841695,0.00042041912,0.000023004657,0.0068090395,0.06371499,0.37216884,0.17318977,0.006212914,0.34026462],"study_design_scores_gemma":[0.0047920696,0.00029999195,0.0019385279,0.000032699067,0.0000044458743,0.0000013447892,0.00010785513,0.9840639,0.0019773787,0.00013487702,0.00642534,0.0002215346],"about_ca_topic_score_codex":0.000072771625,"about_ca_topic_score_gemma":0.000056943798,"teacher_disagreement_score":0.9484795,"about_ca_system_score_codex":0.00022680472,"about_ca_system_score_gemma":0.000017896095,"threshold_uncertainty_score":0.7011353},"labels":[],"label_agreement":null},{"id":"W2052089350","doi":"10.1109/tac.2012.2206720","title":"Distributed Circular Formation Stabilization for Dynamic Unicycles","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Decoupling (probability); Graph; Spanning tree; Turning radius; Mathematics; Control (management); Computer science; Engineering; Control engineering","score_opus":0.014499103709518579,"score_gpt":0.24779486210599738,"score_spread":0.23329575839647881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052089350","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074023018,0.000089744855,0.98756903,0.00075808645,0.0011226195,0.0018326892,0.0003939562,0.00080623967,0.00002533165],"genre_scores_gemma":[0.9952873,0.000004050096,0.00365678,0.00015050374,0.000034085882,0.0007483241,0.00006195882,0.000024690153,0.000032307402],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978812,0.0002003217,0.0006323745,0.00030398736,0.00039812608,0.0005840392],"domain_scores_gemma":[0.99819803,0.0004405212,0.00025901527,0.00072697905,0.00017685437,0.00019861174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050174695,0.0002687005,0.00035941316,0.00021108978,0.00030744527,0.00018453645,0.00051350915,0.00012954754,0.000026151707],"category_scores_gemma":[0.0000465322,0.00026187574,0.00023940514,0.0004313804,0.00003204796,0.0014815474,0.0000018710953,0.00009998049,0.00010084314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020609408,0.004132571,0.00018432351,0.0013693766,0.0013225032,0.000007497859,0.0047182953,0.25037703,0.06274807,0.017423121,0.0010363258,0.65647477],"study_design_scores_gemma":[0.0029959546,0.00008100089,0.0008008048,0.00004952235,0.00010377962,0.000015633192,0.00007514172,0.99300075,0.0016484656,0.00023539734,0.000719833,0.00027374507],"about_ca_topic_score_codex":0.000010225917,"about_ca_topic_score_gemma":0.0000142698345,"teacher_disagreement_score":0.987885,"about_ca_system_score_codex":0.00038578667,"about_ca_system_score_gemma":0.00006257247,"threshold_uncertainty_score":0.9999834},"labels":[],"label_agreement":null},{"id":"W2052487511","doi":"10.1016/j.mechatronics.2011.06.006","title":"Nonlinear coordination control for a group of mobile robots using a virtual structure","year":2011,"lang":"en","type":"article","venue":"Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Mobile robot; Robot; Trajectory; Controller (irrigation); Control engineering; Computer science; Nonlinear system; Robot control; Position (finance); Control (management); Control theory (sociology); Engineering; Artificial intelligence","score_opus":0.02291342957436744,"score_gpt":0.24452457105566008,"score_spread":0.22161114148129263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052487511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05802219,0.00017136971,0.9399633,0.00002062713,0.0005803744,0.00092152087,0.00021808827,0.00008552799,0.000017048376],"genre_scores_gemma":[0.9063533,0.0000010159746,0.09342231,0.000033961995,0.00007016412,0.000058293626,0.000025712632,0.000016549497,0.000018681887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856585,0.000073576935,0.0004081326,0.00034666856,0.00025917654,0.00034661515],"domain_scores_gemma":[0.99879056,0.00007287592,0.0003266632,0.0005050272,0.00023107376,0.00007379935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034740174,0.00017587193,0.00033586807,0.00010035873,0.00008211384,0.00004514058,0.0006916711,0.00012884231,0.000010426619],"category_scores_gemma":[0.00005288765,0.00016813971,0.00013730033,0.00021481686,0.000026254089,0.00038240207,0.00008504667,0.000098214405,0.000003611698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003131016,0.0007992253,0.00063538866,0.00021283966,0.0005050715,0.000009804118,0.0029785822,0.03936034,0.22612777,0.68870926,0.0002577834,0.04009083],"study_design_scores_gemma":[0.0026074047,0.0005034174,0.000043944965,0.000025521122,0.00004291524,0.0000067729165,0.00009075819,0.98806834,0.0059969258,0.0017510157,0.00066985795,0.00019312499],"about_ca_topic_score_codex":0.00006365071,"about_ca_topic_score_gemma":0.00002193351,"teacher_disagreement_score":0.948708,"about_ca_system_score_codex":0.0001174554,"about_ca_system_score_gemma":0.00010324891,"threshold_uncertainty_score":0.6856538},"labels":[],"label_agreement":null},{"id":"W2052628167","doi":"10.1007/s10846-012-9751-0","title":"Rendezvous and Standoff Target Tracking Guidance Using Differential Geometry","year":2012,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Rendezvous; Tracking (education); Differential (mechanical device); Computer science; Simplicity; Stability (learning theory); Control theory (sociology); Computer vision; Artificial intelligence; Engineering; Aerospace engineering; Physics; Control (management); Spacecraft","score_opus":0.042141723182161264,"score_gpt":0.2783180432255638,"score_spread":0.23617632004340255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052628167","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0688181,0.019526696,0.90313554,0.00006558314,0.008055546,0.0002740142,0.0000050269928,0.00004300484,0.00007650179],"genre_scores_gemma":[0.99017394,0.00007284649,0.00828006,0.000024286102,0.0013185709,0.0000034872648,0.0000011345485,0.000027048934,0.000098620236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601555,0.00038478925,0.0016067621,0.00028775062,0.0009896649,0.0007154623],"domain_scores_gemma":[0.9968312,0.00027075593,0.0014673487,0.00048904336,0.00047985476,0.00046180343],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018455891,0.00033158626,0.0008429964,0.0004052526,0.00015773537,0.0005646451,0.0009308914,0.00014216211,0.000011980698],"category_scores_gemma":[0.00027871277,0.0002679761,0.00023757115,0.0004315297,0.00005240889,0.0012675531,0.00017632285,0.00034180543,0.000015790893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043830252,0.0028918523,0.26750705,0.0018925681,0.00417782,0.0009431975,0.012195911,0.5462743,0.07051228,0.056719236,0.007543748,0.028903758],"study_design_scores_gemma":[0.0033245168,0.00067480205,0.016823051,0.0027209176,0.00041363275,0.009645022,0.0023946862,0.94777125,0.008104466,0.000267992,0.006240209,0.0016194416],"about_ca_topic_score_codex":0.00006180685,"about_ca_topic_score_gemma":9.449042e-7,"teacher_disagreement_score":0.92135584,"about_ca_system_score_codex":0.00038451303,"about_ca_system_score_gemma":0.000103920225,"threshold_uncertainty_score":0.99997723},"labels":[],"label_agreement":null},{"id":"W205268150","doi":"10.1007/978-3-540-34690-6_4","title":"Stigmergic Navigation for Multi-Agent Teams in Complex Environments","year":2006,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Maxima and minima; Computer science; Artificial intelligence; Terrain; Robot; Construct (python library); Domain (mathematical analysis); Domain knowledge; Human–computer interaction; Distributed computing; Geography; Mathematics; Cartography","score_opus":0.14985335548781673,"score_gpt":0.36680404833733016,"score_spread":0.21695069284951343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205268150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047086643,0.0031180452,0.9888796,0.00021623926,0.0010521251,0.0017606522,0.00022120879,0.00007894301,0.004626057],"genre_scores_gemma":[0.7281765,0.00064312783,0.20404585,0.0005445881,0.00056453,0.0013074449,0.0029342659,0.00019085873,0.06159284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961205,0.00007571369,0.001434769,0.0011218915,0.0007500264,0.00049706997],"domain_scores_gemma":[0.9979097,0.0007423573,0.0005897064,0.00047666804,0.0002065264,0.00007501023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057147077,0.0005916916,0.0008012047,0.0004028371,0.00015199157,0.00008315039,0.001128723,0.00022591221,0.0000151732565],"category_scores_gemma":[0.00008853788,0.0006404557,0.00020366546,0.00017451444,0.00031126387,0.00025221967,0.0004544228,0.00037594457,0.0001546112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024020157,0.00024376933,0.00028045208,0.00025396896,0.0002600362,0.00009988726,0.0008524444,0.69205403,0.00001131068,0.286814,0.0028266998,0.016279344],"study_design_scores_gemma":[0.0009115714,0.00011873104,0.0012086014,0.00083309395,0.000030226365,0.000014992863,0.00011813593,0.85967445,0.000022733217,0.11182086,0.024348129,0.00089844404],"about_ca_topic_score_codex":0.000065059176,"about_ca_topic_score_gemma":0.0001044817,"teacher_disagreement_score":0.7848338,"about_ca_system_score_codex":0.0012281516,"about_ca_system_score_gemma":0.000108680215,"threshold_uncertainty_score":0.9996047},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014680055287204084,"score_gpt":0.2174647791286227,"score_spread":0.2027847238414186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053362064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075309374,0.0007092584,0.98270935,0.00030366617,0.0022489969,0.005616816,0.00019669863,0.0006801201,0.000004184166],"genre_scores_gemma":[0.9929237,0.000014122279,0.0023919758,0.000024271241,0.00008238179,0.004469857,0.0000058998435,0.00003529917,0.00005254432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696475,0.00033051384,0.0010315629,0.0007283286,0.00029980164,0.00064505707],"domain_scores_gemma":[0.9972759,0.0005527441,0.0005670913,0.0008782174,0.00058817636,0.00013790214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005286745,0.00039069925,0.0007819155,0.0003641287,0.00030847656,0.0002223045,0.0005928397,0.0005338814,0.000002696232],"category_scores_gemma":[0.00004166276,0.00036881742,0.00017353591,0.0005310568,0.00010111328,0.00038366707,0.000006115917,0.0002488406,0.000028988474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013814674,0.00019219068,0.000043233213,0.00018468901,0.0004895094,0.000005305281,0.00007290178,0.9299847,0.05177158,0.0007682434,0.00016714924,0.01618235],"study_design_scores_gemma":[0.0031565968,0.00069884234,0.000039520226,0.00012630908,0.00008749902,0.00012534832,0.000053432,0.9885475,0.0061072144,0.00014920444,0.0005918532,0.00031666632],"about_ca_topic_score_codex":0.00032937765,"about_ca_topic_score_gemma":0.00003730191,"teacher_disagreement_score":0.9853927,"about_ca_system_score_codex":0.00021769849,"about_ca_system_score_gemma":0.00004854193,"threshold_uncertainty_score":0.9998764},"labels":[],"label_agreement":null},{"id":"W2053868191","doi":"10.1109/syscon.2014.6819230","title":"Unmanned Aerial Vehicle formation flying using Linear Model Predictive Control","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Royal Military College of Canada","funders":"","keywords":"Computer science; Flocking (texture); Model predictive control; Aerodynamics; Control theory (sociology); Identification (biology); Linear model; Control (management); Vehicle dynamics; Simulation; Artificial intelligence; Aerospace engineering; Engineering; Machine learning","score_opus":0.024631187094773254,"score_gpt":0.24658405451761384,"score_spread":0.2219528674228406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053868191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030099178,0.000008461848,0.96706176,0.00027706107,0.00044964624,0.00041202758,0.000013569948,0.00036591565,0.0013124062],"genre_scores_gemma":[0.97975916,3.5196004e-7,0.019560168,0.00034534818,0.0002334757,0.000023826584,0.000007729028,0.0000106827265,0.00005928448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846244,0.00014306609,0.00037471513,0.00031411325,0.00034430978,0.00036138014],"domain_scores_gemma":[0.99899614,0.00008520113,0.00016993278,0.0004573014,0.00017359649,0.00011784624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005110252,0.00015952835,0.00023343615,0.00008303341,0.00023121775,0.00019020961,0.0005547294,0.000087566965,0.0000038070461],"category_scores_gemma":[0.00010219752,0.00014523044,0.00008005992,0.00017936042,0.00002061329,0.001420036,0.0001045171,0.00009500946,0.00006382709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007921294,0.00007182029,0.0001565802,0.00002347623,0.000051288804,0.0000019918896,0.00071110844,0.91981757,0.03832406,0.035438776,0.0003395115,0.0049845944],"study_design_scores_gemma":[0.0023803506,0.000057543264,0.000070069116,0.000019575935,0.000014514144,0.000004498568,0.00002644122,0.994835,0.0016403304,0.0006474254,0.00014180306,0.00016245856],"about_ca_topic_score_codex":0.000055343786,"about_ca_topic_score_gemma":0.0000058547153,"teacher_disagreement_score":0.94965994,"about_ca_system_score_codex":0.00011530379,"about_ca_system_score_gemma":0.00005118822,"threshold_uncertainty_score":0.5922325},"labels":[],"label_agreement":null},{"id":"W2054191858","doi":"10.1016/j.automatica.2013.06.023","title":"Structural controllability of multi-agent networks: Robustness against simultaneous failures","year":2013,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Network controllability; Robustness (evolution); Digraph; Computer science; Cardinality (data modeling); Graph; Observability; Multi-agent system; Graph theory; Mathematical optimization; Distributed computing; Topology (electrical circuits); Mathematics; Theoretical computer science; Discrete mathematics; Data mining; Artificial intelligence; Applied mathematics; Betweenness centrality","score_opus":0.012027463637504059,"score_gpt":0.23030457553903952,"score_spread":0.21827711190153545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054191858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29192564,0.0002360517,0.70406955,0.0007308672,0.00072373985,0.0015085068,0.00001907912,0.00062217953,0.0001643864],"genre_scores_gemma":[0.97624546,0.0000025239078,0.023329975,0.00012918122,0.00006216187,0.000113956216,0.000013650762,0.000019232188,0.000083871884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704343,0.00031283085,0.0009477568,0.0005571002,0.00051165523,0.0006272009],"domain_scores_gemma":[0.9967265,0.0008384091,0.00043400386,0.0013293,0.00043670542,0.00023507277],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036526454,0.00033886364,0.0006675686,0.00008840115,0.0001357304,0.000285074,0.0015041508,0.00015133506,0.00006863989],"category_scores_gemma":[0.0006184866,0.0002776429,0.00019264682,0.00040189957,0.00014919956,0.0005688964,0.00028872263,0.00017317309,0.000108114924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013587369,0.00026205563,0.0019640266,0.00019082095,0.00028064253,0.00004320647,0.00064234,0.93124837,0.0028256362,0.0036652104,0.00097259204,0.05789151],"study_design_scores_gemma":[0.0014373849,0.000050358467,0.007089562,0.000048847945,0.000018426166,0.000008353335,0.00007055339,0.9906056,0.00015666858,0.00010901084,0.00011945438,0.0002858101],"about_ca_topic_score_codex":0.0002178116,"about_ca_topic_score_gemma":0.000029186242,"teacher_disagreement_score":0.6843198,"about_ca_system_score_codex":0.000111317844,"about_ca_system_score_gemma":0.0000782788,"threshold_uncertainty_score":0.9999676},"labels":[],"label_agreement":null},{"id":"W2055071238","doi":"10.1109/acc.2012.6315649","title":"Distributed coordination of multi-agent systems for coverage problem in presence of obstacles","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Voronoi diagram; Obstacle; Visibility; Computer science; Distributed computing; Software deployment; Obstacle avoidance; Function (biology); Mathematical optimization; System deployment; Mathematics; Mobile robot; Robot; Artificial intelligence","score_opus":0.030984844372936277,"score_gpt":0.26813359829024214,"score_spread":0.23714875391730586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055071238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027903438,0.0007276271,0.9685387,0.00008848659,0.0004990524,0.0017420811,0.00026828097,0.00006907249,0.00016325535],"genre_scores_gemma":[0.9917892,0.00000879211,0.0076811784,0.0000059364484,0.000024974888,0.00023041494,0.000059147776,0.000009328245,0.00019099827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979722,0.00015421181,0.00080650096,0.00027996735,0.0003601594,0.0004269688],"domain_scores_gemma":[0.9982244,0.00037274713,0.0004690168,0.0005059618,0.0003241262,0.00010376768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093584496,0.00016729397,0.00041253574,0.000142256,0.000032599157,0.00004799354,0.000703241,0.00009198308,0.0000025686381],"category_scores_gemma":[0.00024642763,0.00014865953,0.000095085954,0.00046798313,0.00003816494,0.0007804804,0.00013889975,0.000060747072,0.00000459499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001621024,0.005031126,0.2883978,0.0037319441,0.00034742124,0.0000067100364,0.004316839,0.05430566,0.08031417,0.5425594,0.0062042507,0.014622602],"study_design_scores_gemma":[0.004121902,0.00014939562,0.0517562,0.00029424916,0.000021418567,0.0000055420123,0.0003048922,0.9290911,0.010757196,0.0001663362,0.0029649374,0.00036684974],"about_ca_topic_score_codex":0.0006114038,"about_ca_topic_score_gemma":0.000029565976,"teacher_disagreement_score":0.9638858,"about_ca_system_score_codex":0.00012179369,"about_ca_system_score_gemma":0.000056287365,"threshold_uncertainty_score":0.60621595},"labels":[],"label_agreement":null},{"id":"W2057323761","doi":"10.1109/ccece.2012.6334984","title":"An H&lt;inf&gt;&amp;#x221E;&lt;/inf&gt; consensus achievement for LTI multi-agent systems with directed fixed networks","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Algebraic graph theory; Controller (irrigation); State (computer science); Full state feedback; Lyapunov function; Exponential stability; Multi-agent system; Computer science; Graph; Algebraic Riccati equation; Algebraic number; Riccati equation; Linear system; Mathematics; Control (management); Discrete mathematics; Algorithm; Differential equation; Nonlinear system; Artificial intelligence","score_opus":0.03421037778665469,"score_gpt":0.2648436383176582,"score_spread":0.23063326053100353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057323761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02606537,0.0012754482,0.96149224,0.00043398672,0.0037485287,0.004218962,0.00016494199,0.0019226747,0.0006778207],"genre_scores_gemma":[0.9307341,0.000013657141,0.06423287,0.00033159164,0.0007338344,0.0010185095,0.00029527483,0.00010589197,0.0025342414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99328595,0.0006598538,0.0013712206,0.0013700713,0.0010866283,0.002226276],"domain_scores_gemma":[0.99423575,0.00059895427,0.000730761,0.0025438005,0.00072383974,0.0011669061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019338712,0.000934334,0.0011046072,0.00026630607,0.0005503548,0.0008602121,0.0019367401,0.00037528906,0.000033615794],"category_scores_gemma":[0.00014245689,0.0007453528,0.0002868922,0.0008219584,0.0001435659,0.00086837524,0.00032375005,0.0003178714,0.00021079576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002970491,0.021314878,0.113711044,0.00216763,0.009026815,0.00027255103,0.010771806,0.26303282,0.100499906,0.24463384,0.18487482,0.046723418],"study_design_scores_gemma":[0.0064075575,0.00048773843,0.00946996,0.0001838823,0.00015629888,0.00008485761,0.00016405006,0.8805715,0.00026564463,0.0000100488805,0.100823365,0.0013751419],"about_ca_topic_score_codex":0.0003730632,"about_ca_topic_score_gemma":0.00054833654,"teacher_disagreement_score":0.90466875,"about_ca_system_score_codex":0.00045729833,"about_ca_system_score_gemma":0.00018582611,"threshold_uncertainty_score":0.99949974},"labels":[],"label_agreement":null},{"id":"W2057409697","doi":"10.1109/wac.2014.6936157","title":"A PSO-based approach to cooperative foraging tasks of multi-robots in completely unknown environments","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Foraging; Swarm robotics; Robot; Task (project management); Computer science; Potential field; Artificial intelligence; Field (mathematics); Motion planning; Function (biology); Fitness function; Mobile robot; Robotics; Path (computing); Machine learning; Engineering; Ecology; Mathematics","score_opus":0.036244052915053566,"score_gpt":0.2526308987189012,"score_spread":0.21638684580384765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057409697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007348043,0.000016060529,0.9882626,0.00022944002,0.00011542193,0.00075141725,0.000011284714,0.000067683985,0.0031980618],"genre_scores_gemma":[0.901693,2.1558209e-7,0.09748705,0.00045878577,0.000013767115,0.000096607124,0.00001704595,0.000012090863,0.00022145317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782556,0.0002729717,0.0005067186,0.00059649645,0.00037587178,0.00042240755],"domain_scores_gemma":[0.99879116,0.00013637185,0.00013864288,0.0007239417,0.00004615958,0.00016370889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005837662,0.0002302192,0.0004238927,0.00019952125,0.000059660604,0.00008481815,0.0010274639,0.00006598235,0.000006539898],"category_scores_gemma":[0.00008366905,0.00020576749,0.00006991985,0.00046272768,0.00004811362,0.00024338048,0.00022063074,0.00011927821,0.0000779339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000663429,0.0027095075,0.010836197,0.00012790432,0.00010831397,0.000011900567,0.0026456532,0.83128005,0.041921243,0.08285706,0.0008680325,0.026567785],"study_design_scores_gemma":[0.002424764,0.00009574803,0.0068654814,0.00004080996,0.000004023347,0.0000014497487,0.000042875472,0.98448795,0.0031895502,0.00001497362,0.0025874232,0.00024494683],"about_ca_topic_score_codex":0.00024460896,"about_ca_topic_score_gemma":0.00005669976,"teacher_disagreement_score":0.8943449,"about_ca_system_score_codex":0.000112242065,"about_ca_system_score_gemma":0.000040849034,"threshold_uncertainty_score":0.8390955},"labels":[],"label_agreement":null},{"id":"W2058967398","doi":"10.1109/cdc.2011.6161448","title":"Cooperative multi-vehicle search and coverage problem in uncertain environments","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Computer science; A priori and a posteriori; Voronoi diagram; Stability (learning theory); Cover (algebra); Service (business); Mathematical optimization; Task (project management); Terrain; Path (computing); Engineering; Machine learning; Mathematics; Geography","score_opus":0.04772482286911734,"score_gpt":0.2506316031452064,"score_spread":0.20290678027608905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058967398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14257671,0.000100106976,0.8495449,0.00017536027,0.00007863253,0.0009047107,0.000012619398,0.00009136184,0.00651563],"genre_scores_gemma":[0.97931105,0.000013756445,0.018886896,0.00013894841,0.000006541988,0.000049227194,0.0000032663718,0.000007328885,0.00158298],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985821,0.00017492393,0.00024189056,0.00044243032,0.00021705887,0.00034155272],"domain_scores_gemma":[0.99944997,0.00004170817,0.00003233673,0.00033802088,0.000019640183,0.00011834057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036520875,0.00014331975,0.00017343806,0.00007446189,0.00006397459,0.00009226441,0.000460066,0.00005879474,0.00004756007],"category_scores_gemma":[0.000012407849,0.00012243554,0.000021225915,0.00020021173,0.000053019594,0.0005073013,0.00026385844,0.0001238969,0.00013716012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002221676,0.0048538684,0.5061713,0.00017982574,0.00036100388,0.00102647,0.05945668,0.007495765,0.09467396,0.20087332,0.0009047926,0.12378086],"study_design_scores_gemma":[0.0057206787,0.00026155368,0.16456899,0.000052374584,0.000005074979,0.000015804224,0.0004045978,0.8158054,0.011146133,0.00025407976,0.0012146226,0.0005507283],"about_ca_topic_score_codex":0.0011106811,"about_ca_topic_score_gemma":0.00012536981,"teacher_disagreement_score":0.83673435,"about_ca_system_score_codex":0.00008242584,"about_ca_system_score_gemma":0.00003476164,"threshold_uncertainty_score":0.49927762},"labels":[],"label_agreement":null},{"id":"W2061450398","doi":"10.1049/iet-cta.2014.0163","title":"Topology optimisation‐based distributed estimation in relay assisted wireless sensor networks","year":2014,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Program for New Century Excellent Talents in University; Science and Technology Commission of Shanghai Municipality; Ministry of Education of the People's Republic of China","keywords":"Relay; Wireless sensor network; Topology (electrical circuits); Computer science; Network topology; Computer network; Wireless; Control theory (sociology); Engineering; Telecommunications; Electrical engineering; Control (management); Power (physics); Artificial intelligence; Physics","score_opus":0.007621157044663842,"score_gpt":0.238968824979938,"score_spread":0.23134766793527414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061450398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029249664,0.00006838425,0.99347115,0.0019914312,0.00009415083,0.00084835745,0.00005330986,0.00021932299,0.00032892363],"genre_scores_gemma":[0.9933406,0.0000027665849,0.005019294,0.0005033186,0.00009069336,0.00083028094,0.00015643283,0.000011154464,0.0000454651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997886,0.000744587,0.00044223684,0.0004715709,0.00013940857,0.00031622147],"domain_scores_gemma":[0.9974618,0.0014237047,0.00022335854,0.0006647424,0.00010471248,0.00012167372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013273256,0.00019000811,0.0003088738,0.000108355845,0.0002247675,0.00014171674,0.0004581239,0.00015720495,0.000008164933],"category_scores_gemma":[0.00012818113,0.00018601303,0.000060909908,0.00043457898,0.00011862555,0.00021019073,0.00004242546,0.00018144779,0.00002192338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063976884,0.00014251907,0.0005977061,0.000012848459,0.00003162098,0.0000016825011,0.00004633906,0.19718604,0.00060808635,0.7454505,0.000077518926,0.055781186],"study_design_scores_gemma":[0.0023111769,0.000032725424,0.0068988195,0.000017492677,0.000025176802,0.000008038832,0.000023188355,0.98022234,0.000049230337,0.007800133,0.0024143334,0.00019733142],"about_ca_topic_score_codex":0.00001523654,"about_ca_topic_score_gemma":0.000007719626,"teacher_disagreement_score":0.99041563,"about_ca_system_score_codex":0.00006267549,"about_ca_system_score_gemma":0.00003768454,"threshold_uncertainty_score":0.75853914},"labels":[],"label_agreement":null},{"id":"W2062037547","doi":"10.1109/sysose.2007.4304280","title":"Semi-Decentralized Optimal Control of a Cooperative Team of Agents","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Decentralised system; Information flow; State information; Minification; Control (management); Optimal control; State (computer science); Mathematical optimization; Multi-agent system; Function (biology); Distributed computing; Control theory (sociology); Mathematics; Artificial intelligence; Algorithm","score_opus":0.014998041877989502,"score_gpt":0.26720707553868006,"score_spread":0.2522090336606906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062037547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044822887,0.00010562179,0.9483484,0.00010436676,0.00025957808,0.0005321339,0.00004876665,0.000083652776,0.005694566],"genre_scores_gemma":[0.9919382,0.0000041394023,0.007498313,0.00012957344,0.000020032614,0.000008608179,0.000005094373,0.000007503851,0.00038856102],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980213,0.000108533684,0.0007095542,0.0003062433,0.00045361288,0.00040072334],"domain_scores_gemma":[0.9984353,0.00021280715,0.00030744702,0.00052159885,0.00037583866,0.00014696491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007721581,0.00016933943,0.0004708723,0.00010781627,0.000039905797,0.00003375159,0.0008285789,0.000079925674,0.00007606523],"category_scores_gemma":[0.00012734182,0.0001403658,0.00013251808,0.00040262644,0.000084206455,0.00027965242,0.00009623416,0.000081598824,0.000027611608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001404941,0.003764559,0.040776294,0.00030098978,0.0022238363,0.00016736871,0.00802017,0.020542128,0.45863384,0.4113772,0.024839675,0.027949015],"study_design_scores_gemma":[0.022926662,0.0007939311,0.021001184,0.00017219948,0.00009338084,0.000035452373,0.00074986427,0.69216573,0.24982892,0.00011376618,0.011329919,0.00078898005],"about_ca_topic_score_codex":0.000102581915,"about_ca_topic_score_gemma":0.000016505659,"teacher_disagreement_score":0.9471153,"about_ca_system_score_codex":0.000052044015,"about_ca_system_score_gemma":0.00008861856,"threshold_uncertainty_score":0.57239515},"labels":[],"label_agreement":null},{"id":"W2062185449","doi":"10.1007/s11071-012-0533-9","title":"Neural network-based adaptive output feedback formation control for multi-agent systems","year":2012,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Tracking error; Bounded function; Nonlinear system; Artificial neural network; Controller (irrigation); Approximation error; Basis function; Computer science; Chebyshev filter; Tracking (education); Multi-agent system; Mathematics; Chebyshev polynomials; Control (management); Algorithm; Artificial intelligence","score_opus":0.04102523142823948,"score_gpt":0.2639599528527295,"score_spread":0.22293472142449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062185449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043348554,0.00039429805,0.9883077,0.00029208828,0.0036678081,0.002086977,0.00047246,0.00036647724,0.00007730363],"genre_scores_gemma":[0.92085767,0.0000020646373,0.0769794,0.00032694652,0.0009170602,0.00029028626,0.00037572434,0.00004263304,0.00020822228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714524,0.00023129322,0.0007100102,0.00041332046,0.00045240438,0.0010477338],"domain_scores_gemma":[0.99781185,0.00027482043,0.00047441377,0.00073097233,0.00039508496,0.00031288184],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092387566,0.00036839923,0.00048777205,0.00010770612,0.00024317873,0.00028914885,0.00085601135,0.00020518494,0.0000013003325],"category_scores_gemma":[0.000094083545,0.0003473113,0.00025091035,0.00030549665,0.000040755047,0.0010659497,0.00009304086,0.00021184329,0.00009685828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027458856,0.0009914926,0.012129694,0.0002768105,0.00026646937,0.000009786711,0.0004394696,0.9281602,0.000068796144,0.03332503,0.002232884,0.021824807],"study_design_scores_gemma":[0.0038902373,0.00013104535,0.0016559592,0.000049288687,0.000049607806,0.000012699748,0.000064329535,0.99039346,0.0000084530575,0.000009397768,0.003365909,0.00036961833],"about_ca_topic_score_codex":0.00005397852,"about_ca_topic_score_gemma":0.00005983513,"teacher_disagreement_score":0.9165228,"about_ca_system_score_codex":0.00049871014,"about_ca_system_score_gemma":0.00009111444,"threshold_uncertainty_score":0.9998979},"labels":[],"label_agreement":null},{"id":"W2062932390","doi":"10.1145/2696454.2696470","title":"Bounds of Neglect Benevolence in Input Timing for Human Interaction with Robotic Swarms","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Swarm robotics; Computer science; Flocking (texture); Neglect; Task (project management); Swarm intelligence; Robot; Artificial intelligence; Particle swarm optimization; Distributed computing; Machine learning; Engineering; Psychology","score_opus":0.062363367824612964,"score_gpt":0.3051613335258365,"score_spread":0.24279796570122356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062932390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09696357,0.000024706953,0.9011011,0.00019539658,0.0002535366,0.00036212595,0.0000012221773,0.000074116906,0.0010241839],"genre_scores_gemma":[0.9874985,3.9866583e-7,0.012185174,0.00004525838,0.000031300762,0.00004748085,0.000006291163,0.000007937291,0.00017762143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886197,0.000046361503,0.00031961343,0.00029359572,0.00023815656,0.00024029965],"domain_scores_gemma":[0.9991224,0.00007843362,0.00016245541,0.00037659268,0.00017915512,0.00008098656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029392616,0.00011932853,0.00022481591,0.00015524865,0.00003712174,0.000100486504,0.00051368243,0.0000423175,0.0000022462968],"category_scores_gemma":[0.00006145689,0.00009739783,0.000037845577,0.00033350984,0.000024514004,0.0006493497,0.00007656506,0.00007501424,0.000007913316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065244973,0.002180161,0.089839295,0.0007564711,0.00043159048,0.000089158915,0.015677776,0.4271248,0.077383675,0.29680786,0.0054242336,0.083632514],"study_design_scores_gemma":[0.0038218596,0.0009924165,0.005216543,0.00037122576,0.000020121051,0.000028779472,0.0005349247,0.9776457,0.008207479,0.0019987884,0.0007614957,0.00040069822],"about_ca_topic_score_codex":0.0006714212,"about_ca_topic_score_gemma":0.0006202049,"teacher_disagreement_score":0.890535,"about_ca_system_score_codex":0.00019285086,"about_ca_system_score_gemma":0.000087281565,"threshold_uncertainty_score":0.39717683},"labels":[],"label_agreement":null},{"id":"W2063175591","doi":"10.1109/acc.2012.6315571","title":"A connectivity preserving containment control strategy for unicycles with static leaders","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Containment (computer programming); Control theory (sociology); Computer science; Control (management); Lyapunov function; Convex hull; Convergence (economics); Limit (mathematics); Property (philosophy); Graph; Nonlinear system; Regular polygon; Mathematics; Theoretical computer science","score_opus":0.04791438071171143,"score_gpt":0.28332453620911885,"score_spread":0.2354101554974074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063175591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027924834,0.00015470835,0.96725696,0.0012378019,0.00016893669,0.0014987722,0.00003345462,0.00023920706,0.0014853141],"genre_scores_gemma":[0.99345165,8.458187e-7,0.0054527405,0.00037452285,0.00006670514,0.00034270747,0.00000650953,0.00001587065,0.00028844422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981239,0.00016829283,0.00028167467,0.00035452776,0.00032788934,0.00074373954],"domain_scores_gemma":[0.99822944,0.00065348024,0.00015392846,0.0005948944,0.00012799108,0.00024029061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071473094,0.00022113328,0.0003313215,0.000058648875,0.00013327488,0.00019910219,0.00066143676,0.0000557981,0.000018766683],"category_scores_gemma":[0.000084663974,0.00016685619,0.00007245488,0.00014804909,0.000059922826,0.0011329441,0.000069685695,0.000086258995,0.000020766878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063602976,0.0016637264,0.053645335,0.00051011745,0.0015604338,0.000031313655,0.004768511,0.019166429,0.0057509053,0.8798956,0.0076687583,0.024702782],"study_design_scores_gemma":[0.01806742,0.0012150379,0.022778412,0.0001224411,0.00014475404,0.000054663436,0.005407129,0.93937206,0.0022687323,0.001770508,0.0076153595,0.0011834926],"about_ca_topic_score_codex":0.000242211,"about_ca_topic_score_gemma":0.00013958836,"teacher_disagreement_score":0.9655268,"about_ca_system_score_codex":0.0001330214,"about_ca_system_score_gemma":0.00009783076,"threshold_uncertainty_score":0.6804198},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.020923120930046894,"score_gpt":0.24709192300959815,"score_spread":0.22616880207955126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063403497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005167798,0.00009096497,0.9948324,0.0009526761,0.0013655663,0.00056317076,0.000077076926,0.00043617538,0.0011651964],"genre_scores_gemma":[0.9431465,0.000001693661,0.055462256,0.00026908945,0.00026037998,0.000111722205,0.00024037981,0.000014269339,0.0004936924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984387,0.0000634652,0.00032832185,0.00030739358,0.00025740225,0.00060469104],"domain_scores_gemma":[0.9988506,0.00015295466,0.00013168927,0.0004873781,0.00016809358,0.00020929016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048181097,0.00017456272,0.00021859272,0.0000677944,0.00015820318,0.00024308625,0.00047171093,0.000079636295,0.000047527472],"category_scores_gemma":[0.00012492944,0.00015987214,0.00009446964,0.00027618968,0.000020289086,0.0011584042,0.00013707901,0.000067093395,0.00008792047],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008162019,0.00105198,0.021164142,0.0002051415,0.00046578093,0.000015460499,0.0019514263,0.13306865,0.003442057,0.7275988,0.08824771,0.02270724],"study_design_scores_gemma":[0.0012158023,0.000028104496,0.0010393503,0.000011529245,0.000015116048,0.000014327928,0.00004778398,0.973058,0.0010952189,0.000101667785,0.02310213,0.00027098518],"about_ca_topic_score_codex":0.000021246464,"about_ca_topic_score_gemma":0.0000013308303,"teacher_disagreement_score":0.94262975,"about_ca_system_score_codex":0.00009907488,"about_ca_system_score_gemma":0.00004009321,"threshold_uncertainty_score":0.6519397},"labels":[],"label_agreement":null},{"id":"W2064596270","doi":"10.1109/taes.2012.6237593","title":"Network-Based Tracking Control of Spacecraft Formation Flying with Communication Delays","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":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Spacecraft; Bounded function; Tracking error; Controller (irrigation); Trajectory; Tracking (education); Representation (politics); Computer science; Mathematics; Engineering; Control (management); Physics; Mathematical analysis; Aerospace engineering","score_opus":0.013875236713004358,"score_gpt":0.2160412420654418,"score_spread":0.20216600535243745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064596270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017497675,0.0024219789,0.97847724,0.00037237673,0.00027580062,0.00073972583,0.000009765936,0.0001338334,0.00007157573],"genre_scores_gemma":[0.9989334,0.000056025066,0.00064157683,0.000072379975,0.000048789454,0.00017666038,0.000004423619,0.000020596553,0.000046192366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801385,0.000293533,0.00040082636,0.0002354047,0.0003508197,0.0007055348],"domain_scores_gemma":[0.99850047,0.00023496157,0.00034565706,0.00064562605,0.00014222831,0.0001310708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085345603,0.00023219982,0.0003673095,0.00011593231,0.00037458597,0.00014963702,0.0003416254,0.00011593832,0.000001838121],"category_scores_gemma":[0.0000036563597,0.00020450776,0.00007531906,0.0004105808,0.000046930232,0.00085437176,0.0000017900592,0.00028719177,0.00000913339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005890105,0.0008692497,0.0034511413,0.00056681817,0.000673639,0.000002969036,0.0038467378,0.9152093,0.024807716,0.027306005,0.0003816771,0.022295758],"study_design_scores_gemma":[0.004614995,0.00060399703,0.00046308443,0.00055956905,0.00015979946,0.000095773765,0.00044513645,0.9853981,0.0060181506,0.000025852363,0.0011073484,0.0005081564],"about_ca_topic_score_codex":0.00019795823,"about_ca_topic_score_gemma":0.00014988378,"teacher_disagreement_score":0.98143566,"about_ca_system_score_codex":0.00021911682,"about_ca_system_score_gemma":0.00009376107,"threshold_uncertainty_score":0.83395845},"labels":[],"label_agreement":null},{"id":"W2067475245","doi":"10.1360/aas-007-0529","title":"Formation Control of Mobile Robots with Active Obstacle Avoidance","year":2007,"lang":"en","type":"article","venue":"Acta Automatica Sinica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"University of Science and Technology of China; Tsinghua University; University of Toronto; Chinese Academy of Sciences","keywords":"Obstacle; Obstacle avoidance; Mobile robot; Robot; Control theory (sociology); Computer science; Motion (physics); Robot control; Motion control; Controller (irrigation); Relative motion; Control engineering; Control (management); Artificial intelligence; Engineering; Geography; Physics","score_opus":0.008215041348994515,"score_gpt":0.23947760636959614,"score_spread":0.23126256502060163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067475245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1208189,0.0000468931,0.8746817,0.00043730694,0.00016752532,0.00097550236,0.000023441682,0.00034100187,0.0025077008],"genre_scores_gemma":[0.9833464,0.0000021633314,0.016353972,0.00012455566,0.00002902769,0.00007649478,0.000008491701,0.000014514156,0.00004438614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777097,0.00012160518,0.0007465647,0.0003437669,0.0005599106,0.00045717458],"domain_scores_gemma":[0.9972472,0.0007571599,0.00065633794,0.0009556857,0.00025031267,0.00013328195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007894454,0.00020809702,0.00046261318,0.00011298179,0.00009774368,0.00009069724,0.00091614365,0.00009815977,0.000011958315],"category_scores_gemma":[0.00019470914,0.00017088378,0.00009143065,0.0004696435,0.00008953636,0.0012198926,0.00008451564,0.0001478366,0.00005695289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014479958,0.004610435,0.0072502005,0.0012851818,0.002474492,0.00027717664,0.020472249,0.008713736,0.32173923,0.086024195,0.0070894873,0.53861564],"study_design_scores_gemma":[0.008025309,0.0011517451,0.11560201,0.0004634817,0.00014305886,0.00012671734,0.0005326308,0.80711466,0.061432566,0.00068690383,0.0038166046,0.0009042854],"about_ca_topic_score_codex":0.000020930393,"about_ca_topic_score_gemma":0.000014469752,"teacher_disagreement_score":0.8625275,"about_ca_system_score_codex":0.000119915785,"about_ca_system_score_gemma":0.000103715065,"threshold_uncertainty_score":0.6968438},"labels":[],"label_agreement":null},{"id":"W2067965875","doi":"10.1142/s230138501550003x","title":"Cooperative Multi-Vehicle Search and Coverage Problem in an Uncertain Environment","year":2014,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; A priori and a posteriori; Voronoi diagram; Task (project management); Search and rescue; Service (business); Path (computing); Cover (algebra); Search algorithm; Mathematical optimization; Operations research; Engineering; Artificial intelligence; Algorithm; Systems engineering; Mathematics","score_opus":0.0248617023602219,"score_gpt":0.25101217364123335,"score_spread":0.22615047128101146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067965875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27505782,0.0004011412,0.72096497,0.00038871978,0.0003575929,0.0019660972,0.00003634536,0.00020518443,0.0006221225],"genre_scores_gemma":[0.9971424,0.000010601714,0.0019416838,0.000078139434,0.00007496551,0.00016672483,0.0000216314,0.00002035952,0.00054350117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663633,0.0010332253,0.0005280675,0.0007901383,0.00045296634,0.00055925554],"domain_scores_gemma":[0.9986636,0.00013924818,0.00010500299,0.00077167567,0.00007058894,0.00024986672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014454103,0.0002683756,0.00042311946,0.00015847097,0.0001577645,0.00049342646,0.00072392705,0.00012598206,0.000004483626],"category_scores_gemma":[0.000034014916,0.0002425512,0.000036919777,0.000250431,0.00006287355,0.0006872364,0.00021545884,0.00020785612,0.00013068062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001516243,0.002081488,0.09226982,0.0007831216,0.00022136669,0.00029036883,0.020815728,0.64561385,0.05350274,0.1563535,0.00067592104,0.027240489],"study_design_scores_gemma":[0.0023664166,0.00028354427,0.005137429,0.000103511724,0.0000036460247,0.000014324318,0.00030366553,0.988759,0.0002603609,0.000035566147,0.0024143397,0.00031821436],"about_ca_topic_score_codex":0.00086797634,"about_ca_topic_score_gemma":0.00010570543,"teacher_disagreement_score":0.7220846,"about_ca_system_score_codex":0.00020822899,"about_ca_system_score_gemma":0.000045143064,"threshold_uncertainty_score":0.9890951},"labels":[],"label_agreement":null},{"id":"W2068261665","doi":"10.1007/s11768-005-0012-7","title":"Vision-based formation control of mobile robots","year":2005,"lang":"en","type":"article","venue":"Journal of Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mobile robot; Obstacle; Obstacle avoidance; Robot; Computer science; Tilt (camera); Computer vision; Artificial intelligence; Control (management); Variation (astronomy); Motion control; Computational intelligence; Motion (physics); Control theory (sociology); Control engineering; Simulation; Engineering; Geography","score_opus":0.004628164306200594,"score_gpt":0.24654046272106003,"score_spread":0.24191229841485945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068261665","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023591034,0.0011498289,0.9945046,0.0010712991,0.000051503834,0.00054438296,0.000026625929,0.000023216937,0.00026944006],"genre_scores_gemma":[0.9969311,0.000014479127,0.0023721629,0.0003733355,0.00017476655,0.00010348313,0.0000017295864,0.000005523306,0.000023417224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.0002551479,0.00073999446,0.000121564946,0.00025524443,0.00015061363],"domain_scores_gemma":[0.9975178,0.000807587,0.0008606197,0.00032166258,0.0003743923,0.00011790767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016344715,0.00011309365,0.00033897485,0.00014067697,0.00010527659,0.000074711636,0.0004963408,0.000057566744,0.000011117225],"category_scores_gemma":[0.00006516579,0.00009068763,0.00013909275,0.00017430107,0.000060567712,0.00065994216,0.000015677379,0.00012247077,0.000010597035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036256766,0.00059107237,0.00019567164,0.00005176301,0.00016711697,0.0000024907831,0.00025368456,0.084556356,0.02890533,0.601899,0.0002980099,0.28271693],"study_design_scores_gemma":[0.026509875,0.0011200423,0.0028063378,0.0002382746,0.00037405782,0.00018554159,0.00026920653,0.8244153,0.007184939,0.042119425,0.09419418,0.0005827691],"about_ca_topic_score_codex":6.865375e-7,"about_ca_topic_score_gemma":5.903657e-7,"teacher_disagreement_score":0.994572,"about_ca_system_score_codex":0.000035909314,"about_ca_system_score_gemma":0.000076021075,"threshold_uncertainty_score":0.3698134},"labels":[],"label_agreement":null},{"id":"W2069144125","doi":"10.1109/cdc.2012.6426680","title":"Consensus control and communication graph co-design for MIMO discrete-time multi-agent systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"University of Texas at Arlington","keywords":"MIMO; Computer science; Graph; Graph theory; Distributed computing; Controller (irrigation); Theoretical computer science; Directed graph; Multi-agent system; Control theory (sociology); Discrete time and continuous time; Undirected graph; Control (management); Mathematical optimization; Mathematics; Algorithm; Computer network; Artificial intelligence","score_opus":0.0384769859265338,"score_gpt":0.27904701559490835,"score_spread":0.24057002966837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069144125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013479709,0.0026988103,0.9910091,0.00077144586,0.00043908812,0.0027673454,0.0001204008,0.00036340207,0.0004824302],"genre_scores_gemma":[0.9582022,0.000016384553,0.040182058,0.00017477114,0.00007029448,0.0004717406,0.00003835424,0.000023857245,0.00082037685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973635,0.00066946395,0.00059254357,0.00041283728,0.0002968427,0.00066483184],"domain_scores_gemma":[0.99676365,0.0012313685,0.00030427947,0.0011570809,0.00019974176,0.00034385576],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018295296,0.0002972576,0.00048694387,0.00012369527,0.0003079425,0.00037272743,0.000874565,0.000137379,0.000005707791],"category_scores_gemma":[0.00015116748,0.000251446,0.00012156912,0.00017182282,0.00011866508,0.00044607912,0.00011333289,0.00011145914,0.00012908193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008796204,0.0033483182,0.0313142,0.0010500615,0.0033489333,0.00002697135,0.007049956,0.008411753,0.10746728,0.6201546,0.20442258,0.0125257205],"study_design_scores_gemma":[0.0068543684,0.00013876727,0.0029662114,0.00006984811,0.00008302351,0.00005387225,0.000222436,0.97755605,0.0005366518,0.0001307815,0.010813401,0.0005746172],"about_ca_topic_score_codex":0.00016627659,"about_ca_topic_score_gemma":0.0000040732907,"teacher_disagreement_score":0.9691443,"about_ca_system_score_codex":0.00008094355,"about_ca_system_score_gemma":0.00004310984,"threshold_uncertainty_score":0.9999938},"labels":[],"label_agreement":null},{"id":"W2070221063","doi":"10.1016/j.automatica.2011.02.051","title":"Leader localization in multi-agent systems subject to failure: A graph-theoretic approach","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controllability; Graph; Undirected graph; Multi-agent system; Network controllability; Information flow; Computer science; Mathematical optimization; Link (geometry); Graph theory; Subject (documents); Theoretical computer science; Mathematics; Distributed computing; Artificial intelligence; Combinatorics; Computer network; Applied mathematics","score_opus":0.04198307313938692,"score_gpt":0.24223171052033476,"score_spread":0.20024863738094784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070221063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053316876,0.000104511426,0.99031425,0.0001710867,0.00044538314,0.0014135821,0.0000056327876,0.0005910196,0.001622873],"genre_scores_gemma":[0.9589069,0.0000015058846,0.040347077,0.0001849588,0.000023531926,0.00041310795,0.000011430144,0.000027543829,0.000083967374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997116,0.00039955112,0.0007154251,0.0006647449,0.000489057,0.0006152129],"domain_scores_gemma":[0.99834025,0.000077956574,0.00017436472,0.0010629285,0.000109731496,0.00023475658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007969108,0.0002985744,0.0004349611,0.00040945745,0.00008921399,0.0002836098,0.0012331319,0.00014188957,0.000015242669],"category_scores_gemma":[0.00015037942,0.00027073317,0.00009838922,0.0013064146,0.000063269,0.0004948208,0.00018629277,0.00014323174,0.00051153114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058278918,0.0034077798,0.0139428675,0.0016097933,0.0003809559,0.00027587818,0.062929764,0.026157973,0.0015930416,0.8761156,0.0075502913,0.005977768],"study_design_scores_gemma":[0.0009635469,0.00007696509,0.004587281,0.00014189983,0.000017070155,0.000030913034,0.0006992262,0.99207187,0.00019132468,0.00042480603,0.00041241635,0.00038270562],"about_ca_topic_score_codex":0.00030413814,"about_ca_topic_score_gemma":0.000035826448,"teacher_disagreement_score":0.9659139,"about_ca_system_score_codex":0.00015165642,"about_ca_system_score_gemma":0.00006777712,"threshold_uncertainty_score":0.9999745},"labels":[],"label_agreement":null},{"id":"W2070390154","doi":"10.1109/acc.2012.6314875","title":"Characterization of link failures in multi-agent systems under the agreement protocol","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Link (geometry); Node (physics); Computer science; Protocol (science); Class (philosophy); Distributed computing; Multi-agent system; Information flow; Topology (electrical circuits); Computer network; Artificial intelligence; Mathematics; Engineering","score_opus":0.04340026662774352,"score_gpt":0.2877126376705908,"score_spread":0.24431237104284728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070390154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006573859,0.0000240105,0.9377949,0.0011832843,0.0005951985,0.053334367,0.00000827315,0.00008437963,0.00040172876],"genre_scores_gemma":[0.95863664,6.2886e-7,0.00073302275,0.00010119235,0.000101947095,0.0398947,0.00000890572,0.000008061223,0.00051488256],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812216,0.00027101376,0.000589006,0.00023111739,0.00041108407,0.00037562486],"domain_scores_gemma":[0.998797,0.000054752996,0.00029359505,0.00066924177,0.00010226979,0.00008316983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087064353,0.00016017356,0.00022059852,0.000097834265,0.000054785643,0.00012839015,0.0007762113,0.000070758324,0.000019377183],"category_scores_gemma":[0.000018946192,0.00010121743,0.00005872528,0.00033882866,0.000027355478,0.00055774284,0.00018281442,0.00009440532,0.00008979821],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007511515,0.0030907684,0.099708565,0.0009858067,0.0003510266,0.000010101173,0.007187802,0.0055676815,0.43719324,0.42487216,0.0006634601,0.020294279],"study_design_scores_gemma":[0.0055355863,0.00017682997,0.43912074,0.00032719268,0.000021917956,0.000016363672,0.00087028544,0.47047392,0.016537987,0.00003631807,0.066160716,0.00072213216],"about_ca_topic_score_codex":0.00033413182,"about_ca_topic_score_gemma":0.00003917194,"teacher_disagreement_score":0.9520628,"about_ca_system_score_codex":0.00010687133,"about_ca_system_score_gemma":0.000042804546,"threshold_uncertainty_score":0.41275272},"labels":[],"label_agreement":null},{"id":"W2071262178","doi":"10.1109/cdc.2012.6425842","title":"A bounded connectivity preserving aggregation strategy with collision avoidance property for single-integrator agents","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Integrator; Collision avoidance; Computer science; Controller (irrigation); Control theory (sociology); Property (philosophy); Range (aeronautics); Limit (mathematics); Regular polygon; Collision; Set (abstract data type); Multi-agent system; Double integrator; Aggregate (composite); Mathematical optimization; Mathematics; Control (management); Engineering; Artificial intelligence","score_opus":0.051282105887306646,"score_gpt":0.26905794621536155,"score_spread":0.21777584032805491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071262178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11990406,0.00007356931,0.8739805,0.0002417261,0.00035886362,0.0015864412,0.000014543974,0.00033516707,0.003505135],"genre_scores_gemma":[0.98769957,0.0000012399096,0.010112132,0.00008067568,0.00011373231,0.00029705316,0.000016415534,0.00001893569,0.0016602234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800086,0.0002334203,0.00030097112,0.0004669995,0.00041371718,0.0005840555],"domain_scores_gemma":[0.99839693,0.00024287167,0.00023070071,0.0005627076,0.00036207773,0.00020471103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084343576,0.000240902,0.00027276122,0.00006479193,0.00027795363,0.00049775024,0.0006528547,0.00009258597,0.000010733867],"category_scores_gemma":[0.0003074097,0.00014411182,0.00007104178,0.0003600203,0.000034436664,0.0021716948,0.00011576471,0.00011901483,0.00002645248],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021843887,0.010991204,0.11575307,0.0019289182,0.0014477232,0.00006900132,0.011589703,0.010683518,0.25062695,0.3280488,0.031588018,0.23508874],"study_design_scores_gemma":[0.004372685,0.001046205,0.005137696,0.0003330785,0.000043893484,0.00005148083,0.00045778608,0.8951534,0.07490798,0.00064850796,0.016970929,0.00087634556],"about_ca_topic_score_codex":0.00025443395,"about_ca_topic_score_gemma":0.0001819041,"teacher_disagreement_score":0.88446987,"about_ca_system_score_codex":0.00023185332,"about_ca_system_score_gemma":0.000118030024,"threshold_uncertainty_score":0.587671},"labels":[],"label_agreement":null},{"id":"W2073910411","doi":"10.1109/acc.2013.6580136","title":"Distributed control of multi-agent systems with rotating field of view","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Angular velocity; Conic section; Double integrator; Control theory (sociology); Rotation (mathematics); Computer science; Multi-agent system; Integrator; Circular motion; Control (management); Physics; Mathematics; Classical mechanics; Artificial intelligence; Geometry; Bandwidth (computing)","score_opus":0.014437152347070773,"score_gpt":0.23651629272564312,"score_spread":0.22207914037857235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073910411","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012263846,0.00043345205,0.98485065,0.00031750085,0.00024208837,0.0013204693,0.000054337605,0.00012676623,0.00039087655],"genre_scores_gemma":[0.99067163,0.0000036299068,0.008892196,0.00007912148,0.000020748877,0.00017354409,0.000010702671,0.000011131701,0.00013730378],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777114,0.00017560688,0.00084272434,0.0003718857,0.00046909956,0.00036956527],"domain_scores_gemma":[0.9975192,0.00038071422,0.00058277417,0.0008180621,0.0005561033,0.00014317222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035794653,0.00022542942,0.00063128356,0.000083067076,0.00004880103,0.00011024853,0.00092263776,0.00008276949,0.000040119863],"category_scores_gemma":[0.00013514004,0.00016068088,0.00010800756,0.00040924017,0.000045319317,0.0004329133,0.00010464108,0.00010485465,0.00004864686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035044158,0.005484472,0.2926696,0.0077185314,0.005138394,0.0001741511,0.004321883,0.08735523,0.13130881,0.24704204,0.017525705,0.20091076],"study_design_scores_gemma":[0.0034988953,0.00037292266,0.006420048,0.000365128,0.00003708971,0.00001649085,0.00022609044,0.98465216,0.0036194113,0.000019118412,0.00047563686,0.00029701213],"about_ca_topic_score_codex":0.0018323812,"about_ca_topic_score_gemma":0.000021781732,"teacher_disagreement_score":0.9784078,"about_ca_system_score_codex":0.000032667325,"about_ca_system_score_gemma":0.000068004956,"threshold_uncertainty_score":0.6552376},"labels":[],"label_agreement":null},{"id":"W2075434607","doi":"10.1115/detc2010-28793","title":"Singularity Tolerant Robotic Manipulation for Autonomous Field Tracking in an Unknown Environment","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Jacobian matrix and determinant; Control theory (sociology); Singularity; Kinematics; Computer science; Trajectory; Radial basis function; A priori and a posteriori; Field (mathematics); Artificial intelligence; Mathematics; Artificial neural network; Control (management); Mathematical analysis","score_opus":0.02827346450805024,"score_gpt":0.27029209402889437,"score_spread":0.24201862952084413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075434607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09267021,0.000008579874,0.9051093,0.00069711026,0.0005811202,0.0005081293,0.0000011732133,0.00010858996,0.00031580255],"genre_scores_gemma":[0.9620957,2.1088721e-7,0.0374924,0.00015080051,0.00007599945,0.00004548407,0.0000122055435,0.000007504438,0.000119707176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998796,0.000042379354,0.00031763667,0.00039651283,0.00016244489,0.00028501195],"domain_scores_gemma":[0.9991768,0.000105868196,0.000080739315,0.0005309603,0.000022803393,0.000082825725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003818271,0.00012784085,0.00017431866,0.000071086346,0.000078440185,0.0002181289,0.00048543667,0.00010923456,0.000023094459],"category_scores_gemma":[0.000039786093,0.00012348802,0.000056485093,0.00007551701,0.000010891295,0.00056575914,0.000059978087,0.00015369727,0.000017104427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041087093,0.0011033417,0.025694735,0.0000731278,0.000035729994,0.00004454781,0.0014824924,0.08145882,0.06195395,0.39896426,0.0001236657,0.42902425],"study_design_scores_gemma":[0.00066352665,0.000089079236,0.028208524,0.000008408196,0.0000049302453,0.0000059106396,0.000011318696,0.9657551,0.002542211,0.0013811332,0.0011463389,0.00018349182],"about_ca_topic_score_codex":0.00015310435,"about_ca_topic_score_gemma":0.00067011203,"teacher_disagreement_score":0.8842963,"about_ca_system_score_codex":0.000067146175,"about_ca_system_score_gemma":0.000027252227,"threshold_uncertainty_score":0.5035695},"labels":[],"label_agreement":null},{"id":"W2077489572","doi":"10.1109/cdc.2014.7039636","title":"A class of rendezvous controllers for underactuated thrust-propelled rigid bodies","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rendezvous; Underactuation; Control theory (sociology); Thrust; Robustness (evolution); Integrator; Computer science; Inner loop; Rigid body; Loop (graph theory); Controller (irrigation); Engineering; Mathematics; Physics; Aerospace engineering; Control (management); Artificial intelligence; Classical mechanics","score_opus":0.018750555639622773,"score_gpt":0.242783176831705,"score_spread":0.22403262119208223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077489572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016498736,0.0000719221,0.9691231,0.0018908213,0.0005584891,0.000964375,0.000022599652,0.00030334204,0.025415463],"genre_scores_gemma":[0.9884799,0.0000035810249,0.00866823,0.00033960526,0.00006466148,0.00009363708,0.000017797138,0.00001560463,0.0023169736],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804586,0.0001491841,0.0005754693,0.00045971049,0.000337214,0.00043258697],"domain_scores_gemma":[0.99781483,0.00061779015,0.00032023987,0.0007877904,0.00034063775,0.0001187215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066982815,0.00022362349,0.0005635832,0.00011668848,0.00010947591,0.00013396802,0.00094903714,0.00010088466,0.0000449723],"category_scores_gemma":[0.00039220505,0.00017208957,0.00020431804,0.00016804485,0.000064101834,0.00029571904,0.000118746146,0.00008325522,0.00011127442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000724035,0.0007019459,0.00059052056,0.00031235954,0.0011520738,0.000009988646,0.0015874995,0.0046477485,0.027045773,0.8073313,0.09103062,0.06486613],"study_design_scores_gemma":[0.0084317075,0.00038174068,0.00027479682,0.000040897616,0.00004330419,0.000006129416,0.0001272863,0.9391633,0.0042800587,0.0038458135,0.043029133,0.00037578875],"about_ca_topic_score_codex":0.00010285232,"about_ca_topic_score_gemma":0.00006070325,"teacher_disagreement_score":0.98683006,"about_ca_system_score_codex":0.000059248607,"about_ca_system_score_gemma":0.00008280098,"threshold_uncertainty_score":0.7017609},"labels":[],"label_agreement":null},{"id":"W2077713990","doi":"10.3182/20050703-6-cz-1902.01554","title":"ON THE STATE AGREEMENT PROBLEM FOR MULTIPLE NONLINEAR DYNAMICAL SYSTEMS","year":2005,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nonlinear system; Nonlinear dynamical systems; Dynamical systems theory; Control theory (sociology); Synchronization (alternating current); Coincidence; State (computer science); Rendezvous; Mathematics; Controller (irrigation); Graph; Multi-agent system; Complex system; Computer science; Topology (electrical circuits); Physics; Discrete mathematics; Algorithm; Control (management); Spacecraft; Artificial intelligence; Combinatorics","score_opus":0.013989076979579764,"score_gpt":0.22921881492358515,"score_spread":0.21522973794400538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077713990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3217896,0.00048122928,0.64618593,0.01569264,0.0015247926,0.008800558,0.00035011338,0.0013237551,0.0038513637],"genre_scores_gemma":[0.9788158,0.000005050709,0.01697421,0.00032952713,0.00030603804,0.0008674803,0.000012891979,0.000029655192,0.0026593308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974361,0.000023778979,0.0005593478,0.0006705642,0.0006202,0.0006899924],"domain_scores_gemma":[0.99849486,0.00027094307,0.0003018894,0.0003694136,0.00040403602,0.00015882801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008152505,0.00031045938,0.00032769958,0.00009634046,0.00029862297,0.0007875364,0.0014376125,0.00008894823,0.0000056775966],"category_scores_gemma":[0.0002517947,0.00021917789,0.00014909393,0.00028412012,0.00005764075,0.00056618283,0.00020195416,0.00019602456,0.00025392626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004825873,0.002527642,0.009869733,0.0014173408,0.0011172999,0.000016358765,0.01006677,0.018969748,0.018913105,0.61111075,0.18261334,0.14289533],"study_design_scores_gemma":[0.0010575232,0.00018826136,0.00021016835,0.00010822738,0.000012334798,0.000008179514,0.00013532166,0.9473955,0.0006083784,0.00068254734,0.049303878,0.00028966836],"about_ca_topic_score_codex":0.000076742275,"about_ca_topic_score_gemma":0.000020618047,"teacher_disagreement_score":0.9284258,"about_ca_system_score_codex":0.00025094964,"about_ca_system_score_gemma":0.0000612121,"threshold_uncertainty_score":0.8937815},"labels":[],"label_agreement":null},{"id":"W2078965668","doi":"10.3182/20140824-6-za-1003.02441","title":"Motion Coordination of Thrust-Propelled Underactuated Vehicles in the Presence of Communication Delays","year":2014,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Underactuation; Control theory (sociology); Spanning tree; Thrust; Graph; Computer science; Rendezvous; Topology (electrical circuits); Control (management); Engineering; Mathematics; Theoretical computer science; Artificial intelligence; Aerospace engineering; Combinatorics","score_opus":0.015829065977461757,"score_gpt":0.23580828574344345,"score_spread":0.2199792197659817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078965668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8399506,0.00016609098,0.15405427,0.00205074,0.00007907995,0.00076169707,0.000004776189,0.0000908391,0.002841905],"genre_scores_gemma":[0.9977916,0.000011846871,0.0020552007,0.00003253717,0.000013818677,0.00003969109,0.000010208187,0.0000066036687,0.000038483253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985812,0.0001179354,0.00047972135,0.00023173634,0.00041268964,0.00017672549],"domain_scores_gemma":[0.99836,0.00024488376,0.0004981585,0.00037389566,0.000497466,0.000025615043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133992,0.000117695505,0.00022760873,0.00013208245,0.000078157966,0.00010150872,0.0013651014,0.000075551805,0.0000038277462],"category_scores_gemma":[0.0005938101,0.00009227007,0.00004895824,0.0006098038,0.00008857435,0.0007900053,0.00014492386,0.00013370432,0.000011669911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013398392,0.0013143334,0.11426947,0.0006900698,0.00014326989,0.0000011774,0.03142798,0.0034455115,0.18893437,0.45996785,0.0058003813,0.19387159],"study_design_scores_gemma":[0.0009619488,0.00011298127,0.05455577,0.00017157593,0.000014872967,0.0000043264313,0.0009550425,0.9272636,0.010386731,0.0051189866,0.0003045509,0.0001496201],"about_ca_topic_score_codex":0.00026840056,"about_ca_topic_score_gemma":0.0000145561135,"teacher_disagreement_score":0.9238181,"about_ca_system_score_codex":0.0000416992,"about_ca_system_score_gemma":0.000025149246,"threshold_uncertainty_score":0.37626642},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011202542554546167,"score_gpt":0.22802518852079107,"score_spread":0.2168226459662449,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079012599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011331244,0.0000226427,0.9846895,0.00041386238,0.00094305753,0.00030539927,0.0000070460837,0.00014507047,0.002142175],"genre_scores_gemma":[0.93671286,0.0000010792136,0.06275903,0.00022377326,0.00006966328,0.00002082586,0.000013616426,0.0000037078232,0.00019547147],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987646,0.00004135455,0.00036621414,0.00011242636,0.0003972551,0.00031817687],"domain_scores_gemma":[0.99902767,0.000047148416,0.00013159424,0.00043086967,0.00018923756,0.0001734726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034718664,0.0001158578,0.00017610904,0.00012686517,0.00006879619,0.00012820748,0.0005993537,0.00006069931,0.000019724666],"category_scores_gemma":[0.00007732268,0.00009682056,0.000049832808,0.00037640432,0.000023298713,0.002499099,0.0002547577,0.000048987647,0.00011475956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012790516,0.00091674883,0.012013746,0.0003062964,0.0001939227,0.000002966348,0.012531839,0.041628838,0.004461532,0.44175366,0.019432236,0.4666303],"study_design_scores_gemma":[0.0014015675,0.000108523476,0.016243452,0.000051842086,0.000012647881,0.000011298369,0.0004708938,0.9500693,0.003596364,0.00009000811,0.027568191,0.00037589052],"about_ca_topic_score_codex":0.0001339661,"about_ca_topic_score_gemma":0.000008962844,"teacher_disagreement_score":0.9253816,"about_ca_system_score_codex":0.000064103726,"about_ca_system_score_gemma":0.00004797275,"threshold_uncertainty_score":0.39482278},"labels":[],"label_agreement":null},{"id":"W2079340207","doi":"10.3182/20080706-5-kr-1001.00302","title":"Decentralized attitude alignment control of spacecraft within a formation without angular velocity measurements","year":2008,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Quaternion; Spacecraft; Angular velocity; Control theory (sociology); Attitude control; Tracking (education); Unit vector; Tracking error; Control (management); Computer science; Physics; Engineering; Mathematics; Control engineering; Aerospace engineering; Classical mechanics; Geometry; Artificial intelligence","score_opus":0.0351745369626589,"score_gpt":0.24601591414687288,"score_spread":0.21084137718421397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079340207","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50016916,0.00040159922,0.49639705,0.00051189016,0.00039008522,0.0012692062,0.000022373975,0.0003525395,0.0004860724],"genre_scores_gemma":[0.9842985,0.000017109633,0.01524622,0.00013407035,0.00004608205,0.00010595187,0.000006833439,0.000018775858,0.00012642333],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969042,0.000047282945,0.00076813734,0.0004977098,0.0012385404,0.00054412114],"domain_scores_gemma":[0.9980685,0.000021947055,0.0007131803,0.0003198927,0.00066466903,0.00021182065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007993287,0.00031415274,0.0005640617,0.00014656177,0.00022149445,0.0001399585,0.00091551343,0.00012181153,0.000009069499],"category_scores_gemma":[0.00021214719,0.00029738867,0.00015524466,0.00039842635,0.000104754,0.0014293827,0.000124596,0.00013055309,0.000041872718],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037754874,0.0010591812,0.7158867,0.0006627008,0.0010390525,0.000031846866,0.019353779,0.00055162713,0.23811187,0.0099876635,0.0076214615,0.005316566],"study_design_scores_gemma":[0.02240188,0.00065547315,0.13171376,0.0007183732,0.00026536643,0.0003041818,0.0007436333,0.62963843,0.20448495,0.0008842878,0.0063650655,0.0018245968],"about_ca_topic_score_codex":0.00011507721,"about_ca_topic_score_gemma":0.000011168611,"teacher_disagreement_score":0.6290868,"about_ca_system_score_codex":0.00026672694,"about_ca_system_score_gemma":0.00011827965,"threshold_uncertainty_score":0.99994785},"labels":[],"label_agreement":null},{"id":"W2080183025","doi":"10.1109/tac.2014.2358071","title":"&lt;inline-formula&gt; &lt;tex-math notation=\"TeX\"&gt;$H_{\\infty}$&lt;/tex-math&gt;&lt;/inline-formula&gt; 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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01154278150944019,"score_gpt":0.23173486268002014,"score_spread":0.22019208117057995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080183025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1664199,0.00056227355,0.82454264,0.00097488373,0.0022926433,0.0035254264,0.00023539925,0.0013297917,0.00011704865],"genre_scores_gemma":[0.9864821,0.000053672797,0.01149563,0.00036963963,0.00020740011,0.0008123213,0.000055433415,0.00013715944,0.0003866607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99106205,0.00110157,0.0030111675,0.0016334406,0.0015631183,0.0016286838],"domain_scores_gemma":[0.9923383,0.0021432643,0.0017540614,0.0021736517,0.00088508334,0.0007056132],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002178723,0.001344982,0.0023685263,0.00078492676,0.00088555965,0.0005601866,0.0014026421,0.0005927661,0.000022014245],"category_scores_gemma":[0.00018016434,0.0011517528,0.0005233372,0.0010964945,0.0003079069,0.0006487924,0.00003884657,0.0006902157,0.0000943788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081742863,0.0042007538,0.0003407557,0.0016113425,0.0045413068,0.00020948284,0.0045779077,0.7857079,0.048620857,0.033655073,0.0004032859,0.11531394],"study_design_scores_gemma":[0.013418264,0.0008843759,0.0020409592,0.0007330252,0.0006390167,0.00022081246,0.0001078335,0.9787085,0.00040439275,0.000046616784,0.0017006043,0.0010956067],"about_ca_topic_score_codex":0.00034057137,"about_ca_topic_score_gemma":0.00094623707,"teacher_disagreement_score":0.8200622,"about_ca_system_score_codex":0.00052976405,"about_ca_system_score_gemma":0.00036608052,"threshold_uncertainty_score":0.99993014},"labels":[],"label_agreement":null},{"id":"W2080294529","doi":"10.1016/j.jfranklin.2011.03.008","title":"Cascade design for formation control of nonholonomic systems in chained form","year":2011,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Cascade; Control theory (sociology); Nonholonomic system; Constructive; Stability (learning theory); Synchronization (alternating current); Controller (irrigation); Computer science; Interconnection; Mobile robot; Control (management); Robot; Engineering","score_opus":0.04787372521155335,"score_gpt":0.23869230436896888,"score_spread":0.1908185791574155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080294529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026233695,0.00038731616,0.9685349,0.00023468745,0.003346111,0.0011391148,0.000016246082,0.000012483737,0.000095442796],"genre_scores_gemma":[0.99267775,0.000009693084,0.007035174,0.000058179714,0.0001369488,0.00005165623,5.3477004e-7,0.000007390895,0.000022690248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813634,0.0001448411,0.0010938428,0.00011694659,0.00026902347,0.00023899507],"domain_scores_gemma":[0.997837,0.00013017011,0.0013146023,0.00039041322,0.00026261772,0.00006519216],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001873553,0.000137641,0.00043882782,0.00020872621,0.000070551825,0.000049706992,0.0014031589,0.00009567179,8.4732966e-7],"category_scores_gemma":[0.00020448913,0.00009313974,0.00022965042,0.00022252051,0.000048303307,0.0012424741,0.000054522498,0.00016823722,0.0000036427823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00541542,0.0023252002,0.008672525,0.0018856,0.0021736268,0.00025274142,0.03053423,0.58938295,0.070528306,0.2438083,0.007429152,0.037591968],"study_design_scores_gemma":[0.010779787,0.0004702312,0.0050710156,0.00059704465,0.000098434575,0.00034383274,0.00012058679,0.9673564,0.008852373,0.0022095742,0.0038339458,0.00026679767],"about_ca_topic_score_codex":0.000104480496,"about_ca_topic_score_gemma":0.00002164517,"teacher_disagreement_score":0.966444,"about_ca_system_score_codex":0.00017114214,"about_ca_system_score_gemma":0.00017120941,"threshold_uncertainty_score":0.37981284},"labels":[],"label_agreement":null},{"id":"W2080971726","doi":"10.1109/robot.2010.5509256","title":"Robust adaptive formation control of fully actuated marine vessels using local potential functions","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Backstepping; Control theory (sociology); Trajectory; Lyapunov function; Controller (irrigation); Collision; Computer science; Tracking (education); Control engineering; Adaptive control; Control (management); Engineering; Nonlinear system; Artificial intelligence; Physics","score_opus":0.02132478775532489,"score_gpt":0.2132398174380398,"score_spread":0.1919150296827149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080971726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029880306,0.0000045585434,0.9674643,0.00019000396,0.0009429847,0.0003733798,0.000029510493,0.00016504967,0.00094987534],"genre_scores_gemma":[0.98548174,2.872187e-7,0.014200063,0.000051364837,0.00008434574,0.000013932902,0.000024404608,0.000008398288,0.00013544821],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998575,0.0000787274,0.00045041248,0.00026863307,0.00033809923,0.00028917677],"domain_scores_gemma":[0.9986596,0.000062107596,0.00025886166,0.00047645086,0.000427353,0.000115597024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030577584,0.00016040502,0.0002514236,0.0001409594,0.00012436236,0.000109534085,0.00048620548,0.00011873073,0.00011528668],"category_scores_gemma":[0.000044515647,0.00014208212,0.00010184034,0.00034215828,0.000067750436,0.0010869574,0.0001375116,0.00020298568,0.00005603263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034853164,0.0006988189,0.00072644156,0.00006528094,0.000469048,0.000041912208,0.00043752792,0.26460037,0.54238933,0.065050155,0.0012539681,0.1239186],"study_design_scores_gemma":[0.0017041524,0.00007979339,0.0015839533,0.000008640446,0.000036101017,0.00004621371,0.00008653328,0.9919682,0.0040274714,0.00013321755,0.00017578874,0.00014990747],"about_ca_topic_score_codex":0.00036925433,"about_ca_topic_score_gemma":0.00013762385,"teacher_disagreement_score":0.95560145,"about_ca_system_score_codex":0.000056512417,"about_ca_system_score_gemma":0.00010094565,"threshold_uncertainty_score":0.57939404},"labels":[],"label_agreement":null},{"id":"W2081137664","doi":"10.1016/j.jmaa.2014.01.036","title":"Flocking and asymptotic velocity of the Cucker–Smale model with processing delay","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National University of Defense Technology","keywords":"Flocking (texture); Mathematics; Pairwise comparison; Lyapunov function; Control theory (sociology); Applied mathematics; Mathematical analysis; Computer science; Statistics; Artificial intelligence; Physics; Nonlinear system","score_opus":0.00917696269747068,"score_gpt":0.22375401036852066,"score_spread":0.21457704767105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081137664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061382778,0.00007143632,0.93771315,0.0005644786,0.000002414026,0.00008821915,0.0000013895519,0.0000053170425,0.00017081412],"genre_scores_gemma":[0.94697076,0.0000039373235,0.052946243,0.000027460115,0.000018283406,0.00000891926,1.9771257e-7,0.0000028067075,0.000021363678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990724,0.00004112442,0.00040507957,0.0001187043,0.0002713608,0.00009137228],"domain_scores_gemma":[0.99889976,0.00011964432,0.0004645395,0.00024316889,0.00019763311,0.0000752304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051954115,0.00007613041,0.000304241,0.00007884836,0.00012459073,0.00009439629,0.00032688826,0.000026606282,0.0000012049812],"category_scores_gemma":[0.000041281975,0.000040956624,0.00009141129,0.0005330579,0.00007188859,0.00014011691,0.000069020025,0.00008807823,4.820976e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025379513,0.0011941706,0.02185282,0.0009175592,0.002530065,0.0000025939357,0.003063096,0.086598635,0.0032017583,0.70182645,0.00007509145,0.17871235],"study_design_scores_gemma":[0.00017553577,0.000016084547,0.0025410163,0.000056993103,0.00044067684,0.00002875346,0.000035298337,0.98279417,0.00011976553,0.013696746,0.000042036634,0.000052912546],"about_ca_topic_score_codex":0.0000015574128,"about_ca_topic_score_gemma":0.0000020900154,"teacher_disagreement_score":0.89619553,"about_ca_system_score_codex":0.000010846576,"about_ca_system_score_gemma":0.00003213324,"threshold_uncertainty_score":0.16701627},"labels":[],"label_agreement":null},{"id":"W2081182551","doi":"10.1109/mmar.2012.6347812","title":"Control of decentralized geometric formations of mobile robots","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Carleton University; University of Ottawa","funders":"","keywords":"Platoon; Mobile robot; Robot; Control engineering; Control (management); Decentralised system; Computer science; Robot control; Control theory (sociology); Robot kinematics; Engineering; Artificial intelligence","score_opus":0.014850586621767343,"score_gpt":0.24883896822057724,"score_spread":0.2339883815988099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081182551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016620945,0.000597729,0.97988105,0.000053029336,0.00027262207,0.00044736403,0.000026775522,0.00007043846,0.0020300678],"genre_scores_gemma":[0.99186015,0.000007490027,0.007954801,0.000035917397,0.000014237557,0.000047493868,0.000005320178,0.000004108273,0.00007049447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985776,0.000072293114,0.0005906929,0.00010884705,0.0003136776,0.00033689628],"domain_scores_gemma":[0.99869263,0.00019656765,0.00032143082,0.00048221584,0.00018020155,0.00012697141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048513105,0.00009730508,0.00030676843,0.0002471899,0.000029609117,0.00002158441,0.0005847737,0.000048528094,0.00007106902],"category_scores_gemma":[0.000110095396,0.00008081929,0.00011340654,0.0009132656,0.000025647882,0.0007649265,0.00006694757,0.000040588435,0.000051886782],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076769305,0.0034213508,0.14150614,0.000427734,0.00083846564,0.0000024479139,0.0024952667,0.01650988,0.06117965,0.6986875,0.0065406784,0.06831414],"study_design_scores_gemma":[0.027695484,0.0007737645,0.17105895,0.00016835745,0.00029104028,0.00006092456,0.0006083906,0.559209,0.1888297,0.00076386763,0.04901798,0.0015225672],"about_ca_topic_score_codex":0.00008337022,"about_ca_topic_score_gemma":0.0000018870672,"teacher_disagreement_score":0.9752392,"about_ca_system_score_codex":0.000031941905,"about_ca_system_score_gemma":0.000034644774,"threshold_uncertainty_score":0.32957152},"labels":[],"label_agreement":null},{"id":"W2083634442","doi":"10.1109/ccece.2012.6334933","title":"Coordinated path following for two unicycles","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Path (computing); Focus (optics); Computer science; Control theory (sociology); Control (management); Physics; Computer network; Artificial intelligence","score_opus":0.02220128551520388,"score_gpt":0.28298308221674096,"score_spread":0.26078179670153706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083634442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020340832,0.00022811393,0.97350514,0.00044450597,0.0013127773,0.00040991267,0.000008045833,0.00041317663,0.0033374692],"genre_scores_gemma":[0.98175114,3.2833077e-7,0.01706545,0.0002016663,0.00012031645,0.00006956892,0.000010716206,0.000010581321,0.0007702024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988132,0.00005410166,0.00021960554,0.0002288763,0.00016581874,0.000518371],"domain_scores_gemma":[0.999092,0.00015537703,0.000067750254,0.0004699214,0.000055842796,0.000159137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054025534,0.00013049782,0.00018324133,0.000053767693,0.00011232673,0.00013363379,0.00067596114,0.000042682812,0.000007665588],"category_scores_gemma":[0.00007989378,0.000110098306,0.00014891945,0.00022512805,0.0000089907435,0.0007758712,0.00012625886,0.00004659862,0.00010703963],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023384782,0.00037983514,0.02944349,0.000041051026,0.0002892443,0.000012413013,0.0007922175,0.00012492234,0.017058618,0.8803993,0.018067613,0.053367928],"study_design_scores_gemma":[0.013045639,0.00022255738,0.018331068,0.00013082183,0.00012536744,0.000038772672,0.0004631687,0.7726655,0.019182406,0.0038003153,0.17014386,0.0018505084],"about_ca_topic_score_codex":0.000057885405,"about_ca_topic_score_gemma":0.0000044322205,"teacher_disagreement_score":0.96141034,"about_ca_system_score_codex":0.000052433526,"about_ca_system_score_gemma":0.000026332504,"threshold_uncertainty_score":0.44896787},"labels":[],"label_agreement":null},{"id":"W2083794834","doi":"10.1109/wi-iat.2010.46","title":"Isogonic Formation with Connectivity Preservation for a Team of Holonomic Robots in a Cluttered Environment","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Holonomic; Robot; Computer science; Perspective (graphical); Group (periodic table); Graph; Distributed computing; Computer network; Artificial intelligence; Human–computer interaction; Theoretical computer science","score_opus":0.012632313209853259,"score_gpt":0.21329455854791918,"score_spread":0.20066224533806593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083794834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44911426,0.0000026930788,0.5497531,0.0002866202,0.000051571595,0.0006106295,0.0000074652353,0.000024570576,0.0001490265],"genre_scores_gemma":[0.98145133,7.4673204e-7,0.01824128,0.000030912266,0.000013556865,0.00020338569,0.000012023689,0.0000048355546,0.000041945354],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917823,0.000037786813,0.00026627217,0.00022056344,0.00012454994,0.00017259126],"domain_scores_gemma":[0.999235,0.000099603945,0.00018747861,0.00041412166,0.00003068156,0.000033146254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038838346,0.000090384674,0.00016037458,0.000078883575,0.000027838403,0.000039850045,0.0003378874,0.00005473428,0.000004688371],"category_scores_gemma":[0.000036194313,0.0000755202,0.00003330546,0.0000914743,0.000019466144,0.0012098437,0.000059634596,0.00007582573,0.000007782039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00073826435,0.0021147034,0.07495273,0.0004636499,0.00017044428,0.0000042132383,0.005147394,0.06154637,0.6312185,0.17175305,0.0013514801,0.050539233],"study_design_scores_gemma":[0.0028715802,0.00022718312,0.071831256,0.000018623443,0.0000057336233,0.000005196896,0.00003448043,0.9088507,0.014733639,0.000607578,0.00066390407,0.00015006546],"about_ca_topic_score_codex":0.00011113776,"about_ca_topic_score_gemma":0.00066913886,"teacher_disagreement_score":0.8473044,"about_ca_system_score_codex":0.00006842181,"about_ca_system_score_gemma":0.00003436957,"threshold_uncertainty_score":0.30796245},"labels":[],"label_agreement":null},{"id":"W2087867734","doi":"10.1109/allerton.2012.6483366","title":"Least-squares based adaptive source localization by mobile agents","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Forgetting; Recursive least squares filter; Convergence (economics); Least-squares function approximation; Algorithm; Computer science; Stability (learning theory); Noise (video); Mathematical optimization; Least mean squares filter; Adaptive filter; Mathematics; Artificial intelligence; Statistics; Machine learning","score_opus":0.017064876564738107,"score_gpt":0.23892578805541906,"score_spread":0.22186091149068096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087867734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015629792,0.00019958071,0.9944303,0.00017146223,0.0003924019,0.0004082783,0.000021310187,0.00035990242,0.0024537675],"genre_scores_gemma":[0.99488425,8.8283116e-7,0.0021362163,0.0010039188,0.00007097601,0.00010291905,0.00004599893,0.000013810728,0.0017410342],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841106,0.00015599554,0.00024644705,0.00030483244,0.00042198817,0.00045970178],"domain_scores_gemma":[0.9989921,0.00007709883,0.00011223763,0.0005015782,0.00009732897,0.00021968564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028817833,0.00017206909,0.00016523634,0.00006538573,0.00011572468,0.00013307872,0.0006063531,0.000076236356,0.00014366675],"category_scores_gemma":[0.000031025345,0.00015368267,0.000069279755,0.00030910893,0.000028751447,0.000750357,0.00010416163,0.00006710737,0.0003377295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086787506,0.0026450728,0.036219366,0.000100255726,0.0002673616,0.000014477008,0.0049772677,0.08280535,0.0049447212,0.03381414,0.6967436,0.13738157],"study_design_scores_gemma":[0.0006507419,0.000069387475,0.00038617666,0.0000120934355,0.000008056569,0.0000021684157,0.00018919919,0.86889154,0.002995637,0.0000102779495,0.12655863,0.0002260817],"about_ca_topic_score_codex":0.00016980858,"about_ca_topic_score_gemma":0.000005386486,"teacher_disagreement_score":0.99332124,"about_ca_system_score_codex":0.00009291928,"about_ca_system_score_gemma":0.00003397967,"threshold_uncertainty_score":0.62669975},"labels":[],"label_agreement":null},{"id":"W2089900838","doi":"10.1109/cdc.2012.6426273","title":"Consensus algorithms design for constrained heterogeneous multi-agent systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Computer science; Multi-agent system; Simple (philosophy); Ideal (ethics); Consensus algorithm; State (computer science); Algorithm; Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence","score_opus":0.07978168909056259,"score_gpt":0.28704521095727853,"score_spread":0.20726352186671593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089900838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005702762,0.0011046075,0.99111915,0.00023425455,0.0035268518,0.002439632,0.00009259727,0.00065318414,0.00025945442],"genre_scores_gemma":[0.81140083,0.0000029521377,0.18677613,0.00017432864,0.00025524132,0.0004514923,0.000015509097,0.00002884738,0.00089464977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99693906,0.00031088226,0.0006853851,0.0005645824,0.0003910936,0.0011089774],"domain_scores_gemma":[0.99749225,0.000613753,0.00025344262,0.00087176764,0.00026720733,0.00050157565],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012412727,0.00036967063,0.00048661855,0.00012269217,0.0002064746,0.0003261898,0.0009264481,0.00016353065,0.000012401263],"category_scores_gemma":[0.0001570379,0.0003214897,0.00020673088,0.00022213349,0.00009015351,0.00026932385,0.00013761267,0.00009810029,0.00025428552],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055590505,0.008877999,0.0056798183,0.0016652426,0.005866702,0.00073378504,0.0072768684,0.21674216,0.07392114,0.44314188,0.10927159,0.12626691],"study_design_scores_gemma":[0.0028299054,0.00013394763,0.00008336121,0.000028392673,0.000035158027,0.00035048596,0.000111072986,0.9808125,0.0033211103,0.000028010629,0.011751329,0.0005147134],"about_ca_topic_score_codex":0.00008598784,"about_ca_topic_score_gemma":0.0000026811776,"teacher_disagreement_score":0.8108306,"about_ca_system_score_codex":0.00016295322,"about_ca_system_score_gemma":0.000114904244,"threshold_uncertainty_score":0.9999237},"labels":[],"label_agreement":null},{"id":"W2089967703","doi":"10.2514/1.56352","title":"Quaternion-Based Distributed Output Feedback Attitude Coordination Control for Spacecraft Formation Flying","year":2013,"lang":"en","type":"article","venue":"Journal of Guidance Control and Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Quaternion; Control theory (sociology); Attitude control; Backstepping; Spacecraft; Angular velocity; Bounded function; Lyapunov function; Controller (irrigation); Computer science; Synchronization (alternating current); Control (management); Control engineering; Nonlinear system; Mathematics; Engineering; Adaptive control; Aerospace engineering; Physics; Artificial intelligence","score_opus":0.010278455891088365,"score_gpt":0.2304125906612533,"score_spread":0.22013413477016494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089967703","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018362988,0.00045039813,0.96998286,0.0093661845,0.0006512144,0.0009489373,0.00016441057,0.000055061617,0.000017914814],"genre_scores_gemma":[0.9919708,0.000009015409,0.007237471,0.00040457238,0.00017947603,0.00008299005,0.000038209688,0.00001568187,0.00006182775],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976878,0.00015850895,0.0010384704,0.00024939756,0.0004488151,0.000416971],"domain_scores_gemma":[0.99629015,0.00049587095,0.0012953064,0.00030066195,0.0014019327,0.00021608412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010485972,0.0002621154,0.00058647565,0.00018545076,0.0002353241,0.00055628654,0.00059075933,0.00013036036,0.0000021995925],"category_scores_gemma":[0.00042470335,0.00021993493,0.0002287252,0.00018450848,0.000047538713,0.0017250397,0.000030836196,0.00018204673,0.000010215673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027483632,0.0018161042,0.16107152,0.0017724499,0.002190841,0.00011899746,0.0015274547,0.20245984,0.030495208,0.07119094,0.02541415,0.49919415],"study_design_scores_gemma":[0.010820947,0.00027349114,0.022644864,0.0001417589,0.0000632302,0.000037126043,0.00006507585,0.9639929,0.000024278246,0.00082744245,0.0008807568,0.00022813644],"about_ca_topic_score_codex":0.000045033084,"about_ca_topic_score_gemma":0.000034955698,"teacher_disagreement_score":0.9736078,"about_ca_system_score_codex":0.0003294944,"about_ca_system_score_gemma":0.000118392185,"threshold_uncertainty_score":0.8968686},"labels":[],"label_agreement":null},{"id":"W2091851907","doi":"10.1049/iet-cta.2014.0309","title":"Development of a distributed consensus algorithm for multiple Euler–Lagrange systems","year":2014,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Consensus algorithm; Consensus; Control theory (sociology); Computer science; Euler's formula; Algorithm; Mathematics; Multi-agent system; Artificial intelligence; Control (management); Mathematical analysis","score_opus":0.011889273691276457,"score_gpt":0.2331069516025825,"score_spread":0.22121767791130603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091851907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010458485,0.00034212452,0.9954575,0.00013736586,0.00015100198,0.0018422023,0.00073895423,0.00015300774,0.00013199811],"genre_scores_gemma":[0.9652455,0.000002155983,0.03185191,0.00005682598,0.000115751034,0.0025615087,0.00010311274,0.000012585229,0.00005064879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832165,0.00023432403,0.0005583216,0.00041619036,0.00016953172,0.00029999926],"domain_scores_gemma":[0.9966287,0.0021100524,0.00030825782,0.0005614038,0.00024967495,0.00014189903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015023812,0.00019192601,0.00039102542,0.00006474351,0.00028633638,0.00009889166,0.0005161155,0.00008914937,0.0000011129844],"category_scores_gemma":[0.00016636339,0.00017429894,0.0000828701,0.0001933545,0.00009560252,0.00007957523,0.000056587585,0.000069267626,0.000012060816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049981976,0.0001699639,0.000071137496,0.00008756922,0.00017051371,3.5867615e-7,0.00024073273,0.00018331117,0.0054107383,0.7552791,0.00015951836,0.23817702],"study_design_scores_gemma":[0.0068308795,0.00007120709,0.00078711414,0.000062831976,0.000088685956,0.000016031765,0.00026769782,0.74969345,0.0010114815,0.00783988,0.23287423,0.0004565235],"about_ca_topic_score_codex":0.000008411038,"about_ca_topic_score_gemma":0.0000037169318,"teacher_disagreement_score":0.96419966,"about_ca_system_score_codex":0.000031128937,"about_ca_system_score_gemma":0.00006178351,"threshold_uncertainty_score":0.7107704},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014419646243627536,"score_gpt":0.22758986333765438,"score_spread":0.21317021709402684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092590055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016858827,0.00037032942,0.9782619,0.0005714683,0.0019744986,0.0015256169,0.00002660936,0.00040374306,0.000007027154],"genre_scores_gemma":[0.9981669,0.0000042892743,0.0005659485,0.00012855357,0.00049257476,0.0004404086,0.00009505469,0.000033448214,0.00007280916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736494,0.00058973586,0.0005226481,0.00041884193,0.00036209667,0.0007417629],"domain_scores_gemma":[0.998196,0.0006232864,0.0004286254,0.00030771282,0.00022039685,0.0002239521],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008850921,0.00035366116,0.00042023364,0.0001302834,0.0011385678,0.0005879427,0.00023819355,0.00018268907,0.0000014317321],"category_scores_gemma":[0.000018009647,0.0003001976,0.00012325366,0.0004654184,0.00004084179,0.0014613412,0.0000026106509,0.00054218544,0.0000029803523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015945172,0.000056243567,0.00091691205,0.00006526566,0.000057344052,0.0000015981635,0.0001303067,0.9893509,0.00014769968,0.00022928897,0.00015436037,0.0087306],"study_design_scores_gemma":[0.0026197797,0.00038799853,0.0011667478,0.00013753069,0.00007868441,0.000046107787,0.000079869904,0.9941556,0.000027843114,0.000001209969,0.0009594654,0.00033915765],"about_ca_topic_score_codex":0.00005977629,"about_ca_topic_score_gemma":0.000029625713,"teacher_disagreement_score":0.9813081,"about_ca_system_score_codex":0.00014008682,"about_ca_system_score_gemma":0.00002187433,"threshold_uncertainty_score":0.999945},"labels":[],"label_agreement":null},{"id":"W2092933660","doi":"10.1117/12.720016","title":"Fault tolerant cooperative control for UAV rendezvous problem subject to actuator faults","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Rendezvous; Actuator; Fault (geology); Computer science; Control theory (sociology); Scheme (mathematics); Nonlinear system; Fault detection and isolation; Control (management); Motion planning; Fault tolerance; Engineering; Control engineering; Real-time computing; Distributed computing; Robot; Artificial intelligence; Aerospace engineering","score_opus":0.011067845634834334,"score_gpt":0.23880380654922784,"score_spread":0.2277359609143935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092933660","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9432598,0.000059807036,0.04786141,0.0041531324,0.00051476737,0.0027354287,0.00020798069,0.00022269617,0.000985034],"genre_scores_gemma":[0.77389866,0.0000074291747,0.22432831,0.00035506763,0.00048760933,0.00058536837,0.0000117934,0.00006270307,0.0002630356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9961534,4.1023227e-8,0.0011817184,0.00077025715,0.0010431854,0.0008514073],"domain_scores_gemma":[0.9946217,0.0004790427,0.0005596621,0.00013439012,0.0038837662,0.00032144983],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018224269,0.0004955382,0.0007178918,0.00017562418,0.00016472665,0.0002825836,0.0023388786,0.00025252355,0.0000033675763],"category_scores_gemma":[0.0011296597,0.0004089212,0.0007817937,0.00060387555,0.00012626362,0.00088908884,0.00023588922,0.00031475883,0.0000045735565],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031817285,0.00019073527,0.00010249601,0.0003126218,0.0006224843,3.5327128e-7,0.00062796084,0.0005427248,0.46937573,0.52255535,0.0042570555,0.0010942983],"study_design_scores_gemma":[0.014641601,0.0032194753,0.0018860805,0.0012546161,0.00045345532,0.00009020288,0.003062806,0.45920315,0.47887245,0.0027265355,0.03236821,0.0022214279],"about_ca_topic_score_codex":0.000019454601,"about_ca_topic_score_gemma":0.0000010939422,"teacher_disagreement_score":0.51982886,"about_ca_system_score_codex":0.00037053382,"about_ca_system_score_gemma":0.00008579763,"threshold_uncertainty_score":0.99983627},"labels":[],"label_agreement":null},{"id":"W2093240210","doi":"10.1109/wac.2014.6936067","title":"An improved PSO-based approach with dynamic parameter tuning for cooperative target searching of multi-robots","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Particle swarm optimization; Computer science; Mobile robot; Field (mathematics); Fitness function; Function (biology); Swarm behaviour; Mathematical optimization; Swarm robotics; Potential field; Artificial intelligence; Machine learning; Mathematics; Genetic algorithm","score_opus":0.02056997719486533,"score_gpt":0.27268232206818116,"score_spread":0.25211234487331585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2093240210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008424478,0.000010624527,0.989906,0.00009609176,0.00007940712,0.0011102094,0.000025915975,0.000186224,0.00016104545],"genre_scores_gemma":[0.5556958,5.2887618e-8,0.44399077,0.00008193605,0.000010194126,0.000106028565,0.000041010317,0.000014237557,0.000060025443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792475,0.0003034768,0.0003915601,0.0006430539,0.00027095678,0.00046622404],"domain_scores_gemma":[0.9981182,0.0003663861,0.0002104988,0.000814549,0.00032167355,0.00016866089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092964387,0.00024568275,0.00040563752,0.00012693962,0.00014679415,0.00022122917,0.00095050875,0.000075469,0.0000025230838],"category_scores_gemma":[0.00015671624,0.00018032732,0.000083134175,0.00026931847,0.00007644731,0.00053264294,0.000067166424,0.00014408467,0.000002782617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003815433,0.0017831151,0.0028876683,0.00045558295,0.00037624364,0.000004378419,0.0026450253,0.7028196,0.24075732,0.017009288,0.000066995526,0.030813247],"study_design_scores_gemma":[0.0030179995,0.00059983577,0.0003725467,0.000030311987,0.000010764542,0.000002248125,0.00009861115,0.99215424,0.0033841503,0.000031638025,0.000038928814,0.00025871],"about_ca_topic_score_codex":0.0001271937,"about_ca_topic_score_gemma":0.000046027017,"teacher_disagreement_score":0.54727125,"about_ca_system_score_codex":0.000055597797,"about_ca_system_score_gemma":0.00012313733,"threshold_uncertainty_score":0.73535347},"labels":[],"label_agreement":null},{"id":"W2095579099","doi":"10.1109/acc.2012.6315336","title":"Average consensus in multi-agent systems with time-varying delays and packet losses","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multi-agent system; Computer science; Network packet; Consensus; Distributed computing; Computer network; Control theory (sociology); Artificial intelligence; Control (management)","score_opus":0.02758936882851248,"score_gpt":0.24314745520927233,"score_spread":0.21555808638075985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095579099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25234482,0.0019986096,0.7392566,0.00031501727,0.0006861994,0.0011706634,0.000030451269,0.00042105763,0.0037765792],"genre_scores_gemma":[0.99180686,0.000007637553,0.0071558496,0.00009856031,0.00005239598,0.000050003928,0.000006784091,0.000017527045,0.0008043664],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979391,0.00021238244,0.0004094044,0.0004365234,0.0003294927,0.0006730938],"domain_scores_gemma":[0.9986939,0.00023340431,0.00014634608,0.0005638969,0.00008154137,0.000280904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064318266,0.00026522658,0.00036991047,0.0001473729,0.00009760951,0.00029365555,0.00040003392,0.00008975291,0.000013682076],"category_scores_gemma":[0.000051380826,0.00020441455,0.000034756646,0.00032436763,0.000059815608,0.0004907018,0.0001807804,0.00014035575,0.00022029091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028910264,0.0029698494,0.85072213,0.0010537746,0.0009329642,0.0016651972,0.011614606,0.031454463,0.020657977,0.05655457,0.009791471,0.0122938985],"study_design_scores_gemma":[0.004583797,0.00011887159,0.021775525,0.0002469143,0.000021464935,0.00055258896,0.0002782135,0.96832174,0.00064785714,0.000011883504,0.0026525655,0.0007885568],"about_ca_topic_score_codex":0.0004853284,"about_ca_topic_score_gemma":0.000037239202,"teacher_disagreement_score":0.9368673,"about_ca_system_score_codex":0.000106385225,"about_ca_system_score_gemma":0.000052810457,"threshold_uncertainty_score":0.83357835},"labels":[],"label_agreement":null},{"id":"W2095736230","doi":"10.1115/imece2005-81561","title":"Formation Control of Under-Actuated Robotic Boats","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Linearization; Feedback linearization; Control (management); Orientation (vector space); Computer science; Control engineering; Control system; Robot; Engineering; Artificial intelligence; Nonlinear system; Mathematics; Physics","score_opus":0.017933791343397728,"score_gpt":0.233339284799446,"score_spread":0.21540549345604826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095736230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032674267,0.000047779686,0.9910304,0.00229605,0.00015055884,0.00027134913,0.0000033053732,0.00019390309,0.002739246],"genre_scores_gemma":[0.9939539,0.0000016152235,0.0053171646,0.0003819428,0.000035840956,0.000011769793,0.0000060405932,0.0000046639216,0.00028704913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988843,0.00006642104,0.00038587156,0.00017292179,0.00026540435,0.00022506568],"domain_scores_gemma":[0.999142,0.000077972836,0.00017039847,0.0004069744,0.00013022247,0.000072448005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022403972,0.000106563915,0.00020773236,0.0000817012,0.000039300805,0.00007100715,0.0005111826,0.00005032916,0.000033542266],"category_scores_gemma":[0.00003112846,0.00009066619,0.000065223605,0.00022538708,0.000017463028,0.00090983004,0.00004323058,0.00005112522,0.00022316234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006386875,0.0007460707,0.00069771265,0.000111366826,0.00030126845,0.00001114069,0.0012782525,0.26513186,0.103901014,0.47602877,0.0095900865,0.14213859],"study_design_scores_gemma":[0.0015987575,0.00004781767,0.001499513,0.000014942594,0.000009766905,0.00001082108,0.000025774938,0.9878948,0.0073364726,0.00032191654,0.0011162122,0.00012323516],"about_ca_topic_score_codex":0.000024864106,"about_ca_topic_score_gemma":0.000024726904,"teacher_disagreement_score":0.9906865,"about_ca_system_score_codex":0.00007511743,"about_ca_system_score_gemma":0.00003363949,"threshold_uncertainty_score":0.36972597},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010746714912305534,"score_gpt":0.24129018558190193,"score_spread":0.2305434706695964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096224892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061510164,0.00036458802,0.93299013,0.0012993541,0.00092038064,0.002383491,0.00013413651,0.00033194563,0.000065796696],"genre_scores_gemma":[0.99761647,0.000007442088,0.0018406367,0.000038387283,0.000034303568,0.00038873986,0.0000010677245,0.000014416575,0.00005851698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997241,0.00018112057,0.0011395055,0.00055419205,0.00030487266,0.00057930546],"domain_scores_gemma":[0.9972352,0.0007678966,0.00056950573,0.0009977508,0.00035352074,0.00007617162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063918816,0.000277679,0.00094640005,0.00051103655,0.00008762026,0.000022408178,0.001078351,0.00041843334,7.6639583e-7],"category_scores_gemma":[0.00009435235,0.000270198,0.00019325555,0.00090589916,0.0001480568,0.00012952609,0.0000031952304,0.0002683501,0.000005459862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022709814,0.0029441202,0.0012007465,0.0006411856,0.0009565589,0.00006163028,0.00073141843,0.520038,0.24614634,0.11000628,0.0015638572,0.113438845],"study_design_scores_gemma":[0.017142808,0.002970479,0.0008472482,0.0008954405,0.000118631084,0.00009813218,0.00038576341,0.9349612,0.03698019,0.0038582287,0.0010211653,0.0007207011],"about_ca_topic_score_codex":0.00014413704,"about_ca_topic_score_gemma":0.00013867687,"teacher_disagreement_score":0.9361063,"about_ca_system_score_codex":0.0001177871,"about_ca_system_score_gemma":0.00014256666,"threshold_uncertainty_score":0.999975},"labels":[],"label_agreement":null},{"id":"W2096300742","doi":"10.1109/tro.2009.2035741","title":"Decentralized Localization of Sparsely-Communicating Robot Networks: A Centralized-Equivalent Approach","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":106,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robot; Scalability; Computer science; Mobile robot; Distributed computing; Network topology; Set (abstract data type); State (computer science); Telecommunications network; Robot kinematics; Topology (electrical circuits); Computer network; Artificial intelligence; Engineering; Algorithm","score_opus":0.037529892996613905,"score_gpt":0.25057724478728677,"score_spread":0.21304735179067286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096300742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034867472,0.00008076614,0.9963933,0.00025865456,0.0017159308,0.0006067402,0.000017945884,0.00030725633,0.0002707361],"genre_scores_gemma":[0.8463703,0.00009581506,0.15325993,0.000096685886,0.00003674531,0.000042614138,0.000015021782,0.000030150128,0.000052746505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973241,0.000260242,0.00081272476,0.00048894313,0.00051567843,0.00059827854],"domain_scores_gemma":[0.9973232,0.00021543844,0.00037844255,0.0016199853,0.00022696295,0.00023596334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045266264,0.0003156181,0.00046423418,0.00016610142,0.00028205407,0.00016033716,0.0014823938,0.00022800334,0.00002365435],"category_scores_gemma":[0.00002403412,0.00031709255,0.00024971398,0.000784453,0.00012863602,0.00037070003,0.000012353177,0.0005985872,0.000018486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022059634,0.0006310145,0.00008000012,0.000036307716,0.00008383371,0.0000019691113,0.00022717842,0.9857096,0.0015833426,0.0055557755,0.00006483251,0.006004099],"study_design_scores_gemma":[0.001360345,0.000057954046,0.00007905211,0.000059606733,0.000069841764,0.000018207122,0.000041503074,0.99371517,0.0039814888,0.00008785541,0.00023496484,0.00029399153],"about_ca_topic_score_codex":0.00008379083,"about_ca_topic_score_gemma":0.000048971688,"teacher_disagreement_score":0.8460216,"about_ca_system_score_codex":0.00008518038,"about_ca_system_score_gemma":0.000087187516,"threshold_uncertainty_score":0.9999281},"labels":[],"label_agreement":null},{"id":"W2096688261","doi":"10.1109/systems.2009.4815826","title":"A distributed Kalman filter for actuator fault estimation of deep space formation flying satellites","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kalman filter; Control theory (sociology); Actuator; Diagonal; Computer science; Extended Kalman filter; State-space representation; Block (permutation group theory); State space; Fast Kalman filter; Invariant extended Kalman filter; Representation (politics); Algorithm; Mathematics; Control (management); Artificial intelligence","score_opus":0.01673777512971253,"score_gpt":0.25781649524668604,"score_spread":0.2410787201169735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096688261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012621077,0.000049623904,0.98473686,0.0011696988,0.00012999153,0.00073581864,0.00005359112,0.00022389278,0.00027946226],"genre_scores_gemma":[0.8773062,0.0000020751554,0.122272156,0.000080753314,0.000027309947,0.00004014025,0.00021912195,0.0000053865474,0.00004682122],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986051,0.000044973003,0.00048653127,0.0002713389,0.00028367856,0.00030838803],"domain_scores_gemma":[0.99877477,0.00017527804,0.00028896384,0.00045637198,0.00021760984,0.00008703787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003018684,0.00017044225,0.00025025438,0.0001089381,0.0001193119,0.00016782714,0.00050425186,0.00008087884,0.00000859311],"category_scores_gemma":[0.00021414812,0.00014957736,0.00011595977,0.00031616446,0.00001405339,0.0012866623,0.000040535397,0.000052790318,0.000025668007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010967771,0.00041163652,0.00017007513,0.0002971018,0.00010531846,0.000005083735,0.0031221197,0.019754115,0.07057026,0.17921415,0.003408756,0.7228317],"study_design_scores_gemma":[0.00082972477,0.00014544516,0.0011695138,0.0000364069,0.000013835868,0.0000055746627,0.00006465894,0.9634067,0.031102665,0.002341596,0.00071204785,0.00017187593],"about_ca_topic_score_codex":0.000012563036,"about_ca_topic_score_gemma":0.0000051487555,"teacher_disagreement_score":0.9436525,"about_ca_system_score_codex":0.000089493486,"about_ca_system_score_gemma":0.000023016708,"threshold_uncertainty_score":0.60995877},"labels":[],"label_agreement":null},{"id":"W2099059054","doi":"","title":"Consensus-based distributed receding horizon estimation of sensor networks","year":2013,"lang":"en","type":"article","venue":"Chinese Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Wireless sensor network; Estimator; Consensus; Node (physics); Computer science; State (computer science); Set (abstract data type); Sensor node; Mathematical optimization; Distributed algorithm; Optimization problem; Control theory (sociology); Distributed computing; Multi-agent system; Mathematics; Algorithm; Key distribution in wireless sensor networks; Engineering; Artificial intelligence; Computer network; Control (management); Wireless; Wireless network; Telecommunications","score_opus":0.01265593069360717,"score_gpt":0.23784425206325613,"score_spread":0.22518832136964895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099059054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11093443,0.00011358164,0.8850194,0.001527428,0.00062952883,0.0010033987,0.00008798227,0.00033094766,0.00035325598],"genre_scores_gemma":[0.99382085,0.0000027237481,0.005641475,0.00012721418,0.000095732474,0.00015686793,0.000099699064,0.000019667197,0.00003577026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971567,0.00029690098,0.0008682055,0.0006245731,0.00047142096,0.0005822386],"domain_scores_gemma":[0.9962847,0.00085601583,0.00061937945,0.0010223917,0.0009593027,0.00025817656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004946983,0.0004151713,0.00073985115,0.00015925235,0.0001417149,0.00035680298,0.0011018045,0.00019247242,0.00006335311],"category_scores_gemma":[0.0010094523,0.00034645892,0.00017922376,0.0006630525,0.0001360307,0.0004440922,0.000104687504,0.0002686625,0.00008947565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003004607,0.0006283856,0.04281902,0.0003447052,0.00050685246,0.00007420397,0.00035812444,0.72699255,0.057199057,0.037376028,0.003542118,0.1298585],"study_design_scores_gemma":[0.0029190395,0.00014630177,0.016812338,0.00010720586,0.000024750934,0.000008544293,0.0000150959695,0.9785194,0.00029506936,0.00076011545,0.00005447603,0.00033767984],"about_ca_topic_score_codex":0.00019831063,"about_ca_topic_score_gemma":0.00001257546,"teacher_disagreement_score":0.8828864,"about_ca_system_score_codex":0.00008793945,"about_ca_system_score_gemma":0.00019352675,"threshold_uncertainty_score":0.99989873},"labels":[],"label_agreement":null},{"id":"W2099833690","doi":"10.1109/acc.2005.1470106","title":"Experimental validation of multi-vehicle coordination strategies","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"University of Toronto","keywords":"Aerospace; Vehicle dynamics; Computer science; Work (physics); Control (management); Control engineering; Artificial intelligence; Engineering; Aerospace engineering; Mechanical engineering","score_opus":0.025626288077044992,"score_gpt":0.28379761425305083,"score_spread":0.25817132617600586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099833690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.174934,0.00008439178,0.82048136,0.0004015932,0.00013866293,0.00019131867,0.0000029649725,0.0001625587,0.0036031632],"genre_scores_gemma":[0.9820901,3.412498e-7,0.01728033,0.00003075825,0.00003547816,0.000017148239,0.0000076173333,0.0000041106105,0.0005340739],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9991366,0.0000519165,0.00025528102,0.00019598233,0.00022262699,0.00013758293],"domain_scores_gemma":[0.99945027,0.00002648336,0.00011228946,0.0002732026,0.00009726651,0.000040493283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016604325,0.000085175976,0.00011085927,0.0000624917,0.000041835585,0.00012411173,0.00037411315,0.000038078215,0.000053028627],"category_scores_gemma":[0.000012100099,0.00007933252,0.00004287156,0.00016468366,0.000019916451,0.0012681226,0.000063131214,0.000032761505,0.000078904595],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075790313,0.0005818494,0.00064795185,0.000013019155,0.000031945914,0.0000015045725,0.0012740545,0.007004082,0.8274047,0.14922236,0.0011710059,0.012639979],"study_design_scores_gemma":[0.00081317406,0.00003771817,0.0010416233,0.000005628838,0.0000019150457,0.0000015851343,0.00038959837,0.3630432,0.63392603,0.000031411106,0.0006178165,0.000090341106],"about_ca_topic_score_codex":0.00007089952,"about_ca_topic_score_gemma":0.0000064046076,"teacher_disagreement_score":0.80715615,"about_ca_system_score_codex":0.000059832186,"about_ca_system_score_gemma":0.000035606154,"threshold_uncertainty_score":0.32350865},"labels":[],"label_agreement":null},{"id":"W2101018889","doi":"10.1109/cdc.2010.5717234","title":"Stochastic approximation for consensus with general time-varying weight matrices","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Ergodicity; Lyapunov function; Convergence (economics); Quadratic equation; Stochastic approximation; Mathematics; Discrete time and continuous time; Applied mathematics; Network topology; Mathematical optimization; Stochastic process; Consensus; Computer science; Multi-agent system","score_opus":0.009546336081148774,"score_gpt":0.22548622407297159,"score_spread":0.21593988799182282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101018889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02290026,0.000019328878,0.97267,0.0006644597,0.00043932575,0.0007278972,0.000015009546,0.00031836648,0.0022453293],"genre_scores_gemma":[0.75135714,1.2638172e-7,0.24685219,0.000095108684,0.00020043872,0.00012888834,0.000022056909,0.000013948636,0.001330106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881375,0.000027320433,0.0002390564,0.0003670584,0.00024523842,0.00030756957],"domain_scores_gemma":[0.99894345,0.00019409685,0.00014829297,0.0004460249,0.00016811698,0.00009999578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026334205,0.0001554951,0.00018373723,0.00009180584,0.0001369969,0.0002456911,0.00050931686,0.0000676713,0.00002344337],"category_scores_gemma":[0.000050337934,0.00011557799,0.000049074304,0.00021345129,0.00003306553,0.00025162028,0.000056674948,0.00009835811,0.00011222969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024287628,0.00045613816,0.000530862,0.00022924373,0.00037299327,0.000035848385,0.0008003571,0.0134557765,0.24533205,0.67643875,0.017955448,0.04414967],"study_design_scores_gemma":[0.001236377,0.0000635656,0.000081900136,0.000011077556,0.000016358903,0.000045675795,0.0000052439427,0.99523646,0.0015420722,0.0006759109,0.0008788668,0.00020647483],"about_ca_topic_score_codex":0.000031679912,"about_ca_topic_score_gemma":0.000011750704,"teacher_disagreement_score":0.9817807,"about_ca_system_score_codex":0.000021782378,"about_ca_system_score_gemma":0.00007101384,"threshold_uncertainty_score":0.47131336},"labels":[],"label_agreement":null},{"id":"W2101097736","doi":"10.1016/j.sysconle.2013.02.001","title":"Two-stage time-optimal formation reconfiguration strategy","year":2013,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control reconfiguration; Acceleration; Mathematical optimization; Interval (graph theory); Regular polygon; Constraint (computer-aided design); Set (abstract data type); Computer science; Convex optimization; Optimization problem; Control theory (sociology); Mathematics; Control (management); Artificial intelligence; Physics; Combinatorics","score_opus":0.009982702138526978,"score_gpt":0.21089673028189151,"score_spread":0.20091402814336454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101097736","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12495218,0.00017897622,0.8607672,0.0034515262,0.001549308,0.003483293,0.0000500199,0.00074299093,0.004824496],"genre_scores_gemma":[0.9963489,8.719577e-7,0.0004481791,0.0009664673,0.00031080807,0.0005672911,0.00006152985,0.000027000251,0.0012689335],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966205,0.0005106874,0.0009461123,0.00060663046,0.00061057374,0.0007055425],"domain_scores_gemma":[0.9978328,0.00015309884,0.0005948429,0.0009495812,0.00025065476,0.00021901826],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007121229,0.0003697959,0.0005380526,0.00021351401,0.00016243645,0.0014516177,0.0009610317,0.00012157809,0.00015127345],"category_scores_gemma":[0.00003232562,0.0003446414,0.00016751132,0.0002882495,0.00003222087,0.0033608172,0.000047595142,0.00021309836,0.0060075265],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405255,0.00008827425,0.0005202227,0.0001918867,0.00029488566,0.000048270304,0.00053317676,0.08531647,0.8587123,0.021215476,0.02498176,0.008056756],"study_design_scores_gemma":[0.003704358,0.000092512266,0.00093482493,0.00007407871,0.000018680212,0.000046164725,0.000142653,0.9893802,0.0004395354,0.000017851411,0.0046725376,0.00047663637],"about_ca_topic_score_codex":0.0010287411,"about_ca_topic_score_gemma":0.000009805594,"teacher_disagreement_score":0.9040637,"about_ca_system_score_codex":0.00025448776,"about_ca_system_score_gemma":0.00005349484,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W2101141185","doi":"10.1109/cdc.2009.5400121","title":"A sub-optimal distributed Kalman filter with fusion feedback for acyclic systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kalman filter; Computer science; Control theory (sociology); Diagonal; Extended Kalman filter; State space; Fast Kalman filter; Sensor fusion; Overhead (engineering); Alpha beta filter; Invariant extended Kalman filter; Block (permutation group theory); Filter (signal processing); State-space representation; Algorithm; Mathematics; Artificial intelligence; Moving horizon estimation","score_opus":0.01412036593063947,"score_gpt":0.23000443397169304,"score_spread":0.21588406804105356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101141185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043712202,0.00011438815,0.9511689,0.0015078532,0.00043157785,0.0014490202,0.00012342948,0.0006120526,0.0008806044],"genre_scores_gemma":[0.99114823,0.000002966119,0.007342515,0.00023578829,0.00017317398,0.00014783588,0.00018354338,0.000018042103,0.00074792904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743754,0.000085510736,0.00049889355,0.00075046206,0.00048742015,0.00074020575],"domain_scores_gemma":[0.9981303,0.0001272239,0.00022246216,0.0010075438,0.0002547815,0.00025767082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034278078,0.00035209447,0.00045040695,0.00011322997,0.00021239345,0.0005886486,0.0011595003,0.00013184581,0.000008611192],"category_scores_gemma":[0.00004026814,0.0002591702,0.00014278814,0.0004972399,0.00003306347,0.0006748666,0.000101285834,0.00012652382,0.00011043584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022568884,0.004005543,0.008049745,0.0007792011,0.00120228,0.00057089556,0.0020916115,0.044701163,0.13305,0.40224177,0.29598936,0.10506153],"study_design_scores_gemma":[0.0079582855,0.0017579924,0.018319918,0.00026204184,0.000073253614,0.00018978363,0.00016990476,0.92354715,0.0052996366,0.000235844,0.040869743,0.0013164327],"about_ca_topic_score_codex":0.000059029935,"about_ca_topic_score_gemma":0.000014872776,"teacher_disagreement_score":0.947436,"about_ca_system_score_codex":0.00013148194,"about_ca_system_score_gemma":0.00007160235,"threshold_uncertainty_score":0.99998605},"labels":[],"label_agreement":null},{"id":"W2101249821","doi":"10.1109/acc.2009.5160274","title":"Analysis of actuator faults in a cooperative team consensus of unmanned systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Float (project management); Actuator; Fault (geology); Lock (firearm); Computer science; Control theory (sociology); Trajectory; Stability (learning theory); Fault tolerance; Controller (irrigation); Convergence (economics); Control (management); Distributed computing; Engineering; Artificial intelligence; Economics","score_opus":0.01329168638707837,"score_gpt":0.25889934812087295,"score_spread":0.24560766173379459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101249821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85532844,0.00018933849,0.13641775,0.00038541184,0.000239323,0.00088204065,0.00010808185,0.00012002627,0.0063295825],"genre_scores_gemma":[0.9990024,0.0000018532633,0.00070813164,0.000044620298,0.000008331665,0.000009870783,0.000010042908,0.000003023985,0.000211753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803686,0.00021702569,0.0007908187,0.0003526279,0.00035819664,0.00024445486],"domain_scores_gemma":[0.9983836,0.00022650303,0.00033646735,0.00065108214,0.00032232626,0.000080050566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047440815,0.00015733505,0.0007681109,0.000544184,0.000021055575,0.000034110988,0.00062676443,0.00007921568,0.000006914748],"category_scores_gemma":[0.00014867612,0.00012919128,0.00014582358,0.0023450276,0.000042003685,0.00012983933,0.000048646118,0.00007054534,0.000008249625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057819515,0.0045858435,0.091868095,0.0003104828,0.008782505,0.00021823826,0.012791486,0.33394402,0.13207014,0.39542726,0.006455211,0.012968527],"study_design_scores_gemma":[0.0016274358,0.0002517106,0.03623213,0.00007128049,0.000138918,0.000003563939,0.0006440302,0.9572317,0.0034661156,0.000022490844,0.000096312615,0.0002142878],"about_ca_topic_score_codex":0.00072784617,"about_ca_topic_score_gemma":0.00018064927,"teacher_disagreement_score":0.62328774,"about_ca_system_score_codex":0.00006962039,"about_ca_system_score_gemma":0.000099020326,"threshold_uncertainty_score":0.52682674},"labels":[],"label_agreement":null},{"id":"W2102686956","doi":"10.1109/tcst.2007.903389","title":"A Model Predictive Decentralized Control Scheme With Reduced Communication Requirement for Spacecraft Formation","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Decentralised system; Robustness (evolution); Spacecraft; Control engineering; Model predictive control; Controller (irrigation); Computer science; Engineering; Control (management)","score_opus":0.027089385302245285,"score_gpt":0.24654690107660232,"score_spread":0.21945751577435704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102686956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004898591,0.0003653028,0.9835384,0.0035554152,0.00045263895,0.0054030214,0.00025538227,0.0014257428,0.00010550144],"genre_scores_gemma":[0.9820088,0.000059912534,0.011938264,0.0001317566,0.00002508203,0.0056176847,0.00001490452,0.000043916687,0.00015967207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967579,0.00025052033,0.0009480548,0.0007247214,0.0005580018,0.00076075917],"domain_scores_gemma":[0.996483,0.0002689262,0.0006246864,0.0017204804,0.0007342438,0.00016860671],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005560667,0.00045402013,0.00081878406,0.00063796475,0.0007418918,0.00011830251,0.0012570544,0.00043307422,0.0000018231252],"category_scores_gemma":[0.000035062963,0.00041087045,0.0002023799,0.00059045525,0.0002148693,0.00096532615,0.000005241646,0.0004030131,0.000026532718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003796411,0.0017001481,0.00014191479,0.00027137587,0.0021608246,0.000038649425,0.0014979363,0.8260907,0.113375954,0.044430085,0.0016992728,0.004796753],"study_design_scores_gemma":[0.016059007,0.00073475146,0.000012875428,0.00017524621,0.00011951421,0.00019617888,0.000156732,0.9766339,0.0046660835,0.00022775502,0.0006213381,0.00039663742],"about_ca_topic_score_codex":0.000057526693,"about_ca_topic_score_gemma":0.000075213735,"teacher_disagreement_score":0.9771102,"about_ca_system_score_codex":0.000605397,"about_ca_system_score_gemma":0.00024889075,"threshold_uncertainty_score":0.9998343},"labels":[],"label_agreement":null},{"id":"W2105616725","doi":"10.1109/tfuzz.2011.2180391","title":"Decentralized Fault-Tolerant Control for Satellite Attitude Synchronization","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":105,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Computer science; Actuator; Fault tolerance; Synchronization (alternating current); Controller (irrigation); Attitude control; Fuzzy logic; Fault (geology); Terminal sliding mode; Control engineering; Sliding mode control; Control (management); Distributed computing; Engineering; Channel (broadcasting); Nonlinear system; Artificial intelligence","score_opus":0.03200618455284457,"score_gpt":0.24231214788204306,"score_spread":0.2103059633291985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105616725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080656435,0.0005662186,0.9891377,0.00011867404,0.00522655,0.0025557405,0.00021363159,0.0006362534,0.0007386297],"genre_scores_gemma":[0.99587077,0.00005259508,0.002527073,0.000119285476,0.00010403201,0.00087136717,0.000013545756,0.000045752302,0.00039556366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996901,0.0003014195,0.0008431461,0.00074552326,0.00050705107,0.00070185587],"domain_scores_gemma":[0.99784994,0.00022464179,0.00030141912,0.0009915846,0.00035664442,0.00027574255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005567169,0.00039294452,0.00058345,0.0002423636,0.00034761018,0.00030275987,0.0009401712,0.00021466504,0.000015667292],"category_scores_gemma":[0.000012695795,0.00037003154,0.00030526923,0.00045947215,0.0000507922,0.0006371766,0.0000021479436,0.00017895576,0.00026519745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037450513,0.008972687,0.0021858108,0.00340014,0.0072003976,0.00032545594,0.018444829,0.44821885,0.027727185,0.15592712,0.0045379614,0.31931448],"study_design_scores_gemma":[0.014748344,0.00075747166,0.00077031757,0.00052094436,0.00032756265,0.00012125429,0.0002750938,0.95658666,0.006524984,0.00029259053,0.017620087,0.0014546942],"about_ca_topic_score_codex":0.0003159167,"about_ca_topic_score_gemma":0.00006191813,"teacher_disagreement_score":0.9950642,"about_ca_system_score_codex":0.00027543976,"about_ca_system_score_gemma":0.00011844137,"threshold_uncertainty_score":0.9998752},"labels":[],"label_agreement":null},{"id":"W2106030490","doi":"","title":"Co-evolutionary information gathering for a cooperative unmanned aerial vehicle team","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Defence Research and Development Canada","funders":"","keywords":"Computer science; Heuristics; Motion planning; Variety (cybernetics); Distributed computing; Information sharing; Task (project management); Reinforcement learning; Artificial intelligence; Robot; Engineering","score_opus":0.011809447669081326,"score_gpt":0.2477511033218815,"score_spread":0.23594165565280018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106030490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094934665,0.000019654475,0.97851527,0.0011946401,0.0003784027,0.0008125377,0.000035747955,0.0003649703,0.009185284],"genre_scores_gemma":[0.9898509,9.508187e-7,0.00893926,0.0006752525,0.00012407856,0.0000673657,0.00005764001,0.0000032771222,0.0002812928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904716,0.000036569527,0.00028860455,0.00017166717,0.00019446338,0.00026155185],"domain_scores_gemma":[0.99933654,0.00005545964,0.00009170353,0.00026639635,0.00017500475,0.000074886644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017456744,0.00011942916,0.00014582303,0.0000645684,0.00017315743,0.00022151484,0.0004194431,0.0000576793,0.000011286202],"category_scores_gemma":[0.00007043429,0.00010706853,0.00006062576,0.00018040247,0.000014842267,0.0017908447,0.000024388932,0.00005111,0.00015252284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039522062,0.0004624287,0.00027205126,0.000051019633,0.00013482745,0.0000050638187,0.004934999,0.011420734,0.04773542,0.69659394,0.14443836,0.09355591],"study_design_scores_gemma":[0.0035458745,0.00048107243,0.0031157085,0.000023878903,0.000006592486,0.000010670782,0.00020205198,0.91060966,0.0067274137,0.0010136663,0.07391965,0.00034377832],"about_ca_topic_score_codex":0.000016932288,"about_ca_topic_score_gemma":0.0000021087146,"teacher_disagreement_score":0.9803574,"about_ca_system_score_codex":0.000100959835,"about_ca_system_score_gemma":0.00007737067,"threshold_uncertainty_score":0.43661278},"labels":[],"label_agreement":null},{"id":"W2106548031","doi":"10.1109/icassp.2008.4518102","title":"Distributed average consensus with increased convergence rate","year":2008,"lang":"en","type":"article","venue":"Proceedings of the ... IEEE International Conference on Acoustics, Speech, and Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Rate of convergence; Context (archaeology); Extrapolation; Computer science; Mathematical optimization; Consensus; Matrix (chemical analysis); Algorithm; Iterative method; Mathematics; Multi-agent system; Artificial intelligence; Statistics","score_opus":0.03456428446120047,"score_gpt":0.2500347094226115,"score_spread":0.21547042496141106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106548031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7393541,0.000055013206,0.25201046,0.0016731528,0.0005844745,0.00055330375,0.00017043758,0.00020194621,0.0053971116],"genre_scores_gemma":[0.996377,0.000032375807,0.002982532,0.00021643612,0.00011249203,0.000016320691,0.000007155537,0.000016327682,0.00023939804],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977543,0.000027407868,0.0005106415,0.00055772124,0.0008048957,0.00034504835],"domain_scores_gemma":[0.9971626,0.00011727955,0.0006530454,0.00016285632,0.0017492671,0.00015497158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040049283,0.0003151569,0.0003537592,0.00012878419,0.0003476437,0.00031825664,0.0013559529,0.00009997004,0.000021365182],"category_scores_gemma":[0.00018184137,0.00022821911,0.00007156518,0.00030883064,0.0004262117,0.00044526366,0.00016570461,0.000319583,0.0000074517498],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012813198,0.0008452155,0.028963841,0.00072852126,0.0005356371,0.00020979691,0.0022997109,0.0027582974,0.87312025,0.073888116,0.0038244324,0.01154484],"study_design_scores_gemma":[0.0025184334,0.0002963202,0.008652783,0.001047222,0.00006498641,0.00048568952,0.00046709494,0.9225361,0.05855525,0.0045158854,0.00015472484,0.00070554466],"about_ca_topic_score_codex":0.00006350771,"about_ca_topic_score_gemma":0.000001925219,"teacher_disagreement_score":0.91977775,"about_ca_system_score_codex":0.000091488335,"about_ca_system_score_gemma":0.00028478715,"threshold_uncertainty_score":0.93065053},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02511481354304722,"score_gpt":0.26842604928164976,"score_spread":0.24331123573860253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107723135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079044566,0.00002916702,0.91292834,0.0004961282,0.0020325903,0.0040646503,0.0009559805,0.00041931044,0.000029288594],"genre_scores_gemma":[0.99549294,0.0000011295842,0.0022248782,0.000070568574,0.000034719007,0.0020889926,0.00001555335,0.00002874351,0.000042482312],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965624,0.00040643898,0.0012315313,0.00064190873,0.0005467011,0.00061102695],"domain_scores_gemma":[0.9961279,0.0016026478,0.0005890387,0.0010755934,0.00043070476,0.00017409738],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012448368,0.00040619864,0.00093369087,0.00035837054,0.00019632517,0.00039483592,0.0009129887,0.00028027454,0.000014919851],"category_scores_gemma":[0.00015120914,0.00039104559,0.00031407605,0.00056182867,0.00010872123,0.0011170809,0.0000032978885,0.0003569169,0.000015744823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011509194,0.007387191,0.0011133205,0.001789387,0.0018563241,0.000043459757,0.0020407094,0.6449581,0.23411544,0.0807323,0.0003826298,0.024430273],"study_design_scores_gemma":[0.014808868,0.00028654,0.0032270714,0.00011364459,0.00009409348,0.00001042514,0.00016474207,0.9792723,0.0010740741,0.00038175978,0.00022744859,0.0003390036],"about_ca_topic_score_codex":0.00055577914,"about_ca_topic_score_gemma":0.0012687786,"teacher_disagreement_score":0.91644835,"about_ca_system_score_codex":0.0002087824,"about_ca_system_score_gemma":0.00039851735,"threshold_uncertainty_score":0.99985415},"labels":[],"label_agreement":null},{"id":"W2108050886","doi":"10.1109/acc.2011.5991382","title":"Optimizing the location of sensors subject to health degradation","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Software deployment; Computer science; Heuristic; Asset (computer security); Set (abstract data type); Variable (mathematics); Degradation (telecommunications); Real-time computing; Operations research; Reliability engineering; Computer security; Engineering; Artificial intelligence; Telecommunications","score_opus":0.04914515696285512,"score_gpt":0.26468697492306775,"score_spread":0.21554181796021263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108050886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010952851,0.000051730567,0.98503864,0.0015249855,0.00019911307,0.00035858125,0.0000011234412,0.000088681976,0.0017842794],"genre_scores_gemma":[0.9566247,0.00000159087,0.04284179,0.00030722257,0.000014255992,0.000013956463,0.0000020290872,0.0000036988006,0.00019076094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990747,0.00012408016,0.00026244382,0.00018086913,0.0001911942,0.00016671524],"domain_scores_gemma":[0.99909127,0.000049831564,0.00013880502,0.00048627862,0.00017024163,0.00006356889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058646174,0.00006924909,0.0001111913,0.00006280704,0.00006984402,0.000035075638,0.000510583,0.00001941319,0.0000065151553],"category_scores_gemma":[0.000060463793,0.000047277783,0.000025405301,0.0005488171,0.000011873736,0.00021063541,0.00006300105,0.00003731096,0.000051886385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007858631,0.0005278263,0.0053261467,0.00023896323,0.00018504304,0.000005751626,0.058553625,0.017055681,0.008008725,0.7275429,0.010967283,0.17150947],"study_design_scores_gemma":[0.0016119962,0.0007447709,0.07127955,0.00024751414,0.000021895426,0.000030524938,0.003147335,0.8566092,0.06212931,0.0007710302,0.0027044115,0.00070245564],"about_ca_topic_score_codex":0.0013265689,"about_ca_topic_score_gemma":0.00010632483,"teacher_disagreement_score":0.94567186,"about_ca_system_score_codex":0.000051425377,"about_ca_system_score_gemma":0.00008731916,"threshold_uncertainty_score":0.20053843},"labels":[],"label_agreement":null},{"id":"W2108231552","doi":"10.1243/09544100jaero563","title":"A hierarchical decision and information system for multi-aircraft combat missions","year":2009,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part G Journal of Aerospace Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Operations research; Software deployment; Context (archaeology); Energy consumption; sort; Process (computing); Computer security; Engineering","score_opus":0.01278811087264837,"score_gpt":0.22491696782006224,"score_spread":0.21212885694741387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108231552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0568431,0.000121527104,0.94107366,0.0006774504,0.0008752521,0.00033622023,0.000009149674,0.00005262038,0.000011050219],"genre_scores_gemma":[0.8865231,0.000016893471,0.11337497,0.00001532253,0.000055854394,0.0000051833313,4.4366615e-7,0.0000053298495,0.0000028547743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982984,0.000006533334,0.0008560811,0.00012571686,0.000494319,0.00021892606],"domain_scores_gemma":[0.99841297,0.00011486657,0.00058865827,0.00013408095,0.00057069736,0.00017870094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008613411,0.00017729646,0.00042186095,0.00021060319,0.00007655028,0.00006743011,0.0006839279,0.00012569754,2.3823549e-7],"category_scores_gemma":[0.0012329764,0.00013146573,0.00020595091,0.00037106103,0.000028013377,0.0013426784,0.000089843845,0.00026153447,3.4308167e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021928476,0.00018831594,0.00006178954,0.0008578894,0.00016634612,0.0000020165623,0.00066539977,0.1530653,0.15492304,0.6835972,0.00061754975,0.0056358855],"study_design_scores_gemma":[0.002955928,0.00039572245,0.0005925163,0.0020143962,0.00006238314,0.00015766238,0.0001327223,0.9373507,0.054397285,0.00012478349,0.0016089168,0.00020697904],"about_ca_topic_score_codex":9.280924e-7,"about_ca_topic_score_gemma":5.5876793e-8,"teacher_disagreement_score":0.82968,"about_ca_system_score_codex":0.00011353781,"about_ca_system_score_gemma":0.00006412294,"threshold_uncertainty_score":0.53610164},"labels":[],"label_agreement":null},{"id":"W2108287685","doi":"10.1002/asjc.868","title":"Digraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol","year":2014,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Laplacian matrix; Algebraic number; Algebraic graph theory; Algebraic connectivity; Adjacency matrix; Graph; Set (abstract data type); Directed graph; Topology (electrical circuits)","score_opus":0.00889656532275618,"score_gpt":0.23698094536070846,"score_spread":0.22808438003795228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108287685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022246849,0.000029663419,0.97718936,0.008089316,0.00032789033,0.01225468,0.000006714796,0.000034829285,0.0018450696],"genre_scores_gemma":[0.9915848,4.5975742e-7,0.004628133,0.0005176938,0.00022454155,0.0028652227,9.1577095e-7,0.000016596232,0.00016163156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973965,0.00040060203,0.00073931756,0.00025108046,0.00076309807,0.000449379],"domain_scores_gemma":[0.99743706,0.0001633838,0.0009937732,0.00070216594,0.00047228983,0.00023132801],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014360319,0.00024903243,0.0004301215,0.000109173336,0.00021286335,0.00042435213,0.0016339722,0.000054561537,0.000010918129],"category_scores_gemma":[0.00013825038,0.00013991147,0.00020731558,0.00027935967,0.00008529451,0.000374465,0.00006455063,0.00030496545,0.000022259921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019729196,0.003446685,0.12529694,0.00048382772,0.004699097,0.0007820131,0.0034723212,0.050397504,0.0009095711,0.45041057,0.0075168284,0.35061172],"study_design_scores_gemma":[0.03008348,0.0021836918,0.05129172,0.0005055731,0.00021060374,0.00060974364,0.00088512315,0.82444596,0.000069722824,0.0019990238,0.086964086,0.0007512733],"about_ca_topic_score_codex":0.000015385729,"about_ca_topic_score_gemma":0.00007950401,"teacher_disagreement_score":0.99136233,"about_ca_system_score_codex":0.00014264659,"about_ca_system_score_gemma":0.00014498745,"threshold_uncertainty_score":0.5705424},"labels":[],"label_agreement":null},{"id":"W2110395839","doi":"10.1109/tsp.2008.929664","title":"Decentralized Adaptive Filtering Algorithms for Sensor Activation in an Unattended Ground Sensor Network","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Computer science; Transmission (telecommunications); Node (physics); Convergence (economics); Real-time computing; Algorithm; Computer network; Engineering; Telecommunications","score_opus":0.0693115511674134,"score_gpt":0.28781249831322525,"score_spread":0.21850094714581186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110395839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043597117,0.000030096839,0.9548502,0.00015954014,0.00031344587,0.0007226121,0.000019122837,0.000282554,0.00002531526],"genre_scores_gemma":[0.93349123,0.000004499495,0.06596352,0.00013838391,0.0001276324,0.00017807884,0.000008851629,0.00003266635,0.000055154425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975907,0.00017360636,0.0005111242,0.00068343844,0.00040088972,0.00064020057],"domain_scores_gemma":[0.9988878,0.00021996391,0.00021115462,0.0002939061,0.00022767094,0.00015954103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031259586,0.0003014305,0.0003553782,0.00021719176,0.0006109441,0.00022836191,0.00040890163,0.00014409823,0.000009465609],"category_scores_gemma":[0.000005632955,0.0003147293,0.00012359914,0.00072526466,0.000057265283,0.0016716385,0.0000027015149,0.00028692395,0.000008253004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009227034,0.0009035954,0.00008377638,0.00013071942,0.00012852144,0.0000786267,0.0042267083,0.6571122,0.064437866,0.00018630236,0.000052869458,0.27173615],"study_design_scores_gemma":[0.0024870087,0.00023845116,0.00044406607,0.00021540388,0.000019936631,0.00004632733,0.00030888166,0.9739112,0.021626065,0.00019545128,0.00007841855,0.0004287736],"about_ca_topic_score_codex":0.00006731243,"about_ca_topic_score_gemma":0.000028274584,"teacher_disagreement_score":0.88989407,"about_ca_system_score_codex":0.00027123402,"about_ca_system_score_gemma":0.0001583705,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W2111191694","doi":"10.1016/j.asoc.2005.01.005","title":"Adding more intelligence to the network routing problem: AntNet and Ga-agents","year":2005,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Routing (electronic design automation); Computer network","score_opus":0.017705559870154233,"score_gpt":0.2548444752339946,"score_spread":0.23713891536384038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111191694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012930331,0.00018321186,0.9814626,0.0018032053,0.00029663008,0.00087068847,0.000002900734,0.0004234777,0.0020269467],"genre_scores_gemma":[0.8889161,0.0000024575593,0.10862684,0.0017353088,0.0006264298,0.000030745585,0.0000050860854,0.000022921115,0.00003415241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971777,0.000085111074,0.000610882,0.0007859145,0.0004399013,0.00090047374],"domain_scores_gemma":[0.9983078,0.00044470243,0.00026841214,0.0006944035,0.00007447957,0.00021018856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013851171,0.0003103576,0.00032768093,0.000053187523,0.00073951244,0.00058823393,0.0014901605,0.00008014324,0.0000039242914],"category_scores_gemma":[0.000064383916,0.0002576069,0.00006088165,0.0007363874,0.00004840995,0.000201544,0.0012103824,0.00030682553,0.00014254544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007680739,0.000035320038,0.0014435392,0.00002347687,0.000058424266,0.000007321397,0.004458035,0.37227452,0.00021409527,0.07164598,0.00259363,0.547238],"study_design_scores_gemma":[0.00020041643,0.000020593305,0.0015866198,0.00012787952,0.000013633609,0.000026727268,0.00029947105,0.98218715,0.00014386555,0.00044639484,0.014563574,0.00038365813],"about_ca_topic_score_codex":0.000033750068,"about_ca_topic_score_gemma":0.000015539983,"teacher_disagreement_score":0.87598574,"about_ca_system_score_codex":0.000096061754,"about_ca_system_score_gemma":0.000040567495,"threshold_uncertainty_score":0.9999876},"labels":[],"label_agreement":null},{"id":"W2112054271","doi":"10.1109/mesa.2012.6275573","title":"Coverage control in multi-agent systems subject to communication delays","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multi-agent system; Collision avoidance; Distributed computing; Telecommunications network; Function (biology); Control (management); Collision; Field (mathematics); Computer network; Artificial intelligence; Computer security","score_opus":0.03142000465613951,"score_gpt":0.27013854438956164,"score_spread":0.23871853973342214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112054271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019944105,0.0010094107,0.97351694,0.00055691466,0.000897236,0.0013717395,0.000022569278,0.0002721505,0.0024089105],"genre_scores_gemma":[0.99424666,0.000011468247,0.0041609537,0.00071704865,0.00005348115,0.000298549,0.000013424167,0.000016544454,0.00048184203],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736834,0.0005546052,0.00061325135,0.00035851015,0.00039080158,0.00071448577],"domain_scores_gemma":[0.99764395,0.0002702904,0.00015498816,0.0014755484,0.000119298755,0.0003359031],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015526045,0.00023608621,0.00038244406,0.00021655338,0.000105070074,0.00028539164,0.0014934301,0.00010727093,0.000012676497],"category_scores_gemma":[0.00011741086,0.00021649263,0.0000831503,0.0005386798,0.000017168684,0.00092601724,0.0002685903,0.00017306235,0.0008676663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019056356,0.0042785783,0.47289583,0.0002518294,0.0004752752,0.000076942866,0.011951627,0.06171767,0.027581478,0.37830254,0.022268517,0.020009132],"study_design_scores_gemma":[0.0066790017,0.000101861384,0.10455414,0.0001421385,0.000021237118,0.000043273667,0.0003075838,0.8544943,0.00037388716,0.00003156083,0.032410607,0.00084046245],"about_ca_topic_score_codex":0.001511083,"about_ca_topic_score_gemma":0.00019890937,"teacher_disagreement_score":0.9743026,"about_ca_system_score_codex":0.00035130396,"about_ca_system_score_gemma":0.000047452686,"threshold_uncertainty_score":0.9999103},"labels":[],"label_agreement":null},{"id":"W2115757468","doi":"10.1109/cacsd.2011.6044531","title":"Distributed connectivity preservation of a team of single integrator agents subject to measurement error","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Range (aeronautics); Computer science; Function (biology); Integrator; Observational error; Control (management); Multi-agent system; Distance measurement; State (computer science); Class (philosophy); Distributed computing; Control theory (sociology); Algorithm; Mathematics; Artificial intelligence; Computer network; Engineering; Statistics","score_opus":0.12385616299535397,"score_gpt":0.26602726019623835,"score_spread":0.1421710972008844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115757468","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20145543,0.000013740018,0.7948158,0.00008170287,0.00023484003,0.0006639446,0.00006454414,0.000115576,0.0025544248],"genre_scores_gemma":[0.9959264,2.5697665e-7,0.0039016826,0.000028644918,0.000011964973,0.00005218044,0.000010722469,0.000008050248,0.000060139326],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99781764,0.00026052183,0.0005635953,0.00037704306,0.0007119092,0.0002693012],"domain_scores_gemma":[0.9979057,0.00006311523,0.00032027872,0.0006901231,0.00088344916,0.0001373542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011677026,0.00017396863,0.0003647005,0.0001258206,0.00003753821,0.00002853516,0.00087924604,0.00006704853,0.000034742807],"category_scores_gemma":[0.00093613926,0.00014840999,0.00011097715,0.00064438395,0.000031240645,0.00047565202,0.0002175563,0.0000713764,0.00001717469],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054691645,0.0070222886,0.15129082,0.00043710048,0.0008068852,0.000012633638,0.008793087,0.00050109916,0.7528677,0.051296655,0.014122295,0.0123025095],"study_design_scores_gemma":[0.0024855311,0.0015503274,0.14763883,0.0002608099,0.000059239082,0.000003973011,0.0005125444,0.07701123,0.7665145,0.00083165837,0.0025454052,0.00058597943],"about_ca_topic_score_codex":0.0010953451,"about_ca_topic_score_gemma":0.00042201698,"teacher_disagreement_score":0.7944709,"about_ca_system_score_codex":0.0001892845,"about_ca_system_score_gemma":0.000100237885,"threshold_uncertainty_score":0.6051984},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011080597289902242,"score_gpt":0.23139504022710367,"score_spread":0.22031444293720143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116066327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022865929,0.000020719117,0.97653437,0.00008706362,0.000082434024,0.00014461453,0.000049887585,0.0001307512,0.000084237836],"genre_scores_gemma":[0.9759953,0.0000016908467,0.023895936,0.00003280908,0.000012325666,0.000020428395,0.000016105378,0.000011119581,0.000014281436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986779,0.000043073727,0.00031277988,0.00039664083,0.00035634375,0.00021322367],"domain_scores_gemma":[0.9991791,0.00007612291,0.00013161026,0.00029141633,0.00021816912,0.00010354844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023271852,0.0001713278,0.0003019145,0.00038418453,0.00023702203,0.00020019586,0.00028866247,0.00007600226,0.000018237348],"category_scores_gemma":[0.0000028555705,0.00015063715,0.00007750744,0.0014747703,0.00007899703,0.00065407023,0.0000024508668,0.00024905676,9.2432055e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025055091,0.0000994328,0.000265969,0.000031991913,0.00025255638,0.000004948415,0.00026580392,0.94328994,0.013822304,0.000016083788,0.0000014837915,0.041924447],"study_design_scores_gemma":[0.00034894905,0.00003646217,0.00042213083,0.000045841338,0.00036278818,0.00001095228,0.000048883714,0.9769571,0.02158549,0.000005079319,0.000006758477,0.00016955455],"about_ca_topic_score_codex":0.000023748871,"about_ca_topic_score_gemma":0.000029541035,"teacher_disagreement_score":0.95312935,"about_ca_system_score_codex":0.000029829565,"about_ca_system_score_gemma":0.00008195131,"threshold_uncertainty_score":0.61428046},"labels":[],"label_agreement":null},{"id":"W2116485803","doi":"10.1115/1.4027892","title":"Distributed Algorithms for Stochastic Source Seeking With Mobile Robot Networks","year":2014,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":74,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Office of Naval Research; Defense Advanced Research Projects Agency; Semiconductor Research Corporation","keywords":"SIGNAL (programming language); Wireless sensor network; Mobile robot; Computer science; Robot; Field (mathematics); Wireless; Distributed algorithm; Real-time computing; Distributed computing; Algorithm; Artificial intelligence; Telecommunications; Mathematics; Computer network","score_opus":0.012087430791484327,"score_gpt":0.2136572677187839,"score_spread":0.20156983692729957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116485803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012806522,0.002751524,0.9931509,0.00019989633,0.0012520524,0.0012717437,0.000016666681,0.00006663812,0.0000099364615],"genre_scores_gemma":[0.9978669,0.000004890537,0.0014397594,0.00004737089,0.00042013812,0.0001550498,0.000004948284,0.000027814622,0.000033099546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667263,0.00032383561,0.0010092311,0.00037085568,0.0010824216,0.0005410517],"domain_scores_gemma":[0.99649507,0.0003222013,0.0012817936,0.00041426704,0.001208619,0.00027807656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035735515,0.00033692166,0.0008754315,0.00016132202,0.00021753757,0.0004814986,0.00069552433,0.000116430114,5.0617024e-7],"category_scores_gemma":[0.00016518905,0.0002478677,0.00018595072,0.00021555206,0.000043923792,0.00039352648,0.00003888277,0.0002310943,0.000001228912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038536687,0.00020358243,0.00078458065,0.00019029534,0.0011640778,0.0000151214435,0.00022617728,0.94612044,0.0033720005,0.0007121306,0.00022837443,0.04659784],"study_design_scores_gemma":[0.0077440403,0.0009461887,0.00059304497,0.0005246081,0.00020595777,0.00023173094,0.00015555992,0.9881431,0.0000033184488,0.000025132003,0.0011382175,0.00028909216],"about_ca_topic_score_codex":0.000023094246,"about_ca_topic_score_gemma":0.000013529718,"teacher_disagreement_score":0.99658626,"about_ca_system_score_codex":0.00028938337,"about_ca_system_score_gemma":0.000115328054,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W2116834924","doi":"10.1115/dscc2014-6284","title":"A Single-Leader Servo Approach to Multi-Agent Consensus Problems","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Servomechanism; Control theory (sociology); Constant (computer programming); Computer science; Consensus; Multi-agent system; State (computer science); Controller (irrigation); Group (periodic table); Feature (linguistics); Scheme (mathematics); Servo; Value (mathematics); Network topology; Tracking (education); Topology (electrical circuits); Control engineering; Artificial intelligence; Mathematics; Engineering; Control (management); Algorithm; Machine learning","score_opus":0.056878635162503494,"score_gpt":0.2387252989486103,"score_spread":0.1818466637861068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116834924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002423385,0.000038933784,0.96914536,0.002108499,0.00058909407,0.0010431288,0.0000069940334,0.0007282882,0.023916302],"genre_scores_gemma":[0.8167248,2.4722877e-7,0.17798099,0.0013728838,0.0001005001,0.00014561838,0.000008476865,0.00002413473,0.0036423574],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970825,0.00023990804,0.000525487,0.0009123091,0.0005138773,0.0007259184],"domain_scores_gemma":[0.9978319,0.00011940549,0.00013668029,0.0012774761,0.00020618844,0.00042834636],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069515273,0.00032273866,0.00038791972,0.00015289173,0.00013158191,0.00041245887,0.0014225013,0.000119684795,0.000011505391],"category_scores_gemma":[0.00016402836,0.0002740219,0.00012597874,0.0005553246,0.00004407651,0.00018220239,0.00036855525,0.00014905063,0.0010148393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087794084,0.010289995,0.0059165233,0.0010103952,0.00085997116,0.00007394698,0.017133588,0.07276969,0.13266465,0.45544392,0.11941315,0.18433638],"study_design_scores_gemma":[0.0018788319,0.00015231759,0.00092355197,0.000042496056,0.000013148947,0.000049829934,0.00017072563,0.9196939,0.0013885684,0.00011373343,0.07498967,0.00058325514],"about_ca_topic_score_codex":0.0001592526,"about_ca_topic_score_gemma":0.000033249285,"teacher_disagreement_score":0.8469242,"about_ca_system_score_codex":0.00011945208,"about_ca_system_score_gemma":0.000047597652,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W2116901449","doi":"10.1109/cdc.2010.5717154","title":"On the structural controllability of multi-agent systems subject to failure: A graph-theoretic approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Controllability; Network controllability; Graph; Computer science; Multi-agent system; Information flow; Topology (electrical circuits); Graph theory; Distributed computing; Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence; Applied mathematics","score_opus":0.013770821819844467,"score_gpt":0.23215421773718758,"score_spread":0.21838339591734313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116901449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39321396,0.00003549001,0.5997098,0.0011826963,0.0015549855,0.0027326385,0.000054006312,0.00025282576,0.0012635866],"genre_scores_gemma":[0.99375176,2.5378736e-7,0.0055880616,0.0001951926,0.000062777224,0.00024331581,0.0000050710005,0.000016561555,0.00013700001],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674815,0.0005106484,0.0006969096,0.0007594004,0.0007326673,0.0005522519],"domain_scores_gemma":[0.9962694,0.00070042186,0.00026292115,0.0021939985,0.00032356483,0.00024966494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017048168,0.00034898994,0.0005491904,0.0001522437,0.0001777635,0.00032419892,0.002338417,0.00014137864,0.00003357894],"category_scores_gemma":[0.0006376996,0.00020288695,0.00024286503,0.00072198163,0.00018819551,0.00018378711,0.0002463339,0.00037553426,0.00007242283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046260477,0.00015882605,0.0012033331,0.00006033372,0.000099386285,0.0000028853276,0.00059459615,0.0019232159,0.019138133,0.9756093,0.0007300323,0.00043368607],"study_design_scores_gemma":[0.00402919,0.00039917754,0.010936926,0.000051265077,0.000051240364,0.000056808527,0.00068042584,0.9729254,0.004986849,0.0042325296,0.000810926,0.00083925546],"about_ca_topic_score_codex":0.0003829375,"about_ca_topic_score_gemma":0.00011051795,"teacher_disagreement_score":0.9713768,"about_ca_system_score_codex":0.00005936959,"about_ca_system_score_gemma":0.0000820409,"threshold_uncertainty_score":0.82734895},"labels":[],"label_agreement":null},{"id":"W2117822362","doi":"10.1109/ccece.2012.6335060","title":"A targeting approach to disturbance rejection in multi-agent systems","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Disturbance (geology); Computer science; Multi-agent system; Biology; Artificial intelligence","score_opus":0.036516452525020913,"score_gpt":0.256269324865109,"score_spread":0.21975287234008808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117822362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068637454,0.00054255937,0.9850513,0.00010337303,0.0018802038,0.0009432311,0.000004204122,0.00031801427,0.0042933966],"genre_scores_gemma":[0.96739995,0.0000020683601,0.030837832,0.00010495125,0.00017163841,0.00031058543,0.000008940326,0.00001402586,0.0011499926],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977112,0.00020831476,0.00049364596,0.0005004823,0.00036739407,0.0007189919],"domain_scores_gemma":[0.9989041,0.00005128778,0.00012197194,0.00059063983,0.000070224494,0.0002617583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011182677,0.00020946347,0.00028287357,0.00017200132,0.00008911848,0.00022292824,0.0007267835,0.00008331446,0.0000019546278],"category_scores_gemma":[0.00012803318,0.0001841562,0.000058356694,0.00076636224,0.000010738518,0.00082001195,0.00021086246,0.00014454135,0.00026180703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008486166,0.007835965,0.3479145,0.00092540693,0.00028062685,0.000042747102,0.031790305,0.1849285,0.033298183,0.33501512,0.044418074,0.013465713],"study_design_scores_gemma":[0.00099382,0.000029355442,0.03307543,0.00006038639,0.00000499731,0.000020683945,0.0007276116,0.9513158,0.00018907989,0.0000050548506,0.013099823,0.0004779413],"about_ca_topic_score_codex":0.0006945865,"about_ca_topic_score_gemma":0.0000084868625,"teacher_disagreement_score":0.96053624,"about_ca_system_score_codex":0.00032080908,"about_ca_system_score_gemma":0.000023555389,"threshold_uncertainty_score":0.7509672},"labels":[],"label_agreement":null},{"id":"W2118686276","doi":"10.23919/acc.2004.1384702","title":"Unicycles in cyclic pursuit","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Modulo; Constant (computer programming); Control theory (sociology); Simple (philosophy); Stability (learning theory); Control (management); Computer science; Mathematics; Artificial intelligence; Combinatorics","score_opus":0.009759918421220166,"score_gpt":0.22493518538193927,"score_spread":0.2151752669607191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118686276","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065910466,0.00016903004,0.8987427,0.006103545,0.00081358146,0.00033992887,0.0000028975387,0.00049202924,0.027425878],"genre_scores_gemma":[0.99467945,0.0000025517352,0.004288347,0.0003271726,0.000027320775,0.0000181994,0.000001808007,0.0000049509204,0.00065020274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989261,0.000034394616,0.00022225994,0.00028716863,0.0002368107,0.00029329205],"domain_scores_gemma":[0.99930227,0.000032559117,0.000041738294,0.0005236238,0.000022144368,0.00007768776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000223628,0.00009949879,0.00013644077,0.00010835639,0.00003011283,0.00015467733,0.0011056066,0.000047884598,0.000012471716],"category_scores_gemma":[0.000033917102,0.00008840447,0.000042994565,0.0004108108,0.000017368407,0.00039720535,0.00015555683,0.00007874359,0.00045086694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039117617,0.00023151639,0.0042707627,0.000010544183,0.000018739272,0.00012962196,0.00043059848,0.004280721,0.0070415623,0.9628333,0.00087753154,0.019871209],"study_design_scores_gemma":[0.02960633,0.00049225736,0.47767827,0.000495451,0.000026559272,0.00026653547,0.0007153219,0.12398214,0.04082116,0.20154415,0.12084315,0.0035286783],"about_ca_topic_score_codex":0.0005186716,"about_ca_topic_score_gemma":0.0002607939,"teacher_disagreement_score":0.928769,"about_ca_system_score_codex":0.00011776728,"about_ca_system_score_gemma":0.00005728712,"threshold_uncertainty_score":0.57951325},"labels":[],"label_agreement":null},{"id":"W2118858228","doi":"10.1109/cdc.2004.1428776","title":"Feasibility for formation stabilization of multiple unicycles","year":2004,"lang":"en","type":"article","venue":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Graph; Computer science; Control (management); Stability (learning theory); Artificial intelligence; Theoretical computer science","score_opus":0.05078867004406356,"score_gpt":0.287568104569138,"score_spread":0.23677943452507444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118858228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35174474,0.00006923035,0.64460814,0.00042668873,0.00088503584,0.0017902917,0.00019362403,0.0001530505,0.00012918036],"genre_scores_gemma":[0.987748,0.00006362848,0.011378494,0.00033826937,0.00011233014,0.0002371482,0.00004340435,0.000030371759,0.0000482989],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957316,0.00023626738,0.0013824431,0.0010938161,0.0008685622,0.00068733015],"domain_scores_gemma":[0.9948947,0.0008962764,0.0007565456,0.0014588572,0.001622541,0.00037110256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011936739,0.0005431007,0.00089976145,0.00034128092,0.0003055601,0.00042847212,0.001234907,0.00033209712,0.000019015322],"category_scores_gemma":[0.0011607134,0.000490372,0.00029736094,0.00044364543,0.00017723256,0.0012237475,0.00009742218,0.000222914,0.00008179215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006033418,0.003934444,0.010485215,0.0008961795,0.00041030132,0.000038346298,0.0033207089,0.07988937,0.5380013,0.11544649,0.0019253033,0.23961891],"study_design_scores_gemma":[0.02390178,0.00089419365,0.00663645,0.000487528,0.00007413199,0.000014915465,0.0001986421,0.92849344,0.016449725,0.021654557,0.00036463627,0.00083000277],"about_ca_topic_score_codex":0.00012561,"about_ca_topic_score_gemma":0.00024168003,"teacher_disagreement_score":0.8486041,"about_ca_system_score_codex":0.00036431433,"about_ca_system_score_gemma":0.0004596021,"threshold_uncertainty_score":0.9997548},"labels":[],"label_agreement":null},{"id":"W2119026135","doi":"10.1177/0278364910397621","title":"Biologically inspired collective comparisons by robotic swarms","year":2011,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; University of British Columbia","funders":"","keywords":"Stigmergy; Swarm robotics; Robot; Implementation; Computer science; Swarm behaviour; Artificial intelligence; Autonomous system (mathematics); Mobile robot; Human–computer interaction","score_opus":0.19540501740468738,"score_gpt":0.3673123335716116,"score_spread":0.1719073161669242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119026135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055166893,0.00037648302,0.97753334,0.010123447,0.0015924816,0.00028667875,0.0000120414115,0.000033692242,0.0045251306],"genre_scores_gemma":[0.983226,0.000057557896,0.015661474,0.00018631757,0.00017907233,0.0000075231405,0.0000028182676,0.000009513114,0.0006697379],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963233,0.00061563315,0.0006256261,0.00021303522,0.0018200886,0.00040235586],"domain_scores_gemma":[0.9956235,0.00077249634,0.00038530177,0.00037998694,0.0026679933,0.00017070597],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0030394467,0.00013374846,0.00027234937,0.00031754767,0.00019659584,0.0003332351,0.005681955,0.00007843278,0.000038620958],"category_scores_gemma":[0.0007667829,0.0000837629,0.00014526003,0.0005529541,0.00023713184,0.00033225634,0.00064915995,0.0007384335,0.000096927426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017668054,0.0049614883,0.026171261,0.00002891522,0.0047857943,0.0014457613,0.011496055,0.120559596,0.041241508,0.29953712,0.4731659,0.014839794],"study_design_scores_gemma":[0.010779001,0.004450278,0.052322343,0.0005933091,0.00012300216,0.002085581,0.0027152246,0.8106699,0.021336535,0.06959835,0.023922907,0.0014035685],"about_ca_topic_score_codex":0.00011755338,"about_ca_topic_score_gemma":0.000012009387,"teacher_disagreement_score":0.9777093,"about_ca_system_score_codex":0.0004282073,"about_ca_system_score_gemma":0.00046023823,"threshold_uncertainty_score":0.9996978},"labels":[],"label_agreement":null},{"id":"W2119741378","doi":"10.1109/tsp.2008.2010376","title":"Accelerated Distributed Average Consensus via Localized Node State Prediction","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Convergence (economics); Node (physics); Rate of convergence; Mathematical optimization; Mathematics; Upper and lower bounds; Mixing (physics); Focus (optics); Computer science; Matrix (chemical analysis); State (computer science); Eigenvalues and eigenvectors; Convex optimization; Regular polygon; Algorithm; Applied mathematics","score_opus":0.03272412673507932,"score_gpt":0.2475680932402552,"score_spread":0.21484396650517587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119741378","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017378632,0.00007913927,0.9798226,0.00025571042,0.0005003758,0.000461403,0.00029923618,0.0010476846,0.00015523854],"genre_scores_gemma":[0.99627,0.000010448615,0.003108978,0.00018355504,0.00005111652,0.00008411079,0.000038078804,0.000035074445,0.0002186644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695426,0.00022320259,0.0007370659,0.0007571488,0.00070675754,0.00062156917],"domain_scores_gemma":[0.9984465,0.00013536564,0.00027517832,0.00046578917,0.0004056161,0.00027154424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028529362,0.00039203206,0.00041431826,0.00024788664,0.00097603374,0.0002965308,0.000595868,0.00016139237,0.000047564416],"category_scores_gemma":[0.0000071079803,0.0003894585,0.00016132479,0.0011483338,0.00014903204,0.00073969114,0.000004663565,0.00048386175,0.00013246559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053422665,0.001126486,0.00015769164,0.00015842164,0.00027859083,0.00053097337,0.0015511479,0.7395652,0.05176733,0.000024039979,0.0007515591,0.20355433],"study_design_scores_gemma":[0.0024937033,0.00012687666,0.00022603813,0.000114789706,0.000031664254,0.0002770275,0.000018133947,0.9546586,0.04085434,0.000082415725,0.0007130947,0.00040328782],"about_ca_topic_score_codex":0.00007759582,"about_ca_topic_score_gemma":0.0000074221225,"teacher_disagreement_score":0.9788913,"about_ca_system_score_codex":0.00026701554,"about_ca_system_score_gemma":0.00031442073,"threshold_uncertainty_score":0.99985576},"labels":[],"label_agreement":null},{"id":"W2120006592","doi":"10.1109/allerton.2009.5394786","title":"Optimization and analysis of distributed averaging with memory","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Node (physics); Eigenvalues and eigenvectors; Rate of convergence; Linearization; Convergence (economics); Matrix (chemical analysis); Computer science; Mathematical optimization; Convex function; Current (fluid); Mathematics; Quadratic equation; Topology (electrical circuits); Algorithm; Applied mathematics; Regular polygon; Key (lock)","score_opus":0.006450700128524374,"score_gpt":0.20682348636436637,"score_spread":0.200372786235842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120006592","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007672703,0.000037396945,0.9905828,0.00038871454,0.00001960115,0.00010326494,0.0000144405385,0.00009579293,0.0010852517],"genre_scores_gemma":[0.97465533,0.0000027496933,0.02514572,0.00008226596,0.0000049767877,0.0000021073524,0.000053965014,0.000001848744,0.00005102041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991965,0.000036531204,0.00019692717,0.00023718592,0.00019742419,0.00013538385],"domain_scores_gemma":[0.99934286,0.000035684603,0.00011143566,0.00033801855,0.00011133234,0.000060663904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014485036,0.00008864936,0.00023159235,0.00018648549,0.000040494793,0.00008318571,0.00024055083,0.000025953492,0.000010684599],"category_scores_gemma":[0.000015488074,0.000068443864,0.000040525676,0.0012195421,0.000017453507,0.00030706014,0.000030419214,0.0000318504,7.973713e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012126866,0.00007779532,0.0055679926,0.0000067749543,0.00048960495,0.000009487489,0.00022832393,0.9731142,0.00047917129,0.010500319,0.00010038188,0.009413823],"study_design_scores_gemma":[0.00040152582,0.000044335684,0.022885684,0.0000073494903,0.0001356868,0.0000024854594,0.000019924937,0.97601193,0.00035957422,0.000027708804,0.0000149379875,0.00008883814],"about_ca_topic_score_codex":0.000030393077,"about_ca_topic_score_gemma":0.000005660441,"teacher_disagreement_score":0.96698266,"about_ca_system_score_codex":0.000021242902,"about_ca_system_score_gemma":0.00001747049,"threshold_uncertainty_score":0.27910596},"labels":[],"label_agreement":null},{"id":"W2121172849","doi":"10.1109/acc.2009.5160268","title":"An LMI approach to optimal consensus seeking in multi-agent systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Constraint (computer-aided design); Linear matrix inequality; Controller (irrigation); Computer science; Consensus; Set (abstract data type); Function (biology); Control theory (sociology); Control (management); Multi-agent system; Mathematics","score_opus":0.04119318078778788,"score_gpt":0.2809746080291362,"score_spread":0.23978142724134832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121172849","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042946327,0.00010316501,0.9502728,0.0004128072,0.0005363222,0.001087656,0.000008919963,0.00048764865,0.004144362],"genre_scores_gemma":[0.90592,6.0242695e-7,0.09320343,0.0003931721,0.0000666749,0.000061003117,0.000009263278,0.000012100466,0.00033370024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99701345,0.00027970484,0.00063324324,0.00088392076,0.00047155868,0.0007181325],"domain_scores_gemma":[0.99819165,0.00005780081,0.00012122353,0.001121873,0.000117266405,0.0003901915],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008370054,0.00029554652,0.00043066556,0.00028844416,0.00009562703,0.00056167523,0.0014198276,0.0001223188,0.0000022161216],"category_scores_gemma":[0.000054222444,0.0002727556,0.00007622643,0.0007052937,0.000018752253,0.00033129938,0.000111347785,0.0001764661,0.00014004642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119899625,0.0041443193,0.004349603,0.000109362176,0.000105779174,0.00046821497,0.0082693575,0.7832663,0.0434465,0.13230865,0.0044485615,0.018963426],"study_design_scores_gemma":[0.0012634265,0.00014040744,0.008058529,0.000038626815,0.0000040942305,0.000059314563,0.00056420395,0.9883015,0.00014052648,0.000007742244,0.001049001,0.0003725915],"about_ca_topic_score_codex":0.000336937,"about_ca_topic_score_gemma":0.000019704039,"teacher_disagreement_score":0.86297375,"about_ca_system_score_codex":0.0002182627,"about_ca_system_score_gemma":0.00007426586,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W2122209864","doi":"10.1109/acc.2007.4283029","title":"Satellite Formation Flying Controller Design Using an Optimal Decentralized Approach","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Control theory (sociology); Decentralised system; Controller (irrigation); Computer science; Bandwidth (computing); Control engineering; Optimal control; Optimal design; Open-loop controller; Optimization problem; Control (management); Mathematical optimization; Engineering; Mathematics; Closed loop; Telecommunications; Algorithm","score_opus":0.03972176163009968,"score_gpt":0.2643074338744373,"score_spread":0.2245856722443376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122209864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43521205,0.00018667387,0.5579487,0.0010463423,0.00031016883,0.0033162204,0.00007533033,0.00032051263,0.0015839848],"genre_scores_gemma":[0.9712551,0.00008381946,0.027091304,0.0010089789,0.00019976319,0.00018999074,0.0000030481278,0.00011024638,0.000057738274],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9899711,0.00021507867,0.003039378,0.0018267535,0.0025408766,0.002406813],"domain_scores_gemma":[0.981386,0.00072599144,0.01035971,0.0009936729,0.005798911,0.00073568785],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.004757445,0.0014402707,0.003537297,0.0006705074,0.0009350141,0.0011734494,0.008843937,0.00023118091,0.000011064073],"category_scores_gemma":[0.0012107934,0.001043613,0.0010783805,0.0033697642,0.003051056,0.0032069928,0.0008299542,0.0011001639,0.000006639881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006370344,0.0009787715,0.024612248,0.00033302786,0.0013006123,0.0000029029022,0.004175204,0.0013073259,0.8523892,0.05486811,0.00020608997,0.053456124],"study_design_scores_gemma":[0.014221619,0.001645078,0.031675715,0.00067071826,0.0011159721,0.00020634719,0.010641916,0.8973226,0.037887976,0.0019837148,0.00040386958,0.0022244751],"about_ca_topic_score_codex":0.00083083886,"about_ca_topic_score_gemma":0.000013443511,"teacher_disagreement_score":0.8960153,"about_ca_system_score_codex":0.0005268708,"about_ca_system_score_gemma":0.0006393364,"threshold_uncertainty_score":0.99986345},"labels":[],"label_agreement":null},{"id":"W2123000508","doi":"10.48550/arxiv.1209.1076","title":"Communication/Computation Tradeoffs in Consensus-Based Distributed Optimization","year":2012,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Speedup; Computer science; Computation; Scalability; Metric (unit); Minification; Theoretical computer science; Graph; Distributed algorithm; Distributed computing; Algorithm; Parallel computing","score_opus":0.05713692857953871,"score_gpt":0.19331782853346577,"score_spread":0.13618089995392707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123000508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033944115,0.00008260686,0.9643165,0.00041459233,0.00015822667,0.00027973947,0.000023735805,0.00021541868,0.0005650773],"genre_scores_gemma":[0.98952734,0.0000075815424,0.010144369,0.00012119939,0.000017089624,0.0000017599993,0.00013722648,0.0000090245585,0.00003438048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985337,0.00041104137,0.00025335018,0.00033539176,0.00009702305,0.0003694782],"domain_scores_gemma":[0.9985628,0.00031914198,0.000186433,0.0006250337,0.00015221436,0.00015437555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046198838,0.00015947958,0.00018360489,0.00019767796,0.00013045371,0.00007055823,0.0007275469,0.000101106336,0.00000938972],"category_scores_gemma":[0.00010050035,0.000193597,0.000069692964,0.0011816475,0.00006967062,0.00072760414,0.000107947475,0.00014166292,0.000054090826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019273439,0.00021638298,0.00871742,0.000006530071,0.00001479911,0.000015874082,0.00011597545,0.94500804,0.000024217456,0.04547714,0.00018621945,0.00019815931],"study_design_scores_gemma":[0.0015150522,0.000019488092,0.0059757433,0.000025051253,0.000015758145,0.0000041137896,0.00011771467,0.9914252,0.000059654343,0.000245912,0.00038954878,0.00020673685],"about_ca_topic_score_codex":0.000103410246,"about_ca_topic_score_gemma":0.000014706607,"teacher_disagreement_score":0.9555833,"about_ca_system_score_codex":0.00029038085,"about_ca_system_score_gemma":0.00007423375,"threshold_uncertainty_score":0.78946567},"labels":[],"label_agreement":null},{"id":"W2123114355","doi":"10.1109/fuzzy.2011.6007488","title":"Decentralized fuzzy fault tolerant control for multiple satellites attitude synchronization","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Fault tolerance; Attitude control; Fuzzy logic; Computer science; Control engineering; Actuator; Synchronization (alternating current); Fault (geology); Controller (irrigation); Decentralised system; Fuzzy control system; Control system; Engineering; Control (management); Distributed computing; Channel (broadcasting); Artificial intelligence","score_opus":0.03091458630793778,"score_gpt":0.23859426786147095,"score_spread":0.20767968155353317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123114355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003134332,0.0003369213,0.99222165,0.00023230055,0.0006948675,0.001423904,0.000046510177,0.0004937339,0.0014157922],"genre_scores_gemma":[0.93907887,0.000013970576,0.05998095,0.00035932937,0.00006380719,0.00020074498,0.000037503778,0.000018788594,0.00024601343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799114,0.00010267059,0.0005107046,0.0005408038,0.00028070938,0.0005739739],"domain_scores_gemma":[0.9984295,0.00025829842,0.00018003627,0.00064504787,0.0003046551,0.00018248182],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034850417,0.00024577446,0.00035454024,0.00008319887,0.00014654882,0.00019364417,0.0009242368,0.00010953566,0.000058256494],"category_scores_gemma":[0.00019121211,0.00020878708,0.00015914366,0.00023440486,0.000034719083,0.0005822055,0.0000674489,0.00006422672,0.00015689447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009717703,0.0025344277,0.110370435,0.00045870687,0.0014220426,0.00008554057,0.0065006725,0.0050664325,0.034641057,0.6423817,0.00935331,0.18621387],"study_design_scores_gemma":[0.0097364,0.00016523756,0.0083474275,0.0000435585,0.0000505701,0.000011975791,0.00005066815,0.9619876,0.0072737955,0.0014983822,0.01028935,0.000544993],"about_ca_topic_score_codex":0.00018946627,"about_ca_topic_score_gemma":0.00008158557,"teacher_disagreement_score":0.9569212,"about_ca_system_score_codex":0.00009348699,"about_ca_system_score_gemma":0.000068647394,"threshold_uncertainty_score":0.851409},"labels":[],"label_agreement":null},{"id":"W2124197222","doi":"10.1109/acc.2007.4283095","title":"Control and Analysis of Energetic Swarm Systems","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Swarm behaviour; Kinetic energy; Particle swarm optimization; Control theory (sociology); Trajectory; Multi-swarm optimization; Computer science; Controller (irrigation); Energy (signal processing); Physics; Control (management); Classical mechanics; Algorithm; Artificial intelligence; Biology","score_opus":0.010146249287468106,"score_gpt":0.229430592623702,"score_spread":0.2192843433362339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124197222","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9274529,0.0004528687,0.061785836,0.003170678,0.0005600352,0.002664242,0.00046207279,0.00025166076,0.00319968],"genre_scores_gemma":[0.99778885,0.0000868585,0.0008033262,0.0007665274,0.0001418597,0.0001781254,0.0000024785697,0.000075508855,0.0001564867],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.9905252,0.00013235876,0.0032722983,0.0017843562,0.0024917268,0.0017940681],"domain_scores_gemma":[0.9780985,0.0013229962,0.012152076,0.0011604268,0.006640302,0.00062568794],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0036818786,0.0012765626,0.005215434,0.0012651279,0.00042937003,0.00060370617,0.0075864135,0.00020750733,0.0000091207],"category_scores_gemma":[0.0015935415,0.00090768747,0.0014202396,0.0064611253,0.0047871172,0.0010077156,0.0008910763,0.0008762098,0.0000034074833],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020712845,0.0005080775,0.35302216,0.00044595412,0.0072283195,0.0000029141238,0.0012816128,0.00037562495,0.43835393,0.18695188,0.00038252576,0.009375734],"study_design_scores_gemma":[0.014116424,0.0024577524,0.5836057,0.0010871388,0.009435561,0.00008876622,0.008651583,0.35763964,0.01796389,0.0015351034,0.00080231356,0.0026161394],"about_ca_topic_score_codex":0.0033664145,"about_ca_topic_score_gemma":0.00006746035,"teacher_disagreement_score":0.42039004,"about_ca_system_score_codex":0.00025220794,"about_ca_system_score_gemma":0.0005170313,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2125343668","doi":"10.1109/acc.2008.4586576","title":"Performance analysis for a class of decentralized control systems","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Upper and lower bounds; Scalar (mathematics); Mathematical optimization; Computer science; Controller (irrigation); Optimization problem; Lyapunov function; Decentralised system; Function (biology); Control theory (sociology); Hierarchical database model; Mathematics; Control (management); Nonlinear system","score_opus":0.02428491561066054,"score_gpt":0.23515915821567676,"score_spread":0.21087424260501622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125343668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413915,0.00019626842,0.91351193,0.00012542451,0.00031152155,0.0007207433,0.00004297338,0.00014130505,0.0008106565],"genre_scores_gemma":[0.9960786,0.000021336145,0.0031116179,0.000058907233,0.0000288584,0.00013945128,0.000011750559,0.0000069053444,0.00054255174],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982294,0.000086081986,0.00058589847,0.00034991332,0.00036275017,0.00038596903],"domain_scores_gemma":[0.9983823,0.00020347959,0.00027847377,0.0006945096,0.00032194654,0.0001192929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003840857,0.00015878586,0.0006138278,0.00021604045,0.000107415355,0.000050672617,0.00083370646,0.00007064173,0.000008249373],"category_scores_gemma":[0.0000520415,0.0001309844,0.00031266632,0.0008904544,0.000044541735,0.0003243634,0.000039079037,0.00004391957,0.00001708919],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048866885,0.0008887983,0.5875784,0.0006185887,0.0094418125,0.00003789257,0.0012854825,0.24073648,0.009722755,0.13552444,0.009630667,0.0040459787],"study_design_scores_gemma":[0.0028440596,0.000077146506,0.015565171,0.000010951884,0.00015057359,0.000010943267,0.000016986802,0.9774785,0.00042430125,0.0000047850735,0.0032624523,0.00015413616],"about_ca_topic_score_codex":0.00013333814,"about_ca_topic_score_gemma":0.000009300612,"teacher_disagreement_score":0.91193944,"about_ca_system_score_codex":0.00005712492,"about_ca_system_score_gemma":0.00008081763,"threshold_uncertainty_score":0.53413886},"labels":[],"label_agreement":null},{"id":"W2126031217","doi":"10.1109/aim.2010.5695798","title":"Connectivity control of mobile multi-robot networks","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Collision avoidance; Computer science; Mobile robot; Distributed computing; Controller (irrigation); Robot; Range (aeronautics); Field (mathematics); Computer network; Collision; Artificial intelligence; Engineering; Mathematics","score_opus":0.009965560065230625,"score_gpt":0.23876976737524647,"score_spread":0.22880420731001583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126031217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019463213,0.00006466676,0.9771859,0.000122050486,0.0013656163,0.0005681879,0.000011520129,0.0002553818,0.0009634593],"genre_scores_gemma":[0.98820305,0.000001213586,0.011240812,0.00013140948,0.000091105205,0.00008891185,0.000002630981,0.000009623814,0.00023124446],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849206,0.00010763524,0.00038998996,0.0004043377,0.000238935,0.00036705297],"domain_scores_gemma":[0.9981542,0.0003359834,0.00020692695,0.00095241494,0.00020208747,0.00014837328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061857514,0.00017375374,0.00037825597,0.00006363819,0.00006820606,0.00008963068,0.0010213726,0.00014005673,0.000060591155],"category_scores_gemma":[0.00012273548,0.00014816852,0.00013262645,0.00025748883,0.00007374563,0.0003580137,0.00013398958,0.00026394892,0.000055753673],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009632761,0.0027783597,0.071753316,0.00008922757,0.0005631853,0.00006756217,0.00067767315,0.08751873,0.3927964,0.2917043,0.0031618685,0.14879309],"study_design_scores_gemma":[0.0023425291,0.000072020644,0.010749921,0.000006971981,0.000009618625,0.0000104055125,0.00001406775,0.9823016,0.0026620782,0.000056638077,0.0015802645,0.00019386905],"about_ca_topic_score_codex":0.00023002742,"about_ca_topic_score_gemma":0.00020361734,"teacher_disagreement_score":0.9687398,"about_ca_system_score_codex":0.000017558126,"about_ca_system_score_gemma":0.000052950843,"threshold_uncertainty_score":0.60421365},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028120688258505114,"score_gpt":0.25401039228674066,"score_spread":0.22588970402823555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126877763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032745458,0.00014662935,0.99109286,0.00078387,0.001986353,0.0017966629,0.00030640044,0.00046917968,0.00014349267],"genre_scores_gemma":[0.96988046,0.000018687431,0.028424218,0.0005542805,0.00013463137,0.0002762668,0.000036573176,0.000052202948,0.00062264904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967837,0.000107722124,0.00077938946,0.00083069236,0.00056125,0.00093729346],"domain_scores_gemma":[0.9977735,0.0003677226,0.00022717979,0.0008942658,0.0004109234,0.00032638593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009847269,0.0004532904,0.00047811496,0.00032437296,0.00055401924,0.00026315896,0.0009417714,0.00017669969,0.000039529066],"category_scores_gemma":[0.000022560189,0.00045918225,0.0004045255,0.00048124208,0.000057045207,0.0006352893,0.0000074284394,0.00044872615,0.00018552419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008764549,0.0017226003,0.000020508343,0.00014047934,0.0012661585,0.00008420843,0.00081076974,0.72824955,0.023051076,0.20809622,0.0013621945,0.0343198],"study_design_scores_gemma":[0.004125015,0.0007907488,0.000015058449,0.00009100705,0.00011915286,0.00008239815,0.00024176066,0.9056557,0.081801504,0.000837241,0.0054644714,0.00077595806],"about_ca_topic_score_codex":0.00003182856,"about_ca_topic_score_gemma":0.00007303821,"teacher_disagreement_score":0.96660596,"about_ca_system_score_codex":0.0007172395,"about_ca_system_score_gemma":0.00021267045,"threshold_uncertainty_score":0.999786},"labels":[],"label_agreement":null},{"id":"W2127440744","doi":"10.1142/s0219477507004057","title":"EMERGENT FLUCTUATIONS IN THE TRAJECTORIES OF AGENT COLLECTIVES","year":2007,"lang":"en","type":"article","venue":"Fluctuation and Noise Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collective behavior; Statistical physics; Coupling (piping); Collective motion; Trajectory; Computer science; Work (physics); Dynamical systems theory; Robotics; Selection (genetic algorithm); Complex system; Artificial intelligence; Physics; Robot; Sociology; Engineering; Quantum mechanics","score_opus":0.014661829305471625,"score_gpt":0.2501035468125191,"score_spread":0.23544171750704748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127440744","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5955633,0.00012085337,0.39823994,0.0050692745,0.00032812887,0.00036351063,0.0000050669664,0.000028566186,0.00028135453],"genre_scores_gemma":[0.99792194,0.000009662224,0.0009664444,0.0009888643,0.00004869231,0.000024828281,0.0000081735925,0.0000036349265,0.00002777725],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99889094,0.00011492198,0.0003216494,0.00019435155,0.0003018667,0.00017626435],"domain_scores_gemma":[0.9993518,0.00019955772,0.00010726046,0.00025120145,0.00005365313,0.00003653058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077076955,0.00009654707,0.0001231443,0.00016862819,0.00009540022,0.00005430959,0.00030643356,0.000029769906,0.0000087262815],"category_scores_gemma":[0.00008597199,0.00007435271,0.000041592426,0.00058051094,0.00005075181,0.0002113574,0.000028790537,0.00006978654,0.0000054741176],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014671516,0.0006334908,0.02614639,0.00013782448,0.00021900705,0.00006079624,0.11202325,0.0036163868,0.64162403,0.14149451,0.020617578,0.053280007],"study_design_scores_gemma":[0.00141717,0.00006995178,0.96790916,0.000030268704,0.000019787776,0.000009709495,0.00142522,0.017747764,0.00565326,0.0006817365,0.0047777556,0.00025823427],"about_ca_topic_score_codex":0.00008370062,"about_ca_topic_score_gemma":0.00009823927,"teacher_disagreement_score":0.94176275,"about_ca_system_score_codex":0.000044770015,"about_ca_system_score_gemma":0.000023247529,"threshold_uncertainty_score":0.30320156},"labels":[],"label_agreement":null},{"id":"W2128198741","doi":"10.1109/ssp.2011.5967669","title":"Consensus-based distributed unscented particle filter","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Particle filter; Kalman filter; Gaussian; Computer science; Computation; Tracking (education); Ensemble Kalman filter; Filter (signal processing); Control theory (sociology); Distributed computing; Extended Kalman filter; Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Physics","score_opus":0.04659177398172286,"score_gpt":0.23344637624644227,"score_spread":0.1868546022647194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128198741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034346126,0.000031985528,0.95868677,0.0011059085,0.00046312943,0.000355616,0.000071005525,0.00087770453,0.004061779],"genre_scores_gemma":[0.9899589,2.995821e-7,0.00897988,0.0006199232,0.000024057503,0.00003514418,0.00003099151,0.000010989083,0.00033984642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981808,0.00013997463,0.00039369843,0.00045876254,0.00029715107,0.00052961207],"domain_scores_gemma":[0.99841607,0.0000998175,0.000116583054,0.0009576118,0.0001690469,0.00024087251],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026580767,0.00019919865,0.00022137543,0.000048251237,0.00009748046,0.00011582702,0.0008856047,0.000072891715,0.00031697348],"category_scores_gemma":[0.00009119619,0.00016985089,0.00011144662,0.00044417044,0.000068688496,0.00018352896,0.00011994477,0.00009773,0.00080325553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051085243,0.0046535465,0.20950758,0.00015275198,0.00067139644,0.0012061673,0.0020322965,0.0008153842,0.042625245,0.5839627,0.13257769,0.021284414],"study_design_scores_gemma":[0.0045219283,0.00021413242,0.050680142,0.00004489484,0.000031997788,0.000026266185,0.00008146193,0.8386703,0.0916202,0.00079030904,0.012566518,0.0007518176],"about_ca_topic_score_codex":0.00017647375,"about_ca_topic_score_gemma":0.000027626475,"teacher_disagreement_score":0.9556127,"about_ca_system_score_codex":0.00005648244,"about_ca_system_score_gemma":0.000079867736,"threshold_uncertainty_score":0.9999747},"labels":[],"label_agreement":null},{"id":"W2130226132","doi":"10.1109/icca.2010.5524132","title":"A survey on intelligent interaction and cooperative control of multi-robot systems","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Robot; Popularity; Swarm robotics; Robotics; Artificial intelligence; Swarm intelligence; Computer science; Swarm behaviour; Control (management); Human–computer interaction; Mobile robot; Robot control; Control engineering; Engineering; Machine learning","score_opus":0.03940883477780898,"score_gpt":0.28952476021085277,"score_spread":0.2501159254330438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130226132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035509694,0.000068009635,0.9611221,0.00011549626,0.0019617104,0.00065664866,0.00005275033,0.0000946029,0.000418986],"genre_scores_gemma":[0.9988753,0.0000037881969,0.00063794985,0.000069010675,0.00003668246,0.00003626567,0.000010274129,0.0000081341395,0.00032257635],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984206,0.0003153405,0.0004394156,0.0003851068,0.00023280515,0.0002067474],"domain_scores_gemma":[0.9982564,0.000555061,0.00020592476,0.00049298204,0.00036902094,0.00012061157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008348999,0.00017637189,0.00034109794,0.00011388203,0.00005976414,0.00019800883,0.00042565534,0.00008875851,0.0000116738765],"category_scores_gemma":[0.0003126226,0.00013714592,0.00004499629,0.00018834541,0.000053827385,0.00029605752,0.00007476889,0.000177408,0.000059148373],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085482054,0.0040228986,0.101206794,0.0003191356,0.0015292981,0.00007284948,0.0050172466,0.036570303,0.41382873,0.3406942,0.004909183,0.090974554],"study_design_scores_gemma":[0.0016836186,0.00024433856,0.0394821,0.000052116127,0.000008525891,0.0000129709115,0.00012157034,0.9522158,0.005255845,0.0000043981236,0.00070112076,0.00021758693],"about_ca_topic_score_codex":0.0018893668,"about_ca_topic_score_gemma":0.00090853806,"teacher_disagreement_score":0.9633656,"about_ca_system_score_codex":0.0000322604,"about_ca_system_score_gemma":0.000041692034,"threshold_uncertainty_score":0.55926484},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01780270788303639,"score_gpt":0.28856791370612045,"score_spread":0.27076520582308405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130758224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010947855,0.00040337816,0.99376684,0.0034035563,0.000068723646,0.00040791504,0.00004328038,0.00025080878,0.0005607301],"genre_scores_gemma":[0.8989746,0.000007743725,0.10030389,0.00013439072,0.00006536115,0.000095515046,0.00021058743,0.000010016017,0.00019787096],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859524,0.00019516816,0.00029869715,0.00029761708,0.00020981839,0.00040344364],"domain_scores_gemma":[0.99896336,0.00031854052,0.00010660045,0.00034049983,0.00008472416,0.00018627498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056563516,0.00014657153,0.00020280172,0.00008280414,0.00014456603,0.00014610146,0.00020995965,0.00007976417,0.000048777863],"category_scores_gemma":[0.00017700072,0.00013210764,0.000030929852,0.00044370085,0.000040172443,0.00033466745,0.00011803949,0.0001837632,0.00003204278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033677963,0.0014454329,0.7864236,0.00007116,0.000052876243,0.00001565293,0.00063835195,0.10548153,0.00021866201,0.10256374,0.0016635382,0.0013917646],"study_design_scores_gemma":[0.00087246223,0.000019641284,0.008378536,0.000008766193,0.000008228959,0.00001233091,0.00011581968,0.96281093,0.000122036996,0.000023715495,0.02745827,0.00016927728],"about_ca_topic_score_codex":0.00007294921,"about_ca_topic_score_gemma":0.000034864224,"teacher_disagreement_score":0.89787984,"about_ca_system_score_codex":0.00004945957,"about_ca_system_score_gemma":0.00004308132,"threshold_uncertainty_score":0.53871936},"labels":[],"label_agreement":null},{"id":"W2131023055","doi":"10.1109/tsp.2010.2046593","title":"Greedy Gossip With Eavesdropping","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Computer science; Network topology; Gossip protocol; Greedy algorithm; Wireless network; Wireless sensor network; Node (physics); Wireless; Computer network; Convergence (economics); Distributed computing; Algorithm; Telecommunications","score_opus":0.014206337176002748,"score_gpt":0.2324290776428321,"score_spread":0.21822274046682935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131023055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909557,0.000024937191,0.98429316,0.0003500652,0.0004459693,0.00022347072,0.000006558893,0.00046315242,0.0012831213],"genre_scores_gemma":[0.98699665,5.703334e-7,0.012355,0.00016593972,0.000094504016,0.000052539322,9.0168123e-7,0.000024574645,0.00030933614],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818736,0.000046618425,0.00029748166,0.00054453884,0.0004955879,0.00042842224],"domain_scores_gemma":[0.9989757,0.00007255468,0.00014594178,0.0004473251,0.00017355269,0.00018494304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002606056,0.00024963162,0.00022349921,0.00019232833,0.000532406,0.00056074024,0.0007150739,0.0001105999,0.000038866907],"category_scores_gemma":[0.0000025307274,0.0002089153,0.000081726816,0.0006431897,0.0000921808,0.0010924704,0.0000023662803,0.0006179849,0.00010232209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008769246,0.00043327795,0.00008063718,0.00011616199,0.00009646605,0.000093505,0.0010775318,0.015412564,0.18545048,0.0007449684,0.00006182902,0.7963449],"study_design_scores_gemma":[0.0026895904,0.00041125045,0.0004651115,0.00044519277,0.00008107902,0.0003966902,0.00017304032,0.8579031,0.13361199,0.00036757492,0.0023353864,0.001119935],"about_ca_topic_score_codex":0.000031842657,"about_ca_topic_score_gemma":0.00005989537,"teacher_disagreement_score":0.97408706,"about_ca_system_score_codex":0.000048789,"about_ca_system_score_gemma":0.000204159,"threshold_uncertainty_score":0.85193187},"labels":[],"label_agreement":null},{"id":"W2131279287","doi":"10.1109/tsmcb.2009.2026730","title":"Optimal Consensus Seeking in a Network of Multiagent Systems: An LMI Approach","year":2009,"lang":"en","type":"letter","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Multi-agent system; Consensus; Controller (irrigation); Graph; Function (biology); Set (abstract data type); Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.027244280402909625,"score_gpt":0.23608421679552896,"score_spread":0.20883993639261933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131279287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005171901,0.004951307,0.9656766,0.0059623006,0.008171008,0.0059159882,0.00066874985,0.00067579816,0.0028063566],"genre_scores_gemma":[0.9823535,0.00035696256,0.0039879894,0.0057392865,0.0021755532,0.0006516766,0.00017125248,0.00024084584,0.004322908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9900349,0.0016589655,0.0027599516,0.0021904213,0.001659017,0.0016967856],"domain_scores_gemma":[0.994639,0.0005265168,0.001365085,0.0025633834,0.00043911877,0.00046694418],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.001356,0.0014077678,0.0023223066,0.00064132595,0.0002686964,0.00090624724,0.0018997776,0.0017421409,0.000007737147],"category_scores_gemma":[0.000015138057,0.0014722337,0.00042317365,0.0008904442,0.00031063848,0.00022657674,0.0000305406,0.0024490089,0.00005370491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013383788,0.0010966023,0.00008143338,0.0018314351,0.0007538482,0.000813618,0.0018422408,0.89533025,0.00012355925,0.0014376276,0.09295833,0.003597203],"study_design_scores_gemma":[0.0031316027,0.000846109,0.00015468476,0.002449157,0.00035580562,0.0005545448,0.00040571665,0.86157465,0.000068848596,0.000030044786,0.12845257,0.0019762525],"about_ca_topic_score_codex":0.0013589436,"about_ca_topic_score_gemma":0.000107961736,"teacher_disagreement_score":0.9771816,"about_ca_system_score_codex":0.00042852643,"about_ca_system_score_gemma":0.00025280585,"threshold_uncertainty_score":0.99986726},"labels":[],"label_agreement":null},{"id":"W2131672510","doi":"10.1109/cdc.2006.377475","title":"High-Performance Decentralized Control for Formation Flying with Leader-Follower Structure","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Decentralised system; A priori and a posteriori; Controller (irrigation); Stability (learning theory); Closeness; Computer science; Control (management); Control engineering; Mathematical optimization; Engineering; Mathematics","score_opus":0.007828028945212359,"score_gpt":0.19816364220234614,"score_spread":0.19033561325713377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131672510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11598028,0.00005074422,0.88146156,0.0006248064,0.00037000453,0.0009581768,0.000037881076,0.00030204005,0.00021447579],"genre_scores_gemma":[0.9690676,0.000001196765,0.030071734,0.00026831523,0.00009892553,0.00009915745,0.00006481049,0.000014721914,0.00031354514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836373,0.000038562237,0.00038786803,0.00034073697,0.00034921858,0.0005198742],"domain_scores_gemma":[0.99902517,0.000079635116,0.00019769963,0.00044110874,0.00018555419,0.000070819566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016539438,0.00022500122,0.00029185234,0.000081693186,0.0002380524,0.00029042753,0.0005590151,0.00008622429,0.0000159232],"category_scores_gemma":[0.000013459567,0.00016373226,0.00006387059,0.00024612166,0.000023831113,0.001390174,0.00002548811,0.00008048146,0.000018961233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001590127,0.000571968,0.020933151,0.0008396559,0.0006609506,0.000044011264,0.0012330081,0.14162572,0.104181185,0.59811413,0.036140304,0.094065756],"study_design_scores_gemma":[0.0143918265,0.00022028002,0.006961359,0.000066733206,0.000047908983,0.000038123613,0.000047031757,0.9489679,0.020534134,0.00071732176,0.0074477,0.00055971846],"about_ca_topic_score_codex":0.00010409216,"about_ca_topic_score_gemma":0.00009857788,"teacher_disagreement_score":0.8530873,"about_ca_system_score_codex":0.0000990128,"about_ca_system_score_gemma":0.000046510137,"threshold_uncertainty_score":0.66768074},"labels":[],"label_agreement":null},{"id":"W2132275966","doi":"10.1007/s10514-006-5942-5","title":"A control-design-based solution to robotic ecology: Autonomy of achieving cooperative behavior from a high-level astronaut command","year":2006,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science; Convergence (economics); MIMO; Invariant (physics); Set (abstract data type); Control (management); Class (philosophy); Task (project management); Control theory (sociology); Mathematical optimization; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.022876848204244238,"score_gpt":0.23284832923302148,"score_spread":0.20997148102877725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132275966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048040677,0.00007187175,0.94782275,0.001106958,0.00055230514,0.001808008,0.000198698,0.00031538398,0.000083371706],"genre_scores_gemma":[0.8931031,1.4663514e-7,0.105732724,0.0002856143,0.00010078354,0.00047460964,0.00011473005,0.000030837684,0.00015740866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642694,0.0005356244,0.0010354195,0.0008730266,0.00037601875,0.00075297174],"domain_scores_gemma":[0.9973557,0.00063572556,0.0005358679,0.0009516475,0.00031134122,0.0002097187],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056973274,0.00045272676,0.0009020944,0.0002522576,0.00027186007,0.00022139044,0.001227641,0.00021038699,0.00003062043],"category_scores_gemma":[0.00008920229,0.0004643496,0.00017226268,0.00041767943,0.000107436186,0.00043978944,0.00019145943,0.0002420246,0.00014815619],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006604068,0.0006558406,0.007763583,0.000011231163,0.000110488385,0.000040758245,0.00017620131,0.95302486,0.028980903,0.0054354547,0.0005872848,0.0031473378],"study_design_scores_gemma":[0.0054238974,0.0006044939,0.35867512,0.00008928788,0.00016650776,0.0000072842176,0.000015287489,0.63026524,0.0037894577,0.00011065142,0.00021382951,0.00063898606],"about_ca_topic_score_codex":0.0036248083,"about_ca_topic_score_gemma":0.0005092987,"teacher_disagreement_score":0.8450625,"about_ca_system_score_codex":0.00071016763,"about_ca_system_score_gemma":0.00084638613,"threshold_uncertainty_score":0.99978083},"labels":[],"label_agreement":null},{"id":"W2132362649","doi":"10.1109/acc.2009.5160273","title":"A game theory approach to multi-agent team cooperation","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Bargaining problem; Nash equilibrium; Pareto principle; Minification; Game theory; Computer science; Set (abstract data type); Complete information; Function (biology); Controller (irrigation); Cooperative game theory; Pareto optimal; Multi-objective optimization; Mathematics; Mathematical economics","score_opus":0.02246269880055458,"score_gpt":0.25168777764690015,"score_spread":0.22922507884634558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132362649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020844403,0.00003150714,0.9501397,0.0004110415,0.00025491056,0.00070791354,0.0000028734676,0.00040755412,0.04596007],"genre_scores_gemma":[0.92813563,5.746305e-7,0.06002901,0.0020073059,0.000059980783,0.000056668898,0.000012455097,0.000006741336,0.009691615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830574,0.00016200182,0.00031411785,0.000544428,0.00030202058,0.00037169713],"domain_scores_gemma":[0.99878985,0.000034430774,0.000058720616,0.00077368476,0.00012409927,0.00021923744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041687,0.00019099013,0.00021006512,0.00010710872,0.00008653774,0.00033821492,0.00092982047,0.000069224596,0.000015485526],"category_scores_gemma":[0.000057980036,0.00015663274,0.00007422144,0.00038353165,0.000012129465,0.00041683094,0.00009620818,0.000106544496,0.0005866995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003736785,0.0016691394,0.00029514296,0.000014288434,0.00006357983,0.000011398615,0.006771247,0.010097724,0.008980211,0.8778381,0.013493046,0.080728754],"study_design_scores_gemma":[0.0031448295,0.00040709428,0.013576036,0.00004042298,0.000020126161,0.000049007762,0.00024193441,0.9379977,0.0030682336,0.0012504563,0.039239567,0.0009645745],"about_ca_topic_score_codex":0.00013604987,"about_ca_topic_score_gemma":0.000053994492,"teacher_disagreement_score":0.9279,"about_ca_system_score_codex":0.0001706463,"about_ca_system_score_gemma":0.000085295826,"threshold_uncertainty_score":0.7541031},"labels":[],"label_agreement":null},{"id":"W2133968725","doi":"","title":"Multi-hop Greedy Gossip with Eavesdropping","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Network topology; Computer science; Hop (telecommunications); Wireless sensor network; Eavesdropping; Wireless network; Wireless; Computer network; Topology (electrical circuits); Mathematics; Telecommunications","score_opus":0.01994474078367278,"score_gpt":0.23965100453816873,"score_spread":0.21970626375449595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133968725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054624905,0.00007389812,0.9818767,0.0019251846,0.0002076148,0.00028878704,0.0000021438527,0.0006289923,0.009534219],"genre_scores_gemma":[0.9173314,0.0000012349802,0.07935503,0.00081021345,0.00006447411,0.00000980963,0.000002961399,0.0000074901122,0.0024173823],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983828,0.000053623848,0.00026169376,0.0004979755,0.00035375773,0.00045014676],"domain_scores_gemma":[0.9987663,0.000035663375,0.00010212505,0.00081022026,0.000110393434,0.00017529418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002155435,0.00020293018,0.00022683528,0.00009346679,0.00012463174,0.00032843454,0.001016046,0.000059724316,0.00001775222],"category_scores_gemma":[0.000026618107,0.00014949455,0.00006222579,0.00044046616,0.000027140975,0.0006481242,0.000073717354,0.00012090491,0.00028726665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013860471,0.0023260554,0.016117437,0.000090726004,0.00049119414,0.0013998434,0.004152455,0.0042501814,0.1261405,0.35412422,0.019490385,0.4712784],"study_design_scores_gemma":[0.0057608713,0.00062896067,0.09817086,0.0001474967,0.000024757584,0.000197051,0.00016798981,0.87646085,0.0033737437,0.0004359299,0.013465417,0.0011660676],"about_ca_topic_score_codex":0.00008358562,"about_ca_topic_score_gemma":0.000035575595,"teacher_disagreement_score":0.91186893,"about_ca_system_score_codex":0.00006324551,"about_ca_system_score_gemma":0.000058311452,"threshold_uncertainty_score":0.60962105},"labels":[],"label_agreement":null},{"id":"W2134183500","doi":"10.1142/s2301385014400111","title":"Nonuniform Deployment of Autonomous Agents in Harbor-Like Environments","year":2014,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Defence Research and Development Canada","funders":"","keywords":"Software deployment; Computer science; Homogeneous; Autonomous agent; Distributed computing; Computer security; Artificial intelligence; Mathematics","score_opus":0.0171720926045099,"score_gpt":0.2267510840536324,"score_spread":0.2095789914491225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134183500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22959936,0.00067071,0.7518492,0.00036764043,0.0059391856,0.0028971562,0.00006535866,0.00042865268,0.008182745],"genre_scores_gemma":[0.9983656,0.000006094421,0.00043156947,0.000084295585,0.00007686582,0.000120768425,0.000012442106,0.00002525879,0.00087710016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968859,0.00030304128,0.0009707179,0.0005993139,0.0006630046,0.0005780273],"domain_scores_gemma":[0.99797654,0.00009641499,0.00046005094,0.0012510782,0.00003462227,0.00018126656],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010224631,0.00028919935,0.0005678372,0.00026870097,0.000063651285,0.00012095877,0.0014040094,0.00013836971,0.0000072846533],"category_scores_gemma":[0.000043187105,0.00027892005,0.00011507875,0.00032325892,0.000040245326,0.000393476,0.0002514754,0.00013734374,0.000299182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031342878,0.0070622857,0.27006146,0.0027667058,0.0017458717,0.0005901522,0.010651889,0.169717,0.060983386,0.41160688,0.021448772,0.04305214],"study_design_scores_gemma":[0.0039926204,0.0003001663,0.033039663,0.0003631004,0.000022218393,0.00001798374,0.00011910485,0.8635276,0.0015937486,0.00009835592,0.09626179,0.0006636695],"about_ca_topic_score_codex":0.000518044,"about_ca_topic_score_gemma":0.000030860865,"teacher_disagreement_score":0.7687662,"about_ca_system_score_codex":0.00032756786,"about_ca_system_score_gemma":0.00004401062,"threshold_uncertainty_score":0.9999663},"labels":[],"label_agreement":null},{"id":"W2135266562","doi":"10.1109/ecc.2015.7330786","title":"An integral based event triggered control scheme of distributed network systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Scheme (mathematics); Computer science; Control theory (sociology); Control (management); Lyapunov function; Event (particle physics); Consensus; Distributed computing; Multi-agent system; Mathematics; Artificial intelligence; Nonlinear system","score_opus":0.02477236184406884,"score_gpt":0.2613898496825306,"score_spread":0.23661748783846176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135266562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068341936,0.00041782204,0.9891117,0.00031018228,0.0014124045,0.000853899,0.0001645604,0.00044591323,0.00044927417],"genre_scores_gemma":[0.991875,5.576404e-7,0.00746335,0.00014174377,0.00018681788,0.00009613791,0.00013581428,0.00001742965,0.0000831387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965048,0.0005730741,0.0009311024,0.00056623464,0.0007792597,0.00064556854],"domain_scores_gemma":[0.99673593,0.00018518626,0.00045006681,0.001403,0.0006616551,0.0005641569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00166313,0.00031468214,0.0007146502,0.000106092666,0.00006757668,0.0002517034,0.0016910643,0.00015800951,0.000013056731],"category_scores_gemma":[0.00017672541,0.00025587913,0.00018546697,0.0007316419,0.00006144015,0.0005719646,0.00008315061,0.00016720116,0.000055149063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011613519,0.0026661092,0.039226603,0.00026339045,0.0008971268,0.00016248516,0.00045372607,0.46570966,0.0059602493,0.3966454,0.07768797,0.00916593],"study_design_scores_gemma":[0.005435722,0.00037944177,0.00074899656,0.00007502086,0.000022407035,0.0000060098764,0.00010089477,0.9896659,0.00022249276,0.00019208943,0.0028526995,0.00029828888],"about_ca_topic_score_codex":0.00038816707,"about_ca_topic_score_gemma":0.00001731782,"teacher_disagreement_score":0.98504084,"about_ca_system_score_codex":0.00021306016,"about_ca_system_score_gemma":0.00038389617,"threshold_uncertainty_score":0.99998933},"labels":[],"label_agreement":null},{"id":"W2135837266","doi":"10.1109/icra.2011.5979683","title":"Coverage enhancement of mobile multi-agent networks while preserving global connectivity","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Controller (irrigation); Distributed computing; Collision avoidance; Layer (electronics); Computer network; Real-time computing; Collision","score_opus":0.03810053805750362,"score_gpt":0.252613199028861,"score_spread":0.21451266097135735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135837266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050620783,0.00026141322,0.93290305,0.000016364831,0.0008087989,0.00079925184,0.000023004946,0.00018830785,0.014379017],"genre_scores_gemma":[0.9883192,0.00001486975,0.01103547,0.00008462577,0.000038930986,0.00015597855,0.0000066804837,0.000008518451,0.00033568102],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978209,0.00017960198,0.00054351747,0.00057205826,0.0003832825,0.0005006163],"domain_scores_gemma":[0.9981746,0.00007938844,0.00029140618,0.001093384,0.0001894408,0.00017179151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054123875,0.0002379343,0.00038689762,0.000038154012,0.00008700786,0.00007856093,0.0013504714,0.00009983057,0.00037965705],"category_scores_gemma":[0.000042645835,0.00021677851,0.00014307906,0.00036707846,0.000041837677,0.0005609814,0.0006865879,0.000101763006,0.00006718585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005434377,0.018247085,0.4107501,0.00083260285,0.002620769,0.00034192522,0.009784616,0.0640302,0.025794271,0.24603345,0.02329797,0.19772361],"study_design_scores_gemma":[0.0026508316,0.00039031907,0.04656903,0.000082327075,0.000028139691,0.000007640475,0.00010199048,0.93233055,0.015149422,0.00028136765,0.0018606088,0.00054777967],"about_ca_topic_score_codex":0.0012193222,"about_ca_topic_score_gemma":0.00017093455,"teacher_disagreement_score":0.9376985,"about_ca_system_score_codex":0.00016669152,"about_ca_system_score_gemma":0.00006598639,"threshold_uncertainty_score":0.88399714},"labels":[],"label_agreement":null},{"id":"W2136047551","doi":"10.1017/s0263574707003670","title":"Full formation control for autonomous helicopter groups","year":2007,"lang":"en","type":"article","venue":"Robotica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Nonlinear system; Helicopter rotor; Robust control; Control engineering; Sliding mode control; Computer science; Control (management); Engineering; Rotor (electric); Control system; Artificial intelligence; Physics","score_opus":0.01514606857550548,"score_gpt":0.24534750673570635,"score_spread":0.23020143816020086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136047551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008925209,0.00006852262,0.99447787,0.0015297733,0.0007312761,0.0007521875,0.000013798043,0.00029619064,0.0012378811],"genre_scores_gemma":[0.9699804,6.968676e-7,0.029003147,0.0005845731,0.00020564755,0.000060388033,0.000017121365,0.0000117566415,0.00013625876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984648,0.000039539256,0.00043333758,0.0003017165,0.00023614611,0.00052441173],"domain_scores_gemma":[0.9987706,0.00027522512,0.00014986037,0.0005008274,0.00015481905,0.00014867148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008331421,0.00015668661,0.00022825159,0.000099068675,0.00013027972,0.00018896646,0.00061159575,0.00009888505,0.000007547681],"category_scores_gemma":[0.000073731644,0.00014692197,0.00012204911,0.00016294006,0.000020468235,0.00061147875,0.00005514924,0.00008649355,0.00023730037],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038291552,0.00044405923,0.0002998415,0.00021536747,0.00020654165,0.00005534643,0.0011748173,0.014939038,0.02057474,0.8626769,0.0066460534,0.09238435],"study_design_scores_gemma":[0.0035576469,0.0003117435,0.0017647785,0.000030935113,0.00003089522,0.00004975716,0.00004155207,0.97691244,0.0013574648,0.0015172611,0.014071809,0.0003537029],"about_ca_topic_score_codex":0.0000074920886,"about_ca_topic_score_gemma":0.000018638082,"teacher_disagreement_score":0.9690879,"about_ca_system_score_codex":0.00013127724,"about_ca_system_score_gemma":0.000035302695,"threshold_uncertainty_score":0.5991304},"labels":[],"label_agreement":null},{"id":"W2136179181","doi":"10.1109/icma.2005.1626826","title":"Distributed formation control of robots with directive visual measurement","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Holonomic; Mobile robot; Robot; Computer science; Perspective (graphical); Motion control; Control (management); Motion (physics); Point (geometry); Artificial intelligence; Computer vision; Robot control; Robot kinematics; Control theory (sociology); Mathematics","score_opus":0.010173536666926568,"score_gpt":0.2054635722767146,"score_spread":0.19529003560978803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136179181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038903276,0.000064251246,0.9925798,0.00027113155,0.000101370686,0.00051827024,0.000032749813,0.0001973256,0.0023447669],"genre_scores_gemma":[0.9976223,3.3036923e-7,0.0021947278,0.000030130544,0.000032103508,0.0000532209,0.000029318455,0.0000062062027,0.000031626383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818695,0.00010837359,0.00040234398,0.00025761663,0.00077129016,0.0002734036],"domain_scores_gemma":[0.99869585,0.000051396397,0.00026387937,0.0003167197,0.00061246153,0.000059667775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041659037,0.00016102979,0.00027330578,0.0000763873,0.000064894666,0.00008685563,0.00036249368,0.000045492103,0.0000051620755],"category_scores_gemma":[0.000032636322,0.000119704266,0.000063556356,0.00036267866,0.000030601765,0.000641839,0.000037421658,0.00005559809,0.000017921144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012022817,0.0055840174,0.04785463,0.00046690824,0.0015714037,0.0001167936,0.0010570805,0.1667706,0.23694168,0.46056566,0.017535055,0.060333878],"study_design_scores_gemma":[0.008425292,0.00054227305,0.09456934,0.0001224717,0.0000706058,0.000026168935,0.00008950724,0.84356374,0.050264664,0.0005795459,0.0011965362,0.00054986315],"about_ca_topic_score_codex":0.0003489086,"about_ca_topic_score_gemma":0.00016506067,"teacher_disagreement_score":0.99373204,"about_ca_system_score_codex":0.00020376967,"about_ca_system_score_gemma":0.000063771906,"threshold_uncertainty_score":0.48813984},"labels":[],"label_agreement":null},{"id":"W2136804526","doi":"10.1109/acc.2008.4586979","title":"A dual-network health state estimator and decision policy for unmanned combat teams","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Estimator; Computer science; Scheme (mathematics); Dual (grammatical number); Wireless sensor network; Path (computing); Computer network; State (computer science); Wireless; Routing (electronic design automation); Motion planning; Operations research; Computer security; Engineering; Telecommunications; Artificial intelligence","score_opus":0.01735085752775423,"score_gpt":0.28444845796635776,"score_spread":0.26709760043860353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136804526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017806137,0.00034318658,0.97693795,0.0031789048,0.00034405562,0.00085766625,0.000031698924,0.00029933776,0.00020106694],"genre_scores_gemma":[0.73827076,0.00007909365,0.25885743,0.0017523426,0.00022367723,0.00008836345,0.000017854518,0.000023558414,0.0006869013],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980484,0.00006509155,0.00045635505,0.00048820555,0.0002958533,0.0006460629],"domain_scores_gemma":[0.9984597,0.0003768437,0.00017343857,0.00055227923,0.00009881197,0.0003389046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005263022,0.00019891077,0.00037333948,0.00010771557,0.00044490985,0.00014748413,0.00042471295,0.000050116698,0.0000024068427],"category_scores_gemma":[0.00011650907,0.00016641473,0.000069396374,0.00041544987,0.0000519956,0.00033870456,0.00020564895,0.000072820825,0.000037882637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020486029,0.00038604537,0.0073312386,0.00014397914,0.00015356582,0.00008157676,0.0016668623,0.008502855,0.00011678135,0.22095017,0.2764044,0.48405766],"study_design_scores_gemma":[0.0064145927,0.00075537985,0.017961811,0.00015571513,0.000006760464,0.0003111434,0.00004402946,0.9074884,0.00006748051,0.024021853,0.04212951,0.00064330356],"about_ca_topic_score_codex":0.00051139964,"about_ca_topic_score_gemma":0.000080695856,"teacher_disagreement_score":0.89898556,"about_ca_system_score_codex":0.00012979384,"about_ca_system_score_gemma":0.00034479587,"threshold_uncertainty_score":0.67861956},"labels":[],"label_agreement":null},{"id":"W2137424105","doi":"","title":"A hybrid and switching framework for cooperative actuator fault estimation of formation flying satellites in deep space","year":2009,"lang":"en","type":"article","venue":"Asian Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control reconfiguration; Actuator; Mode (computer interface); Fault detection and isolation; Fault (geology); NASA Deep Space Network; Computer science; Control theory (sociology); Estimation; Scheme (mathematics); Topology (electrical circuits); Engineering; Control (management); Mathematics; Aerospace engineering; Artificial intelligence","score_opus":0.014774812512746503,"score_gpt":0.2630785207174429,"score_spread":0.2483037082046964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137424105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035261516,0.00016687562,0.9608678,0.0023262885,0.00008660726,0.001033962,0.000018484217,0.000070380185,0.00016808623],"genre_scores_gemma":[0.9279566,0.000009336679,0.07176558,0.00015545762,0.000023154784,0.000068078705,0.000011542356,0.000006200765,0.0000040415694],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984493,0.00012541859,0.00051527657,0.00036086477,0.00022215913,0.00032697528],"domain_scores_gemma":[0.99852157,0.00046798305,0.0003363763,0.00033321878,0.0002482763,0.000092586335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004468806,0.00020878913,0.0004181052,0.00015506225,0.000121851306,0.00029765314,0.00040115463,0.00008719127,0.0000021149622],"category_scores_gemma":[0.00078127853,0.00020098727,0.00005393108,0.00019121375,0.000024698398,0.0012128823,0.0000298321,0.00016399092,0.0000041926514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010257368,0.00007305359,0.00017617113,0.00007150317,0.000032635835,0.000007257842,0.0054227095,0.0017015315,0.0136885755,0.40690157,0.000007752881,0.57181466],"study_design_scores_gemma":[0.0019169544,0.00018241616,0.0027478642,0.0002567451,0.000014533221,0.000009870997,0.0002941597,0.96564597,0.00334551,0.02535176,0.000028303899,0.00020590865],"about_ca_topic_score_codex":0.000021002536,"about_ca_topic_score_gemma":0.000018495957,"teacher_disagreement_score":0.96394444,"about_ca_system_score_codex":0.00006604766,"about_ca_system_score_gemma":0.00008753977,"threshold_uncertainty_score":0.8196023},"labels":[],"label_agreement":null},{"id":"W2137535742","doi":"10.1109/icassp.2011.5946726","title":"Distributed auxiliary particle filters using selective gossip","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":60,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Overhead (engineering); Particle filter; Computer science; Focus (optics); Tracking (education); Wireless sensor network; Filter (signal processing); State (computer science); Particle (ecology); Distributed computing; Algorithm; Computer network; Computer vision","score_opus":0.06131306427120396,"score_gpt":0.24856835054628829,"score_spread":0.1872552862750843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137535742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0867183,0.000031971966,0.9081582,0.00012016763,0.00040243377,0.0002767478,0.000029920582,0.0004995452,0.0037627309],"genre_scores_gemma":[0.9844722,4.968677e-7,0.015111016,0.00016205967,0.000038616556,0.000022027869,0.000008926573,0.0000113302285,0.00017328636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982118,0.00013514575,0.00033460645,0.00049114006,0.00027305936,0.0005542424],"domain_scores_gemma":[0.9987915,0.00006077976,0.000119523196,0.0006740935,0.00014231652,0.0002117598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027587332,0.00019757064,0.00022303603,0.000049594513,0.0001579378,0.00013912177,0.0008726174,0.00007320851,0.00007452186],"category_scores_gemma":[0.00006787683,0.00017614168,0.00010028801,0.0006330538,0.00005458036,0.00080968754,0.00021406088,0.00011612324,0.00020804896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044230715,0.004093647,0.18566279,0.00017408797,0.0019118657,0.0011768921,0.020435126,0.0039952686,0.20116746,0.49650824,0.042117305,0.04231502],"study_design_scores_gemma":[0.0013549268,0.00012654066,0.036180805,0.00002769343,0.00003322867,0.00005585979,0.00021254993,0.89711416,0.061812185,0.0016249979,0.0008831557,0.00057389453],"about_ca_topic_score_codex":0.000518186,"about_ca_topic_score_gemma":0.000022789032,"teacher_disagreement_score":0.89775395,"about_ca_system_score_codex":0.00014917052,"about_ca_system_score_gemma":0.000090465466,"threshold_uncertainty_score":0.7182849},"labels":[],"label_agreement":null},{"id":"W2137899307","doi":"10.1109/ccece.2009.5090286","title":"A distributed and cooperative supervisory estimation of multi-agent systems - Part I: Framework","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Supervisor; Supervisory control; Process (computing); Set (abstract data type); Computer science; LTI system theory; Estimation; Multi-agent system; Control (management); Invariant (physics); Mathematical optimization; Control engineering; Control theory (sociology); Linear system; Engineering; Mathematics; Artificial intelligence; Systems engineering","score_opus":0.03438094105008653,"score_gpt":0.2631466034294495,"score_spread":0.22876566237936297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137899307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01615284,0.000725243,0.98104763,0.0005651977,0.00040161354,0.0006263631,0.00008631626,0.00022354814,0.00017124868],"genre_scores_gemma":[0.9821857,0.000019471505,0.017407728,0.00012420517,0.00003547687,0.0000357647,0.000053098927,0.0000064854253,0.00013202985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813557,0.00018690278,0.0005716184,0.00045184526,0.00034073458,0.0003133248],"domain_scores_gemma":[0.9986447,0.00017348593,0.00018198212,0.0006142963,0.00022134704,0.00016417268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036615235,0.00022589325,0.00040570507,0.000084604384,0.00010975696,0.00023947383,0.0004987875,0.00013471968,0.000008919354],"category_scores_gemma":[0.00023111192,0.00019129063,0.000060693317,0.00041991682,0.000052353575,0.00052760425,0.00009020179,0.00010583008,0.000028680937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007003009,0.0016327525,0.0029534905,0.00029458472,0.00035276043,0.00007281033,0.00394189,0.119265065,0.0051077176,0.8046323,0.006342376,0.055334248],"study_design_scores_gemma":[0.00084972905,0.00017015878,0.00665827,0.00017121369,0.000016687622,0.000016215283,0.0001735151,0.9899296,0.00065120513,0.0002615717,0.0008497057,0.0002521132],"about_ca_topic_score_codex":0.00007904778,"about_ca_topic_score_gemma":0.0000037554232,"teacher_disagreement_score":0.9660329,"about_ca_system_score_codex":0.000063801104,"about_ca_system_score_gemma":0.00005480314,"threshold_uncertainty_score":0.7800605},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.023719615198221317,"score_gpt":0.25698104312524067,"score_spread":0.23326142792701934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138296912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03747059,0.00022977417,0.9603499,0.0006119135,0.00087304704,0.00016644115,0.00003369075,0.000014756919,0.00024987143],"genre_scores_gemma":[0.99144685,0.00003398439,0.008259622,0.00010301067,0.000120498946,0.000004780956,0.0000054224324,0.000006195078,0.000019660187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975196,0.00012574605,0.0012947983,0.00010479092,0.00080545596,0.00014957394],"domain_scores_gemma":[0.99523234,0.0003817232,0.0017237006,0.00022495317,0.0023566494,0.000080639955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006135959,0.00011982193,0.0003627929,0.00032023428,0.00003781139,0.000039503608,0.0012281439,0.00006404084,0.000017849981],"category_scores_gemma":[0.00040775706,0.000106045634,0.00024091179,0.00018029902,0.000075303826,0.0010246177,0.00005534454,0.00015650723,0.0000043699856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008012171,0.0017296886,0.08626487,0.0000484231,0.0022449198,0.00016008454,0.0031998775,0.8004357,0.034243975,0.044245947,0.00090033165,0.025724947],"study_design_scores_gemma":[0.009675617,0.00030947445,0.07525266,0.00014994953,0.00004703627,0.0003348754,0.00006198101,0.91012233,0.0020787132,0.00037212129,0.0014077056,0.00018753567],"about_ca_topic_score_codex":0.000029805504,"about_ca_topic_score_gemma":0.0000075670914,"teacher_disagreement_score":0.9539762,"about_ca_system_score_codex":0.00008869788,"about_ca_system_score_gemma":0.00022109845,"threshold_uncertainty_score":0.43244153},"labels":[],"label_agreement":null},{"id":"W2140606146","doi":"10.1109/acc.2007.4283039","title":"A Cooperative Model Predictive Control Technique for Spacecraft Formation Flying","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Robustness (evolution); Control theory (sociology); Spacecraft; Model predictive control; Decentralised system; Computer science; Control engineering; Estimator; Controller (irrigation); Engineering; Control (management); Mathematics; Artificial intelligence","score_opus":0.016436121662322157,"score_gpt":0.2515185527585576,"score_spread":0.23508243109623544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140606146","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10273706,0.00007639709,0.8791715,0.0058263503,0.00031939583,0.007923674,0.00060643005,0.00036247654,0.002976699],"genre_scores_gemma":[0.9884534,0.000031914657,0.007745541,0.0016265562,0.00020930411,0.0016241161,0.000003798015,0.000107776024,0.00019763068],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9914632,0.00009509184,0.0026556407,0.0017087888,0.002030016,0.0020472698],"domain_scores_gemma":[0.97777903,0.0011313284,0.009633016,0.00093039527,0.009986782,0.0005394537],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0037729545,0.0013669131,0.0033416774,0.00063408486,0.0009428858,0.00070424384,0.0074406974,0.00024410497,0.000005838993],"category_scores_gemma":[0.0023635665,0.0009895487,0.0011958017,0.0026831802,0.0031729848,0.0023137545,0.0007423632,0.0011065776,0.0000048302054],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004222262,0.00040360205,0.013085292,0.0003413427,0.0010343611,0.0000010890283,0.0022060708,0.00077060604,0.85764986,0.1123126,0.0010899041,0.0068830214],"study_design_scores_gemma":[0.012611397,0.0026015993,0.011917895,0.0010235659,0.0009789262,0.00008037744,0.0076465225,0.8813547,0.07372719,0.0059629534,0.0003264444,0.0017684177],"about_ca_topic_score_codex":0.0004550606,"about_ca_topic_score_gemma":0.00004370894,"teacher_disagreement_score":0.8857163,"about_ca_system_score_codex":0.000560086,"about_ca_system_score_gemma":0.0008998111,"threshold_uncertainty_score":0.99990815},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010356150581613058,"score_gpt":0.2368769162883277,"score_spread":0.22652076570671464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140947684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030759025,0.000119776174,0.9351619,0.005810334,0.00015740901,0.00033691266,0.000017956574,0.00058504776,0.027051624],"genre_scores_gemma":[0.95982087,0.0000016473581,0.039848156,0.00011112517,0.000022978982,0.000019280267,0.0000038059213,0.0000041562917,0.00016796915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990243,0.000041679374,0.00035334734,0.000120068325,0.00027529793,0.00018535783],"domain_scores_gemma":[0.9990635,0.00010253074,0.00014103731,0.0005710077,0.00006127699,0.000060665778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022243666,0.0000792602,0.00015240058,0.00007695131,0.000052246676,0.00007604714,0.0008770538,0.000035384503,0.000031692016],"category_scores_gemma":[0.000068490146,0.0000716382,0.000059149956,0.00023889406,0.000027217546,0.0005924868,0.0001178891,0.000042557964,0.0003954897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018250206,0.00026455204,0.0003599254,0.00008531561,0.000094285926,0.000003207676,0.0018074241,0.0007365621,0.0056341705,0.81569606,0.008942954,0.16637369],"study_design_scores_gemma":[0.0006443764,0.00003848494,0.009493478,0.000057680263,0.00001571602,0.000015802776,0.00006209995,0.9464329,0.00554996,0.0028112384,0.034690037,0.00018823087],"about_ca_topic_score_codex":0.000011176927,"about_ca_topic_score_gemma":0.000008215582,"teacher_disagreement_score":0.94569635,"about_ca_system_score_codex":0.000034024186,"about_ca_system_score_gemma":0.00003590523,"threshold_uncertainty_score":0.50833523},"labels":[],"label_agreement":null},{"id":"W2141160679","doi":"10.1109/ccece.2009.5090211","title":"A hybrid control strategy for multiple mobile robots with nonholonomic constraints","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Memorial University of Newfoundland","keywords":"Nonholonomic system; Mobile robot; Robot; Hybrid system; Automaton; Computer science; Control theory (sociology); Control engineering; Nonlinear system; Hybrid automaton; Control (management); Engineering; Artificial intelligence","score_opus":0.014963766054439121,"score_gpt":0.23966267215350226,"score_spread":0.22469890609906315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141160679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020876974,0.000057159057,0.9739665,0.00034500382,0.00016950762,0.0019604336,0.0001028144,0.00038354512,0.0021380582],"genre_scores_gemma":[0.9837437,8.5561464e-7,0.015033451,0.00054338475,0.000072331066,0.00027802985,0.00002143174,0.000012273994,0.00029452465],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816924,0.000054972334,0.00038080782,0.00061157736,0.0002031651,0.0005802612],"domain_scores_gemma":[0.9985926,0.00022093586,0.00016814959,0.0006581433,0.00016046467,0.00019967686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027655976,0.00026450516,0.00039487082,0.00008059136,0.00011937068,0.000297651,0.0008400011,0.000057455894,0.000021248725],"category_scores_gemma":[0.000033859742,0.00021150491,0.0001167496,0.000111672605,0.00007501528,0.00047934338,0.000025466465,0.00009749838,0.00008673732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009812581,0.0019528642,0.0032030004,0.000086167216,0.00072026066,0.00047091255,0.00039282316,0.22611329,0.0247884,0.14746514,0.013121113,0.58070475],"study_design_scores_gemma":[0.016023843,0.0019770663,0.0038829565,0.000041529394,0.00003895368,0.00023564637,0.00007195828,0.97097486,0.0027612473,0.0008855412,0.002380758,0.0007256307],"about_ca_topic_score_codex":0.000030057205,"about_ca_topic_score_gemma":0.000017066037,"teacher_disagreement_score":0.9628667,"about_ca_system_score_codex":0.0000784838,"about_ca_system_score_gemma":0.00015686138,"threshold_uncertainty_score":0.862492},"labels":[],"label_agreement":null},{"id":"W2142191076","doi":"10.1109/irds.2002.1041684","title":"Dynamic robot formations using directional visual perception","year":2003,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Robot; Perception; Computer science; Sonar; Wireless; Artificial intelligence; Computer vision; Mobile robot; Human–computer interaction; Simulation; Telecommunications; Psychology","score_opus":0.01851091420032328,"score_gpt":0.2825900407363534,"score_spread":0.2640791265360301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142191076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034011804,0.000014678294,0.9598936,0.000088484536,0.000629143,0.00014986693,0.0000027055119,0.00022587045,0.004983881],"genre_scores_gemma":[0.92461574,0.0000018598703,0.074727505,0.00007561977,0.000014212831,0.000012704525,0.0000097045895,0.0000050012686,0.00053762563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990473,0.00008277731,0.00021609993,0.00020698784,0.00023607563,0.00021080267],"domain_scores_gemma":[0.99954164,0.000031893473,0.000062114355,0.00020938495,0.000087748616,0.00006721407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020098145,0.000097519944,0.0000955968,0.00009930041,0.00020221574,0.00017399777,0.00020682786,0.000045457768,0.00010030537],"category_scores_gemma":[0.000028610191,0.000092528724,0.00006517033,0.00029549934,0.000014071798,0.00082328066,0.00002393332,0.00006137552,0.00021296003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019118277,0.0020895046,0.010969436,0.00008962941,0.00033355155,0.000022249904,0.003334046,0.12179743,0.29696232,0.48095673,0.0031400558,0.080285944],"study_design_scores_gemma":[0.00029033964,0.000019983807,0.0060835863,0.0000062618565,0.000005036722,0.000038395283,0.00008480959,0.9908605,0.00014745511,0.00027803256,0.0020553088,0.00013024683],"about_ca_topic_score_codex":0.000047951817,"about_ca_topic_score_gemma":0.000025454035,"teacher_disagreement_score":0.89060396,"about_ca_system_score_codex":0.0002000626,"about_ca_system_score_gemma":0.00005223519,"threshold_uncertainty_score":0.37732118},"labels":[],"label_agreement":null},{"id":"W2143353308","doi":"10.1109/icassp.2009.4960421","title":"The speed of greed: Characterizing myopic gossip through network voracity","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Computer science; Network topology; Convergence (economics); Computer network; Node (physics); Gossip protocol; Wireless network; Wireless; Wireless sensor network; Topology (electrical circuits); Rate of convergence; Mathematics; Telecommunications; Channel (broadcasting); Engineering; Combinatorics","score_opus":0.020528351136250685,"score_gpt":0.24835159924946518,"score_spread":0.2278232481132145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143353308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08537279,0.0006303052,0.8769239,0.010523112,0.0022031073,0.0007535348,0.000008135515,0.0005354895,0.023049612],"genre_scores_gemma":[0.9940174,0.000016608805,0.0041469675,0.00081061304,0.000280654,0.0000032245537,0.0000029844941,0.000005276723,0.00071622356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.998258,0.00012753585,0.0004670323,0.00031682287,0.0003595245,0.00047107364],"domain_scores_gemma":[0.9984695,0.0001593578,0.0002738092,0.0009188564,0.00011032173,0.000068196794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005645297,0.00016542156,0.00027176263,0.000018288894,0.00024275725,0.00025923087,0.0014019862,0.00006532149,0.000008846641],"category_scores_gemma":[0.000056715835,0.00010962571,0.000117227726,0.0004357617,0.000052327832,0.00059355237,0.00013307437,0.00013021074,0.000065095315],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006159003,0.00027512782,0.0071252785,0.000034019533,0.00018081302,0.00003515781,0.0012228391,0.0006659923,0.027243163,0.7668212,0.016000167,0.18033466],"study_design_scores_gemma":[0.003161819,0.0006447989,0.5573899,0.00026425027,0.00005571611,0.00005743593,0.00016814414,0.25111583,0.0136490585,0.03741658,0.13478008,0.0012964061],"about_ca_topic_score_codex":0.00007730555,"about_ca_topic_score_gemma":0.000014864354,"teacher_disagreement_score":0.9086447,"about_ca_system_score_codex":0.00003742943,"about_ca_system_score_gemma":0.00004132599,"threshold_uncertainty_score":0.44704068},"labels":[],"label_agreement":null},{"id":"W2143691503","doi":"","title":"Formation control of multiple nonholonomic mobile robots via dynamic feedback linearization","year":2009,"lang":"en","type":"article","venue":"International Conference on Advanced Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Feedback linearization; Nonholonomic system; Mobile robot; Control theory (sociology); Computer science; Robot; Control engineering; Modular design; Linearization; Scalability; Event (particle physics); Nonlinear system; Control (management); Engineering; Artificial intelligence","score_opus":0.015716984543525367,"score_gpt":0.2712684125397178,"score_spread":0.2555514279961924,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143691503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027786456,0.000029387757,0.9935142,0.001199227,0.00091468147,0.00056450476,0.00005470602,0.00014141781,0.00080323673],"genre_scores_gemma":[0.96832544,0.000029817016,0.031071166,0.00023414068,0.00004313337,0.000031723364,0.00014657195,0.000010572821,0.00010744411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981966,0.000067727524,0.00064220495,0.00037898522,0.000452771,0.00026173808],"domain_scores_gemma":[0.9981766,0.00011085686,0.00054317835,0.00046808537,0.00061153073,0.00008975002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015634618,0.00022683603,0.0003023983,0.0001986593,0.0000677627,0.00012626075,0.0010064023,0.00010178385,0.000017168339],"category_scores_gemma":[0.00011066164,0.00023210552,0.000092582035,0.00017418075,0.00003688629,0.0009565586,0.000054131073,0.00017072918,0.000108302156],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008493899,0.00021307956,0.00011565988,0.000008685241,0.00003152369,0.0000041471662,0.00010274227,0.8647862,0.04165843,0.036657408,0.000014755492,0.056322437],"study_design_scores_gemma":[0.0022997428,0.00029236448,0.0017358974,0.000076762066,0.0000073638294,0.000009389704,0.00002869287,0.9909872,0.0025750299,0.0016289711,0.00014307343,0.00021554998],"about_ca_topic_score_codex":0.000005637896,"about_ca_topic_score_gemma":0.000009803866,"teacher_disagreement_score":0.9655468,"about_ca_system_score_codex":0.00022827934,"about_ca_system_score_gemma":0.000070976916,"threshold_uncertainty_score":0.9464989},"labels":[],"label_agreement":null},{"id":"W2144260073","doi":"10.1109/acc.2007.4282637","title":"Multi-UAV Decentralized Task Allocation with Intermittent Communications: the DTC algorithm","year":2007,"lang":"en","type":"article","venue":"Proceedings of the ... American Control Conference/Proceedings of the American Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Defence Research and Development Canada; Lockheed Martin (Canada)","funders":"","keywords":"Asynchronous communication; Task (project management); Computer science; Nonlinear system; Task analysis; Algorithm design; Distributed computing; Algorithm; Computer network; Engineering","score_opus":0.01776847889260795,"score_gpt":0.2547927282988916,"score_spread":0.23702424940628364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144260073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45516244,0.0007413561,0.48580402,0.04344304,0.000908848,0.008928673,0.000362086,0.000774566,0.0038749531],"genre_scores_gemma":[0.9823354,0.00019257262,0.014366383,0.0022595646,0.00012024095,0.00042519922,0.00000393396,0.000086062464,0.00021064054],"study_design_codex":"bench_or_experimental","study_design_gemma":"observational","domain_scores_codex":[0.99219525,0.00015831117,0.0023219013,0.0014631862,0.0021474643,0.0017138715],"domain_scores_gemma":[0.9806767,0.0010198969,0.009113316,0.0020493867,0.0066765156,0.0004641982],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.003131151,0.0011721298,0.0024239798,0.0003854737,0.0008876205,0.0008815271,0.015732097,0.0001459634,0.000009328928],"category_scores_gemma":[0.0011650431,0.00068544433,0.0008035038,0.0032593012,0.0063874735,0.0012016245,0.0016307426,0.0012687816,0.000012306763],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034960709,0.0018489097,0.17551836,0.00032989826,0.0035726628,0.000004539291,0.0060783867,0.000070399685,0.4442836,0.12680373,0.001978363,0.23601508],"study_design_scores_gemma":[0.024570582,0.003163867,0.4712895,0.0022493014,0.0023233974,0.00031856247,0.027533839,0.43536264,0.020581746,0.0023832428,0.0065205363,0.0037027893],"about_ca_topic_score_codex":0.0022238377,"about_ca_topic_score_gemma":0.00018635811,"teacher_disagreement_score":0.527173,"about_ca_system_score_codex":0.00039555924,"about_ca_system_score_gemma":0.00069439656,"threshold_uncertainty_score":0.9995597},"labels":[],"label_agreement":null},{"id":"W2145357881","doi":"10.1016/j.automatica.2011.09.027","title":"Connectivity preservation for multi-agent rendezvous with link failure","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Alberta","keywords":"Rendezvous; Computer science; Protocol (science); Robustness (evolution); Distributed computing; Topology (electrical circuits); Multi-agent system; Mathematics; Engineering; Artificial intelligence","score_opus":0.07094940301142548,"score_gpt":0.2613204244344225,"score_spread":0.190371021422997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145357881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010550454,0.000024862078,0.98550713,0.0009583089,0.00022647262,0.0011794773,0.000021494518,0.0007197925,0.00081201474],"genre_scores_gemma":[0.70788586,4.166585e-7,0.29144406,0.00009558162,0.000042742944,0.0003155925,0.0000115434395,0.000015434513,0.00018873194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842066,0.00010395276,0.000330328,0.0004648987,0.00029462585,0.00038555468],"domain_scores_gemma":[0.998374,0.00016886565,0.00022718887,0.00088946585,0.0002137775,0.00012669755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040944622,0.00020371492,0.00027299413,0.00007354267,0.00014432766,0.00013469368,0.0008131388,0.00009684463,0.000017522627],"category_scores_gemma":[0.00021625325,0.0001638002,0.00007989528,0.00025727093,0.00003895497,0.00080412615,0.00011860025,0.000095724325,0.00008217015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003012069,0.0030236363,0.016223228,0.0012653675,0.0015290425,0.00017303978,0.026515251,0.00042233322,0.0065926905,0.7966076,0.019871417,0.1274752],"study_design_scores_gemma":[0.0026821385,0.00038445205,0.03314905,0.00008947195,0.000046744422,0.000022869375,0.00007778826,0.95405424,0.0019216896,0.0023783399,0.0047865272,0.00040669795],"about_ca_topic_score_codex":0.000088202694,"about_ca_topic_score_gemma":0.00010712624,"teacher_disagreement_score":0.9536319,"about_ca_system_score_codex":0.00007106922,"about_ca_system_score_gemma":0.000086804765,"threshold_uncertainty_score":0.66795784},"labels":[],"label_agreement":null},{"id":"W2145799282","doi":"10.1109/cdc.2009.5400614","title":"Connectivity preservation in a network of single integrator agents","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Graph; Computer science; Integrator; Convergence (economics); Connectivity; Enhanced Data Rates for GSM Evolution; Graph theory; Topology (electrical circuits); Mathematical optimization; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.030480365999146587,"score_gpt":0.2538954552784595,"score_spread":0.22341508927931295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145799282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19065781,0.000039655348,0.80206746,0.00063314906,0.00021665393,0.00029965478,0.0000015016933,0.00011732458,0.005966807],"genre_scores_gemma":[0.9969237,8.091436e-7,0.002718338,0.00015705176,0.00003201321,0.0000073838632,0.0000032430692,0.0000022434972,0.00015524516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894977,0.00015854217,0.0002765954,0.00021902485,0.0001894331,0.00020664824],"domain_scores_gemma":[0.99932617,0.000105239,0.00011416864,0.0003174097,0.00009388062,0.00004311844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048490768,0.00008623609,0.00018056144,0.00004300616,0.000021101077,0.000050439226,0.00045108324,0.000049000322,0.000008410893],"category_scores_gemma":[0.00020477228,0.00007664846,0.000040933337,0.00053905376,0.000009202606,0.000553831,0.000053044078,0.00007005626,0.0000094519055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010613771,0.002615804,0.18152036,0.00005603304,0.00007958274,0.000045290253,0.0017056132,0.02422547,0.04518193,0.5582917,0.01676242,0.16940969],"study_design_scores_gemma":[0.0015099769,0.0003814692,0.2460244,0.00010092164,0.000004404216,0.0000025405839,0.000038035894,0.733604,0.004709506,0.010478684,0.0028928805,0.00025318106],"about_ca_topic_score_codex":0.00015442961,"about_ca_topic_score_gemma":0.0001228415,"teacher_disagreement_score":0.8062659,"about_ca_system_score_codex":0.00007518017,"about_ca_system_score_gemma":0.000030582607,"threshold_uncertainty_score":0.31256336},"labels":[],"label_agreement":null},{"id":"W2146280265","doi":"10.1109/cdc.2007.4434285","title":"A Networked Decision and Information System for increased agility in teaming unmanned combat vehicles","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Redundancy (engineering); Exploit; Adversarial system; Computer science; Architecture; Principal (computer security); Minification; State (computer science); Function (biology); Distributed computing; Computer security; Artificial intelligence; Operating system","score_opus":0.00861237720132508,"score_gpt":0.23000066599066332,"score_spread":0.22138828878933825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146280265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32097924,0.00003585875,0.677632,0.000049294344,0.00018547472,0.0005682426,0.0000047555295,0.00014540454,0.00039976407],"genre_scores_gemma":[0.98706204,9.50794e-7,0.012747394,0.00010384604,0.000028764978,0.000030638508,0.000014608723,0.000003873867,0.000007865456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985325,0.00006482602,0.00059385865,0.00023170421,0.0002390232,0.000338098],"domain_scores_gemma":[0.9986108,0.00064698124,0.00015299932,0.00035070532,0.00012425055,0.000114282004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024056777,0.00013112772,0.00022841267,0.0001865903,0.00010523761,0.00021881296,0.000367178,0.00009166094,4.754631e-7],"category_scores_gemma":[0.00019367522,0.000114566836,0.000041228504,0.00036999883,0.000018024122,0.0014879176,0.00009319569,0.00006819171,0.000009259372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096478825,0.00020288231,0.08763017,0.0006719846,0.00007358474,0.000026379766,0.0019828079,0.00237794,0.002323421,0.14004347,0.0011260535,0.7625765],"study_design_scores_gemma":[0.0036529943,0.000060275765,0.1386378,0.00018403085,0.0000054537354,0.000011123415,0.00043016663,0.8545601,0.00064853556,0.0002190847,0.0013931044,0.00019736351],"about_ca_topic_score_codex":0.00034079558,"about_ca_topic_score_gemma":0.00016003418,"teacher_disagreement_score":0.85218215,"about_ca_system_score_codex":0.00017069827,"about_ca_system_score_gemma":0.000030582112,"threshold_uncertainty_score":0.46719},"labels":[],"label_agreement":null},{"id":"W2146737909","doi":"10.1109/icnsc.2007.372852","title":"Optimal Control and Game Theoretic Approaches to Cooperative Control of a Team of Multi-Vehicle Unmanned Systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Game theory; Information exchange; Computer science; Cooperative game theory; Nash equilibrium; Pareto principle; Multi-agent system; Mathematical optimization; Bargaining problem; Control (management); Pareto optimal; Shapley value; Non-cooperative game; Set (abstract data type); Mathematics; Mathematical economics; Artificial intelligence","score_opus":0.03383668786527303,"score_gpt":0.23710513238066927,"score_spread":0.20326844451539625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146737909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0810727,0.0004778724,0.9151358,0.00023305527,0.00016990268,0.0018368588,0.00008941755,0.0001000629,0.0008843006],"genre_scores_gemma":[0.99369514,0.0000018279561,0.005866117,0.00010939101,0.000038094076,0.00007323151,0.000002509691,0.000016568469,0.00019710339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729234,0.00029436967,0.00090193434,0.0005534084,0.0004389208,0.0005190062],"domain_scores_gemma":[0.997802,0.0005917403,0.00034034566,0.0006491868,0.00033855875,0.00027813896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017596696,0.00028823674,0.00082051096,0.00020011747,0.000058246816,0.00010774156,0.00076517474,0.00012617566,0.000004134554],"category_scores_gemma":[0.00020504057,0.0002277755,0.00010463108,0.0004261949,0.00020689267,0.0002835921,0.00012352125,0.00012225211,0.000013993501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011035235,0.0013062634,0.008283588,0.00040918286,0.00089428556,0.000034855562,0.006760056,0.08008308,0.09089192,0.80570644,0.00023552556,0.0042912494],"study_design_scores_gemma":[0.00821701,0.0005619616,0.0032083876,0.00008724989,0.000045338023,0.000017868062,0.0010863434,0.9799277,0.0063998247,0.000024280818,0.0001329925,0.00029100155],"about_ca_topic_score_codex":0.00015587654,"about_ca_topic_score_gemma":0.000024079955,"teacher_disagreement_score":0.91262245,"about_ca_system_score_codex":0.000055164626,"about_ca_system_score_gemma":0.000071608956,"threshold_uncertainty_score":0.9288415},"labels":[],"label_agreement":null},{"id":"W2146747708","doi":"10.1109/acc.2011.5991580","title":"A connectivity preserving containment control strategy for a network of single integrator agents","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Containment (computer programming); Integrator; Bounded function; Double integrator; Computer science; Control theory (sociology); Control (management); Graph; Multi-agent system; Property (philosophy); Invariance principle; Graph theory; Mathematics; Mathematical optimization; Distributed computing; Theoretical computer science; Artificial intelligence; Computer network","score_opus":0.077047728265343,"score_gpt":0.2621877687130591,"score_spread":0.1851400404477161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146747708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015114018,0.00008967108,0.97664833,0.000066665154,0.00039766263,0.0013566458,0.00003020601,0.00017173238,0.0061250697],"genre_scores_gemma":[0.993196,8.507568e-7,0.0061445655,0.00012438315,0.000065966,0.00022588353,0.0000044446656,0.0000128951,0.00022498412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980613,0.00024699027,0.0005047064,0.0004330048,0.0002576576,0.00049634173],"domain_scores_gemma":[0.99824685,0.0003982121,0.00031213157,0.00058433914,0.00031159335,0.00014685592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009176736,0.00021037822,0.00044532376,0.00003831191,0.000086550484,0.00008460298,0.00094894116,0.00008772665,0.00005764301],"category_scores_gemma":[0.00022817477,0.00017820434,0.00017000189,0.00020404512,0.000037447502,0.00040499782,0.0001466595,0.00008572432,0.000009255432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010400723,0.0036019345,0.042225268,0.0003997045,0.0017481078,0.00006490113,0.0031681964,0.0056125284,0.022714116,0.8649826,0.016124165,0.03831842],"study_design_scores_gemma":[0.010491009,0.0025440182,0.013160402,0.00018258383,0.00010591553,0.00001414094,0.0005651912,0.94290566,0.012261711,0.012487371,0.004484158,0.0007978184],"about_ca_topic_score_codex":0.00043007339,"about_ca_topic_score_gemma":0.00015777476,"teacher_disagreement_score":0.978082,"about_ca_system_score_codex":0.00010879129,"about_ca_system_score_gemma":0.000088413515,"threshold_uncertainty_score":0.7266962},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.011224853349097126,"score_gpt":0.24590377597345883,"score_spread":0.2346789226243617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147326597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030323805,0.000090017056,0.9637592,0.0032464862,0.00028529603,0.0014762119,0.0004781619,0.0002941291,0.000046734658],"genre_scores_gemma":[0.9965372,0.0000072744106,0.0025204623,0.00037875873,0.000031190422,0.0004768083,0.000008126442,0.000013857873,0.000026319878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981113,0.00015495524,0.00073379825,0.0003209572,0.00034265328,0.0003363022],"domain_scores_gemma":[0.99801815,0.0008831425,0.00028004043,0.0004884541,0.000181619,0.00014858982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037527393,0.00022354502,0.00045245234,0.0003162271,0.0002464482,0.00010678993,0.00039833513,0.00011287433,0.000017457012],"category_scores_gemma":[0.000027570231,0.00020946095,0.00021957608,0.0002933493,0.0001032541,0.0006367463,0.0000017040776,0.000112010566,0.00001624549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005188778,0.005315901,0.0001445095,0.001044714,0.0018150078,0.000013776521,0.0040913196,0.29729608,0.10839478,0.10538311,0.0014439035,0.47453803],"study_design_scores_gemma":[0.0067850715,0.00022019536,0.0007740923,0.0000644853,0.0001305819,0.000022465278,0.00007148068,0.988173,0.0029176362,0.0003641142,0.00028128232,0.00019560533],"about_ca_topic_score_codex":0.000015359914,"about_ca_topic_score_gemma":0.000036860652,"teacher_disagreement_score":0.9662134,"about_ca_system_score_codex":0.00007536608,"about_ca_system_score_gemma":0.000057158697,"threshold_uncertainty_score":0.854157},"labels":[],"label_agreement":null},{"id":"W2147737003","doi":"10.1109/cdc.2005.1582246","title":"On Invariance of Cyclic Group Symmetries in Multiagent Formations","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Centre International de Recherche sur le Cancer","keywords":"Homogeneous space; Circulant matrix; Invariant (physics); Planar; Topology (electrical circuits); Symmetry (geometry); Group (periodic table); Simple (philosophy); Cyclic group; Mathematics; Pure mathematics; Computer science; Discrete mathematics; Physics; Combinatorics; Geometry; Mathematical physics; Quantum mechanics","score_opus":0.008578095953432053,"score_gpt":0.21190479730156928,"score_spread":0.2033267013481372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147737003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045268156,0.00006221485,0.9384495,0.00057820434,0.0002436471,0.0003656793,0.0000132863515,0.00011453929,0.014904795],"genre_scores_gemma":[0.9931253,0.0000017170291,0.006439182,0.00015171326,0.000016338297,0.000037264523,0.000011060009,0.000003916296,0.00021350531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881804,0.000061108134,0.0004380622,0.00020684511,0.00025965954,0.00021627611],"domain_scores_gemma":[0.9991239,0.00019153148,0.00013565333,0.00045288933,0.000061931525,0.000034128036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025935,0.00010408387,0.00017684558,0.00022940066,0.000039221395,0.0000668665,0.0005493156,0.00004431206,0.000010006363],"category_scores_gemma":[0.000098224366,0.0000919642,0.000051381074,0.0006799008,0.000022592663,0.00048277716,0.00008008981,0.00006614497,0.00008042825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045536854,0.0002506475,0.0022866463,0.000017484606,0.000007233716,0.000004711918,0.000110938585,0.0024226836,0.0011912615,0.9896682,0.0017333459,0.002302323],"study_design_scores_gemma":[0.005347464,0.00026726027,0.28259385,0.00020083266,0.000010596113,0.000010451966,0.0001642517,0.6676559,0.013943003,0.023471516,0.0056504845,0.0006843993],"about_ca_topic_score_codex":0.0010743436,"about_ca_topic_score_gemma":0.0004527495,"teacher_disagreement_score":0.96619666,"about_ca_system_score_codex":0.00006898686,"about_ca_system_score_gemma":0.000019701158,"threshold_uncertainty_score":0.37501913},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.18948901551432232,"score_gpt":0.38635371126830154,"score_spread":0.19686469575397922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148252440","genre_codex":"review","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009400413,0.6496841,0.34783897,0.00004432032,0.0005617515,0.0010044907,0.0005034697,0.000060395534,0.00020852702],"genre_scores_gemma":[0.6391295,0.35002217,0.007973626,0.000022523742,0.0004386863,0.0013019221,0.000113034446,0.00016185771,0.00083669747],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967638,0.0004820631,0.001124952,0.00072593417,0.00043311648,0.00047010963],"domain_scores_gemma":[0.99775827,0.00018768213,0.0006417165,0.0010283298,0.00018938059,0.00019460535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003402625,0.00047859387,0.0018996064,0.00056112366,0.00003080871,0.00016616848,0.0018566224,0.00031702357,0.000024328481],"category_scores_gemma":[0.00008791701,0.00042631952,0.00043759946,0.0011558582,0.000020286314,0.0006870864,0.0003901623,0.0004549631,0.00016360772],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013678648,0.0002744932,0.00006817195,0.0005916544,0.00037897637,0.000014538698,0.0010775056,0.00076166954,0.000067578476,0.00012667292,0.0011276283,0.9954974],"study_design_scores_gemma":[0.008470782,0.0018647617,0.001640629,0.15122567,0.008345115,0.00016572203,0.0011729752,0.06215949,0.008105311,0.007401067,0.7381744,0.011274069],"about_ca_topic_score_codex":0.003423865,"about_ca_topic_score_gemma":0.0004262016,"teacher_disagreement_score":0.98422337,"about_ca_system_score_codex":0.00073722436,"about_ca_system_score_gemma":0.00025211668,"threshold_uncertainty_score":0.99981886},"labels":[],"label_agreement":null},{"id":"W2148293456","doi":"10.1109/.2005.1467053","title":"The Stability Analysis of the Coordinated Hybrid Agent Framework","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multi-agent system; Computer science; Homogeneous; Distributed computing; Stability (learning theory); Hybrid system; Control (management); Lyapunov function; Control theory (sociology); Artificial intelligence; Mathematics; Nonlinear system","score_opus":0.015003268126943496,"score_gpt":0.24222661468663098,"score_spread":0.22722334655968748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148293456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09265889,0.0001675552,0.8972598,0.007014828,0.00041624537,0.00036270785,0.00002699723,0.00012274919,0.0019702602],"genre_scores_gemma":[0.9978143,0.0000036597037,0.0015592569,0.00023857015,0.000027401658,0.000017554821,0.0000021241267,0.0000035772948,0.00033353842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982413,0.00028572168,0.00044413138,0.00031221795,0.00043432464,0.00028227025],"domain_scores_gemma":[0.9971377,0.0005316341,0.00021190976,0.0018643478,0.00018776624,0.000066587236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092407066,0.00012273184,0.00025065176,0.0000506009,0.00022588557,0.00015587799,0.0020863188,0.000040419574,0.00006739161],"category_scores_gemma":[0.000310054,0.000061047656,0.00031439244,0.0016146807,0.000098660305,0.0001512426,0.00034031828,0.0001425133,0.00003072254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005969703,0.0011329104,0.1102731,0.000035388744,0.0072488645,0.000008017222,0.0023876966,0.031156262,0.003363187,0.6478556,0.018907784,0.17757152],"study_design_scores_gemma":[0.00027877398,0.000019744915,0.07246325,0.000011246252,0.0002568051,0.0000013395696,0.00009771759,0.89849013,0.007970094,0.0010157116,0.019214256,0.00018094566],"about_ca_topic_score_codex":0.00014406849,"about_ca_topic_score_gemma":0.000188905,"teacher_disagreement_score":0.9051554,"about_ca_system_score_codex":0.00010328766,"about_ca_system_score_gemma":0.000052835105,"threshold_uncertainty_score":0.3876934},"labels":[],"label_agreement":null},{"id":"W2148660808","doi":"10.1109/ssd.2011.5986780","title":"Multi-robot target pursuit: towards an opportunistic control architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Robot; Action selection; Probabilistic logic; Artificial intelligence; Inference; Machine learning; Human–computer interaction; Perception","score_opus":0.06381290151147082,"score_gpt":0.26101700008132145,"score_spread":0.19720409856985063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148660808","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029849555,0.0000603605,0.98773754,0.0005702146,0.0008895379,0.00063565635,0.00010873364,0.0008111206,0.008888374],"genre_scores_gemma":[0.81314915,0.0000012605791,0.18444206,0.0009430937,0.00010770364,0.000076922224,0.000035555724,0.000024966983,0.0012192782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711126,0.00026140618,0.00051751157,0.0008159847,0.00054770795,0.00074611953],"domain_scores_gemma":[0.9975029,0.000053622356,0.00019298005,0.0014717699,0.00018673038,0.0005919827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528275,0.00037291305,0.00046091204,0.00016037063,0.00015269805,0.00028223713,0.0026796032,0.00015565731,0.00033591816],"category_scores_gemma":[0.00011901395,0.00030513332,0.00016360809,0.0002811448,0.00008646835,0.00060543517,0.00021893307,0.0002521981,0.00028982334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004311306,0.0064780023,0.0105689075,0.00025314538,0.0014194102,0.0026564938,0.013951387,0.0031385303,0.08201629,0.4417432,0.008864107,0.4284794],"study_design_scores_gemma":[0.008472076,0.00084793026,0.03927208,0.000049510276,0.00008646077,0.00022213232,0.00020791216,0.9238638,0.0017158679,0.004555104,0.018985556,0.0017215473],"about_ca_topic_score_codex":0.00046895235,"about_ca_topic_score_gemma":0.00007331684,"teacher_disagreement_score":0.9207253,"about_ca_system_score_codex":0.000064706815,"about_ca_system_score_gemma":0.00019670062,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W2149171877","doi":"10.1109/acc.2008.4586678","title":"Stochastic consensus seeking with measurement noise: Convergence and asymptotic normality","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Stochastic approximation; Normalization (sociology); Rate of convergence; Mathematics; Convergence (economics); Limit (mathematics); Normality; Spanning tree; Applied mathematics; Noise (video); Convergence of random variables; Computer science; Mathematical optimization; Discrete mathematics; Random variable; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.03183579041146832,"score_gpt":0.20832329540956063,"score_spread":0.1764875049980923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149171877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08780834,0.00015211829,0.9098317,0.000551158,0.00025686555,0.0003677649,0.0000042052625,0.00019794723,0.0008298722],"genre_scores_gemma":[0.99594533,0.0000019895788,0.0036671297,0.00016787474,0.0000311586,0.000021593672,9.619196e-7,0.000008271643,0.000155715],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750304,0.00013920637,0.0003734138,0.00055397465,0.0010266786,0.00040370956],"domain_scores_gemma":[0.9983755,0.00013691052,0.00016005759,0.0006726637,0.0004298329,0.0002250797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076289615,0.00021427381,0.00028985203,0.00007230996,0.00023338766,0.00011655757,0.0005289229,0.000047706268,0.000013539605],"category_scores_gemma":[0.00016068258,0.00016571743,0.00003884862,0.00030844068,0.00014231386,0.00022389858,0.00015644068,0.00011147218,0.00006285991],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010766559,0.0023255176,0.6002564,0.0008257702,0.0026335062,0.0035197318,0.012623242,0.066214696,0.058156926,0.21459247,0.017501859,0.020273235],"study_design_scores_gemma":[0.0036688184,0.00030241787,0.24627063,0.00012306598,0.000046555582,0.001370985,0.0001428758,0.745667,0.00079271576,0.00023738116,0.0005005477,0.0008769997],"about_ca_topic_score_codex":0.00015290068,"about_ca_topic_score_gemma":0.0000620178,"teacher_disagreement_score":0.90813696,"about_ca_system_score_codex":0.00010886101,"about_ca_system_score_gemma":0.00018182944,"threshold_uncertainty_score":0.67577606},"labels":[],"label_agreement":null},{"id":"W2149292252","doi":"10.1109/acc.2008.4587070","title":"Control of helicopters&amp;#x2019; formation using non-iterative Nonlinear Model Predictive approach","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Initialization; Model predictive control; Nonlinear system; Nonlinear model; Control theory (sociology); Computer science; Controller (irrigation); Iterative method; Control engineering; Control (management); Engineering; Algorithm; Artificial intelligence","score_opus":0.0451818320440441,"score_gpt":0.2547819559943441,"score_spread":0.2096001239503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149292252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046824183,0.000028496037,0.9499596,0.000046874487,0.00011875064,0.0007356786,0.00010291222,0.00010379048,0.0020797339],"genre_scores_gemma":[0.7385809,0.0000020179973,0.26110142,0.000092942944,0.000046326586,0.000030332365,0.000029932602,0.000008792369,0.00010733637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981293,0.00010052566,0.00057226693,0.00038431626,0.0004812235,0.0003323662],"domain_scores_gemma":[0.9985201,0.000052228144,0.00032928048,0.00057688646,0.00040721576,0.00011430538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026535013,0.00022645453,0.00040644832,0.00016309365,0.00015245336,0.00006405878,0.0006170119,0.00010430321,0.0000030219464],"category_scores_gemma":[0.00003489946,0.00019573275,0.00013456073,0.00031484148,0.0000748278,0.0015686426,0.00010889267,0.00012518153,0.000024354364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016616585,0.00068916526,0.00062043034,0.00012262078,0.000281962,0.000003580796,0.0111405905,0.86262274,0.11710887,0.005940886,0.00033395187,0.0009690223],"study_design_scores_gemma":[0.001740182,0.00006524953,0.00010771342,0.000027421625,0.000016944276,0.000041670977,0.000073732044,0.9951423,0.0024759015,0.00005719821,0.00006522354,0.00018650605],"about_ca_topic_score_codex":0.000094949406,"about_ca_topic_score_gemma":0.0000026664734,"teacher_disagreement_score":0.6917567,"about_ca_system_score_codex":0.00012321737,"about_ca_system_score_gemma":0.00013352491,"threshold_uncertainty_score":0.798175},"labels":[],"label_agreement":null},{"id":"W2149562960","doi":"10.1109/icsmc.2007.4413675","title":"Hierarchical markov decision processes based distributed data fusion and collaborative sensor management for multitarget multisensor tracking applications","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sensor fusion; Computer science; Redundancy (engineering); Markov decision process; Data redundancy; Markov process; Distributed computing; Process (computing); Data mining; Real-time computing; Artificial intelligence; Database","score_opus":0.026333596002014067,"score_gpt":0.3029138170335737,"score_spread":0.2765802210315596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149562960","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013798686,0.00017749233,0.9918186,0.00070160406,0.00014146906,0.003364331,0.0019003403,0.00030640292,0.00020990155],"genre_scores_gemma":[0.38737914,0.000021461725,0.6107915,0.00014619244,0.00007107519,0.0002758711,0.0012136492,0.000018913268,0.00008219107],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971612,0.00007219827,0.0006120645,0.0011310462,0.0004896007,0.00053386163],"domain_scores_gemma":[0.9960127,0.0016536237,0.0002032578,0.001278999,0.0005935398,0.00025790613],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011251242,0.00028665696,0.00031443487,0.00019259227,0.00040649745,0.00036595232,0.0012615641,0.00011545046,0.0000066023476],"category_scores_gemma":[0.00044891998,0.00024907602,0.00004211705,0.001044153,0.00007513616,0.0006374525,0.000526823,0.00011728561,0.000011962438],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000885265,0.0015535989,0.0025135884,0.0010564011,0.0002757913,0.00011109653,0.00038061148,0.0012661163,0.004411025,0.016875481,0.008599396,0.96207166],"study_design_scores_gemma":[0.0052666143,0.0001046459,0.008862645,0.00013806147,0.000064341926,0.0000107797205,0.00046661997,0.88398093,0.00227736,0.00039492597,0.09783551,0.00059755147],"about_ca_topic_score_codex":0.000012382401,"about_ca_topic_score_gemma":0.00008911769,"teacher_disagreement_score":0.96147406,"about_ca_system_score_codex":0.000089235495,"about_ca_system_score_gemma":0.00009238652,"threshold_uncertainty_score":0.9999961},"labels":[],"label_agreement":null},{"id":"W2150393219","doi":"10.1109/cdc.2007.4434723","title":"Optimal performance of a modified leader-follower cooperative team with partial availability of the leader command and agents actuator faults","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Controller (irrigation); Stability (learning theory); Computer science; Fault (geology); Fault tolerance; Control (management); State (computer science); Multi-agent system; Engineering; Distributed computing; Artificial intelligence","score_opus":0.02267553730067652,"score_gpt":0.24455505232323507,"score_spread":0.22187951502255854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150393219","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9145821,0.000023442955,0.083097786,0.000174467,0.0001312773,0.0006136383,0.000015638525,0.00003622093,0.0013254732],"genre_scores_gemma":[0.99721074,0.0000015917126,0.0021088526,0.00008354243,0.000019782987,0.000013811432,0.0000019782183,0.000007782395,0.00055189966],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818903,0.00010506191,0.00049544626,0.0003839686,0.0004842918,0.00034218567],"domain_scores_gemma":[0.9985526,0.0001374027,0.0002484663,0.0007115747,0.00024582553,0.000104120205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006930107,0.00020420332,0.00036031377,0.000044804754,0.0001206795,0.000038507507,0.000671848,0.000082023755,0.000015595426],"category_scores_gemma":[0.00005773779,0.0001197585,0.00006401485,0.0003087744,0.00035034062,0.0004085502,0.0001991441,0.00015373541,0.0000057518387],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0059999535,0.0053517497,0.7757667,0.0012404892,0.0020429948,0.00004031413,0.051586952,0.04137544,0.07594747,0.014895529,0.007332412,0.018420046],"study_design_scores_gemma":[0.008540512,0.001284983,0.20254369,0.00022644957,0.000080790654,0.00003500714,0.0016578702,0.58672476,0.19717829,0.000005958086,0.0010539965,0.0006676823],"about_ca_topic_score_codex":0.000091995804,"about_ca_topic_score_gemma":0.000063878724,"teacher_disagreement_score":0.57322294,"about_ca_system_score_codex":0.000041277242,"about_ca_system_score_gemma":0.00009969461,"threshold_uncertainty_score":0.488361},"labels":[],"label_agreement":null},{"id":"W2151158967","doi":"10.1080/00207721.2011.572198","title":"Mobile sensor networks for modelling environmental pollutant distribution","year":2011,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing University; Kunming University of Science and Technology; European Commission; Northeast Normal University; Canadian Institute for Advanced Research","keywords":"Pollutant; Sample (material); Computer science; Voronoi diagram; Flocking (texture); Environmental science; Mathematics; Ecology","score_opus":0.026417152986280796,"score_gpt":0.24164409643494306,"score_spread":0.21522694344866225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151158967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023380127,0.00042178595,0.96881676,0.000041516018,0.0067879455,0.00031022137,0.0000958907,0.00002544946,0.00012030294],"genre_scores_gemma":[0.9924502,0.000033308515,0.006880602,0.000024575322,0.00051680463,0.000021824835,0.000005014031,0.0000070765013,0.000060592723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974269,0.00005126038,0.00075866317,0.0002981553,0.0011249178,0.0003400585],"domain_scores_gemma":[0.9981764,0.00006956031,0.00079621404,0.0002677818,0.0005017769,0.0001882593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001584713,0.00014344619,0.00022374967,0.00018980794,0.00015215926,0.00035276896,0.0024370404,0.000052894757,0.0000033410586],"category_scores_gemma":[0.00005379141,0.00012154631,0.000147308,0.00021831942,0.00015790979,0.0014623806,0.00015567102,0.00012400477,0.000010604476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003265886,0.0008514119,0.004475358,0.00003283846,0.0004430824,0.00032408067,0.0037393752,0.8741911,0.031570304,0.0655477,0.0010633164,0.017434848],"study_design_scores_gemma":[0.0006964957,0.00021084689,0.00043832042,0.00009430696,0.000010753004,0.00056400866,0.0002732741,0.99276084,0.0010685152,0.00017589283,0.0035492422,0.00015749228],"about_ca_topic_score_codex":0.00003616839,"about_ca_topic_score_gemma":2.5485951e-7,"teacher_disagreement_score":0.9690701,"about_ca_system_score_codex":0.00048490407,"about_ca_system_score_gemma":0.00015454854,"threshold_uncertainty_score":0.49565148},"labels":[],"label_agreement":null},{"id":"W2151719452","doi":"10.1109/cdc.2007.4434749","title":"A decentralized H&lt;inf&gt;&amp;#x221E;&lt;/inf&gt; control scheme for robust routing in networks","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Routing (electronic design automation); Node (physics); Computer science; Minification; Control (management); Mathematical optimization; Computer network; Mathematics; Artificial intelligence; Engineering","score_opus":0.025382929200952205,"score_gpt":0.25997907186247804,"score_spread":0.23459614266152584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151719452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0080244485,0.00053824775,0.98413575,0.00086083886,0.0013544431,0.0022210777,0.000025637377,0.0006581299,0.0021814492],"genre_scores_gemma":[0.90748584,0.000016237309,0.09009253,0.0009924979,0.00038792015,0.00018632272,0.000056858247,0.000055326695,0.00072649115],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9940776,0.00021054564,0.0015876191,0.0011703352,0.0007192995,0.002234573],"domain_scores_gemma":[0.99618524,0.001134562,0.000509853,0.0012826896,0.0003801564,0.00050749036],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035694228,0.00059813866,0.00094911194,0.00031305727,0.00027123853,0.0006097376,0.0018883636,0.0004004206,0.00006264884],"category_scores_gemma":[0.00063556933,0.00056953856,0.0003854895,0.0011287712,0.00007579244,0.0008482696,0.00026988948,0.00037514785,0.00011559503],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017818632,0.0020272965,0.0638432,0.00028931553,0.0012133939,0.00030516155,0.0020989866,0.12615624,0.03195104,0.6541921,0.032536674,0.08360472],"study_design_scores_gemma":[0.011676427,0.00008333676,0.0046214643,0.00012945592,0.000033667544,0.000027498545,0.00004518135,0.9422258,0.0001410108,0.0002562224,0.03998637,0.00077356613],"about_ca_topic_score_codex":0.00017606694,"about_ca_topic_score_gemma":0.0016450159,"teacher_disagreement_score":0.8994614,"about_ca_system_score_codex":0.0004405899,"about_ca_system_score_gemma":0.000168139,"threshold_uncertainty_score":0.99967563},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.030505543259697787,"score_gpt":0.26014706802467563,"score_spread":0.22964152476497784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151901719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05403655,0.00016584723,0.94465464,0.00008964665,0.00031760795,0.00032903856,0.000006154532,0.00002216419,0.0003783211],"genre_scores_gemma":[0.9919704,0.000002194551,0.007914363,0.00007702812,0.000017239749,0.0000048035613,0.0000033727604,0.0000020500604,0.000008555633],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862975,0.00018262482,0.000511185,0.00008698131,0.00031568448,0.00027376835],"domain_scores_gemma":[0.99886537,0.00027182495,0.0002749384,0.00042333722,0.000119351425,0.000045159544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008349343,0.00009840111,0.00018008502,0.00007956314,0.00003586126,0.000037195256,0.00061647326,0.00005999019,0.0000035510138],"category_scores_gemma":[0.00011228563,0.000068903915,0.0000504634,0.00036060734,0.00011867621,0.0007588194,0.00013734867,0.000089350084,0.0000055047394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091511494,0.0008212807,0.15462005,0.00024159122,0.00013205211,0.0000071709874,0.026571834,0.62318623,0.000913795,0.1365019,0.001634844,0.05527773],"study_design_scores_gemma":[0.0005757934,0.00001877285,0.024090843,0.000034478595,0.0000066663893,0.0000133532385,0.0014574558,0.97297156,0.00034447192,0.000010418508,0.00039781866,0.000078383855],"about_ca_topic_score_codex":0.00094648154,"about_ca_topic_score_gemma":0.000072145405,"teacher_disagreement_score":0.93793386,"about_ca_system_score_codex":0.000041776348,"about_ca_system_score_gemma":0.000075606455,"threshold_uncertainty_score":0.28098202},"labels":[],"label_agreement":null},{"id":"W2152401136","doi":"10.1109/robot.2003.1242191","title":"A hybrid-systems approach to potential field navigation for a multi-robot team","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Robot; Computer science; Maxima and minima; Motion planning; Function (biology); Field (mathematics); Attractor; Mobile robot; Artificial intelligence; Gaussian; Task (project management); Engineering; Mathematics; Systems engineering","score_opus":0.03018250772707122,"score_gpt":0.2680808779181778,"score_spread":0.2378983701911066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152401136","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002728234,0.000039779836,0.9917034,0.000689996,0.0011252135,0.0020154521,0.000024679817,0.00040068413,0.0012725448],"genre_scores_gemma":[0.79865044,2.8376064e-7,0.19959296,0.00034089838,0.00017243277,0.00050199055,0.000035571586,0.000013783398,0.00069160963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980671,0.00004784365,0.0004276774,0.00063537643,0.0003570268,0.00046501242],"domain_scores_gemma":[0.9987732,0.00004635112,0.00011701378,0.000659984,0.00018736778,0.0002160414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036930037,0.00021322229,0.00027610004,0.000108252745,0.00015296407,0.00043768762,0.00095608475,0.000084303996,0.000001223663],"category_scores_gemma":[0.00008290992,0.00019217697,0.00014542622,0.00024001997,0.000010881311,0.0004318842,0.00014323683,0.00009671512,0.000110405424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017458767,0.0028357678,0.00019501966,0.0005357905,0.00038399993,0.000055530658,0.0025066459,0.52118856,0.036608577,0.3724633,0.02810236,0.034949858],"study_design_scores_gemma":[0.0036383385,0.0002321871,0.00013057931,0.00006630307,0.00001623099,0.00009655699,0.00012324651,0.9866643,0.0047467244,0.0003532626,0.0035199202,0.00041236597],"about_ca_topic_score_codex":0.00064560573,"about_ca_topic_score_gemma":0.000006099565,"teacher_disagreement_score":0.7959222,"about_ca_system_score_codex":0.0001449742,"about_ca_system_score_gemma":0.00009079439,"threshold_uncertainty_score":0.7836749},"labels":[],"label_agreement":null},{"id":"W2153148809","doi":"10.1002/rnc.1829","title":"Distributed consensus control for multi‐agent systems using terminal sliding mode and Chebyshev neural networks","year":2011,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":100,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Terminal sliding mode; Artificial neural network; Controller (irrigation); Computer science; Sliding mode control; Nonlinear system; Tracking error; Lyapunov function; Bounded function; Mathematics; Control (management); Artificial intelligence","score_opus":0.06533249496723814,"score_gpt":0.29089778295150603,"score_spread":0.2255652879842679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153148809","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.080613725,0.0011767711,0.91491824,0.00030594785,0.0021845791,0.00045691544,0.00030777956,0.000029841136,0.000006194683],"genre_scores_gemma":[0.97710925,0.000021771248,0.021914557,0.0001371475,0.0007612371,0.000012628258,0.000011206335,0.000018349563,0.000013837728],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978308,0.00016513585,0.0009221454,0.0003119721,0.00040510477,0.00036483406],"domain_scores_gemma":[0.99736214,0.00032632475,0.0008481328,0.00017863952,0.0010312242,0.00025354797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835864,0.0002667985,0.00055552495,0.00019329709,0.00013474016,0.00036925785,0.00066783454,0.00012360068,0.0000020032835],"category_scores_gemma":[0.00022014954,0.00022857152,0.00018528693,0.00008087568,0.0000703329,0.00040952736,0.00008280062,0.00024215947,5.0052523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007477721,0.0015509931,0.06489162,0.00024093033,0.006424477,0.003079999,0.001772772,0.85921377,0.01198602,0.01214713,0.0006340834,0.030580511],"study_design_scores_gemma":[0.010094196,0.00016835381,0.0014728272,0.00012133137,0.0001321404,0.0014562164,0.00008992277,0.98598915,0.000039559232,0.000024731977,0.0001927151,0.00021886437],"about_ca_topic_score_codex":0.00008289018,"about_ca_topic_score_gemma":0.0000068859317,"teacher_disagreement_score":0.8964955,"about_ca_system_score_codex":0.00010755862,"about_ca_system_score_gemma":0.00008267053,"threshold_uncertainty_score":0.9320876},"labels":[],"label_agreement":null},{"id":"W2153300965","doi":"10.1109/acc.2006.1656419","title":"Synchronized tracking control of multiple flying wings","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tracking (education); Trajectory; Control theory (sociology); Controller (irrigation); Track (disk drive); Computer science; Nonlinear system; Motion control; Simulation; Control (management); Artificial intelligence; Physics; Robot","score_opus":0.011516859916213627,"score_gpt":0.2149089993725139,"score_spread":0.20339213945630027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153300965","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024274234,0.00019208704,0.97149837,0.00026158447,0.00029562213,0.00034988727,0.000009234263,0.00030940268,0.0028095522],"genre_scores_gemma":[0.99100584,5.6363524e-7,0.008531049,0.000087215434,0.00008750989,0.000022029566,0.000004661676,0.000011013391,0.0002501313],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829584,0.00008415763,0.00052910874,0.0003553362,0.00035944034,0.00037614306],"domain_scores_gemma":[0.99871945,0.00029920362,0.00023136541,0.0005256549,0.00016263149,0.00006170669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040752036,0.00016501127,0.00035209846,0.000098991535,0.000106774205,0.00014259118,0.00076932576,0.00006872944,0.000019618137],"category_scores_gemma":[0.00010759326,0.0001485747,0.00014034534,0.00028635486,0.000035136814,0.0005380788,0.00007314016,0.00008475548,0.000045057455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092634626,0.0007648556,0.091219686,0.00021425921,0.00029011618,0.000109259156,0.00074716465,0.010059368,0.6063213,0.19491532,0.0033455153,0.09192057],"study_design_scores_gemma":[0.005919821,0.000042712865,0.0131681375,0.000064154854,0.000018999299,0.000014546862,0.0000421894,0.96390176,0.014090573,0.00043980483,0.0019984895,0.00029879695],"about_ca_topic_score_codex":0.00092665496,"about_ca_topic_score_gemma":0.000053933538,"teacher_disagreement_score":0.9667316,"about_ca_system_score_codex":0.00006700293,"about_ca_system_score_gemma":0.000049025086,"threshold_uncertainty_score":0.60587007},"labels":[],"label_agreement":null},{"id":"W2153308636","doi":"10.1109/acc.2011.5991471","title":"Leader selection in multi-agent systems subject to partial failure","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Controllability; Selection (genetic algorithm); Computer science; Network controllability; Information flow; Mathematical optimization; Graph; Multi-agent system; Reliability (semiconductor); Distributed computing; Topology (electrical circuits); Theoretical computer science; Mathematics; Artificial intelligence; Applied mathematics; Combinatorics","score_opus":0.06740671636600963,"score_gpt":0.25964740011355764,"score_spread":0.192240683747548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153308636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027009783,0.000046597313,0.969056,0.00028262965,0.0010020894,0.0009261271,0.000004175075,0.00043287274,0.0012397383],"genre_scores_gemma":[0.9877131,6.822105e-7,0.010682529,0.0001452145,0.00008354164,0.00020692154,0.0000024349993,0.000015296931,0.0011502753],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772614,0.00021750043,0.0004920248,0.00063192466,0.0003435697,0.00058884267],"domain_scores_gemma":[0.99909747,0.00003346362,0.0000968332,0.00044072862,0.000112546215,0.00021895037],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005194035,0.00022851917,0.00029421598,0.0002559092,0.00007202007,0.00019628293,0.0008065569,0.00012334957,0.000042846877],"category_scores_gemma":[0.000055607532,0.00020484671,0.00007656583,0.0008045167,0.000014755912,0.0005146107,0.00014058787,0.00015708074,0.0009527629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004353659,0.0058421204,0.3999368,0.0005896671,0.0008061146,0.0007956275,0.052321363,0.03267856,0.13717511,0.27999705,0.06410066,0.025321567],"study_design_scores_gemma":[0.0039051238,0.0004146441,0.07735791,0.00014962729,0.000022168746,0.00009864291,0.0012178582,0.87693805,0.015290205,0.000036752022,0.023328528,0.0012404652],"about_ca_topic_score_codex":0.0027771085,"about_ca_topic_score_gemma":0.0014334109,"teacher_disagreement_score":0.9607033,"about_ca_system_score_codex":0.00019937761,"about_ca_system_score_gemma":0.00007015938,"threshold_uncertainty_score":0.9998251},"labels":[],"label_agreement":null},{"id":"W2156229246","doi":"10.1109/tsmca.2008.918591","title":"A Framework for Coordinated Control of Multiagent Systems and Its Applications","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics - Part A Systems and Humans","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workspace; Distributed computing; Computer science; Multi-agent system; Layer (electronics); Decentralised system; Process (computing); Hybrid system; Robot; Control engineering; Overhead (engineering); Control (management); Engineering; Artificial intelligence","score_opus":0.036652362143557396,"score_gpt":0.25861166925163886,"score_spread":0.22195930710808148,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156229246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0155109,0.008962844,0.96864206,0.000076326534,0.0014423636,0.004448084,0.0005952722,0.00018723441,0.00013491852],"genre_scores_gemma":[0.995122,0.0004885445,0.00022010719,0.000025282841,0.00018232725,0.002434816,0.000009106504,0.000044138244,0.0014736482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968246,0.00025919089,0.0011406791,0.0008367929,0.0004292613,0.0005094379],"domain_scores_gemma":[0.9974993,0.00052362256,0.00052710966,0.00070467306,0.00038531603,0.00035996686],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054724055,0.00045799802,0.0009879188,0.00026765082,0.00069345866,0.00036729212,0.00039271437,0.00031099468,0.0000017590507],"category_scores_gemma":[0.000012434199,0.0004299234,0.00013724962,0.0002649962,0.00017038824,0.00023290902,0.000008988736,0.0002461216,0.000010716691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035313764,0.0019991177,0.0010413174,0.009670905,0.0028947105,0.00007449985,0.01098574,0.046780955,0.0053994283,0.91490227,0.0020666146,0.0038312925],"study_design_scores_gemma":[0.008018876,0.0011246296,0.0005224869,0.0020852375,0.00046016718,0.0005988903,0.0020300867,0.92333895,0.00035705615,0.00016788686,0.059842356,0.0014533708],"about_ca_topic_score_codex":0.00042407302,"about_ca_topic_score_gemma":0.000025151274,"teacher_disagreement_score":0.97961116,"about_ca_system_score_codex":0.00006498093,"about_ca_system_score_gemma":0.00005844047,"threshold_uncertainty_score":0.9998153},"labels":[],"label_agreement":null},{"id":"W2157493323","doi":"10.1109/robot.2009.5152563","title":"Backbone-based connectivity control for mobile networks","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backbone network; Social connectedness; Computer science; Distributed computing; Constraint (computer-aided design); Task (project management); Computer network; Network topology; Communication in small groups; Multi-agent system; Artificial intelligence; Engineering","score_opus":0.010452716635519468,"score_gpt":0.2416701125196433,"score_spread":0.23121739588412382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157493323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015988997,0.00012423685,0.99313504,0.0013290318,0.00050055725,0.001458361,0.000019825213,0.00050398044,0.0013300608],"genre_scores_gemma":[0.9912549,5.770591e-7,0.00576869,0.002338077,0.00014951736,0.00025559939,0.000011757618,0.000008135558,0.00021269603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838376,0.000101817786,0.00030363884,0.00049473334,0.00020941865,0.00050664245],"domain_scores_gemma":[0.9983264,0.0005037664,0.00012418083,0.0007181433,0.00016891878,0.00015856767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005596744,0.00019885536,0.0003373267,0.000059949958,0.00012883493,0.0002288104,0.0007553396,0.00010639429,0.000018252196],"category_scores_gemma":[0.0000741647,0.00017479263,0.00018584801,0.0002394974,0.000020933576,0.00033386983,0.00002244829,0.00009352386,0.000038284048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033268798,0.0013670172,0.002160594,0.0000395398,0.00018167397,0.000035033954,0.00008557355,0.411593,0.004986804,0.33689654,0.03684402,0.20547754],"study_design_scores_gemma":[0.0040409556,0.00035693805,0.0018338959,0.0000100341285,0.00001114483,0.0000025865572,0.000005128286,0.98529005,0.0004478026,0.0006250745,0.007139912,0.00023645203],"about_ca_topic_score_codex":0.000021280419,"about_ca_topic_score_gemma":0.000012057348,"teacher_disagreement_score":0.98965603,"about_ca_system_score_codex":0.00007229973,"about_ca_system_score_gemma":0.000069677,"threshold_uncertainty_score":0.71278363},"labels":[],"label_agreement":null},{"id":"W2159013590","doi":"10.1109/icma.2007.4303973","title":"Temperature Control of Energetic Swarms","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Swarm behaviour; Particle swarm optimization; Multi-swarm optimization; Computer science; Trajectory; Controller (irrigation); Swarm intelligence; Temperature control; Swarm robotics; Mathematical optimization; Control theory (sociology); Control (management); Algorithm; Mathematics; Engineering; Control engineering; Artificial intelligence; Physics","score_opus":0.0051362555626850975,"score_gpt":0.21443524685813684,"score_spread":0.20929899129545174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159013590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020031124,0.0002351974,0.9682687,0.0004987294,0.0005961317,0.00020970915,0.0000068389036,0.00018639337,0.009967173],"genre_scores_gemma":[0.9954194,0.0000015956888,0.0032724452,0.00035021288,0.00007362115,0.0000053215663,0.000002384978,0.000006158449,0.00086886506],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986695,0.000043838205,0.0003723749,0.000264711,0.0003256492,0.00032393736],"domain_scores_gemma":[0.9989113,0.00013449109,0.00011353835,0.00056863413,0.00015232773,0.00011966716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061723194,0.00012669484,0.0002338087,0.00009389556,0.000037676138,0.000055533448,0.00077112124,0.00008910705,0.000019203837],"category_scores_gemma":[0.00005742754,0.0000985477,0.000093200186,0.00033811468,0.000029070925,0.00020716543,0.0000577001,0.00008911036,0.00005529757],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049532595,0.00031401092,0.006617822,0.00005197198,0.00016648386,0.00009657821,0.00038449076,0.000646312,0.50525373,0.46099555,0.0057033165,0.019720225],"study_design_scores_gemma":[0.017291581,0.0007408504,0.070503846,0.00018422803,0.00009655541,0.00015737886,0.00041224575,0.092685126,0.7658357,0.0043497863,0.045781806,0.0019609167],"about_ca_topic_score_codex":0.000049445098,"about_ca_topic_score_gemma":0.000015224779,"teacher_disagreement_score":0.9753883,"about_ca_system_score_codex":0.00002955257,"about_ca_system_score_gemma":0.000040133244,"threshold_uncertainty_score":0.40186587},"labels":[],"label_agreement":null},{"id":"W2160507774","doi":"10.1109/cca.2005.1507118","title":"Development of an Experimental Testbed for Multiple Vehicles Formation Flight Control","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Testbed; Computer science; Control (management); Aerospace engineering; Control engineering; Motion control; Degrees of freedom (physics and chemistry); Simulation; Control theory (sociology); Aeronautics; Engineering; Physics; Artificial intelligence; Robot","score_opus":0.02260758101646821,"score_gpt":0.25813107318675793,"score_spread":0.23552349217028973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160507774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18117341,0.00004875737,0.81741947,0.00017051848,0.000101401085,0.00065819157,0.000012364764,0.00014358755,0.0002723091],"genre_scores_gemma":[0.7664273,7.084826e-8,0.2332082,0.00009559541,0.000042356976,0.00014898369,0.000020274769,0.0000055014248,0.000051741907],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987842,0.000033821598,0.00048680275,0.00022766858,0.00023853633,0.00022897558],"domain_scores_gemma":[0.99923635,0.00008712966,0.00016239469,0.00030697932,0.000115709205,0.00009144273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029456752,0.00012707099,0.00018991309,0.000068953654,0.00010507107,0.00007655387,0.00050424505,0.000047738922,0.000006466318],"category_scores_gemma":[0.000030307498,0.000110080946,0.000056368015,0.000088286186,0.000014630393,0.0011197478,0.000045719695,0.000026829599,0.000029483412],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007773969,0.000724558,0.0001964511,0.000032833836,0.0000524224,8.2502567e-7,0.0030840696,0.00084944017,0.8756751,0.015161434,0.00057880575,0.10356636],"study_design_scores_gemma":[0.0024811223,0.00004860085,0.00034086013,0.000007131278,0.0000022996496,0.000002070802,0.00014401635,0.5450989,0.44497198,0.000011165607,0.006786637,0.000105198844],"about_ca_topic_score_codex":0.0000067085516,"about_ca_topic_score_gemma":0.000034858393,"teacher_disagreement_score":0.5852539,"about_ca_system_score_codex":0.00010580247,"about_ca_system_score_gemma":0.00005601968,"threshold_uncertainty_score":0.44889706},"labels":[],"label_agreement":null},{"id":"W2160726730","doi":"10.1109/icsmc.2007.4413765","title":"Optimal cooperation in a modified leader-follower team of agents with partial availability of leader command","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Robustness (evolution); Minification; Computer science; Control theory (sociology); Function (biology); Control (management); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.03145740414063189,"score_gpt":0.2663178034142101,"score_spread":0.23486039927357819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160726730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4774889,0.0000153061,0.5193456,0.00010121818,0.00008860366,0.00037301792,0.000006587404,0.000033826167,0.002546989],"genre_scores_gemma":[0.99361837,5.2394375e-7,0.0059492593,0.000052272986,0.000018470419,0.000013535382,0.000007948985,0.000007012714,0.00033261083],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980811,0.00010973047,0.00069304626,0.0003646033,0.00042285188,0.0003286881],"domain_scores_gemma":[0.99881786,0.000102054764,0.00020083296,0.0005955495,0.0002006588,0.00008303384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010388353,0.00015889673,0.00036507467,0.00011697809,0.00003300204,0.000037676968,0.0004966975,0.00009254146,0.00003552937],"category_scores_gemma":[0.000059655733,0.00012658365,0.000058001595,0.0004357243,0.00011768263,0.00040188787,0.00008128277,0.00011653633,0.000012840548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004017026,0.011112863,0.50578177,0.00083997345,0.0007910858,0.00016624565,0.024453664,0.2507167,0.115381114,0.0599757,0.011077288,0.01568661],"study_design_scores_gemma":[0.008533004,0.00070634484,0.0653202,0.0001257451,0.000028533746,0.000012034465,0.0007040194,0.8486285,0.07459973,0.000020785013,0.0008217982,0.00049931364],"about_ca_topic_score_codex":0.000352694,"about_ca_topic_score_gemma":0.0005073933,"teacher_disagreement_score":0.59791183,"about_ca_system_score_codex":0.00006545829,"about_ca_system_score_gemma":0.00008932699,"threshold_uncertainty_score":0.5161931},"labels":[],"label_agreement":null},{"id":"W2161699417","doi":"10.1109/acc.2011.5990990","title":"Relaxed convergence conditions for multi-agent systems under a class of consensus algorithms","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Intersection (aeronautics); Convex hull; Computer science; Multi-agent system; Mathematical optimization; Class (philosophy); Graph; Property (philosophy); Mathematics; Algorithm; Regular polygon; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.11530399165506845,"score_gpt":0.2981719978308494,"score_spread":0.18286800617578097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161699417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004055549,0.00018165588,0.98973024,0.00016305645,0.0023485392,0.0014899808,0.00034845906,0.0003063913,0.0013761165],"genre_scores_gemma":[0.9517423,0.0000049005803,0.045922905,0.00010709109,0.000038494356,0.00032782636,0.000029843772,0.000019910065,0.0018067478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976058,0.0001584348,0.00082458725,0.0005779703,0.00034448635,0.000488704],"domain_scores_gemma":[0.99761236,0.0002696543,0.00041066998,0.0009279333,0.00055991084,0.00021950148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005088735,0.00025649488,0.00046431783,0.00014205198,0.00013590016,0.00006619669,0.00097828,0.00014885422,0.00004510494],"category_scores_gemma":[0.00010246824,0.00023174475,0.000203282,0.00033600265,0.00015374033,0.00020727256,0.0001392743,0.00010094647,0.00012746779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040738294,0.00076594,0.001150453,0.0002134726,0.00047902061,0.000032310065,0.0010906268,0.0007748901,0.009493089,0.9737792,0.011791286,0.00038895954],"study_design_scores_gemma":[0.0034601982,0.00021812004,0.0033776911,0.00008396917,0.000059156908,0.000054557975,0.0008963825,0.9835568,0.004648332,0.0007294928,0.0024519928,0.00046327265],"about_ca_topic_score_codex":0.000576212,"about_ca_topic_score_gemma":0.000036705063,"teacher_disagreement_score":0.98278195,"about_ca_system_score_codex":0.00009964826,"about_ca_system_score_gemma":0.00016554579,"threshold_uncertainty_score":0.94502765},"labels":[],"label_agreement":null},{"id":"W2161886258","doi":"10.1109/iros.2009.5354788","title":"Discrete event systems based formation control framework to coordinate multiple nonholonomic mobile robots","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Modular design; Mobile robot; Computer science; Scalability; Controller (irrigation); Event (particle physics); Nonholonomic system; Robot; Control engineering; Discrete event dynamic system; Supervisory control; Distributed computing; Obstacle; Robot kinematics; Control (management); Discrete system; Engineering; Artificial intelligence; Algorithm","score_opus":0.00845875806551542,"score_gpt":0.2467584888366229,"score_spread":0.2382997307711075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161886258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050603324,0.00011514984,0.98887813,0.0016906778,0.0010009774,0.0022956918,0.000050465045,0.0005518994,0.00035666398],"genre_scores_gemma":[0.98376566,8.7334155e-7,0.014295098,0.0012209822,0.00011683161,0.00040346346,0.00002743878,0.000014571357,0.000155093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736303,0.00021204773,0.0007864848,0.00058627536,0.0004143807,0.000637754],"domain_scores_gemma":[0.9978467,0.00027741963,0.00028500895,0.001089337,0.00016600236,0.0003355202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065894163,0.0003141614,0.00047185543,0.00018833755,0.0001754098,0.0005441241,0.0011660173,0.00015210875,0.000012588784],"category_scores_gemma":[0.00013994085,0.00027676387,0.0001506464,0.00037746798,0.000014127819,0.0008613359,0.00007213987,0.00017632345,0.00067719066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009706655,0.00020833765,0.0008233057,0.000042142103,0.000048734557,0.00002340099,0.00031673734,0.96438146,0.0034760244,0.0155343115,0.0034442227,0.011604282],"study_design_scores_gemma":[0.0020631682,0.00033772297,0.0023259388,0.00011322924,0.00001139995,0.000008648857,0.00005480206,0.9893118,0.00060858874,0.00010311108,0.0046848087,0.00037678622],"about_ca_topic_score_codex":0.00011557508,"about_ca_topic_score_gemma":0.000010680901,"teacher_disagreement_score":0.9787053,"about_ca_system_score_codex":0.00029979844,"about_ca_system_score_gemma":0.00006314902,"threshold_uncertainty_score":0.99996847},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026519909471791153,"score_gpt":0.25951183237284253,"score_spread":0.2329919229010514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163525955","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00067369494,0.00017428225,0.99547267,0.0014930379,0.00038870814,0.0005062478,0.000042779688,0.00032983735,0.0009187619],"genre_scores_gemma":[0.91490746,0.0000057190523,0.08399112,0.0003276433,0.000068026246,0.00009968155,0.00043444178,0.000011442978,0.00015446947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874294,0.00011475838,0.00031524347,0.00021561047,0.0002020657,0.0004094123],"domain_scores_gemma":[0.9985441,0.00023592396,0.00014962826,0.0007365634,0.00019563884,0.00013815836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005583705,0.00014201236,0.0001715303,0.000058800764,0.00021988623,0.00020709175,0.00058353454,0.00007790888,0.000027224876],"category_scores_gemma":[0.000069332746,0.00013524685,0.00006937152,0.0002441616,0.000025787067,0.0011504045,0.00017479442,0.00007466022,0.000047146703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022330174,0.00034516677,0.003018142,0.000037453316,0.00015047732,7.0305197e-7,0.00079082017,0.21650925,0.0007428596,0.7625572,0.012195931,0.0036296416],"study_design_scores_gemma":[0.0009826644,0.000016749987,0.0011918785,0.000012375963,0.000015458385,0.00000932076,0.00010987801,0.99183214,0.00042332264,0.00038490296,0.004817417,0.00020389385],"about_ca_topic_score_codex":0.00003640566,"about_ca_topic_score_gemma":0.0000035809292,"teacher_disagreement_score":0.91423374,"about_ca_system_score_codex":0.00012849865,"about_ca_system_score_gemma":0.000034648285,"threshold_uncertainty_score":0.55152065},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0054511012479332805,"score_gpt":0.20317861172142998,"score_spread":0.1977275104734967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164642931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017317464,0.000014540107,0.99138814,0.001608382,0.0013091596,0.0012128577,0.00024390193,0.0017206151,0.00077065534],"genre_scores_gemma":[0.994702,0.000003622169,0.0036449023,0.00082439074,0.000071325514,0.00034961512,0.00003598589,0.000041136864,0.00032705488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964275,0.0005133633,0.0008569338,0.0007845024,0.00074034714,0.00067737227],"domain_scores_gemma":[0.9968189,0.0009297953,0.00039526648,0.0013390904,0.00021791052,0.0002990642],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00057134166,0.0005051672,0.0008469462,0.00032997906,0.00036186766,0.00037023754,0.0010302175,0.00021421688,0.00021443299],"category_scores_gemma":[0.00007112822,0.00046586595,0.00035128908,0.00064754975,0.0000859503,0.00046391698,0.000003217466,0.00026641818,0.0009061027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022531327,0.0017423762,0.00006653147,0.000101559825,0.0008476524,0.000031444935,0.0003381153,0.8625755,0.00567699,0.0068876687,0.0025341995,0.11897265],"study_design_scores_gemma":[0.0063452064,0.00040019018,0.00030720202,0.00012691706,0.00009633435,0.000013209713,0.000009069341,0.9897393,0.0015221322,0.00014223746,0.0008251177,0.00047308064],"about_ca_topic_score_codex":0.000025185283,"about_ca_topic_score_gemma":0.0000051309107,"teacher_disagreement_score":0.9929702,"about_ca_system_score_codex":0.00018336042,"about_ca_system_score_gemma":0.000076651355,"threshold_uncertainty_score":0.9998718},"labels":[],"label_agreement":null},{"id":"W2166029878","doi":"10.1109/icscs.2009.5412216","title":"Coordinated motion control of mobile sensors in surveillance systems","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Ontario","keywords":"Computer science; Mobile computing; Mobile telephony; Control (management); Motion control; Modalities; Motion (physics); Task (project management); Real-time computing; Distributed computing; Mobile radio; Artificial intelligence; Telecommunications; Engineering; Systems engineering","score_opus":0.007028375215023963,"score_gpt":0.22155834849895994,"score_spread":0.21452997328393597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166029878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1324669,0.00034239297,0.8628823,0.00029947815,0.0004999161,0.0009591111,0.000022875345,0.00026125653,0.0022657346],"genre_scores_gemma":[0.999489,0.0000033145764,0.00017621409,0.000042357475,0.000023317125,0.00002960458,0.000006052568,0.0000047502,0.00022537744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982202,0.00027045948,0.00058151135,0.0003429539,0.0002739629,0.00031089413],"domain_scores_gemma":[0.99885565,0.00012391472,0.00021723525,0.00054182153,0.00018916425,0.00007222838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007204479,0.00014969599,0.00043118896,0.00015760437,0.000024626639,0.000075223805,0.0005450018,0.000086113905,0.000005375936],"category_scores_gemma":[0.000067081084,0.00013420779,0.00006370831,0.00059980404,0.000018987686,0.0002823293,0.000023023695,0.00008451314,0.000034400007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019601578,0.0019320258,0.13375814,0.00026258832,0.000203853,0.00023556268,0.0011064461,0.49270323,0.087617055,0.22194532,0.0032786126,0.05676116],"study_design_scores_gemma":[0.002672093,0.00017038103,0.049993057,0.000044099692,0.0000025584957,0.000013789524,0.000068735724,0.9456064,0.0007541392,0.000077347184,0.000387716,0.000209675],"about_ca_topic_score_codex":0.0003588115,"about_ca_topic_score_gemma":0.00001717602,"teacher_disagreement_score":0.8670221,"about_ca_system_score_codex":0.00008350059,"about_ca_system_score_gemma":0.000028892979,"threshold_uncertainty_score":0.5472835},"labels":[],"label_agreement":null},{"id":"W2166118011","doi":"10.1109/acc.2006.1657387","title":"Sliding mode formation control for under-actuated autonomous surface vehicles","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Actuator; Sliding mode control; Vehicle dynamics; Robust control; Mode (computer interface); Computer science; Surface (topology); Scalability; Control engineering; Engineering; Control (management); Control system; Aerospace engineering; Physics; Mathematics; Artificial intelligence","score_opus":0.01847029756986008,"score_gpt":0.24421381449721305,"score_spread":0.22574351692735298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166118011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03222634,0.000051246257,0.9632539,0.001586911,0.00027086868,0.0007531161,0.000039688704,0.0006358944,0.0011820378],"genre_scores_gemma":[0.98440456,6.210311e-7,0.014609495,0.00021612759,0.00006451705,0.000051637697,0.000046978497,0.00001297776,0.0005931089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985253,0.00006376964,0.00043767647,0.00032073207,0.00022780428,0.00042468388],"domain_scores_gemma":[0.9989691,0.00022445939,0.00018306982,0.00039407378,0.00015972223,0.000069573354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003255919,0.00017823817,0.00024351748,0.000061989565,0.00018158436,0.0003614341,0.0005506246,0.000085270534,0.0000044187022],"category_scores_gemma":[0.000024931547,0.00016317585,0.00010512032,0.0001878854,0.000011704063,0.0010262986,0.000044855275,0.000058420483,0.00006271504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039269704,0.00015665113,0.0002830574,0.000049656282,0.000065077016,0.000004085236,0.00016442194,0.32052553,0.096606426,0.5696969,0.0070550637,0.005353876],"study_design_scores_gemma":[0.0020940565,0.00004049508,0.0004694744,0.000010767279,0.000011032839,0.0000062527592,0.000028931205,0.9815964,0.010191267,0.0036434366,0.001699043,0.0002088595],"about_ca_topic_score_codex":0.00043141184,"about_ca_topic_score_gemma":0.00007884625,"teacher_disagreement_score":0.9521782,"about_ca_system_score_codex":0.00018478447,"about_ca_system_score_gemma":0.00005799385,"threshold_uncertainty_score":0.66541183},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012549100500635622,"score_gpt":0.2060229525630338,"score_spread":0.19347385206239817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166306230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1797021,0.000046803896,0.81936723,0.00013185044,0.0002512657,0.0002513008,0.000011694078,0.00014350857,0.0000942414],"genre_scores_gemma":[0.9959318,0.0000037046254,0.0037561092,0.000119767195,0.000084712425,0.0000038251087,0.00002479584,0.0000065181957,0.000068735484],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989429,0.000082973194,0.00026418356,0.00024480376,0.00027153906,0.00019360724],"domain_scores_gemma":[0.99937266,0.00003143151,0.00013478275,0.00025211764,0.0001351317,0.000073897645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010684818,0.00013056796,0.00015805331,0.00009327986,0.0002768853,0.00009780261,0.0002088576,0.00008483334,0.000015523123],"category_scores_gemma":[0.00003437641,0.0001145642,0.00002812541,0.00021893268,0.000033651104,0.0015802864,0.000046625548,0.00006445545,0.000012710239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015758061,0.00047758184,0.06351276,0.0003277615,0.00047755253,0.0002900224,0.01271552,0.1755074,0.29313955,0.31508836,0.0054949643,0.13281097],"study_design_scores_gemma":[0.0011923988,0.000035408993,0.0056385626,0.000010373819,0.000008892834,0.0002445882,0.000017774617,0.99041003,0.0020532226,0.00011373726,0.00013600888,0.0001390147],"about_ca_topic_score_codex":0.0000390526,"about_ca_topic_score_gemma":0.0000072716703,"teacher_disagreement_score":0.8162297,"about_ca_system_score_codex":0.00010675792,"about_ca_system_score_gemma":0.000038690137,"threshold_uncertainty_score":0.46717927},"labels":[],"label_agreement":null},{"id":"W2166450710","doi":"10.1109/acc.2009.5160691","title":"Overlapping control systems with delayed communication channels: Stability analysis and controller design","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Linear matrix inequality; Attenuation; Controller (irrigation); Stability (learning theory); Computer science; LTI system theory; Control (management); Information flow; Invariant (physics); Control system; Linear system; Mathematics; Mathematical optimization; Engineering","score_opus":0.02235737071169227,"score_gpt":0.22779607510175606,"score_spread":0.2054387043900638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166450710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006601887,0.00072358234,0.9896632,0.0008518565,0.000054815853,0.0012183299,0.000011377501,0.0003154018,0.0005595849],"genre_scores_gemma":[0.9923996,0.000014964664,0.007090183,0.00028406424,0.000022827868,0.00008708162,0.000009146165,0.000006759615,0.000085415966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972435,0.00081593223,0.00053996436,0.0005746759,0.00042366717,0.00040223906],"domain_scores_gemma":[0.9974927,0.0005542673,0.0002947867,0.0011784642,0.0002941299,0.00018566054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016626532,0.0002628284,0.00071582675,0.00020437925,0.00023479352,0.00068091514,0.0008000528,0.00009602555,0.00000543013],"category_scores_gemma":[0.00006480269,0.0001990075,0.000104905135,0.00091877894,0.000056962883,0.00067245675,0.00005405479,0.0001400882,0.0000076731785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030555183,0.002528887,0.03839777,0.00018204213,0.02283706,0.00010525209,0.00870748,0.57118595,0.025875138,0.27405688,0.0023465306,0.05072151],"study_design_scores_gemma":[0.0034233686,0.0002317396,0.005127686,0.000019953783,0.0002694489,0.000009478076,0.00017029693,0.99010557,0.00010276757,0.00018447042,0.000085624124,0.0002695854],"about_ca_topic_score_codex":0.0004832221,"about_ca_topic_score_gemma":0.00003551945,"teacher_disagreement_score":0.98579764,"about_ca_system_score_codex":0.00011120461,"about_ca_system_score_gemma":0.00005007822,"threshold_uncertainty_score":0.81152904},"labels":[],"label_agreement":null},{"id":"W2167639569","doi":"10.1109/acc.2005.1469920","title":"Adaptive synchronized attitude angular velocity tracking control of multi-UAVs","year":2005,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Angular velocity; Convergence (economics); Tracking (education); Control theory (sociology); Synchronization (alternating current); Attitude control; Computer science; Adaptive control; Trajectory; Control (management); Physics; Engineering; Aerospace engineering; Artificial intelligence; Classical mechanics; Telecommunications","score_opus":0.025929417128386867,"score_gpt":0.25683833462263944,"score_spread":0.23090891749425257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2167639569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006132226,0.00063253316,0.99074036,0.00053345645,0.00022580556,0.0005660398,0.000028430813,0.00029316614,0.0008480001],"genre_scores_gemma":[0.93181485,0.0000036446856,0.06755316,0.00023061315,0.00010578497,0.00003247667,0.0000034481805,0.000013138601,0.00024285234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977635,0.00018921777,0.0005865033,0.0005139043,0.00047505074,0.0004718184],"domain_scores_gemma":[0.9983319,0.00018478165,0.00028267482,0.0007437854,0.00030179814,0.00015502736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005934912,0.00024671882,0.0005107634,0.00010750389,0.000095932075,0.00010405707,0.001131533,0.000116400384,0.00005915378],"category_scores_gemma":[0.000117932876,0.00022133892,0.00019687598,0.00030803896,0.000073500465,0.00072468625,0.00012951704,0.0001554818,0.00014409094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037295578,0.003747007,0.010490102,0.00021044262,0.0021385397,0.00019271887,0.004862765,0.038419835,0.09493854,0.17870031,0.002875826,0.66305095],"study_design_scores_gemma":[0.005993164,0.00008244595,0.008381932,0.000045860957,0.000029888317,0.000010821096,0.00005811246,0.97732383,0.0059174784,0.00003772252,0.0018133076,0.00030540643],"about_ca_topic_score_codex":0.00018421118,"about_ca_topic_score_gemma":0.00012023491,"teacher_disagreement_score":0.93890405,"about_ca_system_score_codex":0.00018094135,"about_ca_system_score_gemma":0.00011367982,"threshold_uncertainty_score":0.9025939},"labels":[],"label_agreement":null},{"id":"W2169167445","doi":"10.1109/allerton.2011.6120272","title":"Distributed consensus and optimization under communication delays","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Communication source; Convergence (economics); Enhanced Data Rates for GSM Evolution; Markov chain; Markov process; Consensus; Mathematical optimization; Telecommunications network; Optimization problem; Rate of convergence; Theoretical computer science; Algorithm; Mathematics; Computer network; Multi-agent system; Artificial intelligence; Machine learning","score_opus":0.037303067188415646,"score_gpt":0.22872545346052364,"score_spread":0.191422386272108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169167445","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022095048,0.0001303676,0.9914277,0.0006525914,0.00008338751,0.00019591511,0.0000145138065,0.0002600387,0.0050259903],"genre_scores_gemma":[0.87841713,0.000014084142,0.12127327,0.00014398832,0.0000054297752,0.00001380861,0.00004432176,0.000005282517,0.00008268061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991336,0.00011910926,0.00022726622,0.0002273468,0.00012245799,0.00017023027],"domain_scores_gemma":[0.99894464,0.00008107926,0.00009999712,0.00065897935,0.00012661073,0.00008871525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002180387,0.00010385816,0.00011865048,0.00004584996,0.00011780952,0.00010590408,0.00047238622,0.00006154718,0.000031775457],"category_scores_gemma":[0.00003562902,0.000094921765,0.00002359056,0.00019903512,0.00005805035,0.00022807816,0.00018464107,0.00006309288,0.000028096649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003027049,0.0002654137,0.0031728398,0.000020076119,0.00013212839,0.000012695647,0.001155296,0.02551951,0.0004574901,0.95903766,0.00458558,0.005611019],"study_design_scores_gemma":[0.0007792303,0.00003206556,0.0060995817,0.000012576236,0.00001218024,0.000029763456,0.00014697919,0.9899742,0.0002917067,0.0020628835,0.00036964077,0.00018920089],"about_ca_topic_score_codex":0.00020363188,"about_ca_topic_score_gemma":0.000023255205,"teacher_disagreement_score":0.9644547,"about_ca_system_score_codex":0.00003495247,"about_ca_system_score_gemma":0.000025017116,"threshold_uncertainty_score":0.38707972},"labels":[],"label_agreement":null},{"id":"W2169514951","doi":"","title":"Demo abstract: R.A.V.E.N. — Remote autonomous vehicle explorer network","year":2011,"lang":"en","type":"article","venue":"ScholarlyCommons (University of Pennsylvania)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Redundancy (engineering); Search and rescue; Implementation; Computer science; Limiting; Real-time computing; Wireless; Key (lock); Embedded system; Engineering; Systems engineering; Simulation; Computer security; Telecommunications; Artificial intelligence; Robot; Operating system","score_opus":0.04264827799318418,"score_gpt":0.20268646181112454,"score_spread":0.16003818381794035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169514951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40665203,0.00050828897,0.5203772,0.0012036382,0.0013604707,0.0008645705,0.00006443782,0.0010977697,0.06787156],"genre_scores_gemma":[0.9484575,0.000017255208,0.050643705,0.00007189293,0.00006224074,4.974129e-7,0.000010413131,0.000021426562,0.0007150806],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9976515,0.00017121766,0.00034083734,0.0006723224,0.00048139138,0.000682711],"domain_scores_gemma":[0.997361,0.000101329126,0.0004086187,0.0015276212,0.0002553643,0.00034605316],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007952763,0.00028411948,0.00046916306,0.00021378818,0.0005175921,0.00015153797,0.00314873,0.00021901108,0.00027581136],"category_scores_gemma":[0.00005295029,0.00036369724,0.0002744397,0.00073955883,0.00016114554,0.0029709055,0.00080672454,0.0005462408,0.00075007824],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094783294,0.0028998947,0.08219908,0.00039505665,0.0020749054,0.0041720374,0.041662958,0.0013898014,0.027122812,0.2569832,0.049582366,0.53057003],"study_design_scores_gemma":[0.0069328514,0.00063863234,0.8266815,0.00036649377,0.0002644807,0.00012162402,0.0034713484,0.05894343,0.0010712263,0.016058374,0.08311755,0.0023324674],"about_ca_topic_score_codex":0.0012565679,"about_ca_topic_score_gemma":0.00034275954,"teacher_disagreement_score":0.74448246,"about_ca_system_score_codex":0.00014496068,"about_ca_system_score_gemma":0.00014010625,"threshold_uncertainty_score":0.9998815},"labels":[],"label_agreement":null},{"id":"W2169607243","doi":"10.1109/acc.2006.1657270","title":"Adaptive formation control of UAVs in the presence of unknown vortex forces and leader commands","year":2006,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Heading (navigation); Vortex; Aerodynamics; Control theory (sociology); Frame (networking); Adaptive control; Control (management); Dynamics (music); Computer science; Engineering; Physics; Aerospace engineering; Mechanics; Artificial intelligence; Acoustics","score_opus":0.014016580636375899,"score_gpt":0.21807656017708474,"score_spread":0.20405997954070884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169607243","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047050882,0.0002752896,0.9471689,0.0005950902,0.000047877777,0.0004562053,0.000010736331,0.000017521019,0.0043774936],"genre_scores_gemma":[0.99923635,0.0000024884973,0.0005806667,0.00004935704,0.000012866634,0.00002106854,0.0000024955878,0.0000019375232,0.0000927843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895805,0.0001430605,0.00036821314,0.0001294553,0.00025588344,0.00014532874],"domain_scores_gemma":[0.99909276,0.0003144571,0.00019591294,0.00028393097,0.00009688512,0.000016031145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004842027,0.00008232859,0.00019225413,0.000065186876,0.000029336086,0.000037578433,0.0004871511,0.00003859984,0.0000018705251],"category_scores_gemma":[0.000027561613,0.00005309265,0.000034292883,0.00020782623,0.00007355944,0.00054300274,0.000044586024,0.0000557942,0.0000013175187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000766491,0.00029260915,0.017892836,0.00012426078,0.000045854358,0.000005471246,0.004494063,0.0044334573,0.007730706,0.95718145,0.0015596527,0.0061629745],"study_design_scores_gemma":[0.0025031366,0.00016814972,0.055105645,0.00006283929,0.000012821011,0.000009062645,0.000860537,0.9341289,0.0034606345,0.0031688998,0.00039173392,0.00012764183],"about_ca_topic_score_codex":0.00064209953,"about_ca_topic_score_gemma":0.00035431207,"teacher_disagreement_score":0.9540126,"about_ca_system_score_codex":0.000011290152,"about_ca_system_score_gemma":0.000015224156,"threshold_uncertainty_score":0.21650556},"labels":[],"label_agreement":null},{"id":"W2169947777","doi":"","title":"Dynamic coalition formation for efficient sleep time allocation in wireless sensor networks using cooperative game theory","year":2009,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Core (optical fiber); Computer science; Game theory; Mathematical optimization; Upper and lower bounds; Cramér–Rao bound; Wireless; Time allocation; Regular polygon; Convex optimization; Sleep (system call); Cooperative game theory; Algorithm; Computer network; Mathematics; Telecommunications; Estimation theory; Mathematical economics","score_opus":0.017823038864073226,"score_gpt":0.27142724450923417,"score_spread":0.25360420564516095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169947777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04996186,0.000005249139,0.9449989,0.0011769418,0.0005873345,0.0010034424,0.000058372356,0.00013419149,0.002073711],"genre_scores_gemma":[0.996048,0.000009328447,0.0022207422,0.0005775216,0.000040764426,0.00007238913,0.0009626166,0.0000057831126,0.00006288792],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979997,0.00015629173,0.0007851378,0.00024929788,0.00053430273,0.0002752472],"domain_scores_gemma":[0.9981418,0.00012929726,0.0004973481,0.00027197963,0.0008901075,0.00006946787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077740336,0.00022120377,0.00020924033,0.00045368145,0.00013940637,0.00046372204,0.0005501572,0.0001406125,0.00003229702],"category_scores_gemma":[0.00012148883,0.0002169095,0.000074264506,0.00030799265,0.000024876921,0.0023888403,0.00005653569,0.00015876233,0.000109674715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030081454,0.0001513928,0.0000110578985,0.000016128519,0.000018482531,0.0000013920986,0.0014050036,0.49915215,0.0075997133,0.43818504,0.00007940301,0.0530794],"study_design_scores_gemma":[0.0014609452,0.00013619638,0.0007167884,0.00017946222,0.0000053997587,0.000010404548,0.00019944717,0.99513704,0.000612464,0.0011310136,0.00018127353,0.00022955137],"about_ca_topic_score_codex":0.0000114758295,"about_ca_topic_score_gemma":0.0000043623036,"teacher_disagreement_score":0.9460861,"about_ca_system_score_codex":0.0005798422,"about_ca_system_score_gemma":0.00008633257,"threshold_uncertainty_score":0.88453126},"labels":[],"label_agreement":null},{"id":"W2170080756","doi":"10.4310/cis.2003.v3.n4.a2","title":"Operations on Rigid Formations of Autonomous Agents","year":2003,"lang":"en","type":"article","venue":"Communications in Information and Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Australian Research Council; Australian Government; National Institutes of Health; National Science Foundation","keywords":"Computer science; Geology","score_opus":0.04830670093060086,"score_gpt":0.29495021132427307,"score_spread":0.24664351039367222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170080756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020397797,0.00077788084,0.79399675,0.0013900249,0.00086585473,0.0022238407,0.00013055903,0.00026417256,0.17995311],"genre_scores_gemma":[0.9959965,0.000089105735,0.0034580547,0.0001097215,0.0000029749142,0.00019403886,0.000068055735,0.000003053782,0.000078527715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984151,0.0002676811,0.00088288536,0.00008952551,0.00019740786,0.00014735889],"domain_scores_gemma":[0.9978953,0.00014336575,0.00022039069,0.0014914903,0.00018821543,0.0000612499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074041024,0.00010752908,0.00018784334,0.00035374763,0.00023301756,0.00026145735,0.0009034673,0.00006677274,0.0000038705475],"category_scores_gemma":[0.0002031869,0.00010468945,0.000034993634,0.0004734458,0.000054143507,0.0018366516,0.000118523574,0.0001265342,0.00008086659],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.771146e-7,0.00007126816,0.0005699468,0.000032025746,0.000011783237,8.537755e-8,0.0021678663,0.006772132,0.000020624117,0.98824525,0.0003121213,0.001795936],"study_design_scores_gemma":[0.0010749251,0.000047212437,0.0030469757,0.00012401174,0.0000053416097,0.000019447782,0.0014896477,0.8559897,0.00008710536,0.0002710943,0.13764945,0.00019509184],"about_ca_topic_score_codex":0.00012031958,"about_ca_topic_score_gemma":0.000028659191,"teacher_disagreement_score":0.98797417,"about_ca_system_score_codex":0.000096565105,"about_ca_system_score_gemma":0.0000970868,"threshold_uncertainty_score":0.42691118},"labels":[],"label_agreement":null},{"id":"W2170656329","doi":"10.1109/acc.2008.4586479","title":"Control and cohesion of energetic swarms","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Swarm behaviour; Computer science; Cohesion (chemistry); Particle swarm optimization; Multi-swarm optimization; Swarm robotics; Kinetic energy; Trajectory; Energy (signal processing); Control theory (sociology); Control (management); Physics; Algorithm; Artificial intelligence; Classical mechanics","score_opus":0.010690005259705912,"score_gpt":0.1929821092955934,"score_spread":0.18229210403588747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170656329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17579041,0.00026661294,0.8210112,0.00045599337,0.0001883338,0.00017698354,0.0000041816365,0.00011685074,0.0019894226],"genre_scores_gemma":[0.99695617,0.000014485511,0.0025201153,0.00013049883,0.000018374416,0.0000075663665,8.683261e-7,0.000003454842,0.00034845216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991689,0.000052168878,0.00021854189,0.00020391711,0.0002017064,0.0001547722],"domain_scores_gemma":[0.9993705,0.00008905484,0.000077770834,0.0003151094,0.000068639194,0.000078907244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014129083,0.00008373388,0.00019022069,0.000050454033,0.00005021942,0.000017508784,0.00031199702,0.0000381108,0.0000073963715],"category_scores_gemma":[0.000034935863,0.00006574002,0.000037767113,0.00012471098,0.000049836162,0.00017298808,0.00006020124,0.000034273424,0.000020887675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012311399,0.00086349505,0.1442695,0.00018790718,0.00033833954,0.00032261992,0.0021545566,0.0012177922,0.33696863,0.4447369,0.021449465,0.047367685],"study_design_scores_gemma":[0.0116490675,0.0005544319,0.17632976,0.00008109532,0.000040482144,0.00034354968,0.0000614326,0.74254066,0.053189356,0.0013472077,0.013044742,0.00081824017],"about_ca_topic_score_codex":0.000102433034,"about_ca_topic_score_gemma":0.0000028885102,"teacher_disagreement_score":0.8211658,"about_ca_system_score_codex":0.000010982487,"about_ca_system_score_gemma":0.00002765199,"threshold_uncertainty_score":0.26808003},"labels":[],"label_agreement":null},{"id":"W2171092891","doi":"10.1109/cdc.2010.5717486","title":"A class of bounded distributed controllers for connectivity preservation of unicycles","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Strongly connected component; Computer science; Control theory (sociology); Controller (irrigation); Nonholonomic system; Multi-agent system; Directed graph; Graph; Position (finance); Range (aeronautics); Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Mathematics; Control (management); Robot; Mobile robot; Theoretical computer science; Algorithm; Engineering; Artificial intelligence; Combinatorics","score_opus":0.017335762674474026,"score_gpt":0.256558859774365,"score_spread":0.23922309709989095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171092891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26428849,0.000010783958,0.73300797,0.0006938149,0.00033353895,0.00076943234,0.00022757793,0.00008401041,0.00058435876],"genre_scores_gemma":[0.99257886,5.81579e-7,0.0071424805,0.00002887301,0.000027416274,0.00007963603,0.00004773896,0.0000068746044,0.000087514905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860877,0.00008027401,0.0005019616,0.00029441508,0.0002719203,0.00024267538],"domain_scores_gemma":[0.99753416,0.00071744184,0.00042355375,0.0007195322,0.0005298284,0.00007546159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006702886,0.00013443778,0.00040618965,0.00007906948,0.000057263598,0.000055136545,0.0008152056,0.00011497476,0.000010461812],"category_scores_gemma":[0.00079361186,0.00011817371,0.00015526616,0.00029111395,0.00009384882,0.00054286566,0.000104938576,0.00009521921,0.0000017441976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015736649,0.0003189571,0.006693821,0.00010221024,0.00016693737,6.1112314e-7,0.000113614,0.00026570333,0.23866536,0.74961144,0.0015979698,0.0023059987],"study_design_scores_gemma":[0.008486918,0.00027095113,0.03239257,0.000033131775,0.000044120206,0.0000031323334,0.000080915524,0.8474637,0.088379234,0.014212645,0.008310185,0.00032244835],"about_ca_topic_score_codex":0.00031399517,"about_ca_topic_score_gemma":0.00044144504,"teacher_disagreement_score":0.84719807,"about_ca_system_score_codex":0.000027391641,"about_ca_system_score_gemma":0.00011115744,"threshold_uncertainty_score":0.4818984},"labels":[],"label_agreement":null},{"id":"W2171505431","doi":"10.1049/iet-cta.2012.0613","title":"Distributed stochastic consensus of multi‐agent systems with noisy and delayed measurements","year":2013,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Multi-agent system; Computer science; Consensus; Artificial intelligence; Control (management)","score_opus":0.01634148702011269,"score_gpt":0.229836905628791,"score_spread":0.21349541860867832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171505431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015129992,0.0009652903,0.9807508,0.00028840353,0.00005548559,0.0023405002,0.00030178324,0.00009259341,0.00007514325],"genre_scores_gemma":[0.99768716,0.0000032327666,0.0007203996,0.00006308098,0.00003253057,0.0014057641,0.00002153066,0.000011541166,0.00005473692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981066,0.00035246144,0.00048869796,0.00046278295,0.0003079439,0.00028152464],"domain_scores_gemma":[0.9975924,0.0007553906,0.00033227343,0.0006778276,0.0004334285,0.00020868421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008777951,0.00021653727,0.00039101226,0.000071952716,0.0001909441,0.0002067606,0.00042444296,0.0000724937,0.0000034766304],"category_scores_gemma":[0.000115234456,0.00016873144,0.00004195953,0.00023931618,0.0001948176,0.00015315234,0.00006779983,0.000097891214,0.00002121463],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005613794,0.001212934,0.004533163,0.0002791336,0.0019925965,0.000008515809,0.0009081138,0.024569185,0.04543705,0.8913413,0.00083123834,0.028325379],"study_design_scores_gemma":[0.024032416,0.0006345964,0.026972046,0.00027972428,0.0006259552,0.00022331103,0.0017076671,0.924411,0.0005196441,0.016612869,0.0024651345,0.0015156079],"about_ca_topic_score_codex":0.000084683845,"about_ca_topic_score_gemma":0.000006901317,"teacher_disagreement_score":0.9825572,"about_ca_system_score_codex":0.000030457908,"about_ca_system_score_gemma":0.000043983968,"threshold_uncertainty_score":0.68806684},"labels":[],"label_agreement":null},{"id":"W2171888714","doi":"10.1109/robio.2007.4522221","title":"Control of energetic robotic swarm systems","year":2007,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Swarm behaviour; Trajectory; Swarm robotics; Controller (irrigation); Control theory (sociology); Mobile robot; Computer science; Particle swarm optimization; Robot; Feedback linearization; Control engineering; Control (management); Engineering; Artificial intelligence; Algorithm; Physics","score_opus":0.010355310893644732,"score_gpt":0.2239213070227067,"score_spread":0.213565996129062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2171888714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003474316,0.000441588,0.98772764,0.00015960845,0.0013957449,0.00035202832,0.0000032353933,0.00022327903,0.006222587],"genre_scores_gemma":[0.9968636,0.0000014828845,0.0020635212,0.00009438737,0.00008956127,0.000012520027,0.0000019473669,0.000009557653,0.00086340384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801475,0.000088541026,0.0006438258,0.0003331562,0.0004625998,0.00045712362],"domain_scores_gemma":[0.99838114,0.00026912228,0.00022742881,0.0007536599,0.00020063728,0.00016800415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010363276,0.00016459622,0.0003897306,0.0001475654,0.000044778943,0.000088308974,0.0009788665,0.00008358101,0.000008341525],"category_scores_gemma":[0.0000734524,0.00013803586,0.00010993438,0.0003835824,0.000036853107,0.00023905128,0.00007517515,0.00007671421,0.00011116108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028968094,0.0002900356,0.003928709,0.00013966185,0.00020803466,0.00009141161,0.00018659869,0.053436074,0.023758085,0.91216683,0.0015930411,0.004172564],"study_design_scores_gemma":[0.0035156019,0.00019461858,0.0052320724,0.00009440535,0.000045609602,0.0000660577,0.00012104508,0.9740288,0.010651026,0.00024838615,0.005308937,0.0004934092],"about_ca_topic_score_codex":0.00034080964,"about_ca_topic_score_gemma":0.000015978634,"teacher_disagreement_score":0.9933893,"about_ca_system_score_codex":0.00006668672,"about_ca_system_score_gemma":0.000051876566,"threshold_uncertainty_score":0.5628939},"labels":[],"label_agreement":null},{"id":"W2176330911","doi":"10.1142/s0219530515400023","title":"Emergence of bi-cluster flocking for agent-based models with unit speed constraint","year":2015,"lang":"en","type":"article","venue":"Analysis and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McMaster University","keywords":"Flocking (texture); Cluster (spacecraft); Mathematics; Computer science; Statistical physics; Mathematical optimization; Physics","score_opus":0.05541624847356289,"score_gpt":0.28190827029514237,"score_spread":0.2264920218215795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2176330911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003949509,0.0000657194,0.99465024,0.00037793763,0.000009815017,0.00043401262,0.000067561276,0.000033852943,0.0004113353],"genre_scores_gemma":[0.97204304,0.0000023414411,0.027597673,0.000070634145,0.000017401264,0.00015528144,0.000051936746,0.000004339291,0.0000573535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990968,0.000029807607,0.000264113,0.00028653632,0.00018119287,0.00014151215],"domain_scores_gemma":[0.99884063,0.00006536917,0.00017536688,0.0004780009,0.00032432505,0.00011632005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027574933,0.00009578442,0.0002298798,0.0001572504,0.00007858406,0.000059737617,0.00032808742,0.000028959754,0.0000040454624],"category_scores_gemma":[0.000008409765,0.00007837816,0.00009042548,0.0010270867,0.00005489179,0.00013005786,0.000038140875,0.000029250987,0.000002508374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037289632,0.00043006073,0.012912948,0.00008700905,0.0020672954,0.0000014707896,0.0007371506,0.673731,0.0022593045,0.26874205,0.0008840276,0.038110387],"study_design_scores_gemma":[0.00055058417,0.000026700738,0.00019767329,0.0000068405952,0.00030998047,5.997078e-7,0.00015335332,0.99609643,0.0004467642,0.0011528158,0.0009539007,0.000104355175],"about_ca_topic_score_codex":0.000118212025,"about_ca_topic_score_gemma":0.000060381244,"teacher_disagreement_score":0.9680935,"about_ca_system_score_codex":0.000007966247,"about_ca_system_score_gemma":0.00006869908,"threshold_uncertainty_score":0.31961685},"labels":[],"label_agreement":null},{"id":"W2186795831","doi":"","title":"Flexible Multi-Robot Formation Control: Partial Formations as Physical Data Structures","year":2011,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Distributed computing; Population; Robot; Human–computer interaction; Graph; Range (aeronautics); Control (management); Perception; Artificial intelligence; Theoretical computer science; Engineering","score_opus":0.37191005140904626,"score_gpt":0.38985972766401517,"score_spread":0.017949676254968905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186795831","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014898625,0.00001206861,0.9890841,0.0008067775,0.0005991941,0.0005571323,0.00024917035,0.0003024475,0.0068992064],"genre_scores_gemma":[0.9909189,0.0000042400993,0.008076157,0.0004326934,0.000206951,0.00008106078,0.00020185178,0.000012251976,0.00006594129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968538,0.00019132518,0.00072713813,0.0006691642,0.0011063637,0.000452162],"domain_scores_gemma":[0.99735445,0.00021501574,0.000358726,0.0009487323,0.0009330039,0.0001900742],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00064190733,0.00029372776,0.00029765183,0.00023258248,0.00034946916,0.00044071875,0.002478154,0.00012178438,0.00017189981],"category_scores_gemma":[0.0006793166,0.00027524668,0.00009397644,0.00046418645,0.00013209973,0.002597162,0.00027200373,0.00030058646,0.0016425507],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059210102,0.00030033934,0.000014574351,0.000007902232,0.00003102664,0.0000036534539,0.000986611,0.0014235136,0.0013975037,0.9594798,0.00019697275,0.036098868],"study_design_scores_gemma":[0.00017235149,0.00012284481,0.000648052,0.000022591,0.000013261028,0.000010442378,0.00015471237,0.8348196,0.025689436,0.13769019,0.00036597202,0.00029051866],"about_ca_topic_score_codex":0.00012991423,"about_ca_topic_score_gemma":0.00007062871,"teacher_disagreement_score":0.989429,"about_ca_system_score_codex":0.00012338065,"about_ca_system_score_gemma":0.00036297514,"threshold_uncertainty_score":0.99996996},"labels":[],"label_agreement":null},{"id":"W2200752867","doi":"10.1007/978-3-642-16259-6_22","title":"Leader-Follower Cucker-Smale Type Flocking Synthesized via Mean Field Stochastic Control Theory","year":2010,"lang":"en","type":"book-chapter","venue":"Advances in intelligent and soft computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Polytechnique Montréal; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Flocking (texture); Nash equilibrium; Population; Mathematics; Nonlinear system; Mathematical economics; Type (biology); Mean field theory; Applied mathematics; Physics","score_opus":0.012637425344661191,"score_gpt":0.24917970612650153,"score_spread":0.23654228078184034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2200752867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019407057,0.008959963,0.9740434,0.000111928195,0.0042268876,0.00069359667,0.000007216598,0.00024544745,0.011517434],"genre_scores_gemma":[0.985689,0.00022481506,0.0046348227,0.00039777867,0.0006904217,0.000015691203,0.000012213832,0.00008757264,0.008247703],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966042,0.00012518601,0.0010068499,0.0010715333,0.00050167623,0.0006905793],"domain_scores_gemma":[0.99494016,0.0032703327,0.00058451924,0.00080908096,0.00021762092,0.00017830255],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010884078,0.0006776778,0.0010181277,0.00030842284,0.0002662256,0.00024102526,0.001254005,0.0004970644,0.000058020865],"category_scores_gemma":[0.00040934014,0.00065777684,0.0002281725,0.000120947356,0.00016366338,0.0004017068,0.000311915,0.0012001987,0.000101205515],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024751652,0.0000934546,0.0002230969,0.00025564973,0.0003255481,0.00019159012,0.00239445,0.009346081,0.00048776,0.1905093,0.000046418638,0.7958791],"study_design_scores_gemma":[0.0034690208,0.00058775896,0.000022822558,0.005025718,0.00031516276,0.00022539218,0.0003089535,0.7387969,0.0017443368,0.14353406,0.101856366,0.0041135387],"about_ca_topic_score_codex":0.00001775883,"about_ca_topic_score_gemma":0.00006727612,"teacher_disagreement_score":0.9854949,"about_ca_system_score_codex":0.000100816644,"about_ca_system_score_gemma":0.000080287304,"threshold_uncertainty_score":0.99958736},"labels":[],"label_agreement":null},{"id":"W2217668376","doi":"10.5555/1999416.1999425","title":"CoUAV: a multi-UAV cooperative search path planning simulation environment","year":2010,"lang":"en","type":"article","venue":"Summer Computer Simulation Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Flexibility (engineering); Motion planning; Distributed computing; Variety (cybernetics); Overhead (engineering); Discrete event simulation; Key (lock); Visualization; Path (computing); Event (particle physics); Real-time computing; Systems engineering; Simulation; Engineering; Artificial intelligence; Computer network","score_opus":0.07699966471065597,"score_gpt":0.31959151021042775,"score_spread":0.24259184549977178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217668376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04366199,0.000032811775,0.9535518,0.00022427164,0.0011697295,0.0008134333,0.000031496864,0.0003417393,0.00017270845],"genre_scores_gemma":[0.9510751,0.0000016756618,0.04809308,0.00025361535,0.00027456135,0.00004028535,0.00008355323,0.000026326832,0.00015183391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965921,0.00030964988,0.00067653094,0.0010261672,0.0007823557,0.00061318337],"domain_scores_gemma":[0.9972409,0.00064686814,0.00025655434,0.001073555,0.0004949055,0.00028720257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005674741,0.000428477,0.00041499906,0.00020786336,0.00031773976,0.0007348939,0.0011569256,0.00021654996,0.000112866306],"category_scores_gemma":[0.00006122127,0.0004245007,0.00011633166,0.0003371278,0.00010889602,0.0011319472,0.00045076656,0.0005776493,0.00040547375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015753842,0.00014941143,0.0053197406,0.000012953515,0.000044575994,0.00001961057,0.0015481482,0.9662448,0.0014562834,0.004918265,0.00006448922,0.02020594],"study_design_scores_gemma":[0.0015934536,0.000093871415,0.013962817,0.000046745932,0.000010905475,0.000003265249,0.00003321071,0.9784574,0.00025904263,0.00006624479,0.0050024055,0.00047064997],"about_ca_topic_score_codex":0.000053689622,"about_ca_topic_score_gemma":0.000009619955,"teacher_disagreement_score":0.90741307,"about_ca_system_score_codex":0.00009627148,"about_ca_system_score_gemma":0.00016925733,"threshold_uncertainty_score":0.9998207},"labels":[],"label_agreement":null},{"id":"W2219648586","doi":"10.1109/acc.2013.6580918","title":"Structural controllability of multi-agent networks: Importance of individual links","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Controllability; Network controllability; Computer science; Graph; Distributed computing; Information flow; Network topology; Graph theory; Complex network; Point (geometry); Topology (electrical circuits); Theoretical computer science; Computer network; Mathematics","score_opus":0.022430422844949015,"score_gpt":0.24690707981348897,"score_spread":0.22447665696853997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2219648586","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5373338,0.00045219393,0.45957193,0.00031317453,0.00065309246,0.0011839947,0.000044405613,0.00014399693,0.00030342437],"genre_scores_gemma":[0.9871399,0.0000026335317,0.012494381,0.00014806289,0.000049651437,0.000049473496,0.000013632704,0.000008978761,0.0000933228],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973518,0.00017044136,0.0010392008,0.00046937383,0.0005463782,0.00042279513],"domain_scores_gemma":[0.997461,0.00021802612,0.0005985054,0.0010923046,0.00046856387,0.00016158236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006088342,0.000230692,0.00058331684,0.000073106145,0.00004720589,0.00009729029,0.0016046214,0.0002039462,0.0001397298],"category_scores_gemma":[0.00015934305,0.00018215943,0.00018359163,0.00036427774,0.00012945881,0.0005481262,0.0003400301,0.00022355623,0.000021377527],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051707724,0.00061786844,0.8718436,0.0002335301,0.0008149771,0.00001107884,0.0015111492,0.02120271,0.009400984,0.03810217,0.0039442563,0.052266024],"study_design_scores_gemma":[0.0020587738,0.00008623365,0.34543478,0.000019287643,0.000017839915,0.0000035926644,0.00007605234,0.65082985,0.0008941839,0.00031895298,0.00005245766,0.00020800393],"about_ca_topic_score_codex":0.00036063208,"about_ca_topic_score_gemma":0.00006373617,"teacher_disagreement_score":0.6296271,"about_ca_system_score_codex":0.00004649831,"about_ca_system_score_gemma":0.00007643884,"threshold_uncertainty_score":0.7428246},"labels":[],"label_agreement":null},{"id":"W2243169878","doi":"10.1109/camsap.2015.7383850","title":"Multi-agent mirror descent for decentralized stochastic optimization","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Stochastic gradient descent; Descent (aeronautics); Mathematical optimization; Multi-agent system; Stochastic optimization; Distributed computing; Artificial intelligence; Mathematics; Engineering; Artificial neural network; Aerospace engineering","score_opus":0.08635434235341079,"score_gpt":0.29959545195151654,"score_spread":0.21324110959810577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2243169878","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006711137,0.00010381455,0.9954674,0.00069041277,0.0012245097,0.0013523006,0.000018145269,0.00039927076,0.00007302045],"genre_scores_gemma":[0.4132965,0.0000019633385,0.5857139,0.000198294,0.000027823844,0.00020964617,0.000042205003,0.000017621649,0.00049203704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998182,0.00008510261,0.0003990757,0.0004747213,0.00036746045,0.0004916623],"domain_scores_gemma":[0.99844486,0.00007089177,0.00014522942,0.00056369026,0.00038466987,0.0003906362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004467979,0.0002061389,0.00025034585,0.00008822428,0.0000866357,0.00024423058,0.0007828158,0.00007752773,0.000015267522],"category_scores_gemma":[0.0002901349,0.00018183235,0.00010994279,0.00024847817,0.000021320864,0.00041040857,0.00012349332,0.000052463813,0.00010735911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002599145,0.0016283144,0.00090701797,0.000095276104,0.00028221376,0.000023322715,0.001978844,0.9348772,0.003467261,0.030218799,0.01734411,0.008917718],"study_design_scores_gemma":[0.0047821393,0.00007278257,0.00020259318,0.000017060569,0.000017745577,0.000006692483,0.000050311126,0.99228615,0.00029359743,0.00006036204,0.0019768453,0.00023371057],"about_ca_topic_score_codex":0.000083832594,"about_ca_topic_score_gemma":0.000020281299,"teacher_disagreement_score":0.41262537,"about_ca_system_score_codex":0.00024328519,"about_ca_system_score_gemma":0.00015231298,"threshold_uncertainty_score":0.7414908},"labels":[],"label_agreement":null},{"id":"W2248010213","doi":"10.1109/smc.2015.335","title":"A Dyna-Q (Lambda) Approach to Flocking with Fixed-Wing UAVs in a Stochastic Environment","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Flocking (texture); Reinforcement learning; Fixed wing; Computer science; Lambda; Distributed computing; Q-learning; Wing; Simulation; Artificial intelligence; Engineering; Aerospace engineering","score_opus":0.02772872382939095,"score_gpt":0.2128798979808648,"score_spread":0.18515117415147384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2248010213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011419351,0.000042359097,0.9807221,0.00031303804,0.00013340246,0.0006716565,0.000002088891,0.00016082112,0.006535128],"genre_scores_gemma":[0.95139945,1.2904796e-7,0.047803707,0.00017742794,0.000059730297,0.00017136814,0.00000432638,0.00001506559,0.00036882743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978229,0.00009006577,0.00030535707,0.00063254096,0.0006383832,0.0005107993],"domain_scores_gemma":[0.9988071,0.000051634128,0.00007183125,0.00071123004,0.000032921333,0.0003253164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048247018,0.00022024797,0.00028104163,0.00017783817,0.00004904059,0.00019842427,0.0008498186,0.000056580866,0.0000032677992],"category_scores_gemma":[0.00004809901,0.00017752309,0.00003620829,0.00042312944,0.000020786327,0.00035965358,0.00031961076,0.00013624917,0.00016831413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008977235,0.00076291355,0.0044311956,0.000035723402,0.00009563059,0.00010085333,0.007741049,0.9462632,0.0008174109,0.022119077,0.0011781591,0.016365001],"study_design_scores_gemma":[0.0020655964,0.00019570618,0.0026462206,0.000072307565,0.000008519938,0.00004144622,0.0007302851,0.9923556,0.00006246505,0.00010099608,0.0012874907,0.00043336744],"about_ca_topic_score_codex":0.00016042155,"about_ca_topic_score_gemma":0.000038814807,"teacher_disagreement_score":0.9399801,"about_ca_system_score_codex":0.00033610585,"about_ca_system_score_gemma":0.00008219538,"threshold_uncertainty_score":0.72391814},"labels":[],"label_agreement":null},{"id":"W2252287587","doi":"10.7287/peerj.preprints.674v1","title":"Super-individual based model for fish migration","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Penn West Exploration (Canada)","funders":"","keywords":"Fish <Actinopterygii>; IBM; Focus (optics); Computer science; Motion (physics); Fish migration; Collective motion; Ecology; Fishery; Artificial intelligence; Biology; Physics","score_opus":0.04970382953900401,"score_gpt":0.26679960391451385,"score_spread":0.21709577437550984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252287587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014038029,0.000015698031,0.99002475,0.0042427867,0.0011243366,0.0013647733,0.00054674706,0.00053844636,0.0007386718],"genre_scores_gemma":[0.87787217,0.0000011032246,0.11700139,0.0016522779,0.00024199623,0.00071028474,0.0010950783,0.000027494063,0.0013982069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740714,0.00010862057,0.000533463,0.0009698081,0.0005507182,0.0004302453],"domain_scores_gemma":[0.9975617,0.00024199503,0.00024283188,0.0015012731,0.00030352717,0.00014867853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000789507,0.00036544356,0.00045723133,0.00015123238,0.00010512668,0.0008015181,0.002308498,0.00038487485,0.000011965268],"category_scores_gemma":[0.00014828764,0.00034612833,0.00032768794,0.000088940156,0.00002051009,0.00023436143,0.00062072487,0.00024580932,0.000036612375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022366228,0.00021948227,0.00025518567,0.00044279973,0.00018240609,0.0000023937155,0.0005689473,0.7443635,0.00028001002,0.03528617,0.20959754,0.0087792305],"study_design_scores_gemma":[0.0008397775,0.000031123815,0.00011151442,0.00005354829,0.00003637848,7.044937e-7,0.0000047657336,0.9912973,0.00032065733,0.0020579374,0.0048502753,0.00039599958],"about_ca_topic_score_codex":0.000118198695,"about_ca_topic_score_gemma":0.00053657265,"teacher_disagreement_score":0.87646836,"about_ca_system_score_codex":0.00010139477,"about_ca_system_score_gemma":0.00036234342,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null},{"id":"W2256990898","doi":"10.1016/j.ins.2016.01.048","title":"Distributed attitude synchronization control for a group of flexible spacecraft using only attitude measurements","year":2016,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Backstepping; Control theory (sociology); Spacecraft; Attitude control; Lemma (botany); Modal; Lyapunov function; Observer (physics); Angular velocity; Nonlinear system; Synchronization (alternating current); Quaternion; Lyapunov stability; Computer science; Group (periodic table); Control (management); Mathematics; Control engineering; Engineering; Adaptive control; Physics; Topology (electrical circuits); Aerospace engineering","score_opus":0.0598322020896847,"score_gpt":0.30243197654101517,"score_spread":0.24259977445133046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2256990898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008505271,0.000045133012,0.98903155,0.00053257897,0.0005992239,0.0007554441,0.00018614669,0.00012941234,0.00021520934],"genre_scores_gemma":[0.98893464,0.000001788559,0.010828393,0.00010842866,0.00003686215,0.000048903912,0.000019819952,0.0000035733754,0.00001758859],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976736,0.00007354769,0.0007041715,0.0002499148,0.00090532616,0.0003934538],"domain_scores_gemma":[0.9980926,0.00018341362,0.00065505767,0.0003586254,0.00061022246,0.00010010491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015504832,0.00016333083,0.00025651723,0.00024420983,0.00028530016,0.000328228,0.0010194643,0.00006764553,0.000012479303],"category_scores_gemma":[0.00038249695,0.00011467923,0.00009087171,0.0007678245,0.00016999412,0.005380684,0.00008866116,0.000030243364,0.000038265214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024562294,0.0006333637,0.2553338,0.000554394,0.0006444557,0.0000025159459,0.0028197167,0.043798488,0.05080637,0.38369158,0.0030049793,0.25846472],"study_design_scores_gemma":[0.008155571,0.0005341663,0.03546715,0.00050554465,0.00006804018,0.000027289196,0.0002426821,0.94234306,0.004505075,0.0013190764,0.0060927807,0.0007395388],"about_ca_topic_score_codex":0.000068385416,"about_ca_topic_score_gemma":0.0000185552,"teacher_disagreement_score":0.98042935,"about_ca_system_score_codex":0.00020318551,"about_ca_system_score_gemma":0.000304271,"threshold_uncertainty_score":0.46764833},"labels":[],"label_agreement":null},{"id":"W2269006045","doi":"","title":"Modeling of a Micro UAVwith Slung Payload","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Payload (computing); Swing; Aerospace engineering; Computer science; Control theory (sociology); Engineering; Marine engineering; Control (management); Mechanical engineering","score_opus":0.011786655461579412,"score_gpt":0.2147584739772764,"score_spread":0.20297181851569698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269006045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020264296,0.00005112115,0.9705352,0.00026626696,0.00021204546,0.00012369451,0.0000021438868,0.00014793225,0.00839726],"genre_scores_gemma":[0.97182727,0.0000010713543,0.027698686,0.00013273473,0.000039413815,0.0000077761915,0.0000016257633,0.0000058041237,0.0002856405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989004,0.00006442086,0.0002973589,0.0002772511,0.000226212,0.00023432594],"domain_scores_gemma":[0.9990693,0.000049342827,0.000073261144,0.00062165037,0.00011182329,0.000074664764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036826966,0.000107233915,0.00020429677,0.00006356941,0.000037812093,0.00007021253,0.0007856823,0.000043338892,0.00000866973],"category_scores_gemma":[0.000046883833,0.00008589299,0.000069396076,0.0001857609,0.000013513772,0.00023068131,0.00014185869,0.000057223788,0.00006997561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039169532,0.0004565381,0.0056249113,0.0002427178,0.00026154547,0.000014445621,0.0018400599,0.15521698,0.17213416,0.57789373,0.00338208,0.08289366],"study_design_scores_gemma":[0.00044032722,0.000027463862,0.000092503295,0.000022127848,0.000004435756,0.000004072838,0.000016469787,0.9955297,0.002702179,0.00043386337,0.00061700726,0.000109855515],"about_ca_topic_score_codex":0.00024825745,"about_ca_topic_score_gemma":0.000017025428,"teacher_disagreement_score":0.95156294,"about_ca_system_score_codex":0.000020792402,"about_ca_system_score_gemma":0.000027265372,"threshold_uncertainty_score":0.35026145},"labels":[],"label_agreement":null},{"id":"W2288592499","doi":"10.1109/cdc.2015.7402229","title":"Leader-following consensus for multi-agent systems with switching topologies and time-varying delays: A switched system perspective","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Network topology; Perspective (graphical); Multi-agent system; Consensus; Computer science; Control theory (sociology); Fast switching; Stability (learning theory); Topology (electrical circuits); Mathematics; Engineering; Computer network; Artificial intelligence; Control (management)","score_opus":0.07121560187797335,"score_gpt":0.2895465699573907,"score_spread":0.21833096807941735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2288592499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03648274,0.0016251586,0.95528513,0.00070950564,0.000973185,0.0020978758,0.000018764114,0.0011623176,0.0016453029],"genre_scores_gemma":[0.94622844,9.384886e-7,0.05267313,0.00006096933,0.000098793964,0.00027551598,0.00000426918,0.000036616864,0.0006213064],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996923,0.00023971852,0.0005831654,0.0009887797,0.0005205528,0.0007447482],"domain_scores_gemma":[0.9976411,0.0004493114,0.00031441788,0.00071290863,0.0005238641,0.00035844074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012177044,0.00044669464,0.0007538362,0.00019061052,0.00032891438,0.0007475117,0.0007098619,0.00015671464,4.888196e-7],"category_scores_gemma":[0.00032280243,0.00034260997,0.00014313182,0.00031990456,0.000060316037,0.0004830674,0.00024630324,0.00017932105,0.00003903281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016696719,0.0013122562,0.016022185,0.0035444167,0.008302608,0.0028807626,0.09845763,0.054553065,0.04157786,0.75913614,0.0066225044,0.005920882],"study_design_scores_gemma":[0.0052641914,0.00030556446,0.00006330649,0.00033641286,0.00008757864,0.00034880312,0.048298378,0.94410014,0.0003338084,0.00005309036,0.00022718696,0.00058154744],"about_ca_topic_score_codex":0.0013930623,"about_ca_topic_score_gemma":0.000034598877,"teacher_disagreement_score":0.9097457,"about_ca_system_score_codex":0.00071507675,"about_ca_system_score_gemma":0.00026126893,"threshold_uncertainty_score":0.9999026},"labels":[],"label_agreement":null},{"id":"W2289181119","doi":"10.1109/cdc.2015.7402315","title":"Continuous-time distributed convex optimization on time-varying directed networks","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Bounded function; Ergodic theory; Mathematics; Sequence (biology); Exponential growth; Convex optimization; Exponential stability; Directed graph; Differentiable function; Regular polygon; Applied mathematics; Nonlinear system; Discrete mathematics; Mathematical analysis","score_opus":0.014397417504830994,"score_gpt":0.21920140274713357,"score_spread":0.20480398524230256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2289181119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045902736,0.00006702064,0.98185545,0.0006887721,0.0006493788,0.0005578775,0.00003728091,0.0020292623,0.013655911],"genre_scores_gemma":[0.9610558,0.0000050102876,0.029194029,0.00095083436,0.0003976222,0.000098327924,0.0011941773,0.00006428925,0.0070398776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974218,0.0002884733,0.00051447714,0.0006468524,0.00054275757,0.000585645],"domain_scores_gemma":[0.9978304,0.00023147636,0.00024844724,0.00085919345,0.00043957634,0.00039093458],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005904508,0.00031685442,0.00047841686,0.00011270903,0.00013030149,0.0004688628,0.0009975224,0.00017878166,0.00014009098],"category_scores_gemma":[0.0002973478,0.0002866881,0.00010100439,0.00071041187,0.00004264522,0.0005927204,0.00021490749,0.00018345678,0.0012393473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006961097,0.00022017784,0.00036409366,0.0000052238606,0.00011352433,0.000046909397,0.00010455837,0.92467785,0.00031029934,0.002651438,0.068337925,0.0030983668],"study_design_scores_gemma":[0.0017805863,0.0001190748,0.00013202867,0.000037495924,0.000014874993,0.00001134851,0.000008060739,0.99389434,0.00020035302,0.000035544977,0.0034177944,0.00034849744],"about_ca_topic_score_codex":0.00005701786,"about_ca_topic_score_gemma":9.4916044e-7,"teacher_disagreement_score":0.9605968,"about_ca_system_score_codex":0.00020708186,"about_ca_system_score_gemma":0.000097762626,"threshold_uncertainty_score":0.9999585},"labels":[],"label_agreement":null},{"id":"W2290489880","doi":"10.4271/2016-01-0149","title":"Cooperative Least Square Parameter Identification by Consensus within the Network of Autonomous Vehicles","year":2016,"lang":"en","type":"article","venue":"SAE International journal of passenger cars. Electronic and electrical systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Identification (biology); Square (algebra); Computer science; Mathematics; Biology; Geometry; Ecology","score_opus":0.008242560506240301,"score_gpt":0.2325437187539202,"score_spread":0.22430115824767988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290489880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.559347,0.01976653,0.40701947,0.009374932,0.0033158683,0.00087501714,0.00007885361,0.00007779453,0.00014458029],"genre_scores_gemma":[0.99907124,0.00014322971,0.00006402172,0.00007214986,0.0003715476,0.00001991759,0.0000037089578,0.000013181814,0.00024098718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675417,0.00053310307,0.0011600661,0.0003016501,0.0008156298,0.00043537794],"domain_scores_gemma":[0.99633527,0.00090519583,0.0012434246,0.00026912574,0.0011280759,0.00011890272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013997186,0.00021059414,0.0004300872,0.00008227918,0.00010454018,0.0002562108,0.0010398275,0.00011278501,0.0000030871972],"category_scores_gemma":[0.00034402803,0.00012030994,0.00015754209,0.00031217033,0.00011401733,0.0002876505,0.00006927145,0.00031797154,0.00000775937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007596687,0.00070672005,0.019465247,0.00006275202,0.0052803564,0.00015285042,0.0013697909,0.004553929,0.34553424,0.4651198,0.05147447,0.10552016],"study_design_scores_gemma":[0.03667942,0.010994454,0.11438225,0.0039380514,0.0014268266,0.015892487,0.001801882,0.566228,0.07001549,0.032679826,0.1411037,0.0048576416],"about_ca_topic_score_codex":0.000075685326,"about_ca_topic_score_gemma":0.000018546085,"teacher_disagreement_score":0.56167406,"about_ca_system_score_codex":0.00048255516,"about_ca_system_score_gemma":0.00037392988,"threshold_uncertainty_score":0.49060968},"labels":[],"label_agreement":null},{"id":"W2290526384","doi":"10.1109/cdc.2015.7402010","title":"Cooperative control for multi-target interception with sensing and communication limitations: A game-theoretic approach","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Regret; Interception; Computer science; Controller (irrigation); State (computer science); Control (management); Game theory; Nash equilibrium; Mathematical optimization; Distributed computing; Artificial intelligence; Machine learning; Algorithm; Mathematical economics; Mathematics","score_opus":0.08288877551857662,"score_gpt":0.27920833249951055,"score_spread":0.19631955698093392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290526384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002650442,0.00015533339,0.9942933,0.0005590705,0.00005166594,0.0012395598,0.000011463524,0.00016879058,0.0008703831],"genre_scores_gemma":[0.67256296,0.0000034575214,0.32702667,0.00016608166,0.000011736909,0.00008734984,0.000034875764,0.000008348074,0.00009851711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987879,0.00028742483,0.00024683058,0.00032091216,0.0001601851,0.00019678246],"domain_scores_gemma":[0.9984449,0.00026393775,0.00012879961,0.00046997942,0.00056975265,0.00012260092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000633111,0.00015290623,0.00021891721,0.00007585617,0.000108080756,0.0003021583,0.0003040199,0.000055480763,6.569326e-7],"category_scores_gemma":[0.00025237317,0.000117618736,0.00002887283,0.00016732853,0.000113889604,0.00053567823,0.00006290058,0.00008492484,0.000008961311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011041183,0.0014145209,0.0020447061,0.00023190788,0.0007989804,0.000008760173,0.08526043,0.034631737,0.0038325007,0.77257067,0.0032320507,0.094869636],"study_design_scores_gemma":[0.004544661,0.00019812443,0.00021685938,0.000032239397,0.000020097339,0.000022815535,0.0024418328,0.9912685,0.00009515713,0.0006973348,0.0002955443,0.0001668087],"about_ca_topic_score_codex":0.000039448223,"about_ca_topic_score_gemma":0.000041698528,"teacher_disagreement_score":0.9566368,"about_ca_system_score_codex":0.00007934384,"about_ca_system_score_gemma":0.00006630576,"threshold_uncertainty_score":0.4796353},"labels":[],"label_agreement":null},{"id":"W2290810608","doi":"10.1109/cdc.2015.7402011","title":"On the leader-follower synchronization of Euler-Lagrange systems","year":2015,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Synchronization (alternating current); Control theory (sociology); Interconnection; Trajectory; Computer science; Topology (electrical circuits); Dropout (neural networks); Network packet; Scheme (mathematics); Ideal (ethics); Control (management); Mathematics; Computer network","score_opus":0.04707963695033687,"score_gpt":0.23684825406156293,"score_spread":0.18976861711122606,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2290810608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067578065,0.00029217056,0.96669734,0.0018222054,0.0019254634,0.0005368322,0.000008188496,0.0002060299,0.021753995],"genre_scores_gemma":[0.99831647,0.0000011859149,0.00022264509,0.00014849048,0.000071927534,0.000032676275,0.00000462267,0.000008549086,0.0011934392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845004,0.00019027153,0.00031441203,0.00025662265,0.00056648615,0.00022219415],"domain_scores_gemma":[0.99842995,0.00025297762,0.00016686165,0.00079864403,0.00025601557,0.00009553136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006781551,0.00013190403,0.00019697436,0.00006321852,0.000052517258,0.00014704767,0.000945389,0.00006349947,0.000014075796],"category_scores_gemma":[0.00024084667,0.00008053445,0.00006210966,0.0004046003,0.000035629135,0.00026575022,0.00008684872,0.00007434902,0.0003308877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014332044,0.00017992353,0.0006583051,0.000043457236,0.00008808748,0.000009315213,0.0009751871,0.0056860237,0.0005113977,0.9195051,0.07036163,0.0019671943],"study_design_scores_gemma":[0.0019014315,0.00031660622,0.00053285557,0.00015896166,0.000023932414,0.000017165221,0.0010017921,0.977934,0.00097208214,0.0008187565,0.015936943,0.00038547022],"about_ca_topic_score_codex":0.00021746277,"about_ca_topic_score_gemma":0.000011099651,"teacher_disagreement_score":0.9915587,"about_ca_system_score_codex":0.00008748275,"about_ca_system_score_gemma":0.00008013401,"threshold_uncertainty_score":0.42530024},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010700409752214679,"score_gpt":0.2342283388769796,"score_spread":0.22352792912476493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292984388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009794348,0.000019855655,0.97290397,0.022263786,0.00030768116,0.0012038132,0.0010378715,0.00086821476,0.00041536006],"genre_scores_gemma":[0.97209156,0.0000010402966,0.026137037,0.00024650682,0.00008692302,0.00053098804,0.00011507143,0.000020264486,0.0007706365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793595,0.00013204338,0.00059065805,0.00038431017,0.00041684558,0.00054017553],"domain_scores_gemma":[0.99627423,0.00171867,0.00031527606,0.0011641036,0.0003532225,0.00017451229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006261516,0.0002437326,0.00038264855,0.0001347981,0.0002669617,0.0002541693,0.0014037561,0.000122281,0.000046753685],"category_scores_gemma":[0.0020627335,0.00018180667,0.00016964064,0.00035334486,0.000063048865,0.0010933232,0.0001724517,0.0000632902,0.00077022234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009890942,0.00094489905,0.0010896953,0.00036260762,0.0010025316,0.000022695924,0.001219669,0.0008226259,0.020950507,0.5916344,0.30244878,0.07940268],"study_design_scores_gemma":[0.0064161527,0.00012841758,0.004611067,0.00011989446,0.0000574008,0.000008155542,0.000013412634,0.95846176,0.0004793246,0.010365043,0.018956263,0.00038311598],"about_ca_topic_score_codex":0.00000784618,"about_ca_topic_score_gemma":0.0000065310646,"teacher_disagreement_score":0.9711121,"about_ca_system_score_codex":0.00020604557,"about_ca_system_score_gemma":0.00011000741,"threshold_uncertainty_score":0.9899907},"labels":[],"label_agreement":null},{"id":"W2293377542","doi":"","title":"Selective Gossip","year":2009,"lang":"en","type":"article","venue":"IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Coding (social sciences); Algorithm; Theoretical computer science; Focus (optics); Gossip protocol; Wireless sensor network; Mathematics; Computer network; Statistics","score_opus":0.044024495408853545,"score_gpt":0.3440752519543486,"score_spread":0.30005075654549507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2293377542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024758405,0.00077379355,0.9891087,0.0016976043,0.0012724898,0.0004331021,0.00002800096,0.00028125718,0.0039292006],"genre_scores_gemma":[0.8469715,0.000027272867,0.15150733,0.00087249535,0.00022685126,0.000053747186,0.000024929775,0.00001890788,0.0002969393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964034,0.00016451943,0.0007725672,0.0010377528,0.0010943247,0.00052742223],"domain_scores_gemma":[0.99762106,0.00065392116,0.00047660607,0.0002518636,0.0008539305,0.00014259617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035875768,0.00042577204,0.000392373,0.0005606872,0.00023632028,0.0004087683,0.0013018452,0.00012512703,0.0000069799044],"category_scores_gemma":[0.00028119102,0.00042929742,0.00013728284,0.0009982553,0.000094829,0.0023259586,0.000065680906,0.0005379759,0.000079001176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017793111,0.0005523423,0.0004074399,0.000008848193,0.000033012046,0.000062033476,0.00046912784,0.7973552,0.000399062,0.0148590095,0.00006860433,0.18560742],"study_design_scores_gemma":[0.0020413366,0.000106770174,0.012169126,0.00045288165,0.0000043629857,0.000028908265,0.00014169,0.9687927,0.0003993245,0.014330834,0.0010371389,0.0004949582],"about_ca_topic_score_codex":0.000005373064,"about_ca_topic_score_gemma":0.000013749341,"teacher_disagreement_score":0.8444957,"about_ca_system_score_codex":0.0006451554,"about_ca_system_score_gemma":0.00016435461,"threshold_uncertainty_score":0.9998159},"labels":[],"label_agreement":null},{"id":"W2297353497","doi":"","title":"Criteria for Unconditional Convergence to Single or Multiple Consensuses in Discrete Time Linear Consensus Algorithms","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Digraph; Sequence (biology); Mathematics; Convergence (economics); Consensus algorithm; Consensus; Property (philosophy); Discrete time and continuous time; Strongly connected component; Weak convergence; Algorithm; Asymmetry; Discrete mathematics; Multi-agent system; Computer science; Statistics; Economics","score_opus":0.06395876595364527,"score_gpt":0.32348871495872594,"score_spread":0.25952994900508064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2297353497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066055186,0.000073206225,0.9238789,0.0030974243,0.0025103688,0.001921593,0.0013971882,0.00044305235,0.0006230468],"genre_scores_gemma":[0.85373557,4.2359133e-7,0.1424938,0.0006709759,0.00027220172,0.0001849043,0.00012008277,0.000021276144,0.0025007774],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976767,0.00013708249,0.0005725403,0.0005068836,0.00032272222,0.00078412186],"domain_scores_gemma":[0.99764514,0.0011123937,0.00012748367,0.0005098972,0.00023095305,0.00037416077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005779273,0.00026773516,0.0003803175,0.00016252584,0.00010887188,0.0001247651,0.0006055461,0.000100946825,0.00026171395],"category_scores_gemma":[0.00084724306,0.00022439864,0.00009843473,0.0004103392,0.0000773959,0.00036721924,0.00019248742,0.00008255392,0.0006912522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00240828,0.0049012466,0.06928521,0.00059498596,0.0007872531,0.00042646215,0.006156127,0.0032977453,0.4113305,0.07223651,0.41541034,0.013165359],"study_design_scores_gemma":[0.006367387,0.00053992734,0.009817651,0.00015177125,0.00002774889,0.0001691108,0.00032308255,0.89234436,0.02446922,0.00030528443,0.06419766,0.001286829],"about_ca_topic_score_codex":0.00016477126,"about_ca_topic_score_gemma":0.000077679775,"teacher_disagreement_score":0.8890466,"about_ca_system_score_codex":0.0001337321,"about_ca_system_score_gemma":0.00013371168,"threshold_uncertainty_score":0.91507107},"labels":[],"label_agreement":null},{"id":"W2304177889","doi":"10.1007/978-3-319-24729-8_6","title":"Introduction to Flying Robots","year":2015,"lang":"en","type":"book-chapter","venue":"Springer briefs in electrical and computer engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Robot; Flocking (texture); Rendezvous; Thrust; Control theory (sociology); Engineering; Control engineering; Computer science; Control (management); Aerospace engineering; Artificial intelligence; Physics; Spacecraft","score_opus":0.012691526328842776,"score_gpt":0.20243932765505696,"score_spread":0.1897478013262142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2304177889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008091516,0.001381227,0.99304897,0.00081373344,0.0015441364,0.0004226611,0.0000026028486,0.0004157641,0.0022899783],"genre_scores_gemma":[0.25849286,0.0006443811,0.5092467,0.002963275,0.05604325,0.00064512994,0.00016872745,0.001254911,0.17054074],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736583,0.000018661105,0.0005403032,0.0010134414,0.00045862133,0.0006031564],"domain_scores_gemma":[0.99875546,0.00006785676,0.000101454745,0.0006205657,0.00011421495,0.00034047227],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036675416,0.00048626185,0.00062468275,0.0005746742,0.000052230655,0.00027457572,0.00073362543,0.00026988913,0.0000060609386],"category_scores_gemma":[0.000039530263,0.00053124456,0.00009667129,0.00028462138,0.000012743291,0.00025183658,0.00053564564,0.0006624483,0.000086793545],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021103659,0.00005347055,0.000037910053,0.00012892678,0.0001604063,0.0002339625,0.00024622292,0.10775204,0.00032269594,0.5195149,0.010269111,0.36125922],"study_design_scores_gemma":[0.000469673,0.00014032835,0.0003303703,0.00019788931,0.000014806651,0.000089347865,2.5372836e-7,0.71131563,0.0000324493,0.0010706054,0.28554899,0.0007896389],"about_ca_topic_score_codex":0.000021276144,"about_ca_topic_score_gemma":0.0000031978122,"teacher_disagreement_score":0.6035636,"about_ca_system_score_codex":0.00037406303,"about_ca_system_score_gemma":0.00006067338,"threshold_uncertainty_score":0.9997139},"labels":[],"label_agreement":null},{"id":"W2314461329","doi":"10.2514/6.2007-6454","title":"Real-Time Decentralized Pursuer-Evader Assignment for Cooperating UCAVs Using the DTC Algorithm","year":2007,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation and Control Conference and Exhibit","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Lockheed Martin (Canada)","funders":"","keywords":"Pursuer; Computer science; Algorithm; Real-time computing; Mathematical optimization; Mathematics","score_opus":0.02223777204062755,"score_gpt":0.28030537173249687,"score_spread":0.2580675996918693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2314461329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017574456,0.0006676124,0.9776257,0.0018615125,0.00024961174,0.001248933,0.00003357492,0.00011587987,0.00062268216],"genre_scores_gemma":[0.98609114,0.00006569947,0.012630276,0.00069135963,0.00012819657,0.00010848371,0.000029463521,0.000017043149,0.00023836472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976803,0.0001564107,0.000647743,0.00057972,0.00034370745,0.000592119],"domain_scores_gemma":[0.99831575,0.0003727938,0.00030401186,0.00040528688,0.0004194199,0.00018271104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015393406,0.00029414528,0.00041743083,0.00006987524,0.0005946577,0.00075342186,0.000412144,0.00013815962,0.000008741168],"category_scores_gemma":[0.00006945539,0.00022666686,0.00008221619,0.0002570164,0.0001413159,0.000522331,0.000082505285,0.00014499133,0.0000076955375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000308732,0.000194115,0.0028017971,0.00012793405,0.00045738273,0.0000330991,0.0021005496,0.0004425918,0.32240006,0.16223343,0.0019052016,0.5069951],"study_design_scores_gemma":[0.0063965498,0.00012710321,0.0018181817,0.00025219592,0.000095560295,0.000023372688,0.0006770851,0.9803154,0.0032283235,0.0019042062,0.0047281315,0.00043391343],"about_ca_topic_score_codex":0.00017013635,"about_ca_topic_score_gemma":0.000009679685,"teacher_disagreement_score":0.97987276,"about_ca_system_score_codex":0.000081792816,"about_ca_system_score_gemma":0.00013879435,"threshold_uncertainty_score":0.92432064},"labels":[],"label_agreement":null},{"id":"W2317745919","doi":"10.1080/00207721.2016.1160457","title":"<b>H∞</b>robust synchronisation of nonlinear multi-agent systems with sampled-data information","year":2016,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Control theory (sociology); Nonlinear system; Lipschitz continuity; Bounded function; Controller (irrigation); Multi-agent system; Stability (learning theory); Computer science; Observer (physics); Mathematics; Control (management); Artificial intelligence","score_opus":0.05574252857956415,"score_gpt":0.27922411453242796,"score_spread":0.2234815859528638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2317745919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01691204,0.00021295839,0.9750459,0.0006328004,0.00648404,0.00035326747,0.00019514735,0.00003904118,0.00012478659],"genre_scores_gemma":[0.9871461,0.000031328113,0.012352618,0.000024506176,0.00037408093,0.000008028759,0.000010035158,0.000007661659,0.0000456684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99484956,0.00013437505,0.0014886109,0.0003365227,0.0028668302,0.000324099],"domain_scores_gemma":[0.9921995,0.00022828089,0.0024452931,0.0009125424,0.0040125237,0.0002018519],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0034268547,0.0001969528,0.0003778201,0.00071623904,0.000106467756,0.00071959605,0.0059215208,0.00006287969,0.0000033514634],"category_scores_gemma":[0.000661633,0.000119761986,0.000068481066,0.00060098316,0.000289109,0.008733958,0.00047038036,0.00011574861,0.00004307148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012325057,0.0029104834,0.102697395,0.001297028,0.0033106126,0.0006709896,0.008758104,0.36137843,0.20726396,0.15291075,0.010989234,0.1465805],"study_design_scores_gemma":[0.0062715383,0.00053837,0.010717781,0.0030652566,0.00004951697,0.0021450978,0.00088765833,0.95255864,0.002101664,0.000025802332,0.0210779,0.0005607736],"about_ca_topic_score_codex":0.00031308143,"about_ca_topic_score_gemma":0.000008112416,"teacher_disagreement_score":0.97023404,"about_ca_system_score_codex":0.0006160937,"about_ca_system_score_gemma":0.0009960585,"threshold_uncertainty_score":0.99945694},"labels":[],"label_agreement":null},{"id":"W2319912904","doi":"10.2514/6.2009-5887","title":"Multiple UAVs Formation Flight Experiments Using Virtual Structure and Motion Synchronization","year":2009,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Controller (irrigation); Synchronization (alternating current); Position (finance); Computer science; Tracking (education); Flight simulator; Flight dynamics; Control theory (sociology); Simulation; Control engineering; Real-time computing; Aerospace engineering; Engineering; Control (management); Aerodynamics; Artificial intelligence; Channel (broadcasting)","score_opus":0.013629526141314128,"score_gpt":0.23960937687062,"score_spread":0.22597985072930588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319912904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26176238,0.00052745146,0.73651344,0.00026967446,0.00023617606,0.00048186735,0.00002509576,0.00011133142,0.00007256078],"genre_scores_gemma":[0.9975665,0.00002368449,0.0019196088,0.0002664886,0.000084962856,0.000021648653,0.000077393706,0.000008803753,0.000030916857],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815494,0.00015596289,0.00053427776,0.000509874,0.00032939573,0.00031555947],"domain_scores_gemma":[0.998676,0.000061032297,0.00032914497,0.0003698682,0.00044167927,0.00012227503],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022637562,0.00027039277,0.00031078304,0.000118353484,0.0003806496,0.00054556614,0.00032283124,0.00014840625,0.000004176731],"category_scores_gemma":[0.00007163308,0.00026438144,0.000035940917,0.00030432176,0.00007490673,0.0019580438,0.000043620843,0.00012110233,0.0000038099288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016130279,0.00020068711,0.02919327,0.00013428117,0.0001534628,0.000015801452,0.00409669,0.003371193,0.44335616,0.23297359,0.00021607947,0.2861275],"study_design_scores_gemma":[0.0037376743,0.00012136866,0.026724251,0.00018720065,0.0000321017,0.000028862187,0.00012680754,0.9588837,0.0061724675,0.003347631,0.0003132729,0.0003246726],"about_ca_topic_score_codex":0.00003300346,"about_ca_topic_score_gemma":0.0000068362706,"teacher_disagreement_score":0.9555125,"about_ca_system_score_codex":0.000110448156,"about_ca_system_score_gemma":0.00007602767,"threshold_uncertainty_score":0.99998087},"labels":[],"label_agreement":null},{"id":"W2322038820","doi":"10.1142/s1469026816500012","title":"A PSO-Based Approach with Fuzzy Obstacle Avoidance for Cooperative Multi-Robots in Unknown Environments","year":2016,"lang":"en","type":"article","venue":"International Journal of Computational Intelligence and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Obstacle avoidance; Computer science; Robot; Smoothness; Fuzzy logic; Trajectory; Task (project management); Artificial intelligence; Obstacle; Field (mathematics); Motion planning; Robotics; Key (lock); Collision avoidance; Mobile robot; Engineering; Mathematics","score_opus":0.030939680617800957,"score_gpt":0.2919958861651228,"score_spread":0.26105620554732184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322038820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001815118,0.00014475077,0.99558926,0.0017586643,0.00009138188,0.00047294796,0.00004916147,0.00001311151,0.00006558168],"genre_scores_gemma":[0.8586276,0.000021107197,0.14077206,0.00019457705,0.000082238315,0.00019931886,0.000015579253,0.000008444219,0.00007907054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846286,0.00005401024,0.00056626933,0.00029464735,0.00045664705,0.00016556651],"domain_scores_gemma":[0.99826574,0.00054044934,0.00040532512,0.00014638262,0.0005449577,0.00009716875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029713503,0.00014992904,0.00019644678,0.00021300909,0.00007359619,0.000121508325,0.00081081194,0.00004447983,0.0000031482293],"category_scores_gemma":[0.00005529314,0.00010534477,0.00006467896,0.00019952934,0.00011554099,0.0005293344,0.000050954895,0.00009666561,0.000009519743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012941907,0.00080075004,0.0015949367,0.000012617488,0.00015233202,0.000009992104,0.0002613658,0.71920127,0.00083976047,0.1817451,0.00005860664,0.09519388],"study_design_scores_gemma":[0.0059923707,0.00049188366,0.011184434,0.00046226566,0.0000351333,0.00027810043,0.00025795298,0.92774147,0.0046107434,0.034338433,0.01393007,0.0006771182],"about_ca_topic_score_codex":0.000004990398,"about_ca_topic_score_gemma":0.0000052128844,"teacher_disagreement_score":0.8568125,"about_ca_system_score_codex":0.00014764897,"about_ca_system_score_gemma":0.00017009822,"threshold_uncertainty_score":0.42958352},"labels":[],"label_agreement":null},{"id":"W2322654826","doi":"10.2514/6.2010-8426","title":"Decentralized Sliding Control of Cooperative Multi-Agent Systems Subject to Communication Delays","year":2010,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subject (documents); Computer science; Multi-agent system; Control (management); Control system; Decentralised system; Control theory (sociology); Distributed computing; Control engineering; Engineering; Artificial intelligence; World Wide Web","score_opus":0.01803225674292747,"score_gpt":0.26218027566380725,"score_spread":0.24414801892087978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2322654826","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10309859,0.0014483085,0.89118606,0.0009330473,0.0008454822,0.0019133812,0.00012642043,0.00017574085,0.00027298278],"genre_scores_gemma":[0.9951961,0.000071907154,0.0037135072,0.0003510388,0.000048478512,0.00044998145,0.000038932765,0.000022970076,0.000107087275],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635965,0.0006249244,0.001205338,0.00073985854,0.0004933728,0.0005768863],"domain_scores_gemma":[0.99528354,0.00054974935,0.0006396082,0.00131958,0.0018830586,0.00032446365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014358053,0.0004200885,0.00084944983,0.00018707184,0.0004191311,0.0005852249,0.0014942718,0.00021323201,0.000009330643],"category_scores_gemma":[0.000425054,0.00039886055,0.00011689342,0.000618153,0.00017488045,0.00074538315,0.00013773971,0.00037490093,0.000033901753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024552835,0.00032974264,0.03303003,0.00016752066,0.0004647683,0.000011955688,0.002617403,0.002006486,0.41286507,0.5410401,0.0005688074,0.0066525456],"study_design_scores_gemma":[0.018531932,0.00028922962,0.045728832,0.00084771344,0.00018427524,0.000043499553,0.0005699285,0.91439474,0.0069249757,0.000638428,0.010798379,0.0010480856],"about_ca_topic_score_codex":0.00059491314,"about_ca_topic_score_gemma":0.00018061472,"teacher_disagreement_score":0.9123882,"about_ca_system_score_codex":0.00008388215,"about_ca_system_score_gemma":0.0003219134,"threshold_uncertainty_score":0.99984634},"labels":[],"label_agreement":null},{"id":"W2323046523","doi":"10.1109/chicc.2014.6896641","title":"Distributed receding horizon estimation for sensor networks with improved consensus strategy","year":2014,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Wireless sensor network; Computer science; Mathematical optimization; Upper and lower bounds; Bounded function; Consensus; Scheme (mathematics); Node (physics); Optimization problem; Graph; Tree (set theory); Estimation; Control theory (sociology); Multi-agent system; Mathematics; Engineering; Computer network; Theoretical computer science; Artificial intelligence","score_opus":0.014513151491705881,"score_gpt":0.2369496732687531,"score_spread":0.22243652177704723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323046523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005586329,0.000014016662,0.991243,0.00063996896,0.0004056314,0.0008803763,0.000036630452,0.00053193176,0.00066212425],"genre_scores_gemma":[0.8977414,5.986167e-7,0.10165889,0.00005259573,0.00013793352,0.00010059735,0.00013268975,0.000017716948,0.0001576108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982379,0.00010102519,0.0003911077,0.0005427703,0.00020577495,0.00052141416],"domain_scores_gemma":[0.9982497,0.00046024952,0.00024666643,0.0005815621,0.0002961185,0.00016571353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055679533,0.0002444844,0.00030722452,0.000059095968,0.00018137279,0.0003926302,0.00046209485,0.00012122755,0.000003360473],"category_scores_gemma":[0.0001987726,0.00019338871,0.000069230744,0.0003257823,0.00003960377,0.0002389102,0.000055903543,0.00011633581,0.0000109039665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003856518,0.00021534176,0.0006781571,0.00014657177,0.00031183928,0.000014413335,0.00010057728,0.5257335,0.011086842,0.1745127,0.00818142,0.27863303],"study_design_scores_gemma":[0.0018247316,0.0005755533,0.0003049787,0.000030789106,0.000021601336,0.000019895122,0.000036490077,0.99492043,0.0007998617,0.00023641573,0.00094623305,0.00028299447],"about_ca_topic_score_codex":0.00006456432,"about_ca_topic_score_gemma":0.00003552554,"teacher_disagreement_score":0.89215505,"about_ca_system_score_codex":0.00008426875,"about_ca_system_score_gemma":0.000055748973,"threshold_uncertainty_score":0.7886163},"labels":[],"label_agreement":null},{"id":"W2323384454","doi":"10.2514/6.2012-5048","title":"Vision-based Quadrotor Micro-UAV Position and Yaw Estimation and Control","year":2012,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heading (navigation); Position (finance); Kalman filter; Computer vision; Computer science; Euler angles; Artificial intelligence; Tracking (education); Yaw; Pose; Extended Kalman filter; Control theory (sociology); Control (management); Engineering; Mathematics","score_opus":0.007684993071630016,"score_gpt":0.24113686738689188,"score_spread":0.23345187431526188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2323384454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13361488,0.0025757614,0.8596907,0.0022590826,0.00033973216,0.001087647,0.00007283127,0.00016877336,0.00019055515],"genre_scores_gemma":[0.9951584,0.000026916232,0.0033604668,0.0010175453,0.000102674654,0.0002207603,0.00004788301,0.000016273076,0.000049115963],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99762446,0.0002992717,0.0006177231,0.0006004538,0.00034537664,0.00051273685],"domain_scores_gemma":[0.99799997,0.00040795462,0.00036665148,0.00047371603,0.00044598943,0.00030573923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00086480763,0.00035052997,0.00048061143,0.00013617842,0.00040726687,0.0006482933,0.00032363852,0.0001762382,0.000006324292],"category_scores_gemma":[0.00012487847,0.0003346278,0.000055657954,0.00024309692,0.00022282811,0.0014340214,0.000051399107,0.00017150423,0.000019125522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061412546,0.00067782134,0.291117,0.0007398563,0.000464975,0.000024445364,0.0021335224,0.00041789538,0.29568607,0.23320101,0.001429199,0.17349407],"study_design_scores_gemma":[0.010291185,0.00025101117,0.23297784,0.0004830208,0.00013585815,0.000049680013,0.000061040744,0.74822617,0.0020469066,0.0030704832,0.0017628495,0.00064397726],"about_ca_topic_score_codex":0.00012950755,"about_ca_topic_score_gemma":0.00000797931,"teacher_disagreement_score":0.8615435,"about_ca_system_score_codex":0.0000652218,"about_ca_system_score_gemma":0.0001311174,"threshold_uncertainty_score":0.9999106},"labels":[],"label_agreement":null},{"id":"W2328116105","doi":"10.2514/6.2014-0639","title":"DIMMACSS-Stage: a Distributed Intelligence Model for a Multi-Agent Control System using Simulink and the Stage robotic simulator","year":2014,"lang":"en","type":"article","venue":"AIAA Modeling and Simulation Technologies Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Stage (stratigraphy); Computer science; Simulation","score_opus":0.08842966684000086,"score_gpt":0.3035431953778837,"score_spread":0.21511352853788285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328116105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022119515,0.00044626943,0.97382516,0.00044297308,0.00015841388,0.0016854865,0.00011193659,0.0012060804,0.000004148789],"genre_scores_gemma":[0.96839,0.000027927841,0.031272747,0.00006683228,0.000018708604,0.0001406986,0.000017557077,0.00002506001,0.000040482457],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970517,0.00020328054,0.00087045797,0.0009310697,0.00035315976,0.0005903157],"domain_scores_gemma":[0.9967023,0.001145175,0.00042719266,0.0010353905,0.0005819452,0.00010799665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012065922,0.00044829142,0.0007067101,0.00017502738,0.0006307542,0.0006391689,0.0010381859,0.0003043857,4.388457e-7],"category_scores_gemma":[0.001342451,0.00033910992,0.00012471907,0.00028460563,0.00030898687,0.0005128858,0.0004165858,0.00031318126,0.0000022017432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006989305,0.000023462379,0.000116467134,0.00012102067,0.000045675188,9.920733e-7,0.00026943788,0.9001575,0.00008213342,0.09153498,3.906564e-7,0.007578052],"study_design_scores_gemma":[0.0033335485,0.00005669298,0.0000065888003,0.00014177189,0.00006646366,0.000002620503,0.00075102045,0.99295187,0.000054026543,0.0022134134,0.000022014638,0.00039999123],"about_ca_topic_score_codex":0.00007444112,"about_ca_topic_score_gemma":0.000010510234,"teacher_disagreement_score":0.94627047,"about_ca_system_score_codex":0.00012348664,"about_ca_system_score_gemma":0.000093148345,"threshold_uncertainty_score":0.99990606},"labels":[],"label_agreement":null},{"id":"W2328441893","doi":"10.2514/6.2007-6410","title":"Cooperative and Deceptive Planning of Multiformations of Networked UCAVs in Adversarial Urban Environments","year":2007,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation and Control Conference and Exhibit","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Adversarial system; Computer science; Artificial intelligence","score_opus":0.012104741959961427,"score_gpt":0.2446131804339696,"score_spread":0.23250843847400818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328441893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49464086,0.0006942999,0.50346935,0.00010399801,0.000092882896,0.0004212229,0.000022869997,0.000013659725,0.0005408891],"genre_scores_gemma":[0.99916923,0.000036416288,0.0006102037,0.00009238114,0.000021368101,0.000019564037,0.000017220711,0.0000041696467,0.000029471272],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865764,0.00009174884,0.0005796359,0.0002750763,0.00017572698,0.0002201913],"domain_scores_gemma":[0.9991608,0.0001933336,0.00029418376,0.00016379585,0.000104563725,0.00008329623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005596635,0.00015440333,0.00034907804,0.00011759776,0.00008722772,0.000057378114,0.00015138487,0.00009507828,0.000002510923],"category_scores_gemma":[0.000046447014,0.00014707814,0.000026058817,0.00020368467,0.00017978084,0.0005092695,0.00006338229,0.00011181015,0.0000011186588],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014105205,0.00046915654,0.5147798,0.00027207646,0.00046688563,0.000034448552,0.036505397,0.0033804134,0.119080536,0.1930974,0.00030171548,0.13020161],"study_design_scores_gemma":[0.01901859,0.00046215497,0.44817966,0.0011925881,0.00007791652,0.000009784388,0.0045614922,0.5166173,0.0062104654,0.0015416841,0.0015384768,0.0005899012],"about_ca_topic_score_codex":0.00009402738,"about_ca_topic_score_gemma":0.000024124862,"teacher_disagreement_score":0.5132369,"about_ca_system_score_codex":0.000025753767,"about_ca_system_score_gemma":0.00004831872,"threshold_uncertainty_score":0.59976727},"labels":[],"label_agreement":null},{"id":"W2328586576","doi":"10.2514/6.2013-5109","title":"A Coverage Strategy with Guaranteed Collision Avoidance in Multi-Agent Systems using Navigation Functions","year":2013,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control (GNC) Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Collision avoidance; Computer science; Collision avoidance system; Collision; Real-time computing; Embedded system; Computer security","score_opus":0.024104871249313042,"score_gpt":0.2443104630996101,"score_spread":0.22020559185029706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2328586576","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33987588,0.0010534166,0.6561003,0.00018327995,0.0004597663,0.0018678652,0.000066713896,0.00016517765,0.00022761052],"genre_scores_gemma":[0.99726623,0.00003541585,0.0012144768,0.00017401698,0.00007692597,0.00070969644,0.00007682492,0.000033222575,0.00041318606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99569106,0.00049577234,0.001229709,0.0011327132,0.000686453,0.000764288],"domain_scores_gemma":[0.99673665,0.00024480332,0.0006980532,0.0009052684,0.0011711264,0.00024409783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007518721,0.00056438375,0.0007813432,0.00025388683,0.0005047985,0.0014034751,0.00079578644,0.00024585225,0.000009763131],"category_scores_gemma":[0.00007113452,0.0005068015,0.000090133195,0.0011082266,0.00020483755,0.0019833874,0.00009109734,0.0003958884,0.00007779614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078371854,0.0018929522,0.29633433,0.0014411573,0.0009979833,0.00032822453,0.0055452664,0.32293463,0.1605021,0.1816046,0.0012274401,0.026407585],"study_design_scores_gemma":[0.00784012,0.00020600305,0.06477735,0.0014757424,0.000055833083,0.00007802491,0.0005933871,0.92268324,0.00022459157,0.00056389323,0.0008417947,0.0006600308],"about_ca_topic_score_codex":0.004980491,"about_ca_topic_score_gemma":0.0002329328,"teacher_disagreement_score":0.65739036,"about_ca_system_score_codex":0.00030901068,"about_ca_system_score_gemma":0.00047545973,"threshold_uncertainty_score":0.99973834},"labels":[],"label_agreement":null},{"id":"W2331478043","doi":"10.1115/dscc2010-4297","title":"State Estimation for Kinematic Model Over Lossy Network","year":2010,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Lossy compression; Control theory (sociology); Kalman filter; Covariance; Computer science; Kinematics; Estimator; Network packet; Dropout (neural networks); Filter (signal processing); Mathematics; Statistics; Artificial intelligence; Machine learning","score_opus":0.01270831334518689,"score_gpt":0.2583156299532022,"score_spread":0.2456073166080153,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331478043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006516496,0.000006784723,0.99042064,0.00041266877,0.00067962945,0.0005764222,0.000010676156,0.0002516308,0.0011250343],"genre_scores_gemma":[0.6203013,2.3001701e-7,0.37817746,0.00020529993,0.000060502683,0.000087009365,0.000010927523,0.000008508067,0.0011487665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988896,0.000017380751,0.0002852505,0.00027529005,0.00021021033,0.00032225528],"domain_scores_gemma":[0.9989958,0.0001240898,0.00011703214,0.0005767414,0.00009553122,0.0000908478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003832543,0.00012412434,0.00016369222,0.000035956407,0.000087967805,0.00023912912,0.0005674848,0.000051667543,0.00001563671],"category_scores_gemma":[0.00007623243,0.00010465451,0.000068169975,0.00015441282,0.000015097098,0.00050727674,0.000078771634,0.0000879913,0.00007661606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006410986,0.000045457386,0.00009121129,0.000047008427,0.000023916713,0.000001212624,0.00015928755,0.7819702,0.0014476212,0.19278798,0.014842487,0.008577224],"study_design_scores_gemma":[0.00052846194,0.000015555068,0.00025678313,0.000010922361,0.0000056008694,0.0000022447011,0.0000012641802,0.96655285,0.00008969653,0.031928692,0.0004783961,0.00012955465],"about_ca_topic_score_codex":0.00001805862,"about_ca_topic_score_gemma":0.00004994131,"teacher_disagreement_score":0.6137848,"about_ca_system_score_codex":0.000019053252,"about_ca_system_score_gemma":0.00005028049,"threshold_uncertainty_score":0.4267687},"labels":[],"label_agreement":null},{"id":"W2332614498","doi":"10.2514/6.2007-157","title":"A Control Framework for Configurable Formation Flight of Autonomous Helicopters","year":2007,"lang":"en","type":"article","venue":"45th AIAA Aerospace Sciences Meeting and Exhibit","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Control (management); Aeronautics; Control engineering; Aerospace engineering; Engineering; Artificial intelligence","score_opus":0.01769614908231603,"score_gpt":0.26978562695160335,"score_spread":0.2520894778692873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332614498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08125312,0.00045683066,0.9127329,0.001497694,0.00056873146,0.0006131544,0.000016302956,0.00015342575,0.0027078413],"genre_scores_gemma":[0.9464714,0.000008046368,0.053041834,0.00027056877,0.00007906467,0.000028675358,0.0000024614128,0.0000075502053,0.000090381254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976958,0.00006541159,0.00054386654,0.0005217923,0.00047109375,0.00070205226],"domain_scores_gemma":[0.9981684,0.00061109086,0.0004856273,0.00034705704,0.00019686649,0.00019093159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034909006,0.00020733019,0.0003825716,0.00016042705,0.0004849536,0.00033679398,0.00071168627,0.00012212819,0.0000026341565],"category_scores_gemma":[0.00047931913,0.00017944073,0.00010322311,0.0005641116,0.00025912255,0.0007516659,0.00007125279,0.00011537585,0.000009063558],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000266881,0.00030451946,0.010551939,0.00073496794,0.00014573886,0.000017032458,0.010628204,0.007446545,0.13721338,0.77736175,0.0022103323,0.053118713],"study_design_scores_gemma":[0.008264678,0.0019933197,0.0049638916,0.0018432993,0.00011645096,0.00010354199,0.0042796335,0.72550064,0.22587305,0.0110938195,0.014153874,0.0018138157],"about_ca_topic_score_codex":0.00015855009,"about_ca_topic_score_gemma":0.00002851133,"teacher_disagreement_score":0.8652183,"about_ca_system_score_codex":0.00005735875,"about_ca_system_score_gemma":0.00010445701,"threshold_uncertainty_score":0.7317381},"labels":[],"label_agreement":null},{"id":"W2332732686","doi":"10.2514/6.2009-6289","title":"Coordinated Attitude Control of Spacecraft Formation Without Angular Velocity Feedback: A Decentralized Approach","year":2009,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Angular velocity; Attitude control; Control theory (sociology); Feedback control; Control (management); Computer science; Aerospace engineering; Physics; Control engineering; Engineering; Classical mechanics; Artificial intelligence","score_opus":0.011765703160408586,"score_gpt":0.23654384507103976,"score_spread":0.22477814191063117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332732686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059821922,0.001283429,0.93499225,0.0012798046,0.00018062601,0.0013243925,0.00006801172,0.0002371625,0.00081239094],"genre_scores_gemma":[0.99538636,0.000050041042,0.0037258,0.0005201985,0.00004303069,0.00010177358,0.00007827853,0.000013111334,0.00008141027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967275,0.00038811448,0.001029317,0.0006888735,0.00055635785,0.00060983765],"domain_scores_gemma":[0.9969502,0.00012343215,0.00074594904,0.0007760206,0.0011749507,0.00022941374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008985652,0.00042768306,0.0008962257,0.00016276323,0.00026719624,0.0003662061,0.00093367335,0.00021639247,0.0000061663386],"category_scores_gemma":[0.0001490081,0.00040396384,0.0001478763,0.0006463596,0.00019160041,0.0012221921,0.000047412737,0.00022779756,0.000011138182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014197334,0.0015334071,0.07036995,0.00073501415,0.0011389818,0.000038264796,0.0039977543,0.002978514,0.19733407,0.6058195,0.0020778857,0.11255691],"study_design_scores_gemma":[0.019698529,0.00028479553,0.14090662,0.00040945408,0.00017270168,0.000039554325,0.00015561364,0.828863,0.0017158951,0.0049543628,0.002103232,0.0006962495],"about_ca_topic_score_codex":0.00011403139,"about_ca_topic_score_gemma":0.000012479118,"teacher_disagreement_score":0.93556446,"about_ca_system_score_codex":0.000107081556,"about_ca_system_score_gemma":0.00023379992,"threshold_uncertainty_score":0.9998412},"labels":[],"label_agreement":null},{"id":"W2335320036","doi":"10.2514/6.2013-4991","title":"Tracking a Moving Target by a Fixed-wing UAV Based on Sliding Mode Control","year":2013,"lang":"en","type":"article","venue":"AIAA Guidance, Navigation, and Control (GNC) Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tracking (education); Control theory (sociology); Computer science; Stability (learning theory); Mode (computer interface); Sliding mode control; Computer vision; Artificial intelligence; Control (management); Nonlinear system; Physics","score_opus":0.009337430473513169,"score_gpt":0.2243726992354079,"score_spread":0.21503526876189472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2335320036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027754968,0.0008202116,0.964344,0.0028383012,0.0005684648,0.0015641145,0.00012409926,0.00046351374,0.001522289],"genre_scores_gemma":[0.99394655,0.000011665229,0.002353647,0.0024724388,0.0001623746,0.0006862045,0.00006202602,0.0000448252,0.00026028347],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951804,0.00048964465,0.0011589467,0.001291969,0.0008222122,0.0010567826],"domain_scores_gemma":[0.9961707,0.0008493912,0.0006321976,0.0010493338,0.0009172331,0.00038112854],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009644183,0.0006632654,0.00091258844,0.00023034468,0.0007028953,0.0017140599,0.0013371675,0.0002651048,0.000041466134],"category_scores_gemma":[0.0003685535,0.0006435057,0.0002008294,0.00056937063,0.0001311157,0.0018462968,0.0000843043,0.00046207273,0.0000949152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005389597,0.0011476714,0.1226532,0.0007012453,0.0011056255,0.00012990463,0.004165407,0.037450645,0.41532856,0.2804037,0.0162776,0.120097466],"study_design_scores_gemma":[0.007106859,0.00014805251,0.008855606,0.0006708919,0.000054332457,0.000008281133,0.00012587602,0.97511107,0.001594731,0.0027418411,0.002863788,0.00071869994],"about_ca_topic_score_codex":0.00094003486,"about_ca_topic_score_gemma":0.00002115422,"teacher_disagreement_score":0.9661916,"about_ca_system_score_codex":0.00018849867,"about_ca_system_score_gemma":0.00031119614,"threshold_uncertainty_score":0.9996016},"labels":[],"label_agreement":null},{"id":"W2336159922","doi":"10.1109/tcyb.2015.2428056","title":"Synchronous Hybrid Event- and Time-Driven Consensus in Multiagent Networks With Time Delays","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Program for New Century Excellent Talents in University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Robustness (evolution); Network topology; Control theory (sociology); Consensus; Time shifting; LTI system theory; Discrete time and continuous time; Multi-agent system; Distributed computing; Control (management); Mathematics; Artificial intelligence; Computer network; Linear system","score_opus":0.011873332087888842,"score_gpt":0.21552252357640325,"score_spread":0.2036491914885144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2336159922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05858602,0.00013839862,0.9395199,0.00024356217,0.00035171592,0.00057657313,0.00004191286,0.00018410906,0.0003578495],"genre_scores_gemma":[0.9924035,0.000013737103,0.0068212887,0.000093080154,0.000035283178,0.000051449846,0.000005941193,0.000028626844,0.0005470981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808013,0.00018131433,0.00039090228,0.0005242198,0.00037060023,0.00045283977],"domain_scores_gemma":[0.998665,0.00018408083,0.00011958158,0.00057987846,0.0001306723,0.0003208263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025854702,0.0002851145,0.00033127266,0.000153329,0.00008722047,0.00014056862,0.00040995737,0.0001021574,0.000014762726],"category_scores_gemma":[0.0000074582986,0.00026847073,0.000058376372,0.0003053122,0.00010361407,0.00012849418,0.0000071066497,0.0003007683,0.00026249347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008320079,0.0003483927,0.00011703737,0.000008173098,0.00009251472,0.00021031238,0.0003855338,0.98304844,0.00026331667,0.000054622302,0.00077142846,0.014617003],"study_design_scores_gemma":[0.0024152345,0.00038895826,0.00022638083,0.00007384992,0.000039891256,0.00018338185,0.000024967436,0.9952716,0.00062667386,0.0000181889,0.00040787633,0.00032300243],"about_ca_topic_score_codex":0.00016459456,"about_ca_topic_score_gemma":0.0001235466,"teacher_disagreement_score":0.93381745,"about_ca_system_score_codex":0.0002145383,"about_ca_system_score_gemma":0.0001383916,"threshold_uncertainty_score":0.99997675},"labels":[],"label_agreement":null},{"id":"W2343300880","doi":"10.1109/tcst.2016.2517448","title":"Distributed Formation Recovery Control of Heterogeneous Multiagent Euler–Lagrange Systems Subject to Network Switching and Diagnostic Imperfections","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund","keywords":"Network topology; Multi-agent system; Nonlinear system; Computer science; Parametric statistics; Synchronization (alternating current); Control theory (sociology); Topology (electrical circuits); Distributed computing; Set (abstract data type); Telecommunications network; Control (management); Heterogeneous network; Control engineering; Engineering; Computer network; Mathematics; Artificial intelligence; Telecommunications; Wireless network","score_opus":0.008129437309378955,"score_gpt":0.20893468112308675,"score_spread":0.2008052438137078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343300880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03454861,0.001266142,0.9537634,0.0011288371,0.0040496998,0.00330591,0.0009978832,0.00092939724,0.0000100962525],"genre_scores_gemma":[0.99757516,0.0000999158,0.00017054749,0.00006969782,0.00013363372,0.0018740402,0.0000055494174,0.000045275745,0.000026194712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99573445,0.00054626726,0.00141036,0.00089124043,0.0004814534,0.0009362355],"domain_scores_gemma":[0.99490964,0.0024773558,0.00064745685,0.001265809,0.00041139923,0.00028836098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008784112,0.00053750846,0.0011289637,0.0008469938,0.00044411427,0.00020753447,0.0008613621,0.00044342937,0.0000031460002],"category_scores_gemma":[0.00025283417,0.00043129886,0.00025415092,0.00092786254,0.00009250201,0.00062922155,0.000013561407,0.00031297447,0.00007279357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005935293,0.00072452374,0.0012324102,0.00048665606,0.0018743369,0.00013423042,0.00028612124,0.73551244,0.18233757,0.0044402992,0.0005026017,0.071875274],"study_design_scores_gemma":[0.025259843,0.0040039713,0.0010795431,0.003241892,0.0008006028,0.001706939,0.00031452996,0.94406736,0.011698706,0.0002852218,0.005262628,0.002278762],"about_ca_topic_score_codex":0.00036544458,"about_ca_topic_score_gemma":0.0002529699,"teacher_disagreement_score":0.9630265,"about_ca_system_score_codex":0.00047655075,"about_ca_system_score_gemma":0.00007622701,"threshold_uncertainty_score":0.99981385},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.021537655083103124,"score_gpt":0.232302752335776,"score_spread":0.21076509725267287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2344279181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00064526295,0.00036443424,0.99129647,0.00032867625,0.00410758,0.001358579,0.0006522458,0.0008921231,0.00035461038],"genre_scores_gemma":[0.99718285,0.00001333196,0.0018642523,0.0001422081,0.00025947622,0.00016149973,0.00011872977,0.000045813256,0.00021186908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957541,0.00075433386,0.0011661525,0.0007188463,0.00093090785,0.0006756474],"domain_scores_gemma":[0.99649775,0.0006379005,0.0006602975,0.0011068443,0.0006892314,0.00040798384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083952374,0.00047277682,0.0010055058,0.00029457948,0.00021907217,0.00020927173,0.0009415072,0.00026263308,0.0000125912475],"category_scores_gemma":[0.00004323571,0.00044851968,0.00029723145,0.0013339983,0.00007503917,0.00045747866,0.000004554588,0.0003550157,0.00009140621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027204273,0.00042902498,0.000035062923,0.000027244078,0.00032186456,0.000016708205,0.000062851155,0.9948161,0.00023320109,0.0005310658,0.0020795318,0.0011752684],"study_design_scores_gemma":[0.0053194514,0.00048492049,0.00004274745,0.00031810405,0.00010239246,0.000022236904,0.000024845656,0.9922674,0.00012283867,0.000033413628,0.0008679288,0.0003937359],"about_ca_topic_score_codex":0.00012989456,"about_ca_topic_score_gemma":0.000011887859,"teacher_disagreement_score":0.99653757,"about_ca_system_score_codex":0.0002608282,"about_ca_system_score_gemma":0.0001715431,"threshold_uncertainty_score":0.9997966},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012228649240678673,"score_gpt":0.2000832340893112,"score_spread":0.18785458484863252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345097924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0137042375,0.000010153005,0.98473734,0.00032024743,0.00016795509,0.0004607647,0.000008110486,0.00013276914,0.00045841146],"genre_scores_gemma":[0.98631483,0.0000039981146,0.012743965,0.00005813924,0.000023077579,0.00017986655,4.6635023e-7,0.000022652222,0.0006529829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998268,0.00010192478,0.00027034988,0.0005279966,0.0004193453,0.0004123511],"domain_scores_gemma":[0.99909496,0.00013716881,0.00006600774,0.000508389,0.000025095136,0.00016836841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019356176,0.0002104025,0.00020988235,0.00021507085,0.00009072213,0.00008047083,0.00049213634,0.00007064876,0.000010283493],"category_scores_gemma":[0.0000068686627,0.00015477717,0.000052652937,0.00033531862,0.000035334207,0.00015680229,0.0000051457905,0.00020830306,0.00020876466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037952028,0.00032356314,0.00003917724,0.0000063555144,0.00003392526,0.000010282023,0.0011282639,0.9418593,0.0020215076,0.0004863872,0.000012892583,0.054040365],"study_design_scores_gemma":[0.0068206317,0.0017111449,0.0021944842,0.0006821871,0.00007459276,0.00010929784,0.00033727117,0.97709477,0.0062305164,0.00016066556,0.0031337498,0.0014506766],"about_ca_topic_score_codex":0.000043505584,"about_ca_topic_score_gemma":0.00002886416,"teacher_disagreement_score":0.9726106,"about_ca_system_score_codex":0.00024991622,"about_ca_system_score_gemma":0.000037866565,"threshold_uncertainty_score":0.63116294},"labels":[],"label_agreement":null},{"id":"W2374900773","doi":"10.2316/journal.206.2016.3.206-4746","title":"ARTIFICIAL IMMUNE NETWORK-BASED MULTI-ROBOT FORMATION PATH PLANNING WITH OBSTACLE AVOIDANCE","year":2016,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Shandong University","keywords":"Obstacle avoidance; Motion planning; Obstacle; Computer science; Path (computing); Robot; Artificial intelligence; Mobile robot; Computer network; Geography","score_opus":0.020814101877144036,"score_gpt":0.25337927114406866,"score_spread":0.23256516926692464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2374900773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024074845,0.00012439853,0.9722685,0.0026048797,0.000779049,0.00008887631,0.000005257394,0.000040989256,0.000013163522],"genre_scores_gemma":[0.92221534,0.0000076158367,0.07749095,0.00006913662,0.00018794936,0.0000025970326,0.00000513643,0.0000063961725,0.000014870465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998608,0.00006433042,0.0005548321,0.00012007081,0.00049754785,0.00015522841],"domain_scores_gemma":[0.99837565,0.00013155962,0.0007763483,0.00012110726,0.000533254,0.000062082414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044178925,0.0001102436,0.00016002991,0.00012513698,0.00007748398,0.0002479663,0.0004101251,0.000043128683,0.0000022903348],"category_scores_gemma":[0.0000749942,0.000073110234,0.000052599687,0.00010248339,0.000026092404,0.0011642198,0.000040626204,0.00008057306,0.0000054583584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014140736,0.00018466375,0.006056911,0.000021898752,0.00016930891,0.00011557878,0.00043514252,0.82520825,0.021382855,0.017433353,0.00023914338,0.12861149],"study_design_scores_gemma":[0.0015724775,0.00014180578,0.026788505,0.00066131935,0.000014224177,0.00014815068,0.00002103296,0.96739274,0.002286284,0.0006070817,0.00021949981,0.00014687984],"about_ca_topic_score_codex":0.0000032056446,"about_ca_topic_score_gemma":0.0000021634073,"teacher_disagreement_score":0.8981405,"about_ca_system_score_codex":0.000111845104,"about_ca_system_score_gemma":0.00007045841,"threshold_uncertainty_score":0.2981349},"labels":[],"label_agreement":null},{"id":"W2394585357","doi":"10.1109/tcst.2016.2562578","title":"Synchronized Closed Path Following for a Differential Drive and Manipulator Robot","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Synchronizing; Control theory (sociology); Traverse; Synchronization (alternating current); Path (computing); Trajectory; Robot; Serial manipulator; Controller (irrigation); Computer science; Differential (mechanical device); Robot kinematics; Parallel manipulator; Singularity; Motion planning; Control engineering; Mobile robot; Topology (electrical circuits); Engineering; Mathematics; Control (management); Artificial intelligence; Transmission (telecommunications)","score_opus":0.009842065743758463,"score_gpt":0.22329449419027955,"score_spread":0.2134524284465211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394585357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027040992,0.00024762072,0.9642172,0.001730844,0.0032116498,0.0022879208,0.00014017055,0.0011104672,0.000013130086],"genre_scores_gemma":[0.99667436,0.000009610115,0.0012903971,0.000040772422,0.000087846085,0.0016680083,0.0000013121537,0.00004069194,0.00018702254],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972586,0.00015116231,0.0006768565,0.0008999025,0.0003089567,0.00070453214],"domain_scores_gemma":[0.99799967,0.0004730973,0.00026387145,0.0009656262,0.00014216886,0.00015558781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029068874,0.00040110873,0.0008184602,0.00051104964,0.00033471602,0.00016585713,0.0008308069,0.00046183995,0.0000038884564],"category_scores_gemma":[0.00003699576,0.00030028628,0.00030331156,0.00027987277,0.00009854071,0.00033992756,0.000007182326,0.00019585573,0.00004045448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077211147,0.00080516725,0.0005631407,0.00027170684,0.0028342044,0.00015417334,0.000227825,0.0014846675,0.74644375,0.07592114,0.00026064494,0.17026149],"study_design_scores_gemma":[0.09343472,0.0031112966,0.00081031176,0.0017080865,0.0009755052,0.00045752866,0.00029195964,0.8539607,0.034808032,0.0028327473,0.0047391467,0.0028699571],"about_ca_topic_score_codex":0.000034498025,"about_ca_topic_score_gemma":0.00003088657,"teacher_disagreement_score":0.96963334,"about_ca_system_score_codex":0.0002490884,"about_ca_system_score_gemma":0.000077828096,"threshold_uncertainty_score":0.9999449},"labels":[],"label_agreement":null},{"id":"W2396364797","doi":"10.2316/journal.201.2008.3.201-1909","title":"FORMATION CONTROLLERS FOR UNDERACTUATED SURFACE VESSELS AND ZERO DYNAMICS STABILITY","year":2008,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Underactuation; Zero (linguistics); Control theory (sociology); Stability (learning theory); Dynamics (music); Surface (topology); Computer science; Mathematics; Physics; Control (management); Geometry; Artificial intelligence","score_opus":0.03468671209568224,"score_gpt":0.23678551397877012,"score_spread":0.20209880188308788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2396364797","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08890931,0.0022629763,0.90451676,0.00061309483,0.0008228405,0.0023504514,0.0001543459,0.00019369506,0.00017649533],"genre_scores_gemma":[0.99895394,0.00016554352,0.00029049587,0.0001177735,0.00005935064,0.00015151626,0.00006114166,0.000018176308,0.0001820608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975095,0.0002509316,0.00083984685,0.00058145623,0.00032060183,0.0004977038],"domain_scores_gemma":[0.9977685,0.0007078756,0.00036832097,0.0005182035,0.00038770694,0.00024936837],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00090851774,0.00032647225,0.0006940427,0.00008866467,0.00039584536,0.0003401382,0.00039458863,0.00015745583,0.0000024075262],"category_scores_gemma":[0.00019023017,0.0002830058,0.00010719949,0.00016807584,0.00011870999,0.0008701647,0.000065244174,0.00013005661,0.000021292011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0046473183,0.002459538,0.04836073,0.0062828506,0.004654829,0.00019627094,0.023934394,0.046795506,0.06658347,0.6795753,0.026001973,0.09050781],"study_design_scores_gemma":[0.0035379832,0.00019019606,0.00058292615,0.000059752332,0.00003503499,0.000091494345,0.00035488294,0.9908282,0.0004107789,0.0003773361,0.0032038968,0.00032749638],"about_ca_topic_score_codex":0.00017959156,"about_ca_topic_score_gemma":0.000024232835,"teacher_disagreement_score":0.9440327,"about_ca_system_score_codex":0.00021692438,"about_ca_system_score_gemma":0.00007217074,"threshold_uncertainty_score":0.9999622},"labels":[],"label_agreement":null},{"id":"W2399177260","doi":"10.1049/iet-cta.2016.0315","title":"Hierarchical nearly cyclic pursuit for consensus in large‐scale multi‐agent systems","year":2016,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Convergence (economics); Rendezvous; Computer science; Scale (ratio); Control theory (sociology); Rate of convergence; Point (geometry); Mathematical optimization; Control (management); Mathematics; Artificial intelligence; Engineering; Telecommunications; Aerospace engineering","score_opus":0.012503400783945972,"score_gpt":0.25781077596326707,"score_spread":0.2453073751793211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2399177260","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069729923,0.0007461192,0.986108,0.00232313,0.0002618666,0.0026638028,0.0005573041,0.00017734393,0.00018945058],"genre_scores_gemma":[0.9933774,0.000013645667,0.0011497829,0.00026629577,0.00015579796,0.004033649,0.000009972452,0.000017226504,0.0009762501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99773943,0.00042132242,0.00050616043,0.00062161655,0.00018981552,0.0005216584],"domain_scores_gemma":[0.99692243,0.0018660583,0.00016073034,0.00073009526,0.00010985052,0.00021084944],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017336056,0.00021055319,0.00037018105,0.00010772503,0.00022875988,0.00020402603,0.0007202065,0.00012624274,0.000004093558],"category_scores_gemma":[0.00015376127,0.00015693902,0.00010522371,0.00020777271,0.00013571858,0.00015514741,0.000086931825,0.00011442251,0.000065366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012756686,0.00030018305,0.0012247813,0.000034064728,0.00006329525,0.0000039937927,0.00024045352,0.000068447225,0.012036184,0.966658,0.0003115921,0.01893142],"study_design_scores_gemma":[0.06087858,0.00048535757,0.02957681,0.0004485725,0.00021327758,0.00015000676,0.0010105894,0.28488785,0.00069033616,0.12504709,0.49439204,0.002219526],"about_ca_topic_score_codex":0.0000115967805,"about_ca_topic_score_gemma":0.00001829379,"teacher_disagreement_score":0.98640436,"about_ca_system_score_codex":0.00006243249,"about_ca_system_score_gemma":0.00005694733,"threshold_uncertainty_score":0.6399787},"labels":[],"label_agreement":null},{"id":"W2406890045","doi":"10.1109/cdc.2016.7798251","title":"A Smooth Distributed Feedback for Global Rendezvous of Unicycles","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Rendezvous; Digraph; Position (finance); Displacement (psychology); Simple (philosophy); Computer science; Reference frame; Kinematics; Frame (networking); Control (management); Mathematics; Engineering; Physics; Telecommunications; Artificial intelligence","score_opus":0.025535056071662558,"score_gpt":0.27659020443196397,"score_spread":0.2510551483603014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2406890045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087248837,0.00035834548,0.98211634,0.001817356,0.0017027078,0.0014173684,0.0059874565,0.0004782563,0.005249677],"genre_scores_gemma":[0.9770984,0.000018265218,0.021094097,0.00007952452,0.00028282485,0.00030011506,0.00043255405,0.00002819672,0.0006660234],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965283,0.00014287067,0.0009736076,0.0011285802,0.0005662081,0.0006603946],"domain_scores_gemma":[0.9958633,0.00025250032,0.00082859804,0.0022915916,0.0005424521,0.00022153842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004877756,0.0005054011,0.0009151027,0.00008310549,0.00007008982,0.00023471811,0.0035715974,0.0004652975,0.000014439539],"category_scores_gemma":[0.00024617097,0.00039016732,0.000524739,0.00027581552,0.000104336585,0.00020459283,0.0021367576,0.0001769151,0.000033668715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017577033,0.0005793343,0.0027900704,0.0010953969,0.00093351275,0.000027703705,0.00012472627,0.00077893527,0.0008547671,0.8045013,0.051879086,0.13625939],"study_design_scores_gemma":[0.017475983,0.0007695305,0.030573953,0.0033967781,0.00050438044,0.00006798984,0.00015382252,0.20253849,0.0065822797,0.52589,0.20682962,0.0052171643],"about_ca_topic_score_codex":0.00021219876,"about_ca_topic_score_gemma":0.00007427001,"teacher_disagreement_score":0.9762259,"about_ca_system_score_codex":0.0004163276,"about_ca_system_score_gemma":0.0004151204,"threshold_uncertainty_score":0.99985504},"labels":[],"label_agreement":null},{"id":"W2408850569","doi":"10.3934/mbe.2015007","title":"Flocking and invariance of velocity angles","year":2015,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Flocking (texture); Monotonic function; Mathematics; Property (philosophy); Mathematical analysis; Physics","score_opus":0.02688033508144088,"score_gpt":0.21944938690080595,"score_spread":0.19256905181936507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2408850569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095162794,0.00020724861,0.90349334,0.00020609798,0.00020379618,0.00011160355,0.0000025008537,0.00012322926,0.0004893845],"genre_scores_gemma":[0.9163,0.0000016314666,0.083638944,0.0000152478415,0.00002090523,0.0000072532157,2.3254285e-7,0.0000037898926,0.000011980785],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885446,0.000019269713,0.0002666164,0.0002459078,0.00036616978,0.00024755188],"domain_scores_gemma":[0.9992925,0.00013748741,0.0000714479,0.00027039534,0.000060289247,0.00016788139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000685605,0.00011299242,0.00021557634,0.00007900636,0.000034166405,0.00012498957,0.0006137698,0.000040222963,0.0000017519251],"category_scores_gemma":[0.0005450907,0.000093035495,0.000028396242,0.0004344991,0.00007570497,0.0003930009,0.0002143888,0.00006169646,0.000010946352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030924216,0.00012724727,0.0009433042,0.0002871271,0.000028183775,0.00001954325,0.003275709,0.0038559034,0.03721449,0.946566,0.000117638236,0.0075617996],"study_design_scores_gemma":[0.00023202701,0.000044263077,0.0007903892,0.00011800586,0.0000046109326,0.0000235368,0.000088357156,0.98712623,0.005989947,0.0050068246,0.00040592265,0.00016990193],"about_ca_topic_score_codex":0.0000070062715,"about_ca_topic_score_gemma":5.7006685e-7,"teacher_disagreement_score":0.9832703,"about_ca_system_score_codex":0.000026975711,"about_ca_system_score_gemma":0.000038729948,"threshold_uncertainty_score":0.37938774},"labels":[],"label_agreement":null},{"id":"W2413811472","doi":"","title":"Nonlinear model predictive formation control for groups of autonomous surface vessels","year":2007,"lang":"en","type":"article","venue":"International Conference on Control Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Model predictive control; Control theory (sociology); Obstacle avoidance; Nonlinear system; Nonlinear model; Control engineering; Obstacle; Surface (topology); Controller (irrigation); Computer science; Control (management); Engineering; Mobile robot; Law; Mathematics; Robot; Artificial intelligence; Physics","score_opus":0.029928470043326712,"score_gpt":0.2950209628234319,"score_spread":0.26509249278010516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413811472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013911658,0.000025988751,0.987171,0.0024377904,0.0002525299,0.0022784844,0.0013865808,0.00018874263,0.0048677023],"genre_scores_gemma":[0.9814694,0.000005899222,0.016954768,0.0003455757,0.00015046068,0.00075907545,0.0001595125,0.000016124697,0.00013918124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773127,0.000044678985,0.00083062594,0.00049704587,0.0005425173,0.00035388902],"domain_scores_gemma":[0.996624,0.00054709666,0.000603852,0.0005970984,0.0014868714,0.00014110342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080146216,0.00023822964,0.00035410273,0.00018168114,0.00013616736,0.0001394526,0.0014199623,0.00012943563,0.000009837027],"category_scores_gemma":[0.00010043557,0.00024054927,0.00017199706,0.00019919779,0.0000731424,0.00064438925,0.000051698105,0.00015715399,0.00004150611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002688622,0.00038219438,0.00011558737,0.00002041464,0.0001762803,8.4519576e-7,0.0001948239,0.04241931,0.01613907,0.9335447,0.00016895654,0.0065689594],"study_design_scores_gemma":[0.003661363,0.00014523773,0.00035463995,0.000028923543,0.000032504806,0.000004034427,0.00006187735,0.98040783,0.0019061831,0.011792699,0.0014050028,0.00019971695],"about_ca_topic_score_codex":0.000014740721,"about_ca_topic_score_gemma":0.000018312172,"teacher_disagreement_score":0.9800782,"about_ca_system_score_codex":0.00021952007,"about_ca_system_score_gemma":0.00020218472,"threshold_uncertainty_score":0.98093146},"labels":[],"label_agreement":null},{"id":"W2415227709","doi":"10.1016/j.robot.2016.05.014","title":"Asynchronous consensus of continuous-time Lagrangian systems with switching topology and non-uniform time delay","year":2016,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Asynchronous communication; Computer science; Consensus; Double integrator; Linearization; Bounded function; Topology (electrical circuits); Control theory (sociology); Integrator; State space; Nonlinear system; Discrete time and continuous time; Multi-agent system; State (computer science); Controller (irrigation); Transformation (genetics); Algorithm; Mathematics; Control (management); Telecommunications","score_opus":0.005626431880767329,"score_gpt":0.19384327320725403,"score_spread":0.1882168413264867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415227709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10463786,0.0016840068,0.88833565,0.00070074043,0.0008703107,0.001453429,0.00009935806,0.00026795611,0.0019507122],"genre_scores_gemma":[0.99628335,0.000015644933,0.002631504,0.000017709855,0.00010745962,0.000029249983,0.000004951652,0.00003293851,0.0008772027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747646,0.00017565422,0.00081393734,0.0006302349,0.00029225164,0.0006114344],"domain_scores_gemma":[0.99779713,0.00039455795,0.00061680825,0.000704322,0.00022555438,0.000261608],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069818203,0.00037765072,0.000997179,0.00017291262,0.00018551254,0.0002970998,0.0004897066,0.00020404249,0.000002651863],"category_scores_gemma":[0.000031702722,0.0002517937,0.00006560258,0.00016156268,0.000171868,0.0002124764,0.00018094765,0.00011413796,0.000060355702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005543861,0.0014241447,0.04615696,0.0051563857,0.005525276,0.002392536,0.008347638,0.14188309,0.2770176,0.45722094,0.0029308079,0.051390253],"study_design_scores_gemma":[0.0039370423,0.0008973475,0.0010116912,0.0011171828,0.00012125731,0.0018401596,0.00026968552,0.98833704,0.00022161867,0.000068953406,0.001337085,0.00084094197],"about_ca_topic_score_codex":0.0007604747,"about_ca_topic_score_gemma":0.000020281599,"teacher_disagreement_score":0.8916455,"about_ca_system_score_codex":0.00012028802,"about_ca_system_score_gemma":0.00016795818,"threshold_uncertainty_score":0.99999344},"labels":[],"label_agreement":null},{"id":"W2415615063","doi":"10.1109/tac.2017.2650562","title":"Local and Distributed Rendezvous of Underactuated Rigid Bodies","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Underactuation; Rendezvous; Gyroscope; Convergence (economics); Control theory (sociology); Computer science; Rigid body; Control (management); Engineering; Aerospace engineering; Artificial intelligence; Physics; Economics","score_opus":0.0204746722710365,"score_gpt":0.2620073206743429,"score_spread":0.2415326484033064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415615063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030146316,0.0002647211,0.98993963,0.0012886098,0.0017831295,0.001329103,0.0015469822,0.00068839896,0.00014476586],"genre_scores_gemma":[0.9979327,0.000041660613,0.0014172636,0.00006143454,0.000026430169,0.00028719695,0.000048792896,0.00003521512,0.00014934942],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635464,0.00033152767,0.0011173241,0.0009374074,0.0007217738,0.0005373322],"domain_scores_gemma":[0.9952502,0.0006522727,0.0010998299,0.0023655,0.00038065432,0.00025151164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053558603,0.0006433073,0.0013681521,0.00032605845,0.00038391713,0.00052854023,0.0016380232,0.00047573692,0.000041897576],"category_scores_gemma":[0.00008174192,0.0006100419,0.0003567438,0.00013882521,0.0003229632,0.0003267364,0.000030031584,0.00064569816,0.00006925959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040949733,0.0027831763,0.000098905046,0.0033058734,0.0072425096,0.0003552709,0.0030284596,0.33906215,0.0026043635,0.0024523137,0.0028030206,0.6358545],"study_design_scores_gemma":[0.0034173473,0.00014725469,0.00094004103,0.0006463815,0.00034191326,0.000038930575,0.00004728301,0.9914198,0.0010058605,0.0012650202,0.00018788422,0.00054229907],"about_ca_topic_score_codex":0.00044026272,"about_ca_topic_score_gemma":0.00015333507,"teacher_disagreement_score":0.99491805,"about_ca_system_score_codex":0.00025876475,"about_ca_system_score_gemma":0.00042353277,"threshold_uncertainty_score":0.9996351},"labels":[],"label_agreement":null},{"id":"W2441361126","doi":"10.1109/syscon.2016.7490605","title":"Formation reconfiguration of cooperative UAVs via Learning Based Model Predictive Control in an obstacle-loaded environment","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada; Queen's University","funders":"","keywords":"Control reconfiguration; Flocking (texture); Obstacle; Robustness (evolution); Model predictive control; Computer science; Obstacle avoidance; Reinforcement learning; Convergence (economics); Control (management); Control theory (sociology); Control engineering; Engineering; Artificial intelligence; Mobile robot; Robot","score_opus":0.01672130355076133,"score_gpt":0.21721774218890125,"score_spread":0.20049643863813993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2441361126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02095473,0.00000949796,0.97746664,0.00040824173,0.00005201067,0.00066530827,0.000025839392,0.000088222674,0.00032952122],"genre_scores_gemma":[0.9978603,0.000001380751,0.0018050701,0.00008115048,0.00001182023,0.00011170981,0.00002128753,0.000007218561,0.00010005184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827236,0.0003472227,0.00051493297,0.00033350548,0.00030290597,0.00022909806],"domain_scores_gemma":[0.9990376,0.00016277655,0.0002664355,0.00033275178,0.00011910804,0.00008130579],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044159096,0.00015225822,0.00024212123,0.00012686916,0.000057484987,0.00005015066,0.00032178566,0.00008251581,0.000039548726],"category_scores_gemma":[0.00006240212,0.0001111014,0.000044261516,0.00011822034,0.000036659017,0.0018895391,0.000025501613,0.00008393936,0.000027793778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011451358,0.00016067107,0.0008072977,0.000009883144,0.00001888081,0.0000018060541,0.0009858119,0.6921834,0.29338607,0.001994153,0.000025324196,0.010312202],"study_design_scores_gemma":[0.003236554,0.0002819525,0.0014263537,0.000040036954,0.0000057512325,0.0000010340004,0.00009474339,0.9603334,0.034312032,0.00011203114,0.000019599032,0.00013648905],"about_ca_topic_score_codex":0.000028074355,"about_ca_topic_score_gemma":0.000039503084,"teacher_disagreement_score":0.9769056,"about_ca_system_score_codex":0.00024243759,"about_ca_system_score_gemma":0.00006295743,"threshold_uncertainty_score":0.45305836},"labels":[],"label_agreement":null},{"id":"W2444607264","doi":"10.1109/oceansap.2016.7485504","title":"Optimal design of consensus for autonomous underwater vehicles with damping term using a directed spanning tree","year":2016,"lang":"en","type":"article","venue":"OCEANS 2016 - Shanghai","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Spanning tree; Term (time); Control theory (sociology); Heading (navigation); Lyapunov function; Computer science; Underwater; Tree (set theory); Consensus; Minimum spanning tree; Function (biology); Multi-agent system; Topology (electrical circuits); Network topology; Mathematical optimization; Mathematics; Control (management); Engineering; Algorithm; Artificial intelligence; Physics","score_opus":0.0419737512940576,"score_gpt":0.2580276590049715,"score_spread":0.21605390771091387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2444607264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09853426,0.00010387405,0.89957994,0.00040044007,0.00018383533,0.00071031746,0.000074172785,0.0003273329,0.00008580756],"genre_scores_gemma":[0.851773,0.000002452379,0.14750502,0.00004050729,0.000090751324,0.000032961983,0.0000053077442,0.000040551717,0.00050944806],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785703,0.00014526118,0.0004706159,0.0006004801,0.00028604004,0.00064056786],"domain_scores_gemma":[0.99810266,0.0005178067,0.0003571235,0.00064250565,0.00023984756,0.00014008123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004615538,0.0003027862,0.00044656658,0.00018709771,0.00015794918,0.00013036515,0.0007110224,0.0001114679,0.000007819163],"category_scores_gemma":[0.000073045376,0.00019598869,0.00010806996,0.00023586914,0.00013882518,0.000359048,0.0001351672,0.000062557694,0.000013120658],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008752618,0.00043078416,0.005561859,0.0002530694,0.0009403817,0.0001754113,0.0026978801,0.01992088,0.9113792,0.0026853126,0.004019789,0.051060148],"study_design_scores_gemma":[0.007176209,0.00062139495,0.0021149353,0.0015197746,0.00014218372,0.00012711856,0.000117124655,0.9363089,0.04961935,0.00020916434,0.0010854707,0.0009583456],"about_ca_topic_score_codex":0.000043703298,"about_ca_topic_score_gemma":0.000007811093,"teacher_disagreement_score":0.91638803,"about_ca_system_score_codex":0.00017778113,"about_ca_system_score_gemma":0.00027530087,"threshold_uncertainty_score":0.79921865},"labels":[],"label_agreement":null},{"id":"W2467711357","doi":"10.1109/icuas.2016.7502638","title":"Real-time fault-tolerant cooperative control of multiple UAVs-UGVs in the presence of actuator faults","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Actuator; Fault tolerance; Computer science; Scheme (mathematics); Task (project management); Unmanned ground vehicle; Fault (geology); Control theory (sociology); Control (management); Real-time computing; Collision avoidance; Control engineering; Engineering; Artificial intelligence; Collision; Distributed computing; Computer security; Mathematics","score_opus":0.012279164187486572,"score_gpt":0.23765465236122266,"score_spread":0.2253754881737361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467711357","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.445107,0.000051714367,0.5469682,0.002359814,0.00026097323,0.0020156184,0.00026681006,0.00013242952,0.0028373958],"genre_scores_gemma":[0.9979529,0.000010109171,0.0013786902,0.00006679667,0.000027788812,0.00008589981,0.0000026412517,0.000008990483,0.0004662161],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99726015,0.0005397615,0.0007558856,0.00044954434,0.00060236047,0.00039229888],"domain_scores_gemma":[0.9959967,0.002145502,0.0003473458,0.0010648873,0.0003634691,0.0000820805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094322197,0.00022290197,0.0005320691,0.000103651706,0.000047921643,0.000037656275,0.0018478258,0.00009173029,0.00004088573],"category_scores_gemma":[0.00067009573,0.00011190394,0.00011700685,0.00041880863,0.0001532,0.0005266166,0.00013388327,0.00008709583,0.000081603175],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003736794,0.0009334905,0.012011903,0.00006806027,0.00021058616,0.000048895014,0.0059883264,0.0008648978,0.92821,0.036152232,0.0022649842,0.012872927],"study_design_scores_gemma":[0.02394987,0.0009096843,0.042523116,0.0007012565,0.000046884896,0.00003057106,0.001089678,0.81491977,0.112733126,0.00036882426,0.0018060283,0.00092120987],"about_ca_topic_score_codex":0.00065329083,"about_ca_topic_score_gemma":0.000110668014,"teacher_disagreement_score":0.8154769,"about_ca_system_score_codex":0.000048986432,"about_ca_system_score_gemma":0.00012943294,"threshold_uncertainty_score":0.456331},"labels":[],"label_agreement":null},{"id":"W2469098935","doi":"10.1016/j.ifacol.2015.09.677","title":"Distributed H ∞ Optimal Formation Recovery Control of Heterogeneous Euler-Lagrange Systems Subject to Network Switching and Diagnostic Imperfections ★ ★This publication was made possible by NPRP Grant No. 5-045-2-017 from the Qatar National Research Fund (a member of Qatar Foundation). The statements made herein are solely the responsibility of the authors.","year":2015,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Subject (documents); Euler's formula; Control (management); Computer science; Control theory (sociology); Applied mathematics; Mathematics; Mathematical economics; Mathematical analysis; Artificial intelligence; Library science","score_opus":0.07536028053816622,"score_gpt":0.33112713800835575,"score_spread":0.2557668574701895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469098935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7660228,0.0018482656,0.20200492,0.014617482,0.0014815412,0.005094499,0.008763574,0.000084798914,0.00008208567],"genre_scores_gemma":[0.99693406,0.000035487046,0.0016944741,0.00016838971,0.00020359001,0.00028836384,0.00055729965,0.000020505517,0.00009782164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993162,0.0026311786,0.0011986212,0.00054765015,0.0019412056,0.00051937887],"domain_scores_gemma":[0.9898664,0.0049919323,0.0010450751,0.001266509,0.002672157,0.00015796618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008077793,0.0002873701,0.00045760378,0.00009757757,0.0007868388,0.00043028593,0.0015739184,0.00012889522,0.000016530732],"category_scores_gemma":[0.006361684,0.00015829568,0.0001620382,0.0010821145,0.00023988618,0.00093287736,0.00038930122,0.00043745368,0.000019751904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008536052,0.0038648595,0.091175176,0.0014404057,0.0055086133,0.000020171816,0.03466475,0.5992683,0.18401954,0.006837757,0.04891198,0.015752364],"study_design_scores_gemma":[0.0047826353,0.0006669734,0.05131377,0.00076026726,0.0002398087,0.000043901106,0.002158525,0.9299188,0.0023370765,0.0005865205,0.0066267457,0.00056493114],"about_ca_topic_score_codex":0.0041954895,"about_ca_topic_score_gemma":0.0008487333,"teacher_disagreement_score":0.3306505,"about_ca_system_score_codex":0.00044639863,"about_ca_system_score_gemma":0.00039966646,"threshold_uncertainty_score":0.76159894},"labels":[],"label_agreement":null},{"id":"W2483203095","doi":"10.1007/978-1-4614-5073-3","title":"Team Cooperation in a Network of Multi-Vehicle Unmanned Systems","year":2012,"lang":"en","type":"book","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Computer science; Aeronautics; Engineering","score_opus":0.0222907172467304,"score_gpt":0.2338165987950491,"score_spread":0.2115258815483187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2483203095","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010338034,0.0036688705,0.68248653,0.000069780705,0.0044478388,0.0029695337,0.00004795957,0.0003896664,0.30581647],"genre_scores_gemma":[0.16215724,0.000012706802,0.0023901535,0.00006327415,0.000565546,0.00014796568,0.000135324,0.000045448585,0.8344824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997125,0.00022686116,0.0010396119,0.00055593555,0.00047113106,0.0005814407],"domain_scores_gemma":[0.997819,0.0001384387,0.0005507671,0.0010582994,0.00028809,0.00014537659],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093582494,0.00038008392,0.00082993094,0.00014401777,0.000053233045,0.00016522281,0.0012085211,0.00046447013,0.000028152339],"category_scores_gemma":[0.000033626475,0.00034963002,0.00013311922,0.00028731005,0.00003814041,0.00048877514,0.00025811754,0.00034634033,0.0002535235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056715322,0.00089392735,0.0052011753,0.0010029447,0.00048506793,0.00004891692,0.0020674316,0.06959726,0.00047396118,0.56220794,0.35239163,0.0055730348],"study_design_scores_gemma":[0.0028238096,0.00012165587,0.0009846376,0.0011311233,0.000043943444,0.000016038726,0.000022843375,0.77819586,0.00003400764,0.00013191119,0.21559477,0.0008994054],"about_ca_topic_score_codex":0.002352768,"about_ca_topic_score_gemma":0.0035351904,"teacher_disagreement_score":0.7085986,"about_ca_system_score_codex":0.0007387687,"about_ca_system_score_gemma":0.0006843518,"threshold_uncertainty_score":0.9998956},"labels":[],"label_agreement":null},{"id":"W2489104943","doi":"10.1109/acc.2016.7526055","title":"Leader-following consensus control of multi-agent systems with communication delays &amp; random packet loss","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Bernoulli distribution; Multi-agent system; Packet loss; Algebraic graph theory; Computer science; Network packet; Consensus; Bernoulli's principle; Lyapunov stability; Controller (irrigation); Lyapunov function; Integrator; Double integrator; Mathematics; Control (management); Random variable; Bandwidth (computing); Computer network; Engineering","score_opus":0.030608796711947033,"score_gpt":0.25220072212733013,"score_spread":0.2215919254153831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2489104943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033360515,0.00093178503,0.96155,0.0016310153,0.00043198463,0.0012093812,0.00007141415,0.00030281692,0.00051107444],"genre_scores_gemma":[0.9902987,0.000015905314,0.00809519,0.00008831413,0.00002872246,0.00012730973,0.000009635607,0.00002449205,0.0013117472],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967341,0.00072685804,0.00087093137,0.00052834646,0.0006193794,0.0005203882],"domain_scores_gemma":[0.9957205,0.0011839907,0.0005347917,0.0019814614,0.00037974832,0.00019951198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869309,0.00032138772,0.0007361593,0.00013486846,0.0001572652,0.00015656989,0.001395716,0.0001294344,0.000011925902],"category_scores_gemma":[0.00020932162,0.00019423067,0.00020696929,0.0003011506,0.0001770865,0.0003445463,0.00014584255,0.00011768587,0.00017146052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005210199,0.0055286745,0.2658087,0.001625611,0.012773715,0.00081238395,0.010868176,0.026399309,0.35187086,0.24583434,0.024211386,0.049056645],"study_design_scores_gemma":[0.2493638,0.00089987414,0.009760913,0.004259383,0.0006905174,0.0006977516,0.002024972,0.6727373,0.008392147,0.00028063217,0.046916477,0.003976228],"about_ca_topic_score_codex":0.00046070863,"about_ca_topic_score_gemma":0.00017005617,"teacher_disagreement_score":0.95693815,"about_ca_system_score_codex":0.00014201924,"about_ca_system_score_gemma":0.00012487294,"threshold_uncertainty_score":0.79204965},"labels":[],"label_agreement":null},{"id":"W2503026941","doi":"10.1007/978-3-540-31595-7_7","title":"Cooperative Control of Large Systems","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control (management); Computer science; Control engineering; Engineering; Artificial intelligence","score_opus":0.010894515300604696,"score_gpt":0.23526011956567747,"score_spread":0.22436560426507277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2503026941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000242489,0.0024887584,0.95948803,0.00092687964,0.00070407067,0.001097107,0.00033313828,0.000070699934,0.034867067],"genre_scores_gemma":[0.99822867,0.00008108205,0.0002891691,0.001066614,0.000076003846,0.000040110528,0.000021179223,0.000006920498,0.00019023895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719995,0.00007755825,0.0011254852,0.00038370167,0.0007995502,0.00041376674],"domain_scores_gemma":[0.9975749,0.0005901967,0.0009104579,0.0003849257,0.00043465945,0.00010484957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012957177,0.00039213535,0.0008400724,0.00054178794,0.00020370676,0.000537725,0.00092978496,0.00035268997,0.000020348514],"category_scores_gemma":[0.00034328966,0.00029904765,0.00011291792,0.0002497107,0.0002983524,0.0027380092,0.00008942734,0.00033416846,0.000036594087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031304673,0.000016996775,0.00013981976,0.00013373386,0.00007335698,0.0000042874676,0.00088307617,0.03787059,0.000047947684,0.95020926,0.00003097684,0.010558664],"study_design_scores_gemma":[0.013047502,0.00077865965,0.00042816813,0.0012945624,0.0000791476,0.0000557241,0.000064378386,0.9087273,0.0000976485,0.022058256,0.052151375,0.0012173165],"about_ca_topic_score_codex":0.00012199371,"about_ca_topic_score_gemma":0.000042158572,"teacher_disagreement_score":0.9982044,"about_ca_system_score_codex":0.000114322815,"about_ca_system_score_gemma":0.00042420754,"threshold_uncertainty_score":0.9999462},"labels":[],"label_agreement":null},{"id":"W2505116898","doi":"10.1109/acc.2016.7524912","title":"On almost equitable partitions and network controllability","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Controllability; Homogeneous space; Partition (number theory); Digraph; Extension (predicate logic); Network controllability; Symmetry (geometry); Computer science; Graph; Control (management); Complex network; Mathematics; Topology (electrical circuits); Distributed computing; Theoretical computer science; Discrete mathematics; Applied mathematics; Combinatorics; Artificial intelligence","score_opus":0.013774385020155325,"score_gpt":0.23291182695883933,"score_spread":0.219137441938684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2505116898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009757798,0.000113598726,0.96160245,0.006963181,0.0004943197,0.0003699635,0.000024085803,0.00030925774,0.020365322],"genre_scores_gemma":[0.9964067,0.0000042905313,0.0012376319,0.0005207411,0.0000847072,0.00005039781,0.0000012134968,0.0000045987304,0.0016897277],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986612,0.00010416148,0.00022010121,0.0003771839,0.00018252424,0.00045481016],"domain_scores_gemma":[0.9985622,0.0005464486,0.000057521702,0.00061551074,0.00007232635,0.00014596841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005245987,0.000115456874,0.00018772898,0.000022011362,0.00015667021,0.00013607377,0.0003504281,0.000045403656,0.00009517187],"category_scores_gemma":[0.00015988229,0.00006983663,0.000041134146,0.00015909292,0.00005098815,0.00035087817,0.00016044085,0.000038597846,0.00030113084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021080117,0.0000891562,0.0043244725,0.000005416238,0.00003787681,0.0000062837044,0.00002565426,0.00018571403,0.0011531693,0.94118667,0.03634635,0.016618168],"study_design_scores_gemma":[0.023737818,0.0016417959,0.08355685,0.0005251081,0.00008589194,0.000074120995,0.00007654036,0.13842513,0.002483119,0.5254218,0.22156486,0.0024070044],"about_ca_topic_score_codex":0.000028275515,"about_ca_topic_score_gemma":0.000033147073,"teacher_disagreement_score":0.9866489,"about_ca_system_score_codex":0.00004927721,"about_ca_system_score_gemma":0.00003148431,"threshold_uncertainty_score":0.38705283},"labels":[],"label_agreement":null},{"id":"W2507244647","doi":"10.1002/rnc.3626","title":"Adaptive stationary consensus protocol for a class of high‐order nonlinear multiagent systems with jointly connected topologies","year":2016,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network topology; Nonlinear system; Consensus; Affine transformation; Multi-agent system; Protocol (science); Computer science; Convergence (economics); Topology (electrical circuits); Class (philosophy); Control theory (sociology); Position (finance); Mathematical optimization; Mathematics; Computer network; Artificial intelligence; Control (management)","score_opus":0.029131372795882,"score_gpt":0.2802221000813781,"score_spread":0.2510907272854961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2507244647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008760784,0.00006261584,0.96944255,0.004195525,0.0006901995,0.016177457,0.00060307013,0.000037832233,0.000029979508],"genre_scores_gemma":[0.8778999,0.000006857491,0.11597752,0.00013644919,0.000613467,0.0051868954,0.000010219346,0.00002496816,0.00014371802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997761,0.00016831305,0.00092839345,0.0002648131,0.0006432179,0.00023424164],"domain_scores_gemma":[0.9933736,0.0011216333,0.0012622993,0.00019930798,0.003924384,0.00011877419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005389637,0.00021883969,0.0005131962,0.00023602587,0.000054721066,0.0001040307,0.0006408849,0.00009018964,0.000008398964],"category_scores_gemma":[0.00047613904,0.00013058339,0.00011707956,0.0001138501,0.00015344501,0.0003370264,0.00006543709,0.00011726873,0.0000022886536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.11615817,0.0092109395,0.027590882,0.0013643659,0.030251708,0.0033389858,0.0031236347,0.3328557,0.086123995,0.17755583,0.016202865,0.19622293],"study_design_scores_gemma":[0.050415482,0.0033854076,0.0023457871,0.0010490469,0.00010676779,0.0006240844,0.0004333132,0.92842716,0.0017420804,0.00031434695,0.010696308,0.0004602389],"about_ca_topic_score_codex":0.00005942351,"about_ca_topic_score_gemma":0.000019574058,"teacher_disagreement_score":0.86913913,"about_ca_system_score_codex":0.000102184335,"about_ca_system_score_gemma":0.00037267714,"threshold_uncertainty_score":0.5325036},"labels":[],"label_agreement":null},{"id":"W2508587411","doi":"10.1007/978-3-319-44427-7_1","title":"A Bearing-Only Pattern Formation Algorithm for Swarm Robotics","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Robustness (evolution); Swarm behaviour; Computer science; Scalability; Swarm robotics; Robot; Algorithm; Swarm intelligence; Artificial intelligence; Flexibility (engineering); Robotics; Particle swarm optimization; Mathematics","score_opus":0.01863424604416141,"score_gpt":0.24186491322621206,"score_spread":0.22323066718205065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2508587411","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031550674,0.00018828739,0.99286914,0.0013309377,0.0032644286,0.0011865975,0.00007899691,0.00026940077,0.00080903986],"genre_scores_gemma":[0.051186863,0.000032416083,0.9435973,0.0017965864,0.001871812,0.000094216906,0.0000504893,0.00010189692,0.0012684212],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99552876,0.000037356447,0.000832141,0.0015112596,0.0011116163,0.0009788744],"domain_scores_gemma":[0.9964978,0.00059641903,0.00058396533,0.0015762052,0.0005135984,0.00023200846],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010124313,0.00064385316,0.00067821535,0.00070386543,0.00029697726,0.0008689217,0.00388981,0.0004049352,0.0000049413493],"category_scores_gemma":[0.00008817688,0.0005382685,0.00024646416,0.0003416972,0.0002970251,0.0012249077,0.0010302324,0.0004482428,0.00009982057],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020045766,0.00001962261,0.000012495275,0.000046792273,0.000016046299,0.000022868098,0.00018995765,0.006998192,0.00004065591,0.007669649,0.00004885872,0.98493284],"study_design_scores_gemma":[0.0008425541,0.00017955124,0.000027252067,0.0005784426,0.000014243059,0.00010446068,1.1470002e-7,0.9547686,0.00048227565,0.03807054,0.004206683,0.0007252631],"about_ca_topic_score_codex":0.000014099331,"about_ca_topic_score_gemma":0.000040788465,"teacher_disagreement_score":0.9842076,"about_ca_system_score_codex":0.0006279387,"about_ca_system_score_gemma":0.0005124166,"threshold_uncertainty_score":0.99970686},"labels":[],"label_agreement":null},{"id":"W2509845252","doi":"10.1002/rnc.3509","title":"Decentralized H∞ consensus protocol for a class of high-order multiagent systems","year":2016,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Protocol (science); Multi-agent system; Computer science; Consensus; Network topology; Class (philosophy); Order (exchange); Distributed computing; Decentralised system; Dependency (UML); Control (management); Computer network; Artificial intelligence","score_opus":0.025986459543266123,"score_gpt":0.2938776007180955,"score_spread":0.2678911411748294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2509845252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049172244,0.00008813427,0.9719588,0.004160582,0.0014132769,0.017209256,0.00020955638,0.00002206539,0.000021116695],"genre_scores_gemma":[0.9564082,0.000012762504,0.03674548,0.00014553952,0.00071536226,0.0057920855,0.000003224952,0.000021115295,0.00015625071],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790496,0.0001322748,0.00096644775,0.00020131128,0.000569492,0.00022552507],"domain_scores_gemma":[0.9957946,0.0006007523,0.0010563497,0.00019089929,0.0022153324,0.00014206342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006766636,0.00016678176,0.00044830368,0.0001779593,0.00003478271,0.00011878604,0.0007572309,0.00008049364,0.000009444604],"category_scores_gemma":[0.00045453958,0.00010491329,0.00016683119,0.00007696728,0.00006473027,0.0002385101,0.000057393565,0.000078632555,0.000003055815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03248507,0.0066791284,0.029497994,0.0012359176,0.01730001,0.0014172872,0.0013654365,0.07840097,0.26282182,0.18418011,0.0316927,0.35292354],"study_design_scores_gemma":[0.09850492,0.00096891745,0.002176245,0.0012585017,0.00012012518,0.00059786026,0.00006885149,0.76951927,0.0034763943,0.00038699206,0.12242711,0.0004948065],"about_ca_topic_score_codex":0.00003521751,"about_ca_topic_score_gemma":0.0000065460476,"teacher_disagreement_score":0.95149094,"about_ca_system_score_codex":0.00008459099,"about_ca_system_score_gemma":0.00020115977,"threshold_uncertainty_score":0.427824},"labels":[],"label_agreement":null},{"id":"W2510909510","doi":"","title":"Distributed consensus in noisy wireless sensor networks","year":2016,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Wireless sensor network; Computer science; Noise (video); Noise measurement; Quantization (signal processing); Algorithm; Wireless; Probability density function; Wireless network; Key distribution in wireless sensor networks; Network topology; Mean squared error; Imperfect; Topology (electrical circuits); Mathematics; Computer network; Telecommunications; Artificial intelligence; Statistics; Noise reduction","score_opus":0.02118830602183096,"score_gpt":0.2528816401560713,"score_spread":0.23169333413424031,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2510909510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047976375,0.000003988263,0.92753506,0.009832759,0.0018387253,0.00038034614,0.00020977744,0.00023300611,0.011989941],"genre_scores_gemma":[0.99871856,0.000022667595,0.00043464408,0.0003867512,0.00006218291,0.000042808846,0.00015255816,0.000004574175,0.00017527828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981199,0.00008888729,0.0006717808,0.00023993505,0.000591901,0.00028760312],"domain_scores_gemma":[0.9984794,0.00017498709,0.00034341472,0.0003796325,0.0005199345,0.00010259691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003446333,0.00018964107,0.00018309422,0.0002968571,0.00006997404,0.0002947914,0.00088005257,0.00012331286,0.000136804],"category_scores_gemma":[0.00017488259,0.00014107916,0.00006099413,0.0002625201,0.00004454541,0.0011508118,0.0001825485,0.00014150747,0.0005912794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024046321,0.00015000824,0.0044430173,0.000013649696,0.000046848538,0.000033425356,0.00043578082,0.003417123,0.0040599303,0.7917351,0.004289425,0.1911352],"study_design_scores_gemma":[0.0030582224,0.00008089844,0.014599767,0.00035408547,0.0000025886316,0.000025515581,0.00012399658,0.96551365,0.00064054807,0.0008775597,0.014355708,0.0003674911],"about_ca_topic_score_codex":0.00006372181,"about_ca_topic_score_gemma":0.000022094695,"teacher_disagreement_score":0.9620965,"about_ca_system_score_codex":0.00026976355,"about_ca_system_score_gemma":0.00009653296,"threshold_uncertainty_score":0.75998974},"labels":[],"label_agreement":null},{"id":"W2512020690","doi":"10.1109/icoacs.2016.7563119","title":"Application research of flocking control algorithm in target tracking of hybrid mobile sensor","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Flocking (texture); Obstacle; Obstacle avoidance; Computer science; Wireless sensor network; Mobile robot; Tracking (education); Network topology; Collision avoidance; Collision; Control theory (sociology); Real-time computing; Algorithm; Artificial intelligence; Control (management); Computer network; Robot","score_opus":0.02918658895849666,"score_gpt":0.3118940850567161,"score_spread":0.28270749609821944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512020690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035255343,0.00006626328,0.9630819,0.00021009966,0.00009090597,0.0007488189,0.00004007316,0.00004845364,0.00045813798],"genre_scores_gemma":[0.9871224,0.0000031919435,0.01257815,0.000009945419,0.000047864414,0.00014067277,0.0000021475944,0.00000837829,0.00008724792],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977766,0.00028723982,0.00058075995,0.00038037106,0.0005749839,0.0004000315],"domain_scores_gemma":[0.9980342,0.0006107166,0.00019310042,0.0006568609,0.00043787845,0.00006726143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020606641,0.00010467753,0.0003140714,0.00026943805,0.000038767044,0.000025659447,0.0007725338,0.000041995605,0.000011394873],"category_scores_gemma":[0.00014615008,0.00007623709,0.00006560598,0.00046875502,0.00007812641,0.0003368215,0.00010646708,0.000093288814,0.000027182523],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029935452,0.0003504537,0.016949268,0.00007371566,0.000051007755,0.000017154856,0.00043908186,0.00126469,0.45065114,0.0097602215,0.00016812178,0.5202452],"study_design_scores_gemma":[0.0033905793,0.0001525621,0.0059347153,0.00017039056,0.0000041514522,0.000011684734,0.0001548297,0.6955848,0.29181626,0.0011598615,0.001409539,0.00021065067],"about_ca_topic_score_codex":0.00048504528,"about_ca_topic_score_gemma":0.000016097609,"teacher_disagreement_score":0.95186704,"about_ca_system_score_codex":0.0001467272,"about_ca_system_score_gemma":0.00011265075,"threshold_uncertainty_score":0.31088585},"labels":[],"label_agreement":null},{"id":"W2515173871","doi":"10.1109/ivs.2016.7535522","title":"Cooperative road condition estimation for an adaptive model predictive collision avoidance control strategy","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Collision avoidance; Model predictive control; Control theory (sociology); Collision; Controller (irrigation); Computer science; Estimation theory; Adaptive control; Scheme (mathematics); Vehicle dynamics; Estimation; Control (management); Mathematical optimization; Engineering; Mathematics; Artificial intelligence; Algorithm","score_opus":0.029968591387406235,"score_gpt":0.282283661415145,"score_spread":0.2523150700277388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515173871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005213859,0.000023423938,0.98991024,0.00039521905,0.00020068472,0.0020604485,0.0008110091,0.00034048854,0.0010446191],"genre_scores_gemma":[0.98100334,0.0000023063285,0.017432773,0.00015314204,0.00006257272,0.0006749864,0.00005756242,0.000015327605,0.0005980137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979494,0.00020708542,0.00042622496,0.0006813563,0.000357796,0.00037812148],"domain_scores_gemma":[0.99797523,0.00029817788,0.00025072016,0.0004944195,0.0008041901,0.00017724416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045321803,0.00025363406,0.00031907766,0.00008805573,0.00023559798,0.00020147482,0.0005578744,0.0001285535,0.0000074402346],"category_scores_gemma":[0.00015391386,0.00017389531,0.00007864729,0.00017655331,0.00007418866,0.0029392054,0.000041061223,0.000068663845,0.00005097963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005798706,0.00025566004,0.000018801298,0.00001100979,0.00011340717,0.0000033874608,0.0003877425,0.6259794,0.02001454,0.31620598,0.0022477852,0.03418242],"study_design_scores_gemma":[0.004449069,0.0013108775,0.00034188965,0.0000602971,0.000019608306,0.000004253478,0.0000849808,0.9840402,0.0035979936,0.0058125877,0.000024573419,0.00025366488],"about_ca_topic_score_codex":0.00004054695,"about_ca_topic_score_gemma":0.00004202404,"teacher_disagreement_score":0.9757894,"about_ca_system_score_codex":0.00024673538,"about_ca_system_score_gemma":0.00023096075,"threshold_uncertainty_score":0.7091245},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02008389679764252,"score_gpt":0.2691156533546784,"score_spread":0.24903175655703588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2519129141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03057719,0.000029284003,0.9634503,0.002182632,0.00039233567,0.0011515438,0.00020801087,0.0006128375,0.001395834],"genre_scores_gemma":[0.97526824,6.490999e-7,0.024100194,0.00008782634,0.00006915559,0.00020886792,0.000052382322,0.000021829372,0.00019086344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99795854,0.000052341347,0.00041358487,0.0005518597,0.00041446285,0.0006092201],"domain_scores_gemma":[0.99687713,0.0004257465,0.00066254695,0.0015653039,0.00028105045,0.00018819502],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00042935996,0.00028635838,0.00047190685,0.000057940768,0.00048179546,0.0011469317,0.0018882594,0.00009333388,0.000016834327],"category_scores_gemma":[0.00061138486,0.00023438646,0.000115450304,0.00011834045,0.0003928491,0.0008958738,0.00028994735,0.0001110827,0.00006579498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00049267616,0.001715022,0.017485494,0.0019182543,0.004616738,0.0010070464,0.0091967005,0.0012569077,0.05224938,0.7050779,0.019985659,0.18499823],"study_design_scores_gemma":[0.0030134122,0.00017616255,0.013957447,0.00033877813,0.00005007966,0.00004617372,0.00009584277,0.9774033,0.0009952702,0.0025251145,0.00097235787,0.00042608383],"about_ca_topic_score_codex":0.00002889129,"about_ca_topic_score_gemma":0.0000130803965,"teacher_disagreement_score":0.97614634,"about_ca_system_score_codex":0.00009198466,"about_ca_system_score_gemma":0.00016675991,"threshold_uncertainty_score":0.99988997},"labels":[],"label_agreement":null},{"id":"W2520933317","doi":"10.1002/047134608x.w8317","title":"An Overview of Cooperative and Consensus Control of Multiagent Systems","year":2016,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Electrical and Electronics Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Multi-agent system; Distributed computing; Control (management); Actuator; Focus (optics); Consensus; Computer security; Artificial intelligence","score_opus":0.009509475592613134,"score_gpt":0.23665596473446598,"score_spread":0.22714648914185284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520933317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026127142,0.32043245,0.66615087,0.000067124405,0.00043552302,0.0014255441,0.00019379127,0.00024849732,0.008433461],"genre_scores_gemma":[0.9692228,0.027060915,0.001344105,0.000009888432,0.00012140513,0.00004754422,0.000006090637,0.00012012084,0.0020671424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826777,0.00009508262,0.00056377077,0.00038294308,0.00026681728,0.00042362645],"domain_scores_gemma":[0.998758,0.00023999753,0.00035731762,0.00037184663,0.000113672075,0.00015915427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024780573,0.00029749348,0.0008227705,0.00025477688,0.000017293363,0.000018872233,0.0003551298,0.0001834093,0.000007691787],"category_scores_gemma":[0.000089943365,0.00024300182,0.00006704108,0.00027852354,0.000058760215,0.000073035684,0.00004398649,0.00016046394,0.0000010588913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001723021,0.00078029477,0.0017649104,0.0035514992,0.0021153348,0.000044487053,0.00049638754,0.0044696266,0.087618485,0.8165118,0.00638799,0.076086864],"study_design_scores_gemma":[0.006657074,0.0023091154,0.0005818397,0.0022980382,0.00029609958,0.00010759702,0.000014412001,0.8592671,0.0027450074,0.00015092047,0.124127716,0.0014450677],"about_ca_topic_score_codex":0.00009785054,"about_ca_topic_score_gemma":0.0000057234056,"teacher_disagreement_score":0.9666101,"about_ca_system_score_codex":0.00004276415,"about_ca_system_score_gemma":0.0001265186,"threshold_uncertainty_score":0.99093264},"labels":[],"label_agreement":null},{"id":"W2525902327","doi":"10.3934/dcdsb.2016062","title":"A new discrete Cucker-Smale flocking model under hierarchical leadership","year":2016,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems - B","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Flocking (texture); Nonlinear system; Hierarchical database model; Computer science; Mathematics; Statistical physics; Physics; Data mining","score_opus":0.025639634537567305,"score_gpt":0.23764669266723712,"score_spread":0.2120070581296698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525902327","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03139592,0.00081555534,0.9602285,0.0043942486,0.00063258765,0.00070136663,0.00008011341,0.0004783813,0.0012733064],"genre_scores_gemma":[0.9900183,0.000012377374,0.0017611186,0.00022797778,0.00033214135,0.000084205996,0.000016561124,0.00005205288,0.007495257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99557257,0.00034600616,0.00087093585,0.0012374221,0.00076149916,0.0012115433],"domain_scores_gemma":[0.99736,0.00039688832,0.00027636014,0.001083284,0.00010384939,0.0007796156],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005182535,0.0005509235,0.00085420936,0.0001495779,0.0002532123,0.0007307732,0.0013082984,0.00032315703,0.00000934858],"category_scores_gemma":[0.00012742644,0.00037311483,0.00026600756,0.0003009413,0.00017292285,0.0008196284,0.0004594573,0.0003223374,0.00006221548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017808603,0.000118285,0.008290485,0.00024514928,0.0004791541,0.0001563981,0.0011027425,0.001793491,0.0156187555,0.91867703,0.0026637774,0.050676618],"study_design_scores_gemma":[0.0030205317,0.00016593841,0.0025722338,0.00064349244,0.00006310209,0.00012779921,0.00033188914,0.9857164,0.000046624704,0.004732562,0.0015976082,0.0009817966],"about_ca_topic_score_codex":0.00057159376,"about_ca_topic_score_gemma":0.00007120964,"teacher_disagreement_score":0.98392296,"about_ca_system_score_codex":0.00017156446,"about_ca_system_score_gemma":0.00013967708,"threshold_uncertainty_score":0.9998721},"labels":[],"label_agreement":null},{"id":"W2528263515","doi":"10.1109/mesa.2016.7587184","title":"Cooperative control of multiple UAVs for forest fire monitoring and detection","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control reconfiguration; Trajectory; Frame (networking); Computer science; Cartesian coordinate system; Fire control; Fire detection; Controller (irrigation); Mode (computer interface); Tracking (education); Real-time computing; Reference frame; Search and rescue; Control theory (sociology); Mobile robot; Robot; Simulation; Control (management); Engineering; Artificial intelligence; Telecommunications","score_opus":0.01563105978540066,"score_gpt":0.23397892772840714,"score_spread":0.21834786794300648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2528263515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118309334,0.000068284164,0.8804734,0.00020853586,0.0003209315,0.0004795966,0.00002443792,0.00007134502,0.0000441523],"genre_scores_gemma":[0.9975121,0.0000040989744,0.0020850196,0.000008138192,0.00007361198,0.000112976326,4.2760936e-7,0.0000056930976,0.00019790677],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992338,0.000036555655,0.00020889525,0.00023586485,0.00010939337,0.00017553067],"domain_scores_gemma":[0.99895877,0.00047324557,0.00009231761,0.0002230501,0.00019284472,0.00005977103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017259897,0.000096208605,0.00017347024,0.00003242438,0.0000730079,0.000046209396,0.00020572344,0.00004653787,0.0000011957486],"category_scores_gemma":[0.0002209148,0.000061629966,0.000042584015,0.00007554559,0.000029255907,0.00037155044,0.000039945277,0.000022066903,0.0000043516848],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015313624,0.00009672445,0.09735813,0.00006174468,0.00015243988,0.0000024226315,0.00031646388,0.00021653187,0.58026016,0.010653388,0.00010223232,0.31062666],"study_design_scores_gemma":[0.012647674,0.0005945095,0.050173968,0.00015419725,0.000025585987,0.000009691222,0.00013552903,0.6831875,0.25055853,0.0003806668,0.0017600743,0.00037211124],"about_ca_topic_score_codex":0.00006950991,"about_ca_topic_score_gemma":0.000051286996,"teacher_disagreement_score":0.8792028,"about_ca_system_score_codex":0.00003274394,"about_ca_system_score_gemma":0.000017274382,"threshold_uncertainty_score":0.2513197},"labels":[],"label_agreement":null},{"id":"W2529846679","doi":"10.1109/cdc.2016.7798993","title":"Cooperative output regulation of linear multi-agent systems with communication constraints","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Asynchronous communication; Computer science; Interconnection; Information exchange; Process (computing); Discrete time and continuous time; Distributed computing; Multi-agent system; Topology (electrical circuits); Control (management); Mathematical optimization; Control theory (sociology); Mathematics; Computer network; Telecommunications","score_opus":0.04114837787964403,"score_gpt":0.27168072820774974,"score_spread":0.2305323503281057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2529846679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015858834,0.0003863291,0.99068433,0.0004812707,0.00071807794,0.0020823819,0.00022605865,0.000312397,0.0035232732],"genre_scores_gemma":[0.9673936,0.000027501352,0.030031964,0.000028562732,0.000064402855,0.00022245452,0.0001687841,0.000027632612,0.0020350947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964296,0.0006851458,0.0010443064,0.0008195917,0.00067836593,0.00034293917],"domain_scores_gemma":[0.9942185,0.00024455876,0.0012025549,0.002801849,0.0013799596,0.00015254505],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085619354,0.00045751582,0.0008047298,0.00020033935,0.00013856491,0.00024358594,0.0020800366,0.00035674946,0.000018763918],"category_scores_gemma":[0.000098867,0.00031667764,0.0001334183,0.00021041906,0.00031858947,0.0003655213,0.0011014559,0.00035179275,0.00008551166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034870568,0.0025682007,0.007778828,0.003006484,0.0045644296,0.00006045845,0.010871788,0.23998356,0.013980322,0.66965884,0.008197746,0.038980663],"study_design_scores_gemma":[0.003483179,0.00015150494,0.004067489,0.0026828668,0.00007932781,0.000029964667,0.00030696075,0.9845817,0.0023431603,0.00019183975,0.0012197277,0.00086224655],"about_ca_topic_score_codex":0.0002926563,"about_ca_topic_score_gemma":0.000037569866,"teacher_disagreement_score":0.96580774,"about_ca_system_score_codex":0.00026850557,"about_ca_system_score_gemma":0.0004390794,"threshold_uncertainty_score":0.99992853},"labels":[],"label_agreement":null},{"id":"W2533005128","doi":"10.1016/j.jfranklin.2016.10.014","title":"Discrete-time consensus strategy for a class of high-order linear multiagent systems under stochastic communication topologies","year":2016,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network topology; Consensus; Multi-agent system; Computer science; Protocol (science); Discrete time and continuous time; Class (philosophy); Mathematical optimization; Set (abstract data type); Topology (electrical circuits); Order (exchange); Distributed computing; Mathematics; Computer network; Artificial intelligence","score_opus":0.03410171097240233,"score_gpt":0.2815524195197168,"score_spread":0.2474507085473145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2533005128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035583872,0.000814563,0.95537335,0.004596497,0.0026399458,0.00080357754,0.00009583696,0.00003600637,0.00005636819],"genre_scores_gemma":[0.99186647,0.000023134178,0.0074885683,0.00005001841,0.00016007067,0.000030221565,0.0000021110354,0.000012099091,0.00036729188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977618,0.00029971506,0.0010243033,0.00019048683,0.00045257976,0.000271122],"domain_scores_gemma":[0.99604,0.0007294272,0.0013646854,0.0009732405,0.00080273516,0.00008994289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009630828,0.00019733227,0.0005164409,0.00011256029,0.00017196247,0.0000861033,0.0019854403,0.0001272605,0.000004577844],"category_scores_gemma":[0.0006163542,0.00010519841,0.0002440426,0.00022508671,0.000320678,0.00038662448,0.00024490646,0.00018201579,0.000012641883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027439362,0.00030964214,0.00010727119,0.00013445453,0.000752197,0.000009788638,0.00028924318,0.8347653,0.017084595,0.13802071,0.0035463287,0.004706047],"study_design_scores_gemma":[0.02671608,0.0016894442,0.007186292,0.0046183174,0.00077914423,0.0006872227,0.00094244146,0.911112,0.0076589566,0.01984358,0.0172888,0.001477726],"about_ca_topic_score_codex":0.00013684024,"about_ca_topic_score_gemma":0.00002242101,"teacher_disagreement_score":0.9562826,"about_ca_system_score_codex":0.00014820983,"about_ca_system_score_gemma":0.00031256716,"threshold_uncertainty_score":0.42898667},"labels":[],"label_agreement":null},{"id":"W2539372614","doi":"10.1137/15m1048896","title":"On Convergence Rate of Distributed Stochastic Gradient Algorithm for Convex Optimization with Inequality Constraints","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; City University of Hong Kong","keywords":"Mathematics; Rate of convergence; Convex function; Convergence (economics); Bounded function; Convex optimization; Mathematical optimization; Computation; Regular polygon; Constraint (computer-aided design); Optimization problem; Algorithm; Computer science; Mathematical analysis","score_opus":0.010652703333443697,"score_gpt":0.22616163506507267,"score_spread":0.21550893173162897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539372614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00079493626,0.00004625329,0.996369,0.0011454059,0.0004667992,0.0007792132,0.00033252715,0.000052098207,0.000013745295],"genre_scores_gemma":[0.9621566,0.00003621636,0.037365943,0.00024070343,0.00007592841,0.00004992318,0.000039430033,0.000016595677,0.000018657087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979875,0.00028158657,0.00065399235,0.00039981902,0.00033393427,0.00034314414],"domain_scores_gemma":[0.9972324,0.0007313162,0.000787021,0.0002525895,0.00076779333,0.00022888069],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008680612,0.00026150924,0.00045894668,0.00016010363,0.00020186327,0.00014122232,0.00029549064,0.00009553663,0.000023091761],"category_scores_gemma":[0.0003807027,0.00016605831,0.0000889172,0.00023600699,0.00015332724,0.00047327447,0.000021910328,0.00011473374,0.0000024301428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043492301,0.00018375611,0.00006392328,0.000014732142,0.0001211757,0.000007629246,0.000040219267,0.97466916,0.0001299659,0.008212685,0.000061950515,0.016059902],"study_design_scores_gemma":[0.01001689,0.0014427004,0.00021946216,0.000252392,0.00004800955,0.00003871071,0.00001770118,0.98721945,0.00012164614,0.000377026,0.000018410346,0.00022760469],"about_ca_topic_score_codex":0.000002576404,"about_ca_topic_score_gemma":7.66422e-7,"teacher_disagreement_score":0.96136165,"about_ca_system_score_codex":0.00011015476,"about_ca_system_score_gemma":0.00012809507,"threshold_uncertainty_score":0.6771661},"labels":[],"label_agreement":null},{"id":"W2539456223","doi":"10.1109/lars.2009.5418317","title":"Formation control of cooperative robots with limited sensing using a virtual robot as reference","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University","keywords":"Mobile robot; Robot; Computer science; Task (project management); Human–computer interaction; Software; Robot kinematics; Control (management); Artificial intelligence; Engineering; Systems engineering","score_opus":0.02965655752477393,"score_gpt":0.2556693991818254,"score_spread":0.2260128416570515,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2539456223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04265648,0.000021822141,0.9545372,0.00039176075,0.00006327766,0.00041431983,0.000005261398,0.00014796258,0.0017619131],"genre_scores_gemma":[0.972632,0.0000010007763,0.026851458,0.00040774152,0.000020761388,0.0000017538304,0.0000088176575,0.0000056568665,0.0000708187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841684,0.00016398376,0.00042555024,0.00030873378,0.0003906066,0.0002943026],"domain_scores_gemma":[0.99857396,0.00010004313,0.0002810913,0.00043180067,0.00051641575,0.000096675554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024193859,0.00019263692,0.00034212446,0.00012598552,0.00011270899,0.00017552865,0.0003530547,0.00007260343,0.000005046858],"category_scores_gemma":[0.000071609196,0.00014792671,0.000040523453,0.0004911452,0.00003525874,0.0011909696,0.000034398447,0.00011362112,0.000020318359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035038608,0.00026465795,0.00011555654,0.00002163787,0.00016058054,0.00007286407,0.0020753662,0.41565704,0.39669797,0.13243704,0.00012390259,0.052022994],"study_design_scores_gemma":[0.0020629943,0.00061048864,0.0005571177,0.00010820334,0.00002013154,0.00008677947,0.0001630293,0.9810699,0.015005692,0.000074457595,0.00003062652,0.00021053452],"about_ca_topic_score_codex":0.00012328527,"about_ca_topic_score_gemma":0.000026949367,"teacher_disagreement_score":0.9299755,"about_ca_system_score_codex":0.00009231125,"about_ca_system_score_gemma":0.00012290003,"threshold_uncertainty_score":0.6032276},"labels":[],"label_agreement":null},{"id":"W2541688248","doi":"10.1109/globalsip.2013.6736944","title":"Networked optimization with adaptive communication","year":2013,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Bottleneck; Computation; Node (physics); Component (thermodynamics); Distributed computing; Function (biology); Optimization problem; Convex function; Mathematical optimization; Regular polygon; Algorithm; Mathematics; Engineering","score_opus":0.009412095699961168,"score_gpt":0.1846612406414241,"score_spread":0.17524914494146293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2541688248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033240073,0.000048562084,0.98018444,0.0010334454,0.000051013303,0.0004100148,4.7713365e-7,0.00025734567,0.017682279],"genre_scores_gemma":[0.77159953,0.000003846073,0.22750072,0.00016967258,0.000014662486,0.00008805341,0.000010998013,0.000005063244,0.0006074609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992459,0.00009758835,0.0001470367,0.00018272187,0.00016189949,0.00016485306],"domain_scores_gemma":[0.9988888,0.000059977443,0.00009099202,0.00069689105,0.00020123292,0.00006210293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011415197,0.0000877739,0.000097111435,0.000033864206,0.00008792555,0.00022681973,0.00068640854,0.000034229004,0.00007421841],"category_scores_gemma":[0.000008235931,0.000064888554,0.000018317352,0.00027078998,0.000023809847,0.0008861125,0.00010217372,0.00005753024,0.00020956328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012144599,0.000103623664,0.0007740772,0.0000041232856,0.00007423292,0.0000016933814,0.000373703,0.8209043,0.00006331984,0.14124355,0.012693044,0.023752188],"study_design_scores_gemma":[0.00038346852,0.000043110376,0.0009932728,0.000013756338,0.0000028755203,0.0000031015718,0.00004881914,0.9977767,0.000027588118,0.00018888761,0.00041922103,0.00009923597],"about_ca_topic_score_codex":0.00031236644,"about_ca_topic_score_gemma":0.000020241707,"teacher_disagreement_score":0.7712671,"about_ca_system_score_codex":0.000037761696,"about_ca_system_score_gemma":0.00002381131,"threshold_uncertainty_score":0.2693582},"labels":[],"label_agreement":null},{"id":"W2542809591","doi":"10.1109/allerton.2008.4797581","title":"Rates of convergence for greedy gossip with eavesdropping","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Eavesdropping; Gossip protocol; Network topology; Computer science; Convergence (economics); Greedy algorithm; Node (physics); Wireless sensor network; Wireless network; Rate of convergence; Wireless; Topology (electrical circuits); Computer network; Algorithm; Mathematics; Channel (broadcasting); Telecommunications; Combinatorics","score_opus":0.04538249093315318,"score_gpt":0.25846865309438694,"score_spread":0.21308616216123377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2542809591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048291467,0.000067185196,0.9492443,0.0002246253,0.0002032906,0.0003734305,0.000008061427,0.00010551252,0.0014821129],"genre_scores_gemma":[0.97253996,0.000003726234,0.026168332,0.000074887364,0.000028517394,0.00004021667,0.0000030172218,0.000006464355,0.0011348921],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989636,0.000026296153,0.00025961734,0.0002868823,0.00021674982,0.0002468848],"domain_scores_gemma":[0.99902546,0.00011607954,0.00014063905,0.00043554505,0.00020746041,0.0000748169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015838658,0.000121509525,0.00022605239,0.00005338231,0.00009485199,0.000028425316,0.0006352271,0.000033793334,0.00001329869],"category_scores_gemma":[0.00003705553,0.00008910501,0.000060524802,0.00026560697,0.00007528482,0.00034100318,0.000060683997,0.000037065754,0.000022941234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035444507,0.0008994009,0.23953986,0.00069781404,0.00086972414,0.00022296794,0.005519339,0.003378157,0.10395621,0.60169864,0.027769934,0.01509349],"study_design_scores_gemma":[0.0065743015,0.0010686383,0.066939734,0.0002101093,0.00003643043,0.00027525736,0.00028317282,0.7818402,0.13118586,0.0008392558,0.009679308,0.0010677269],"about_ca_topic_score_codex":0.00012001659,"about_ca_topic_score_gemma":0.000015697746,"teacher_disagreement_score":0.92424846,"about_ca_system_score_codex":0.000020430958,"about_ca_system_score_gemma":0.00009574022,"threshold_uncertainty_score":0.3633597},"labels":[],"label_agreement":null},{"id":"W2544386679","doi":"10.1109/tac.2016.2621764","title":"Adaptive Source Localization Based Station Keeping of Autonomous Vehicles","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Shandong Academy of Sciences; Recruitment Program of Global Experts; National Science Foundation","keywords":"Beacon; Computer science; Control theory (sociology); Estimator; Position (finance); Adaptive control; Convergence (economics); Mobile robot; Real-time computing; Artificial intelligence; Control (management); Mathematics; Robot","score_opus":0.013657881564345702,"score_gpt":0.2241765364955332,"score_spread":0.21051865493118752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2544386679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029861827,0.000017625112,0.99449,0.0007292488,0.00039533476,0.00067979464,0.000083222854,0.00055404473,0.00006451971],"genre_scores_gemma":[0.99572,0.0000012232634,0.0037498083,0.00024940912,0.000017422746,0.00014111603,0.0000016151682,0.000020059275,0.00009934472],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979293,0.0002941745,0.0006419144,0.0003773771,0.00045289105,0.00030438518],"domain_scores_gemma":[0.9979581,0.0007714952,0.00036562243,0.0005819423,0.00021377714,0.00010902263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003891713,0.00021572503,0.00036532187,0.0002744146,0.0001488865,0.00006561626,0.00044336676,0.00009644818,0.000044776374],"category_scores_gemma":[0.000034738438,0.00017326309,0.00016341872,0.00036782384,0.00006801164,0.00046182267,0.0000014951157,0.00006632757,0.0000895355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007802792,0.0003991007,0.00004158688,0.00006864242,0.00020182482,0.000005254423,0.000610329,0.27151698,0.01816694,0.001226997,0.00007208512,0.7076122],"study_design_scores_gemma":[0.003670038,0.00019645558,0.0003197829,0.0002211918,0.00005344635,0.0000029626324,0.000035535133,0.9830676,0.011986159,0.00013553153,0.000114778166,0.00019655633],"about_ca_topic_score_codex":0.00007258831,"about_ca_topic_score_gemma":0.000024163704,"teacher_disagreement_score":0.99273384,"about_ca_system_score_codex":0.00021926373,"about_ca_system_score_gemma":0.00017374817,"threshold_uncertainty_score":0.70654637},"labels":[],"label_agreement":null},{"id":"W2548880535","doi":"10.1142/s2301385016500060","title":"Fault-Tolerant Formation Control of Unmanned Aerial Vehicles in the Presence of Actuator Faults and Obstacles","year":2016,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Northwest Fisheries Science Center; Natural Sciences and Engineering Research Council of Canada; Ağrı İbrahim Çeçen Üniversitesi","keywords":"Actuator; Control theory (sociology); Scheme (mathematics); Fault tolerance; Controller (irrigation); Collision avoidance; Loop (graph theory); Inner loop; Collision; Control engineering; Computer science; Mechanism (biology); Fault (geology); Control (management); Engineering; Artificial intelligence; Distributed computing","score_opus":0.013929504696323692,"score_gpt":0.22448950011525037,"score_spread":0.21055999541892667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2548880535","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8401532,0.0006456341,0.15563747,0.0008053074,0.0007550337,0.0016378501,0.00017883572,0.000070385504,0.00011627634],"genre_scores_gemma":[0.9996146,0.000016287497,0.00010304234,0.000026160427,0.00008618754,0.000104223676,0.000004396445,0.00000986013,0.000035240082],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969679,0.0006581557,0.0010154813,0.00035457042,0.0006302997,0.00037357214],"domain_scores_gemma":[0.9973163,0.00093832525,0.00067637797,0.00077004125,0.00022364636,0.00007528013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001333006,0.00022073448,0.000550381,0.00017691009,0.000071342234,0.00009016669,0.0011206733,0.0001238572,0.0000011275616],"category_scores_gemma":[0.00031617968,0.00012675981,0.000087652596,0.00031187234,0.000116642535,0.00087471487,0.00009206475,0.0000778655,0.000009793593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017484189,0.0011924744,0.024705894,0.0026587704,0.0005649491,0.00011238293,0.0371305,0.0036133467,0.6786897,0.20721929,0.0028931128,0.039471116],"study_design_scores_gemma":[0.03927242,0.0015868772,0.05022408,0.005497422,0.00013770405,0.00021775527,0.008578229,0.8413371,0.042975847,0.0017271031,0.006784238,0.001661248],"about_ca_topic_score_codex":0.00032288217,"about_ca_topic_score_gemma":0.0000550667,"teacher_disagreement_score":0.83772373,"about_ca_system_score_codex":0.00005455802,"about_ca_system_score_gemma":0.000053307074,"threshold_uncertainty_score":0.5169115},"labels":[],"label_agreement":null},{"id":"W2550408783","doi":"10.1002/rnc.3707","title":"Semi‐decentralized nonlinear cooperative control strategies for a network of heterogeneous autonomous underwater vehicles","year":2016,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nonlinear system; Control (management); Computer science; Trajectory; Position (finance); Multi-agent system; Decentralised system; Distributed computing; Underwater; Control engineering; Control theory (sociology); Engineering; Artificial intelligence","score_opus":0.016867781411127585,"score_gpt":0.255698689816921,"score_spread":0.23883090840579344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550408783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0444144,0.0008056848,0.9488102,0.004060995,0.0010925516,0.000423324,0.0003392392,0.000030359777,0.000023197328],"genre_scores_gemma":[0.98322797,0.00009739631,0.015389649,0.00035632658,0.00082566525,0.0000151944,0.0000069638445,0.000018486164,0.00006234049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781436,0.00017025354,0.00090860936,0.00026816924,0.00048105035,0.0003575821],"domain_scores_gemma":[0.99655765,0.0006848098,0.00082660886,0.0002001138,0.0015696512,0.00016115094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000656349,0.00024547928,0.00061801635,0.00011614605,0.000069475085,0.0002492879,0.0009027502,0.000110373345,0.000015171266],"category_scores_gemma":[0.00014378947,0.00015985027,0.00027748922,0.00008128437,0.000111298905,0.000684352,0.00006195264,0.000120022974,0.000003427461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015316221,0.0020436454,0.014396822,0.00018255957,0.014893967,0.00091978605,0.0016860516,0.63354397,0.14425652,0.043134674,0.0049376655,0.124688156],"study_design_scores_gemma":[0.036614086,0.0011046154,0.0004935628,0.0004359117,0.0001904859,0.0004806317,0.000095419266,0.93775976,0.003210363,0.0014839647,0.017659856,0.00047137673],"about_ca_topic_score_codex":0.000012234297,"about_ca_topic_score_gemma":0.000018595772,"teacher_disagreement_score":0.93881357,"about_ca_system_score_codex":0.00010284838,"about_ca_system_score_gemma":0.00035927905,"threshold_uncertainty_score":0.65185046},"labels":[],"label_agreement":null},{"id":"W2552512098","doi":"10.1109/allerton.2012.6483431","title":"A simple median-based resilient consensus algorithm","year":2012,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Consensus algorithm; Computer science; Algorithm; Property (philosophy); Graph; Algorithm design; Simple graph; Graph theory; Theoretical computer science; Data mining; Mathematics","score_opus":0.01873185905505673,"score_gpt":0.256451975687454,"score_spread":0.23772011663239725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552512098","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023745182,0.00017751806,0.9885758,0.001647138,0.0010476043,0.00032936758,0.000028280478,0.0004666834,0.0053530987],"genre_scores_gemma":[0.9425355,4.815004e-7,0.05592801,0.00079313957,0.00018919993,0.000040865856,0.000015626898,0.000010670959,0.0004864641],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813545,0.0001398304,0.0003115383,0.00030977544,0.0004457651,0.0006576535],"domain_scores_gemma":[0.9983447,0.00027879173,0.000098320554,0.00080194394,0.00010250139,0.00037370974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005504452,0.0001703866,0.00020670454,0.000093919734,0.00009142512,0.000107797765,0.00068204856,0.00007375223,0.0000894664],"category_scores_gemma":[0.000113021815,0.00014432515,0.000089970024,0.00032459272,0.000043862154,0.00018502708,0.000108080625,0.00009367422,0.0007627036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004001443,0.0018512415,0.031051427,0.000092592316,0.0002731438,0.00022009044,0.0013819297,0.0010653795,0.006851568,0.13792607,0.3202062,0.49904034],"study_design_scores_gemma":[0.0018609198,0.00006747609,0.0066770758,0.000013866013,0.000014134927,0.000025647765,0.000085505584,0.88540167,0.0060576336,0.00036846526,0.098970726,0.00045690546],"about_ca_topic_score_codex":0.0001669552,"about_ca_topic_score_gemma":0.000014893384,"teacher_disagreement_score":0.94016105,"about_ca_system_score_codex":0.000087721106,"about_ca_system_score_gemma":0.0001009032,"threshold_uncertainty_score":0.98032665},"labels":[],"label_agreement":null},{"id":"W2554915633","doi":"10.1049/iet-cta.2016.0930","title":"Robust consensus of autonomous underactuated surface vessels","year":2016,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qatar National Research Fund","keywords":"Underactuation; Unmanned surface vehicle; Control theory (sociology); Computer science; Surface (topology); Control engineering; Engineering; Artificial intelligence; Mathematics; Robot; Control (management); Marine engineering; Geometry","score_opus":0.01641552780605996,"score_gpt":0.2321612745737557,"score_spread":0.21574574676769576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2554915633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0121663995,0.0002963617,0.9831163,0.0021105306,0.00006815898,0.0006828219,0.00016727882,0.00018040709,0.0012117325],"genre_scores_gemma":[0.99818534,0.0000130472135,0.0010746331,0.00014777083,0.000040016406,0.00012590192,0.000005109384,0.0000095548085,0.0003986545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986151,0.0002728911,0.00036460115,0.00037457622,0.00013227652,0.00024055607],"domain_scores_gemma":[0.9971337,0.0016709167,0.00023365999,0.0006893539,0.00015467862,0.00011770987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007696127,0.00015166886,0.00027485337,0.00004325803,0.00013497272,0.000057850208,0.0005002114,0.00007470815,0.0000240047],"category_scores_gemma":[0.00008833566,0.000109983725,0.00006224841,0.0001920183,0.00017803627,0.00013934284,0.000056963552,0.000062155894,0.00009505121],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000418166,0.000086391556,0.00015250573,0.000010819128,0.00008414376,0.000001531799,0.00006510971,0.00050381524,0.044537857,0.9340349,0.00020731766,0.020273818],"study_design_scores_gemma":[0.03245282,0.0005303686,0.011724925,0.000401284,0.00049939204,0.0002212777,0.0006348581,0.10102264,0.035461202,0.68011206,0.13422461,0.0027145743],"about_ca_topic_score_codex":0.000009341239,"about_ca_topic_score_gemma":0.0000019340227,"teacher_disagreement_score":0.9860189,"about_ca_system_score_codex":0.00002967684,"about_ca_system_score_gemma":0.00007760487,"threshold_uncertainty_score":0.4485006},"labels":[],"label_agreement":null},{"id":"W2560389206","doi":"10.1109/atc.2016.7764783","title":"An online local boundary detection and classification algorithm for networked multi-robot systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Boundary (topology); Computer science; Robot; Process (computing); Synchronization (alternating current); Algorithm; Statistical classification; Artificial intelligence; Mathematics","score_opus":0.04605264641347372,"score_gpt":0.2760218802787899,"score_spread":0.22996923386531615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560389206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011001236,0.0001791717,0.9960135,0.0002720707,0.0011580315,0.00078985875,0.000054536427,0.00040829496,0.000024405294],"genre_scores_gemma":[0.92885786,0.000010869061,0.07021588,0.00005359358,0.00029657004,0.00015727375,0.00002687959,0.000016663798,0.0003644032],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836296,0.00013997573,0.00038191242,0.00057405356,0.00020303708,0.0003380581],"domain_scores_gemma":[0.99875146,0.00014262929,0.00016125302,0.0005701378,0.00019514681,0.00017937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044662142,0.00017834888,0.00021920836,0.00008449824,0.00018578998,0.00032394694,0.00043310534,0.00012899518,0.0000014583259],"category_scores_gemma":[0.000019868356,0.00012366733,0.000049895043,0.00016846106,0.00007445407,0.00081337424,0.00005200054,0.000055618442,0.000019344681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009751021,0.00011049465,0.00009346061,0.000012736398,0.000023246781,0.0000012329522,0.000024100784,0.00016928284,0.014913492,0.00095589383,0.00010079366,0.98358554],"study_design_scores_gemma":[0.0017990184,0.00016823772,0.0042490014,0.000037186455,0.000010499731,0.00002087404,0.00007523221,0.98645973,0.0003132674,0.00004777919,0.0066191982,0.00020000133],"about_ca_topic_score_codex":0.000107617176,"about_ca_topic_score_gemma":0.00013985991,"teacher_disagreement_score":0.9862904,"about_ca_system_score_codex":0.00014406534,"about_ca_system_score_gemma":0.00005160305,"threshold_uncertainty_score":0.5043007},"labels":[],"label_agreement":null},{"id":"W2560475400","doi":"10.1109/tcyb.2016.2628811","title":"Consensus Problem Over High-Order Multiagent Systems With Uncertain Nonlinearities Under Deterministic and Stochastic Topologies","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network topology; Consensus; Computer science; Multi-agent system; Nonlinear system; Protocol (science); Mathematical optimization; Set (abstract data type); Mathematics; Artificial intelligence; Computer network","score_opus":0.01854665933749421,"score_gpt":0.2385595929411501,"score_spread":0.22001293360365587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560475400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026068198,0.000104437,0.97084796,0.00068667915,0.0010600821,0.0007037534,0.0001855534,0.0002817339,0.00006162349],"genre_scores_gemma":[0.9909721,0.00002138589,0.007021236,0.000081080834,0.000043669188,0.00014344483,0.0000017982617,0.000029934745,0.0016853553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979487,0.00014349115,0.0004203222,0.0005960537,0.00041808726,0.0004733385],"domain_scores_gemma":[0.99805355,0.00076699373,0.00015407184,0.00065720367,0.000200338,0.00016787002],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015781037,0.0003412283,0.0003543474,0.00014335298,0.0002004294,0.00023955324,0.00039836788,0.00014223368,0.0000120142195],"category_scores_gemma":[0.000016593749,0.00022985566,0.000050963587,0.00022307262,0.00032915268,0.00013772574,0.000008385011,0.0001675361,0.000035062905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030432732,0.00099661,0.0001148964,0.00033173725,0.00084615225,0.00025307407,0.0014642958,0.9154302,0.005045691,0.029104084,0.0004447698,0.045664188],"study_design_scores_gemma":[0.011478028,0.0023170144,0.0020895337,0.0012804694,0.00039911625,0.00058920786,0.001194329,0.9732736,0.00261245,0.0015312934,0.0010847776,0.00215019],"about_ca_topic_score_codex":0.00042853566,"about_ca_topic_score_gemma":0.00024342332,"teacher_disagreement_score":0.9649039,"about_ca_system_score_codex":0.00014633231,"about_ca_system_score_gemma":0.00013695304,"threshold_uncertainty_score":0.93732417},"labels":[],"label_agreement":null},{"id":"W2561243451","doi":"10.1109/tac.2016.2643444","title":"A Descriptor Approach to Robust Leader-Following Output Consensus of Uncertain Multi-Agent Systems With Delay","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Multi-agent system; Model transformation; Computer science; Protocol (science); Consensus; Directed graph; Transformation (genetics); PID controller; Mathematics; Mathematical optimization; Control (management); Algorithm; Control engineering; Artificial intelligence; Engineering","score_opus":0.04448257683792793,"score_gpt":0.24000658495913949,"score_spread":0.19552400812121157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2561243451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012758938,0.00008718331,0.981643,0.000733933,0.0013507551,0.0025015345,0.00014843856,0.0006369596,0.00013925275],"genre_scores_gemma":[0.9627359,9.842978e-7,0.035582162,0.00014560754,0.000031087737,0.0007752176,0.000001132664,0.000047141293,0.0006807709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99601597,0.0004665786,0.0010372013,0.0008331166,0.0008966901,0.00075043447],"domain_scores_gemma":[0.99705887,0.0006247678,0.00036760236,0.0012974222,0.00024985182,0.00040145786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075892307,0.00050216244,0.0009495084,0.0004222769,0.00021592715,0.00018644822,0.001008347,0.00016015791,0.0000075028584],"category_scores_gemma":[0.00005127122,0.00033837938,0.00033924013,0.0006461726,0.00009447096,0.00027683153,0.0000050167696,0.00015230484,0.00013537603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034044808,0.00299601,0.00020950615,0.0005539862,0.00289836,0.0001896425,0.003234987,0.8914097,0.02805921,0.00133735,0.0010244087,0.06774639],"study_design_scores_gemma":[0.008877027,0.00037135096,0.0001762277,0.0006545534,0.00020455198,0.000094213756,0.00038449923,0.9876314,0.00088544807,0.0000032509001,0.00020449939,0.0005129809],"about_ca_topic_score_codex":0.00025287335,"about_ca_topic_score_gemma":0.000043296262,"teacher_disagreement_score":0.949977,"about_ca_system_score_codex":0.0004047064,"about_ca_system_score_gemma":0.00025714995,"threshold_uncertainty_score":0.99990684},"labels":[],"label_agreement":null},{"id":"W2564566929","doi":"10.1109/cdc.2003.1272699","title":"Local control strategies for groups of mobile autonomous agents","year":2004,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Focus (optics); Computer science; Control (management); Point (geometry); Mathematical optimization; Mobile robot; Autonomous agent; Distributed computing; Mathematics; Artificial intelligence; Robot; Economics","score_opus":0.014797119677018062,"score_gpt":0.25263596482963396,"score_spread":0.2378388451526159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564566929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010055608,0.00008422463,0.9865123,0.00017753961,0.00036879897,0.000928048,0.000043416672,0.0002110097,0.001619075],"genre_scores_gemma":[0.99249125,9.0241724e-7,0.0069215624,0.00016496582,0.000036043464,0.0002461536,0.000007964182,0.000009513403,0.00012162898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998619,0.000031469463,0.00042865594,0.0003395424,0.00023534457,0.0003459669],"domain_scores_gemma":[0.99900717,0.00008634037,0.00015761069,0.0005032327,0.00014633675,0.0000992883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024738527,0.00015993364,0.00032093123,0.00006640357,0.000059366284,0.00013339262,0.0008259663,0.00007539731,0.0000145539825],"category_scores_gemma":[0.000014630738,0.00013855934,0.00014610238,0.00015757728,0.000064215885,0.0005212388,0.00006288612,0.000053311436,0.00004259769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036111836,0.00037401254,0.00009764822,0.00008148208,0.000142698,0.000014038361,0.0006089092,0.105675675,0.0029418478,0.8768279,0.0007763806,0.012423292],"study_design_scores_gemma":[0.024142493,0.0017768038,0.0024526347,0.00009887948,0.00007723301,0.000039925722,0.002209097,0.89879113,0.010456015,0.048072394,0.010904367,0.0009790256],"about_ca_topic_score_codex":0.00021703256,"about_ca_topic_score_gemma":0.000039454608,"teacher_disagreement_score":0.98243564,"about_ca_system_score_codex":0.0001059457,"about_ca_system_score_gemma":0.00024094919,"threshold_uncertainty_score":0.56502855},"labels":[],"label_agreement":null},{"id":"W2568893241","doi":"10.1109/cdc.2016.7798375","title":"Saddle-point dynamics for distributed convex optimization on general directed graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Saddle point; Saddle; Laplacian matrix; Optimization problem; Mathematics; Convex optimization; Dynamical systems theory; Regular polygon; Mathematical optimization; Convergence (economics); Directed graph; Computer science; Graph; Applied mathematics; Discrete mathematics","score_opus":0.01211378722071732,"score_gpt":0.2264266288018599,"score_spread":0.21431284158114258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568893241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015830573,0.000011868454,0.99143296,0.0029472664,0.0008461376,0.0007995408,0.00058307085,0.0009729197,0.0008231464],"genre_scores_gemma":[0.93453884,0.0000084367775,0.06214661,0.0003808356,0.00011113581,0.00027645327,0.0005903824,0.00003455131,0.0019127409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980585,0.00010080402,0.0004346215,0.00061013363,0.00030987,0.00048605804],"domain_scores_gemma":[0.9982722,0.0002945789,0.00018996767,0.00075289526,0.00031580604,0.00017455567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027726335,0.00025494563,0.00030199307,0.00013164361,0.00013711906,0.00018058142,0.0007821553,0.0001224528,0.0000404851],"category_scores_gemma":[0.00021696548,0.0001719711,0.00016013494,0.00040691014,0.0000442616,0.00044231288,0.00010108159,0.000055032546,0.000053168045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013393247,0.00035327146,0.0012885581,0.00003100821,0.00019859428,0.0000119517135,0.000054895118,0.020202346,0.0023273544,0.9251149,0.019877916,0.030405222],"study_design_scores_gemma":[0.002392419,0.00015014157,0.0007557568,0.000038680362,0.000012393977,0.000004654191,0.000006158202,0.99208426,0.0011566632,0.0015929393,0.0014936888,0.00031223468],"about_ca_topic_score_codex":0.00003515606,"about_ca_topic_score_gemma":0.0000339213,"teacher_disagreement_score":0.9718819,"about_ca_system_score_codex":0.0002771356,"about_ca_system_score_gemma":0.00005701439,"threshold_uncertainty_score":0.7012778},"labels":[],"label_agreement":null},{"id":"W2568900560","doi":"10.1109/cdc.2016.7798537","title":"Secure local filtering algorithms for distributed optimization","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Algorithm; Distributed algorithm; Distributed computing","score_opus":0.01967036343206868,"score_gpt":0.2457049095775336,"score_spread":0.22603454614546492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568900560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004480708,0.000020461473,0.9963007,0.0018495015,0.0005281688,0.00040701832,0.00019034605,0.0004216911,0.00023729772],"genre_scores_gemma":[0.7517879,0.000004313521,0.24677266,0.00015451659,0.00017041249,0.00017728777,0.00009659752,0.000019434296,0.0008168821],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871683,0.000035991186,0.0002755437,0.0004058829,0.00020306291,0.0003626693],"domain_scores_gemma":[0.99900734,0.00014528107,0.00009187041,0.00046897182,0.00016707437,0.00011948025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020385893,0.00015171818,0.0001719045,0.00005066506,0.000092044334,0.00014185038,0.0006594361,0.00007923362,0.00004069594],"category_scores_gemma":[0.00007575039,0.00010081464,0.00008578534,0.00019826648,0.000028840714,0.00058143906,0.00013507337,0.000031597054,0.00004780254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008220049,0.00032421757,0.00036738717,0.00011484001,0.0002681876,0.000038408056,0.00027220396,0.14323197,0.011035026,0.18927757,0.040025774,0.6149622],"study_design_scores_gemma":[0.0014438091,0.000058631766,0.00007328363,0.000034984256,0.0000056498857,0.000008849789,0.000014287285,0.98273325,0.0027923046,0.00031580153,0.012315294,0.00020386804],"about_ca_topic_score_codex":0.000012703832,"about_ca_topic_score_gemma":0.0000037219888,"teacher_disagreement_score":0.83950126,"about_ca_system_score_codex":0.00011353124,"about_ca_system_score_gemma":0.000038581336,"threshold_uncertainty_score":0.4111102},"labels":[],"label_agreement":null},{"id":"W2568937866","doi":"10.1109/cdc.2016.7798933","title":"Synchronization of linear time-invariant systems on rooted graphs","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Passivity; Synchronization (alternating current); Control theory (sociology); Topology (electrical circuits); Invariant (physics); Computer science; Property (philosophy); Linear system; Network topology; Mathematics; Control (management); Computer network; Engineering; Combinatorics","score_opus":0.010005755470357711,"score_gpt":0.2130261529035113,"score_spread":0.2030203974331536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2568937866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032778936,0.000049268117,0.9915058,0.00048764248,0.0005322029,0.00036979752,0.000024178215,0.00029133537,0.003461895],"genre_scores_gemma":[0.9967953,0.00000394585,0.001118452,0.000040173098,0.000054295568,0.000017736602,0.0000064095384,0.000010864206,0.0019528237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984289,0.00014903901,0.00042250613,0.00035649652,0.0003953914,0.00024770098],"domain_scores_gemma":[0.99852866,0.00017770867,0.00021528263,0.0007728559,0.00021411247,0.00009138619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003620965,0.00014789298,0.000253552,0.00014787466,0.000052564632,0.00005651558,0.00068755145,0.00008521484,0.00003620023],"category_scores_gemma":[0.000118359756,0.00009146638,0.00007157075,0.000420013,0.00002771607,0.00030297454,0.00008054494,0.000038272156,0.000661059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004281641,0.00039238148,0.0013232499,0.00010663453,0.00021423925,0.000033479348,0.00015828206,0.0030930184,0.0795545,0.88602614,0.008435947,0.02061932],"study_design_scores_gemma":[0.002289379,0.00033598952,0.0013927928,0.0004556068,0.000017577837,0.000016691785,0.000012096869,0.9812765,0.010810201,0.00043343302,0.0025774036,0.00038231126],"about_ca_topic_score_codex":0.00010179081,"about_ca_topic_score_gemma":0.0000029377393,"teacher_disagreement_score":0.9935174,"about_ca_system_score_codex":0.00007375803,"about_ca_system_score_gemma":0.00006249749,"threshold_uncertainty_score":0.8496796},"labels":[],"label_agreement":null},{"id":"W2571988845","doi":"10.1002/rnc.3734","title":"Robust output synchronization of linear multi‐agent systems with constant disturbances via integral control","year":2017,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Education and Child Care","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Synchronization (alternating current); Computer science; Constant (computer programming); Controller (irrigation); Protocol (science); Observer (physics); State (computer science); Control (management); Multi-agent system; Algorithm; Artificial intelligence; Computer network","score_opus":0.025199255228598196,"score_gpt":0.2514691156728528,"score_spread":0.2262698604442546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2571988845","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013364562,0.0014010913,0.98089826,0.0013400152,0.0023124956,0.00039349616,0.00017719087,0.000026220709,0.00008666442],"genre_scores_gemma":[0.986178,0.00008146063,0.01283963,0.00007612828,0.00069217396,0.000009274524,0.000009956786,0.000017943448,0.00009542714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99730223,0.00015613274,0.0010365653,0.00031190107,0.000917395,0.00027576767],"domain_scores_gemma":[0.99477416,0.00021121289,0.0022158807,0.0004519388,0.0021556963,0.00019108778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082896336,0.00028226624,0.00070361403,0.00021947242,0.00020867992,0.000564793,0.0017183588,0.00010827549,0.000004692773],"category_scores_gemma":[0.00034252077,0.00020248519,0.00017786291,0.00006987716,0.0002401792,0.0010548077,0.000105008614,0.00028115336,0.0000042949646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005210112,0.0023525206,0.26692942,0.00036049282,0.008465229,0.0019850323,0.0013543091,0.63143,0.0040774643,0.010652841,0.0008718784,0.06631071],"study_design_scores_gemma":[0.011740248,0.00036046718,0.005770984,0.0004953161,0.00011519237,0.00039584644,0.00009853745,0.97970796,0.00008467262,0.000014493119,0.0009879466,0.00022832479],"about_ca_topic_score_codex":0.00017908194,"about_ca_topic_score_gemma":0.00005317113,"teacher_disagreement_score":0.9728134,"about_ca_system_score_codex":0.0001283161,"about_ca_system_score_gemma":0.00022540077,"threshold_uncertainty_score":0.8257106},"labels":[],"label_agreement":null},{"id":"W2584256285","doi":"10.1007/978-3-319-67540-4_1","title":"Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Mathematical economics; Matrix (chemical analysis); Mathematics; Chemistry; Chromatography","score_opus":0.01719455328474772,"score_gpt":0.2408719034218769,"score_spread":0.22367735013712917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2584256285","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084431165,0.00048390462,0.9941608,0.0011021243,0.0005245424,0.00088199443,0.000075088305,0.000101024205,0.0025861084],"genre_scores_gemma":[0.13345803,0.0000433218,0.86582035,0.00008396513,0.00016640192,0.000060782833,0.000081046375,0.000032517455,0.0002535919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982539,0.000018161749,0.00073486706,0.00023710924,0.00041992674,0.00033606755],"domain_scores_gemma":[0.99624264,0.00035623275,0.0011407447,0.0018767827,0.0003091019,0.000074525065],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005470637,0.0003995999,0.0005456186,0.00022766278,0.0014427963,0.0007395861,0.005258009,0.0002441867,6.7969154e-7],"category_scores_gemma":[0.0000591178,0.00031140697,0.00020395646,0.00014811732,0.00057131745,0.0008817806,0.0015487036,0.0005194022,0.0000016734461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004069297,0.000017075026,0.0000037109457,0.0002368008,0.00017668972,2.1567142e-7,0.0013536473,0.9409926,0.000030654755,0.05096302,0.0001178955,0.006103617],"study_design_scores_gemma":[0.00052156206,0.00006192037,0.000034088895,0.00069205463,0.00007704178,0.0000246564,0.0000031379932,0.98532593,0.000033082644,0.00074763974,0.012057084,0.0004218269],"about_ca_topic_score_codex":0.000052868967,"about_ca_topic_score_gemma":0.00009199354,"teacher_disagreement_score":0.1333736,"about_ca_system_score_codex":0.00011312506,"about_ca_system_score_gemma":0.0002879103,"threshold_uncertainty_score":0.9999338},"labels":[],"label_agreement":null},{"id":"W2585401210","doi":"10.1016/j.robot.2017.03.005","title":"Collaborative visual area coverage","year":2017,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Canadian Institute for Advanced Research","keywords":"Computer science; Human–computer interaction; Computer graphics (images)","score_opus":0.013776266139317756,"score_gpt":0.2530344956161665,"score_spread":0.23925822947684872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585401210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0096516535,0.0012188924,0.9724368,0.0010902432,0.003514447,0.0009444285,0.00007781007,0.0002830495,0.010782667],"genre_scores_gemma":[0.9974666,0.0000293445,0.00078714825,0.000042925185,0.00016677864,0.000037077993,0.000008163766,0.000015433707,0.0014464831],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983253,0.00009344913,0.0003952422,0.00050709856,0.00027918405,0.00039973084],"domain_scores_gemma":[0.9980408,0.00008091382,0.00047719709,0.0010058805,0.00019542273,0.00019980161],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0003767502,0.0002451988,0.0004421156,0.00006506482,0.00078899076,0.0027802647,0.0009858876,0.00011474894,0.000001747818],"category_scores_gemma":[0.00007917575,0.00022156647,0.000057477708,0.000088456996,0.00007940813,0.00062212715,0.0003514415,0.00011901378,0.000060882965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030044544,0.0004773136,0.018067664,0.00035072744,0.0005795112,0.0005758149,0.0021430647,0.081553735,0.0028227638,0.8674089,0.0047915974,0.021198893],"study_design_scores_gemma":[0.0012548105,0.00014166239,0.0064083734,0.00012638977,0.000022055718,0.00005864625,0.00011728428,0.9757582,0.00009293774,0.00026697558,0.015274331,0.00047833333],"about_ca_topic_score_codex":0.00020750558,"about_ca_topic_score_gemma":0.000018211327,"teacher_disagreement_score":0.98781496,"about_ca_system_score_codex":0.0000969793,"about_ca_system_score_gemma":0.00015692695,"threshold_uncertainty_score":0.99825495},"labels":[],"label_agreement":null},{"id":"W2585867354","doi":"10.1109/tsmc.2017.2654366","title":"Consensus Problem in High-Order Multiagent Systems With Lipschitz Nonlinearities and Jointly Connected Topologies","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":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network topology; Lipschitz continuity; Multi-agent system; Consensus; Protocol (science); Computer science; Convergence (economics); Mathematical optimization; Control theory (sociology); Topology (electrical circuits); Mathematics; Computer network; Artificial intelligence; Control (management)","score_opus":0.01767719039508679,"score_gpt":0.22711677496381213,"score_spread":0.20943958456872536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2585867354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33882484,0.0048606754,0.63861734,0.00091233244,0.007353319,0.006172616,0.0004983328,0.00083463377,0.0019259031],"genre_scores_gemma":[0.99579126,0.00016109463,0.00094573764,0.000021520302,0.00013212484,0.00055694336,0.000006863154,0.00005644558,0.002328011],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957249,0.0005601083,0.0011595767,0.0011073464,0.0006759007,0.0007721508],"domain_scores_gemma":[0.9965863,0.0003695954,0.000735067,0.0015953152,0.00039301717,0.00032066528],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007806298,0.0006523931,0.0011363459,0.0003869371,0.00079389545,0.0027578594,0.0008841854,0.00034982042,0.0000015687856],"category_scores_gemma":[0.000028444678,0.0005478826,0.00007432947,0.00024322943,0.0004330605,0.0003941382,0.000029198223,0.0004768395,0.000025378175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016931299,0.0041230544,0.024082625,0.017255208,0.0051601273,0.0033685556,0.017110167,0.6776782,0.007849346,0.22172433,0.002369625,0.017585598],"study_design_scores_gemma":[0.012524987,0.0017865634,0.007755845,0.0050730524,0.00022792877,0.0018396785,0.009990147,0.953734,0.000522229,0.00006744885,0.004040665,0.002437448],"about_ca_topic_score_codex":0.015492772,"about_ca_topic_score_gemma":0.0011099296,"teacher_disagreement_score":0.65696645,"about_ca_system_score_codex":0.00016397313,"about_ca_system_score_gemma":0.00013435744,"threshold_uncertainty_score":0.99969727},"labels":[],"label_agreement":null},{"id":"W2588359022","doi":"10.1177/1729881416687111","title":"Test bed for applications of heterogeneous unmanned vehicles","year":2017,"lang":"en","type":"article","venue":"International Journal of Advanced Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Drone; Firmware; Computer science; Software; Unmanned ground vehicle; Robotics; Artificial intelligence; Test (biology); Real-time computing; Simulation; Embedded system; Robot; Operating system","score_opus":0.01817386788717351,"score_gpt":0.29873681716588624,"score_spread":0.2805629492787127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588359022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004252455,0.00063553476,0.98978466,0.0008799683,0.0036574288,0.0005857536,0.00005066684,0.000026016267,0.00012752519],"genre_scores_gemma":[0.98677164,0.000023862596,0.012430566,0.000022687125,0.00050297397,0.00006955402,0.0000052186642,0.00001415835,0.00015934082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979146,0.00004172489,0.0009805053,0.0002203139,0.000642673,0.00020016416],"domain_scores_gemma":[0.99463046,0.00044333178,0.002412536,0.0006585326,0.0017433097,0.000111844805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045964753,0.0001524188,0.00042512457,0.00018692852,0.00017402982,0.00033900054,0.0032080663,0.00006196938,0.0000012386964],"category_scores_gemma":[0.0005751629,0.0001353779,0.00023153394,0.0000604453,0.00006302855,0.0007119302,0.00014737193,0.000091246555,0.000007087922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028266016,0.0011000513,0.008898659,0.0003070341,0.0017460614,0.00016591228,0.0005931957,0.7505123,0.09185544,0.06416713,0.0008725856,0.07949897],"study_design_scores_gemma":[0.025987266,0.0023045866,0.012410033,0.0032330046,0.0003359213,0.003940824,0.00083753705,0.84003884,0.052000806,0.012536161,0.04461701,0.0017580389],"about_ca_topic_score_codex":0.000023722989,"about_ca_topic_score_gemma":0.000004327678,"teacher_disagreement_score":0.9825192,"about_ca_system_score_codex":0.00013752199,"about_ca_system_score_gemma":0.000107250715,"threshold_uncertainty_score":0.5961439},"labels":[],"label_agreement":null},{"id":"W2588504815","doi":"10.1115/dscc2016-9669","title":"Non-Autonomous Feedback Control for Area Coverage Problems With Time-Varying Risk","year":2016,"lang":"en","type":"article","venue":"Volume 2: Mechatronics; Mechatronics and Controls in Advanced Manufacturing; Modeling and Control of Automotive Systems and Combustion Engines; Modeling and Validation; Motion and Vibration Control Applications; Multi-Agent and Networked Systems; Path Planning and Motion Control; Robot Manipulators; Sensors and Actuators; Tracking Control Systems; Uncertain Systems and Robustness; Unmanned, Ground and Surface Robotics; Vehicle Dynamic Controls; Vehicle Dynamics and Traffic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Metric (unit); Computer science; Component (thermodynamics); Performance metric; Scalar (mathematics); Software deployment; Scalar field; Mathematical optimization; Autonomous agent; Control theory (sociology); Distributed computing; Control (management); Mathematics; Engineering; Artificial intelligence","score_opus":0.013165885590256854,"score_gpt":0.22047065991576126,"score_spread":0.2073047743255044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2588504815","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37604922,0.021149578,0.59688646,0.0004451544,0.0002693414,0.0045789927,0.00044948887,0.00017069452,0.0000010771713],"genre_scores_gemma":[0.9937219,0.004277226,0.0005138775,0.00006852336,0.00019933798,0.0008980148,0.0001217364,0.00014124527,0.000058135076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99198514,0.0008962864,0.0026481317,0.0024355908,0.0006608452,0.0013739984],"domain_scores_gemma":[0.99437237,0.0015247529,0.0018353659,0.00062103453,0.00082844356,0.0008180528],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0034345475,0.0015821252,0.0032188832,0.0005710399,0.0018160625,0.0019666422,0.0002690914,0.0008231607,4.992724e-7],"category_scores_gemma":[0.0001130243,0.0013192395,0.00019514236,0.0002405797,0.00030919688,0.0014035816,0.00010714767,0.0007130026,3.9504346e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010299392,0.0001557893,0.0043485826,0.0011585089,0.0008857859,0.000007730002,0.0003477834,0.9668303,0.0010260892,0.007409567,7.2525603e-7,0.016799169],"study_design_scores_gemma":[0.04794776,0.0007556184,0.0013577809,0.0015485592,0.0010130369,0.00014639112,0.0011476002,0.9445607,0.0000017443044,0.00015269393,0.000029766315,0.0013383497],"about_ca_topic_score_codex":0.0005249458,"about_ca_topic_score_gemma":0.000055827062,"teacher_disagreement_score":0.6176727,"about_ca_system_score_codex":0.00023663056,"about_ca_system_score_gemma":0.00011129303,"threshold_uncertainty_score":0.9996927},"labels":[],"label_agreement":null},{"id":"W2589020962","doi":"10.1109/allerton.2016.7852233","title":"Input/output analysis of primal-dual gradient algorithms","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robustness (evolution); Convex function; Algorithm; Regular polygon; Dual (grammatical number); Function (biology); Mathematical optimization; Saddle point; Saddle; Computer science; Convex optimization; Quadratic equation; Mathematics","score_opus":0.019191610197032534,"score_gpt":0.2415751693466781,"score_spread":0.22238355914964558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589020962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023583885,0.00004568411,0.9721026,0.00090575975,0.0003180039,0.00017180415,0.00004841223,0.00017453825,0.0026493585],"genre_scores_gemma":[0.9867873,0.0000050405297,0.011067272,0.00009766156,0.000039402315,0.000016694688,0.0000066249704,0.000006221487,0.0019737633],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806446,0.00009453157,0.0005031432,0.00048009507,0.00050540577,0.00035235612],"domain_scores_gemma":[0.9983208,0.00015922023,0.00021971432,0.00095580367,0.00019701866,0.00014743963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004259273,0.000162946,0.00042841403,0.00039744304,0.000041493076,0.000062591476,0.00086290453,0.000062619976,0.000068878646],"category_scores_gemma":[0.000069527094,0.00009989848,0.00026626914,0.0013497673,0.000054943823,0.0003565621,0.00023747273,0.00004095618,0.00010911139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033953922,0.00089406065,0.04099574,0.000040442592,0.0066254265,0.00008916348,0.0014128834,0.00076030893,0.028937541,0.29243207,0.00819508,0.6195833],"study_design_scores_gemma":[0.005774194,0.00052846223,0.24318515,0.00011557889,0.0013731808,0.000026772359,0.00013738366,0.6882502,0.027502336,0.0012062645,0.03039978,0.0015006949],"about_ca_topic_score_codex":0.00013301926,"about_ca_topic_score_gemma":0.000028866714,"teacher_disagreement_score":0.96320343,"about_ca_system_score_codex":0.0000880269,"about_ca_system_score_gemma":0.00005331486,"threshold_uncertainty_score":0.4073742},"labels":[],"label_agreement":null},{"id":"W2589052667","doi":"10.1177/1729881416686956","title":"Target tracking control and semi-physical simulation of Qball-X4 quad-rotor unmanned aerial vehicle","year":2017,"lang":"en","type":"article","venue":"International Journal of Advanced Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science; Tracking (education); Software; Tracking system; Process (computing); Optical flow; Scheme (mathematics); Monocular vision; Real-time computing; Cascade; Simulation; Artificial intelligence; Computer vision; Kalman filter; Engineering","score_opus":0.016944195968742547,"score_gpt":0.3012935838472275,"score_spread":0.28434938787848496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2589052667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17768566,0.0002952632,0.8145704,0.00056757627,0.00632402,0.00040755604,0.000024703731,0.000027824028,0.00009693765],"genre_scores_gemma":[0.9971296,0.000006602009,0.0016417432,0.000021945621,0.0011326533,0.000008765125,0.0000024653518,0.000014880579,0.00004134922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974381,0.00016052861,0.00094955607,0.00026082995,0.0009570353,0.00023397327],"domain_scores_gemma":[0.9956014,0.00041290344,0.002245785,0.00042542408,0.001168165,0.00014632057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005974319,0.0001971062,0.00060475356,0.000159746,0.00014019437,0.00050373445,0.0015572769,0.00007603001,0.000001891285],"category_scores_gemma":[0.00067202497,0.00017324153,0.00018162317,0.000055438715,0.00008007232,0.0016859226,0.00012257203,0.00017293113,0.000004748149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022997805,0.00013582903,0.0032597033,0.000034269015,0.00031495446,0.00007076841,0.00033164446,0.9610212,0.027393626,0.0037491969,0.000023452883,0.0034354166],"study_design_scores_gemma":[0.0056588175,0.00021790546,0.012331486,0.00046344503,0.000035083067,0.00010901439,0.0001091112,0.9792481,0.0008449447,0.0004430831,0.00034729097,0.00019170866],"about_ca_topic_score_codex":0.000049547725,"about_ca_topic_score_gemma":0.0000025771199,"teacher_disagreement_score":0.81944394,"about_ca_system_score_codex":0.00014964028,"about_ca_system_score_gemma":0.000092504466,"threshold_uncertainty_score":0.70645845},"labels":[],"label_agreement":null},{"id":"W2591609130","doi":"10.1109/tie.2017.2677312","title":"Consensus Control for a Multi-Agent System With Integral-Type Event-Triggering Condition and Asynchronous Periodic Detection","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Postdoctoral Science Foundation","keywords":"Asynchronous communication; Multi-agent system; Consensus; Protocol (science); Control theory (sociology); Computer science; Event (particle physics); Control (management); Lyapunov function; Artificial intelligence; Physics; Nonlinear system; Computer network","score_opus":0.03523535408399883,"score_gpt":0.27035894554309864,"score_spread":0.2351235914590998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591609130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05692846,0.00012285232,0.93837076,0.00022481974,0.0020045708,0.0019186232,0.000115520204,0.00029594114,0.00001842673],"genre_scores_gemma":[0.9987514,0.000015967667,0.0005249479,0.00002490325,0.0001570855,0.0004083244,0.000006099799,0.0000361442,0.00007509999],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766445,0.00017038305,0.00049928186,0.0006748547,0.00032686407,0.00066413986],"domain_scores_gemma":[0.9980371,0.00018490506,0.00048797246,0.0008136963,0.00027212405,0.00020418139],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005259132,0.00037423996,0.00049584516,0.00020340973,0.0014951796,0.00071564625,0.0005518588,0.00032762025,0.0000029940588],"category_scores_gemma":[0.000055481596,0.00034396048,0.00014894923,0.00018607137,0.00013401224,0.00038859496,0.0000041360418,0.0006116864,0.000014180875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011090511,0.002138265,0.0003031276,0.0006530132,0.004515349,0.0002192324,0.0013605455,0.15820527,0.082956076,0.013134042,0.00031535118,0.7251092],"study_design_scores_gemma":[0.021901239,0.0032274276,0.00012215579,0.00030318444,0.00030645792,0.0002955566,0.00021347846,0.9429301,0.028382411,0.00001952108,0.001582695,0.00071580085],"about_ca_topic_score_codex":0.00022317468,"about_ca_topic_score_gemma":0.00072973775,"teacher_disagreement_score":0.94182295,"about_ca_system_score_codex":0.0008709125,"about_ca_system_score_gemma":0.00049423525,"threshold_uncertainty_score":0.99990124},"labels":[],"label_agreement":null},{"id":"W2592836035","doi":"10.1177/0142331216686157","title":"A generalized hierarchical nearly cyclic pursuit for the leader-following consensus problem in multi-agent systems","year":2017,"lang":"en","type":"article","venue":"Transactions of the Institute of Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Rendezvous; Convergence (economics); Multi-agent system; Computer science; Point (geometry); Mathematical optimization; Layer (electronics); Control theory (sociology); Mathematics; Artificial intelligence; Control (management); Engineering; Economics","score_opus":0.08115520522091275,"score_gpt":0.27647755895779463,"score_spread":0.1953223537368819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592836035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026358582,0.0016805093,0.9590676,0.006815088,0.002752756,0.0031713464,0.000056776327,0.00003736068,0.000059990492],"genre_scores_gemma":[0.9971851,0.000014972886,0.002153365,0.0000379896,0.00003383406,0.00039319845,5.006421e-7,0.000010220995,0.00017082496],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977836,0.00017332529,0.0006751225,0.00032370107,0.000726535,0.0003177136],"domain_scores_gemma":[0.99807286,0.00012594959,0.00044619353,0.0010680278,0.0002126853,0.00007428531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001812254,0.00021110354,0.00048963085,0.00008233932,0.00068669155,0.0002639333,0.0016721552,0.00008869949,6.7018226e-7],"category_scores_gemma":[0.00014611967,0.0001351942,0.00033825528,0.00010661574,0.0002810456,0.00029357153,0.000033383734,0.00019088064,8.1947474e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021259596,0.0032863563,0.013567013,0.002158739,0.008002322,0.000043065116,0.0057389596,0.278823,0.51093054,0.0688582,0.0005899562,0.10587588],"study_design_scores_gemma":[0.04174858,0.00031701298,0.02404503,0.0011761,0.0008447796,0.000032363947,0.00026138593,0.9146474,0.0044926615,0.00046004073,0.011280147,0.00069447013],"about_ca_topic_score_codex":0.0015581847,"about_ca_topic_score_gemma":0.00080201594,"teacher_disagreement_score":0.9708265,"about_ca_system_score_codex":0.00008650956,"about_ca_system_score_gemma":0.00019184857,"threshold_uncertainty_score":0.55130595},"labels":[],"label_agreement":null},{"id":"W2593363552","doi":"10.1007/s12555-015-0242-5","title":"A novel leader following consensus approach for multi-agent systems with data loss","year":2017,"lang":"en","type":"article","venue":"International Journal of Control Automation and Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science","score_opus":0.10206941746889107,"score_gpt":0.332838294274041,"score_spread":0.2307688768051499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593363552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005055701,0.0008897409,0.98724306,0.0011637551,0.004310738,0.00089683104,0.00025068526,0.00005994446,0.00012952462],"genre_scores_gemma":[0.9808703,0.000005518301,0.018209513,0.000063083666,0.0005262344,0.000052722273,0.000030016536,0.000017976487,0.00022460424],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971172,0.00014262216,0.0010565129,0.00039630465,0.0010197388,0.00026762203],"domain_scores_gemma":[0.9953547,0.00024148551,0.0021718026,0.00088961644,0.0011692131,0.00017317703],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020963782,0.00023850834,0.00060024613,0.00021607497,0.00029220877,0.0025314668,0.002836166,0.00010187852,5.627556e-7],"category_scores_gemma":[0.00047260989,0.00017929188,0.00014106427,0.000045971225,0.00007046409,0.0013392022,0.00016320727,0.00014619491,0.000002702521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004852708,0.006506636,0.11550367,0.0034383433,0.048622236,0.0031365047,0.008680214,0.3606154,0.041470684,0.31000164,0.017972754,0.0791992],"study_design_scores_gemma":[0.0118534705,0.0000901072,0.0042329533,0.00030448378,0.00007725738,0.0012285855,0.00027199707,0.97718817,0.000007127967,0.0000059624335,0.0045348457,0.00020505198],"about_ca_topic_score_codex":0.00016266723,"about_ca_topic_score_gemma":0.000008276105,"teacher_disagreement_score":0.97581464,"about_ca_system_score_codex":0.00012838177,"about_ca_system_score_gemma":0.00018856693,"threshold_uncertainty_score":0.998504},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.018738983805135414,"score_gpt":0.2490524632874625,"score_spread":0.23031347948232708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2598136971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031721485,0.0004583408,0.9873064,0.00078418775,0.002695241,0.004350216,0.0002765027,0.0008571952,0.00009977461],"genre_scores_gemma":[0.9954101,0.000018051758,0.0013514122,0.000060962833,0.00006369099,0.0027274028,0.0000016959197,0.000047219404,0.00031945843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99577034,0.0005507988,0.001234886,0.0010325067,0.0005698879,0.0008415676],"domain_scores_gemma":[0.9941028,0.0007357033,0.0010775701,0.0031236883,0.0007692455,0.00019103952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008913814,0.0005768004,0.0015023331,0.00065747986,0.00095800037,0.0003878735,0.0031344006,0.0006548565,0.000010353687],"category_scores_gemma":[0.00014301014,0.0005262124,0.00029275665,0.00033886978,0.0004170561,0.0007220572,0.000011832125,0.0006070266,0.0001562335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003870462,0.00072057906,0.00017862211,0.00007258938,0.0009401279,0.00008844649,0.00019850065,0.8904312,0.088189945,0.0030595989,0.00016563047,0.015567673],"study_design_scores_gemma":[0.014341483,0.0009787551,0.00008061564,0.0002050239,0.000120780096,0.00008921546,0.00014425856,0.9667195,0.016118571,0.000054415377,0.00061182695,0.0005355666],"about_ca_topic_score_codex":0.0004095324,"about_ca_topic_score_gemma":0.00011706447,"teacher_disagreement_score":0.992238,"about_ca_system_score_codex":0.00022053748,"about_ca_system_score_gemma":0.00022037004,"threshold_uncertainty_score":0.99971896},"labels":[],"label_agreement":null},{"id":"W2599937082","doi":"10.1109/tcns.2017.2690403","title":"Adaptive Consensus in Leader-Following Networks of Heterogeneous Linear Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Program for New Century Excellent Talents in University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Synchronizing; Network topology; Multi-agent system; Computer science; Consensus; State (computer science); Synchronization (alternating current); Protocol (science); Topology (electrical circuits); Distributed computing; Adaptation (eye); Control theory (sociology); Mathematical optimization; Mathematics; Control (management); Artificial intelligence; Computer network; Algorithm","score_opus":0.030452196941930656,"score_gpt":0.25420952019745885,"score_spread":0.2237573232555282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2599937082","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077227275,0.0026115822,0.9778125,0.00010278466,0.009393783,0.0018244962,0.00009209352,0.00013927803,0.0003007069],"genre_scores_gemma":[0.99883044,0.000023959152,0.0003360086,0.000023371984,0.00037312944,0.00022558468,0.0000019212268,0.000047052283,0.000138538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950149,0.00077282876,0.001812495,0.00076770905,0.00075368065,0.0008783654],"domain_scores_gemma":[0.9948428,0.00089590065,0.0015882131,0.0021413905,0.00031225313,0.00021938661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014989101,0.0005003474,0.0016583544,0.00026691647,0.00040201834,0.0002426617,0.0018362162,0.00037406138,0.0000017975043],"category_scores_gemma":[0.000033104036,0.0004943273,0.000570748,0.00036754177,0.00018029654,0.00034131145,0.000010755636,0.00046998382,0.000016059563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021432852,0.00017889233,0.0004711418,0.00008406834,0.0005575245,0.00012060095,0.00010331271,0.9957967,0.0003564757,0.00071112055,0.000067382935,0.0013384834],"study_design_scores_gemma":[0.0045473874,0.00037115964,0.00028501722,0.0011349906,0.00010975011,0.000057405647,0.00010498191,0.9926988,0.0001316598,0.000009656433,0.00015857909,0.00039065204],"about_ca_topic_score_codex":0.001509427,"about_ca_topic_score_gemma":0.00023638761,"teacher_disagreement_score":0.9911077,"about_ca_system_score_codex":0.00018555285,"about_ca_system_score_gemma":0.00014885706,"threshold_uncertainty_score":0.99975085},"labels":[],"label_agreement":null},{"id":"W2603146773","doi":"10.21535/proicius.2014.v10.242","title":"Tactic Switching For Multiple UAV Teams via Model Predictive Control","year":2014,"lang":"en","type":"article","venue":"Proceedings of International Conference on Intelligent Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Model predictive control; Robustness (evolution); Computer science; Control (management); Control engineering; Stability (learning theory); Control theory (sociology); Linearization; Engineering; Nonlinear system; Artificial intelligence; Machine learning","score_opus":0.027636267289579988,"score_gpt":0.26645499706336034,"score_spread":0.23881872977378035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2603146773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005714712,0.00003316641,0.978337,0.00069680024,0.0019025338,0.0017041004,0.000113214184,0.00025666272,0.011241794],"genre_scores_gemma":[0.99604034,0.00001530267,0.002277291,0.00013170711,0.00032972606,0.00067602575,0.000023468032,0.000037345926,0.00046879888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623233,0.00004022819,0.0012072831,0.0009051315,0.0010718827,0.0005431223],"domain_scores_gemma":[0.9950132,0.00045543475,0.001139286,0.0003320528,0.0028362083,0.00022385264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012839864,0.00044795603,0.0006822712,0.00042942548,0.00016184822,0.0005619347,0.0023378765,0.00019268192,0.0000060723455],"category_scores_gemma":[0.0009894738,0.00041301412,0.0002649189,0.00020817976,0.00005572828,0.000984062,0.00015867669,0.00028464975,0.000047513135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00060043304,0.00043984022,0.0018251595,0.00031750658,0.0005617061,9.162463e-7,0.0010653716,0.03731781,0.04198749,0.9099609,0.00101774,0.0049050776],"study_design_scores_gemma":[0.0016351426,0.00052257336,0.0000586645,0.0004972329,0.000032209366,0.000012383471,0.0004657782,0.9821054,0.008238755,0.005181365,0.000879396,0.00037112343],"about_ca_topic_score_codex":0.000093747614,"about_ca_topic_score_gemma":0.0000039414244,"teacher_disagreement_score":0.9903256,"about_ca_system_score_codex":0.00032825852,"about_ca_system_score_gemma":0.000098554774,"threshold_uncertainty_score":0.99983215},"labels":[],"label_agreement":null},{"id":"W2604292427","doi":"10.1016/j.automatica.2017.09.016","title":"Distributed Nash equilibrium seeking in networked graphical games","year":2017,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Best response; Mathematical optimization; Graph; Computer science; Correlated equilibrium; Convergence (economics); Epsilon-equilibrium; Game theory; Adjacency matrix; Gossip; Distributed algorithm; Mathematical economics; Theoretical computer science; Equilibrium selection; Mathematics; Repeated game; Distributed computing; Economics","score_opus":0.01672577432875929,"score_gpt":0.2643119245474964,"score_spread":0.24758615021873712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604292427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22124779,0.00014089045,0.7601885,0.010718607,0.0016414444,0.0007936294,0.00004065349,0.0012368807,0.0039916],"genre_scores_gemma":[0.9952653,0.0000029091998,0.0043306043,0.00013071904,0.000102985025,0.000058001428,0.000020053978,0.000015545651,0.000073857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758756,0.00017188877,0.00056529214,0.00053411035,0.00044664697,0.00069450634],"domain_scores_gemma":[0.9971878,0.00022183493,0.00033920462,0.0020176654,0.00006764703,0.00016584112],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006803945,0.00024465338,0.0004368263,0.0001154038,0.00024580237,0.0010538067,0.0027250266,0.00014300873,0.0000117292775],"category_scores_gemma":[0.00045719632,0.00022841607,0.00013258289,0.00030329268,0.00013238062,0.0008858895,0.0007055778,0.00022401942,0.00013735445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090369744,0.0012370872,0.16042472,0.00053935515,0.0006487923,0.002033579,0.0023847008,0.0026864612,0.011356128,0.67490274,0.0349932,0.10870287],"study_design_scores_gemma":[0.0009743088,0.000028603501,0.18790162,0.00015291154,0.000009155267,0.000016476031,0.000012940201,0.80357677,0.00007005642,0.004709413,0.0022622624,0.0002854734],"about_ca_topic_score_codex":0.00009646172,"about_ca_topic_score_gemma":0.000041860527,"teacher_disagreement_score":0.8008903,"about_ca_system_score_codex":0.00009391558,"about_ca_system_score_gemma":0.000081392165,"threshold_uncertainty_score":0.9999832},"labels":[],"label_agreement":null},{"id":"W2604511647","doi":"10.1177/1059712317700500","title":"Optimal distributed interconnectivity of multi-robot systems by spatially-constrained clustering","year":2017,"lang":"en","type":"article","venue":"Adaptive Behavior","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Interconnectivity; Computer science; Cluster analysis; Flocking (texture); Distributed computing; Swarm behaviour; Robot; Set (abstract data type); Coherence (philosophical gambling strategy); Probabilistic logic; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.04491536175323776,"score_gpt":0.2869754533297277,"score_spread":0.24206009157648992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2604511647","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13376814,0.000098829674,0.86280495,0.000081973296,0.001126718,0.0009478095,0.00088718097,0.00017669778,0.00010772997],"genre_scores_gemma":[0.99027973,0.000002135056,0.009188382,0.0000075908692,0.000056606856,0.00024114214,0.00005493475,0.000025876714,0.00014359297],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973044,0.00021293778,0.0006950194,0.0007660677,0.00045012345,0.0005714868],"domain_scores_gemma":[0.996649,0.00013380537,0.0009246049,0.0017032122,0.00035718732,0.00023214836],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052694,0.00038931097,0.0006845429,0.0000908558,0.00038811626,0.000511617,0.0023396653,0.00018250493,0.000009703931],"category_scores_gemma":[0.00023882545,0.00038516687,0.0002121461,0.00011412842,0.00027793087,0.0011254493,0.0007883505,0.00025457036,0.000030698866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063207914,0.0072184904,0.09039572,0.00040363477,0.0013823184,0.001130707,0.0030699947,0.02556512,0.7329212,0.016963176,0.0018342994,0.11848329],"study_design_scores_gemma":[0.0056764986,0.00058075174,0.111806974,0.0003600873,0.0001772852,0.000086754,0.00037273386,0.8631946,0.01630341,0.000005875846,0.00035955317,0.0010754714],"about_ca_topic_score_codex":0.0025007008,"about_ca_topic_score_gemma":0.0001947603,"teacher_disagreement_score":0.8565116,"about_ca_system_score_codex":0.00019534085,"about_ca_system_score_gemma":0.000103801605,"threshold_uncertainty_score":0.99986005},"labels":[],"label_agreement":null},{"id":"W2605840666","doi":"10.1049/iet-cta.2017.0893","title":"Distributed coordination for a class of non‐linear multi‐agent systems with regulation constraints","year":2017,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Class (philosophy); Control theory (sociology); Computer science; Multi-agent system; Distributed computing; Control engineering; Control (management); Engineering; Artificial intelligence","score_opus":0.014521880988612049,"score_gpt":0.2679211029152377,"score_spread":0.2533992219266256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2605840666","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021134864,0.000080157144,0.9934849,0.0004961329,0.00009499288,0.0026740448,0.00078821793,0.000074926436,0.00019314901],"genre_scores_gemma":[0.9953402,0.0000025094705,0.002658108,0.000028195776,0.000084179235,0.0016248301,0.000101784244,0.0000111155405,0.00014907273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987091,0.00012444088,0.00038506056,0.0003921477,0.0001700848,0.00021915721],"domain_scores_gemma":[0.9974968,0.00041165203,0.00063268567,0.0009310942,0.00042541773,0.00010234466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009835211,0.00016873814,0.00032329484,0.000055606528,0.00055436854,0.00022777989,0.00062168273,0.000090470065,0.0000015880124],"category_scores_gemma":[0.0001348628,0.00014401761,0.000066871246,0.000088864195,0.00029809706,0.00036225762,0.000048593993,0.00006840967,0.000004968251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018050199,0.00019133925,0.0008157306,0.00010918836,0.00017644704,8.59647e-7,0.00009987701,0.0021139556,0.009732229,0.96901584,0.000100279445,0.017463729],"study_design_scores_gemma":[0.00972924,0.00017091658,0.015684519,0.00012631307,0.00014814951,0.000017963841,0.00019278387,0.96051186,0.00083397946,0.005358662,0.0068660434,0.00035959238],"about_ca_topic_score_codex":0.000015963993,"about_ca_topic_score_gemma":0.0000047260414,"teacher_disagreement_score":0.9932267,"about_ca_system_score_codex":0.000037236943,"about_ca_system_score_gemma":0.00005848083,"threshold_uncertainty_score":0.5872868},"labels":[],"label_agreement":null},{"id":"W2607028134","doi":"10.1142/s2301385017500030","title":"Multi-Target Engagement in Complex Mobile Surveillance Sensor Networks","year":2017,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Government of Ontario","keywords":"Flocking (texture); Computer science; Wireless sensor network; Key (lock); Task (project management); Real-time computing; Distributed computing; Set (abstract data type); Computer network; Engineering; Computer security","score_opus":0.04883913914388759,"score_gpt":0.2892123529593928,"score_spread":0.2403732138155052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607028134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028508415,0.0014375267,0.9558499,0.0004594219,0.0062381746,0.0036603834,0.000113901864,0.00066528824,0.003067013],"genre_scores_gemma":[0.9942556,0.000017129316,0.003949791,0.000064682084,0.00032513207,0.00039770218,0.00004853474,0.000032298838,0.0009091527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595004,0.0008069343,0.00088388176,0.0009194811,0.00052613235,0.0009135186],"domain_scores_gemma":[0.9958659,0.00019747774,0.000692104,0.0028422344,0.00018141294,0.00022086586],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023656406,0.0003927178,0.00074009417,0.00016877592,0.0006308681,0.0013018061,0.0029755873,0.0001773315,0.000012873727],"category_scores_gemma":[0.00019041046,0.00037780718,0.00014365291,0.00021035678,0.00008083859,0.0006058701,0.0005716591,0.00033265975,0.00025113704],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000086552536,0.0011245012,0.34187376,0.00046711488,0.00040320223,0.00094664935,0.002241107,0.6158915,0.0046932166,0.0071875327,0.020302381,0.0047824346],"study_design_scores_gemma":[0.0020699096,0.000058259302,0.06990692,0.00009458795,0.0000029735804,0.000015757398,0.00015678062,0.89398175,0.00002595248,0.0000066580164,0.033261962,0.0004185084],"about_ca_topic_score_codex":0.0010336117,"about_ca_topic_score_gemma":0.00024459272,"teacher_disagreement_score":0.9657472,"about_ca_system_score_codex":0.00023293497,"about_ca_system_score_gemma":0.000051573825,"threshold_uncertainty_score":0.9998674},"labels":[],"label_agreement":null},{"id":"W2608113110","doi":"10.1090/crmp/029/19","title":"Superposition formulas based on nonprimitive group action","year":2001,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Group (periodic table); Action (physics); Superposition principle; Mathematics; Pure mathematics; Algebra over a field; Physics; Mathematical analysis; Quantum mechanics","score_opus":0.0236786111447174,"score_gpt":0.2379780115934809,"score_spread":0.2142994004487635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2608113110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011600226,0.0001572001,0.5452383,0.0011820227,0.000856909,0.0010167243,0.00004900722,0.0007143862,0.4506694],"genre_scores_gemma":[0.9954922,0.00003517948,0.00059780636,0.0013703993,0.0012291871,0.00011831839,0.0002488613,0.00012266944,0.00078536465],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965134,0.000013270961,0.0005474952,0.0013275468,0.00095934194,0.0006389428],"domain_scores_gemma":[0.9979025,0.00023787282,0.00055969757,0.0004757863,0.00060237,0.00022175364],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028332605,0.00087518594,0.0006969815,0.000518211,0.00033152406,0.0006643388,0.0010101001,0.00094661285,0.0000749217],"category_scores_gemma":[0.00016659645,0.00082296773,0.00039805978,0.00020885258,0.00006680338,0.0007382033,0.00012236476,0.00095492316,0.00025460112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017378671,0.00012887048,0.00006222271,0.00025758962,0.00016954975,0.00005106181,0.00038643333,0.00026687188,0.0056811217,0.9265433,0.0005058249,0.06577337],"study_design_scores_gemma":[0.0054967226,0.0032193365,0.0007636393,0.004579149,0.00068143476,0.0003141553,0.00003970825,0.20293953,0.022111986,0.4994369,0.25509456,0.005322912],"about_ca_topic_score_codex":0.000023755585,"about_ca_topic_score_gemma":0.000013455781,"teacher_disagreement_score":0.9953762,"about_ca_system_score_codex":0.000655101,"about_ca_system_score_gemma":0.00010845835,"threshold_uncertainty_score":0.99942213},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014495152891417657,"score_gpt":0.23964850082609654,"score_spread":0.2251533479346789,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611964096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033206202,0.000013754698,0.99028605,0.0008660582,0.0018588405,0.0013688629,0.000038310423,0.0012581099,0.0009894182],"genre_scores_gemma":[0.9865296,1.6755361e-7,0.010312917,0.0022005201,0.00021769769,0.0005093645,0.0000025737588,0.000040648396,0.00018652104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967302,0.00034311513,0.00064301485,0.0007995789,0.00067775184,0.0008063249],"domain_scores_gemma":[0.9974212,0.00044255023,0.00020592152,0.0013775467,0.00018060686,0.0003721572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065073086,0.00040900888,0.00056831463,0.00034030972,0.00031028004,0.00048217614,0.0011648127,0.00017745035,0.000064789325],"category_scores_gemma":[0.000026497624,0.00039049715,0.00029332048,0.00096411916,0.00008578361,0.000438937,0.0000061798505,0.0002488453,0.00034006778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019904916,0.0022467533,0.00008092213,0.00016653858,0.0007138778,0.00003655774,0.0010979667,0.79024476,0.013828149,0.0017420663,0.003949217,0.18569416],"study_design_scores_gemma":[0.0032076165,0.0002484139,0.0004183644,0.00009895881,0.000066593486,0.000011544802,0.000011951607,0.99409616,0.00061758014,0.00002942829,0.0007864607,0.0004069234],"about_ca_topic_score_codex":0.000056867466,"about_ca_topic_score_gemma":0.000028660615,"teacher_disagreement_score":0.98320895,"about_ca_system_score_codex":0.00023215746,"about_ca_system_score_gemma":0.00015866844,"threshold_uncertainty_score":0.9998547},"labels":[],"label_agreement":null},{"id":"W2617870061","doi":"10.1007/s10514-018-9807-5","title":"Decentralized progressive shape formation with robot swarms","year":2018,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Computer science; Swarm behaviour; Convergence (economics); Point cloud; Graph; Set (abstract data type); Point (geometry); Algorithm; Artificial intelligence; Theoretical computer science; Mathematics; Geometry","score_opus":0.014465330343236323,"score_gpt":0.2415824021459521,"score_spread":0.2271170718027158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617870061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014378194,0.00023434017,0.9797835,0.001118524,0.000592154,0.0009225494,0.000007073872,0.0007643853,0.0021993034],"genre_scores_gemma":[0.96250916,0.0000035197506,0.036635824,0.0003306694,0.00014738443,0.00012762642,0.000027436885,0.000021693335,0.00019670294],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978883,0.000097098025,0.0004475777,0.00052098907,0.00039954338,0.00064647774],"domain_scores_gemma":[0.9983196,0.000043952994,0.0003600575,0.0007801801,0.0002977278,0.00019843322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023831027,0.00026947205,0.00030001026,0.00010874399,0.00024647856,0.0004121028,0.0010395029,0.00009634913,0.00006265847],"category_scores_gemma":[0.000035530615,0.00021459683,0.0000724313,0.00045620228,0.00010765733,0.0013101994,0.00016523877,0.00011714523,0.00066364097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005822309,0.0017100876,0.007268993,0.00028868736,0.0010170467,0.00084234035,0.015891638,0.019745925,0.017178817,0.10992951,0.016124664,0.80942005],"study_design_scores_gemma":[0.004256097,0.0008133458,0.00839008,0.00017988989,0.000049634127,0.00032901482,0.00008153252,0.95621234,0.013356242,0.0005258331,0.014936331,0.00086962944],"about_ca_topic_score_codex":0.000038590977,"about_ca_topic_score_gemma":0.000031226093,"teacher_disagreement_score":0.94813097,"about_ca_system_score_codex":0.0001887815,"about_ca_system_score_gemma":0.00016090694,"threshold_uncertainty_score":0.8751005},"labels":[],"label_agreement":null},{"id":"W2621264432","doi":"10.1007/s11432-016-9074-8","title":"Fault-tolerant cooperative control for multiple UAVs based on sliding mode techniques","year":2017,"lang":"en","type":"article","venue":"Science China Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Fault (geology); Loop (graph theory); Fault tolerance; Inner loop; Control (management); Mode (computer interface); Sliding mode control; Computer science; Scheme (mathematics); Control engineering; Engineering; Controller (irrigation); Distributed computing; Artificial intelligence; Mathematics","score_opus":0.025845338190821094,"score_gpt":0.3160644859902453,"score_spread":0.2902191477994242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2621264432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01156256,0.000005130783,0.9754216,0.0021110328,0.00094216893,0.001395433,0.00009555577,0.0003436332,0.008122905],"genre_scores_gemma":[0.97827375,0.000001332113,0.020648742,0.0007242093,0.00005544306,0.0002583727,0.000005602411,0.000004066448,0.000028455117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964654,0.00006246239,0.00061019615,0.00059880654,0.0015144226,0.0007487008],"domain_scores_gemma":[0.99687564,0.00029900525,0.0007897307,0.0011492012,0.00066729775,0.00021910248],"candidate_categories":["sts","scholarly_communication","open_science"],"consensus_categories":["scholarly_communication"],"category_scores_codex":[0.0046288683,0.0002708481,0.00031146154,0.0005609946,0.0055670803,0.0057442514,0.0055962945,0.000073008334,0.000003871067],"category_scores_gemma":[0.0028633936,0.00020391584,0.00011151617,0.0007862564,0.0010887734,0.015486115,0.00022898839,0.00014359511,0.000053779728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021227243,0.0003603051,0.017725555,0.00013512782,0.000032806587,0.000005321697,0.009493277,0.3540287,0.020813756,0.34949902,0.0019566605,0.24573718],"study_design_scores_gemma":[0.001094541,0.00027428175,0.004811444,0.00007412213,0.000003128951,0.0000032692315,0.00017523368,0.97953737,0.011301624,0.00041213934,0.0020233276,0.0002895083],"about_ca_topic_score_codex":0.00016275398,"about_ca_topic_score_gemma":0.000022200957,"teacher_disagreement_score":0.9667112,"about_ca_system_score_codex":0.00019437919,"about_ca_system_score_gemma":0.000763171,"threshold_uncertainty_score":0.99978393},"labels":[],"label_agreement":null},{"id":"W2669700205","doi":"10.1109/icassp.2017.7952768","title":"Event-based consensus for a class of heterogeneous multi-agent systems: An LMI approach","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Computer science; Lyapunov stability; Linear matrix inequality; Multi-agent system; Controller (irrigation); Control theory (sociology); Transmission (telecommunications); Stability (learning theory); Event (particle physics); Scheme (mathematics); Reduction (mathematics); Class (philosophy); Exponential stability; Consensus; Lyapunov function; Mathematical optimization; Mathematics; Control (management); Artificial intelligence; Nonlinear system","score_opus":0.06603935929899374,"score_gpt":0.3076710105768636,"score_spread":0.24163165127786984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2669700205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014793574,0.00014161483,0.98117703,0.00022788855,0.0009995329,0.0018960232,0.0001690408,0.00022070727,0.00037458222],"genre_scores_gemma":[0.96475846,6.1355473e-7,0.034268416,0.00007068852,0.00007316032,0.00033666403,0.000031205273,0.000024804382,0.00043597753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734634,0.00021243091,0.00071621523,0.0007563242,0.00043219255,0.00053648005],"domain_scores_gemma":[0.9957364,0.00014146793,0.00074190064,0.0027226345,0.00039077536,0.0002668127],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077600207,0.00030235935,0.0005672352,0.00010812561,0.00037009094,0.0005518373,0.0023898084,0.00015406814,0.0000024552523],"category_scores_gemma":[0.00017720516,0.00026280445,0.00025476512,0.000073963434,0.00013341714,0.00024663148,0.00018775434,0.00008428647,0.000018672343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009004496,0.011781539,0.010881125,0.004715007,0.0022907346,0.00035072796,0.0018012103,0.7039479,0.065822795,0.16162005,0.009654988,0.02623348],"study_design_scores_gemma":[0.003545314,0.00022223331,0.00041677183,0.000047627647,0.000028072662,0.000027645727,0.00007765622,0.99034077,0.0032939606,0.00001456812,0.0016814679,0.0003039101],"about_ca_topic_score_codex":0.00048736215,"about_ca_topic_score_gemma":0.000058674606,"teacher_disagreement_score":0.9499649,"about_ca_system_score_codex":0.00010168295,"about_ca_system_score_gemma":0.00018390431,"threshold_uncertainty_score":0.9999824},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.055969447800956265,"score_gpt":0.28792690524596326,"score_spread":0.231957457445007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2676821827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029560255,0.00014680634,0.990378,0.0007202383,0.0007667757,0.004842993,0.000043333555,0.00013461783,0.000011175445],"genre_scores_gemma":[0.99492633,0.000022141712,0.0013181594,0.000042859843,0.00012107605,0.0034659645,0.0000020354541,0.00002591417,0.000075516684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997565,0.00037601843,0.0005851918,0.0005970512,0.00028023787,0.0005965547],"domain_scores_gemma":[0.9980194,0.00048997474,0.00038815165,0.000885691,0.00010222182,0.00011455047],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001244563,0.00030187203,0.0005123531,0.0001504936,0.0008819297,0.0005763491,0.0011275688,0.0002806102,5.238504e-7],"category_scores_gemma":[0.00006299218,0.00023117452,0.00020577134,0.00015130521,0.0000853129,0.00032401455,0.0000073349324,0.0005306926,0.000008346054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010779775,0.0013212741,0.000049900602,0.00014453045,0.001387263,0.000028549273,0.0023104798,0.67529064,0.013023947,0.09374794,0.00028277378,0.20163292],"study_design_scores_gemma":[0.017053781,0.00021273199,0.0000032761582,0.00006782711,0.00006447093,0.000024991365,0.000041465515,0.973522,0.007891036,0.00013599171,0.00074785174,0.00023458728],"about_ca_topic_score_codex":0.00050285255,"about_ca_topic_score_gemma":0.00040878792,"teacher_disagreement_score":0.9919703,"about_ca_system_score_codex":0.0006593314,"about_ca_system_score_gemma":0.00023661593,"threshold_uncertainty_score":0.94270235},"labels":[],"label_agreement":null},{"id":"W2716029941","doi":"10.1016/j.isatra.2017.06.008","title":"Distributed reconfigurable control strategies for switching topology networked multi-agent systems","year":2017,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control reconfiguration; Actuator; Fault tolerance; Network topology; Fault (geology); Control theory (sociology); Multi-agent system; Convex hull; Fault detection and isolation; Computer science; Lyapunov function; Controller (irrigation); Control (management); Control engineering; Engineering; Topology (electrical circuits); Distributed computing; Regular polygon; Computer network; Embedded system","score_opus":0.04055001124925723,"score_gpt":0.2888309478083197,"score_spread":0.24828093655906247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2716029941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00090975506,0.00028570424,0.9888199,0.0018805402,0.005029567,0.0014778194,0.00054512505,0.0004400153,0.000611587],"genre_scores_gemma":[0.99553305,0.00001533487,0.0027680872,0.00007536242,0.00021421061,0.0007235928,0.00003914996,0.000027158392,0.0006040328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974537,0.00017437695,0.00064759847,0.0006876975,0.00023639324,0.0008002168],"domain_scores_gemma":[0.99717164,0.00032156473,0.00046252608,0.001551181,0.00025949473,0.00023359126],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00058430433,0.00034015565,0.0005721915,0.000096864416,0.001870406,0.0018763975,0.0017294779,0.00022099796,0.000022079908],"category_scores_gemma":[0.00006741191,0.00033145715,0.0002962809,0.00011443944,0.00009277665,0.0014762144,0.000014283393,0.0002753682,0.000055943572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004758571,0.0018539355,0.0012610416,0.00069870614,0.0033621741,0.00016984798,0.003056227,0.67064905,0.028831461,0.21506362,0.0076375543,0.066940546],"study_design_scores_gemma":[0.005385351,0.00011817805,0.001329459,0.000087902816,0.00012317365,0.000051503124,0.0005963259,0.96332043,0.00020054013,0.00059342495,0.027681824,0.0005118774],"about_ca_topic_score_codex":0.001304476,"about_ca_topic_score_gemma":0.000529475,"teacher_disagreement_score":0.9946233,"about_ca_system_score_codex":0.00016237951,"about_ca_system_score_gemma":0.00020851355,"threshold_uncertainty_score":0.99991375},"labels":[],"label_agreement":null},{"id":"W2734748966","doi":"10.1016/j.sysconle.2017.06.002","title":"Distributed cooperative control of leader–follower multi-agent systems under packet dropouts for quadcopters","year":2017,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Alexander von Humboldt-Stiftung","keywords":"Multi-agent system; Control theory (sociology); Computer science; Dropout (neural networks); Bernoulli distribution; Linear matrix inequality; Network packet; Lyapunov stability; Network topology; Stability (learning theory); Exponential stability; Bernoulli's principle; Mathematical optimization; Distributed computing; Mathematics; Control (management); Random variable; Engineering; Nonlinear system; Computer network","score_opus":0.03166598657348789,"score_gpt":0.2746903312905414,"score_spread":0.24302434471705348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2734748966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019338323,0.0011239415,0.9552392,0.0057523884,0.0081310235,0.007569848,0.0023770006,0.00037630898,0.0000920029],"genre_scores_gemma":[0.99611914,0.0000050225913,0.00036116605,0.0008794418,0.0004538014,0.0015705707,0.00012485546,0.00009698222,0.0003889915],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925697,0.00094536715,0.0020908555,0.0015989861,0.001209634,0.0015854675],"domain_scores_gemma":[0.99158156,0.0008137549,0.002557806,0.0035368514,0.000979905,0.0005301484],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020280234,0.0009980322,0.0023812465,0.0002875,0.0008650934,0.0019008745,0.0036895538,0.0003837323,0.000007606856],"category_scores_gemma":[0.00043359763,0.0008900582,0.0007721646,0.00023496995,0.00038638245,0.0013629124,0.00019962605,0.0003878514,0.00015065538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024333945,0.002131081,0.052800063,0.0035200026,0.014427716,0.0005574701,0.0030557008,0.2691727,0.48023057,0.13110624,0.039158735,0.0014063021],"study_design_scores_gemma":[0.04994223,0.0005726356,0.008258583,0.0010897956,0.00047765352,0.00006961872,0.0014424055,0.9232036,0.0005383162,0.000016729553,0.012369344,0.0020190985],"about_ca_topic_score_codex":0.0015364414,"about_ca_topic_score_gemma":0.000064212916,"teacher_disagreement_score":0.97678083,"about_ca_system_score_codex":0.0005771533,"about_ca_system_score_gemma":0.00022622336,"threshold_uncertainty_score":0.999355},"labels":[],"label_agreement":null},{"id":"W2737347465","doi":"10.1080/00207179.2017.1293847","title":"Output consensus control of multi-agent systems with nonlinear non-minimum phase dynamics","year":2017,"lang":"en","type":"article","venue":"International Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Western University","funders":"","keywords":"Minimum phase; Control theory (sociology); Nonlinear system; Consensus; Multi-agent system; Term (time); Function (biology); Protocol (science); Computer science; Mathematics; Stability (learning theory); Phase (matter); Mathematical optimization; Control (management); Artificial intelligence; Physics","score_opus":0.018694659651295544,"score_gpt":0.2975448657342187,"score_spread":0.27885020608292316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737347465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041910745,0.00030175206,0.9490992,0.0029249522,0.0044109463,0.0005588158,0.0004749648,0.000027564509,0.0002910607],"genre_scores_gemma":[0.9954516,0.000010827289,0.0035921452,0.00013783944,0.00058253447,0.000015521498,0.0000067960896,0.000023862327,0.00017884861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996244,0.00017461438,0.0014603665,0.00031925604,0.0014343319,0.00036739715],"domain_scores_gemma":[0.9915053,0.000388795,0.0037833757,0.0008564281,0.00319387,0.0002722078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011267554,0.0003181994,0.00089732266,0.0003148616,0.00015059544,0.0006817921,0.0036138562,0.00012044869,0.000005112524],"category_scores_gemma":[0.00054969307,0.0002479842,0.00033438613,0.00006379046,0.00019799819,0.000621408,0.00011698863,0.00032759132,0.000020012694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.033534836,0.023146844,0.15993205,0.0007147566,0.05312546,0.027906692,0.003992282,0.28947216,0.08297985,0.08635701,0.0077589024,0.23107915],"study_design_scores_gemma":[0.042512823,0.00062648224,0.0022199573,0.00032212917,0.00013235584,0.000619021,0.000087260334,0.9514002,0.0001905307,0.000028229544,0.0016118033,0.00024916505],"about_ca_topic_score_codex":0.00013368807,"about_ca_topic_score_gemma":0.000030264302,"teacher_disagreement_score":0.95354086,"about_ca_system_score_codex":0.00027359807,"about_ca_system_score_gemma":0.0004402558,"threshold_uncertainty_score":0.99999726},"labels":[],"label_agreement":null},{"id":"W27377570","doi":"10.1002/adhm.201600445","title":"Plenary lecture III: opposition-based computation","year":2008,"lang":"en","type":"article","venue":"Advanced Healthcare Materials","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Opposition (politics); Computation; Computer science; Dialectic; Artificial intelligence; Algorithm; Epistemology; Political science; Philosophy; Law","score_opus":0.02378875268068276,"score_gpt":0.2793636435411475,"score_spread":0.25557489086046475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27377570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18210293,0.00037100897,0.8084631,0.0052006473,0.0020174088,0.0009221153,0.00015232516,0.0006966172,0.00007386136],"genre_scores_gemma":[0.97772086,0.000020873069,0.019673202,0.001921823,0.00016721064,0.00013923307,0.00030724067,0.000023509167,0.000026043755],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99759215,0.00032843335,0.00061218394,0.00056791847,0.00039728923,0.0005020332],"domain_scores_gemma":[0.99852294,0.00013279518,0.00031535092,0.0005587822,0.0002694229,0.00020073772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024700648,0.0002566507,0.00044038953,0.00012425013,0.00040445483,0.00009962907,0.0005256566,0.00013386697,0.000023475786],"category_scores_gemma":[0.000037833932,0.0002530847,0.00006779168,0.00032050846,0.000045833902,0.00049257185,0.000072326766,0.00010783653,0.00011394016],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050809595,0.00046927054,0.0007022158,0.0010325798,0.00011299728,0.0007810083,0.0023032683,0.059108026,0.8577281,0.01927287,0.0039619207,0.054019637],"study_design_scores_gemma":[0.018697519,0.0020137925,0.017777255,0.0012677133,0.000048975096,0.00082835054,0.00014139057,0.091611326,0.83693093,0.012567203,0.014571139,0.0035444172],"about_ca_topic_score_codex":0.00026823668,"about_ca_topic_score_gemma":0.000022650609,"teacher_disagreement_score":0.79561794,"about_ca_system_score_codex":0.00019852922,"about_ca_system_score_gemma":0.00027180932,"threshold_uncertainty_score":0.99999213},"labels":[],"label_agreement":null},{"id":"W2738508088","doi":"10.1109/iraniancee.2017.7985154","title":"Distributed accelerating convergence speed of second-order consensus using variable adjacency matrix","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Adjacency matrix; Convergence (economics); Eigenvalues and eigenvectors; Adjacency list; Lyapunov function; Variable (mathematics); Control theory (sociology); Mathematics; Graph; Integrator; Computer science; Function (biology); Strongly connected component; Directed graph; Stability (learning theory); Topology (electrical circuits); Algorithm; Discrete mathematics; Combinatorics; Mathematical analysis; Control (management); Telecommunications","score_opus":0.05106941300651447,"score_gpt":0.30240212688815094,"score_spread":0.25133271388163647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738508088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16904575,0.00011143117,0.8199112,0.0003161982,0.0015759869,0.0005599608,0.0002355058,0.00022767187,0.008016288],"genre_scores_gemma":[0.92364764,0.0000018243344,0.07521606,0.00004104881,0.00007035994,0.000004748078,0.000017347511,0.000015148208,0.0009858233],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99747056,0.0001208913,0.00078400125,0.0006054359,0.00043314043,0.00058600237],"domain_scores_gemma":[0.99620706,0.00017395464,0.00090580556,0.0019070958,0.00062167976,0.00018440932],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006428694,0.00028468334,0.0005219426,0.00008058761,0.0005737973,0.0006171846,0.002216309,0.00013912581,0.00046966845],"category_scores_gemma":[0.0006133845,0.00027134933,0.00010414384,0.0003118006,0.00013914058,0.0007496142,0.000632818,0.00017230361,0.000060105296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007428948,0.00049254566,0.054193255,0.00046986845,0.00053280697,0.00017277605,0.0005002523,0.008369523,0.5970978,0.32903066,0.006942633,0.0021235647],"study_design_scores_gemma":[0.0020933803,0.000054251756,0.007529174,0.000119010976,0.00003489566,0.0000607501,0.000108411296,0.96846795,0.018720808,0.0007285621,0.0015332176,0.0005495708],"about_ca_topic_score_codex":0.0009880402,"about_ca_topic_score_gemma":0.00004477501,"teacher_disagreement_score":0.96009845,"about_ca_system_score_codex":0.00008817871,"about_ca_system_score_gemma":0.0003310802,"threshold_uncertainty_score":0.9999739},"labels":[],"label_agreement":null},{"id":"W2738572842","doi":"10.1080/00207179.2017.1359422","title":"Neuro-adaptive cooperative tracking control with prescribed performance of unknown higher-order nonlinear multi-agent systems","year":2017,"lang":"en","type":"article","venue":"International Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Nonlinear system; Bounded function; Mathematical proof; Directed graph; Robust control; Strict-feedback form; Graph; Node (physics)","score_opus":0.02610351474372585,"score_gpt":0.2699764120246687,"score_spread":0.24387289728094286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738572842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07501696,0.00055441697,0.91607875,0.002310166,0.0047340994,0.00079006125,0.0001435338,0.00004045639,0.00033158142],"genre_scores_gemma":[0.9963078,0.000021294054,0.002562456,0.0002093356,0.00061182934,0.000026301728,0.0000027271954,0.000023875455,0.00023437155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965267,0.0002703383,0.0011622842,0.0003416302,0.0013474871,0.00035154392],"domain_scores_gemma":[0.99100953,0.00036778493,0.0027210845,0.0006227659,0.0050901594,0.0001886923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079538947,0.0003246597,0.00077699876,0.00022757529,0.0002089843,0.0007474807,0.0031399422,0.00009642081,0.000011056446],"category_scores_gemma":[0.0004013815,0.00024148182,0.00020359519,0.00009723957,0.00017875765,0.0019749694,0.00011195263,0.00039430568,0.0000129341515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01438381,0.0036834453,0.09166936,0.00019371588,0.014514951,0.002725364,0.0026707153,0.74451023,0.051025163,0.041821223,0.0012512812,0.031550728],"study_design_scores_gemma":[0.02297281,0.0010877546,0.031019002,0.00053254655,0.00012630115,0.00023746798,0.000038617658,0.93829465,0.0010387343,0.000007764574,0.004325091,0.0003192861],"about_ca_topic_score_codex":0.00008923157,"about_ca_topic_score_gemma":0.00001513792,"teacher_disagreement_score":0.9212909,"about_ca_system_score_codex":0.0001675572,"about_ca_system_score_gemma":0.00035452188,"threshold_uncertainty_score":0.9847343},"labels":[],"label_agreement":null},{"id":"W2739202242","doi":"10.1142/s2301385017400015","title":"UKF–Based LQR Control of a Manipulating Unmanned Aerial Vehicle","year":2017,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quadcopter; Control theory (sociology); Linear-quadratic regulator; Control engineering; State (computer science); Computer science; Euler angles; Control (management); Engineering; Artificial intelligence; Mathematics; Aerospace engineering; Algorithm","score_opus":0.027837898238288233,"score_gpt":0.2581792854136178,"score_spread":0.23034138717532956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739202242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15120429,0.0004766239,0.82973135,0.0011594513,0.008498489,0.0026655665,0.00019034882,0.00068506907,0.005388819],"genre_scores_gemma":[0.9982877,7.4979454e-7,0.0005477369,0.000076267934,0.0005611597,0.00012849328,0.00001562068,0.000039355404,0.00034294513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959606,0.00041777254,0.0011765701,0.0007913145,0.0008619937,0.000791737],"domain_scores_gemma":[0.9944756,0.00026836983,0.001599346,0.0029983707,0.00039869163,0.00025961746],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013585961,0.0004107245,0.00095277536,0.0002020268,0.0006842698,0.0010384952,0.0032211062,0.00023460362,0.000009627104],"category_scores_gemma":[0.00046565538,0.00039127778,0.00028986693,0.00019303152,0.0001232193,0.0008661425,0.00026780626,0.00020105681,0.00014790948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017261753,0.002244981,0.15072039,0.003563057,0.0024383452,0.0011104126,0.0028734664,0.10777091,0.3004321,0.40253553,0.009748316,0.014836341],"study_design_scores_gemma":[0.0078200465,0.00022668384,0.008596311,0.00045926333,0.000048752856,0.00001708712,0.00009170833,0.9774447,0.0022348717,0.000093858034,0.00243298,0.00053372356],"about_ca_topic_score_codex":0.0011596204,"about_ca_topic_score_gemma":0.000046651177,"teacher_disagreement_score":0.8696738,"about_ca_system_score_codex":0.00014072076,"about_ca_system_score_gemma":0.00015521298,"threshold_uncertainty_score":0.9999985},"labels":[],"label_agreement":null},{"id":"W2744575178","doi":"10.1109/tac.2019.2929206","title":"Push-Sum on Random Graphs: Almost Sure Convergence and Convergence Rate","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Sequence (biology); Convergence of random variables; Ergodicity; Convergence (economics); Random graph; Bounded function; Rate of convergence; Random matrix; Discrete mathematics; Combinatorics; Zero (linguistics); Directed graph; Stochastic matrix; Random variable; Markov chain; Computer science; Graph; Eigenvalues and eigenvectors","score_opus":0.008481407606589091,"score_gpt":0.21706339904322416,"score_spread":0.20858199143663508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744575178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11319321,0.000112632675,0.8787413,0.0012342749,0.0037401193,0.0019127649,0.000113276525,0.00065023114,0.00030216866],"genre_scores_gemma":[0.9977061,0.000036628495,0.00031638014,0.0008077527,0.000024493092,0.00025735746,0.0000030371718,0.00003053081,0.00081767846],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659824,0.0005108184,0.0007511694,0.00088837417,0.00061378785,0.0006376182],"domain_scores_gemma":[0.9968663,0.0011325671,0.00029359115,0.001239128,0.00016520184,0.00030320341],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000868179,0.00048165736,0.00077218673,0.0002878196,0.00027054598,0.00027366224,0.0009029823,0.00017640527,0.00037478944],"category_scores_gemma":[0.00003738682,0.000435227,0.0002720782,0.0005826267,0.00010686855,0.00060234306,0.000004970731,0.00031059474,0.0013776941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005711745,0.007897093,0.008819559,0.0032204525,0.009054909,0.0009408393,0.011205599,0.18479294,0.27094507,0.067372665,0.01109781,0.41894132],"study_design_scores_gemma":[0.012424594,0.00039491465,0.0025093209,0.00020199436,0.000099092154,0.000036229423,0.00007228195,0.9793816,0.0034138875,0.00028836858,0.0006154797,0.0005622296],"about_ca_topic_score_codex":0.00008454929,"about_ca_topic_score_gemma":0.00003002278,"teacher_disagreement_score":0.88451296,"about_ca_system_score_codex":0.00009334927,"about_ca_system_score_gemma":0.00012658985,"threshold_uncertainty_score":0.99981},"labels":[],"label_agreement":null},{"id":"W2745285504","doi":"10.2316/journal.206.2017.4.206-4782","title":"CONSENSUS OF MULTI-AGENT SYSTEMS USING BACK-TRACKING AND HISTORY FOLLOWING ALGORITHMS","year":2017,"lang":"en","type":"article","venue":"International Journal of Robotics and Automation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Consensus algorithm; Network topology; Algorithm; Topology (electrical circuits); Consensus; Tracking (education); Multi-agent system; Graph; Point (geometry); Telecommunications network; Distributed computing; Artificial intelligence; Computer network; Mathematics; Theoretical computer science","score_opus":0.06303370887556577,"score_gpt":0.30783295192786125,"score_spread":0.2447992430522955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2745285504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13757685,0.0016212673,0.8552423,0.000380026,0.0050088195,0.00010412304,0.00000592584,0.0000121783805,0.000048528862],"genre_scores_gemma":[0.95180947,0.000032216558,0.047997497,0.00001283167,0.00011334034,4.0770084e-7,0.0000010608909,0.0000057095845,0.000027455446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987296,0.00005560873,0.00055706163,0.00012438369,0.00043459403,0.00009875202],"domain_scores_gemma":[0.9978523,0.00007630421,0.0013525925,0.00017098564,0.0004803815,0.00006742388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056550157,0.000097125216,0.00022930674,0.00015348924,0.00009066358,0.0003406646,0.00048831507,0.00004943825,9.152586e-7],"category_scores_gemma":[0.0001719365,0.00009012277,0.00007748723,0.00001870199,0.00004894278,0.00056716986,0.00011986285,0.0000831599,8.831982e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010465737,0.0008801849,0.0982282,0.00057524367,0.0038931123,0.0014311791,0.0062698084,0.50584245,0.12436006,0.054063234,0.0011690115,0.20318283],"study_design_scores_gemma":[0.0011171026,0.000029712466,0.013987593,0.00037047587,0.000029531848,0.00026937627,0.00005330398,0.9835353,0.00015516991,0.000051077313,0.00031124344,0.00009012197],"about_ca_topic_score_codex":0.000102959566,"about_ca_topic_score_gemma":0.0000024070714,"teacher_disagreement_score":0.81423265,"about_ca_system_score_codex":0.00018583726,"about_ca_system_score_gemma":0.00008410195,"threshold_uncertainty_score":0.36751},"labels":[],"label_agreement":null},{"id":"W2748173987","doi":"10.1049/iet-cta.2016.1645","title":"Robust output feedback fault‐tolerant control of non‐linear multi‐agent systems based on wavelet neural networks","year":2017,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Control theory (sociology); Computer science; Artificial neural network; Fault tolerance; Output feedback; Control (management); Wavelet; Control engineering; Artificial intelligence; Engineering; Distributed computing","score_opus":0.022472087199996393,"score_gpt":0.2510162237640159,"score_spread":0.2285441365640195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2748173987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014750458,0.00034435937,0.9935454,0.00081112847,0.00044264644,0.002475518,0.00034564512,0.00013720608,0.00042306018],"genre_scores_gemma":[0.996968,0.000007934346,0.0007917112,0.0005327715,0.00034584265,0.0010887617,0.00002759047,0.00002810641,0.00020931153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718076,0.00046050234,0.0007288069,0.00074960786,0.00035368852,0.00052661286],"domain_scores_gemma":[0.995638,0.00084242126,0.0007713586,0.0021874392,0.00028973282,0.0002710531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015297824,0.00038624654,0.00072296825,0.00010042484,0.0007981391,0.0004551783,0.0016802808,0.00018499773,0.0000035382288],"category_scores_gemma":[0.0001329031,0.0003330218,0.00021693058,0.00012549019,0.00025988455,0.00030991275,0.00010038963,0.00029258413,0.000031828215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006124055,0.0016886857,0.0009382384,0.00013277588,0.00033915282,0.00002014793,0.00013398252,0.7922518,0.001083298,0.1610943,0.00028298353,0.041422207],"study_design_scores_gemma":[0.013235182,0.00010807162,0.002691349,0.00007264963,0.000083247614,0.0000070126935,0.000040851715,0.98126465,0.000031613075,0.0001330778,0.0020173348,0.00031494067],"about_ca_topic_score_codex":0.000058731654,"about_ca_topic_score_gemma":0.000004906839,"teacher_disagreement_score":0.99549294,"about_ca_system_score_codex":0.000045611174,"about_ca_system_score_gemma":0.000053256335,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W2751369415","doi":"10.1109/lwc.2017.2747543","title":"A Hierarchical Learning Solution for Anti-Jamming Stackelberg Game With Discrete Power Strategies","year":2017,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; McMaster University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Stackelberg competition; Computer science; Jamming; Mathematical optimization; Convergence (economics); Game theory; Bounded rationality; Nash equilibrium; Power (physics); Bounded function; Mathematics; Artificial intelligence; Mathematical economics","score_opus":0.026824362111032084,"score_gpt":0.2874370576465063,"score_spread":0.2606126955354742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751369415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16639806,0.00004737074,0.81306916,0.01913756,0.00022882872,0.0005045018,0.000019220462,0.000234027,0.0003612889],"genre_scores_gemma":[0.97607625,0.00002029991,0.023211025,0.00024047545,0.000054812357,0.0002630713,0.000042940126,0.000030132218,0.000060984465],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800235,0.00029225298,0.0003815068,0.00046487342,0.00032921473,0.0005297988],"domain_scores_gemma":[0.9947148,0.00036633492,0.000498928,0.0041378117,0.00016172552,0.00012041831],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004938679,0.00025546976,0.00033000176,0.0001224362,0.0017785984,0.0016302579,0.004746044,0.00008417757,0.0000013330209],"category_scores_gemma":[0.00007269561,0.00023601126,0.00012603927,0.00013754751,0.00048571962,0.0016863063,0.0004967484,0.0004666356,0.000020092877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033045304,0.00094301265,0.019796085,0.0003397296,0.0014574574,0.00008591672,0.019873746,0.029068245,0.44765726,0.38749805,0.0046758777,0.08827415],"study_design_scores_gemma":[0.003981876,0.00032141435,0.023011692,0.00050386763,0.000082907995,0.00004642276,0.0006208473,0.94451815,0.0012867434,0.00041727442,0.023939064,0.0012697615],"about_ca_topic_score_codex":0.0002447528,"about_ca_topic_score_gemma":0.00016484357,"teacher_disagreement_score":0.91544986,"about_ca_system_score_codex":0.00010802033,"about_ca_system_score_gemma":0.00012213369,"threshold_uncertainty_score":0.99952096},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012902949769630884,"score_gpt":0.22645472230048216,"score_spread":0.21355177253085128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2751593041","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057374872,0.0000826238,0.9366642,0.00063079945,0.002217241,0.0011043238,0.00016370097,0.00023082402,0.0015313758],"genre_scores_gemma":[0.99361837,0.000022821558,0.004313947,0.00005718076,0.000043534135,0.00018429117,0.000006295485,0.000042631134,0.0017109285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973263,0.00014178263,0.0006258256,0.0007440629,0.000531208,0.0006308333],"domain_scores_gemma":[0.99691397,0.00031898238,0.00039076165,0.0019211634,0.0002242531,0.00023086827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034244815,0.00040571095,0.00054097985,0.00021071211,0.0005278988,0.0007738769,0.0014364339,0.00021584735,0.00001993492],"category_scores_gemma":[0.0000278411,0.00037770232,0.00011565138,0.00024366066,0.00021056306,0.00026348472,0.000010996665,0.00043484016,0.00011782597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012496723,0.008471788,0.015533779,0.0011869447,0.001996016,0.0035505146,0.005198744,0.83571637,0.0017518818,0.03336203,0.0027837108,0.08919854],"study_design_scores_gemma":[0.0058275736,0.00037329196,0.007058631,0.0003713642,0.000058339894,0.00013847857,0.00018734222,0.982915,0.00040825605,0.000038355316,0.0019172467,0.0007061188],"about_ca_topic_score_codex":0.0014328795,"about_ca_topic_score_gemma":0.0217985,"teacher_disagreement_score":0.9362435,"about_ca_system_score_codex":0.00034867015,"about_ca_system_score_gemma":0.000108398104,"threshold_uncertainty_score":0.9998675},"labels":[],"label_agreement":null},{"id":"W2759716989","doi":"10.1109/iros.2018.8594283","title":"Cost Adaptation for Robust Decentralized Swarm Behaviour","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Swarm behaviour; Leverage (statistics); Distributed computing; Adaptation (eye); Task (project management); Set (abstract data type); Heuristic; Process (computing); Mathematical optimization; Artificial intelligence; Engineering; Systems engineering","score_opus":0.1231573022020559,"score_gpt":0.3156610486183004,"score_spread":0.19250374641624451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2759716989","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010152201,0.00011919705,0.9888164,0.00073717505,0.0043797344,0.003282346,0.00024524672,0.0006591632,0.0007455128],"genre_scores_gemma":[0.4808988,0.00003274328,0.513051,0.00034839127,0.00056051824,0.0020075047,0.0009942953,0.00006609086,0.0020406751],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970214,0.00012590032,0.00067421293,0.0010834832,0.00048380208,0.0006112354],"domain_scores_gemma":[0.997101,0.0001410146,0.00047923197,0.001409699,0.0006424371,0.00022659801],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000610254,0.0004142271,0.0005195912,0.00014455643,0.00014198828,0.00074021326,0.0021312013,0.00039486348,0.000045120174],"category_scores_gemma":[0.00013880324,0.00039813132,0.0003159706,0.0001625997,0.000042860174,0.00029023597,0.00082128355,0.0002444831,0.00016400433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005092321,0.002401617,0.0054111425,0.0014455703,0.0017487765,0.00010014374,0.006803151,0.19382174,0.0003721592,0.2162465,0.40147185,0.16966811],"study_design_scores_gemma":[0.0021142985,0.00006911961,0.0009946387,0.00012898284,0.00008366204,0.0000063409207,0.00006859884,0.98265636,0.00057992665,0.0018336817,0.010842746,0.00062162563],"about_ca_topic_score_codex":0.00043215105,"about_ca_topic_score_gemma":0.00017773447,"teacher_disagreement_score":0.78883463,"about_ca_system_score_codex":0.0002918903,"about_ca_system_score_gemma":0.00033879094,"threshold_uncertainty_score":0.99984705},"labels":[],"label_agreement":null},{"id":"W2760049195","doi":"10.1109/jproc.2018.2817461","title":"Network Topology and Communication-Computation Tradeoffs in Decentralized Optimization","year":2018,"lang":"en","type":"preprint","venue":"Proceedings of the IEEE","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Air Force Office of Scientific Research; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Network topology; Distributed computing; Convergence (economics); Node (physics); Computation; Variety (cybernetics); Wireless sensor network; Topology (electrical circuits); State (computer science); Distributed algorithm; Function (biology); Mathematical optimization; Computer network; Mathematics; Algorithm; Engineering; Artificial intelligence","score_opus":0.01969086396948241,"score_gpt":0.2527458612212268,"score_spread":0.23305499725174436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760049195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14023438,0.0035367042,0.827349,0.016761351,0.0044605844,0.0037101042,0.000026813475,0.000365413,0.0035556671],"genre_scores_gemma":[0.91658485,0.00017140897,0.082869805,0.0001770319,0.00009360343,0.00006237107,0.0000075791963,0.0000136762255,0.000019651005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984476,0.00006965813,0.00055561593,0.0004084853,0.00025404108,0.00026459072],"domain_scores_gemma":[0.99839336,0.00012199928,0.0007254265,0.0003357628,0.00037747223,0.00004597147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075178035,0.00019798329,0.00036947444,0.00009077717,0.0000993786,0.00018271239,0.0017606711,0.00023665927,0.0000014640074],"category_scores_gemma":[0.00016015157,0.00017123073,0.00006846489,0.0003369612,0.00015109389,0.0002799973,0.00085776625,0.00029829075,0.0000012777016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002113278,0.00046756424,0.024986802,0.0010464439,0.0003670903,0.0000016806753,0.010360818,0.8491247,0.0009228515,0.083144896,0.02244753,0.0069182883],"study_design_scores_gemma":[0.001007783,0.0000342908,0.003844469,0.00060019054,0.000041648025,0.000013788531,0.00007550358,0.96415704,0.0003810605,0.029279217,0.00029257464,0.00027241374],"about_ca_topic_score_codex":0.000118437114,"about_ca_topic_score_gemma":0.00001031934,"teacher_disagreement_score":0.7763505,"about_ca_system_score_codex":0.00010171243,"about_ca_system_score_gemma":0.00006380116,"threshold_uncertainty_score":0.69825864},"labels":[],"label_agreement":null},{"id":"W2760735284","doi":"10.1155/2017/9213805","title":"A <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mi>d</mml:mi><mml:mi>ϕ</mml:mi></mml:math>-Strategy: Facilitating Dual-Formation Control of a Virtually Connected Team","year":2017,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Artificial intelligence; Machine learning; Computer science; Mathematics; Geometry","score_opus":0.015337356763017836,"score_gpt":0.2455268943654454,"score_spread":0.23018953760242755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2760735284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8519259,0.00016613447,0.14589205,0.00021341984,0.00076424435,0.0000812067,0.00014242547,0.000070823546,0.0007437806],"genre_scores_gemma":[0.9936499,0.00006129425,0.005691657,0.00011210542,0.00019603108,0.00007888291,0.00014984001,0.00004738857,0.000012918047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964764,0.00012539251,0.0014776329,0.00037986616,0.0010463165,0.00049440714],"domain_scores_gemma":[0.99526036,0.00040422246,0.0030538011,0.0006616635,0.00038123885,0.00023870745],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001051513,0.00027458018,0.00030654177,0.00018538472,0.0005037708,0.00040427814,0.0008288727,0.00029952638,0.000059833877],"category_scores_gemma":[0.0005637091,0.0003558103,0.0004320042,0.00023230945,0.00016519777,0.0029954372,0.00003515656,0.0004520591,0.00006802828],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007458026,0.00018403585,0.000050660186,0.00043025738,0.00043466972,0.0002997571,0.005622842,0.05055054,0.035758294,0.8976331,0.00030121577,0.007988854],"study_design_scores_gemma":[0.012209816,0.0031634688,0.009002236,0.0020784135,0.0007388535,0.00058074866,0.0065070894,0.8213519,0.13939072,0.0029196797,0.00093183276,0.0011252703],"about_ca_topic_score_codex":0.00013790789,"about_ca_topic_score_gemma":0.00025739314,"teacher_disagreement_score":0.8947134,"about_ca_system_score_codex":0.000025028903,"about_ca_system_score_gemma":0.00040394248,"threshold_uncertainty_score":0.9998894},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.023681236926976244,"score_gpt":0.24722797862724896,"score_spread":0.22354674170027272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2762304185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08777334,0.00015729628,0.908949,0.0017716158,0.00034513063,0.0005429112,0.00004127103,0.00026850044,0.00015094837],"genre_scores_gemma":[0.99777365,0.000026993228,0.0020412486,0.00006152295,0.0000069256,0.00003595074,0.0000019184502,0.000015874617,0.000035918732],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835944,0.0000930907,0.0004237781,0.00044916646,0.0003038831,0.00037061158],"domain_scores_gemma":[0.9981236,0.0001610438,0.00040284632,0.0010100269,0.00022207815,0.00008040441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003273318,0.00024160097,0.00044450312,0.000500869,0.00047303623,0.00014353787,0.0008247511,0.00035886306,0.000007639726],"category_scores_gemma":[0.00003670511,0.00024145702,0.00011539414,0.00043959505,0.00044804628,0.0007779211,0.00001028707,0.00040128306,0.000043874643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050091336,0.002245451,0.0014306722,0.0003172145,0.003349988,0.00031832303,0.0014195463,0.17012495,0.24185832,0.09113834,0.00014266923,0.48715362],"study_design_scores_gemma":[0.014521631,0.0010570633,0.0037409554,0.00037625918,0.00033686752,0.00032186642,0.0011211035,0.76170385,0.21206592,0.0034084606,0.0002374307,0.0011085744],"about_ca_topic_score_codex":0.00006546151,"about_ca_topic_score_gemma":0.000031553012,"teacher_disagreement_score":0.9100003,"about_ca_system_score_codex":0.000107292246,"about_ca_system_score_gemma":0.000059470272,"threshold_uncertainty_score":0.98463315},"labels":[],"label_agreement":null},{"id":"W2763967643","doi":"10.1109/ccta.2017.8062701","title":"Observer based leader following consensus for multi-agent systems with random packet loss","year":2017,"lang":"en","type":"article","venue":"2017 IEEE Conference on Control Technology and Applications (CCTA)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bernoulli's principle; Multi-agent system; Control theory (sociology); Consensus; Computer science; Observer (physics); Linear matrix inequality; Network packet; Asynchronous communication; Lyapunov function; Mathematical optimization; Double integrator; Packet loss; Mathematics; Nonlinear system; Engineering; Computer network; Artificial intelligence","score_opus":0.07297215465505974,"score_gpt":0.306095506900087,"score_spread":0.23312335224502728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2763967643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076255826,0.00029803108,0.9793176,0.006988753,0.00055087724,0.0040746727,0.00022558527,0.0005091608,0.00040972856],"genre_scores_gemma":[0.98903316,0.000012041036,0.0049531125,0.0001925437,0.00009926516,0.005094822,0.00001590861,0.000027459148,0.0005716678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974233,0.00009427149,0.00048693546,0.0010562377,0.000274364,0.0006649203],"domain_scores_gemma":[0.9956887,0.0003216544,0.00066094426,0.002543871,0.00060629426,0.00017855159],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006105249,0.00043047097,0.00074881513,0.0002859661,0.0014028398,0.0006681726,0.0020014797,0.00041994595,0.000002018685],"category_scores_gemma":[0.0002479973,0.0003616707,0.00015155683,0.00018497386,0.00055639824,0.00024277308,0.00008443043,0.00032105474,0.000064648724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00081409974,0.00087188365,0.017620668,0.00032068123,0.0010897622,0.000116226896,0.000079597026,0.00096103793,0.0110268425,0.9380382,0.0022838202,0.026777236],"study_design_scores_gemma":[0.051025346,0.0005828564,0.0042358004,0.00052919454,0.00030920483,0.000057807243,0.00021685543,0.9032021,0.0020794668,0.002151915,0.034204382,0.0014050287],"about_ca_topic_score_codex":0.00003215764,"about_ca_topic_score_gemma":0.000058265985,"teacher_disagreement_score":0.9814076,"about_ca_system_score_codex":0.000062536616,"about_ca_system_score_gemma":0.00022450695,"threshold_uncertainty_score":0.9998972},"labels":[],"label_agreement":null},{"id":"W2766916309","doi":"10.1115/detc2017-67637","title":"Distributed Adaptive Fault-Tolerant Cooperative Control for Multi-UAVs Against Actuator and Sensor Faults","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Backstepping; Observer (physics); Fault tolerance; Computer science; Control engineering; Bounded function; Fault detection and isolation; Lyapunov function; Adaptive control; Engineering; Control (management); Distributed computing; Nonlinear system; Mathematics; Artificial intelligence","score_opus":0.04184347260147009,"score_gpt":0.2878572505292069,"score_spread":0.24601377792773682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766916309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022446478,0.00007914586,0.970411,0.0016541611,0.00058678945,0.0023283018,0.0018489137,0.00030208088,0.00034310116],"genre_scores_gemma":[0.97309417,0.0000083903005,0.025187518,0.00046870625,0.00012717358,0.00033068712,0.000077821605,0.000027467748,0.0006780653],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971613,0.00015793603,0.00056423346,0.0010112285,0.00035769507,0.00074759766],"domain_scores_gemma":[0.9966379,0.0003975271,0.00048645405,0.0013926632,0.0006955989,0.0003898567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048627346,0.00048078474,0.0007295935,0.00007569244,0.0011413576,0.0009473538,0.001478758,0.0001934753,0.000005284361],"category_scores_gemma":[0.0007351436,0.00038631808,0.00017865573,0.0000921165,0.0002131765,0.0011611957,0.00029411446,0.00019464528,0.000057385478],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0071463427,0.007009931,0.019282501,0.0008176594,0.0105547225,0.0020947417,0.017015819,0.0113625545,0.15957443,0.4143423,0.036370292,0.3144287],"study_design_scores_gemma":[0.013126747,0.00023770727,0.006988749,0.00006400041,0.000042101983,0.000015866106,0.00037413178,0.9722389,0.0014878432,0.00004354402,0.0047800834,0.0006003211],"about_ca_topic_score_codex":0.00014593551,"about_ca_topic_score_gemma":0.00011632636,"teacher_disagreement_score":0.96087635,"about_ca_system_score_codex":0.00012219648,"about_ca_system_score_gemma":0.0001310911,"threshold_uncertainty_score":0.99985886},"labels":[],"label_agreement":null},{"id":"W2766947607","doi":"10.21553/rev-jec.158","title":"An Online Distributed Boundary Detection and Classification Algorithm for Mobile Sensor Networks","year":2017,"lang":"en","type":"article","venue":"REV Journal on Electronics and Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Boundary (topology); Network topology; Computer science; Algorithm; Wireless sensor network; Process (computing); Distributed algorithm; Synchronization (alternating current); Topology (electrical circuits); Mathematics; Distributed computing; Computer network","score_opus":0.027680652656570253,"score_gpt":0.304428973658263,"score_spread":0.2767483210016927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766947607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008922841,0.0061953845,0.98233324,0.0018392451,0.00014668285,0.00040991398,0.000078682366,0.000051031926,0.000023000646],"genre_scores_gemma":[0.9703334,0.009726625,0.019456849,0.00009079288,0.00014803882,0.00008507018,0.00011848567,0.000014529398,0.000026187496],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.00017513291,0.00032310205,0.0002328809,0.00013460877,0.0003000159],"domain_scores_gemma":[0.9972861,0.00014727557,0.00047449965,0.0016792346,0.00024628238,0.00016665336],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005947754,0.00014361352,0.0001979449,0.00006678299,0.0025669332,0.0013299341,0.0012715107,0.00009447619,4.970691e-7],"category_scores_gemma":[0.000054709926,0.00013507144,0.0000623627,0.0000811628,0.00009587951,0.0006257649,0.00015075575,0.0004609446,7.101994e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013951674,0.00024951293,0.000083359424,0.0000051272987,0.00006626971,9.943178e-7,0.000051065075,0.00035652306,0.00080506736,0.008363185,0.00005789946,0.989947],"study_design_scores_gemma":[0.00077089434,0.0005459429,0.0030416073,0.000034595065,0.00003181498,0.00012645601,0.000036292287,0.94063836,0.000047210215,0.001553929,0.05301885,0.00015404752],"about_ca_topic_score_codex":0.000011747803,"about_ca_topic_score_gemma":0.00009304986,"teacher_disagreement_score":0.989793,"about_ca_system_score_codex":0.00015066432,"about_ca_system_score_gemma":0.00011054365,"threshold_uncertainty_score":0.9997068},"labels":[],"label_agreement":null},{"id":"W2768874478","doi":"10.1109/tsmc.2017.2693026","title":"Expected Convergence Rate to Consensus in Asymmetric Networks: Analysis and Distributed Estimation","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":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"Public Works and Government Services Canada","keywords":"Laplacian matrix; Rate of convergence; Convergence (economics); Algebraic connectivity; Eigenvalues and eigenvectors; Mathematics; Power iteration; Subspace topology; Graph; Computer science; Krylov subspace; Mathematical optimization; Algorithm; Iterative method; Discrete mathematics","score_opus":0.015350965218149857,"score_gpt":0.24659135073840455,"score_spread":0.2312403855202547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768874478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07373135,0.000521889,0.9218232,0.00017043347,0.0020749113,0.0012127259,0.00015130414,0.00016372548,0.00015045775],"genre_scores_gemma":[0.99886394,0.000062654886,0.00029115955,0.00002264813,0.000051187275,0.00026443135,0.00001362361,0.000022805747,0.0004075644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996565,0.00052401517,0.0009749491,0.0009298274,0.0004507129,0.00055553543],"domain_scores_gemma":[0.9970527,0.00035175701,0.00054491736,0.0014134388,0.00022678757,0.00041039864],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00097273494,0.00041384678,0.00086076907,0.00090742495,0.00054102973,0.001703498,0.0007600966,0.00022141884,0.0000016382885],"category_scores_gemma":[0.000061043655,0.0004120389,0.00011658926,0.0014321624,0.00010889223,0.00029352764,0.00001897145,0.00024875088,0.000030664272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082219594,0.00021986102,0.00817003,0.00023867283,0.00088660966,0.00012010122,0.0007350892,0.9789645,0.0003583376,0.0035376889,0.00028739678,0.006399473],"study_design_scores_gemma":[0.0011567683,0.0001122435,0.02796718,0.00023184951,0.00017292853,0.0000449757,0.00028350388,0.969292,0.00009149336,0.000009307643,0.00019757968,0.0004401658],"about_ca_topic_score_codex":0.004187134,"about_ca_topic_score_gemma":0.000513502,"teacher_disagreement_score":0.9251326,"about_ca_system_score_codex":0.0001826365,"about_ca_system_score_gemma":0.000044483982,"threshold_uncertainty_score":0.99983317},"labels":[],"label_agreement":null},{"id":"W2771039244","doi":"10.1016/j.automatica.2019.108691","title":"A Lie bracket approximation approach to distributed optimization over directed graphs","year":2019,"lang":"en","type":"preprint","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Kingston Health Sciences Centre","funders":"","keywords":"Computation; Saddle point; Mathematical optimization; Simple (philosophy); Computer science; Bracket; Lie group; Topological graph theory; Invariant (physics); Graph; Mathematics; Topology (electrical circuits); Theoretical computer science; Algorithm; Voltage graph; Pure mathematics; Combinatorics","score_opus":0.016292493982032447,"score_gpt":0.2423224211310963,"score_spread":0.22602992714906386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771039244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025474406,0.000070332426,0.9840205,0.0005129567,0.0013379046,0.0034438807,0.00045186823,0.0029754336,0.004639727],"genre_scores_gemma":[0.6573982,0.0000071601016,0.3371566,0.00027001766,0.00010568608,0.0009490225,0.0038403822,0.000074160605,0.00019874953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99527854,0.00042214541,0.0010817995,0.001473657,0.0010499421,0.0006938918],"domain_scores_gemma":[0.9956026,0.00021043979,0.00075708923,0.0027443632,0.00037672574,0.00030875363],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000672367,0.00066728075,0.00094776676,0.0004594033,0.00014040462,0.00116027,0.002512189,0.0005580775,0.000027891392],"category_scores_gemma":[0.00044749034,0.0006624575,0.0002987692,0.0012252264,0.0000400384,0.00055432477,0.0016871981,0.00051865866,0.00039035763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028081804,0.0009911868,0.00032970088,0.0013831892,0.0005538728,0.000010213066,0.0015551482,0.9145727,0.00015397661,0.04649085,0.030153316,0.0037777533],"study_design_scores_gemma":[0.00070975657,0.000036049107,0.0040042456,0.00028356342,0.00006981156,0.000007637312,0.000017719014,0.9915618,0.000052617193,0.002042251,0.0005064396,0.00070811936],"about_ca_topic_score_codex":0.00007228667,"about_ca_topic_score_gemma":0.0000018005072,"teacher_disagreement_score":0.6548508,"about_ca_system_score_codex":0.00036059465,"about_ca_system_score_gemma":0.00027153347,"threshold_uncertainty_score":0.9998766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.019406035241355053,"score_gpt":0.24569472392003155,"score_spread":0.2262886886786765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2771382046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014465607,0.0007417252,0.9745055,0.00014948225,0.0043425523,0.004697184,0.0005586012,0.00021451368,0.00032485637],"genre_scores_gemma":[0.99793285,0.000028497343,0.0003533723,0.000024102079,0.00010720486,0.00091440027,0.000011268774,0.000040233608,0.00058809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99592334,0.00037588886,0.0016386678,0.0006032328,0.0008422088,0.00061668],"domain_scores_gemma":[0.9948063,0.0004451421,0.0019666294,0.0017005214,0.0007815432,0.00029989798],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001262571,0.0005246421,0.0011696487,0.00035588795,0.0008027273,0.001693018,0.0010172856,0.00027694544,8.4214173e-7],"category_scores_gemma":[0.00003986616,0.00044647433,0.0002096878,0.0001682238,0.00018340009,0.0006808834,0.000008857177,0.00022823595,0.000026137572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024935794,0.0011776569,0.0012669263,0.010974308,0.0045167953,0.000098159384,0.005438944,0.88390446,0.008655972,0.06829661,0.0031007794,0.0100758355],"study_design_scores_gemma":[0.0112463,0.00071185426,0.00031866142,0.0016484495,0.00021621655,0.00017721984,0.0012691282,0.9789558,0.0005522936,0.000008310953,0.004227756,0.0006679776],"about_ca_topic_score_codex":0.002963984,"about_ca_topic_score_gemma":0.000051149564,"teacher_disagreement_score":0.9834672,"about_ca_system_score_codex":0.00015528279,"about_ca_system_score_gemma":0.0001512142,"threshold_uncertainty_score":0.9997987},"labels":[],"label_agreement":null},{"id":"W2772804860","doi":"10.1109/tsmc.2017.2774841","title":"Distributed Consensus of Linear Multiagent Systems: Laplacian Spectra-Based Method","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":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Network topology; Laplace operator; Norm (philosophy); Stability (learning theory); Multi-agent system; Frequency domain; Computer science; Function (biology); Domain (mathematical analysis); Linear system; Laplacian matrix; Mathematical optimization; Topology (electrical circuits); Mathematics; Applied mathematics; Artificial intelligence; Combinatorics; Machine learning; Mathematical analysis","score_opus":0.02757853974605842,"score_gpt":0.2769596681704634,"score_spread":0.249381128424405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2772804860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006111271,0.0010741848,0.9808074,0.00020974819,0.006821121,0.0023519723,0.0012614218,0.0003619227,0.0010009514],"genre_scores_gemma":[0.99633706,0.0000326744,0.001806811,0.000020116417,0.0002026484,0.00030443864,0.000020616975,0.00006822945,0.0012073822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99410635,0.001012395,0.0017514455,0.0011704275,0.0011304356,0.00082892756],"domain_scores_gemma":[0.9937711,0.0005533955,0.0015613533,0.0030380706,0.00054048625,0.0005356165],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001641063,0.0007210882,0.0014306516,0.00038604127,0.0009538678,0.0013052969,0.00174655,0.00043209374,0.000003881042],"category_scores_gemma":[0.000050877647,0.0006801453,0.00032859403,0.00029981075,0.00026310948,0.00026250645,0.000019600793,0.00045636517,0.00008019882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004391762,0.0020105066,0.0012184988,0.0058031916,0.0023140572,0.0005737758,0.001787698,0.9255905,0.013071754,0.039449286,0.0027640667,0.004977471],"study_design_scores_gemma":[0.0034988117,0.00037633302,0.00041867132,0.001228975,0.0001812513,0.00022688393,0.0007451907,0.9827957,0.0032886514,0.0000087283315,0.0064253146,0.0008055004],"about_ca_topic_score_codex":0.0047016945,"about_ca_topic_score_gemma":0.00011856657,"teacher_disagreement_score":0.9902258,"about_ca_system_score_codex":0.00026524276,"about_ca_system_score_gemma":0.00019622543,"threshold_uncertainty_score":0.9997314},"labels":[],"label_agreement":null},{"id":"W2775491644","doi":"10.1109/tcst.2017.2773537","title":"Event-Triggered Consensus Control for Multiagent Systems With Time-Varying Communication and Event-Detecting Delays","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Postdoctoral Science Foundation","keywords":"Multi-agent system; Consensus; Double integrator; Convergence (economics); Computer science; Event (particle physics); Protocol (science); Mobile robot; Control theory (sociology); State (computer science); Distributed computing; Lyapunov function; Control (management); Robot; Artificial intelligence; Algorithm","score_opus":0.015301479869352609,"score_gpt":0.2523572675403061,"score_spread":0.23705578767095348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2775491644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011245198,0.0014115451,0.9771546,0.0021248164,0.0013660197,0.00533373,0.0003015154,0.0009877258,0.00007484479],"genre_scores_gemma":[0.9953694,0.00002103797,0.0012985012,0.000053135038,0.00006948987,0.0028420843,0.00000456437,0.00006638391,0.0002754102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960209,0.00046104836,0.0011498393,0.0010413018,0.00045084363,0.00087608007],"domain_scores_gemma":[0.993722,0.0010422871,0.0013718861,0.0030250736,0.00061705464,0.00022166802],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013764743,0.00058131356,0.0011734613,0.0005848883,0.0022660876,0.00093700923,0.0019093122,0.00056875084,0.0000018620412],"category_scores_gemma":[0.00014566774,0.0005296242,0.00020383895,0.00023281136,0.00032720482,0.00048159508,0.000017223034,0.000575574,0.00004461203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039581037,0.002194012,0.0014636476,0.001647068,0.008776094,0.00033097624,0.0011384004,0.66217947,0.18672761,0.020805016,0.000817823,0.10996178],"study_design_scores_gemma":[0.0160717,0.0006482152,0.000052383417,0.000555147,0.0002600193,0.0003491057,0.00021687672,0.9788117,0.0016712307,0.0000752262,0.0006773312,0.0006110588],"about_ca_topic_score_codex":0.00058695447,"about_ca_topic_score_gemma":0.00014379196,"teacher_disagreement_score":0.9841242,"about_ca_system_score_codex":0.00031532842,"about_ca_system_score_gemma":0.00015435411,"threshold_uncertainty_score":0.9997155},"labels":[],"label_agreement":null},{"id":"W2776997662","doi":"10.1109/tcyb.2017.2777959","title":"Dynamic Coverage Control in a Time-Varying Environment Using Bayesian Prediction","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Bayesian probability; Probability density function; Function (biology); Mathematical optimization; Metric (unit); Stability (learning theory); Algorithm; Mathematics; Machine learning; Artificial intelligence; Statistics; Engineering","score_opus":0.012391355711839799,"score_gpt":0.23192970083605088,"score_spread":0.21953834512421108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2776997662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022824716,0.000025273455,0.9750919,0.00023429513,0.00073529745,0.00052517216,0.00012204292,0.0001119321,0.00032938042],"genre_scores_gemma":[0.99610955,0.00002817016,0.003343486,0.00007800015,0.000024349943,0.000044810535,0.0000030236774,0.000023549072,0.00034509142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981003,0.000117270596,0.0004194092,0.0005004024,0.0004670608,0.0003955945],"domain_scores_gemma":[0.9983603,0.00008443997,0.00022092655,0.0011785108,0.00002457456,0.00013129751],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029087334,0.00023820183,0.00027557783,0.00016468579,0.0004288062,0.00043329224,0.0009679623,0.0001453753,0.000034954755],"category_scores_gemma":[0.000007675513,0.0002644875,0.00011825604,0.00008565808,0.000069640075,0.0005166168,0.0000071198997,0.00029497594,0.00013982264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007934323,0.00070849876,0.0010571305,0.000025376568,0.00014335221,0.0000982552,0.00043025144,0.93308455,0.026115727,0.00011908728,0.0000264356,0.038112007],"study_design_scores_gemma":[0.002392769,0.000084676525,0.0030315456,0.000079698744,0.000037056227,0.000019899584,0.0000038505054,0.9929021,0.0009117019,0.000115073126,0.00019915041,0.00022246267],"about_ca_topic_score_codex":0.00017544434,"about_ca_topic_score_gemma":0.000038979317,"teacher_disagreement_score":0.9732848,"about_ca_system_score_codex":0.00043837036,"about_ca_system_score_gemma":0.000050865667,"threshold_uncertainty_score":0.99998075},"labels":[],"label_agreement":null},{"id":"W2781357780","doi":"10.1016/j.isatra.2017.12.019","title":"Velocity-free attitude coordinated tracking control for spacecraft formation flying","year":2017,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Angular velocity; Convergence (economics); Spacecraft; Observer (physics); Attitude control; Tracking (education); Trajectory; Stability (learning theory); Rate of convergence; Control (management); Computer science; Engineering; Control engineering; Physics; Aerospace engineering; Artificial intelligence; Psychology; Classical mechanics","score_opus":0.03805126506354482,"score_gpt":0.28534965451154237,"score_spread":0.24729838944799754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2781357780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009572155,0.000055479144,0.9905351,0.0054200753,0.0011276113,0.00091271853,0.00017970348,0.00034830914,0.00046377743],"genre_scores_gemma":[0.9897365,0.000004551159,0.009456663,0.000101626196,0.00009295096,0.00027140585,0.000012920853,0.000017374454,0.00030598557],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853176,0.000060746846,0.00036273184,0.0003578797,0.00025245518,0.00043440622],"domain_scores_gemma":[0.99786294,0.00018174638,0.00028597284,0.0012878804,0.00025385965,0.00012762142],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0004392377,0.00019784177,0.0002801815,0.000110206296,0.0019486635,0.00095241464,0.0015578282,0.00011780048,0.00001356711],"category_scores_gemma":[0.00015577454,0.0002069805,0.0002124327,0.0001089361,0.000054461838,0.0025203475,0.000020101348,0.0001735006,0.000041603325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000364176,0.0012702006,0.0016525899,0.00075639924,0.001640806,0.00007481345,0.008272914,0.020381846,0.059147526,0.060789343,0.0068874983,0.83876187],"study_design_scores_gemma":[0.008560849,0.00009076757,0.0074587516,0.00011772335,0.00012956184,0.000037729224,0.00013182456,0.9630273,0.0030663325,0.0013215106,0.015556513,0.00050113373],"about_ca_topic_score_codex":0.00016222126,"about_ca_topic_score_gemma":0.00036588783,"teacher_disagreement_score":0.9887793,"about_ca_system_score_codex":0.00013534453,"about_ca_system_score_gemma":0.00006073351,"threshold_uncertainty_score":0.99935067},"labels":[],"label_agreement":null},{"id":"W2782965003","doi":"10.1109/cdc.2017.8264339","title":"Continuous-time distributed dynamics for Nash equilibrium over networks via a passivity-based control approach","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Computer science; Monotonic function; Subspace topology; Graph; Mathematical optimization; Best response; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.009426402690502867,"score_gpt":0.23233985984236766,"score_spread":0.22291345715186478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782965003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012909094,0.00003720445,0.9906586,0.0016201073,0.0008776252,0.0020902934,0.0007303919,0.0006579749,0.0020369187],"genre_scores_gemma":[0.98870623,2.86212e-7,0.008574743,0.00044445883,0.00029474593,0.0004557412,0.0006209153,0.000048120317,0.0008547445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633574,0.00019167962,0.00070065213,0.0010782321,0.0005280666,0.0011656479],"domain_scores_gemma":[0.99511445,0.0004961241,0.0007956,0.0028446885,0.0003787977,0.00037036405],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010066639,0.00052039797,0.00090971816,0.00009027714,0.0006143903,0.0018894051,0.0034478132,0.00033089393,0.000020193984],"category_scores_gemma":[0.00032476225,0.00046950643,0.00045660828,0.0001626518,0.0001833127,0.0010338385,0.0003068231,0.00026019182,0.000052386094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028185307,0.0076570846,0.10122568,0.0010319568,0.004462974,0.00034707066,0.0002287871,0.25622204,0.018441077,0.32812107,0.16605072,0.11339303],"study_design_scores_gemma":[0.007336749,0.00013189782,0.0053494773,0.000028266262,0.00006119423,0.00000770385,0.000004036325,0.98372704,0.00008516206,0.00028023557,0.0024083469,0.0005799013],"about_ca_topic_score_codex":0.00016741213,"about_ca_topic_score_gemma":0.000043439002,"teacher_disagreement_score":0.9874153,"about_ca_system_score_codex":0.0002724987,"about_ca_system_score_gemma":0.00015114875,"threshold_uncertainty_score":0.99977565},"labels":[],"label_agreement":null},{"id":"W2783679993","doi":"10.1109/cdc.2017.8264162","title":"Consensus of heterogeneous multiple integrator agents on directed graphs","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Consensus; Integrator; Computer science; Multi-agent system; Spanning tree; Graph; Network topology; Directed graph; Double integrator; Topology (electrical circuits); State (computer science); Distributed computing; Theoretical computer science; Strongly connected component; Uniform consensus; Mathematics; Algorithm; Bandwidth (computing); Computer network; Discrete mathematics; Artificial intelligence","score_opus":0.0340517494539114,"score_gpt":0.2721130114447557,"score_spread":0.2380612619908443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783679993","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.932917,0.00007724934,0.04523964,0.0006736762,0.0025801489,0.0009839915,0.00010054803,0.001054743,0.016372982],"genre_scores_gemma":[0.9975013,0.000003160324,0.0018422982,0.00008481698,0.000020487876,0.00002145103,0.000005689039,0.000011378454,0.0005094144],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984033,0.00012005429,0.00037226122,0.00043770077,0.00035223516,0.0003144107],"domain_scores_gemma":[0.9974982,0.00018513296,0.00037429464,0.001600632,0.00019159587,0.00015015938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025492746,0.00020439863,0.00032483632,0.000103964885,0.0002475092,0.00022366601,0.0016848186,0.00008434187,0.000019824045],"category_scores_gemma":[0.00055429334,0.00016526644,0.00016104938,0.000100175406,0.00010094376,0.00011769951,0.00023306644,0.000114695256,0.000114730974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00064072356,0.0034779839,0.55537623,0.00026385864,0.0020580608,0.0013297255,0.0017241299,0.0021448992,0.095866665,0.13802262,0.04599512,0.15309997],"study_design_scores_gemma":[0.0062954715,0.00060308684,0.10407265,0.0002024156,0.00003925063,0.000057037883,0.0000578671,0.7422084,0.13487142,0.0010873899,0.009533096,0.0009718697],"about_ca_topic_score_codex":0.00049634406,"about_ca_topic_score_gemma":0.00013401924,"teacher_disagreement_score":0.74006355,"about_ca_system_score_codex":0.00003697773,"about_ca_system_score_gemma":0.000038327613,"threshold_uncertainty_score":0.67393696},"labels":[],"label_agreement":null},{"id":"W2783792618","doi":"10.1109/cdc.2017.8264653","title":"A smooth distributed feedback for formation control of unicycles","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Heading (navigation); Bounded function; Synchronizer; Kinematics; Controller (irrigation); Computer science; Line (geometry); Graph; Control (management); Mathematics; Engineering; Artificial intelligence; Physics; Distributed computing; Theoretical computer science","score_opus":0.024558381812691137,"score_gpt":0.2655193302609312,"score_spread":0.2409609484482401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783792618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003635847,0.00003765146,0.9917174,0.0017174552,0.00027792653,0.00071726064,0.00030674518,0.00011333575,0.0014763859],"genre_scores_gemma":[0.9945391,0.0000020164798,0.0050931554,0.000060768736,0.00005238864,0.00007350055,0.000042447704,0.000006305978,0.0001303512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988464,0.00003872932,0.00039386185,0.00022990802,0.00021538643,0.00027572407],"domain_scores_gemma":[0.9978276,0.00013811755,0.0005197299,0.001169944,0.0002630222,0.000081575665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038182753,0.00013049663,0.00028053104,0.000048040652,0.00026395996,0.000332423,0.0015705086,0.000067262015,0.0000053747276],"category_scores_gemma":[0.0002876208,0.000110172354,0.0001324947,0.000057842743,0.00005529803,0.0011617721,0.00012201736,0.000041903975,0.000020535903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024437337,0.00045667225,0.007048398,0.00036670145,0.0002890118,0.0000074441155,0.0004450121,0.0007842882,0.021487683,0.76734537,0.016310839,0.18521419],"study_design_scores_gemma":[0.008249485,0.00016823925,0.030268636,0.00007336929,0.00003738174,0.000005563326,0.000067972775,0.91884637,0.009856205,0.0041043987,0.02797965,0.00034273457],"about_ca_topic_score_codex":0.000107845844,"about_ca_topic_score_gemma":0.000047743666,"teacher_disagreement_score":0.9909032,"about_ca_system_score_codex":0.00004553281,"about_ca_system_score_gemma":0.000037237784,"threshold_uncertainty_score":0.44926983},"labels":[],"label_agreement":null},{"id":"W2784283871","doi":"10.1109/tmech.2018.2791544","title":"Distributed LQR Consensus Control for Heterogeneous Multiagent Systems: Theory and Experiments","year":2018,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Multi-agent system; Computer science; Algebraic graph theory; Underactuation; Robotics; Convergence (economics); Controller (irrigation); Consensus; Protocol (science); Distributed computing; Network topology; Mechatronics; Graph; Directed graph; Control theory (sociology); Robot; Control (management); Artificial intelligence; Theoretical computer science; Computer network","score_opus":0.02004299387753877,"score_gpt":0.2678719988013809,"score_spread":0.24782900492384213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784283871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012359247,0.0007222473,0.9797009,0.00027171016,0.0030289656,0.0020382698,0.0014066162,0.00044732488,0.000024677434],"genre_scores_gemma":[0.99531186,0.000022471337,0.0033796816,0.00019710245,0.00014580325,0.0006864218,0.000025436191,0.000048957812,0.00018229052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966732,0.00047395585,0.0006749257,0.0009092313,0.00045195103,0.00081673183],"domain_scores_gemma":[0.99734926,0.00066380727,0.0002598557,0.0010579351,0.0003394302,0.0003297168],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009159145,0.00046581603,0.0005480855,0.00017896504,0.0006128554,0.0003342627,0.00073451514,0.00023540095,0.000016687989],"category_scores_gemma":[0.000043699358,0.00044949193,0.00024307655,0.00024582175,0.00017145585,0.0002084012,0.000011866927,0.00022367765,0.000091533184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008115236,0.006520988,0.00008131702,0.0010983961,0.008978563,0.00026539838,0.006730869,0.27797496,0.15008093,0.43020138,0.005167237,0.10478472],"study_design_scores_gemma":[0.010286054,0.0014494383,0.000012551402,0.00013637489,0.00023755917,0.00015680812,0.00044859742,0.93265903,0.04084391,0.0010190739,0.011791849,0.0009587279],"about_ca_topic_score_codex":0.00004351234,"about_ca_topic_score_gemma":0.000020002319,"teacher_disagreement_score":0.9829526,"about_ca_system_score_codex":0.00033475636,"about_ca_system_score_gemma":0.0001354691,"threshold_uncertainty_score":0.9997957},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025932108508991678,"score_gpt":0.2714775517240211,"score_spread":0.2455454432150294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789411207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009034653,0.00007161464,0.98639935,0.0009384893,0.006854381,0.0018801532,0.0007369429,0.00049234624,0.0017232685],"genre_scores_gemma":[0.9859596,0.000015477539,0.008274996,0.0003521968,0.000683481,0.00023461175,0.000012314929,0.000058958074,0.0044083875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996445,0.0001866139,0.0008656959,0.0009883543,0.0007202648,0.00079407706],"domain_scores_gemma":[0.99672896,0.00062963716,0.0003216747,0.0014621691,0.0004019949,0.0004555772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000497391,0.00047035437,0.0005115702,0.00026158814,0.000416404,0.00042018,0.0012116341,0.00026186617,0.000010383108],"category_scores_gemma":[0.000052589312,0.00045488242,0.00029665013,0.00041948652,0.000061573584,0.000238752,0.0000045428233,0.00030154514,0.00064314716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004298628,0.003214872,0.00002459701,0.00029607982,0.0020714875,0.00010225258,0.0069305114,0.573075,0.031538535,0.08003435,0.10598931,0.19242436],"study_design_scores_gemma":[0.013655309,0.0024710377,0.00009055961,0.00027086254,0.00018309389,0.000032349235,0.0000858156,0.8903534,0.02540541,0.00033622878,0.06614165,0.00097427185],"about_ca_topic_score_codex":0.0005442267,"about_ca_topic_score_gemma":0.00019400568,"teacher_disagreement_score":0.9850561,"about_ca_system_score_codex":0.000312919,"about_ca_system_score_gemma":0.00019822431,"threshold_uncertainty_score":0.9997903},"labels":[],"label_agreement":null},{"id":"W2790061769","doi":"10.1155/2018/5278565","title":"Leader-Follower Based Locally Rigid Formation Control","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cartesian coordinate system; Nonholonomic system; Control theory (sociology); Robustness (evolution); Mobile robot; Control engineering; Computer science; Nonlinear system; Acceleration; Motion control; Robot; Engineering; Control (management); Simulation; Artificial intelligence; Mathematics; Physics","score_opus":0.009821357504768258,"score_gpt":0.23902879432958685,"score_spread":0.2292074368248186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790061769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045750424,0.00008198462,0.9517813,0.00090873206,0.0010855322,0.00021678579,0.000012853477,0.000052324962,0.00011009741],"genre_scores_gemma":[0.973921,0.000004226908,0.025451608,0.00037258706,0.00020187919,0.0000064144397,0.000012933038,0.000009736185,0.000019613753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99817437,0.000063018786,0.00082108664,0.00016106704,0.00055008935,0.00023037447],"domain_scores_gemma":[0.99791616,0.000075841104,0.0008148026,0.00023480553,0.0008378442,0.0001205626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041199566,0.00014664048,0.00027439458,0.0001789743,0.00008874846,0.00007510679,0.00045289844,0.00006732403,0.000013977069],"category_scores_gemma":[0.00004288298,0.00012876307,0.00017017843,0.00030483207,0.000040606923,0.0022805233,0.000001522496,0.00014314397,0.000028558321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003640717,0.0013601957,0.008856629,0.0003892481,0.0005027351,0.0006026616,0.011414393,0.4926275,0.26135907,0.020994794,0.0037179159,0.19453415],"study_design_scores_gemma":[0.06595714,0.006427934,0.4056553,0.0014351333,0.000494339,0.00019686701,0.0012728038,0.36699444,0.0772674,0.0049944036,0.06738086,0.0019233753],"about_ca_topic_score_codex":0.000003216558,"about_ca_topic_score_gemma":0.000036670208,"teacher_disagreement_score":0.92817056,"about_ca_system_score_codex":0.00008944066,"about_ca_system_score_gemma":0.000119906355,"threshold_uncertainty_score":0.5250806},"labels":[],"label_agreement":null},{"id":"W2790330769","doi":"10.1109/robio.2017.8324618","title":"Teleoperation of multiple cooperative slave manipulators using graph-based non-singular terminal sliding-mode control","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Terminal sliding mode; Teleoperation; Nonlinear system; Computer science; Synchronization (alternating current); Interconnection; Graph; Bounded function; Sliding mode control; Control engineering; Robot; Control (management); Engineering; Mathematics; Artificial intelligence","score_opus":0.028510512259579034,"score_gpt":0.2861834877147344,"score_spread":0.2576729754551554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2790330769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2860814,0.000014212517,0.71243376,0.00012294576,0.0004270135,0.00058731885,0.000022627597,0.00007466241,0.00023602712],"genre_scores_gemma":[0.98584574,4.880132e-7,0.013850728,0.00010660532,0.00008330386,0.000018931334,0.000011847528,0.000019116338,0.000063239044],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779254,0.00014292797,0.0005937065,0.0005797913,0.00046723412,0.00042380978],"domain_scores_gemma":[0.9973406,0.00012134326,0.0005569528,0.0013721989,0.0004624146,0.00014648335],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043351666,0.00030889045,0.00051897083,0.00017983498,0.00070287794,0.0006701748,0.0013062317,0.00013222739,0.000008443345],"category_scores_gemma":[0.00025035226,0.00027286803,0.00017913297,0.00015186117,0.000109811815,0.0010830894,0.0001241648,0.00013595326,0.000017946335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019650673,0.0006255186,0.12534188,0.00013924799,0.00040426408,0.00019928666,0.0012642309,0.13554716,0.7093312,0.022799298,0.0002402595,0.0039111353],"study_design_scores_gemma":[0.0033463016,0.000108131375,0.007473258,0.00008665938,0.000033342214,0.000011143091,0.000038883685,0.9258646,0.06265905,0.000038903745,0.000046064568,0.00029371178],"about_ca_topic_score_codex":0.0012199192,"about_ca_topic_score_gemma":0.00015588872,"teacher_disagreement_score":0.7903174,"about_ca_system_score_codex":0.000113932045,"about_ca_system_score_gemma":0.00022176807,"threshold_uncertainty_score":0.99997234},"labels":[],"label_agreement":null},{"id":"W2791142925","doi":"10.1016/j.ast.2017.12.015","title":"Distributed almost global finite-time attitude consensus of multiple spacecraft without velocity measurements","year":2018,"lang":"en","type":"article","venue":"Aerospace Science and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":67,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Nanjing University of Aeronautics and Astronautics; State Key Laboratory of Mechanics and Control of Mechanical Structures; National Natural Science Foundation of China","keywords":"Quaternion; Control theory (sociology); Angular velocity; A priori and a posteriori; Convergence (economics); Attitude control; Consensus; Spacecraft; Lyapunov function; Mathematics; Torque; Computer science; Control (management); Multi-agent system; Engineering; Control engineering; Physics; Nonlinear system; Geometry; Artificial intelligence; Classical mechanics; Aerospace engineering","score_opus":0.020696639518594583,"score_gpt":0.2635992499522438,"score_spread":0.24290261043364925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791142925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.833723,0.0002684267,0.1509942,0.011082485,0.0007925009,0.00093867007,0.00022092999,0.00087018736,0.001109604],"genre_scores_gemma":[0.9874786,0.000003394236,0.012324563,0.0000907811,0.000023549726,0.000019012545,0.0000043192595,0.0000066531925,0.00004908669],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9969692,0.000058919988,0.00038057094,0.0009034172,0.0009000637,0.0007877998],"domain_scores_gemma":[0.9968871,0.00009186024,0.0003236637,0.0011053635,0.0013891493,0.00020290399],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001064475,0.00026746726,0.00044280651,0.00022632412,0.00046052225,0.00014751109,0.0018772985,0.00021009288,0.000006088106],"category_scores_gemma":[0.0020284108,0.00024561622,0.000041884276,0.0035928588,0.0036669266,0.00035357024,0.00087319,0.00015223121,0.00011183648],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061361345,0.00038655964,0.6660555,0.00003983972,0.00013800836,0.000029934161,0.00029484034,0.000030185116,0.29944432,0.017504422,0.0035420074,0.01247302],"study_design_scores_gemma":[0.011676159,0.0026254156,0.20673932,0.00045043495,0.000144636,0.0004233118,0.0007938878,0.371906,0.38554174,0.0063228267,0.01078739,0.0025888649],"about_ca_topic_score_codex":0.00017683703,"about_ca_topic_score_gemma":0.00019695653,"teacher_disagreement_score":0.4593162,"about_ca_system_score_codex":0.00021049964,"about_ca_system_score_gemma":0.00044957123,"threshold_uncertainty_score":0.9999996},"labels":[],"label_agreement":null},{"id":"W2793522527","doi":"10.1109/globalsip.2017.8309024","title":"An empirical comparison of multi-agent optimization algorithms","year":2017,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Subgradient method; Asynchronous communication; Implementation; Distributed algorithm; Convex optimization; Algorithm; Mathematical optimization; Scale (ratio); Optimization problem; Regular polygon; Distributed computing; Machine learning; Mathematics","score_opus":0.08939167101049317,"score_gpt":0.38875953235642957,"score_spread":0.2993678613459364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793522527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003330437,0.00003656246,0.9942105,0.0004482605,0.00058306044,0.00025184554,0.000009279633,0.00016384867,0.00096622435],"genre_scores_gemma":[0.7602293,0.0000014561923,0.23950264,0.000043983822,0.000042425094,0.000011106461,0.00001136369,0.0000068606155,0.00015086184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843013,0.00010151039,0.00044177152,0.00040745683,0.0003661882,0.00025295527],"domain_scores_gemma":[0.99750066,0.000034951736,0.00039739595,0.0017068364,0.00019500838,0.00016512802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003234376,0.00014807908,0.00031432096,0.0000666075,0.0002702399,0.0004104126,0.002052746,0.00008962877,0.00002726487],"category_scores_gemma":[0.00009075393,0.00012861549,0.000078234814,0.00008204921,0.00006607145,0.000902354,0.00023004612,0.00008436099,0.00004453232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000359686,0.0044684694,0.30273986,0.00007577665,0.0002194089,0.000035785768,0.0034769622,0.48879388,0.004682432,0.010446885,0.0056758104,0.17934877],"study_design_scores_gemma":[0.000861866,0.00008976614,0.022938848,0.00001032638,0.000007192663,0.0000019282559,0.000053217547,0.9736036,0.0017712498,0.000012287752,0.0005011043,0.00014859467],"about_ca_topic_score_codex":0.0001829849,"about_ca_topic_score_gemma":0.000026377302,"teacher_disagreement_score":0.7568989,"about_ca_system_score_codex":0.000043938988,"about_ca_system_score_gemma":0.000048642585,"threshold_uncertainty_score":0.52447873},"labels":[],"label_agreement":null},{"id":"W2793853780","doi":"10.1016/j.isatra.2018.02.009","title":"Synchronization of multiple 3-DOF helicopters under actuator faults and saturations with prescribed performance","year":2018,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Graduate Research and Innovation Projects of Jiangsu Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Actuator; Synchronization (alternating current); Nonlinear system; Bounded function; Constraint (computer-aided design); Computer science; Scheme (mathematics); Attitude control; Control (management); Control engineering; Engineering; Channel (broadcasting); Mathematics; Artificial intelligence","score_opus":0.00971174946140192,"score_gpt":0.2044856315338952,"score_spread":0.1947738820724933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2793853780","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13950685,0.000026088206,0.8593194,0.00023811038,0.00024591555,0.00030136172,0.000036783702,0.00011028325,0.00021519924],"genre_scores_gemma":[0.9900619,0.000012542576,0.009583912,0.000049162623,0.000045585803,0.000039168877,0.00001096779,0.000009995109,0.00018679973],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990588,0.000039831808,0.00022425198,0.0002752786,0.00021066701,0.00019116102],"domain_scores_gemma":[0.99910146,0.000059948456,0.00009800648,0.00036871774,0.00028939865,0.00008246377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00007232126,0.00013123473,0.00014493843,0.00009019174,0.00022824356,0.00006282773,0.0002300695,0.000057526275,0.000024024757],"category_scores_gemma":[0.000013137173,0.000113504175,0.000031748776,0.00032772124,0.00013348064,0.0008046459,0.000008496661,0.00008013681,0.000033753855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015359008,0.003620362,0.021280464,0.0015923638,0.0030785638,0.000019627854,0.04802036,0.08179024,0.40316907,0.011446887,0.00209191,0.42235425],"study_design_scores_gemma":[0.0030229993,0.00059902656,0.032375563,0.00018015853,0.00008425775,0.000037174286,0.0002601406,0.93333226,0.027728043,0.000023662453,0.0019384911,0.00041819445],"about_ca_topic_score_codex":0.00012516654,"about_ca_topic_score_gemma":0.00023940367,"teacher_disagreement_score":0.85154206,"about_ca_system_score_codex":0.00004853856,"about_ca_system_score_gemma":0.000078644705,"threshold_uncertainty_score":0.4628566},"labels":[],"label_agreement":null},{"id":"W2800397421","doi":"10.1007/s10846-018-0862-0","title":"Fault-Tolerant Containment Control of Multiple Unmanned Aerial Vehicles Based on Distributed Sliding-Mode Observer","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Convex hull; Backstepping; Actuator; Observer (physics); Fault tolerance; Controller (irrigation); Control engineering; Lyapunov function; Sliding mode control; Computer science; Engineering; A priori and a posteriori; Regular polygon; Adaptive control; Distributed computing; Control (management); Mathematics; Nonlinear system; Artificial intelligence","score_opus":0.02447847323505504,"score_gpt":0.2607258914043471,"score_spread":0.23624741816929207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800397421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046480935,0.00042420157,0.9443942,0.0005165761,0.0069218823,0.0010231104,0.00010719077,0.00007236686,0.000059538936],"genre_scores_gemma":[0.9975869,0.000008637084,0.0011357425,0.00015375379,0.0009885364,0.000027657223,0.000016246602,0.00003709008,0.000045430566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934784,0.00080684916,0.0027850473,0.00052891695,0.0016675233,0.0007332636],"domain_scores_gemma":[0.99324524,0.0010193324,0.0025935653,0.0010345433,0.0016754403,0.00043186784],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0020370595,0.0005216758,0.0015091847,0.0003741436,0.00017959463,0.00032936328,0.0019536554,0.00022896257,0.000018252746],"category_scores_gemma":[0.0007008324,0.00041171076,0.0006073092,0.00051083585,0.00012801791,0.000424066,0.00010864207,0.00034342188,0.00007344911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020112165,0.0016807218,0.010297443,0.00029827212,0.0010927925,0.0002496065,0.00087750005,0.94837976,0.022901084,0.007979108,0.0028820883,0.0013503896],"study_design_scores_gemma":[0.0057165977,0.0020604138,0.0016747285,0.0012991282,0.00012603277,0.00009497388,0.00036437882,0.97271013,0.013833919,0.00003807489,0.0016683491,0.0004132586],"about_ca_topic_score_codex":0.00028670614,"about_ca_topic_score_gemma":0.000021597227,"teacher_disagreement_score":0.95110595,"about_ca_system_score_codex":0.0006607406,"about_ca_system_score_gemma":0.0003270386,"threshold_uncertainty_score":0.99983346},"labels":[],"label_agreement":null},{"id":"W2800626432","doi":"10.1002/oca.2424","title":"Topology‐based distributed optimization for multi‐UAV cooperative wildfire monitoring","year":2018,"lang":"en","type":"article","venue":"Optimal Control Applications and Methods","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute for Christian Studies; Toronto Rehabilitation Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Computer science; Cover (algebra); Network topology; Distributed computing; Real-time computing; Topology (electrical circuits); Engineering; Computer network","score_opus":0.03806791833056183,"score_gpt":0.3767145232547236,"score_spread":0.33864660492416176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2800626432","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017249965,0.00027029484,0.9961352,0.0008459263,0.00022734785,0.001899053,0.00016960851,0.0002172432,0.000062877305],"genre_scores_gemma":[0.23109308,0.000005737839,0.7662159,0.0001217128,0.00025840924,0.002199141,0.0000489776,0.000014574016,0.00004244923],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820787,0.00027373276,0.00039017777,0.0006279097,0.00011785512,0.00038248027],"domain_scores_gemma":[0.9981093,0.00049903756,0.0001999022,0.0005668893,0.00045117532,0.00017373559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008700854,0.00023456794,0.00035768675,0.00008992403,0.00058597396,0.000236426,0.00050182577,0.00014164027,0.000006148234],"category_scores_gemma":[0.00015747162,0.00021994417,0.00008690231,0.00038754698,0.00017242703,0.00030435255,0.000069101065,0.00010503998,0.0000062129725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071346614,0.0012289633,0.0024787853,0.00014328763,0.00078205764,0.000004587499,0.0008086681,0.1909708,0.05163976,0.112969466,0.00088533433,0.6373748],"study_design_scores_gemma":[0.0028421718,0.00016152948,0.0005937462,0.000012375333,0.000050290906,0.0000029165735,0.000043782908,0.97786474,0.0025832367,0.000049613067,0.015561744,0.00023387159],"about_ca_topic_score_codex":0.000020864809,"about_ca_topic_score_gemma":0.0000013406849,"teacher_disagreement_score":0.7868939,"about_ca_system_score_codex":0.00006957374,"about_ca_system_score_gemma":0.0000921848,"threshold_uncertainty_score":0.89690626},"labels":[],"label_agreement":null},{"id":"W2801218469","doi":"10.1002/asjc.1774","title":"Unmanned Aerial Vehicles Formation Using Learning Based Model Predictive Control","year":2018,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Flocking (texture); Model predictive control; Computer science; Control engineering; Control (management); Aerodynamics; Control theory (sociology); Artificial intelligence; Engineering; Aerospace engineering","score_opus":0.01496177374414725,"score_gpt":0.24110214153519743,"score_spread":0.22614036779105018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801218469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012726555,0.00008089411,0.98405474,0.0014998086,0.0007975451,0.00036879923,0.00001867193,0.00007346629,0.0003795074],"genre_scores_gemma":[0.9939339,6.755976e-7,0.0048133815,0.0003348119,0.0008763735,0.000006906668,0.0000017006291,0.000018545676,0.000013660026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99720037,0.0005099164,0.00093075825,0.00022696661,0.00066872203,0.0004632807],"domain_scores_gemma":[0.9970379,0.00012934252,0.001260845,0.0003105917,0.0010160352,0.00024528772],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012823887,0.00023680857,0.00054612494,0.00028324677,0.00027614777,0.00031001464,0.0008461272,0.0001229876,0.000007702239],"category_scores_gemma":[0.0003447566,0.00020946753,0.00025722446,0.0002462807,0.000090395544,0.0018381717,0.000030811472,0.00033908515,0.000019809135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022614251,0.00020949222,0.0012881845,0.00003317767,0.00053599494,0.0001007878,0.0022332005,0.9257099,0.046881367,0.0026265502,0.0005753655,0.017544523],"study_design_scores_gemma":[0.011932372,0.00072890945,0.00049359165,0.000118017706,0.00010666164,0.00009057353,0.00011228332,0.9847302,0.00085711025,0.00042884043,0.0002146297,0.00018682654],"about_ca_topic_score_codex":0.0000041656563,"about_ca_topic_score_gemma":0.0000034715451,"teacher_disagreement_score":0.9812074,"about_ca_system_score_codex":0.00021793763,"about_ca_system_score_gemma":0.00036876023,"threshold_uncertainty_score":0.8541838},"labels":[],"label_agreement":null},{"id":"W2801529304","doi":"10.1145/3213526.3213542","title":"Graph-theoretic approach for UAV-aided network connectivity","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Citation; Computer science; Graph; World Wide Web; Information retrieval; Operations research; Engineering; Theoretical computer science","score_opus":0.020261850986594936,"score_gpt":0.24299857009367362,"score_spread":0.22273671910707868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801529304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018229107,0.000048335805,0.9707261,0.00025228722,0.00087532337,0.0008654011,0.000008328633,0.0004687438,0.024932591],"genre_scores_gemma":[0.90808076,8.4608797e-7,0.0904133,0.00036920747,0.0005277406,0.00017478371,0.000011193629,0.000013795363,0.0004083528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980893,0.00015076324,0.00029204105,0.0006253086,0.00023665706,0.0006058895],"domain_scores_gemma":[0.9982961,0.0003000068,0.00012514307,0.0009075736,0.00022455816,0.00014666573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009860913,0.00020234619,0.00029670156,0.00006216579,0.00025035898,0.0002317387,0.0011014043,0.000096834716,0.000029642966],"category_scores_gemma":[0.00013339294,0.00016956145,0.00015959007,0.000508522,0.00015082283,0.00032935536,0.00017985796,0.000079315185,0.00008008016],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025986707,0.00009926423,0.0007345311,0.000024170282,0.000063327825,0.0000011739874,0.00012294353,0.00026299065,0.0002254836,0.9789094,0.014057768,0.0054729804],"study_design_scores_gemma":[0.0017793508,0.00030826218,0.0014315423,0.000017114287,0.000024748892,0.000015809384,0.000040257444,0.93616563,0.0010820916,0.05288265,0.0057940083,0.00045851327],"about_ca_topic_score_codex":0.00004185694,"about_ca_topic_score_gemma":0.000016038715,"teacher_disagreement_score":0.93590266,"about_ca_system_score_codex":0.000042257147,"about_ca_system_score_gemma":0.00004685138,"threshold_uncertainty_score":0.6914515},"labels":[],"label_agreement":null},{"id":"W2801657714","doi":"10.1007/s11071-018-4286-y","title":"Distributed adaptive control for multiple under-actuated Lagrangian systems under fixed or switching topology","year":2018,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Ontario Centres of Excellence","keywords":"Control theory (sociology); Tracking error; Graph; Convergence (economics); Dwell time; Synchronization (alternating current); Lagrangian; Computer science; Tracking (education); Adaptive control; Topology (electrical circuits); Mathematics; Control (management); Applied mathematics; Theoretical computer science","score_opus":0.027550903701747582,"score_gpt":0.27228880459359744,"score_spread":0.24473790089184985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801657714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013912786,0.00005601503,0.97802275,0.0013973567,0.0023992048,0.0017077411,0.0018316156,0.0005882017,0.00008430723],"genre_scores_gemma":[0.97815365,0.0000027913356,0.01968107,0.00040045724,0.0005944686,0.00015164772,0.0006589477,0.000058236474,0.00029872867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966754,0.00026780384,0.0007941126,0.0008807266,0.00040410968,0.0009778717],"domain_scores_gemma":[0.99647313,0.0010362992,0.0004598242,0.0010174373,0.0007339967,0.00027931912],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060598017,0.00046956036,0.00073733256,0.00017450581,0.00043714137,0.00035682938,0.0013421483,0.00037547233,0.000009783242],"category_scores_gemma":[0.00037314362,0.00039936346,0.00021608346,0.0006014569,0.00014866277,0.0004266273,0.00018155442,0.00028434207,0.00009442514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00848562,0.0038677873,0.008580334,0.0007646387,0.006390529,0.0004248363,0.0031904944,0.14935817,0.016872145,0.7526851,0.0047404994,0.044639807],"study_design_scores_gemma":[0.0052222675,0.0005478299,0.0006632374,0.000060640126,0.00006713698,0.000052680123,0.00052509573,0.9897819,0.00006571901,0.00043587733,0.0020889048,0.0004886852],"about_ca_topic_score_codex":0.0006017647,"about_ca_topic_score_gemma":0.0027352078,"teacher_disagreement_score":0.96424085,"about_ca_system_score_codex":0.00056858326,"about_ca_system_score_gemma":0.00030037187,"threshold_uncertainty_score":0.9998458},"labels":[],"label_agreement":null},{"id":"W2801697436","doi":"10.1145/3157087","title":"Viable Algorithmic Options for Designing Reactive Robot Swarms","year":2018,"lang":"en","type":"article","venue":"ACM Transactions on Autonomous and Adaptive Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Swarm behaviour; Computer science; Generalization; Robot; Grid; Controller (irrigation); Swarm robotics; Computation; Polynomial; Mathematical optimization; Theoretical computer science; Artificial intelligence; Algorithm; Mathematics","score_opus":0.03448154414440316,"score_gpt":0.25922872384737156,"score_spread":0.2247471797029684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801697436","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003769358,0.00025382216,0.99503404,0.00035077368,0.0014230697,0.0015191818,0.00015375097,0.0003639352,0.0005245188],"genre_scores_gemma":[0.9167462,0.00001323854,0.08067124,0.00006697837,0.0002464482,0.0007921162,0.000008593513,0.00003350944,0.0014216953],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978384,0.0001567278,0.0004648005,0.0007699002,0.00024150337,0.00052869885],"domain_scores_gemma":[0.9979924,0.00038926935,0.0002217261,0.0008474328,0.00034128194,0.00020789319],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050266087,0.00032106353,0.00042179765,0.0002297202,0.00081560574,0.00036377975,0.00071055564,0.00014616018,0.000007040734],"category_scores_gemma":[0.000033711633,0.00030202675,0.00014721048,0.00035631907,0.0001228331,0.0006818535,0.00002132596,0.0001952816,0.000085077045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000756834,0.002645433,0.00009190553,0.0004199943,0.0037309544,0.00007813601,0.012183654,0.0963578,0.09206525,0.22401193,0.002137654,0.56552047],"study_design_scores_gemma":[0.003292423,0.002285372,0.00024153695,0.00033216272,0.0001464225,0.00015534698,0.001913673,0.9521094,0.0107841045,0.0017622289,0.025918985,0.0010583466],"about_ca_topic_score_codex":0.00044704002,"about_ca_topic_score_gemma":0.000030190256,"teacher_disagreement_score":0.91636926,"about_ca_system_score_codex":0.0002530498,"about_ca_system_score_gemma":0.00014648928,"threshold_uncertainty_score":0.9999432},"labels":[],"label_agreement":null},{"id":"W2804333087","doi":"10.1007/s11768-018-7300-5","title":"Flocking control of a fleet of unmanned aerial vehicles","year":2018,"lang":"en","type":"article","venue":"Control Theory and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Flocking (texture); Control theory (sociology); Computer science; Kinematics; Control engineering; Engineering; Control (management); Artificial intelligence","score_opus":0.005974377718039291,"score_gpt":0.2205219167998256,"score_spread":0.2145475390817863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804333087","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2531595,0.00096345245,0.743263,0.0008885644,0.00048631468,0.0004614701,0.00004812454,0.000265985,0.0004636171],"genre_scores_gemma":[0.9993188,0.000005149037,0.00040642015,0.000096202006,0.000104016304,0.000033596578,0.0000010458673,0.000009614537,0.000025189713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983616,0.00029490778,0.00049616484,0.00036046797,0.0001486749,0.00033816774],"domain_scores_gemma":[0.9981368,0.00045280496,0.00036101017,0.00069479656,0.00029995202,0.000054606477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010933358,0.00017706821,0.00059486425,0.0003095152,0.00009475286,0.000024065712,0.0008958291,0.0002466695,0.000010804346],"category_scores_gemma":[0.00052147993,0.000156571,0.00007395079,0.00042285552,0.0007607309,0.00015602875,0.00014890822,0.00012586583,0.0000098697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003512026,0.00005906178,0.0011025486,0.000020192252,0.00015518739,0.0000062742806,0.000113767834,0.0000049428318,0.15393756,0.8222731,0.000024067143,0.021952132],"study_design_scores_gemma":[0.04026945,0.0033695113,0.0025767768,0.00034560458,0.00032187713,0.00014630969,0.00054590456,0.08186122,0.24914101,0.61471504,0.0057284255,0.0009788868],"about_ca_topic_score_codex":0.000008581516,"about_ca_topic_score_gemma":0.000004799677,"teacher_disagreement_score":0.74615926,"about_ca_system_score_codex":0.000014108323,"about_ca_system_score_gemma":0.000051931198,"threshold_uncertainty_score":0.638478},"labels":[],"label_agreement":null},{"id":"W2807653263","doi":"10.1016/j.nahs.2018.05.005","title":"Consensus of multi-agent systems via hybrid impulsive protocols with time-delay","year":2018,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Network topology; Computer science; Protocol (science); Multi-agent system; Consensus; Discrete time and continuous time; Topology (electrical circuits); Control theory (sociology); Distributed computing; Mathematical optimization; Mathematics; Computer network; Control (management); Artificial intelligence","score_opus":0.017847310854950012,"score_gpt":0.2720753803366397,"score_spread":0.2542280694816897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807653263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03739657,0.00039560182,0.9432967,0.00008167871,0.0008098425,0.01591042,0.0009592696,0.0005376722,0.00061229453],"genre_scores_gemma":[0.98737967,0.0000018732463,0.006474893,0.000040852672,0.0006434075,0.0031364318,0.0001853435,0.00007931347,0.002058196],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920921,0.0010881696,0.0023317586,0.0016208538,0.001783711,0.0010834571],"domain_scores_gemma":[0.99146885,0.00029714094,0.0020791031,0.0032043667,0.0024195397,0.0005309996],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019721217,0.00080846116,0.0023584922,0.0009692746,0.00031319848,0.0006266461,0.00230913,0.00014117653,0.00003137437],"category_scores_gemma":[0.0001266179,0.00064946816,0.000719671,0.0025686456,0.00036993274,0.00036233675,0.0003305605,0.0003041636,0.0007835924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030440683,0.01360449,0.10945348,0.008226812,0.13046892,0.009798859,0.0049510496,0.5422234,0.11898618,0.004204939,0.042846054,0.012191767],"study_design_scores_gemma":[0.0023722276,0.0005577521,0.00024427363,0.00029674664,0.0007848601,0.00047304528,0.00010203487,0.98200405,0.0040332526,0.0000020211044,0.008380619,0.0007491465],"about_ca_topic_score_codex":0.0018761378,"about_ca_topic_score_gemma":0.000091179805,"teacher_disagreement_score":0.9499831,"about_ca_system_score_codex":0.00031913313,"about_ca_system_score_gemma":0.0003639571,"threshold_uncertainty_score":0.9999944},"labels":[],"label_agreement":null},{"id":"W2808817487","doi":"10.1016/j.jfranklin.2018.05.065","title":"A cyclic pursuit framework for networked mobile agents based on vector field approach","year":2018,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Centroid; Integrator; Vector field; Polygon (computer graphics); Double integrator; Field (mathematics); Topology (electrical circuits); Computer science; Swarm behaviour; Control theory (sociology); Angular velocity; Algorithm; Multi-agent system; Mathematics; Artificial intelligence; Control (management); Physics; Geometry; Telecommunications","score_opus":0.026811147245137126,"score_gpt":0.28673276806942377,"score_spread":0.25992162082428666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808817487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064262957,0.0001115417,0.9754104,0.0017673215,0.014362235,0.0009253959,0.000011818477,0.00004465222,0.0009403429],"genre_scores_gemma":[0.94406754,0.0000041370004,0.050599117,0.0025793745,0.0024322297,0.00010832619,0.0000017749497,0.0000173975,0.00019013112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978392,0.0001455569,0.0006344233,0.0002857716,0.0006968984,0.00039812608],"domain_scores_gemma":[0.99754065,0.00038431684,0.00070162804,0.00094250595,0.0002719669,0.00015892553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009909868,0.00022154572,0.0003859229,0.00012045356,0.0003088312,0.00026820545,0.0029661835,0.00018827614,0.00001529765],"category_scores_gemma":[0.0005139543,0.00014624136,0.00044426715,0.0004755399,0.0000986711,0.0003893692,0.00015141726,0.00045009778,0.00002871162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030489615,0.0043769544,0.0045548514,0.00045833498,0.002007449,0.00015494776,0.002834063,0.35506013,0.0029627034,0.12739065,0.35098752,0.14616345],"study_design_scores_gemma":[0.0038564766,0.0015210975,0.001781257,0.0006797023,0.000114754,0.00005815331,0.000022364318,0.6536909,0.0016084033,0.0045720893,0.33166453,0.0004303067],"about_ca_topic_score_codex":0.000010724876,"about_ca_topic_score_gemma":0.0000037425143,"teacher_disagreement_score":0.9376412,"about_ca_system_score_codex":0.00011269099,"about_ca_system_score_gemma":0.00018491688,"threshold_uncertainty_score":0.59635496},"labels":[],"label_agreement":null},{"id":"W2809051949","doi":"10.1007/s12555-016-0723-1","title":"On Stability and Inverse Optimality for a Class of Multi-agent Linear Consensus Protocols","year":2018,"lang":"en","type":"article","venue":"International Journal of Control Automation and Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Laplacian matrix; Mathematics; Algebraic graph theory; Inverse; Directed graph; Consensus; Strongly connected component; Algebraic connectivity; Laplace operator; Multi-agent system; Graph; Mathematical optimization; Topology (electrical circuits); Discrete mathematics; Computer science; Combinatorics; Mathematical analysis","score_opus":0.054280861450186804,"score_gpt":0.3373554002896519,"score_spread":0.2830745388394651,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809051949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16689068,0.000064548614,0.8254536,0.0011969514,0.0012980794,0.0048191296,0.00014509591,0.000039706727,0.000092257826],"genre_scores_gemma":[0.99560344,0.000001510685,0.0037858037,0.00011402295,0.00020060205,0.00026565004,0.0000021718818,0.0000059297067,0.00002088548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977613,0.00029307543,0.0010418446,0.00020377371,0.00056247885,0.00013751237],"domain_scores_gemma":[0.995899,0.0004910309,0.0011952841,0.00020145229,0.002092221,0.000120974146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018755198,0.00013814677,0.00040524098,0.00017280337,0.000057553305,0.00017680807,0.00041328155,0.000075648946,0.000004575374],"category_scores_gemma":[0.0007021187,0.00011108338,0.000104824794,0.00006695155,0.00011500802,0.000258932,0.000041512034,0.0000850585,0.0000024850729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015379284,0.006480013,0.064222954,0.003126522,0.008621718,0.00023922474,0.015588182,0.0225711,0.18312955,0.5931036,0.011075158,0.076462686],"study_design_scores_gemma":[0.0080821905,0.00058783125,0.005098355,0.0002560359,0.000018390947,0.00009132541,0.00010002379,0.98274237,0.00064878946,0.00019428822,0.002072704,0.000107714455],"about_ca_topic_score_codex":0.00003243319,"about_ca_topic_score_gemma":0.000010083382,"teacher_disagreement_score":0.9601712,"about_ca_system_score_codex":0.00010172436,"about_ca_system_score_gemma":0.00012400564,"threshold_uncertainty_score":0.45298487},"labels":[],"label_agreement":null},{"id":"W2809614028","doi":"10.1109/tsmc.2018.2840821","title":"Analysis of Consensus-Based Economic Dispatch Algorithm Under Time Delays","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":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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":"Economic dispatch; Convergence (economics); Constant (computer programming); Computer science; Mathematical optimization; Upper and lower bounds; Protocol (science); Smart grid; Control (management); Control theory (sociology); Mathematics; Electric power system; Power (physics); Engineering; Artificial intelligence","score_opus":0.011838975607648138,"score_gpt":0.22837668862560637,"score_spread":0.21653771301795824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809614028","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028253326,0.000299918,0.966527,0.00009447123,0.0024217612,0.0007978583,0.00063688186,0.00021365775,0.00075515144],"genre_scores_gemma":[0.99757165,0.000010186779,0.0005605577,0.000039190236,0.00012821535,0.00010070516,0.000017046741,0.00003559437,0.0015368522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655724,0.00044172702,0.0011604747,0.0008248895,0.0005141573,0.0005015443],"domain_scores_gemma":[0.9972753,0.00034270497,0.0005521672,0.0012516166,0.00028649776,0.00029171884],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006938049,0.00042184335,0.001038189,0.0007434447,0.00022994398,0.00038698176,0.0006836999,0.00024727205,0.000023873235],"category_scores_gemma":[0.0000030005374,0.00040779944,0.00031141617,0.00079959084,0.00023459819,0.00013344586,0.0000073492783,0.00017204581,0.00028682715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012875652,0.0008966993,0.0009525327,0.00052815914,0.009343653,0.000050087237,0.0012726714,0.95872885,0.0037277848,0.0091312025,0.0026815017,0.012558108],"study_design_scores_gemma":[0.0010159754,0.00028297366,0.0003063346,0.0001466979,0.00059027364,0.00003202334,0.00019596102,0.99533266,0.00062301016,0.000008687401,0.0010520834,0.00041329817],"about_ca_topic_score_codex":0.0020134752,"about_ca_topic_score_gemma":0.00017777791,"teacher_disagreement_score":0.96931833,"about_ca_system_score_codex":0.0002396543,"about_ca_system_score_gemma":0.00013776352,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W28304625","doi":"10.1007/978-3-540-88063-9_3","title":"A Distributed Network Enabled Weapon-Target Assignment for Combat Formations","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Travelling salesman problem; Mathematical optimization; Engineering; Graph; Operations research; Computer science; Mathematics; Theoretical computer science","score_opus":0.015497532335367891,"score_gpt":0.22778063140698862,"score_spread":0.21228309907162074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28304625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000065684353,0.0011657699,0.97919697,0.0026835252,0.00073593523,0.0017345072,0.0005290628,0.00013976726,0.013807907],"genre_scores_gemma":[0.96477973,0.00068612956,0.023764012,0.0068638693,0.0006627479,0.00081709167,0.0014126052,0.00003695932,0.0009768726],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969548,0.000057123812,0.0011578852,0.00042716076,0.0007446197,0.00065839017],"domain_scores_gemma":[0.9971683,0.00108324,0.0008544796,0.0004364533,0.00029937533,0.00015813182],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011011397,0.0004676404,0.0007022671,0.00037839374,0.00072565436,0.0007603359,0.0010246919,0.0003724704,0.000017844195],"category_scores_gemma":[0.0003688677,0.00037925722,0.00018043924,0.00031282846,0.00024619696,0.003563299,0.00014376675,0.00032244687,0.000031951622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019189516,0.00007624568,0.0004073787,0.00034301716,0.00032298238,0.00001054257,0.002791365,0.38780737,0.000028488088,0.44762802,0.018377401,0.1420153],"study_design_scores_gemma":[0.0025698857,0.00021628769,0.00017141078,0.0001703477,0.00002406833,0.000028274233,0.000008480287,0.6402328,0.000012291831,0.023394627,0.3326466,0.000524925],"about_ca_topic_score_codex":0.000021695754,"about_ca_topic_score_gemma":0.000030205554,"teacher_disagreement_score":0.9647731,"about_ca_system_score_codex":0.0001755812,"about_ca_system_score_gemma":0.00031080827,"threshold_uncertainty_score":0.99986595},"labels":[],"label_agreement":null},{"id":"W2852609008","doi":"10.1109/tcsii.2018.2853654","title":"Energy-Efficient Semi-Flocking Control of Mobile Sensor Networks on Rough Terrains","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits & Systems II Express Briefs","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Department of Industrial and Systems Engineering, Hong Kong Polytechnic University","keywords":"Flocking (texture); Terrain; Patrolling; Computer science; Wireless sensor network; Real-time computing; Distributed computing; Computer network; Geography","score_opus":0.014062620929947115,"score_gpt":0.22727918155870497,"score_spread":0.21321656062875785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2852609008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00922214,0.000311024,0.98070383,0.000064978696,0.0061862734,0.0013078825,0.0002827153,0.00058005645,0.0013411021],"genre_scores_gemma":[0.9973528,0.000010410129,0.000085986816,0.00025385493,0.00064532907,0.000683532,0.0000069094017,0.000075188014,0.00088599144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946027,0.00063163805,0.0013561592,0.001252045,0.0011492459,0.0010082466],"domain_scores_gemma":[0.9959018,0.0005038694,0.0006774711,0.0020384223,0.0005312159,0.00034716926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007108939,0.0006296572,0.0010132459,0.00040326169,0.0007737751,0.00029312295,0.0015026622,0.00036371496,0.000023785416],"category_scores_gemma":[0.000015282863,0.0006195855,0.0004127279,0.00083252665,0.00022043503,0.0003659886,0.00001379128,0.00042217626,0.000057635418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000510029,0.0007549165,0.000009640263,0.000069326794,0.00028501695,0.000026488897,0.0017268402,0.9649682,0.017394874,0.0016692363,0.00059730123,0.0124471225],"study_design_scores_gemma":[0.0030044748,0.0009130346,0.000029506667,0.0008559904,0.00008213753,0.0000861047,0.00021537153,0.96344846,0.015860096,0.00000562266,0.014776557,0.0007226519],"about_ca_topic_score_codex":0.00070710166,"about_ca_topic_score_gemma":0.000027214266,"teacher_disagreement_score":0.9881306,"about_ca_system_score_codex":0.00031942883,"about_ca_system_score_gemma":0.00015392991,"threshold_uncertainty_score":0.99962556},"labels":[],"label_agreement":null},{"id":"W2883913910","doi":"10.1109/tac.2018.2860546","title":"Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Regret; Computer science; Mathematical optimization; Graph; Strongly connected component; Directed graph; State (computer science); Function (biology); Undirected graph; Minification; Mathematics; Theoretical computer science; Algorithm; Machine learning","score_opus":0.026769244361693437,"score_gpt":0.3015330282238173,"score_spread":0.27476378386212386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883913910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037102979,0.000034084347,0.98997355,0.0012472486,0.0019811892,0.0014077467,0.0011944347,0.00042447285,0.000026984768],"genre_scores_gemma":[0.95591044,0.0000024060625,0.043280862,0.00018900222,0.00014798516,0.00034837986,0.000017925802,0.000022745131,0.00008026279],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975255,0.0002845701,0.0007655214,0.00045088376,0.0005508263,0.0004226938],"domain_scores_gemma":[0.99602723,0.002198911,0.0004801498,0.0008459816,0.00034168045,0.00010603225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011952805,0.00027284524,0.0004607136,0.00018611565,0.0005086376,0.0001876799,0.0010557348,0.00011602693,0.000022486229],"category_scores_gemma":[0.00014521771,0.00020754416,0.00030319675,0.0005398838,0.00013267064,0.0003003063,0.000004986397,0.00017375921,0.00001350559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014909386,0.0007667833,0.00004003399,0.00010115404,0.0015370524,0.0000028739562,0.0016409775,0.030576985,0.009343029,0.00100421,0.00060823123,0.9542296],"study_design_scores_gemma":[0.0038877036,0.00030868506,0.0009823219,0.000079144935,0.00023252907,0.000017416138,0.00013194603,0.9875376,0.005714858,0.00013528105,0.0007715172,0.00020094724],"about_ca_topic_score_codex":0.00015678606,"about_ca_topic_score_gemma":0.00013863541,"teacher_disagreement_score":0.9569607,"about_ca_system_score_codex":0.00013522139,"about_ca_system_score_gemma":0.000106976324,"threshold_uncertainty_score":0.8463405},"labels":[],"label_agreement":null},{"id":"W2884849603","doi":"10.1137/19m1241799","title":"A Collisionless Singular Cucker--Smale Model with Decentralized Formation Control","year":2019,"lang":"en","type":"preprint","venue":"SIAM Journal on Applied Dynamical Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Ministerstwo Edukacji i Nauki; National Research Foundation of Korea; Fondo Nacional de Desarrollo Científico y Tecnológico; National Science Foundation","keywords":"Platoon; Control theory (sociology); Decentralised system; Control (management); Extension (predicate logic); Computer science; Controller (irrigation); Collision; Term (time); Collision avoidance; Physics; Artificial intelligence","score_opus":0.012978481537445114,"score_gpt":0.22975413812146203,"score_spread":0.21677565658401693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884849603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017477363,0.00039435487,0.97268534,0.00051642815,0.0026766092,0.003931259,0.00019662394,0.00035858754,0.0017634433],"genre_scores_gemma":[0.992371,0.000043240252,0.0062145996,0.0002345158,0.00032400194,0.00034595016,0.00013545493,0.00009783412,0.00023337592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924446,0.00056152587,0.0020283395,0.001251606,0.0024806098,0.0012333466],"domain_scores_gemma":[0.9940843,0.00029403207,0.0023872613,0.0018760248,0.00059970963,0.0007586604],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016624345,0.001027828,0.0019596627,0.00045126516,0.0003754293,0.0026738911,0.0030011209,0.0008598978,0.0000057479956],"category_scores_gemma":[0.000055985347,0.00078477705,0.0004770164,0.0004183163,0.00008153917,0.0005016841,0.0004911535,0.0021949462,0.0002524548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005064313,0.00028303452,0.00007230935,0.00039448074,0.00035648746,0.00010159847,0.00019128135,0.93895227,0.0006740089,0.057110604,0.000590723,0.0007667795],"study_design_scores_gemma":[0.007100105,0.00017660843,0.00008231943,0.0013487841,0.00012177184,0.0003760414,0.00007131259,0.9873819,0.00002782904,0.001121246,0.0012798402,0.00091227336],"about_ca_topic_score_codex":0.000029857058,"about_ca_topic_score_gemma":0.0000051443762,"teacher_disagreement_score":0.9748937,"about_ca_system_score_codex":0.0016793485,"about_ca_system_score_gemma":0.0007219892,"threshold_uncertainty_score":0.99946034},"labels":[],"label_agreement":null},{"id":"W2885100423","doi":"10.23919/acc.2018.8431898","title":"Distributed Dynamic Average Consensus in Asymmetric Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Convergence (economics); Computer science; Upper and lower bounds; Graph; Graph theory; Mathematical optimization; Control theory (sociology); Mathematics; Control (management); Theoretical computer science; Artificial intelligence","score_opus":0.009321970300248922,"score_gpt":0.2387182245368302,"score_spread":0.22939625423658128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885100423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009284331,0.00013585304,0.9823638,0.000669906,0.0010512781,0.00034401036,0.000025988551,0.0003850842,0.0057397503],"genre_scores_gemma":[0.9966456,0.000004592254,0.0024938239,0.0002556124,0.0000848722,0.000021164875,0.00003615762,0.000011833258,0.0004463286],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977753,0.00017513809,0.0004946446,0.00058454525,0.00031057515,0.0006597779],"domain_scores_gemma":[0.9984131,0.00025338784,0.00013457131,0.0008705973,0.00016224605,0.00016613126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053618685,0.00022438614,0.00030490523,0.00030184997,0.00009967825,0.00022551807,0.0010935786,0.00013690753,0.00003295594],"category_scores_gemma":[0.00018425418,0.00020623402,0.00007980441,0.0023027384,0.00009046101,0.00019331713,0.00027179794,0.00019487522,0.0003830392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031969545,0.0025947443,0.06684212,0.00011371412,0.00080925896,0.0025075201,0.0012135583,0.073703796,0.0019539322,0.34599602,0.09815019,0.40579545],"study_design_scores_gemma":[0.0011805942,0.000071188195,0.025164789,0.00001652692,0.0000038022986,0.000027784676,0.000013813948,0.96966445,0.00006310695,0.00029290555,0.0032413448,0.00025967337],"about_ca_topic_score_codex":0.00023360648,"about_ca_topic_score_gemma":0.00031240645,"teacher_disagreement_score":0.9873613,"about_ca_system_score_codex":0.00022193397,"about_ca_system_score_gemma":0.00006636261,"threshold_uncertainty_score":0.84099793},"labels":[],"label_agreement":null},{"id":"W2885652030","doi":"10.23919/acc.2018.8431665","title":"Distributed adaptive attitude control for multiple underactuated flexible spacecraft","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Underactuation; Spacecraft; Control theory (sociology); Controller (irrigation); Adaptive control; Attitude control; Computer science; Rigid body; Control (management); Control engineering; Engineering; Aerospace engineering; Physics; Artificial intelligence","score_opus":0.03162025564791401,"score_gpt":0.27131483311355775,"score_spread":0.23969457746564374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885652030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012569544,0.000042543044,0.9914142,0.0021170205,0.0008913174,0.0015768793,0.00044480685,0.001002959,0.0012533024],"genre_scores_gemma":[0.9729583,9.788453e-7,0.024455836,0.00063384324,0.00029965604,0.00024688558,0.00015358026,0.00002649838,0.0012243744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997339,0.00012352204,0.0004983042,0.0008050431,0.00040448533,0.0008296378],"domain_scores_gemma":[0.997061,0.0007175769,0.0002312078,0.0009690954,0.0007342302,0.00028689526],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00048310886,0.00035111257,0.0004681713,0.00012108193,0.00034749543,0.0003504654,0.0012299338,0.00015491528,0.00008372739],"category_scores_gemma":[0.00039082926,0.00030627762,0.00020044224,0.00051534735,0.00012713757,0.00070623175,0.00016527346,0.0001271686,0.0009339857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024904038,0.002599983,0.01557551,0.00015906832,0.0031972106,0.00013233178,0.0014506631,0.0039902413,0.061159097,0.6109001,0.2771729,0.02117248],"study_design_scores_gemma":[0.00785824,0.0005630954,0.0030858284,0.000033384098,0.000041836844,0.000015570164,0.00009434974,0.93683803,0.0066303145,0.0014658559,0.04281844,0.0005550751],"about_ca_topic_score_codex":0.00019070253,"about_ca_topic_score_gemma":0.00025354562,"teacher_disagreement_score":0.9717014,"about_ca_system_score_codex":0.00020145373,"about_ca_system_score_gemma":0.00015777227,"threshold_uncertainty_score":0.9999389},"labels":[],"label_agreement":null},{"id":"W2886432092","doi":"10.1007/s11424-018-6236-7","title":"Homogeneous Finite-Time Consensus Control for Higher-Order Multi-Agent Systems by Full Order Sliding Mode","year":2018,"lang":"en","type":"article","venue":"Journal of Systems Science and Complexity","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Control theory (sociology); Sliding mode control; Convergence (economics); Lyapunov function; Nonlinear system; Computer science; Consensus; Function (biology); Variable structure control; Multi-agent system; Mathematics; Control (management); Physics; Artificial intelligence","score_opus":0.05211180931699406,"score_gpt":0.28588723650947656,"score_spread":0.2337754271924825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886432092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04439015,0.0023086516,0.9449477,0.0008870384,0.0054753404,0.0014041315,0.00026698853,0.00010874325,0.00021126607],"genre_scores_gemma":[0.9877237,0.000010878762,0.0109072495,0.00018486238,0.0006529033,0.0000354849,0.00000316927,0.000023889934,0.00045787392],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947087,0.00035904732,0.0015522363,0.0007749441,0.0016017286,0.0010033125],"domain_scores_gemma":[0.99113756,0.00060819107,0.001553179,0.00076531846,0.005306564,0.00062917505],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004370112,0.00043306116,0.0010642966,0.00039257822,0.0010424255,0.0014632393,0.0021304842,0.00015302362,0.000006934283],"category_scores_gemma":[0.0007235696,0.00034952635,0.0001600012,0.0012266276,0.00091224065,0.0008413407,0.00022737433,0.0002420369,0.000047232188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013534192,0.0023861856,0.0024800554,0.0014022184,0.0017140328,0.00044011,0.0043774648,0.02668731,0.7579367,0.11706015,0.077892244,0.0062701087],"study_design_scores_gemma":[0.0040201894,0.0008634928,0.00018931042,0.00025620693,0.00006326692,0.0007727542,0.00026194888,0.97792923,0.00036240031,0.00019723311,0.014598506,0.0004854718],"about_ca_topic_score_codex":0.00036833805,"about_ca_topic_score_gemma":0.000012821634,"teacher_disagreement_score":0.9512419,"about_ca_system_score_codex":0.00039557778,"about_ca_system_score_gemma":0.0007551415,"threshold_uncertainty_score":0.9998957},"labels":[],"label_agreement":null},{"id":"W2887052332","doi":"10.23919/acc.2018.8431516","title":"A Follower-Based Control Allocation in Multi-Agent Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Control (management); Computer science; Swarm intelligence; Mathematical optimization; Multi-agent system; State (computer science); Control theory (sociology); Matrix (chemical analysis); Mathematics; Artificial intelligence; Particle swarm optimization; Algorithm; Economics","score_opus":0.02297570779924097,"score_gpt":0.26100152212277805,"score_spread":0.2380258143235371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887052332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029747842,0.00007240953,0.9926816,0.0011041686,0.0009816695,0.00065157516,0.0000029640232,0.00029962367,0.0012311856],"genre_scores_gemma":[0.9882157,8.721422e-7,0.009827581,0.0013807869,0.00011926834,0.0001147247,0.0000080912305,0.000011920022,0.0003210588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805754,0.00018203515,0.00044662794,0.0005222321,0.00029811778,0.00049344567],"domain_scores_gemma":[0.99864733,0.00012162139,0.00013146822,0.000780649,0.00017836883,0.0001405551],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006538654,0.00019714904,0.0002569877,0.00015295029,0.000083750274,0.00018566546,0.0009197271,0.00011302479,0.000036606132],"category_scores_gemma":[0.00008649615,0.00017817375,0.00009438047,0.0005539855,0.000050769577,0.0003323522,0.00005302042,0.00011466118,0.0003063432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007858359,0.007910161,0.20787777,0.00015343494,0.00080547197,0.0005415576,0.0030074078,0.2989431,0.031735767,0.19322236,0.040548455,0.2144687],"study_design_scores_gemma":[0.004330233,0.000098540346,0.012236966,0.000026057378,0.0000058580563,0.0000017185605,0.000011415749,0.98010737,0.0003569944,0.000027420234,0.0025894893,0.00020794313],"about_ca_topic_score_codex":0.00030247646,"about_ca_topic_score_gemma":0.0006422487,"teacher_disagreement_score":0.98524094,"about_ca_system_score_codex":0.0001557118,"about_ca_system_score_gemma":0.00009739246,"threshold_uncertainty_score":0.72657144},"labels":[],"label_agreement":null},{"id":"W2887322248","doi":"10.23919/acc.2018.8431490","title":"Joint Transmission Power Optimization and Connectivity Control in Asymmetric Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada; Concordia University","funders":"","keywords":"Mathematical optimization; Optimization problem; Subgradient method; Convex optimization; Convergence (economics); Interior point method; Computer science; Mathematics; Transmission (telecommunications); Regular polygon","score_opus":0.009350207553714414,"score_gpt":0.21398227298886838,"score_spread":0.20463206543515397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2887322248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026847313,0.00017286137,0.99251956,0.00067194627,0.00028761645,0.00037609375,0.0000014329032,0.00013448462,0.003151281],"genre_scores_gemma":[0.9901432,0.000008853309,0.009372873,0.00035343238,0.000044798682,0.0000145451495,0.0000017283728,0.0000068190384,0.000053755666],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998677,0.00017360548,0.00028279453,0.00039643847,0.00018325777,0.00028686377],"domain_scores_gemma":[0.9992622,0.00013377075,0.00008116973,0.00029700546,0.000106420914,0.00011944457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061797106,0.0001358424,0.00023376294,0.00021060125,0.00007740339,0.00015652706,0.00024348103,0.00009953681,0.000031138672],"category_scores_gemma":[0.00006721996,0.000114253045,0.000037015758,0.0007279716,0.00004093183,0.00045664067,0.00004947369,0.00009878764,0.000011562462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030263086,0.0013579204,0.034279022,0.000069361326,0.0002276174,0.00013366388,0.0016984227,0.40811893,0.004336374,0.1087266,0.0058267256,0.43492272],"study_design_scores_gemma":[0.0019924324,0.000121571415,0.011304424,0.000020161375,0.0000037060227,0.0000075212656,0.000009974991,0.9857269,0.00013249436,0.000078905185,0.00045908056,0.0001428323],"about_ca_topic_score_codex":0.00009797145,"about_ca_topic_score_gemma":0.000017362529,"teacher_disagreement_score":0.98745847,"about_ca_system_score_codex":0.000054616805,"about_ca_system_score_gemma":0.00002606473,"threshold_uncertainty_score":0.4659104},"labels":[],"label_agreement":null},{"id":"W2888117319","doi":"10.1115/1.4041202","title":"Impulsive Consensus of Networked Multi-Agent Systems With Distributed Delays in Agent Dynamics and Impulsive Protocols","year":2018,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Consensus; Network topology; Computer science; Protocol (science); Distributed computing; Control theory (sociology); Stability (learning theory); Topology (electrical circuits); Computer network; Mathematics; Control (management); Artificial intelligence","score_opus":0.01955098741442698,"score_gpt":0.25061464144488504,"score_spread":0.23106365403045806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888117319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098294556,0.0037839396,0.8830533,0.00029177224,0.0012515258,0.013059956,0.00018231833,0.000045806853,0.000036799822],"genre_scores_gemma":[0.9983908,0.000024484,0.00058118225,0.00002286218,0.00016397802,0.0007540761,0.000006666683,0.00003094007,0.000025042205],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942024,0.00086312887,0.0022212092,0.0005616436,0.0014611597,0.00069049856],"domain_scores_gemma":[0.9934957,0.00021272148,0.0028062605,0.00060173275,0.0025005278,0.00038303615],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0034799695,0.00052478723,0.0015436232,0.00039135918,0.00015371756,0.000351729,0.0007407659,0.00020047258,8.627234e-7],"category_scores_gemma":[0.00020684385,0.0003941891,0.00015568025,0.0004972422,0.00024511435,0.00032380258,0.00010900056,0.00034433365,0.0000019156316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020659687,0.008544003,0.58200747,0.011392934,0.02404762,0.005553083,0.013274394,0.14517006,0.09303081,0.023054834,0.0028395916,0.07042553],"study_design_scores_gemma":[0.016238285,0.0017118641,0.016981428,0.0025490206,0.00018433962,0.00076092593,0.0012083594,0.9597325,0.000029986768,0.000017627453,0.00014624637,0.00043941598],"about_ca_topic_score_codex":0.00036162848,"about_ca_topic_score_gemma":0.00047389802,"teacher_disagreement_score":0.90009624,"about_ca_system_score_codex":0.00090530334,"about_ca_system_score_gemma":0.00039096308,"threshold_uncertainty_score":0.999851},"labels":[],"label_agreement":null},{"id":"W2888460319","doi":"10.1109/med.2018.8442632","title":"AnOptimal Displacement-Based Leader-Follower Formation Control for Multi-Agent Systems with Energy Consumption Constraints","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Concordia University","keywords":"Energy consumption; Displacement (psychology); Computer science; Multi-agent system; Consumption (sociology); Control (management); Control theory (sociology); Energy (signal processing); Control engineering; Engineering; Artificial intelligence; Mathematics; Psychology","score_opus":0.04106751559537614,"score_gpt":0.2683801575369284,"score_spread":0.22731264194155226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888460319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001921492,0.00007148427,0.9940414,0.00028803726,0.0010079694,0.0016000231,0.0001379019,0.00040109718,0.0005306381],"genre_scores_gemma":[0.9734416,0.00000124487,0.024616603,0.00050614175,0.000136878,0.000644199,0.00010304367,0.000024006878,0.00052628276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736005,0.00017213318,0.000642239,0.0006243075,0.0005251065,0.00067619164],"domain_scores_gemma":[0.997994,0.00017484491,0.00039394095,0.00066938205,0.000545021,0.00022281162],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005507889,0.00035889377,0.00041759058,0.00017412163,0.0002969374,0.00047515184,0.0006244173,0.0001370358,0.000044404773],"category_scores_gemma":[0.000036187288,0.00028397937,0.00012735225,0.00019428869,0.0002522128,0.0009036187,0.00004157076,0.00007155295,0.00013662786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049934415,0.0048410315,0.01816516,0.0020782202,0.0031134225,0.00015141774,0.0024096735,0.039814673,0.07275771,0.7597498,0.039382618,0.05254281],"study_design_scores_gemma":[0.012208904,0.0006033931,0.00032911578,0.00010951741,0.000055299817,0.000025910665,0.00011717824,0.97766054,0.0028594616,0.000003643221,0.0056172665,0.00040978382],"about_ca_topic_score_codex":0.0000785988,"about_ca_topic_score_gemma":0.000092438604,"teacher_disagreement_score":0.9715201,"about_ca_system_score_codex":0.00022565514,"about_ca_system_score_gemma":0.0001423605,"threshold_uncertainty_score":0.99996126},"labels":[],"label_agreement":null},{"id":"W2888484309","doi":"10.1177/0142331218791237","title":"Second-order consensus for a class of uncertain multi-agent systems subject to input saturation","year":2018,"lang":"en","type":"article","venue":"Transactions of the Institute of Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Algebraic graph theory; Bounded function; Multi-agent system; A priori and a posteriori; Lemma (botany); Control theory (sociology); Consensus; Algebraic number; Computer science; Mathematics; Topology (electrical circuits); Algebraic connectivity; Graph; Mathematical optimization; Control (management); Laplacian matrix; Theoretical computer science; Artificial intelligence","score_opus":0.04643535099039219,"score_gpt":0.25752584899373276,"score_spread":0.21109049800334057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2888484309","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02855378,0.00029053478,0.9663139,0.00087135524,0.0016833444,0.0020199888,0.00014592476,0.000029862344,0.00009130936],"genre_scores_gemma":[0.9956878,0.0000025968498,0.0039361925,0.00005706674,0.000046503777,0.00013808793,0.0000013562249,0.000008052464,0.00012234852],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981483,0.000132843,0.0006866769,0.0002801886,0.00053868245,0.00021328763],"domain_scores_gemma":[0.9975894,0.00007522875,0.00038837234,0.0005644399,0.001302669,0.00007989128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009714048,0.00018108744,0.0004348962,0.0001342027,0.00016451391,0.00004872252,0.00053994503,0.00008126046,0.0000026258579],"category_scores_gemma":[0.00012312962,0.00013888246,0.00016253689,0.0003270944,0.00018098619,0.0002238143,0.000014118612,0.00007525303,0.000001221404],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013097961,0.0009152075,0.00057764095,0.0011814472,0.0018192582,0.0000014725302,0.0022422934,0.0454982,0.91013,0.018209597,0.0006305539,0.017484494],"study_design_scores_gemma":[0.030227574,0.002178872,0.006049172,0.0014536552,0.0009244438,0.00003738863,0.000565724,0.7317819,0.19829206,0.00022412863,0.027271379,0.0009937097],"about_ca_topic_score_codex":0.00036086128,"about_ca_topic_score_gemma":0.0010419909,"teacher_disagreement_score":0.967134,"about_ca_system_score_codex":0.00009208244,"about_ca_system_score_gemma":0.0002542603,"threshold_uncertainty_score":0.5663462},"labels":[],"label_agreement":null},{"id":"W2889055906","doi":"10.1109/ccece.2018.8447800","title":"Optimal Distributed Control for Leader-Follower Networks: A Scalable Design","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Optimal control; Mathematical optimization; Computer science; State (computer science); Algebraic Riccati equation; Focus (optics); Riccati equation; Function (biology); Control theory (sociology); Scalability; Linear-quadratic-Gaussian control; Bellman equation; Control (management); Mathematics; Algorithm","score_opus":0.027561870183643027,"score_gpt":0.2512823852847989,"score_spread":0.22372051510115587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889055906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002330358,0.00012248581,0.9942035,0.0013629498,0.001238343,0.0015476348,0.00007264512,0.0006447291,0.00057469105],"genre_scores_gemma":[0.8996297,0.0000012434475,0.09733628,0.0006979768,0.00055296917,0.00034342718,0.000035834066,0.000025830006,0.0013767537],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972348,0.00017046113,0.0005121595,0.0007451512,0.00034138217,0.0009960454],"domain_scores_gemma":[0.99765265,0.0004957084,0.00017653289,0.00092939247,0.00047704767,0.00026866677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000952751,0.00031850426,0.000453774,0.0000805405,0.00031741918,0.00050910487,0.00145969,0.00017311751,0.00006584192],"category_scores_gemma":[0.00020786493,0.0002731171,0.00020764627,0.0005151974,0.00012514816,0.0006518751,0.0001291456,0.00011455538,0.0002793625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010794349,0.0010200476,0.0012761055,0.00006460762,0.0011448213,0.0000657442,0.00045560522,0.1685218,0.004953471,0.11324288,0.6903571,0.017818384],"study_design_scores_gemma":[0.0039523346,0.00041538224,0.00016836823,0.000022276383,0.000032917695,0.000012183046,0.000028657209,0.97156173,0.00093893264,0.00019586226,0.022310106,0.00036125723],"about_ca_topic_score_codex":0.000034039163,"about_ca_topic_score_gemma":0.000009246756,"teacher_disagreement_score":0.89939666,"about_ca_system_score_codex":0.00011309058,"about_ca_system_score_gemma":0.00011984966,"threshold_uncertainty_score":0.9999721},"labels":[],"label_agreement":null},{"id":"W2889292513","doi":"10.1109/icca.2018.8444273","title":"Distributed MPC based Collision Avoidance Approach for Consensus of Multiple Quadcopters","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collision avoidance; Quadcopter; Computer science; Collision; Position (finance); Model predictive control; Control theory (sociology); Logarithm; Consensus; Mathematical optimization; Control (management); Multi-agent system; Mathematics; Engineering; Artificial intelligence; Aerospace engineering; Computer security","score_opus":0.025403374449775088,"score_gpt":0.2521972658531205,"score_spread":0.22679389140334544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889292513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013193199,0.000030860483,0.98317397,0.00037198522,0.00042731396,0.001109648,0.0004438254,0.00024235081,0.0010068365],"genre_scores_gemma":[0.8112533,2.8914832e-7,0.18824036,0.00011985663,0.000061839106,0.00009627886,0.000111733476,0.000011489807,0.00010486859],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978858,0.00012591612,0.00056810945,0.00059813185,0.00037290825,0.00044908823],"domain_scores_gemma":[0.99741906,0.00060037686,0.000309961,0.00094841985,0.0005714261,0.00015078131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061553286,0.00022563816,0.0003926739,0.00009970206,0.00016030292,0.00009447825,0.001006069,0.00011391944,0.000006901882],"category_scores_gemma":[0.00044835563,0.00019676452,0.00016340228,0.0005062351,0.00018739156,0.00014923315,0.00011206861,0.00006948783,0.000022411501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004207528,0.007649746,0.05574463,0.0024586879,0.0013030781,0.000051835414,0.0026740925,0.06854777,0.29697937,0.20657007,0.31376737,0.040045835],"study_design_scores_gemma":[0.003140801,0.00022521705,0.0011297257,0.00003064226,0.000011900432,0.0000029000698,0.0000680992,0.95529604,0.03566756,0.00005489341,0.0041339775,0.00023823776],"about_ca_topic_score_codex":0.00014237221,"about_ca_topic_score_gemma":0.000026456722,"teacher_disagreement_score":0.88674825,"about_ca_system_score_codex":0.00008438786,"about_ca_system_score_gemma":0.00013406407,"threshold_uncertainty_score":0.80238247},"labels":[],"label_agreement":null},{"id":"W2889346649","doi":"10.1109/icca.2018.8444305","title":"Coverage Optimization for Circular Sector Sensor Networks: A Joint Sensing Strength Approach","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Joint (building); Computer science; Wireless sensor network; Computer network; Engineering; Structural engineering","score_opus":0.026045751508667506,"score_gpt":0.2242177566885752,"score_spread":0.19817200517990768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889346649","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013888724,0.000034490888,0.99426144,0.00014756586,0.0007509752,0.0008605262,0.000014441752,0.00042906345,0.0021126266],"genre_scores_gemma":[0.6691663,0.0000019372803,0.3297922,0.00025586496,0.0005122425,0.000018403049,0.00005013376,0.000020340749,0.00018252448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815106,0.000118115684,0.00037928592,0.000606859,0.00026903138,0.00047565787],"domain_scores_gemma":[0.9985909,0.000090112386,0.00017492825,0.0007020826,0.0003184206,0.00012357051],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042900862,0.0002186657,0.00028670023,0.000091217255,0.00021327072,0.00041859513,0.00037481956,0.000113842565,0.000014696685],"category_scores_gemma":[0.00009575039,0.0001998463,0.00013251706,0.00035970833,0.000040672905,0.00039040175,0.00011176311,0.000080836755,0.000019678448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040595267,0.00025009317,0.00008029848,0.000114061455,0.00026397684,0.000015716807,0.00064453424,0.95377254,0.0035548871,0.014434229,0.0075960685,0.019232977],"study_design_scores_gemma":[0.00101963,0.00007450476,0.000040191993,0.000019037525,0.000014971828,0.00002351975,0.000037806087,0.99634963,0.0007838225,0.000049902676,0.0013334976,0.00025345816],"about_ca_topic_score_codex":0.000041064897,"about_ca_topic_score_gemma":0.0000041498856,"teacher_disagreement_score":0.6677775,"about_ca_system_score_codex":0.00010795042,"about_ca_system_score_gemma":0.000055698674,"threshold_uncertainty_score":0.8149495},"labels":[],"label_agreement":null},{"id":"W2889877786","doi":"10.1109/icassp.2018.8462213","title":"A Robust Event-Triggered Consensus Strategy for Linear Multi-Agent Systems with Uncertain Network Topology","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Network topology; Multi-agent system; Computer science; Convergence (economics); Consensus; Topology (electrical circuits); Transmission (telecommunications); Control theory (sociology); Event (particle physics); Robust control; Distributed computing; Robustness (evolution); Mathematical optimization; Control (management); Control system; Mathematics; Computer network; Engineering; Artificial intelligence","score_opus":0.08224705277587002,"score_gpt":0.29924134072124986,"score_spread":0.21699428794537984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889877786","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026936652,0.00033965328,0.9909659,0.0006648175,0.0019717766,0.0020621917,0.000053950418,0.00046027632,0.0007877796],"genre_scores_gemma":[0.92473465,0.000003296589,0.06978296,0.00029178828,0.000968129,0.00033956888,0.000033525288,0.000036687106,0.0038093743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660957,0.00031195008,0.00072910445,0.000922197,0.00035835002,0.0010688102],"domain_scores_gemma":[0.99724114,0.00036247665,0.00036084786,0.0010680646,0.00067394035,0.00029350212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082916225,0.00040057418,0.0005986752,0.00010037626,0.00034713093,0.00031097917,0.001084225,0.00021203143,0.000025214918],"category_scores_gemma":[0.000084137435,0.0003045225,0.00013218602,0.0005314919,0.00021486598,0.00018190758,0.00014690848,0.00014937652,0.00015352058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066612754,0.00075167516,0.0024437814,0.00032777907,0.0008869963,0.00025276432,0.0005915075,0.7042941,0.00073506474,0.22028945,0.06370857,0.0050521875],"study_design_scores_gemma":[0.0038093312,0.000962717,0.00019665575,0.000079796366,0.00003825893,0.00008716086,0.0002717627,0.9838751,0.00012248383,0.00012498842,0.00996846,0.00046329465],"about_ca_topic_score_codex":0.0008184778,"about_ca_topic_score_gemma":0.00066188216,"teacher_disagreement_score":0.922041,"about_ca_system_score_codex":0.00016262499,"about_ca_system_score_gemma":0.00034796615,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W2890322322","doi":"10.1109/icra.2018.8463193","title":"From Swarms to Stars: Task Coverage in Robot Swarms with Connectivity Constraints","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Robot; Computer science; Swarm behaviour; Task (project management); Swarm robotics; Scheduling (production processes); Controller (irrigation); Distributed computing; Fault tolerance; Robotics; Artificial intelligence; Mobile robot; Task analysis; Robot kinematics; Engineering; Mathematical optimization; Mathematics","score_opus":0.012642624631603037,"score_gpt":0.2396842207286426,"score_spread":0.22704159609703956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890322322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32929933,0.000008954128,0.6653689,0.00076902186,0.00040018331,0.0005054137,0.000074509,0.00020691745,0.0033667488],"genre_scores_gemma":[0.98800236,6.985912e-7,0.0105767585,0.0009876175,0.00016914848,0.000050506267,0.000013982599,0.00001576648,0.00018314218],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9974653,0.00016940861,0.0003842921,0.0008943649,0.00048323712,0.0006033821],"domain_scores_gemma":[0.99818116,0.00025621202,0.00012153642,0.00097447704,0.0001747615,0.00029185618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044838502,0.00028903043,0.00042327313,0.00014988694,0.00008198373,0.00032515975,0.0010811854,0.00009740524,0.0001610831],"category_scores_gemma":[0.00011655493,0.00023134622,0.00005285999,0.0006486262,0.00016205953,0.00065131084,0.00027205676,0.00016912943,0.00075891323],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017156394,0.0047547813,0.21961714,0.00013145308,0.0015983047,0.0026596652,0.039823912,0.01427942,0.25002205,0.09961279,0.04138286,0.32440197],"study_design_scores_gemma":[0.039853033,0.0058402293,0.45288956,0.001292826,0.00011017899,0.00020126438,0.0030421799,0.33127153,0.11230905,0.010715743,0.035418443,0.0070559625],"about_ca_topic_score_codex":0.003260977,"about_ca_topic_score_gemma":0.0022106033,"teacher_disagreement_score":0.658703,"about_ca_system_score_codex":0.00018980433,"about_ca_system_score_gemma":0.00017044944,"threshold_uncertainty_score":0.97545475},"labels":[],"label_agreement":null},{"id":"W2890784875","doi":"10.1109/icassp.2018.8462664","title":"An Event-Triggered Average Consensus Algorithm with Performance Guarantees for Distributed Sensor Networks","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Consensus algorithm; Computer science; Consensus; Event (particle physics); Lyapunov function; Monte Carlo method; Function (biology); Rate of convergence; Algorithm; Mathematical optimization; Control theory (sociology); Multi-agent system; Mathematics; Control (management); Artificial intelligence; Computer network","score_opus":0.010869561005223963,"score_gpt":0.24213139621701407,"score_spread":0.2312618352117901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2890784875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03251919,0.00004591542,0.9644124,0.00032175594,0.00065859704,0.0010466807,0.00021795006,0.00058724504,0.00019025849],"genre_scores_gemma":[0.9319546,0.000004174086,0.06665148,0.00023888181,0.00043988298,0.00010629741,0.00015606431,0.000027691949,0.00042092366],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973412,0.00013148737,0.0005065371,0.0007935568,0.00039399686,0.0008331769],"domain_scores_gemma":[0.9975434,0.0001852137,0.00024227703,0.0011483061,0.0006295637,0.00025121667],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005069576,0.00036706924,0.00042838746,0.00009075258,0.00040639858,0.00038146516,0.0010568799,0.00014248276,0.000024237006],"category_scores_gemma":[0.000033464858,0.00028202316,0.00010375225,0.0005248176,0.00017073113,0.00047517905,0.00008548289,0.00014176873,0.000060695693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003025149,0.003391271,0.015186586,0.00042387669,0.0023742989,0.0005446228,0.0025169426,0.17200977,0.008535212,0.029334141,0.05880083,0.7038573],"study_design_scores_gemma":[0.0028465143,0.000985745,0.0016662847,0.00004930745,0.00002234345,0.00006868517,0.000055058386,0.9881162,0.0017026262,0.000037934984,0.003995955,0.0004533521],"about_ca_topic_score_codex":0.00005862821,"about_ca_topic_score_gemma":0.000039849278,"teacher_disagreement_score":0.8994354,"about_ca_system_score_codex":0.00009098705,"about_ca_system_score_gemma":0.00011894604,"threshold_uncertainty_score":0.99996316},"labels":[],"label_agreement":null},{"id":"W2891264364","doi":"10.1002/rnc.4323","title":"Design and experimental evaluation of robust motion synchronization control for multivehicle system without velocity measurements","year":2018,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Electronic Science and Technology of China; National Natural Science Foundation of China","keywords":"Control theory (sociology); Estimator; Synchronization (alternating current); Passivity; Computer science; Compensation (psychology); Filter (signal processing); Tracking (education); Robust control; Control system; Engineering; Control (management); Mathematics","score_opus":0.06619344986327225,"score_gpt":0.3056389910336056,"score_spread":0.23944554117033334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891264364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07369631,0.00042527137,0.92393243,0.00022510278,0.000865115,0.0007897445,0.000031730407,0.000018225957,0.000016088328],"genre_scores_gemma":[0.96246994,0.0000029657097,0.036956422,0.000041066356,0.0004840633,0.000024822233,0.000005932028,0.0000108230315,0.0000039676193],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974963,0.00045607012,0.00065821846,0.00023186432,0.0010006081,0.00015695837],"domain_scores_gemma":[0.9946498,0.00019750294,0.000839217,0.0001272594,0.0040923594,0.00009384546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033274377,0.00015682472,0.00033214886,0.00017699684,0.00011370924,0.00014459767,0.0003793717,0.00007795689,0.0000040791447],"category_scores_gemma":[0.0003456749,0.00013807022,0.000078530684,0.00007890739,0.00007725049,0.0006561585,0.000034854344,0.000086524524,0.0000012951876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007235505,0.0016863005,0.031674128,0.00020148176,0.00449099,0.00002142167,0.0033170271,0.65824646,0.1358501,0.0020934434,0.00032807267,0.15485504],"study_design_scores_gemma":[0.015502578,0.00039323856,0.0018554266,0.0001545585,0.0001341624,0.000059855684,0.00011840928,0.97582656,0.0058020726,0.000021721307,0.000018295565,0.00011314334],"about_ca_topic_score_codex":0.00001903549,"about_ca_topic_score_gemma":0.000004417574,"teacher_disagreement_score":0.8887736,"about_ca_system_score_codex":0.00027316783,"about_ca_system_score_gemma":0.00015318087,"threshold_uncertainty_score":0.563034},"labels":[],"label_agreement":null},{"id":"W2892322937","doi":"10.1109/icuas.2018.8453402","title":"Modeling and Control of a Quadcopter Flying in a Wind Field: A Comparison Between LQR and Structured ℋ<sub>∞</sub> Control Techniques","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Quadcopter; Linear-quadratic regulator; Control theory (sociology); Computer science; Controller (irrigation); MATLAB; Field (mathematics); Control engineering; Autopilot; Aerodynamics; Optimal control; Robust control; Control system; Control (management); Engineering; Aerospace engineering; Artificial intelligence; Mathematics; Mathematical optimization","score_opus":0.0168711937103574,"score_gpt":0.26443560677635486,"score_spread":0.24756441306599747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892322937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4263349,0.000121385005,0.5726857,0.00021116623,0.000043591433,0.00045713538,0.000010840014,0.00007709025,0.00005819754],"genre_scores_gemma":[0.9927306,0.0000036445238,0.0069060843,0.00023049115,0.00008985835,0.000024700783,0.0000016760514,0.000011133152,0.0000017667895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801445,0.00016010896,0.00068432296,0.0005015223,0.00026350687,0.00037610924],"domain_scores_gemma":[0.9988421,0.00028588218,0.0001799051,0.000408756,0.00015826759,0.00012504366],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703323,0.00023898594,0.0006886086,0.00023336039,0.00009320954,0.00015991137,0.00040897177,0.00017542155,0.0000020857626],"category_scores_gemma":[0.00009465508,0.00021059452,0.000053732856,0.00021045856,0.00008366452,0.00039811284,0.00013170826,0.00018325122,0.0000014238337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004188722,0.00014817198,0.22018412,0.00021663104,0.00043365627,0.00002139142,0.0038579775,0.00061403174,0.3715301,0.0070778183,0.00010245708,0.3953948],"study_design_scores_gemma":[0.003476148,0.0003394208,0.006587957,0.00012982622,0.000037099613,0.000007955711,0.00008721736,0.9478709,0.04019183,0.0009693701,0.000021224905,0.00028102857],"about_ca_topic_score_codex":0.00040974384,"about_ca_topic_score_gemma":0.0001806452,"teacher_disagreement_score":0.94725686,"about_ca_system_score_codex":0.000032559667,"about_ca_system_score_gemma":0.000038882357,"threshold_uncertainty_score":0.8587795},"labels":[],"label_agreement":null},{"id":"W2895487882","doi":"10.1109/tsp.2018.2872832","title":"CEASE: A Collaborative Event-Triggered Average-Consensus Sampled-Data Framework With Performance Guarantees for Multi-Agent Systems","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Convergence (economics); Rate of convergence; Event (particle physics); Multi-agent system; Consensus; Implementation; Monte Carlo method; Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence; Key (lock)","score_opus":0.057446754370021356,"score_gpt":0.3064534355219056,"score_spread":0.24900668115188426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2895487882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009161189,0.00049006706,0.98636687,0.00022443764,0.00087486004,0.0017699932,0.0006759495,0.00040877474,0.000027834349],"genre_scores_gemma":[0.9398617,0.000009239568,0.05910871,0.00012555854,0.00022849737,0.00039624522,0.000021473188,0.000050123057,0.00019842671],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99648416,0.00020886488,0.0007100919,0.0011659018,0.00070587767,0.00072508736],"domain_scores_gemma":[0.9967188,0.0004041874,0.00045624963,0.0011290461,0.001069646,0.00022206585],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006933662,0.0004834036,0.00054562,0.00025589153,0.0011990272,0.00081318105,0.0014647108,0.0001981627,0.000015279373],"category_scores_gemma":[0.000030588762,0.0004072797,0.00009581005,0.0012424232,0.00021235397,0.001011457,0.000011769282,0.00036837213,0.00006582806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0066129547,0.004614625,0.00028127249,0.0036514988,0.0023596205,0.00018547801,0.014136497,0.44724274,0.014503159,0.0011043446,0.002227553,0.50308025],"study_design_scores_gemma":[0.002758573,0.0006826556,0.000035867874,0.0011622842,0.00009737235,0.000047227113,0.0003779076,0.98527527,0.007538616,0.000025331663,0.0014425882,0.00055632193],"about_ca_topic_score_codex":0.00004225663,"about_ca_topic_score_gemma":0.000044107215,"teacher_disagreement_score":0.93070054,"about_ca_system_score_codex":0.00020576791,"about_ca_system_score_gemma":0.0007108946,"threshold_uncertainty_score":0.99983793},"labels":[],"label_agreement":null},{"id":"W2896216259","doi":"10.1142/s2301385019400016","title":"Time-Varying Formation Control for Time-Delayed Multi-Agent Systems with General Linear Dynamics and Switching Topologies","year":2018,"lang":"en","type":"article","venue":"Unmanned Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Network topology; Control theory (sociology); Multi-agent system; Computer science; Linear matrix inequality; Protocol (science); Stability (learning theory); Linear system; Control (management); Topology (electrical circuits); Mathematics; Mathematical optimization","score_opus":0.01515717773748107,"score_gpt":0.2451276135159132,"score_spread":0.22997043577843213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896216259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035933286,0.0005155592,0.95772845,0.0002487028,0.0014933909,0.0030033635,0.0001858237,0.00066557934,0.00022587526],"genre_scores_gemma":[0.988876,0.0000046288883,0.008191637,0.00008379511,0.00067118846,0.0004251164,0.00011475675,0.00005459657,0.0015782954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996566,0.0003331945,0.0009907265,0.000782668,0.0005051765,0.0008222447],"domain_scores_gemma":[0.99734753,0.0002893259,0.0006843012,0.00087054627,0.0005828104,0.00022548976],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012708786,0.00048229293,0.0007945381,0.0002499011,0.00060907716,0.00081448426,0.0008617067,0.00023509497,0.0000018908559],"category_scores_gemma":[0.00011648599,0.0003903606,0.00011398253,0.0002993015,0.000105648534,0.0011579117,0.0001548285,0.00016517124,0.000166663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004770802,0.0019611313,0.005001959,0.0076109814,0.008135713,0.00044067064,0.026338017,0.5840059,0.14676306,0.16691208,0.022242641,0.025817065],"study_design_scores_gemma":[0.004145515,0.00059982226,0.00004744279,0.0002623606,0.00006559972,0.00015545054,0.00036208867,0.99267966,0.0001753285,0.000012432007,0.0010059213,0.00048837723],"about_ca_topic_score_codex":0.00033979182,"about_ca_topic_score_gemma":0.000039274717,"teacher_disagreement_score":0.9529427,"about_ca_system_score_codex":0.0003622311,"about_ca_system_score_gemma":0.00008281103,"threshold_uncertainty_score":0.9998548},"labels":[],"label_agreement":null},{"id":"W2899851814","doi":"10.1109/tie.2018.2879305","title":"Fixed-Time Consensus Control of Multiagent Systems Using Input Shaping","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Convergence (economics); Undirected graph; Computer science; Control theory (sociology); Graph; Directed graph; Position (finance); Simple (philosophy); Graph theory; Consensus; Control (management); Mathematics; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.05916875570922403,"score_gpt":0.26827831464727153,"score_spread":0.2091095589380475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899851814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0339455,0.00022493135,0.96028966,0.00017799376,0.0035746375,0.0012772089,0.00013920711,0.00025755755,0.00011329224],"genre_scores_gemma":[0.99875003,0.000007236893,0.00053283485,0.000058011545,0.00042740567,0.0000674889,0.0000028330426,0.00003507534,0.00011906247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964069,0.00046081477,0.0009886608,0.0006392932,0.000652322,0.0008519753],"domain_scores_gemma":[0.9974513,0.00050751027,0.000511008,0.0008940839,0.0004261427,0.00020994626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008056894,0.0003768164,0.0006801081,0.00034707054,0.00035797866,0.00018174291,0.000882249,0.0004140397,0.00003333672],"category_scores_gemma":[0.00006541934,0.00038864292,0.00025260638,0.00086443184,0.00017396323,0.00024066263,0.0000055649434,0.00064529275,0.000112091984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012366704,0.0014244126,0.00005677258,0.00009032961,0.0022540041,0.000054895856,0.00076531107,0.5765355,0.35852474,0.0052155177,0.0013467644,0.05249506],"study_design_scores_gemma":[0.005150459,0.0007395881,0.0000028002792,0.00015318453,0.00013586292,0.00005745626,0.000025352248,0.9370921,0.05314021,0.000016403645,0.0030943288,0.0003922199],"about_ca_topic_score_codex":0.00037969273,"about_ca_topic_score_gemma":0.000027772952,"teacher_disagreement_score":0.96480453,"about_ca_system_score_codex":0.00061684183,"about_ca_system_score_gemma":0.0007920307,"threshold_uncertainty_score":0.99985653},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025148481164045253,"score_gpt":0.25496968661385927,"score_spread":0.22982120544981402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2899962524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095010586,0.001600601,0.892426,0.00012378102,0.007753222,0.0020724689,0.00024378365,0.00026267394,0.00050687604],"genre_scores_gemma":[0.9985751,0.000020074302,0.0002776993,0.000048875892,0.00022312657,0.00021729198,0.0000062586923,0.00006639889,0.0005651613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99436396,0.00078745,0.0020690188,0.00094006147,0.0011441767,0.0006953008],"domain_scores_gemma":[0.99528337,0.00050823326,0.0011592517,0.0016273018,0.0010404108,0.000381416],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001103779,0.0006141847,0.0012514392,0.0005477465,0.00027699856,0.00037072267,0.001024348,0.00038839376,0.000005392843],"category_scores_gemma":[0.000014408882,0.000590615,0.00024380072,0.00092541025,0.00025005193,0.00017972205,0.000017693279,0.00029615633,0.00008648509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003991711,0.0015713831,0.00065456616,0.007980492,0.0018104007,0.00008520324,0.0033164236,0.9220727,0.04115658,0.017243601,0.0012949919,0.0024144787],"study_design_scores_gemma":[0.0033761975,0.00062832015,0.00021201369,0.0022899925,0.00017851256,0.00017637729,0.0014504315,0.9795787,0.009072212,0.000008123642,0.0022633916,0.0007657763],"about_ca_topic_score_codex":0.0043208706,"about_ca_topic_score_gemma":0.00025371448,"teacher_disagreement_score":0.9035645,"about_ca_system_score_codex":0.00023109384,"about_ca_system_score_gemma":0.0002373435,"threshold_uncertainty_score":0.99965453},"labels":[],"label_agreement":null},{"id":"W2901842942","doi":"10.1177/0142331218809006","title":"Prescribed performance-based distributed fault-tolerant cooperative control for multi-UAVs","year":2018,"lang":"en","type":"article","venue":"Transactions of the Institute of Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Artificial neural network; Control theory (sociology); Fault tolerance; Computer science; Scheme (mathematics); Bounded function; Observer (physics); Tracking error; Control engineering; Control (management); Engineering; Distributed computing; Artificial intelligence; Mathematics","score_opus":0.04718760795781616,"score_gpt":0.24521632229903734,"score_spread":0.19802871434122118,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901842942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014934529,0.00020367018,0.98014903,0.0010450296,0.0010067646,0.002079918,0.00047602586,0.00006671364,0.00003830004],"genre_scores_gemma":[0.99667066,0.0000043346045,0.0028369196,0.00011613471,0.000054874658,0.00026741126,0.0000061562473,0.000011178167,0.000032326],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978765,0.00013814142,0.00066582736,0.0003599994,0.0006310886,0.00032839814],"domain_scores_gemma":[0.9974289,0.00007031599,0.00034938593,0.00065458554,0.0013945949,0.00010224259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083769794,0.00026789476,0.0005325224,0.00009436497,0.0004203317,0.000064494394,0.0008591872,0.00009716376,0.0000056603935],"category_scores_gemma":[0.000098371354,0.00019406808,0.00025007714,0.000275671,0.00040084662,0.0004807985,0.0000120218165,0.00012943715,0.0000021384324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009279802,0.005847292,0.005588026,0.0018518018,0.0064956793,0.0000050793105,0.002943028,0.2784559,0.57563555,0.01325882,0.001001111,0.099637926],"study_design_scores_gemma":[0.020791976,0.0005943525,0.0028860178,0.0002564378,0.0003197007,0.0000029797686,0.000029074039,0.9248192,0.04729533,0.000020752912,0.002721032,0.00026320637],"about_ca_topic_score_codex":0.000113784234,"about_ca_topic_score_gemma":0.0001980067,"teacher_disagreement_score":0.9817361,"about_ca_system_score_codex":0.0000926241,"about_ca_system_score_gemma":0.00030882363,"threshold_uncertainty_score":0.79138666},"labels":[],"label_agreement":null},{"id":"W2903665206","doi":"10.1109/tiv.2018.2886679","title":"Cooperative Estimation of Road Condition Based on Dynamic Consensus and Vehicular Communication","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Vehicles","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Reliability (semiconductor); Computer science; Scheme (mathematics); Fuse (electrical); Identification (biology); Collision avoidance; Estimation; Control theory (sociology); Real-time computing; Collision; Control (management); Engineering; Artificial intelligence; Mathematics; Statistics; Computer security","score_opus":0.016244338440878293,"score_gpt":0.2743959656882275,"score_spread":0.2581516272473492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903665206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15146124,0.000041551182,0.84704554,0.0004905124,0.00022904396,0.00042002194,0.00006882379,0.000113928705,0.00012933099],"genre_scores_gemma":[0.99530315,0.000021876134,0.0043797772,0.00015163222,0.0000075198195,0.0000612841,0.000019278797,0.000012462087,0.000043004882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844027,0.0003002783,0.000427458,0.00034232502,0.00031149204,0.00017815447],"domain_scores_gemma":[0.9984137,0.00034710206,0.00018922878,0.0006616877,0.00030801023,0.00008029025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000322837,0.00019095586,0.00022567259,0.00022867166,0.0002797084,0.000091436414,0.0003443474,0.00010399353,0.000023839433],"category_scores_gemma":[0.000023984525,0.00018590433,0.00007580094,0.00029962117,0.00027789877,0.00017427836,0.000003363422,0.00017464199,0.000083339844],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004404486,0.0012595218,0.000049869508,0.00010131825,0.00023846127,0.000007907859,0.0017921522,0.6625536,0.028809728,0.0070163547,0.0001854228,0.2975452],"study_design_scores_gemma":[0.00051780336,0.0004737387,0.0004458816,0.00015960702,0.000025222784,0.000005350509,0.000079735524,0.86557573,0.13230513,0.00021008716,0.000052718562,0.00014896001],"about_ca_topic_score_codex":0.000110778754,"about_ca_topic_score_gemma":0.000066092194,"teacher_disagreement_score":0.8438419,"about_ca_system_score_codex":0.00011629987,"about_ca_system_score_gemma":0.00006102473,"threshold_uncertainty_score":0.75809586},"labels":[],"label_agreement":null},{"id":"W2906965281","doi":"10.1016/j.nahs.2018.12.004","title":"Distributed low-complexity fault-tolerant consensus tracking of switched uncertain nonlinear pure-feedback multi-agent systems under asynchronous switching","year":2019,"lang":"en","type":"article","venue":"Nonlinear Analysis Hybrid Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Institute for Information and Communications Technology Promotion; Information Technology Research Centre; Ministry of Trade, Industry and Energy; Ministry of Education and Human Resources Development; Korea Institute of Energy Technology Evaluation and Planning; Ministry of Education; Ministry of Science, ICT and Future Planning; National Research Foundation of Korea","keywords":"Control theory (sociology); Consensus; Computer science; Nonlinear system; Fault tolerance; Tracking error; Multi-agent system; Actuator; Asynchronous communication; Control engineering; Engineering; Control (management); Distributed computing; Artificial intelligence","score_opus":0.034132682155771976,"score_gpt":0.2742041213495632,"score_spread":0.2400714391937912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2906965281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41067955,0.001011359,0.5823792,0.00014977687,0.0019172516,0.0018492404,0.0014830992,0.00043243912,0.00009809368],"genre_scores_gemma":[0.99196243,0.00001195328,0.0059066713,0.00005922506,0.00044562752,0.0000998699,0.0011342941,0.00011057903,0.00026932423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98816913,0.0014696667,0.003938811,0.002343374,0.0023704174,0.0017085682],"domain_scores_gemma":[0.99048096,0.000730569,0.002716887,0.0037483275,0.0016336776,0.00068958255],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003068363,0.0012593892,0.0037357397,0.0010761028,0.00039590776,0.0011826631,0.0030514044,0.00039104087,0.0000328789],"category_scores_gemma":[0.00024403556,0.0011643767,0.0015939579,0.0034823297,0.00017941724,0.000603291,0.0005053047,0.0008231149,0.00041972802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014268167,0.0015075816,0.014639666,0.0017227216,0.0070594363,0.0004096953,0.0006380932,0.95054823,0.02044636,0.0021136585,0.00014774718,0.00062412914],"study_design_scores_gemma":[0.0037221145,0.00012427788,0.0028550008,0.0004957676,0.0009206265,0.00018542302,0.0012275613,0.9875421,0.0011247094,0.000014643953,0.0005894979,0.0011983124],"about_ca_topic_score_codex":0.0044880034,"about_ca_topic_score_gemma":0.0002540316,"teacher_disagreement_score":0.5812829,"about_ca_system_score_codex":0.0009809113,"about_ca_system_score_gemma":0.000493598,"threshold_uncertainty_score":0.9998542},"labels":[],"label_agreement":null},{"id":"W2907089789","doi":"10.1109/iecon.2018.8591617","title":"Multi-Layered Formation Control of Autonomous Marine Vehicles with Nonlinear Dynamics","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Lyapunov function; Control theory (sociology); Nonlinear system; Convergence (economics); Drag; Exponential stability; Acceleration; Lyapunov stability; Control-Lyapunov function; Vehicle dynamics; Lyapunov redesign; Rate of convergence; Computer science; Mathematics; Engineering; Control (management); Physics; Classical mechanics; Key (lock); Aerospace engineering","score_opus":0.011374055934555285,"score_gpt":0.22416149188728668,"score_spread":0.2127874359527314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2907089789","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028420072,0.000008093855,0.96895516,0.0004940874,0.00015540607,0.0004109939,0.000033012522,0.00022315163,0.0013000345],"genre_scores_gemma":[0.88399863,7.402505e-7,0.11552844,0.00010919651,0.000051777442,0.000016554264,0.000025318799,0.0000093558165,0.00025995044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998712,0.000058653357,0.00041447257,0.0002661925,0.00027147817,0.00027722184],"domain_scores_gemma":[0.9986074,0.00005814439,0.00026028592,0.00059161213,0.00039467282,0.00008788236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024718468,0.00016100203,0.0002698401,0.000095846895,0.00007516664,0.00009253529,0.0006605241,0.000065946115,0.000012498734],"category_scores_gemma":[0.000031073065,0.00012316021,0.00005306861,0.00025982922,0.000081570826,0.0006269175,0.00012895981,0.00006914374,0.00008077179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012552401,0.0036767372,0.11422943,0.0005988978,0.0014222416,0.00012160293,0.0035338185,0.008586228,0.061420947,0.23470622,0.0013012699,0.56914735],"study_design_scores_gemma":[0.003081036,0.00026865635,0.004924313,0.000016986438,0.000011532108,0.000017658203,0.000047664278,0.98832417,0.0027816559,0.000041744213,0.00032924896,0.00015534423],"about_ca_topic_score_codex":0.00025420918,"about_ca_topic_score_gemma":0.0005944177,"teacher_disagreement_score":0.97973794,"about_ca_system_score_codex":0.000101159785,"about_ca_system_score_gemma":0.00007190871,"threshold_uncertainty_score":0.50223273},"labels":[],"label_agreement":null},{"id":"W2909696360","doi":"10.2514/6.2019-0391","title":"Improvement of Decentralized Flocking Flight Efficiency of Fixed-Wing UAVs Using Inactive Agents","year":2019,"lang":"en","type":"article","venue":"AIAA Scitech 2019 Forum","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"Agency for Defense Development","keywords":"Flocking (texture); Fixed wing; Computer science; Wing; Aerospace engineering; Control theory (sociology); Aeronautics; Engineering; Artificial intelligence; Physics","score_opus":0.011424346293660025,"score_gpt":0.2527939399224396,"score_spread":0.24136959362877958,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909696360","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69913846,0.0002046124,0.2976542,0.00014367492,0.0013315035,0.000980988,0.000039780836,0.00008644267,0.00042029677],"genre_scores_gemma":[0.9956628,0.000008197207,0.004058357,0.000077925724,0.000021299697,0.000010918701,0.00000926257,0.000021261945,0.00012995214],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968535,0.000082889084,0.000824414,0.00062120665,0.00082599086,0.0007920104],"domain_scores_gemma":[0.99763185,0.00011715949,0.0007491066,0.0010833966,0.00029388868,0.00012462234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064092723,0.00028812213,0.00059272326,0.00031093616,0.00010754235,0.000086421736,0.0014672375,0.0001344535,0.000021810658],"category_scores_gemma":[0.00007502064,0.00026759203,0.00023044208,0.0008406928,0.000060764753,0.00074339384,0.00059099135,0.00015730066,0.00004367327],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005580532,0.00035398162,0.022150284,0.00018505717,0.00020289309,0.000008233698,0.00086125557,0.0026957945,0.9560437,0.0069018635,0.0004722197,0.010068907],"study_design_scores_gemma":[0.0047671474,0.000585736,0.004299873,0.00073340617,0.00006637663,0.000012749983,0.0006223751,0.40447634,0.58085203,0.00052931247,0.002306128,0.0007484987],"about_ca_topic_score_codex":0.00038696622,"about_ca_topic_score_gemma":0.000008573073,"teacher_disagreement_score":0.40178055,"about_ca_system_score_codex":0.00025768706,"about_ca_system_score_gemma":0.00016279,"threshold_uncertainty_score":0.99997765},"labels":[],"label_agreement":null},{"id":"W2910708060","doi":"10.1109/tii.2019.2891714","title":"Distributed Time-Varying Formation Control for Multiagent Systems With Directed Topology Using an Adaptive Output-Feedback Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Science Foundation of Beijing Municipality; Fundamental Research Funds for the Central Universities; Aeronautical Science Foundation of China; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Computer science; Protocol (science); Multi-agent system; Network topology; Stability (learning theory); Topology (electrical circuits); Lyapunov function; Construct (python library); Control theory (sociology); Distributed computing; Adaptive control; Control (management); Mathematics; Computer network; Artificial intelligence; Nonlinear system","score_opus":0.06330383166807338,"score_gpt":0.252558051865247,"score_spread":0.1892542201971736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910708060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018960016,0.0000072259854,0.97347885,0.000041192136,0.001647163,0.004168413,0.0009823336,0.0005134464,0.00020137246],"genre_scores_gemma":[0.98405826,9.952544e-7,0.015079199,0.00007100994,0.00013016727,0.0003189723,0.00020326824,0.000032182612,0.00010595905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692315,0.0002665392,0.0012118442,0.00035385188,0.0005641518,0.0006804438],"domain_scores_gemma":[0.997351,0.0003527263,0.00075738,0.0008224154,0.00046197118,0.00025452083],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006345105,0.00044704467,0.00071561977,0.00033473334,0.00039421278,0.00046586647,0.00074907433,0.00044151745,0.000008215271],"category_scores_gemma":[0.000021539932,0.0003894102,0.00016777341,0.000640185,0.00006546583,0.0026950345,0.000006136355,0.00048113285,0.00007724282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066812785,0.00038582808,0.000012894918,0.00008341021,0.000293734,0.0000012834558,0.0011044308,0.99371004,0.00024039048,0.00031461703,0.00016492279,0.0030202956],"study_design_scores_gemma":[0.009215514,0.00095749786,0.00000478649,0.0001239516,0.0001312291,0.000052766365,0.0009302089,0.986664,0.0010850484,0.0000053664185,0.00036682808,0.0004627786],"about_ca_topic_score_codex":0.00014038068,"about_ca_topic_score_gemma":0.0000038628596,"teacher_disagreement_score":0.9650982,"about_ca_system_score_codex":0.0005348252,"about_ca_system_score_gemma":0.00023774212,"threshold_uncertainty_score":0.99985576},"labels":[],"label_agreement":null},{"id":"W2911800205","doi":"10.1109/taes.2019.2895586","title":"Resilient Attitude Alignment in Multispacecraft Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Integrator; Computer science; Control theory (sociology); Robustness (evolution); Control (management); Double integrator; Aerospace engineering; Engineering; Bandwidth (computing); Computer network; Artificial intelligence","score_opus":0.006981292599553414,"score_gpt":0.21848140676726824,"score_spread":0.21150011416771483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2911800205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15203637,0.003491586,0.8361421,0.0007482215,0.0039535044,0.0026948033,0.000025446017,0.00029486517,0.0006130836],"genre_scores_gemma":[0.993326,0.00024158195,0.000057982,0.000052753272,0.000050142742,0.00038963222,0.0000022474335,0.000031601976,0.00584803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965558,0.00030602596,0.00052466436,0.000924457,0.00063444284,0.0010545847],"domain_scores_gemma":[0.99835277,0.00015678136,0.00019149882,0.0010204936,0.00006995562,0.00020849473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007270736,0.00039959373,0.00059965166,0.0002841987,0.00014714978,0.00040136478,0.000600839,0.00020526045,0.0000064426154],"category_scores_gemma":[0.0000036674112,0.00037845052,0.00011950396,0.0005440192,0.000033569522,0.00035511365,0.0000071099607,0.00044534748,0.00031492225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034411126,0.0018140483,0.0067428267,0.0011798616,0.00095253764,0.000121611134,0.0032905405,0.850613,0.06575099,0.06046731,0.00325197,0.0054712156],"study_design_scores_gemma":[0.009154584,0.001488951,0.0013584548,0.0012070886,0.000070837435,0.00027745537,0.0016359118,0.9464805,0.004096164,0.000026817255,0.032550998,0.0016522446],"about_ca_topic_score_codex":0.0014887975,"about_ca_topic_score_gemma":0.00047394697,"teacher_disagreement_score":0.84128964,"about_ca_system_score_codex":0.0008102701,"about_ca_system_score_gemma":0.00015968044,"threshold_uncertainty_score":0.9998667},"labels":[],"label_agreement":null},{"id":"W2912291390","doi":"10.1109/cdc.2018.8619654","title":"Cooperative Distance-Based Leader-Following Formation Control Using SDRE for Multi-Agents with Energy Constraints","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Riccati equation; Rigidity (electromagnetism); Algebraic Riccati equation; Graph theory; Exponential stability; Mathematical optimization; Stability (learning theory); Stability theory; Multi-agent system; Graph; Computer science; Control (management); Mathematics; Engineering; Artificial intelligence; Differential equation; Theoretical computer science; Mathematical analysis","score_opus":0.057752750768465866,"score_gpt":0.2893749783000423,"score_spread":0.2316222275315764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912291390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003068024,0.000036126756,0.9943995,0.00021954707,0.0004953892,0.00090266863,0.00008511569,0.00024584876,0.0005477967],"genre_scores_gemma":[0.93320656,2.6054042e-7,0.06549957,0.00083190727,0.00010253825,0.00012735242,0.000038844853,0.000021106343,0.0001718912],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979072,0.00013734239,0.00046241665,0.0005327352,0.00038633656,0.0005739203],"domain_scores_gemma":[0.99845535,0.00014233135,0.00024611785,0.00048213828,0.0005118422,0.00016224258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032134601,0.00030603056,0.00038756832,0.00010984674,0.0004331647,0.0003687351,0.0005892607,0.000097440075,0.000019440651],"category_scores_gemma":[0.00007224699,0.00024353724,0.00013894773,0.0003307509,0.0001866933,0.0011740829,0.000036072266,0.000067761954,0.000018990584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036204855,0.0048612906,0.017435012,0.000980874,0.005811158,0.00052659767,0.015052383,0.07335998,0.17191347,0.4836937,0.015858235,0.20688681],"study_design_scores_gemma":[0.008883939,0.00023945389,0.00013160906,0.00011623222,0.000038779188,0.000009447823,0.0002144487,0.9787499,0.00942504,0.000013879045,0.001825718,0.0003515765],"about_ca_topic_score_codex":0.00007776541,"about_ca_topic_score_gemma":0.0002850925,"teacher_disagreement_score":0.9301385,"about_ca_system_score_codex":0.00019895991,"about_ca_system_score_gemma":0.00022182672,"threshold_uncertainty_score":0.9931161},"labels":[],"label_agreement":null},{"id":"W2912364062","doi":"10.1007/978-3-030-02161-0_8","title":"Hybrid Communication and Control in Multi-Agent Networks","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Nonlinear system; Multi-agent system; Control (management); Control theory (sociology); Function (biology); Consensus; Distributed computing; Artificial intelligence","score_opus":0.021907008506526805,"score_gpt":0.2288349208801197,"score_spread":0.2069279123735929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912364062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010698784,0.0036540385,0.88310635,0.0005035036,0.00048138507,0.0013105359,0.000035007244,0.0001838787,0.11071459],"genre_scores_gemma":[0.6675382,0.0007314614,0.004520448,0.001277775,0.00008350512,0.00006710813,0.00014895346,0.00007454644,0.32555798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978814,0.000108209584,0.00065814605,0.0006844821,0.00030256895,0.00036518142],"domain_scores_gemma":[0.9973065,0.00026994786,0.0003691898,0.0018074537,0.00011489908,0.00013199724],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005673159,0.000416811,0.00067188166,0.00019429417,0.000064900014,0.00026568858,0.0014179383,0.0002732291,0.000047051388],"category_scores_gemma":[0.000019282268,0.00039905222,0.00012235662,0.000034185374,0.00006470901,0.0003018041,0.00047040547,0.0005157209,0.00027198778],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037392463,0.00013311692,0.0008936062,0.00010342968,0.00032063367,0.0001033712,0.00016070064,0.0035466447,0.000045103414,0.9469279,0.007829575,0.03989853],"study_design_scores_gemma":[0.0034487655,0.000044090702,0.0007224899,0.00028228704,0.00002916314,0.000026249552,0.000004127336,0.90636414,0.0000029349708,0.0010411898,0.08744367,0.0005908935],"about_ca_topic_score_codex":0.00013912535,"about_ca_topic_score_gemma":0.00014376573,"teacher_disagreement_score":0.94588673,"about_ca_system_score_codex":0.00016867535,"about_ca_system_score_gemma":0.00008120865,"threshold_uncertainty_score":0.99984616},"labels":[],"label_agreement":null},{"id":"W2912391416","doi":"10.1109/tmech.2019.2895222","title":"Attitude Synchronization For Multiple 3-DOF Helicopters With Actuator Faults","year":2019,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Graduate Research and Innovation Projects of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Actuator; Control theory (sociology); Synchronization (alternating current); Attitude control; Computer science; Fault tolerance; Fault (geology); Control (management); Control engineering; Track (disk drive); Engineering; Artificial intelligence; Distributed computing; Channel (broadcasting)","score_opus":0.008505631543360053,"score_gpt":0.21541425212766005,"score_spread":0.20690862058429998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912391416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020532083,0.00003555681,0.97472334,0.00037638884,0.0018053887,0.0018132955,0.00017143704,0.00044380678,0.00009869117],"genre_scores_gemma":[0.96451944,0.00001777856,0.033949926,0.00019410736,0.00007217971,0.00033239686,0.00004200648,0.00005309329,0.00081908354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99756205,0.000076797965,0.00040528472,0.0007893759,0.0005347066,0.00063179014],"domain_scores_gemma":[0.998026,0.00020436266,0.00020299244,0.0010695137,0.00031378184,0.0001833412],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027474808,0.00036736976,0.00037549777,0.00019448771,0.00024973447,0.0001708772,0.0008472576,0.0001763785,0.000049587226],"category_scores_gemma":[0.000016302633,0.0003340457,0.00020199623,0.0004087287,0.000029334593,0.0007923806,0.000006884024,0.00026005396,0.00082104385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014663808,0.002380199,0.0004345686,0.00087267294,0.0016384539,0.00001932188,0.0015500953,0.8071087,0.050655276,0.0161915,0.0011282882,0.11655455],"study_design_scores_gemma":[0.006362762,0.0011652977,0.00005872881,0.00016466728,0.00008035924,0.000015830063,0.00009806108,0.96357703,0.017108213,0.00007495766,0.010593595,0.0007004763],"about_ca_topic_score_codex":0.00004870419,"about_ca_topic_score_gemma":0.00009254449,"teacher_disagreement_score":0.94398737,"about_ca_system_score_codex":0.00044670494,"about_ca_system_score_gemma":0.00024697144,"threshold_uncertainty_score":0.9999569},"labels":[],"label_agreement":null},{"id":"W2913012899","doi":"10.1109/cdc.2018.8619504","title":"Dynamic Gradient Play for NE Seeking with Disturbance Rejection","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Disturbance (geology); Monotonic function; Lipschitz continuity; Subspace topology; Nash equilibrium; Computer science; Control theory (sociology); Stochastic game; Component (thermodynamics); Mathematical optimization; Game theory; Mathematical economics; Mathematical proof; Mathematics; Control (management); Artificial intelligence","score_opus":0.009931754894792671,"score_gpt":0.23439789255330126,"score_spread":0.2244661376585086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913012899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012971017,0.000028908104,0.982745,0.00048569395,0.00083033415,0.0004922752,0.000007855176,0.0003067387,0.0021322146],"genre_scores_gemma":[0.9722323,6.533326e-7,0.025712632,0.00013181617,0.00009813622,0.0000935674,0.000009074256,0.000010613106,0.0017112524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988178,0.000027399052,0.00018757804,0.000438545,0.00020279364,0.00032590065],"domain_scores_gemma":[0.99909985,0.000057574933,0.000110468165,0.0005045357,0.00015431974,0.00007322796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021107562,0.00013621608,0.00014904178,0.000057213958,0.000195703,0.000169731,0.00047710194,0.000039084618,0.000004479941],"category_scores_gemma":[0.000024780906,0.00010202272,0.000046641242,0.00028329834,0.000046799112,0.00037196337,0.000057805646,0.000050320297,0.000044459826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008748893,0.0012166954,0.021684911,0.00038944036,0.00093391415,0.00007802447,0.008336854,0.0022590272,0.048553955,0.6683155,0.03855543,0.20880139],"study_design_scores_gemma":[0.0013544185,0.0005496891,0.008716458,0.00005903079,0.000012961094,0.00003368119,0.000048270576,0.9667965,0.0008957825,0.0005055286,0.020736706,0.00029096636],"about_ca_topic_score_codex":0.000074758915,"about_ca_topic_score_gemma":0.00030935847,"teacher_disagreement_score":0.9645375,"about_ca_system_score_codex":0.00013191786,"about_ca_system_score_gemma":0.00003255569,"threshold_uncertainty_score":0.41603658},"labels":[],"label_agreement":null},{"id":"W2913603117","doi":"10.1109/cdc.2018.8619211","title":"Near-Optimal Control Strategy in Leader-Follower Networks: A Case Study for Linear Quadratic Mean-Field Teams","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Quadratic equation; Computer science; Graph; State (computer science); Function (biology); Convergence (economics); Optimal control; Decentralised system; Strongly connected component; Mathematics; Control (management); Control theory (sociology); Theoretical computer science; Algorithm","score_opus":0.02541166683430572,"score_gpt":0.295634092680261,"score_spread":0.27022242584595524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913603117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18403555,0.00007631298,0.81191856,0.00033935314,0.0005715767,0.0023025156,0.0000064451497,0.00022175479,0.0005279635],"genre_scores_gemma":[0.9934128,5.403615e-7,0.0047460557,0.0005680808,0.0004037466,0.00034325683,0.0000031221302,0.000024887277,0.0004975422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969956,0.0002495461,0.00078807515,0.00078896346,0.0003551208,0.00082265283],"domain_scores_gemma":[0.9977962,0.0005954693,0.0001803278,0.0009640279,0.0002587771,0.00020520164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011166123,0.0003464164,0.0005599866,0.000112757734,0.00025209135,0.0005323209,0.0009307773,0.00016768568,0.00003649293],"category_scores_gemma":[0.00015563559,0.00029410166,0.00015278706,0.00052252185,0.00007072844,0.0006515544,0.00011973735,0.00024194918,0.000090861686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033692338,0.020451484,0.07724786,0.00037565426,0.0036792874,0.03542155,0.056171156,0.54672736,0.0011642454,0.03760849,0.05044075,0.16734293],"study_design_scores_gemma":[0.006459004,0.002278945,0.00014035769,0.000022338696,0.00003372313,0.00018669503,0.0042907395,0.985713,0.00003653892,0.000026983758,0.00045532628,0.0003563137],"about_ca_topic_score_codex":0.0026140136,"about_ca_topic_score_gemma":0.0064437976,"teacher_disagreement_score":0.8093772,"about_ca_system_score_codex":0.00009383181,"about_ca_system_score_gemma":0.0001894341,"threshold_uncertainty_score":0.9999511},"labels":[],"label_agreement":null},{"id":"W2914958500","doi":"10.1007/978-3-030-06212-5_5","title":"Consensus of Multi-Agent Systems","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multi-agent system; Computer science; Distributed computing; Collective behavior; Consensus; Artificial intelligence; Sociology","score_opus":0.0385524864183407,"score_gpt":0.2399989088539034,"score_spread":0.2014464224355627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914958500","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008495843,0.0024299077,0.29131323,0.00013376205,0.0048154634,0.0017114922,0.0002689647,0.00038208367,0.6989366],"genre_scores_gemma":[0.047612716,0.000034411576,0.0029666726,0.00007408638,0.00013167363,0.00001859449,0.000043935197,0.00006698331,0.9490509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966458,0.00006697745,0.001154159,0.00089172454,0.0008129579,0.0004283726],"domain_scores_gemma":[0.9959441,0.00024048175,0.0009658232,0.0022208139,0.00044067623,0.0001881195],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00043872977,0.00056995905,0.0011568534,0.0002701131,0.000043746055,0.00015474438,0.0018206798,0.00050377776,0.000093486895],"category_scores_gemma":[0.000034700246,0.0005056993,0.00038649284,0.00005874602,0.00008894335,0.00009402927,0.00045192643,0.00030735694,0.0024180277],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068665213,0.00004797857,0.00003063484,0.00035341003,0.00036110994,0.00007048581,0.00005522427,0.0004746655,0.00026235354,0.98287827,0.013886003,0.0015730131],"study_design_scores_gemma":[0.0033369728,0.000236806,0.00008235741,0.0012718347,0.00015411612,0.00015188892,0.000040215044,0.24329181,0.00018056718,0.00053333584,0.7489988,0.0017212763],"about_ca_topic_score_codex":0.00018950389,"about_ca_topic_score_gemma":0.000016971666,"teacher_disagreement_score":0.9823449,"about_ca_system_score_codex":0.00017542849,"about_ca_system_score_gemma":0.00034291163,"threshold_uncertainty_score":0.99973947},"labels":[],"label_agreement":null},{"id":"W2918950338","doi":"10.1109/lcsys.2019.2922607","title":"Trajectory Convergence From Coordinate-Wise Decrease of Quadratic Energy Functions, and Applications to Platoons","year":2019,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Nemzeti Kutatási Fejlesztési és Innovációs Hivatal","keywords":"Platoon; Convergence (economics); Sign (mathematics); Quadratic equation; Laplacian matrix; Function (biology); Quadratic function; Laplace operator; Control theory (sociology); Mathematics; Positive-definite matrix; Energy (signal processing); Applied mathematics; Mathematical analysis; Computer science; Physics; Geometry; Control (management); Quantum mechanics","score_opus":0.007846045309408217,"score_gpt":0.19892506763675466,"score_spread":0.19107902232734644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2918950338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15612653,0.00086842454,0.83847684,0.000809611,0.0017634202,0.0014015563,0.00026948674,0.00016900677,0.000115125025],"genre_scores_gemma":[0.99717164,0.0000038252147,0.00015533832,0.0014414655,0.00019432306,0.0007710734,0.000021254893,0.000024048162,0.00021704193],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729145,0.00031645643,0.00075700256,0.0007639951,0.00044125246,0.00042986672],"domain_scores_gemma":[0.99730146,0.00054988085,0.000374675,0.0011721713,0.00016001119,0.00044177592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034427174,0.00031343146,0.000679129,0.00022733136,0.00010834386,0.00017569624,0.0008352519,0.00010994311,0.000015062644],"category_scores_gemma":[0.00004581274,0.0003118338,0.00013027093,0.00041441654,0.000061711515,0.00039189897,0.000055648132,0.00011912698,0.00021756162],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018874403,0.0003036022,0.022548378,0.00031397582,0.00092618936,0.00004381169,0.00057590037,0.042119384,0.88769895,0.018773735,0.02325609,0.003251269],"study_design_scores_gemma":[0.020027673,0.00058792194,0.018089164,0.0009428912,0.0005335459,0.00011253262,0.0010237731,0.82869464,0.004555286,0.00015878877,0.12214477,0.003128978],"about_ca_topic_score_codex":0.003046835,"about_ca_topic_score_gemma":0.00007713275,"teacher_disagreement_score":0.88314366,"about_ca_system_score_codex":0.00011933223,"about_ca_system_score_gemma":0.00011127902,"threshold_uncertainty_score":0.99993336},"labels":[],"label_agreement":null},{"id":"W2921914043","doi":"10.1109/tac.2019.2904152","title":"A Smooth Distributed Feedback for Formation Control of Unicycles","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Synchronizing; Heading (navigation); Bounded function; Offset (computer science); Synchronization (alternating current); Kinematics; Computer science; Reference frame; Graph; Strongly connected component; Mathematics; Control (management); Frame (networking); Topology (electrical circuits); Engineering; Algorithm; Artificial intelligence","score_opus":0.011551191717248216,"score_gpt":0.2318103833348603,"score_spread":0.22025919161761207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921914043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012498933,0.000042167416,0.98093206,0.000998889,0.000886519,0.0030789818,0.00100059,0.0004570147,0.000104856656],"genre_scores_gemma":[0.9968956,0.0000024365438,0.0022188185,0.00021305586,0.00002847495,0.00049029326,0.000019366798,0.000024556855,0.00010737219],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746674,0.00019337266,0.0009406673,0.00042483959,0.00048688447,0.00048751413],"domain_scores_gemma":[0.9971318,0.00095200166,0.000504055,0.0009794042,0.00028964886,0.00014306606],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004522414,0.00031694665,0.00072033796,0.0002500082,0.00013519965,0.0001365663,0.0008346494,0.00015050276,0.000059670398],"category_scores_gemma":[0.000035830042,0.0002938035,0.0004056468,0.0004209377,0.00004618018,0.00073237077,0.0000021633475,0.00012863458,0.00017462812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001092962,0.0028315147,0.00021522383,0.0018597313,0.0019615556,0.000011450533,0.0017160552,0.27282363,0.10291213,0.017048877,0.0013386706,0.5961882],"study_design_scores_gemma":[0.012437512,0.00035991188,0.0006369813,0.00014173365,0.00012309557,0.0000085458005,0.000063936815,0.98029566,0.0044478914,0.00027874103,0.000921373,0.00028462478],"about_ca_topic_score_codex":0.00003415223,"about_ca_topic_score_gemma":0.000021628233,"teacher_disagreement_score":0.9843967,"about_ca_system_score_codex":0.00017674606,"about_ca_system_score_gemma":0.00010486526,"threshold_uncertainty_score":0.9999514},"labels":[],"label_agreement":null},{"id":"W2922330498","doi":"10.1109/tsmc.2019.2899967","title":"Multileader Multiagent Systems Containment Control With Event-Triggering","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Computer science; Laplacian matrix; Protocol (science); Multi-agent system; Containment (computer programming); Event (particle physics); Graph; Distributed computing; Directed graph; Schedule; Theoretical computer science; Topology (electrical circuits); Mathematics; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.008299334133153771,"score_gpt":0.20137491519887532,"score_spread":0.19307558106572154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922330498","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041669235,0.0025786671,0.9400914,0.000109492714,0.008275353,0.0056770514,0.00017162779,0.00056913286,0.0008580806],"genre_scores_gemma":[0.9924921,0.000057028017,0.00010031884,0.00006233519,0.00019658556,0.0010376391,0.000007363508,0.00009915942,0.0059474614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939425,0.00070391054,0.0014403884,0.0014140327,0.0014347539,0.001064391],"domain_scores_gemma":[0.9963326,0.0003673938,0.00067561545,0.0016964219,0.00034883004,0.00057916215],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009688527,0.00084972125,0.0013247676,0.0004062558,0.0003367786,0.0013919964,0.00096633553,0.00034689408,0.000009671153],"category_scores_gemma":[0.0000051018974,0.00071001856,0.00022161735,0.0004447309,0.00009693951,0.0005359858,0.0000119401475,0.00050400913,0.00051314547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031864623,0.00082392216,0.0012359612,0.00205265,0.0016890588,0.00020782063,0.002122892,0.97267056,0.00509215,0.010922285,0.0005160353,0.0023480116],"study_design_scores_gemma":[0.008547024,0.00086559745,0.00031522164,0.001608895,0.00016137258,0.00050514395,0.0029192772,0.9699494,0.00038302076,0.0000017623167,0.013569318,0.0011739525],"about_ca_topic_score_codex":0.001910311,"about_ca_topic_score_gemma":0.000045828525,"teacher_disagreement_score":0.9508229,"about_ca_system_score_codex":0.0004979736,"about_ca_system_score_gemma":0.00011790066,"threshold_uncertainty_score":0.99964464},"labels":[],"label_agreement":null},{"id":"W2934275927","doi":"10.1049/iet-cta.2018.6262","title":"Distributed adaptive fractional‐order fault‐tolerant cooperative control of networked unmanned aerial vehicles via fuzzy neural networks","year":2019,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Fault tolerance; Computer science; Artificial neural network; Fuzzy logic; Control (management); Control engineering; Fuzzy control system; Order (exchange); Engineering; Distributed computing; Artificial intelligence","score_opus":0.0063350111581443914,"score_gpt":0.22194708068047925,"score_spread":0.21561206952233486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934275927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063142367,0.00065648556,0.9884711,0.0006577644,0.00036636018,0.0025091267,0.00052677444,0.00016930094,0.0003288787],"genre_scores_gemma":[0.9977455,0.000011412846,0.0002444347,0.0005132167,0.00038099123,0.0008662417,0.00013169477,0.000021928194,0.000084537256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997045,0.0007802474,0.0006875267,0.0006887574,0.00030295903,0.00049554487],"domain_scores_gemma":[0.99636036,0.0016528089,0.00047914172,0.0007486738,0.0005641853,0.00019484905],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008596573,0.00036271132,0.00069231907,0.00007607241,0.00032156802,0.0001566128,0.00072181236,0.00019342513,0.00003023752],"category_scores_gemma":[0.000060171154,0.00032235117,0.00015859421,0.0005546224,0.00021135369,0.00047511174,0.00008883603,0.00031872967,0.00003969505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015342813,0.0003154219,0.00040916543,0.00001592112,0.00053538516,0.0000040151526,0.00014027943,0.41545013,0.0038846096,0.5656242,0.00018950185,0.011897122],"study_design_scores_gemma":[0.0071069333,0.00018778196,0.0014085637,0.000025181958,0.000102251506,0.000015544938,0.0001188139,0.98018587,0.00006846769,0.007777767,0.0026403286,0.00036250093],"about_ca_topic_score_codex":0.000028606031,"about_ca_topic_score_gemma":0.0000063513503,"teacher_disagreement_score":0.9914313,"about_ca_system_score_codex":0.00005028816,"about_ca_system_score_gemma":0.00007289302,"threshold_uncertainty_score":0.9999229},"labels":[],"label_agreement":null},{"id":"W2934789361","doi":"10.1051/matecconf/201927701004","title":"Payload dropping control of an unmanned quadrotor helicopter based on backstepping controller","year":2019,"lang":"en","type":"article","venue":"MATEC Web of Conferences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backstepping; Payload (computing); Control theory (sociology); Robustness (evolution); Nonlinear system; Control engineering; Computer science; Nonlinear control; Attitude control; Engineering; Control (management); Adaptive control; Artificial intelligence","score_opus":0.012356102880560457,"score_gpt":0.23300951957892044,"score_spread":0.22065341669835997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2934789361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71191156,0.00014188666,0.26265776,0.0010552361,0.0013447597,0.002830049,0.00016763467,0.0003583604,0.019532733],"genre_scores_gemma":[0.9989139,0.0000018468052,0.0005940736,0.00025269366,0.000041966458,0.00006826829,0.000010361341,0.000014852718,0.00010207201],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705,0.00034447038,0.00086599466,0.00057681964,0.0007092578,0.00045349778],"domain_scores_gemma":[0.9974647,0.00039599,0.000693566,0.00090847746,0.00039350468,0.00014376015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008074757,0.00032120006,0.00092077,0.00029866418,0.00005720133,0.00017830059,0.0012036156,0.00014713379,0.00021143172],"category_scores_gemma":[0.00008079744,0.00026645788,0.00018780446,0.00027942748,0.00009607038,0.00044456802,0.000072842166,0.00014537424,0.00014778672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0025966067,0.0021516,0.11185905,0.0016275551,0.0010862027,0.000063357526,0.0009962096,0.020736223,0.54010534,0.2747388,0.00028323173,0.043755844],"study_design_scores_gemma":[0.007788502,0.00092545035,0.009044329,0.0005100662,0.000028259765,0.0000024505835,0.00015094918,0.9663912,0.013065921,0.00023673377,0.0014584212,0.00039768466],"about_ca_topic_score_codex":0.00022279513,"about_ca_topic_score_gemma":0.000020214993,"teacher_disagreement_score":0.945655,"about_ca_system_score_codex":0.000036952773,"about_ca_system_score_gemma":0.00048341296,"threshold_uncertainty_score":0.9999788},"labels":[],"label_agreement":null},{"id":"W2935818131","doi":"10.1109/icassp.2019.8682877","title":"Quantized Event-triggered Sampled-data Average Consensus with Guaranteed Rate of Convergence","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Discretization; Rate of convergence; Computer science; Quantization (signal processing); Event (particle physics); Monte Carlo method; Consensus; Transmission (telecommunications); Sampling (signal processing); Mathematics; Control theory (sociology); Mathematical optimization; Algorithm; Key (lock); Multi-agent system; Statistics; Artificial intelligence; Control (management)","score_opus":0.028325033083255444,"score_gpt":0.25860527603409134,"score_spread":0.23028024295083588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2935818131","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2755431,0.0001392027,0.7189777,0.0005916117,0.0009677293,0.0012413462,0.00026708623,0.00030223097,0.0019700364],"genre_scores_gemma":[0.9918963,0.000006217029,0.0066001764,0.00022432604,0.000018915307,0.000010325835,0.00005339013,0.000015554808,0.001174802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727696,0.00030367062,0.00067918096,0.00083575037,0.00043863652,0.00046581638],"domain_scores_gemma":[0.99585426,0.0004831323,0.00043608667,0.0028342088,0.00026665453,0.00012563504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009875604,0.0002730206,0.0006111071,0.00011302665,0.000054981956,0.000111215064,0.0025831535,0.000081388935,0.00023548423],"category_scores_gemma":[0.00013786858,0.00020775727,0.00008420107,0.0005765711,0.00008190438,0.00036249147,0.00046232,0.00012735544,0.0005269519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027567218,0.0014614506,0.091882296,0.0009356823,0.0022659178,0.0004789987,0.0017705617,0.006272807,0.3367345,0.52267826,0.0277197,0.0050430973],"study_design_scores_gemma":[0.011267107,0.0003770814,0.0048491345,0.00020147141,0.00004871161,0.00006109835,0.00018679097,0.965298,0.011397449,0.000579725,0.0049383584,0.00079508906],"about_ca_topic_score_codex":0.0007384396,"about_ca_topic_score_gemma":0.00007752312,"teacher_disagreement_score":0.9590252,"about_ca_system_score_codex":0.00003257586,"about_ca_system_score_gemma":0.00026235814,"threshold_uncertainty_score":0.8472096},"labels":[],"label_agreement":null},{"id":"W2937723173","doi":"10.1109/ciss.2019.8692797","title":"Anytime Minibatch with Stale Gradients : (Invited Paper)","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Computer science; Scale (ratio); Distributed computing; Speedup; Work (physics); Idle; Mathematical optimization; Parallel computing; Mathematics; Engineering","score_opus":0.004727426604465616,"score_gpt":0.18194922085122636,"score_spread":0.17722179424676074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2937723173","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60486317,0.00010677088,0.3508837,0.0040670335,0.0012100203,0.0015692182,0.00003217315,0.001102368,0.03616553],"genre_scores_gemma":[0.9858922,0.0000011881459,0.006375837,0.0009712314,0.000029388366,0.000024230954,0.000015755548,0.000014415769,0.006675799],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982731,0.000060550665,0.00023992748,0.0005396013,0.00044432905,0.0004425089],"domain_scores_gemma":[0.9985596,0.00006131161,0.00009670749,0.0010183806,0.000100580204,0.00016344557],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018060155,0.00019361383,0.0002538508,0.00008006118,0.000054438566,0.00020107834,0.0009727749,0.000058908092,0.00016983208],"category_scores_gemma":[0.000011401919,0.00014227038,0.00005825115,0.0004633178,0.000024470959,0.00075898564,0.00015310034,0.0000902236,0.0015755076],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004363945,0.0030859201,0.4750451,0.00041889105,0.0015678747,0.0006812131,0.0067324466,0.0021444825,0.13543151,0.12761149,0.17382975,0.07301493],"study_design_scores_gemma":[0.02062419,0.0024272557,0.13670734,0.000356157,0.0000798401,0.00024594893,0.00090871257,0.41585776,0.011820577,0.0009475844,0.40661955,0.0034050895],"about_ca_topic_score_codex":0.00012386542,"about_ca_topic_score_gemma":0.000031551415,"teacher_disagreement_score":0.41371328,"about_ca_system_score_codex":0.000057109224,"about_ca_system_score_gemma":0.000037684542,"threshold_uncertainty_score":0.9992019},"labels":[],"label_agreement":null},{"id":"W2939484404","doi":"10.1109/taes.2019.2910361","title":"Distance-Based Multiagent Formation Control With Energy Constraints Using SDRE","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Riccati equation; Multi-agent system; Graph theory; Mathematical optimization; Control theory (sociology); Rigidity (electromagnetism); Energy consumption; Stability theory; Stability (learning theory); Algebraic Riccati equation; Matrix (chemical analysis); Computer science; Graph; Exponential stability; Control (management); Mathematics; Engineering; Differential equation; Artificial intelligence; Theoretical computer science","score_opus":0.0073568562805630166,"score_gpt":0.19562662411587936,"score_spread":0.18826976783531635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2939484404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02957385,0.0004072703,0.9681326,0.00018224,0.0005924099,0.00080078025,0.000034668985,0.0001719874,0.000104167186],"genre_scores_gemma":[0.999165,0.000021679809,0.00024848175,0.00012582295,0.00003138873,0.00012462531,0.0000045033585,0.000024567447,0.0002539462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978048,0.00017557813,0.0003651803,0.00052571745,0.00044007326,0.00068865786],"domain_scores_gemma":[0.99879545,0.00011529547,0.0002325523,0.00057642197,0.00012341655,0.00015686166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026586183,0.00031825338,0.0004138968,0.00014042085,0.00023468332,0.0003015233,0.00030897697,0.00012455556,0.000009571606],"category_scores_gemma":[0.0000015741562,0.00027140602,0.00009693139,0.00033164013,0.00006750204,0.00047974475,0.0000013244477,0.0002214158,0.000029309218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066498166,0.000604494,0.00057749083,0.00045023827,0.0007194742,0.000035459798,0.00077225565,0.90007937,0.053795695,0.026556237,0.0001357819,0.015608525],"study_design_scores_gemma":[0.005122753,0.00046715973,0.000028521179,0.00024565912,0.000053875105,0.0001007063,0.00020695242,0.9862978,0.005691357,0.0000071550544,0.0013834232,0.00039465897],"about_ca_topic_score_codex":0.00037625778,"about_ca_topic_score_gemma":0.00024614192,"teacher_disagreement_score":0.96959114,"about_ca_system_score_codex":0.00046649476,"about_ca_system_score_gemma":0.00024079779,"threshold_uncertainty_score":0.99997383},"labels":[],"label_agreement":null},{"id":"W2940675882","doi":"10.1007/s10846-019-01025-x","title":"Decentralized MPC for UAVs Formation Deployment and Reconfiguration with Multiple Outgoing Agents","year":2019,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Partition (number theory); Workspace; Voronoi diagram; Control reconfiguration; Computer science; Regular polygon; Software deployment; Multi-agent system; Computation; Mathematical optimization; Control theory (sociology); Distributed computing; Mathematics; Algorithm; Robot; Control (management); Artificial intelligence; Combinatorics; Embedded system","score_opus":0.025192395139476496,"score_gpt":0.24946231946492778,"score_spread":0.2242699243254513,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940675882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04093774,0.00095659064,0.9536978,0.00027036955,0.0024342109,0.0015816484,0.000004079998,0.000040243547,0.000077324774],"genre_scores_gemma":[0.9929006,0.00010857093,0.00655906,0.00006124188,0.00012594466,0.000035847603,0.000007874314,0.000020598518,0.00018028126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740845,0.000169553,0.0012209708,0.00026550292,0.0005775609,0.00035797892],"domain_scores_gemma":[0.99727535,0.0003169802,0.0013321214,0.00034151797,0.00056736666,0.0001666578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008603276,0.00023271056,0.0005534608,0.00022053703,0.0000914513,0.00047463906,0.00048861577,0.00008428774,0.00000548502],"category_scores_gemma":[0.00012674357,0.00017311084,0.00013992467,0.00017800667,0.000014890835,0.0011501397,0.00003909586,0.00012429632,0.000031779593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015510308,0.0009550858,0.06623777,0.0032167525,0.0021500576,0.00011553446,0.009816873,0.82650435,0.019732634,0.013283755,0.010126347,0.046309814],"study_design_scores_gemma":[0.003618692,0.0008384345,0.0014859714,0.0013151463,0.000085865286,0.0006109131,0.0011456223,0.9816563,0.0033511792,0.000042712058,0.0055253804,0.00032376224],"about_ca_topic_score_codex":0.000038233036,"about_ca_topic_score_gemma":0.000013896517,"teacher_disagreement_score":0.9519628,"about_ca_system_score_codex":0.0003080316,"about_ca_system_score_gemma":0.00008894247,"threshold_uncertainty_score":0.70592546},"labels":[],"label_agreement":null},{"id":"W2943764792","doi":"10.1109/tie.2019.2913813","title":"Robust Vision-Based Tube Model Predictive Control of Multiple Mobile Robots for Leader–Follower Formation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Quadratic programming; Computer science; Robot; Control theory (sociology); Model predictive control; Kinematics; Artificial intelligence; Computer vision; Camera resectioning; Artificial neural network; Calibration; Mobile robot; Controller (irrigation); Control engineering; Engineering; Control (management); Mathematics; Mathematical optimization","score_opus":0.03289098497819935,"score_gpt":0.24328572662538214,"score_spread":0.2103947416471828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943764792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008016984,0.00006340195,0.98619264,0.00023784945,0.0011955592,0.003580329,0.00044967924,0.00020737332,0.00005617538],"genre_scores_gemma":[0.99716693,0.0000055289174,0.0016489469,0.000093564726,0.00006814808,0.00076497486,0.00003220677,0.000033984827,0.00018569363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731183,0.00014423105,0.0007484946,0.0005592691,0.00057310733,0.00066309463],"domain_scores_gemma":[0.99776304,0.0006366645,0.0003654975,0.00074043655,0.00035882366,0.00013556858],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052401616,0.0003257808,0.0005361302,0.0002716206,0.00018702712,0.00009972721,0.00071373896,0.0004165286,0.000013845571],"category_scores_gemma":[0.000031170588,0.00032489045,0.00038338403,0.00049057935,0.0000423929,0.0008588045,0.0000025469592,0.0005436226,0.000027240509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007033403,0.00039899495,0.000007909004,0.000022873035,0.00011353458,3.1939132e-7,0.00009086945,0.98392576,0.008383259,0.0002815677,0.0002440733,0.005827489],"study_design_scores_gemma":[0.011770379,0.0018267325,0.0000018849162,0.000071133145,0.00008255058,0.0000019053701,0.00004179565,0.9430903,0.04236121,0.000057805122,0.0004210919,0.00027319492],"about_ca_topic_score_codex":0.000025462721,"about_ca_topic_score_gemma":0.000032675598,"teacher_disagreement_score":0.98915,"about_ca_system_score_codex":0.000519443,"about_ca_system_score_gemma":0.00071106706,"threshold_uncertainty_score":0.9999203},"labels":[],"label_agreement":null},{"id":"W2944327535","doi":"10.3934/nhm.2019032","title":"Emergent behavior of Cucker-Smale model with normalized weights and distributed time delays","year":2019,"lang":"en","type":"preprint","venue":"Networks and Heterogeneous Media","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Flocking (texture); Vlasov equation; Mathematics; Infinity; Applied mathematics; Lyapunov function; Mathematical analysis; Statistical physics; Control theory (sociology); Computer science; Physics; Nonlinear system; Artificial intelligence; Plasma","score_opus":0.011623580330694569,"score_gpt":0.211942173014696,"score_spread":0.20031859268400143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944327535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43972456,0.004249135,0.5534197,0.000056902558,0.0006902613,0.0011429968,0.00054674665,0.00012483017,0.000044836914],"genre_scores_gemma":[0.9937005,0.0007735307,0.004308118,0.00004272048,0.00017032506,0.00019215162,0.0006832598,0.00004881785,0.000080571204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968311,0.00013205517,0.0007699167,0.0010729556,0.00054887286,0.0006451059],"domain_scores_gemma":[0.9974474,0.00011191428,0.00060380896,0.0011977189,0.00024041269,0.0003987777],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028684473,0.0006123853,0.0010898543,0.00012169933,0.00011238454,0.00019899728,0.0008974483,0.00051649386,0.000014433126],"category_scores_gemma":[0.0000110025,0.00050660095,0.00017387501,0.00015110025,0.00013451521,0.0001427554,0.0012107429,0.0004697728,0.00000892405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023275538,0.00040725616,0.018909702,0.0003846841,0.0006680227,0.00022839043,0.0008081886,0.9681805,0.00029027148,0.0005779009,0.0010853432,0.008227002],"study_design_scores_gemma":[0.0013269429,0.0001236319,0.0012570218,0.00023400487,0.00023957524,0.0000987573,0.0000054696616,0.99570507,0.00013976496,0.00009639967,0.00021985646,0.00055348955],"about_ca_topic_score_codex":0.00008957226,"about_ca_topic_score_gemma":0.00006209182,"teacher_disagreement_score":0.55397594,"about_ca_system_score_codex":0.000060742557,"about_ca_system_score_gemma":0.00013964777,"threshold_uncertainty_score":0.9997386},"labels":[],"label_agreement":null},{"id":"W2944855857","doi":"10.1109/coase.2019.8843272","title":"Average Consensus in Matrix-Weight-Balanced Digraphs","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Digraph; Directed graph; Graph; Computer science; Matrix (chemical analysis); Strongly connected component; Multi-agent system; Graph theory; Mathematics; Theoretical computer science; Discrete mathematics; Combinatorics; Algorithm; Artificial intelligence","score_opus":0.0067450470985996455,"score_gpt":0.22604885668127672,"score_spread":0.2193038095826771,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944855857","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6325039,0.00037274553,0.27412844,0.002424645,0.0029197251,0.001566506,0.000028184813,0.0009678396,0.085088],"genre_scores_gemma":[0.9934486,0.0000036416718,0.0026684368,0.00021697942,0.000025926129,0.000018257178,0.0000050702542,0.000008641875,0.0036044486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983222,0.00009725732,0.00036340987,0.000480624,0.00030396556,0.00043252818],"domain_scores_gemma":[0.9987654,0.00015541997,0.00009649002,0.0008300703,0.00005325608,0.000099334386],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028834032,0.00017263179,0.0002906618,0.00016728122,0.000027865597,0.00014206872,0.00085312204,0.00008223875,0.00009834557],"category_scores_gemma":[0.000027742202,0.00014928561,0.000087375294,0.00053152646,0.00001884762,0.00020283756,0.00014411639,0.00013251461,0.0015836623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007511192,0.0004289671,0.30119193,0.000115805415,0.00012312763,0.0004196853,0.00081310025,0.003491062,0.03197848,0.6409372,0.012044045,0.008381471],"study_design_scores_gemma":[0.012562632,0.00022935613,0.13312675,0.00017036633,0.000009220221,0.00010404247,0.0001348207,0.803923,0.005272906,0.0045906445,0.038329594,0.0015466344],"about_ca_topic_score_codex":0.00019162738,"about_ca_topic_score_gemma":0.000045994202,"teacher_disagreement_score":0.80043197,"about_ca_system_score_codex":0.00006274338,"about_ca_system_score_gemma":0.000055735643,"threshold_uncertainty_score":0.9991937},"labels":[],"label_agreement":null},{"id":"W2944856415","doi":"10.1109/tcyb.2019.2914403","title":"Connectivity-Preserving Synchronization of Time-Delay Euler–Lagrange Networks With Bounded Actuation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council","keywords":"Bounded function; Control theory (sociology); Synchronization (alternating current); Actuator; Computer science; Controller (irrigation); Topology (electrical circuits); Mathematics; Control (management); Artificial intelligence; Mathematical analysis","score_opus":0.00762484904607996,"score_gpt":0.2034673073513043,"score_spread":0.19584245830522434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944856415","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06226516,0.00003835104,0.9352792,0.00012669592,0.00065648905,0.00061144406,0.000020054802,0.00018862552,0.0008139839],"genre_scores_gemma":[0.9964664,0.000018523253,0.0028482382,0.000043221793,0.00003659882,0.000033286953,0.0000122497495,0.00002912404,0.000512336],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825376,0.000140325,0.000362707,0.00043816454,0.00049016066,0.00031485962],"domain_scores_gemma":[0.9981515,0.00039826962,0.0002527374,0.00084068184,0.0002640091,0.000092799455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002768936,0.00022915372,0.00030845104,0.0001610375,0.0001144207,0.00014363012,0.00059913396,0.00015167765,0.000094584335],"category_scores_gemma":[0.000011473604,0.00021703783,0.000090535206,0.00062973687,0.000047408186,0.0005173705,0.0000057645966,0.00022952107,0.0001480026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008097851,0.0003420098,0.00028093433,0.00005519795,0.00018123258,0.0000048972915,0.00050549244,0.9761839,0.0035997524,0.00072359736,0.00011594051,0.017926099],"study_design_scores_gemma":[0.0013385934,0.0003351008,0.00057871605,0.00012640173,0.000055589757,0.000013454077,0.000023067285,0.9920795,0.00492586,0.000063873944,0.00019969908,0.0002601247],"about_ca_topic_score_codex":0.00015121141,"about_ca_topic_score_gemma":0.00015231759,"teacher_disagreement_score":0.93420124,"about_ca_system_score_codex":0.00014915116,"about_ca_system_score_gemma":0.00008812467,"threshold_uncertainty_score":0.8850546},"labels":[],"label_agreement":null},{"id":"W2944947372","doi":"10.1109/cdc40024.2019.9029953","title":"Towards robustness guarantees for feedback-based optimization","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; McGill University","funders":"","keywords":"Robustness (evolution); Leverage (statistics); Computer science; Mathematical optimization; Monotone polygon; Robust optimization; Robust control; Control theory (sociology); Optimization problem; Mathematics; Control system; Control (management); Engineering; Artificial intelligence","score_opus":0.02676779179201842,"score_gpt":0.26232451279478763,"score_spread":0.23555672100276923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944947372","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017959572,0.00013075458,0.9883618,0.0017685031,0.0041603753,0.0025759328,0.00017489238,0.0007100278,0.0019381241],"genre_scores_gemma":[0.42044094,0.000008832266,0.575416,0.00043354198,0.0003142552,0.00081335194,0.00075244735,0.00006422473,0.0017563583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705625,0.00012764706,0.0006278289,0.0011553492,0.00052960735,0.0005033037],"domain_scores_gemma":[0.9967826,0.00017706532,0.00044359683,0.0018729535,0.0006164461,0.00010736699],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059359765,0.0004721393,0.00067442586,0.00022222522,0.0000918285,0.0008061005,0.0026964406,0.00052499253,0.000045031567],"category_scores_gemma":[0.0001330704,0.0004330471,0.00038530087,0.00022775559,0.000029776602,0.00029959594,0.00076434127,0.00029703203,0.000050749415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021719861,0.00007168072,0.000028895704,0.0003300535,0.00006518204,0.0000015020718,0.000033392327,0.9893213,0.000016568476,0.00419005,0.0028847528,0.0030349055],"study_design_scores_gemma":[0.0016379142,0.000046477377,0.00006559353,0.00018741652,0.000033632798,0.0000013139717,0.000012202999,0.9956514,0.00046041686,0.00017297715,0.0012061179,0.00052448356],"about_ca_topic_score_codex":0.00011298479,"about_ca_topic_score_gemma":0.000009700579,"teacher_disagreement_score":0.42026135,"about_ca_system_score_codex":0.00021202788,"about_ca_system_score_gemma":0.0006878119,"threshold_uncertainty_score":0.9998121},"labels":[],"label_agreement":null},{"id":"W2946353180","doi":"10.65109/nwbg9862","title":"The Unbroken Telephone Game: Keeping Swarms Connected","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Robustness (evolution); Distributed computing; Robot; Swarm behaviour; Computation; Bandwidth (computing); Key (lock); Convergence (economics); Computer network; Artificial intelligence; Algorithm; Computer security","score_opus":0.003320331347987849,"score_gpt":0.18565491549360402,"score_spread":0.18233458414561618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946353180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0904027,0.00050257077,0.84806186,0.0047400896,0.0036348605,0.0012883039,0.0000073063497,0.001234321,0.050127964],"genre_scores_gemma":[0.99201924,0.0000099467115,0.0011766086,0.0005398479,0.000075983946,0.00002819575,0.0000040024497,0.0000115599705,0.00613464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982497,0.000121919526,0.0003284732,0.000422176,0.00038651563,0.0004911986],"domain_scores_gemma":[0.9980314,0.0004457531,0.00012816123,0.0011527733,0.00013415454,0.000107787106],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00049193046,0.00016295013,0.00021069706,0.000048770653,0.0001416521,0.00046600995,0.0016229186,0.00006615376,0.00006039974],"category_scores_gemma":[0.00011400385,0.00010589101,0.00008934031,0.00045751664,0.000033932563,0.00035388718,0.00028000466,0.00014375642,0.0027895842],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007971188,0.00029791577,0.01320975,0.000088000175,0.0006139077,0.000073802235,0.0020990104,0.0023781538,0.07841992,0.7299432,0.040873755,0.13192284],"study_design_scores_gemma":[0.004267777,0.00019410055,0.019301394,0.000088507404,0.000018053774,0.0000596531,0.00046511536,0.66031104,0.010940123,0.002170633,0.3012089,0.00097468396],"about_ca_topic_score_codex":0.00013220568,"about_ca_topic_score_gemma":0.000027810042,"teacher_disagreement_score":0.9016165,"about_ca_system_score_codex":0.00006711636,"about_ca_system_score_gemma":0.000067030436,"threshold_uncertainty_score":0.99798685},"labels":[],"label_agreement":null},{"id":"W2949161887","doi":"10.4108/eai.13-7-2018.158526","title":"Nash Equilibrium Seeking with Non-doubly Stochastic Communication Weight Matrix","year":2019,"lang":"en","type":"article","venue":"EAI Endorsed Transactions on Collaborative Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Nash equilibrium; Convergence (economics); Best response; Computer science; Gossip; Correlated equilibrium; Transitive reduction; Game theory; Mathematics; Mathematical optimization; Mathematical economics; Repeated game; Theoretical computer science; Discrete mathematics; Equilibrium selection; Graph; Economics","score_opus":0.006779131420443285,"score_gpt":0.23873920779051538,"score_spread":0.2319600763700721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949161887","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025242092,0.0001266122,0.96866417,0.00085874734,0.0008720671,0.0015020918,0.000049047238,0.00051461405,0.0021705793],"genre_scores_gemma":[0.9741253,0.0000027367985,0.024831085,0.000117251875,0.0000669536,0.0000703757,0.00002606368,0.00004769146,0.0007125291],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967955,0.00042102174,0.00061616657,0.0008468594,0.0006854189,0.0006350604],"domain_scores_gemma":[0.9964866,0.00075976376,0.0004581882,0.0014070905,0.0007035379,0.00018483322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052035303,0.00045964465,0.00055142335,0.00036936562,0.0005277465,0.00054679596,0.0013353219,0.00012947421,0.00005293045],"category_scores_gemma":[0.000022752092,0.00043279072,0.000120872595,0.0023786114,0.00008633536,0.0009836368,0.00005269316,0.0005753825,0.00035457461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003070818,0.00058364804,0.0003235225,0.000111341964,0.0005770412,0.00003519962,0.005274993,0.9566305,0.017656915,0.00788449,0.00039754665,0.010217685],"study_design_scores_gemma":[0.0048537254,0.00039689295,0.000487826,0.00048657716,0.00005262644,0.00003441317,0.00073194085,0.9878062,0.0031877432,0.00007932926,0.0011822692,0.0007004705],"about_ca_topic_score_codex":0.000033279422,"about_ca_topic_score_gemma":0.000035439276,"teacher_disagreement_score":0.94888324,"about_ca_system_score_codex":0.00031757946,"about_ca_system_score_gemma":0.00036504655,"threshold_uncertainty_score":0.99981236},"labels":[],"label_agreement":null},{"id":"W2949477910","doi":"10.23919/ecc.2019.8796152","title":"Guaranteed Voronoi-based Deployment for Multi-Agent Systems under Uncertain Measurements","year":2019,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Collège de Maisonneuve; Concordia University","funders":"","keywords":"Voronoi diagram; Bounded function; Software deployment; Computer science; Multi-agent system; Position (finance); Mathematical optimization; Rectangle; Model predictive control; Control theory (sociology); Mathematics; Control (management); Artificial intelligence","score_opus":0.16853463376820157,"score_gpt":0.32656292149412597,"score_spread":0.1580282877259244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949477910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008735565,0.00107718,0.9752164,0.00066212093,0.010995783,0.00939699,0.00032370436,0.0010055198,0.0004487653],"genre_scores_gemma":[0.9365533,0.0000065292706,0.055215757,0.0010198115,0.00029163482,0.0035423632,0.00035211488,0.0001459396,0.0028725634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9924447,0.0005644905,0.001632506,0.0023659107,0.0017088422,0.0012835818],"domain_scores_gemma":[0.9939189,0.00027061361,0.0010515918,0.0035833847,0.00081798737,0.00035754437],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022175754,0.0011102414,0.0014299805,0.0003790694,0.00020695872,0.0012532414,0.0041921837,0.000667084,0.000017798971],"category_scores_gemma":[0.00012293093,0.0009992671,0.0007808651,0.00026088132,0.00005129323,0.00023811497,0.0011981314,0.000507923,0.0003865406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012765829,0.001272596,0.0020963135,0.0025604484,0.0016475384,0.000018062412,0.00023962611,0.96272826,0.0026275553,0.013704183,0.011337765,0.0016399898],"study_design_scores_gemma":[0.0058769947,0.00012537545,0.0004947339,0.00069071597,0.00013582228,0.0000037384725,0.00008519668,0.98414,0.00092941907,0.00008595124,0.006272755,0.0011593255],"about_ca_topic_score_codex":0.0016643526,"about_ca_topic_score_gemma":0.00012726375,"teacher_disagreement_score":0.93567973,"about_ca_system_score_codex":0.0017822449,"about_ca_system_score_gemma":0.0011198346,"threshold_uncertainty_score":0.9997836},"labels":[],"label_agreement":null},{"id":"W2949746748","doi":"10.48550/arxiv.1903.00290","title":"Trajectory convergence from coordinate-wise decrease of quadratic energy functions, and applications to platoons","year":2019,"lang":"en","type":"preprint","venue":"Repository of the Academy's Library (Library of the Hungarian Academy of Sciences)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Platoon; Convergence (economics); Quadratic equation; Sign (mathematics); Function (biology); Laplacian matrix; Quadratic function; Control theory (sociology); Laplace operator; Positive-definite matrix; Mathematics; Trajectory; Energy (signal processing); Graph; Applied mathematics; Mathematical analysis; Computer science; Physics; Geometry; Control (management); Discrete mathematics; Quantum mechanics","score_opus":0.01794966678256189,"score_gpt":0.2290593412305807,"score_spread":0.2111096744480188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949746748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.831538,0.03103806,0.04621784,0.05681807,0.0072296434,0.011329083,0.0044341264,0.000911905,0.010483217],"genre_scores_gemma":[0.9924679,0.00017074517,0.0036382559,0.0009387808,0.00022675836,0.00013215901,0.000013362418,0.00004944139,0.0023626152],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9933623,0.0010735351,0.0021556506,0.0014606112,0.0014120733,0.00053582096],"domain_scores_gemma":[0.9937048,0.00093990576,0.0033274281,0.0015411633,0.000045977737,0.00044074276],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0006693235,0.0006272072,0.0013233739,0.00048578976,0.00046607867,0.00017427198,0.011853581,0.00081535755,0.00003106549],"category_scores_gemma":[0.000111358924,0.00046230646,0.0006776596,0.0017348051,0.0019656492,0.0028192627,0.006766317,0.0011652606,0.000005317005],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007358123,0.0017041097,0.20593941,0.004418969,0.0025728517,0.000004996634,0.0033571587,0.06372389,0.26711285,0.37031382,0.07297506,0.0071410537],"study_design_scores_gemma":[0.0020077412,0.00029954445,0.21157649,0.004992532,0.0007822009,0.000065087814,0.0005434462,0.06330445,0.645436,0.04276697,0.02627006,0.00195549],"about_ca_topic_score_codex":0.00018398331,"about_ca_topic_score_gemma":5.2848196e-7,"teacher_disagreement_score":0.37832314,"about_ca_system_score_codex":0.000037788934,"about_ca_system_score_gemma":0.0011176621,"threshold_uncertainty_score":0.99978286},"labels":[],"label_agreement":null},{"id":"W2949856922","doi":"10.1115/1.4043802","title":"Leader–Follower Consensus Control of Multiple Quadcopters Under Communication Delays","year":2019,"lang":"en","type":"article","venue":"Journal of Dynamic Systems Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quadcopter; Control theory (sociology); Consensus; Asynchronous communication; Bounded function; Computer science; Linear matrix inequality; Constant (computer programming); Network topology; Lyapunov stability; Multi-agent system; Controller (irrigation); Robust control; Lyapunov function; Control (management); Mathematical optimization; Control system; Mathematics; Nonlinear system; Engineering","score_opus":0.017312237724691024,"score_gpt":0.2157297116010822,"score_spread":0.1984174738763912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949856922","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16198985,0.013559366,0.8187116,0.0017009754,0.0021490357,0.001520379,0.0000308534,0.000049858103,0.000288104],"genre_scores_gemma":[0.99933934,0.000035751684,0.00034255473,0.0001237913,0.000050158647,0.000018320618,0.0000015318736,0.00001919659,0.000069372785],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99560744,0.00076905696,0.0015983818,0.00029245255,0.0013524363,0.0003802315],"domain_scores_gemma":[0.9951205,0.00050420733,0.0019801252,0.0008026625,0.0014020113,0.00019048134],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036677476,0.00029908976,0.001051871,0.00026185595,0.00009259893,0.00017674426,0.00095227285,0.0001472949,0.000004248812],"category_scores_gemma":[0.00019084377,0.00024719647,0.00029093196,0.0001905445,0.0000791487,0.00036053007,0.00004750555,0.00027965475,0.000016515623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031293107,0.0017678929,0.16582708,0.0014298942,0.010527912,0.00011195275,0.003081302,0.06792123,0.7043545,0.023110481,0.0017223329,0.017016113],"study_design_scores_gemma":[0.031718098,0.0006965408,0.016865952,0.0011580482,0.00035095404,0.00026885577,0.0017662392,0.94555396,0.0001230329,0.00012910384,0.0008622081,0.00050698005],"about_ca_topic_score_codex":0.0001372284,"about_ca_topic_score_gemma":0.00004041944,"teacher_disagreement_score":0.87763274,"about_ca_system_score_codex":0.00031196402,"about_ca_system_score_gemma":0.00022318441,"threshold_uncertainty_score":0.99999803},"labels":[],"label_agreement":null},{"id":"W2950593443","doi":"10.1007/978-3-030-17369-2_5","title":"Robust Cooperative Close Formation Flight Control of Multiple Unmanned Aerial Vehicles","year":2019,"lang":"en","type":"book-chapter","venue":"Lecture notes in mechanical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Aeronautics; Aerospace engineering; Control (management); Computer science; Engineering; Artificial intelligence","score_opus":0.012568324562231918,"score_gpt":0.1962129960729631,"score_spread":0.1836446715107312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950593443","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014857779,0.0003902375,0.99611086,0.00018044951,0.0013438808,0.0010279939,0.00010610869,0.0001869602,0.0005049431],"genre_scores_gemma":[0.9908095,0.000017201703,0.008385301,0.000089749185,0.00028729066,0.00003571318,0.00007319673,0.00006532784,0.00023669585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753815,0.000055922716,0.00088193367,0.00059786177,0.0004885193,0.00043760316],"domain_scores_gemma":[0.99780023,0.0008282783,0.00034039785,0.0007350703,0.00019013323,0.00010586883],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037830847,0.0005337395,0.0009846641,0.0002707243,0.00003576477,0.00009343632,0.00091199874,0.00070160464,0.00001998207],"category_scores_gemma":[0.0006305037,0.00050298654,0.00023281742,0.00013681044,0.000020228948,0.00033516777,0.00018270813,0.00071430963,0.00004550101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009439807,0.000038509454,0.0000023664613,0.00026526785,0.00015711825,0.000033037857,0.0001656548,0.71515334,0.043800373,0.23575436,0.000019137584,0.0045164376],"study_design_scores_gemma":[0.0025026207,0.00014490877,0.0000046050013,0.000562908,0.000034516353,0.000011203783,8.471695e-7,0.97183263,0.021251043,0.0013760087,0.0017710107,0.0005077113],"about_ca_topic_score_codex":0.000014362013,"about_ca_topic_score_gemma":0.0000328358,"teacher_disagreement_score":0.99066097,"about_ca_system_score_codex":0.00023805344,"about_ca_system_score_gemma":0.00008893658,"threshold_uncertainty_score":0.99974215},"labels":[],"label_agreement":null},{"id":"W2950674970","doi":"10.48550/arxiv.1303.2709","title":"Resilient Continuous-Time Consensus in Fractional Robust Networks","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Network topology; Robustness (evolution); Multi-agent system; Computer science; Consensus; Topology (electrical circuits); Metric (unit); Mathematics; Mathematical optimization; Artificial intelligence; Combinatorics; Computer network; Engineering","score_opus":0.044259290132220026,"score_gpt":0.17350159443655175,"score_spread":0.12924230430433173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950674970","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15010077,0.00015751616,0.84154373,0.0003229881,0.0017221568,0.0010417997,0.00004875386,0.00041286272,0.0046494296],"genre_scores_gemma":[0.99445736,0.000032675336,0.000821696,0.00009981728,0.00015137227,0.0000064947776,0.00006262178,0.000024313007,0.0043436214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966806,0.0004305612,0.0004907731,0.0015398898,0.00018215032,0.0006760148],"domain_scores_gemma":[0.99696773,0.00036391368,0.0005365998,0.0015545146,0.00030847773,0.00026876383],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047362995,0.00046796116,0.0006603715,0.0003795739,0.00012694308,0.0002759318,0.0020969892,0.0005628283,0.00012961461],"category_scores_gemma":[0.000085761756,0.00056169106,0.0002630022,0.00059871207,0.00013309851,0.00029655782,0.0015918856,0.0010260644,0.0007775406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003320851,0.00014325268,0.0046182503,0.000021741607,0.00009903384,0.00054425787,0.000039215804,0.95789677,0.00002045712,0.031362575,0.0050253007,0.00019592403],"study_design_scores_gemma":[0.001163774,0.000029246023,0.0055983895,0.00014962658,0.00003279264,0.000012646656,0.000038457547,0.98868626,0.0000062000254,0.0025828567,0.0011534302,0.0005463304],"about_ca_topic_score_codex":0.0010226592,"about_ca_topic_score_gemma":0.0000843807,"teacher_disagreement_score":0.84435666,"about_ca_system_score_codex":0.0006144958,"about_ca_system_score_gemma":0.00027646517,"threshold_uncertainty_score":0.99968344},"labels":[],"label_agreement":null},{"id":"W2951228569","doi":"10.48550/arxiv.1310.5163","title":"A New Notion of Effective Resistance for Directed Graphs-Part I: Definition and Properties","year":2013,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Air Force Office of Scientific Research; Army Research Office; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Undirected graph; Directed graph; Algebraic number; Computer science; Graph; Algebraic graph theory; Mathematics; Graph theory; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.04995666418786296,"score_gpt":0.2350756855727875,"score_spread":0.18511902138492453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951228569","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68957734,0.0023945794,0.30083808,0.0006727507,0.0014779845,0.003995307,0.00010481537,0.0004564169,0.00048274672],"genre_scores_gemma":[0.99035704,0.00005166484,0.0079146335,0.000032304855,0.00013882652,0.001016616,0.00006374377,0.000021773449,0.00040342522],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9980817,0.00018485569,0.0004744332,0.00073010125,0.00024596034,0.00028294438],"domain_scores_gemma":[0.9980704,0.0001808189,0.00050868647,0.00072441116,0.000410123,0.00010551325],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030640964,0.00029751778,0.00050744903,0.00014213017,0.00009292963,0.0001355028,0.0005453043,0.00022954843,0.000002363705],"category_scores_gemma":[0.0002847692,0.00026695462,0.00015278367,0.00019794844,0.000063358326,0.000319248,0.00034668154,0.00020747771,0.000019271656],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002445914,0.0015709128,0.2947639,0.023602648,0.004907129,0.000047065576,0.016393093,0.0010596305,0.22487126,0.19849986,0.05230409,0.17953451],"study_design_scores_gemma":[0.006287508,0.00055410777,0.8688601,0.0064044027,0.00039299738,0.000009583706,0.00009197531,0.026232442,0.04334301,0.03898993,0.0067490223,0.0020848853],"about_ca_topic_score_codex":0.000335674,"about_ca_topic_score_gemma":0.00009022289,"teacher_disagreement_score":0.57409626,"about_ca_system_score_codex":0.00008069578,"about_ca_system_score_gemma":0.00011725039,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2951392152","doi":"10.48550/arxiv.1703.06212","title":"Preserving Data-Privacy with Added Noises: Optimal Estimation and Privacy Analysis","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Node (physics); Information privacy; Estimation; Data mining; Noise (video); Computation; Optimal estimation; Algorithm; Artificial intelligence; Machine learning; Computer security","score_opus":0.11057425519801434,"score_gpt":0.22903749542357538,"score_spread":0.11846324022556104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951392152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15681137,0.00008086948,0.8411655,0.00014984011,0.00016817164,0.00053855043,0.00018307977,0.0002542757,0.00064833474],"genre_scores_gemma":[0.98071915,0.000050673523,0.017987775,0.000017068956,0.00005571881,0.0000031759705,0.00038422196,0.000020820124,0.0007614238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966175,0.00021227934,0.00032134514,0.002146036,0.00024187381,0.0004609717],"domain_scores_gemma":[0.99125606,0.000156669,0.00087358535,0.0071684136,0.0002688838,0.00027636136],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00052429916,0.00047305503,0.0007311729,0.00051438354,0.00041442382,0.0011293119,0.00811716,0.00026018237,0.000020986736],"category_scores_gemma":[0.0002282689,0.00048647015,0.00015598572,0.0006954831,0.00014567302,0.002294568,0.01095185,0.00046542674,0.00002596689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092837654,0.00014708492,0.019632487,0.0002314721,0.0028089064,0.00053165026,0.0005646382,0.96490055,0.000016323607,0.008651048,0.0006784553,0.0017445516],"study_design_scores_gemma":[0.00095316855,0.000036930836,0.010501027,0.00014300503,0.0012084498,0.0000055781015,0.00003590004,0.9853408,0.000012858683,0.00076356606,0.00046805412,0.0005307055],"about_ca_topic_score_codex":0.00086490915,"about_ca_topic_score_gemma":0.00011586122,"teacher_disagreement_score":0.82390773,"about_ca_system_score_codex":0.00016898624,"about_ca_system_score_gemma":0.0002853023,"threshold_uncertainty_score":0.9999076},"labels":[],"label_agreement":null},{"id":"W2951483981","doi":"10.48550/arxiv.1305.7182","title":"Average Consensus on Arbitrary Strongly Connected Digraphs with Time-Varying Topologies","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network topology; Strongly connected component; State (computer science); Topology (electrical circuits); Mathematics; Computer science; Consensus; Consensus algorithm; Mathematical optimization; Multi-agent system; Discrete mathematics; Algorithm; Combinatorics; Artificial intelligence","score_opus":0.045376803488742665,"score_gpt":0.1765484122938712,"score_spread":0.13117160880512851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951483981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7553503,0.00008608709,0.22581829,0.00033002446,0.00081009325,0.001332601,0.0001531018,0.0014409361,0.014678586],"genre_scores_gemma":[0.9966312,0.000020326424,0.0011937207,0.00012016897,0.00006462648,0.000006723294,0.000077686505,0.000034396522,0.0018511497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654734,0.0003831077,0.00035620763,0.0017472077,0.00022652725,0.0007396189],"domain_scores_gemma":[0.99626935,0.00052025303,0.0005389546,0.0021030002,0.00028734072,0.00028108284],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020515775,0.00067395624,0.0007367724,0.00042409662,0.00025072333,0.00038041337,0.0024842496,0.00042967685,0.000077899625],"category_scores_gemma":[0.00007195593,0.000656637,0.00027101452,0.00063159387,0.00027884098,0.00033754294,0.0012053614,0.0009442756,0.00053136196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036523337,0.00044463133,0.005439097,0.00019501908,0.0012478589,0.0037022529,0.00041420254,0.6790998,0.00038577415,0.30521658,0.0030116732,0.00047791726],"study_design_scores_gemma":[0.0033011758,0.0004551739,0.0038418141,0.00051705894,0.00014526714,0.000039255996,0.00016196516,0.97833896,0.00040044796,0.010582665,0.0005582727,0.0016579641],"about_ca_topic_score_codex":0.00045607064,"about_ca_topic_score_gemma":0.000020540072,"teacher_disagreement_score":0.29923916,"about_ca_system_score_codex":0.0002713897,"about_ca_system_score_gemma":0.00030616767,"threshold_uncertainty_score":0.9995885},"labels":[],"label_agreement":null},{"id":"W2951535210","doi":"10.48550/arxiv.1205.3676","title":"Consensus of Multi-Agent Networks in the Presence of Adversaries Using Only Local Information","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0790883071418234,"score_gpt":0.2044037597134491,"score_spread":0.12531545257162569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951535210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17166093,0.0001295901,0.82689464,0.000023350583,0.00051796774,0.00053339533,0.000039720133,0.000033102362,0.00016729762],"genre_scores_gemma":[0.9987183,0.00002368933,0.0011670103,0.000024789368,0.000022758513,9.368195e-7,0.000019681589,0.0000055870655,0.000017222392],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981494,0.0004204241,0.00053467305,0.00034916148,0.00019200155,0.00035433442],"domain_scores_gemma":[0.99735916,0.0003105559,0.0008719324,0.0011094228,0.00027108745,0.00007783564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074993947,0.00024862407,0.00041699334,0.00024059982,0.000065169836,0.000055252236,0.0019167672,0.0002623429,0.0000031674251],"category_scores_gemma":[0.00008815948,0.00023355844,0.00017096169,0.0006241161,0.00029155266,0.0005659689,0.0010674468,0.00042389776,0.0000065066624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036306705,0.00011133638,0.010912457,0.00013062663,0.00006426481,0.000023845536,0.001478891,0.96229875,0.000014355444,0.02420519,0.000039856597,0.0006841033],"study_design_scores_gemma":[0.0007791353,0.000018124865,0.008190727,0.00018130337,0.000057530015,0.000006973077,0.0009363697,0.9892756,0.000042322663,0.00021029799,0.00009753801,0.0002040944],"about_ca_topic_score_codex":0.0017650074,"about_ca_topic_score_gemma":0.00015586313,"teacher_disagreement_score":0.82705736,"about_ca_system_score_codex":0.00019286203,"about_ca_system_score_gemma":0.00029928965,"threshold_uncertainty_score":0.95242363},"labels":[],"label_agreement":null},{"id":"W2952265578","doi":"10.48550/arxiv.1003.1423","title":"On Vehicle Placement to Intercept Moving Targets","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Office; Office of Naval Research; Multidisciplinary University Research Initiative; Institute for Collaborative Biotechnologies; Deutscher Akademischer Austauschdienst","keywords":"Line (geometry); Function (biology); Line segment; Regular polygon; Perpendicular; Computer science; Mathematical optimization; Control theory (sociology); Mathematics; Algorithm; Geometry; Artificial intelligence","score_opus":0.04484304085510872,"score_gpt":0.19077016622437162,"score_spread":0.1459271253692629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952265578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31175974,0.000010288303,0.68211895,0.0002286032,0.0019767953,0.0006054474,0.000037812762,0.00034226218,0.0029200953],"genre_scores_gemma":[0.9965434,0.0000046838163,0.0009991108,0.00037202408,0.00013144698,0.0000050244194,0.000020361967,0.000024219042,0.0018997383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973032,0.00015774861,0.00028515133,0.001503409,0.00019476865,0.0005557571],"domain_scores_gemma":[0.9970906,0.00013226614,0.0002526687,0.0019724441,0.00016636342,0.00038568175],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003494453,0.000422889,0.0004148854,0.00035203705,0.0001575594,0.0002666368,0.0031135355,0.00034196654,0.00007874358],"category_scores_gemma":[0.000093417686,0.0004890517,0.00023117938,0.00040964718,0.000041980085,0.0002609094,0.003060628,0.000918475,0.0010919977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016221876,0.00046040385,0.0010771102,0.000117673735,0.0002816856,0.00076966954,0.0012038401,0.77439564,0.0025362447,0.20955805,0.0058686356,0.0035688174],"study_design_scores_gemma":[0.0012819725,0.00019933029,0.0014491753,0.00027553696,0.00004837707,0.0000029424345,0.00011962611,0.984061,0.0008587547,0.0054122205,0.005319857,0.0009712279],"about_ca_topic_score_codex":0.00020149272,"about_ca_topic_score_gemma":0.00009241064,"teacher_disagreement_score":0.68478364,"about_ca_system_score_codex":0.00048586135,"about_ca_system_score_gemma":0.00013839742,"threshold_uncertainty_score":0.9997561},"labels":[],"label_agreement":null},{"id":"W2952323553","doi":"10.48550/arxiv.1204.0304","title":"Distributed continuous-time convex optimization on weight-balanced digraphs","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Lipschitz continuity; Directed graph; Mathematics; Differentiable function; Regular polygon; Convex function; Convex optimization; Strongly connected component; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Pure mathematics","score_opus":0.031497802136021893,"score_gpt":0.17040957579400803,"score_spread":0.13891177365798613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952323553","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0178109,0.00009407576,0.97472024,0.00018090608,0.0016864658,0.00092997367,0.0004909808,0.00094610837,0.0031403296],"genre_scores_gemma":[0.9964819,0.000059263653,0.0010454432,0.000117755364,0.0001814385,0.0000075034723,0.0008386172,0.0000407522,0.0012273337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964028,0.00039729287,0.0004815969,0.0015982245,0.000267453,0.0008526563],"domain_scores_gemma":[0.9959797,0.00022050497,0.00076715037,0.0022266693,0.00037017217,0.00043578172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039329258,0.0006855794,0.00087733264,0.00034800326,0.00022933137,0.00031138764,0.0027972155,0.0006050827,0.000106452135],"category_scores_gemma":[0.00008118264,0.00076637627,0.00042899238,0.0008430304,0.00013420125,0.0006547382,0.0012112428,0.0007028114,0.00070098747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014306275,0.00054714514,0.0061298893,0.000102073755,0.00052758865,0.0002840662,0.00015389765,0.85408664,0.00017120157,0.13413262,0.0033349707,0.00038682358],"study_design_scores_gemma":[0.0020139208,0.000077010656,0.0018164587,0.00020232738,0.00015541662,0.0000056914714,0.000022043821,0.9909537,0.00018987003,0.0017428368,0.001817503,0.0010032177],"about_ca_topic_score_codex":0.000092163595,"about_ca_topic_score_gemma":0.0000038897065,"teacher_disagreement_score":0.978671,"about_ca_system_score_codex":0.0004643415,"about_ca_system_score_gemma":0.00016935512,"threshold_uncertainty_score":0.9994787},"labels":[],"label_agreement":null},{"id":"W2953043874","doi":"10.48550/arxiv.1011.2235","title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs; Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Gossip; Binary logarithm; Hierarchy; Computer science; De Bruijn sequence; Scaling; Network packet; Key (lock); Gossip protocol; Scale (ratio); Theoretical computer science; Wireless network; State (computer science); Wireless; Mathematics; Discrete mathematics; Algorithm; Computer network; Geography","score_opus":0.044478483547287215,"score_gpt":0.19458642897353184,"score_spread":0.15010794542624462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953043874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32950535,0.000053268184,0.6671148,0.00007095312,0.0017559046,0.0010749537,0.000051817744,0.00022510291,0.0001478667],"genre_scores_gemma":[0.9978074,0.00004510031,0.0015620678,0.000059294536,0.000116143085,0.000017047061,0.00008651135,0.000036283127,0.00027015267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964379,0.0002484038,0.0004856231,0.0017054313,0.00014938072,0.0009732308],"domain_scores_gemma":[0.9970195,0.0003354508,0.00046726575,0.0016494254,0.00021420431,0.00031413257],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067480636,0.0005282665,0.00072014873,0.00033048535,0.00019170763,0.00031965759,0.002722386,0.0006478472,0.00001090678],"category_scores_gemma":[0.000066437584,0.000619377,0.00039185624,0.0006508243,0.000108286695,0.00022832946,0.0014327707,0.0010592903,0.0000284105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000091438545,0.00026326673,0.0039179116,0.00010792384,0.000091557544,0.00025299485,0.00029599635,0.9498424,0.00015454183,0.04275971,0.00018383864,0.0020384465],"study_design_scores_gemma":[0.0031393194,0.000019424746,0.0024870038,0.0002105006,0.000045506804,0.0000037710104,0.000038384318,0.99180454,0.0001082345,0.0010415944,0.00046628437,0.00063540775],"about_ca_topic_score_codex":0.00029767034,"about_ca_topic_score_gemma":0.00031487684,"teacher_disagreement_score":0.66830206,"about_ca_system_score_codex":0.00046502508,"about_ca_system_score_gemma":0.00019892919,"threshold_uncertainty_score":0.99962574},"labels":[],"label_agreement":null},{"id":"W2953044765","doi":"10.48550/arxiv.1001.4494","title":"Geometric Analysis of the Formation Problem for Autonomous Robots","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Center manifold; Robot; Invariant manifold; Invariant (physics); Linearization; Control theory (sociology); Lyapunov function; Mathematics; Instability; Feedback linearization; Stability (learning theory); Manifold (fluid mechanics); Lyapunov stability; Computer science; Control (management); Pure mathematics; Artificial intelligence; Engineering; Physics; Nonlinear system","score_opus":0.05603456060483518,"score_gpt":0.18720447880159244,"score_spread":0.13116991819675727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953044765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07492981,0.000025512194,0.92259145,0.00009796271,0.00059508666,0.0009938474,0.00013589527,0.000113166614,0.0005172595],"genre_scores_gemma":[0.9967506,0.000008099426,0.0025353478,0.00002268652,0.000028629081,0.000007600361,0.00006356387,0.0000095878,0.0005738718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983297,0.00011777164,0.00039076273,0.0007056576,0.00014392617,0.0003121799],"domain_scores_gemma":[0.99665064,0.00017735375,0.00093553745,0.001730926,0.00041462516,0.00009089507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048747155,0.0002485042,0.000522501,0.001059819,0.00015043626,0.00012263407,0.0029503563,0.00032604212,0.0000068545783],"category_scores_gemma":[0.00008280996,0.00022342445,0.00072681205,0.003744153,0.00006011015,0.0004059914,0.0012385236,0.00037824688,0.000009263063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000108792365,0.000091118265,0.0018809914,0.00013093304,0.0008497069,0.000004037153,0.00014842018,0.93747187,0.00012309485,0.057932045,0.00014806415,0.0012088307],"study_design_scores_gemma":[0.0004609174,0.000021018926,0.0059978,0.000030674888,0.0009345997,7.948366e-7,0.000017055372,0.98825413,0.00026832646,0.0033692606,0.0004095739,0.0002358259],"about_ca_topic_score_codex":0.00021334889,"about_ca_topic_score_gemma":0.00019363979,"teacher_disagreement_score":0.9218208,"about_ca_system_score_codex":0.00024913918,"about_ca_system_score_gemma":0.00019101352,"threshold_uncertainty_score":0.9110984},"labels":[],"label_agreement":null},{"id":"W2953256091","doi":"10.48550/arxiv.1204.6093","title":"Linear Consensus Algorithms Based on Balanced Asymmetric Chains","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Consensus algorithm; Set (abstract data type); Chain (unit); Property (philosophy); Algorithm; Computer science; Finite set; Mathematics; Discrete mathematics; Mathematical optimization","score_opus":0.07515525536335256,"score_gpt":0.201810817711824,"score_spread":0.12665556234847142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953256091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013066703,0.00009685653,0.9754961,0.00030203225,0.0028356633,0.0008210849,0.00020997568,0.00072768616,0.006443865],"genre_scores_gemma":[0.99451196,0.000017473436,0.0033320785,0.00028199947,0.00030536583,0.000004437913,0.00008382691,0.00003753543,0.001425338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964102,0.00042045073,0.00039268043,0.0016077659,0.00030219805,0.0008667411],"domain_scores_gemma":[0.99566305,0.0004495705,0.00055215316,0.002546228,0.00030876114,0.00048023587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006285852,0.0006147653,0.0006994664,0.0007904232,0.00019198043,0.00015277344,0.0027403738,0.0005426271,0.00002270883],"category_scores_gemma":[0.00016913385,0.0006936203,0.00042277892,0.0015707617,0.000112072485,0.00017385856,0.0010958578,0.0008996934,0.00060391665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015170674,0.001040693,0.007224431,0.00024766065,0.00043555198,0.0014547498,0.00015812766,0.85279864,0.00008104013,0.1285526,0.0022386222,0.0056161713],"study_design_scores_gemma":[0.0017761814,0.00007360956,0.0023277414,0.0001223107,0.00007747105,0.0000044418643,0.00001817209,0.9928189,0.00011530677,0.00046774905,0.0014860956,0.00071204995],"about_ca_topic_score_codex":0.00019979836,"about_ca_topic_score_gemma":0.0000097152715,"teacher_disagreement_score":0.98144525,"about_ca_system_score_codex":0.0005767283,"about_ca_system_score_gemma":0.00035317484,"threshold_uncertainty_score":0.9995515},"labels":[],"label_agreement":null},{"id":"W2954632434","doi":"10.1109/tcyb.2019.2923798","title":"Guaranteed Synchronization Performance Control of Nonlinear Time-Delay MIMO Multiagent Systems With Actuator Faults","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Control theory (sociology); Actuator; Synchronization (alternating current); Nonlinear system; Computer science; MIMO; Controller (irrigation); Lyapunov function; Bounded function; Transient (computer programming); Control (management); Mathematics; Channel (broadcasting); Artificial intelligence","score_opus":0.0058420835456466985,"score_gpt":0.19522250836957714,"score_spread":0.18938042482393044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2954632434","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16633646,0.00005497631,0.8310006,0.000050599316,0.00086261664,0.0011722454,0.0001494352,0.00018317354,0.00018984899],"genre_scores_gemma":[0.99587095,0.00001880855,0.003030167,0.000056361936,0.000044010623,0.000064211185,0.000010131135,0.00003980046,0.00086557283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758613,0.00013200482,0.0006278232,0.00052903086,0.0007123024,0.00041269383],"domain_scores_gemma":[0.99801165,0.00018668722,0.00034748294,0.0009603713,0.00035778817,0.0001360419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025624898,0.00033335126,0.0004965372,0.00019202677,0.00010457655,0.00009087154,0.00071745034,0.00016253482,0.000036998557],"category_scores_gemma":[0.000005749681,0.00028633862,0.000120550045,0.0004801511,0.00006513474,0.00033740173,0.0000034284178,0.00024133964,0.0006059179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002707782,0.0006909037,0.0004704203,0.0002431129,0.0003793945,0.000012934849,0.00064102287,0.9800337,0.00946843,0.00013783955,0.0000547873,0.0075966828],"study_design_scores_gemma":[0.0037216516,0.00066621543,0.00021443675,0.00025497127,0.000078049045,0.00003641229,0.000043286836,0.9848612,0.009254681,6.6345655e-7,0.000546313,0.0003221436],"about_ca_topic_score_codex":0.00008666432,"about_ca_topic_score_gemma":0.000012530305,"teacher_disagreement_score":0.8295345,"about_ca_system_score_codex":0.00015631807,"about_ca_system_score_gemma":0.00014358984,"threshold_uncertainty_score":0.9999589},"labels":[],"label_agreement":null},{"id":"W2955171921","doi":"10.1049/iet-cta.2018.5248","title":"Decentralised event‐based synchronisation and control of spacecraft","year":2019,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Spacecraft; Control theory (sociology); Computer science; Control (management); Control engineering; Synchronization (alternating current); Event (particle physics); Engineering; Aerospace engineering; Artificial intelligence; Physics; Telecommunications","score_opus":0.004002505601780578,"score_gpt":0.22038820535904102,"score_spread":0.21638569975726044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955171921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015578801,0.0006641923,0.98062027,0.0010365541,0.00006797718,0.0015515445,0.00010330405,0.000087629145,0.00028970564],"genre_scores_gemma":[0.99877965,0.000011890792,0.00036035027,0.0003852007,0.000041386502,0.00032410456,0.000013727875,0.0000091867105,0.00007450923],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998606,0.00027871117,0.00032646747,0.00037873772,0.00017680692,0.00023322253],"domain_scores_gemma":[0.99820834,0.0007639267,0.00023309392,0.00056661066,0.00010708318,0.00012096678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007763942,0.00015918701,0.0003065529,0.00007067104,0.00010410359,0.00008808364,0.000329968,0.00007789821,0.000021732605],"category_scores_gemma":[0.000043371034,0.000147524,0.000068108835,0.00016232862,0.000096863245,0.00023189736,0.000029297125,0.000082821985,0.000027988684],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013210393,0.00013486228,0.0052261474,0.00007212835,0.00010517024,6.876233e-7,0.00011713297,0.0011423369,0.035797406,0.9438119,0.000032350283,0.0134278005],"study_design_scores_gemma":[0.03167683,0.00038170198,0.03546051,0.00015842868,0.0003278217,0.000022234699,0.00027124165,0.8375613,0.0048226523,0.061116364,0.027230753,0.0009701707],"about_ca_topic_score_codex":0.000009520415,"about_ca_topic_score_gemma":0.0000018306517,"teacher_disagreement_score":0.98320085,"about_ca_system_score_codex":0.00002610109,"about_ca_system_score_gemma":0.00006174696,"threshold_uncertainty_score":0.6015854},"labels":[],"label_agreement":null},{"id":"W2955520961","doi":"10.1109/lcsys.2019.2922105","title":"MinMax Mean-Field Team Approach for a Leader–Follower Network: A Saddle-Point Strategy","year":2019,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Saddle point; Minimax; Mean field theory; Saddle; Mathematics; Robustness (evolution); Field (mathematics); Control theory (sociology); Computer science; Mathematical optimization; Control (management); Physics; Geometry","score_opus":0.017465599838235396,"score_gpt":0.2222001312651696,"score_spread":0.2047345314269342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955520961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055586197,0.0008574369,0.9746034,0.0018318365,0.0064941277,0.0058866944,0.00006343961,0.00052966014,0.004174753],"genre_scores_gemma":[0.98992765,0.0000018001916,0.0015528682,0.0044702264,0.0015313994,0.0013910596,0.000022873559,0.000074302196,0.0010278494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99415326,0.0004686153,0.0012334333,0.001403755,0.0010653329,0.0016756242],"domain_scores_gemma":[0.9960627,0.00075905526,0.00066678773,0.0018553063,0.00031786022,0.0003382702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002143101,0.0006884341,0.0013128042,0.0001990039,0.00021976519,0.000920013,0.002141424,0.00033825618,0.000006862387],"category_scores_gemma":[0.000085126805,0.0006246353,0.00060665887,0.00044623556,0.000050110608,0.0009108126,0.0000828953,0.00040772528,0.0002628332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050187093,0.00038542005,0.0015136906,0.00092969567,0.0015950297,0.000051883162,0.0010723695,0.45195225,0.07620435,0.0136982305,0.4493093,0.0027859109],"study_design_scores_gemma":[0.010187956,0.00046452563,0.00007647605,0.00023662994,0.00010734403,0.00008943903,0.00035031655,0.9625649,0.0001715591,0.000033619075,0.02464908,0.0010681846],"about_ca_topic_score_codex":0.00038955163,"about_ca_topic_score_gemma":0.00002095534,"teacher_disagreement_score":0.984369,"about_ca_system_score_codex":0.00036929583,"about_ca_system_score_gemma":0.00016675399,"threshold_uncertainty_score":0.9996205},"labels":[],"label_agreement":null},{"id":"W2962815477","doi":"10.3390/robotics8030061","title":"A Sensor-Network-Supported Mobile-Agent-Search Strategy for Wilderness Rescue","year":2019,"lang":"en","type":"article","venue":"Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Software deployment; Computer science; Search and rescue; Heuristic; Real-time computing; Iterative deepening depth-first search; Mathematical optimization; Search algorithm; Incremental heuristic search; Distributed computing; Artificial intelligence; Beam search; Algorithm; Mathematics","score_opus":0.035066140029352676,"score_gpt":0.28523053197790865,"score_spread":0.250164391948556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962815477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01343797,0.00016907552,0.9812267,0.00032103516,0.0015116871,0.0021362058,0.000042762018,0.0003223916,0.0008321812],"genre_scores_gemma":[0.9664555,0.000011418952,0.028861409,0.00013774139,0.00031958806,0.00011498451,0.000072031806,0.000043378823,0.003983902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971463,0.00015827242,0.00051419466,0.0007020053,0.0005307007,0.0009485032],"domain_scores_gemma":[0.9978375,0.0002464275,0.00013517837,0.0012473244,0.00030640155,0.00022719991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006638584,0.0002803368,0.00043595603,0.000087239656,0.00013363003,0.000352728,0.0012538184,0.00017961655,0.000028245804],"category_scores_gemma":[0.000034615605,0.0002721745,0.00017891967,0.00046398147,0.00003712199,0.00034437233,0.00023737847,0.0002192878,0.00051373726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002505573,0.00011868418,0.0029055064,0.00010774412,0.00010578532,0.000029021447,0.00013679825,0.9544779,0.0006124886,0.03215662,0.002462423,0.006861949],"study_design_scores_gemma":[0.0018235386,0.0003073815,0.0020175795,0.000066188106,0.000028830622,0.000026125144,0.00014107564,0.98925215,0.0002485947,0.00040466734,0.0052357796,0.00044807824],"about_ca_topic_score_codex":0.000037367958,"about_ca_topic_score_gemma":0.000012997295,"teacher_disagreement_score":0.9530176,"about_ca_system_score_codex":0.00011903516,"about_ca_system_score_gemma":0.00021062949,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W2962970230","doi":"10.1109/allerton.2012.6483385","title":"Theorems about ergodicity and class-ergodicity of chains with applications in known consensus models","year":2012,"lang":"","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Ergodicity; Class (philosophy); Mathematics; Property (philosophy); Discrete mathematics; Limiting; Consensus; Statistical physics; Chain (unit); Applied mathematics; Computer science; Mathematical economics; Combinatorics; Multi-agent system; Artificial intelligence; Statistics; Physics","score_opus":0.014826376647734866,"score_gpt":0.2314358263652672,"score_spread":0.21660944971753232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962970230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17720468,0.0095228935,0.8062433,0.0015256817,0.00017669679,0.0034227322,0.00035655138,0.00038829882,0.0011591793],"genre_scores_gemma":[0.9710436,0.0004938287,0.026078694,0.0004173312,0.000192867,0.0013974328,0.000036406207,0.0001005506,0.00023931323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926141,0.0008480976,0.0018700188,0.0013336324,0.0010699662,0.0022641926],"domain_scores_gemma":[0.9937905,0.0006941085,0.0012971001,0.002618396,0.0003980601,0.0012018045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002890857,0.0010554763,0.0015805911,0.0010127511,0.00045681637,0.00037746,0.0017639991,0.00081734895,0.000011609001],"category_scores_gemma":[0.00020499948,0.0009917866,0.00027736108,0.0021652314,0.0010694595,0.0011824539,0.0007725464,0.0011264019,0.000008088221],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033494615,0.0021617285,0.16955866,0.00028898416,0.00024739778,0.000034346747,0.00294852,0.014084626,0.003094779,0.79034203,0.00023733689,0.016666617],"study_design_scores_gemma":[0.0025985227,0.00032763224,0.09641337,0.000448895,0.00014450029,0.00020131351,0.0004469854,0.8913478,0.0028047292,0.0033679372,0.00080720184,0.0010910656],"about_ca_topic_score_codex":0.017910957,"about_ca_topic_score_gemma":0.005736915,"teacher_disagreement_score":0.87726325,"about_ca_system_score_codex":0.00092722167,"about_ca_system_score_gemma":0.00082747795,"threshold_uncertainty_score":0.9992533},"labels":[],"label_agreement":null},{"id":"W2963097206","doi":"10.1002/asjc.2165","title":"Distributed accelerating of quantized second‐order consensus with bounded input","year":2019,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Convergence (economics); Lyapunov function; Control theory (sociology); Adjacency matrix; Mathematics; Graph; Directed graph; Consensus; Strongly connected component; Position (finance); Computer science; Topology (electrical circuits); Multi-agent system; Control (management); Discrete mathematics; Combinatorics; Mathematical analysis; Nonlinear system","score_opus":0.010042918763820323,"score_gpt":0.2223869245994567,"score_spread":0.21234400583563637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963097206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32946247,0.00030645452,0.662484,0.0033663015,0.0008884091,0.000736269,0.00008710956,0.000058758862,0.002610271],"genre_scores_gemma":[0.99262255,9.800568e-7,0.006989194,0.00016814518,0.00009464536,0.0000047923945,0.0000044684334,0.000018962337,0.000096261334],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969731,0.0003439602,0.0012472515,0.00028383106,0.00069744926,0.00045439252],"domain_scores_gemma":[0.99578804,0.00032853702,0.00185695,0.0006196765,0.0011830291,0.0002237519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009779243,0.00027531016,0.0009881501,0.0002040338,0.00007629258,0.00025478148,0.0011063329,0.000106435225,0.000084315],"category_scores_gemma":[0.0002448733,0.00020993223,0.00022226233,0.0005087875,0.00008229455,0.00050958066,0.000052872845,0.00036856497,0.00002954421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011768786,0.003157994,0.27179784,0.0012848008,0.014696586,0.0036484187,0.008837471,0.017995594,0.32614768,0.25644544,0.012350429,0.07186896],"study_design_scores_gemma":[0.26462868,0.012272475,0.12379088,0.00334685,0.0011436904,0.007981324,0.0047771106,0.527545,0.016986188,0.005790445,0.027436292,0.004301082],"about_ca_topic_score_codex":0.000008841858,"about_ca_topic_score_gemma":0.000014768682,"teacher_disagreement_score":0.6631601,"about_ca_system_score_codex":0.00007592276,"about_ca_system_score_gemma":0.0005433601,"threshold_uncertainty_score":0.8560788},"labels":[],"label_agreement":null},{"id":"W2963596156","doi":"10.1109/cdc.2017.8264076","title":"Superlinearly convergent asynchronous distributed network newton method","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Asynchronous communication; Sublinear function; Rate of convergence; Computer science; Mathematical optimization; Bounded function; Convergence (economics); Distributed algorithm; Algorithm; Distributed computing; Mathematics; Discrete mathematics; Key (lock)","score_opus":0.029007161352232056,"score_gpt":0.2968020209197903,"score_spread":0.2677948595675582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963596156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003209245,0.00079883385,0.97731036,0.0033847515,0.011417144,0.0014719472,0.00043362862,0.0011888255,0.0036735616],"genre_scores_gemma":[0.49504697,0.00021438462,0.48599336,0.0009598344,0.005339765,0.00094577635,0.0035253703,0.00021920477,0.007755312],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.993611,0.0006543913,0.0012099316,0.0021290826,0.0010036144,0.0013920213],"domain_scores_gemma":[0.9916216,0.0003128353,0.0009777959,0.005940743,0.0005386796,0.0006083302],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0018124434,0.000972871,0.0014640946,0.0001323517,0.00054713606,0.0025391157,0.007624754,0.00076056,0.0001399189],"category_scores_gemma":[0.00028429338,0.0009078673,0.0006927331,0.00023285244,0.00009991288,0.0005499233,0.0055398606,0.0012087455,0.0006200277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011481487,0.0008628168,0.006503547,0.0008223571,0.003222168,0.00094787095,0.00072809804,0.16869631,0.00038272463,0.3215353,0.3885417,0.107642286],"study_design_scores_gemma":[0.0014833342,0.00010370834,0.0050430484,0.00029519774,0.00014067416,0.000048816626,0.000012433513,0.87571037,0.0003031696,0.008808592,0.106499195,0.00155146],"about_ca_topic_score_codex":0.0019167585,"about_ca_topic_score_gemma":0.0001444966,"teacher_disagreement_score":0.7070141,"about_ca_system_score_codex":0.0005213714,"about_ca_system_score_gemma":0.0008522864,"threshold_uncertainty_score":0.9993372},"labels":[],"label_agreement":null},{"id":"W2963617766","doi":"10.1007/978-3-030-25629-6_108","title":"Distributed Connectivity-Preserving Coordination of Multi-agent Systems with Bounded Velocities","year":2019,"lang":"en","type":"book-chapter","venue":"Advances in intelligent systems and computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Bounded function; Control theory (sociology); Computer science; Integrator; Actuator; Controller (irrigation); Multi-agent system; Scaling; Exploit; Monotonic function; Distributed computing; Topology (electrical circuits); Control (management); Mathematics; Geometry; Mathematical analysis; Artificial intelligence","score_opus":0.02087058666001351,"score_gpt":0.25413672957092137,"score_spread":0.23326614291090786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963617766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010879233,0.035159364,0.9482201,0.000034475637,0.0031566005,0.0022681332,0.00016549956,0.00020367964,0.00970428],"genre_scores_gemma":[0.9878717,0.0005506923,0.0010323105,0.000011673339,0.00016893855,0.000051251554,0.00011415105,0.00007855233,0.010120743],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953762,0.00022451642,0.0016947621,0.0012108827,0.00085974374,0.0006338422],"domain_scores_gemma":[0.995395,0.0008615599,0.0019238852,0.0010905653,0.0005821575,0.0001468139],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010898585,0.00077277387,0.0016481563,0.00046465473,0.00019298111,0.0004891827,0.0012222711,0.00036144338,0.0000032081791],"category_scores_gemma":[0.000097772245,0.00070341775,0.00015487657,0.00023572112,0.00017125864,0.000795476,0.0006250285,0.00052564254,0.000017577579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007081071,0.00014674522,0.0036366184,0.005174553,0.0005105872,0.000102000085,0.001218602,0.1873538,0.00005786598,0.78972036,0.000117667,0.011890404],"study_design_scores_gemma":[0.0014782564,0.0003139654,0.00017711445,0.009838615,0.000065331325,0.0001175739,0.0010923912,0.94378567,0.00006109603,0.0006707441,0.041236818,0.001162453],"about_ca_topic_score_codex":0.0005472557,"about_ca_topic_score_gemma":0.000121445075,"teacher_disagreement_score":0.98678374,"about_ca_system_score_codex":0.0004966761,"about_ca_system_score_gemma":0.0001818595,"threshold_uncertainty_score":0.9995417},"labels":[],"label_agreement":null},{"id":"W2963631491","doi":"10.1109/tmech.2019.2929216","title":"Anti-disturbance Coordinated Path-following Control of Robotic Autonomous Surface Vehicles: Theory and Experiment","year":2019,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Underactuation; Control theory (sociology); Cascade; Observer (physics); State observer; Computer science; Bounded function; Stability (learning theory); Controller (irrigation); Path (computing); Inner loop; Control engineering; Engineering; Control (management); Mathematics; Artificial intelligence; Physics; Nonlinear system","score_opus":0.0073759708867842015,"score_gpt":0.2215003537121306,"score_spread":0.21412438282534638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963631491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25287604,0.0010767969,0.7435868,0.0001696069,0.0012938384,0.0007004285,0.00004192602,0.0002089374,0.00004564252],"genre_scores_gemma":[0.9971806,0.000026997803,0.0022845548,0.00008185686,0.000013624482,0.000040089646,0.000004112158,0.000034657845,0.00033355423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732554,0.0003817686,0.0005812943,0.00070871064,0.00044778627,0.0005549302],"domain_scores_gemma":[0.998113,0.00038437062,0.00025595186,0.0009781157,0.00010762283,0.00016097854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00087019196,0.00036207412,0.00068967894,0.00012328781,0.00017614895,0.00012502882,0.00072383665,0.00017286207,0.000020067679],"category_scores_gemma":[0.000011968964,0.00035777807,0.00027201595,0.0003704529,0.00005896012,0.00048173894,0.000011440102,0.00032875378,0.00007962465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025454865,0.0010883608,0.00078880077,0.00020677305,0.0010356852,0.0000395711,0.0019992716,0.62697595,0.27799916,0.08074453,0.00004434608,0.008823001],"study_design_scores_gemma":[0.008187083,0.0008090449,0.00044685192,0.00033506428,0.00021795959,0.000026345399,0.00058005785,0.8854363,0.10170714,0.0009021803,0.00037526872,0.000976729],"about_ca_topic_score_codex":0.000044059332,"about_ca_topic_score_gemma":0.0000018349789,"teacher_disagreement_score":0.74430454,"about_ca_system_score_codex":0.00024905542,"about_ca_system_score_gemma":0.00016355597,"threshold_uncertainty_score":0.9998874},"labels":[],"label_agreement":null},{"id":"W2964528330","doi":"10.1109/tac.2020.3015354","title":"Single-Timescale Distributed GNE Seeking for Aggregative Games Over Networks via Forward–Backward Operator Splitting","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotonic function; Convergence (economics); Operator (biology); Affine transformation; Property (philosophy); Constant (computer programming); Aggregate (composite); Nash equilibrium","score_opus":0.01505746729932236,"score_gpt":0.23317643891707446,"score_spread":0.2181189716177521,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964528330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002862955,0.00012044311,0.9888245,0.0030706413,0.001049494,0.002379845,0.00044620945,0.001202917,0.000042985455],"genre_scores_gemma":[0.988665,0.000002436343,0.008797279,0.0015045067,0.00022157069,0.00065191626,0.00002647062,0.000060286282,0.00007057117],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99637896,0.00023458808,0.001034737,0.0009310715,0.0005491829,0.0008714419],"domain_scores_gemma":[0.9969226,0.001159615,0.00045692472,0.0007372734,0.00026681265,0.00045677],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045193234,0.0005491999,0.00092239457,0.00013081194,0.00047140082,0.00054266176,0.0009880721,0.00021790253,0.00007278173],"category_scores_gemma":[0.000108041866,0.00053175376,0.00053819915,0.00075768534,0.00007988395,0.0007336812,0.00000936064,0.0003150831,0.000077274184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043644142,0.0012339914,0.00008712619,0.0004434296,0.0022052731,0.000074784875,0.0030603774,0.4166671,0.031504065,0.00087069545,0.0023803113,0.5410364],"study_design_scores_gemma":[0.0059334375,0.00042038085,0.00010598209,0.00018834516,0.0001958097,0.00001233467,0.000079023965,0.98847467,0.0029445698,0.00008751415,0.0010259215,0.00053198746],"about_ca_topic_score_codex":0.000025009222,"about_ca_topic_score_gemma":0.000013559401,"teacher_disagreement_score":0.985802,"about_ca_system_score_codex":0.00029298387,"about_ca_system_score_gemma":0.00010516582,"threshold_uncertainty_score":0.9997134},"labels":[],"label_agreement":null},{"id":"W2966520021","doi":"","title":"Decentralized Adaptive Fault-Tolerant Cooperative Control of Multi-UAVs Under Actuator Faults and Directed Communication Topology","year":2019,"lang":"en","type":"article","venue":"Asian Control Conference","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Synchronization (alternating current); Actuator; Fault tolerance; Control theory (sociology); Scheme (mathematics); Control engineering; Computer science; Decentralised system; Fault (geology); Adaptive control; Control (management); Attitude control; Topology (electrical circuits); Engineering; Distributed computing; Channel (broadcasting); Artificial intelligence; Computer network; Mathematics","score_opus":0.019668348569054896,"score_gpt":0.25410177071594,"score_spread":0.2344334221468851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966520021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06889947,0.0009931735,0.92214787,0.0033979516,0.00040443428,0.0026240742,0.00025078547,0.00032546427,0.00095675694],"genre_scores_gemma":[0.9952224,0.000050508246,0.003854481,0.00051138,0.000016609138,0.00012968479,0.00002944827,0.000022690921,0.00016280195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621487,0.001117044,0.00083067635,0.00080119714,0.00040087884,0.0006353288],"domain_scores_gemma":[0.9961049,0.00076783256,0.0006195102,0.0012921894,0.000953205,0.00026236975],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004988021,0.00044979167,0.001109691,0.00015260308,0.00016188927,0.00015871406,0.0013618374,0.0002557976,0.0000795736],"category_scores_gemma":[0.00022794578,0.0004051762,0.00013502642,0.0003106151,0.00030353648,0.00065723434,0.00017635788,0.00034891264,0.00008541608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031418244,0.0016168606,0.01803377,0.00017322978,0.0030964068,0.000063893596,0.015033017,0.0021388298,0.12600441,0.77497697,0.00030481123,0.05541598],"study_design_scores_gemma":[0.030224428,0.00052699196,0.03354953,0.00020785318,0.00012240537,0.000029761351,0.0018274068,0.930212,0.0013928188,0.0005782447,0.0005915916,0.0007369538],"about_ca_topic_score_codex":0.00050275656,"about_ca_topic_score_gemma":0.00033592398,"teacher_disagreement_score":0.92807317,"about_ca_system_score_codex":0.00010762003,"about_ca_system_score_gemma":0.00032674463,"threshold_uncertainty_score":0.99984},"labels":[],"label_agreement":null},{"id":"W2966986364","doi":"10.1109/rose.2019.8790405","title":"Non-autonomous State-Feedback to Stabilize the Error Dynamics in Time-Varying Area Coverage Control Problems","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Voronoi diagram; Workspace; Metric (unit); Computer science; Centroid; Control theory (sociology); Controller (irrigation); Tessellation (computer graphics); Scheme (mathematics); Mobile robot; State (computer science); Performance metric; Control (management); Robot; Mathematical optimization; Mathematics; Engineering; Algorithm; Artificial intelligence","score_opus":0.009378568313205956,"score_gpt":0.21527922715251455,"score_spread":0.20590065883930858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2966986364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27649763,0.00003541576,0.70393723,0.0029949339,0.0006621804,0.0043527004,0.00010490648,0.00031237025,0.0111025935],"genre_scores_gemma":[0.9933597,0.0000013669152,0.00080062,0.0010834029,0.000021705953,0.00018431715,0.00001818044,0.00002852782,0.0045022164],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969412,0.00016059396,0.00070090935,0.000790842,0.00059354387,0.0008129069],"domain_scores_gemma":[0.9976594,0.0003706576,0.0001992306,0.0014308603,0.00013983517,0.00020005293],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010517037,0.0003484602,0.00053352414,0.00015251804,0.00009282842,0.00059326837,0.0022616682,0.00009654474,0.000120759185],"category_scores_gemma":[0.00005915115,0.00025174415,0.00012462042,0.00067655783,0.000032073734,0.0006078214,0.0004088336,0.00027999538,0.0021938798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036467932,0.001233704,0.14292407,0.0002801354,0.00040492482,0.00013857796,0.0064932657,0.78718007,0.024009395,0.016845968,0.0040594935,0.016065713],"study_design_scores_gemma":[0.0030607998,0.0001458905,0.004489981,0.00006556215,0.000006333733,0.00000897742,0.00007337909,0.98994297,0.000116814466,0.00032927882,0.001375671,0.00038434297],"about_ca_topic_score_codex":0.00063741655,"about_ca_topic_score_gemma":0.00047255706,"teacher_disagreement_score":0.716862,"about_ca_system_score_codex":0.0007232977,"about_ca_system_score_gemma":0.00018610562,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W2967034841","doi":"10.1016/j.jmaa.2019.123404","title":"Some weak flocking models and its application to target tracking","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Flocking (texture); Mathematics; Tracking (education); Artificial intelligence; Computer science; Physics","score_opus":0.01726552550340665,"score_gpt":0.26298173137914965,"score_spread":0.245716205875743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967034841","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022044621,0.0004927566,0.97557634,0.0012483321,0.0000123499785,0.00035191645,0.0000050132094,0.00001880106,0.00024984515],"genre_scores_gemma":[0.97743636,0.000030322166,0.022223273,0.0000866093,0.000090433765,0.000050112198,0.0000017348734,0.0000058498185,0.000075317315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986823,0.000034733883,0.0005773456,0.0002379135,0.00031414733,0.00015355533],"domain_scores_gemma":[0.99880105,0.00015145147,0.00033686994,0.0003058365,0.00020636979,0.00019840735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005766504,0.00011212486,0.00042088752,0.00026132478,0.00008610138,0.0001805259,0.00039331338,0.000046271824,0.000007739434],"category_scores_gemma":[0.000025999774,0.00008816076,0.0001340119,0.00069653144,0.000011001397,0.00052732596,0.00009491242,0.000105620595,0.000037271344],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003794292,0.00016749249,0.00033756983,0.000077826735,0.00043453605,0.000001184067,0.00030727417,0.012924943,0.007581704,0.9644738,0.000026450254,0.0136634465],"study_design_scores_gemma":[0.00022375675,0.00002664273,0.00067590096,0.000030836898,0.0002393952,0.000034174187,0.000077604665,0.900855,0.00035647047,0.09633711,0.0010141433,0.00012896421],"about_ca_topic_score_codex":0.000001498076,"about_ca_topic_score_gemma":4.9162617e-7,"teacher_disagreement_score":0.9553917,"about_ca_system_score_codex":0.000025446678,"about_ca_system_score_gemma":0.000017799235,"threshold_uncertainty_score":0.35950914},"labels":[],"label_agreement":null},{"id":"W2967684671","doi":"10.23919/ecc.2019.8796078","title":"Dynamic Nash Equilibrium Seeking for Higher-Order Integrators in Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Computer science; Leverage (statistics); Mathematical optimization; Convergence (economics); Lipschitz continuity; Monotonic function; Control theory (sociology); Mathematics; Artificial intelligence; Economics","score_opus":0.008271820713838248,"score_gpt":0.2376012867604629,"score_spread":0.22932946604662466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2967684671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033538476,0.00012994886,0.9585107,0.00062248815,0.0026027993,0.00085839623,0.0000047332906,0.00029110938,0.0034413482],"genre_scores_gemma":[0.9871592,0.0000011180373,0.00881448,0.00033529545,0.000048309124,0.000076146454,0.00001665653,0.000019701945,0.0035291107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982394,0.000067070534,0.00038817443,0.0005395299,0.00020670208,0.0005591134],"domain_scores_gemma":[0.99883145,0.00019972412,0.00011028506,0.0006676452,0.00010547229,0.00008543153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042848988,0.00020418005,0.00030475698,0.00013197781,0.000027721528,0.00022975949,0.0010254096,0.00012972056,0.000041533265],"category_scores_gemma":[0.000028605473,0.00017789236,0.00009714747,0.0006167545,0.00001631514,0.0005403887,0.0002205078,0.00016052739,0.00012343843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020298055,0.00082676724,0.124855205,0.00045150224,0.00044175127,0.00007672119,0.0012839207,0.16772115,0.028945867,0.57482564,0.017534297,0.082834214],"study_design_scores_gemma":[0.0011391062,0.000052697753,0.0029526788,0.000048956543,0.0000029938458,0.0000020469415,0.000032239706,0.98920256,0.00004176976,0.00029638846,0.005991499,0.00023704371],"about_ca_topic_score_codex":0.000098170596,"about_ca_topic_score_gemma":0.00011357967,"teacher_disagreement_score":0.95362073,"about_ca_system_score_codex":0.0001605831,"about_ca_system_score_gemma":0.00006113597,"threshold_uncertainty_score":0.725424},"labels":[],"label_agreement":null},{"id":"W2968301423","doi":"10.1109/icra.2019.8793639","title":"Coverage Control for Multiple Event Types with Heterogeneous Robots","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Robot; Computer science; Event (particle physics); Obstacle; Set (abstract data type); Benchmarking; Convergence (economics); Distributed computing; Mobile robot; Real-time computing; Artificial intelligence","score_opus":0.007767550542268234,"score_gpt":0.21270041168879558,"score_spread":0.20493286114652734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968301423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02341506,0.00008505826,0.9731632,0.00034056196,0.0004719837,0.0014834846,0.000037506325,0.00022528926,0.0007778667],"genre_scores_gemma":[0.99234664,0.000001037485,0.0053106192,0.00046749695,0.000050068757,0.00013531948,0.000011793733,0.000016681133,0.0016603259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998567,0.000048371683,0.00026878947,0.00045990376,0.0002656739,0.00039025556],"domain_scores_gemma":[0.9987154,0.00024136108,0.00012753833,0.0006706034,0.00013345333,0.00011166778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020062848,0.00018628637,0.00029148505,0.000047862894,0.000060241724,0.00016366392,0.00064346974,0.000058736565,0.00003317919],"category_scores_gemma":[0.00003294398,0.00013669778,0.000108146116,0.00011270814,0.000012139691,0.0002640445,0.00005897253,0.00005448569,0.00034802538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010454513,0.0009698993,0.094671614,0.00029029162,0.001377257,0.00011395777,0.00048810922,0.77323216,0.021199996,0.06554112,0.004748418,0.036321692],"study_design_scores_gemma":[0.0083629405,0.00053818844,0.0016447246,0.000031847445,0.000021410817,0.000037810532,0.000007868341,0.9728733,0.0027937468,0.00017161787,0.013133787,0.00038280257],"about_ca_topic_score_codex":0.00005178322,"about_ca_topic_score_gemma":0.000043277345,"teacher_disagreement_score":0.9689316,"about_ca_system_score_codex":0.000061587736,"about_ca_system_score_gemma":0.000057439578,"threshold_uncertainty_score":0.55743736},"labels":[],"label_agreement":null},{"id":"W2968484783","doi":"10.1109/icuas.2019.8798328","title":"Fault-Tolerant Adaptive Neural Control of Multi-UAVs Against Actuator Faults","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backstepping; Computer science; Actuator; Artificial neural network; Control theory (sociology); Fault tolerance; Nonlinear system; Lyapunov function; Adaptive control; Scheme (mathematics); Control engineering; Control (management); Artificial intelligence; Distributed computing; Engineering; Mathematics","score_opus":0.015783468504297064,"score_gpt":0.2310502157845201,"score_spread":0.21526674728022302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968484783","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25689718,0.00015132542,0.73651975,0.00052569865,0.0013599792,0.001553074,0.00011592902,0.00039388525,0.0024831784],"genre_scores_gemma":[0.99304307,0.0000021735011,0.005231317,0.000579478,0.000053205702,0.00004011435,0.000010146353,0.000020467038,0.0010200582],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972524,0.00019231968,0.0006827029,0.00068961724,0.0006006725,0.0005822618],"domain_scores_gemma":[0.9977106,0.0002571611,0.00036769194,0.001120563,0.0003268266,0.00021718495],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003529258,0.0003377805,0.0006552984,0.00013809711,0.00006127123,0.000085867505,0.0015078628,0.00013752945,0.000041354142],"category_scores_gemma":[0.000072432915,0.00027336943,0.0002533779,0.00033349692,0.00005521364,0.00069337257,0.00019454147,0.0002001583,0.00059140334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001719841,0.004979019,0.059594158,0.0005473194,0.0029751803,0.00048614372,0.0085705975,0.082546,0.43593836,0.1367915,0.0061083944,0.2597435],"study_design_scores_gemma":[0.0063539296,0.00019181462,0.004323547,0.000043532003,0.000013956101,0.000006952535,0.00020419063,0.98506445,0.002362699,0.000015148567,0.0010725842,0.00034718844],"about_ca_topic_score_codex":0.00016315856,"about_ca_topic_score_gemma":0.000023122671,"teacher_disagreement_score":0.90251845,"about_ca_system_score_codex":0.00008397375,"about_ca_system_score_gemma":0.00010121024,"threshold_uncertainty_score":0.99997187},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.008662269612981586,"score_gpt":0.20717557166168107,"score_spread":0.1985133020486995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968521751","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06888799,0.00022193324,0.92490757,0.00028280303,0.003055341,0.0020752712,0.00016593128,0.00039071724,0.000012420708],"genre_scores_gemma":[0.99848497,0.000008972858,0.00008802164,0.00011233633,0.00025785287,0.00036239828,0.00005126904,0.000039527178,0.0005946529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969217,0.0005858269,0.0006719008,0.0007548391,0.00036251903,0.0007032166],"domain_scores_gemma":[0.9971091,0.0017135416,0.00031720515,0.00047839945,0.0001492547,0.00023250522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064195227,0.0004083837,0.0007083119,0.00011186884,0.00057243044,0.00055476825,0.00046688758,0.00022405543,0.000008817962],"category_scores_gemma":[0.000030293613,0.00036652535,0.0002442009,0.00025501894,0.000046534642,0.00035745013,0.000005593528,0.0005381621,0.000046101082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036158587,0.00009132559,0.00026172245,0.000050668907,0.00014239454,0.0000073281635,0.000104636456,0.9936661,0.0012204322,0.00011131562,0.00012034377,0.0038621612],"study_design_scores_gemma":[0.006402505,0.00067929196,0.00021160449,0.00012846715,0.000050465012,0.000020202693,0.00010692205,0.988252,0.00007404852,0.0000025258669,0.0036693292,0.0004026401],"about_ca_topic_score_codex":0.00014718331,"about_ca_topic_score_gemma":0.000008970201,"teacher_disagreement_score":0.92959696,"about_ca_system_score_codex":0.0001045244,"about_ca_system_score_gemma":0.000027544638,"threshold_uncertainty_score":0.99987864},"labels":[],"label_agreement":null},{"id":"W2968935611","doi":"10.1109/icra.2019.8793555","title":"Robust Area Coverage with Connectivity Maintenance","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Swarm robotics; Robustness (evolution); Computer science; Robot; Swarm behaviour; Voronoi diagram; Robotics; Distributed computing; Artificial intelligence; Key (lock); Task (project management); Adversarial system; Engineering; Computer security","score_opus":0.016083437508982196,"score_gpt":0.1903938376708506,"score_spread":0.1743104001618684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968935611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10635539,0.000011965223,0.84188306,0.00055421295,0.00033869775,0.0003956094,0.000008119665,0.00029109756,0.05016182],"genre_scores_gemma":[0.99211234,0.0000012487554,0.0031921738,0.00039376746,0.000020689951,0.000020011848,0.0000033555002,0.0000088276065,0.0042475625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998615,0.0000569338,0.00015923951,0.00049819116,0.00030242855,0.00036818895],"domain_scores_gemma":[0.99868447,0.0001246369,0.0000976483,0.00087845954,0.0001149843,0.00009979567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024646398,0.00016296958,0.00023693731,0.000043233606,0.000049324874,0.00020046694,0.0007341206,0.00004723753,0.00015174782],"category_scores_gemma":[0.000029454483,0.00011493112,0.000050498402,0.00027293817,0.000021944956,0.0006210053,0.00013073695,0.000107962456,0.0006596583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012339768,0.00041325294,0.14415254,0.00008398172,0.00021792133,0.00021089191,0.00035134587,0.02919113,0.004070791,0.7948993,0.015347353,0.010938123],"study_design_scores_gemma":[0.0065959864,0.0005184919,0.077338904,0.00016477241,0.0000148132085,0.0001372218,0.00011067946,0.8922596,0.0019392687,0.0013933247,0.018438246,0.0010886949],"about_ca_topic_score_codex":0.00013041588,"about_ca_topic_score_gemma":0.000050112372,"teacher_disagreement_score":0.88575697,"about_ca_system_score_codex":0.00008228914,"about_ca_system_score_gemma":0.0000669391,"threshold_uncertainty_score":0.8478793},"labels":[],"label_agreement":null},{"id":"W2969776285","doi":"10.1109/tcds.2019.2932751","title":"Decentralized Energy-Aware Co-Planning of Motion and Communication Strategies for Networked Mobile Robots","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive and Developmental Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo","keywords":"Computer science; Robot; Software deployment; Mobile robot; Task (project management); Energy consumption; Motion planning; Distributed computing; Wireless; Motion (physics); Scheme (mathematics); Computer network; Real-time computing; Human–computer interaction; Artificial intelligence; Telecommunications; Engineering","score_opus":0.022997357876308012,"score_gpt":0.26915156412534486,"score_spread":0.24615420624903683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969776285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.068929605,0.000748182,0.9285034,0.0000077463255,0.0003123953,0.00096055033,0.00008877732,0.00006532761,0.00038403852],"genre_scores_gemma":[0.99842244,0.000111532354,0.0009189936,0.00002569426,0.000008509145,0.0003715183,0.00005229409,0.000011483256,0.00007751463],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987889,0.00013684829,0.00036789806,0.00031430877,0.00018236869,0.000209668],"domain_scores_gemma":[0.9991245,0.00033776904,0.00016734503,0.00014063636,0.00015218114,0.000077543016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021974443,0.00017551996,0.00029402116,0.00010641855,0.00019441951,0.0001744018,0.00015935654,0.000088018875,0.0000045331467],"category_scores_gemma":[0.0000014535789,0.00017194067,0.000046020792,0.00015474849,0.000049120554,0.00049841293,0.000004099578,0.00007156066,0.000005545565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019915053,0.0017165475,0.008222989,0.0028148454,0.002664314,0.000029228813,0.020300971,0.0906448,0.03459522,0.011475321,0.0005609076,0.82498336],"study_design_scores_gemma":[0.01833199,0.0011927456,0.0032231566,0.003961557,0.0002001692,0.00030976246,0.037011195,0.8980467,0.032762535,0.00049170404,0.002724036,0.0017444676],"about_ca_topic_score_codex":0.00013921208,"about_ca_topic_score_gemma":0.00001609794,"teacher_disagreement_score":0.92949283,"about_ca_system_score_codex":0.000058263755,"about_ca_system_score_gemma":0.00006144675,"threshold_uncertainty_score":0.7011537},"labels":[],"label_agreement":null},{"id":"W2970255209","doi":"10.1109/icinfa.2018.8812538","title":"Distributed Fixed-Time Control of Multi-agent Systems with Input Shaping","year":2018,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Directed graph; Computer science; Undirected graph; Control theory (sociology); Graph; Multi-agent system; Rest (music); Strongly connected component; Node (physics); Control (management); Topology (electrical circuits); Mathematics; Algorithm; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.02256798982454639,"score_gpt":0.23783166832838729,"score_spread":0.2152636785038409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970255209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071121254,0.00021877204,0.98918325,0.00026277767,0.0006691163,0.0011764644,0.00018446207,0.00048100756,0.00071205414],"genre_scores_gemma":[0.9938625,0.0000015873054,0.005323525,0.000108788816,0.00015965693,0.000116772,0.000034635217,0.000024073644,0.00036847882],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99691236,0.00023880416,0.00079625007,0.0007095719,0.0006809857,0.0006620245],"domain_scores_gemma":[0.99704283,0.00023710915,0.00047586794,0.0012580443,0.0007238708,0.0002622634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006559837,0.00036156515,0.0007046718,0.00016252638,0.00016028568,0.000275313,0.0014959228,0.00013148175,0.000045740624],"category_scores_gemma":[0.00011190239,0.00027292693,0.00012765468,0.0007044444,0.00019023308,0.00053508626,0.00020627884,0.00013289641,0.00048210853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020766784,0.008765203,0.1150492,0.0025091944,0.011303484,0.0010847476,0.007938954,0.05631905,0.41142863,0.28002456,0.05542235,0.04807798],"study_design_scores_gemma":[0.0044760588,0.00044835397,0.0032165502,0.00019372602,0.000047970345,0.00004571315,0.00005436943,0.9840472,0.0025252146,0.00000956464,0.0044912375,0.00044405938],"about_ca_topic_score_codex":0.00032618883,"about_ca_topic_score_gemma":0.00002660502,"teacher_disagreement_score":0.98675036,"about_ca_system_score_codex":0.00014019146,"about_ca_system_score_gemma":0.00013552408,"threshold_uncertainty_score":0.9999723},"labels":[],"label_agreement":null},{"id":"W2972640191","doi":"10.23919/acc.2019.8814987","title":"Adaptive Robust Control of Networked Multi-Manipulators with Time-Varying Delays","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Synchronizing; Computer science; Trajectory; Acceleration; Adaptive control; Parametric statistics; Controller (irrigation); Robust control; Synchronization (alternating current); Terminal sliding mode; Bounded function; Control (management); Sliding mode control; Control system; Mathematics; Engineering; Nonlinear system; Transmission (telecommunications); Artificial intelligence; Channel (broadcasting)","score_opus":0.01753478698842685,"score_gpt":0.202331534632753,"score_spread":0.18479674764432613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972640191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015422556,0.00009471657,0.9793326,0.000074959105,0.00026328384,0.0008588609,0.000010074377,0.00023775667,0.0037051793],"genre_scores_gemma":[0.968339,6.9680556e-7,0.030322773,0.00012598897,0.000036633628,0.000023338493,0.000005886353,0.000020630181,0.0011250229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980021,0.00012901801,0.0004395203,0.0005354434,0.0004247806,0.00046910802],"domain_scores_gemma":[0.9982972,0.000191481,0.00030353223,0.0008320651,0.00023286583,0.00014282574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034401633,0.00025963015,0.00050809,0.0001032653,0.000059481332,0.00008477316,0.0009410078,0.00009651879,0.00008027097],"category_scores_gemma":[0.000016642824,0.00019785254,0.0001096838,0.00043039877,0.000041821877,0.0005437123,0.00012534099,0.0001394763,0.00042762744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003121556,0.0003824213,0.031118458,0.000051204228,0.0007325982,0.00004625847,0.0004774226,0.9287974,0.0070297513,0.026502913,0.00075118936,0.0037982215],"study_design_scores_gemma":[0.004042294,0.00022228951,0.0020945838,0.00007162574,0.000024415798,0.000011373783,0.000036902977,0.9926902,0.00038665708,0.000012393496,0.00013766869,0.00026961093],"about_ca_topic_score_codex":0.00017800817,"about_ca_topic_score_gemma":0.00001721552,"teacher_disagreement_score":0.9529165,"about_ca_system_score_codex":0.00006982224,"about_ca_system_score_gemma":0.000084819505,"threshold_uncertainty_score":0.80681926},"labels":[],"label_agreement":null},{"id":"W2973056277","doi":"10.23919/acc.2019.8814904","title":"Distributed tracking of multiple under-actuated Lagrangian systems with uncertain parameters and actuator faults","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Control theory (sociology); Actuator; Convergence (economics); Bounded function; Observer (physics); Controller (irrigation); Lagrangian; Tracking error; Computer science; Tracking (education); Control engineering; Uniform boundedness; Engineering; Mathematics; Control (management); Artificial intelligence; Physics","score_opus":0.018707893326896614,"score_gpt":0.22396220645788656,"score_spread":0.20525431313098993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2973056277","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57779604,0.00006223172,0.4204425,0.00017480634,0.00023288376,0.00084126124,0.000097184056,0.00022039062,0.00013272728],"genre_scores_gemma":[0.9960901,0.000002928874,0.0036062228,0.00004822776,0.00001146106,0.000029659457,0.000070362184,0.000019769306,0.00012122551],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977523,0.00015001449,0.00050539634,0.0006211595,0.0004881239,0.00048299335],"domain_scores_gemma":[0.997999,0.000455655,0.00033932095,0.00079261983,0.00021050271,0.00020291653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034742834,0.0003057508,0.0005514341,0.00012959802,0.000070088674,0.00022334546,0.00068160216,0.00012482802,0.000006531587],"category_scores_gemma":[0.000071004746,0.0002276536,0.000074875206,0.00055924937,0.00007133484,0.00061144255,0.000107255226,0.00013440418,0.000032091255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001801376,0.0022991032,0.43382162,0.0032601904,0.0046728887,0.00034981142,0.0074219787,0.19002925,0.21572156,0.09584086,0.0018603457,0.042921007],"study_design_scores_gemma":[0.007863364,0.0006333289,0.03545277,0.0005026038,0.00006866912,0.000093825845,0.0019815217,0.9446706,0.0068932488,0.00007367683,0.0007836096,0.0009827388],"about_ca_topic_score_codex":0.0012051235,"about_ca_topic_score_gemma":0.00009934601,"teacher_disagreement_score":0.7546414,"about_ca_system_score_codex":0.00009563379,"about_ca_system_score_gemma":0.00008038778,"threshold_uncertainty_score":0.9283444},"labels":[],"label_agreement":null},{"id":"W2979727209","doi":"10.1109/tac.2019.2946205","title":"Positivity-Preserving Consensus of Homogeneous Multiagent Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multi-agent system; Homogeneous; Mathematics; Consensus; Property (philosophy); Contrast (vision); Mathematical optimization; Computer science; State space; State (computer science); Space (punctuation); Control theory (sociology); Algorithm; Artificial intelligence; Control (management); Combinatorics; Statistics","score_opus":0.011028287553050612,"score_gpt":0.22587282608606438,"score_spread":0.21484453853301377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2979727209","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10396836,0.00016223142,0.89023095,0.00032413757,0.0022876144,0.0018013763,0.00015404829,0.0004987575,0.00057251623],"genre_scores_gemma":[0.99785817,0.0000027841077,0.0013204822,0.00009437102,0.000025874204,0.00017097384,0.0000016471954,0.00002849415,0.000497177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968852,0.00047001778,0.0008738733,0.0005599682,0.00070382416,0.00050712936],"domain_scores_gemma":[0.9966184,0.0010395558,0.00040443172,0.0015294455,0.00022202077,0.00018617888],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005897987,0.00033682413,0.0007585573,0.0002969517,0.00013491495,0.0001713425,0.0010287181,0.00014486627,0.000083251434],"category_scores_gemma":[0.000027595348,0.0003222021,0.00031201818,0.00041067554,0.000050628056,0.00020815109,0.0000066108096,0.0001842942,0.00044724843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018241696,0.001784441,0.00029658002,0.001020408,0.0017483787,0.00018814797,0.0011442164,0.76843405,0.15516022,0.0025399034,0.00048731695,0.06701392],"study_design_scores_gemma":[0.003678838,0.0002512806,0.00039068118,0.00024000324,0.00008603464,0.000089879824,0.000078099394,0.98944443,0.005281634,0.000019472804,0.00013609923,0.00030354527],"about_ca_topic_score_codex":0.00034856828,"about_ca_topic_score_gemma":0.000027371965,"teacher_disagreement_score":0.89388984,"about_ca_system_score_codex":0.00016366394,"about_ca_system_score_gemma":0.00013622,"threshold_uncertainty_score":0.999923},"labels":[],"label_agreement":null},{"id":"W2980328257","doi":"10.1088/1742-6596/1334/1/012008","title":"Asymptotical rotating consensus algorithm with processing delay","year":2019,"lang":"en","type":"article","venue":"Journal of Physics Conference Series","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Laplacian matrix; Rotation (mathematics); Eigenvalues and eigenvectors; Algorithm; Laplace operator; Mathematics; Matrix (chemical analysis); Topology (electrical circuits); Logarithm; Geometry; Mathematical analysis; Physics; Combinatorics","score_opus":0.014434853592405074,"score_gpt":0.23313296632479777,"score_spread":0.2186981127323927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980328257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053071093,0.00006248029,0.9449058,0.0006007023,0.0003385992,0.0001602533,0.0000053406234,0.000045588724,0.00081010815],"genre_scores_gemma":[0.9044821,0.0000022829452,0.095175,0.00005154976,0.00016143429,0.0000025815534,0.0000010045719,0.000011803814,0.00011222745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982392,0.00009875819,0.00049533736,0.00023033297,0.0006160783,0.00032025957],"domain_scores_gemma":[0.9976412,0.00011118216,0.0007208165,0.00028613457,0.0011032133,0.00013741932],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033606577,0.00020197258,0.00042343105,0.000055299155,0.00009446948,0.0004992031,0.00068331667,0.000053778273,0.000008897596],"category_scores_gemma":[0.0000429597,0.00015108132,0.00008401312,0.00027420107,0.00009847746,0.0012016286,0.000088098095,0.0003251554,0.000028340488],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096276475,0.00016730568,0.0037011825,0.000120724304,0.00019529332,0.00023279368,0.0022115675,0.0013479884,0.006683117,0.1011174,0.00007708568,0.88404924],"study_design_scores_gemma":[0.00844762,0.004482632,0.008882821,0.0030101996,0.00021231126,0.004422346,0.0040665288,0.87314826,0.062787995,0.026242495,0.002263072,0.0020336895],"about_ca_topic_score_codex":0.0000053105077,"about_ca_topic_score_gemma":0.0000018705958,"teacher_disagreement_score":0.8820156,"about_ca_system_score_codex":0.000042090964,"about_ca_system_score_gemma":0.0006317633,"threshold_uncertainty_score":0.6160917},"labels":[],"label_agreement":null},{"id":"W2981001843","doi":"10.23919/chicc.2019.8866116","title":"Rotation-matrix-based attitude tracking and synchronization of multiple flexible spacecraft under directed graph","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Spacecraft; Control theory (sociology); Computer science; Attitude control; Rotation matrix; Tracking (education); Bounded function; Graph; Synchronization (alternating current); Quaternion; Observer (physics); Controller (irrigation); Control engineering; Engineering; Mathematics; Control (management); Artificial intelligence; Aerospace engineering","score_opus":0.011919823364255818,"score_gpt":0.24664636347198826,"score_spread":0.23472654010773245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981001843","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11116053,0.00013811623,0.8869656,0.00026633835,0.00022865892,0.00050174264,0.000008019924,0.00036425175,0.00036677634],"genre_scores_gemma":[0.98453057,0.0000030121778,0.015054269,0.000056821114,0.000014869172,0.000014348601,0.000024975585,0.00001195114,0.00028917013],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986873,0.00008851333,0.0003167144,0.00037177152,0.00031185892,0.00022382088],"domain_scores_gemma":[0.99879783,0.00027787534,0.00018648012,0.00043834615,0.00022463537,0.00007484871],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022662412,0.00014946322,0.00023908837,0.00017988212,0.000060746966,0.00013601682,0.00031840755,0.00007279303,0.00003778902],"category_scores_gemma":[0.000074845266,0.00013921276,0.00005871817,0.00058003096,0.000029165367,0.0005210493,0.000053470798,0.0000621545,0.00003895482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000683433,0.00056807714,0.6180032,0.00057739834,0.00028343566,0.00001135316,0.00071530015,0.21368898,0.096708305,0.057882313,0.0005515584,0.010941724],"study_design_scores_gemma":[0.0018594512,0.000054349544,0.05831422,0.00007712619,0.000012725753,0.0000029272048,0.000058795966,0.93250746,0.0065984232,0.00021708166,0.00009504564,0.00020237129],"about_ca_topic_score_codex":0.00018826396,"about_ca_topic_score_gemma":0.00008168446,"teacher_disagreement_score":0.87337005,"about_ca_system_score_codex":0.000051315794,"about_ca_system_score_gemma":0.000080804595,"threshold_uncertainty_score":0.5676932},"labels":[],"label_agreement":null},{"id":"W2983356121","doi":"10.1038/s41467-019-13281-4","title":"Behavioural plasticity and the transition to order in jackdaw flocks","year":2019,"lang":"en","type":"article","venue":"Nature Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Human Frontier Science Program","keywords":"Collective motion; Flock; Collective behavior; Mobbing; Order (exchange); Group behavior; Group (periodic table); Computer science; Social psychology; Physics; Ecology; Psychology; Artificial intelligence; Biology; Sociology; Business","score_opus":0.014071217007991358,"score_gpt":0.2628070330324266,"score_spread":0.24873581602443523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983356121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5418845,0.0041310075,0.2857373,0.15597421,0.0011907167,0.004296914,0.000119568846,0.00039223628,0.0062735756],"genre_scores_gemma":[0.9930082,0.000019261844,0.0059146998,0.00090378907,0.0000099351155,0.000073871575,0.000017711032,0.0000047148665,0.000047811063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990796,0.00023439983,0.0001913565,0.00018485128,0.00015931549,0.00015051542],"domain_scores_gemma":[0.99805516,0.00041969065,0.000047412756,0.0013132326,0.00011532881,0.000049198476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003271405,0.00009011645,0.00014356832,0.00007672409,0.0001269336,0.00011370072,0.0016816778,0.00012323215,0.000004348709],"category_scores_gemma":[0.00011338911,0.0000674824,0.000031669206,0.00050427974,0.0000601251,0.00020587545,0.00033140075,0.0005728401,0.00004976647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015177848,0.0005511409,0.03743636,0.000027954113,0.00008774582,0.000004378147,0.016284795,0.0023112805,0.0024022812,0.927646,0.003969272,0.009127044],"study_design_scores_gemma":[0.0077170976,0.000085269654,0.3598774,0.0001475513,0.00004544929,0.00003496342,0.0005398074,0.6120473,0.00015249883,0.0014843071,0.017297741,0.0005705884],"about_ca_topic_score_codex":0.00018254369,"about_ca_topic_score_gemma":0.0013660375,"teacher_disagreement_score":0.92616165,"about_ca_system_score_codex":0.000044480475,"about_ca_system_score_gemma":0.00003197248,"threshold_uncertainty_score":0.31250036},"labels":[],"label_agreement":null},{"id":"W2983399346","doi":"10.48550/arxiv.1911.05979","title":"Towards an $O(\\frac{1}{t})$ convergence rate for distributed dual averaging","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Smoothness; Convergence (economics); Rate of convergence; Bounded function; Dual (grammatical number); Mathematics; Computer science; Lasso (programming language); Mathematical optimization; Order (exchange); Applied mathematics; Algorithm; Key (lock); Mathematical analysis","score_opus":0.07221875020827936,"score_gpt":0.20858923450643801,"score_spread":0.13637048429815865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983399346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102361836,0.000053321848,0.8907126,0.00018890532,0.0033451228,0.0013874327,0.0009633007,0.0005931827,0.0003942895],"genre_scores_gemma":[0.99654824,0.00003810543,0.0012058995,0.00014476757,0.00020307391,0.000012902747,0.0007477075,0.00004448719,0.0010547994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956342,0.0004151819,0.0005130049,0.0023105408,0.00020810578,0.00091895246],"domain_scores_gemma":[0.995412,0.00023532515,0.00063370523,0.002678086,0.0006086679,0.00043219616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088727224,0.0006788876,0.000822743,0.00027965146,0.0002731147,0.0004805225,0.003530569,0.00050271564,0.000036087135],"category_scores_gemma":[0.00014015942,0.0008062819,0.0004687008,0.0006448585,0.000108255925,0.00113068,0.00205992,0.00064356555,0.00022965999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021783139,0.00037120178,0.0047097225,0.0005021384,0.0005897026,0.0005934758,0.00051673513,0.69753355,0.0005106348,0.29083836,0.0024661422,0.0011505369],"study_design_scores_gemma":[0.0019190629,0.0001153139,0.002327516,0.00012733914,0.00012318851,0.000007856625,0.0000982237,0.9799846,0.0003376703,0.0103633795,0.003622412,0.000973433],"about_ca_topic_score_codex":0.00034919244,"about_ca_topic_score_gemma":0.000033153054,"teacher_disagreement_score":0.89418644,"about_ca_system_score_codex":0.00056123245,"about_ca_system_score_gemma":0.000673457,"threshold_uncertainty_score":0.9994388},"labels":[],"label_agreement":null},{"id":"W2983959247","doi":"10.1109/mrs.2019.8901049","title":"Computational and Structural Advantages of Pairwise Flocking","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Flocking (texture); Flock; Pairwise comparison; Computer science; Swarm behaviour; Robustness (evolution); Artificial intelligence; Distributed computing; Biology; Ecology; Physics","score_opus":0.005841997265199025,"score_gpt":0.2283392088103693,"score_spread":0.22249721154517027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983959247","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6085871,0.00010328423,0.38920814,0.00020411132,0.0002810243,0.00018073987,0.000008286305,0.00008504506,0.0013422912],"genre_scores_gemma":[0.98457736,6.424787e-7,0.015178434,0.000051819326,0.000012887362,0.0000015162484,0.000004795657,0.0000029003977,0.00016965295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992832,0.00003080396,0.0001769946,0.00019362022,0.00019547071,0.00011992286],"domain_scores_gemma":[0.9995258,0.000099619036,0.0000752161,0.00019365578,0.00006387446,0.000041825235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010210426,0.00007380873,0.00013697134,0.000047404334,0.000025156773,0.000052473384,0.00026208287,0.000022928896,0.000028913444],"category_scores_gemma":[0.000011474371,0.00006110373,0.000028134007,0.00009410342,0.000018594934,0.0003072778,0.00011712273,0.000036202313,0.000022944092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022614935,0.00004789498,0.4136776,0.00020033948,0.00013709007,0.000013919295,0.0011575082,0.044122256,0.008580701,0.4689701,0.0006369922,0.062432993],"study_design_scores_gemma":[0.00071183115,0.000038829126,0.093041345,0.00001880293,0.0000026578355,0.000015302956,0.000055773187,0.903487,0.00037549617,0.0019092545,0.00023361851,0.00011008066],"about_ca_topic_score_codex":0.00002502696,"about_ca_topic_score_gemma":0.0000016800652,"teacher_disagreement_score":0.85936475,"about_ca_system_score_codex":0.000011913335,"about_ca_system_score_gemma":0.000020726166,"threshold_uncertainty_score":0.24917379},"labels":[],"label_agreement":null},{"id":"W2988823461","doi":"10.1109/mra.2019.2940413","title":"Planetary Exploration With Robot Teams: Implementing Higher Autonomy With Swarm Intelligence","year":2019,"lang":"en","type":"article","venue":"IEEE Robotics & Automation Magazine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Mars Exploration Program; Situation awareness; Artificial intelligence; Robot; Space exploration; Mission control center; Exploration of Mars; Swarm intelligence; Systems engineering; Human–computer interaction; Engineering; Machine learning; Aerospace engineering; Particle swarm optimization","score_opus":0.0156516254305569,"score_gpt":0.2339216617478083,"score_spread":0.2182700363172514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988823461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063251117,0.00003728238,0.98784316,0.0011870352,0.0007167324,0.0009869732,0.00001104158,0.0007959232,0.0020967547],"genre_scores_gemma":[0.86779004,0.000003127678,0.13037984,0.00017769187,0.00013943572,0.000065025655,0.00017230285,0.0000361217,0.0012364102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997268,0.000116432966,0.0006517322,0.00067723024,0.0006939874,0.00059259316],"domain_scores_gemma":[0.99802494,0.00011514686,0.0005194321,0.00092212413,0.00027573702,0.0001426035],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004355213,0.00036798944,0.000383592,0.00021396822,0.00014968334,0.00045776446,0.00077230536,0.000089927824,0.00006584864],"category_scores_gemma":[0.000008826228,0.0003013311,0.00005155658,0.0006697905,0.000039588995,0.0020397685,0.00009482569,0.00020530663,0.0014577127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003065793,0.0001120973,0.0048206165,0.00009831445,0.00012753237,0.000028756447,0.000518955,0.9713396,0.0022639986,0.0110904435,0.000572772,0.008996253],"study_design_scores_gemma":[0.0012015447,0.00043487115,0.010458412,0.00018906052,0.00005360097,0.000045729852,0.00008195034,0.9808848,0.0018210327,0.0002485788,0.00396025,0.00062018883],"about_ca_topic_score_codex":0.000039809565,"about_ca_topic_score_gemma":0.000060955623,"teacher_disagreement_score":0.8614649,"about_ca_system_score_codex":0.0002442579,"about_ca_system_score_gemma":0.00025262206,"threshold_uncertainty_score":0.99994385},"labels":[],"label_agreement":null},{"id":"W2988992172","doi":"10.48550/arxiv.1911.06519","title":"Safe Coverage of Compact Domains For Second Order Dynamical Systems","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Reachability; Bounded function; Collision avoidance; Domain (mathematical analysis); Controller (irrigation); Computer science; Pairwise comparison; Lyapunov function; Stability theory; Dynamical systems theory; Control theory (sociology); Topology (electrical circuits); Mathematical optimization; Mathematics; Collision; Applied mathematics; Mathematical analysis; Algorithm; Control (management); Physics; Nonlinear system","score_opus":0.04469253310768868,"score_gpt":0.19379604698199954,"score_spread":0.14910351387431087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2988992172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12640105,0.00008911351,0.8643059,0.00003952507,0.0021599755,0.00163079,0.0009113053,0.00015100796,0.004311297],"genre_scores_gemma":[0.9953924,0.00001684562,0.0004252725,0.000031972326,0.000081067985,0.0000033342662,0.00015794167,0.000031360403,0.0038598126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971499,0.00026303882,0.00054120395,0.0012941014,0.00019479169,0.0005569516],"domain_scores_gemma":[0.9959837,0.00045994442,0.0008023144,0.002039023,0.00049567997,0.00021934665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004613246,0.00047558444,0.0010166345,0.000295485,0.0000999855,0.00018993583,0.002676276,0.00047910787,0.000030704992],"category_scores_gemma":[0.00006479991,0.00052945537,0.00045216284,0.0004909264,0.00009894933,0.0003702987,0.00093973114,0.00045257047,0.00009768335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011349471,0.00021630393,0.0034446479,0.0010105293,0.0005507688,0.00008596985,0.00011057268,0.719626,0.00024695252,0.27304026,0.0014832097,0.000071311886],"study_design_scores_gemma":[0.002458275,0.00010855223,0.0012944591,0.00023757834,0.00010303433,0.0000073708816,0.000052753036,0.9883029,0.00004477358,0.0027168188,0.004096764,0.0005767124],"about_ca_topic_score_codex":0.0002598207,"about_ca_topic_score_gemma":0.000052256913,"teacher_disagreement_score":0.8689913,"about_ca_system_score_codex":0.0004932339,"about_ca_system_score_gemma":0.00042332368,"threshold_uncertainty_score":0.9997157},"labels":[],"label_agreement":null},{"id":"W2989843540","doi":"10.1016/j.ifacol.2019.11.244","title":"Cooperative State and Fault Estimation of Formation Flight of Satellites in Deep Space Subject to Unreliable Information","year":2019,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Supervisor; Observability; Observer (physics); Kalman filter; Control theory (sociology); Computer science; Process (computing); Fault (geology); Mathematics; Control (management); Artificial intelligence","score_opus":0.005082004919559709,"score_gpt":0.2207165543093883,"score_spread":0.2156345493898286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989843540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6681857,0.00008633314,0.33006415,0.00037888228,0.00012030888,0.00068894925,0.0000563656,0.000027150705,0.0003921481],"genre_scores_gemma":[0.87883353,0.000021421078,0.120874666,0.000072942596,0.000005816889,0.000014715728,0.00008290986,0.000004563643,0.000089454996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987098,0.00006874924,0.0005609721,0.0001709811,0.0002916509,0.00019787434],"domain_scores_gemma":[0.99898773,0.00013402705,0.00029343387,0.00027323948,0.00024998037,0.00006155793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000372788,0.00014364393,0.00029708244,0.0002468235,0.000025783222,0.000069534435,0.00024300067,0.00005728708,0.000009649987],"category_scores_gemma":[0.00015534506,0.00012931894,0.00003028519,0.0005706789,0.000020622409,0.0020984628,0.00007433104,0.00007365776,0.00007905866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031681932,0.00027775211,0.008704689,0.0010629107,0.00009275078,0.000003933621,0.046017192,0.6785718,0.12447373,0.011423784,0.000023986078,0.12903064],"study_design_scores_gemma":[0.0012012671,0.00021448506,0.006000977,0.00016549538,0.0000055952696,0.0000036307617,0.00047750666,0.95371157,0.037848275,0.0000654092,0.00014936342,0.00015645043],"about_ca_topic_score_codex":0.00018109442,"about_ca_topic_score_gemma":0.00009093832,"teacher_disagreement_score":0.27513975,"about_ca_system_score_codex":0.000075127835,"about_ca_system_score_gemma":0.00004891547,"threshold_uncertainty_score":0.5273473},"labels":[],"label_agreement":null},{"id":"W2990770091","doi":"10.1007/s11768-019-9076-7","title":"Distributed active fault tolerant control design against actuator faults for multiple mobile robots","year":2019,"lang":"en","type":"article","venue":"Control Theory and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Actuator; Robot; Fault tolerance; Mobile robot; Control theory (sociology); Fault (geology); Control engineering; Engineering; Control (management); Computer science; Kalman filter; Distributed computing; Artificial intelligence","score_opus":0.007061556746581477,"score_gpt":0.22052281680985128,"score_spread":0.2134612600632698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990770091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07867747,0.0005221034,0.9131618,0.0007801384,0.0005761653,0.0046281395,0.0007932075,0.00080898026,0.000051957042],"genre_scores_gemma":[0.9956672,0.0000111178715,0.0018680389,0.000413761,0.00006309212,0.0017756518,0.00005490085,0.000034716068,0.000111526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968069,0.00048372007,0.0005760356,0.0010226445,0.00022115659,0.00088952796],"domain_scores_gemma":[0.9951149,0.0028252678,0.00038352038,0.0011278325,0.00036648614,0.00018194526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011966577,0.00047608942,0.0009491058,0.00030156618,0.00026837102,0.00011822921,0.001315604,0.0005329909,0.0000095672285],"category_scores_gemma":[0.0009086348,0.00041508747,0.00017784045,0.00046328027,0.00021775218,0.00046606033,0.00015883241,0.0003502387,0.00008751967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057721464,0.00081335555,0.0019912312,0.00014427463,0.0017089344,0.00009662481,0.00046751276,0.014881583,0.23810796,0.48360637,0.00053402036,0.25187597],"study_design_scores_gemma":[0.057541907,0.002070732,0.0007129116,0.000156414,0.00021525387,0.000080604004,0.0008866753,0.85380286,0.01910443,0.04831458,0.015540765,0.0015728836],"about_ca_topic_score_codex":0.0000038451144,"about_ca_topic_score_gemma":0.0000026169619,"teacher_disagreement_score":0.91698974,"about_ca_system_score_codex":0.00011608021,"about_ca_system_score_gemma":0.00011101302,"threshold_uncertainty_score":0.99983007},"labels":[],"label_agreement":null},{"id":"W2991025517","doi":"10.1109/smc.2019.8914510","title":"Distributed Multi-Robot Formation Control Based on Two-Layer Nearest Neighbor Information(TNNI) Consensus","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mobile robot; Robot; Computer science; Convergence (economics); Swarm behaviour; Layer (electronics); k-nearest neighbors algorithm; Swarm robotics; Control (management); Swarm intelligence; Robot control; Distributed computing; Artificial intelligence; Machine learning","score_opus":0.0165636589252371,"score_gpt":0.241424275530636,"score_spread":0.2248606166053989,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991025517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004518305,0.0000100030165,0.9853086,0.0024702607,0.00097310427,0.0016446457,0.00036208364,0.0006644623,0.004048534],"genre_scores_gemma":[0.9892677,3.767125e-7,0.0072992947,0.0026952915,0.00004772863,0.00009656218,0.00039771546,0.00001429866,0.00018103162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711704,0.00021720953,0.0008786861,0.00040882218,0.00073788414,0.0006403476],"domain_scores_gemma":[0.99714243,0.0004584301,0.00044772122,0.0012291946,0.0004686006,0.00025359815],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005281205,0.00037527696,0.00043725988,0.00024959477,0.00018312402,0.00070034637,0.0009962078,0.00014666065,0.00012495318],"category_scores_gemma":[0.00023169669,0.00032175312,0.00017746084,0.0005540417,0.000040205992,0.0017678809,0.000099367724,0.0002393298,0.0041460693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000781041,0.0012823472,0.023813725,0.00035537782,0.00033288976,0.00006543075,0.00081169576,0.80896217,0.0091613205,0.10200078,0.029612938,0.02282031],"study_design_scores_gemma":[0.011200819,0.00014411408,0.010999503,0.000047430003,0.000014399171,0.0000090179365,0.000056258315,0.96918494,0.0006774699,0.000024449504,0.0072436444,0.00039796924],"about_ca_topic_score_codex":0.00016069553,"about_ca_topic_score_gemma":0.000027340693,"teacher_disagreement_score":0.9847494,"about_ca_system_score_codex":0.0002471809,"about_ca_system_score_gemma":0.0001625426,"threshold_uncertainty_score":0.99992347},"labels":[],"label_agreement":null},{"id":"W2992450457","doi":"10.1016/j.jfranklin.2019.11.077","title":"Adaptive output-feedback time-varying formation tracking control for multi-agent systems with switching directed networks","year":2019,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Computer science; Multi-agent system; Controller (irrigation); Nonlinear system; Tracking (education); Stability (learning theory); Control (management); Lyapunov function; Lyapunov stability; Artificial intelligence","score_opus":0.02609756996839924,"score_gpt":0.2357798248837969,"score_spread":0.20968225491539766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2992450457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01761925,0.00062751345,0.97369975,0.0002813301,0.0055782218,0.0019809736,0.000017757919,0.00009894937,0.00009626017],"genre_scores_gemma":[0.98746806,0.000007567805,0.011628562,0.00015408375,0.00046686525,0.00004663598,0.0000036104693,0.000025698191,0.0001989207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972582,0.0002526744,0.0010598234,0.00028845345,0.0006706537,0.00047020675],"domain_scores_gemma":[0.9965048,0.00025263097,0.0017850957,0.0005785872,0.0007335468,0.0001453527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014391354,0.00030828628,0.000669844,0.0001628995,0.0003252453,0.0005014495,0.0015213664,0.0001380979,0.0000016396407],"category_scores_gemma":[0.0001413851,0.00019453798,0.00034195825,0.0003859228,0.000034445136,0.002445063,0.00010162287,0.00047604265,0.000027401691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003895387,0.00014064528,0.0010008032,0.000093108334,0.00054463086,0.000021904625,0.0007094926,0.9877612,0.0014449845,0.00095178466,0.00049182127,0.00645006],"study_design_scores_gemma":[0.0066963034,0.00019877614,0.0012818002,0.0009840813,0.000121338024,0.00021418273,0.000059804035,0.98753583,0.00013084151,0.000018840365,0.002502,0.00025622302],"about_ca_topic_score_codex":0.000033782795,"about_ca_topic_score_gemma":0.000009411056,"teacher_disagreement_score":0.9698488,"about_ca_system_score_codex":0.00030967497,"about_ca_system_score_gemma":0.0001709418,"threshold_uncertainty_score":0.79330283},"labels":[],"label_agreement":null},{"id":"W2993302253","doi":"10.1016/j.jfranklin.2019.11.069","title":"Fixed-time consensus for uncertain multi-agent systems with actuator faults","year":2019,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Actuator; Consensus; Tracking (education); Singularity; Scheme (mathematics); Computer science; Multi-agent system; Upper and lower bounds; Euler's formula; Discrete time and continuous time; Control (management); Mathematics; Mathematical optimization; Artificial intelligence","score_opus":0.01878917869233907,"score_gpt":0.24362230808628346,"score_spread":0.2248331293939444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2993302253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3257166,0.00086453784,0.6466414,0.0033584752,0.018607117,0.0041720644,0.00015445422,0.00013259062,0.00035274928],"genre_scores_gemma":[0.9781147,0.000005858159,0.018817833,0.0002370267,0.0003877973,0.000046819216,0.0000031436728,0.000025575462,0.0023612042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737287,0.00018529862,0.0009005581,0.00033203722,0.0007686103,0.00044061473],"domain_scores_gemma":[0.99671334,0.0002829422,0.0012299959,0.0009395249,0.00063398626,0.0002001921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011314219,0.00029789345,0.0006402351,0.00014011982,0.00019659185,0.00023142017,0.002148243,0.00013016093,0.0000062834465],"category_scores_gemma":[0.0002517462,0.0001730083,0.000355311,0.00035221453,0.00009814507,0.0004925188,0.00015567864,0.0003229721,0.00014174343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028112612,0.0022822185,0.016046334,0.0015623736,0.0063208314,0.0009280461,0.0037756595,0.79382056,0.07000738,0.029661734,0.06012393,0.012659689],"study_design_scores_gemma":[0.019770607,0.0009787317,0.0026893162,0.0016997913,0.00030001125,0.00166822,0.00023689441,0.7380011,0.0023700946,0.00013067784,0.23119958,0.00095498096],"about_ca_topic_score_codex":0.00006398146,"about_ca_topic_score_gemma":0.0000130396575,"teacher_disagreement_score":0.6523981,"about_ca_system_score_codex":0.00024444686,"about_ca_system_score_gemma":0.00050434767,"threshold_uncertainty_score":0.7055074},"labels":[],"label_agreement":null},{"id":"W2996265823","doi":"10.1109/tac.2020.3044284","title":"Actuator Placement Under Structural Controllability Using Forward and Reverse Greedy Algorithms","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Army Research Office","keywords":"Controllability; Greedy algorithm; Cardinality (data modeling); Matroid; Submodular set function; Metric (unit); Constraint (computer-aided design); Actuator; Set (abstract data type)","score_opus":0.026416656059213672,"score_gpt":0.25977741763278067,"score_spread":0.233360761573567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996265823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05462822,0.00004489182,0.9385528,0.003982788,0.0007088002,0.0014138571,0.00014188574,0.0005065477,0.00002022693],"genre_scores_gemma":[0.98815763,0.0000018658833,0.009862359,0.0017703322,0.00006683596,0.000090858,0.0000017353836,0.000023516677,0.000024848796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971962,0.00029018454,0.0007031175,0.00071664987,0.00058686483,0.00050695695],"domain_scores_gemma":[0.9981505,0.0004022454,0.00024701236,0.0006331809,0.00013256216,0.0004344529],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003601539,0.000394166,0.0006707643,0.00011203154,0.00032045043,0.00029182408,0.0005383064,0.00012900974,0.00010092942],"category_scores_gemma":[0.00004065382,0.00035696878,0.00021738559,0.00035532532,0.0000930058,0.0005653555,0.0000070106785,0.00022790712,0.000053645497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013191265,0.0010823393,0.00038400176,0.001008362,0.005008516,0.00020736177,0.009213315,0.4886734,0.07013319,0.0034658827,0.00090764393,0.41859686],"study_design_scores_gemma":[0.0075783227,0.00022477069,0.0003693852,0.000037152106,0.00016683387,0.000027413977,0.00017978207,0.9903441,0.00050686667,0.0001334509,0.00009110093,0.0003408009],"about_ca_topic_score_codex":0.00009474477,"about_ca_topic_score_gemma":0.00001695586,"teacher_disagreement_score":0.93352944,"about_ca_system_score_codex":0.00025841277,"about_ca_system_score_gemma":0.000155648,"threshold_uncertainty_score":0.99988824},"labels":[],"label_agreement":null},{"id":"W2996663170","doi":"10.1177/1729881419892127","title":"A high-performance millirobot for swarm-behaviour studies: Swarm-topology estimation","year":2019,"lang":"en","type":"article","venue":"International Journal of Advanced Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Swarm behaviour; Swarm robotics; Computer science; Robot; USable; Topology (electrical circuits); Distributed computing; Real-time computing; Artificial intelligence; Mathematics","score_opus":0.019629380193168913,"score_gpt":0.30331148714351164,"score_spread":0.28368210695034274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996663170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21391755,0.0012095681,0.7578453,0.0010655918,0.02514183,0.0007162139,0.000013714856,0.000060906055,0.000029338054],"genre_scores_gemma":[0.95401406,0.00010578238,0.04469359,0.00010569333,0.00052803877,0.000059195823,0.000012637471,0.000024167068,0.00045685243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967819,0.00012337888,0.0013986825,0.0003854855,0.0009266615,0.00038387883],"domain_scores_gemma":[0.99531764,0.00049189245,0.0015948331,0.000435722,0.0020325466,0.00012734554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083073264,0.00028196519,0.00075075054,0.0003823869,0.00007925519,0.00018203763,0.0018139012,0.000108431384,0.0000034686404],"category_scores_gemma":[0.00032735444,0.0002399049,0.00020840343,0.00021437748,0.000047228103,0.0013335516,0.00014198532,0.00020876245,0.00007560362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011010917,0.0001027132,0.0010430693,0.00010693176,0.0004667564,0.00003467669,0.0003138606,0.97849,0.001711537,0.01427859,0.0002881096,0.0030536784],"study_design_scores_gemma":[0.013480631,0.001827538,0.005200972,0.0025580383,0.00015939759,0.0021159735,0.0014960148,0.96362686,0.0043749954,0.0017948713,0.0024181386,0.0009465718],"about_ca_topic_score_codex":0.000021777863,"about_ca_topic_score_gemma":0.0000017135724,"teacher_disagreement_score":0.7400965,"about_ca_system_score_codex":0.0005864399,"about_ca_system_score_gemma":0.00015547102,"threshold_uncertainty_score":0.97830373},"labels":[],"label_agreement":null},{"id":"W2996887178","doi":"10.1109/jsyst.2019.2959408","title":"Secure Consensus Control of Multiagent Cyber-Physical Systems With Uncertain Nonlinear Models","year":2019,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multi-agent system; Nonlinear system; Computer science; Consensus; Control theory (sociology); Set (abstract data type); Linearization; Divergence (linguistics); State (computer science); Control (management); Mathematical optimization; Mathematics; Artificial intelligence; Algorithm","score_opus":0.01627530896061368,"score_gpt":0.2358165414598815,"score_spread":0.21954123249926782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996887178","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24843623,0.0012660101,0.7410674,0.00020041593,0.0058328365,0.0020377978,0.0002030001,0.00016748383,0.00078884076],"genre_scores_gemma":[0.9976646,0.0000064163382,0.00087838876,0.000033943954,0.00086420384,0.000051843017,0.0000046465775,0.000050124396,0.00044587985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99467593,0.00085052726,0.0013380133,0.0006675999,0.0016234606,0.0008444409],"domain_scores_gemma":[0.99534434,0.00041363973,0.0014726608,0.0011737447,0.0011097916,0.00048584008],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013529388,0.0005216542,0.0013642972,0.00026741464,0.00017134112,0.0005448586,0.0014887551,0.00020178285,0.0000034820334],"category_scores_gemma":[0.000036392707,0.00038213443,0.00031651414,0.00046630483,0.00009528374,0.0005545084,0.00006422412,0.0006379869,0.00013835817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013689588,0.00026349357,0.0009590636,0.00029565243,0.0006013912,0.00032905664,0.0008644198,0.983672,0.0068516685,0.0050112996,0.0008360695,0.00017893937],"study_design_scores_gemma":[0.0057841605,0.00046445962,0.00006243491,0.00078839314,0.0000728674,0.0021778215,0.00040394644,0.98831,0.0001962344,0.000043457534,0.0012382374,0.00045798294],"about_ca_topic_score_codex":0.00047246605,"about_ca_topic_score_gemma":0.000007360644,"teacher_disagreement_score":0.74922836,"about_ca_system_score_codex":0.0003013863,"about_ca_system_score_gemma":0.00049384957,"threshold_uncertainty_score":0.999863},"labels":[],"label_agreement":null},{"id":"W2997924857","doi":"10.1109/tac.2019.2962092","title":"Event-Triggered Bipartite Consensus for Multiagent Systems: A Zeno-Free Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":86,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Zeno's paradoxes; Bipartite graph; Multi-agent system; Algebraic graph theory; Convergence (economics); Network topology; Lyapunov function; Computer science; Graph theory; Lyapunov stability; Consensus; Strongly connected component; Graph; Topology (electrical circuits); Mathematics; Control theory (sociology); Theoretical computer science; Control (management); Algorithm; Artificial intelligence; Combinatorics; Nonlinear system","score_opus":0.013811292788375725,"score_gpt":0.24649703281512045,"score_spread":0.23268574002674472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997924857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016097348,0.00017311214,0.97462213,0.0010224993,0.002401936,0.0040363166,0.00067853124,0.00087227335,0.00009585681],"genre_scores_gemma":[0.9941503,0.0000028158906,0.003081406,0.00024655374,0.000045306177,0.0011633215,0.000009606676,0.000037175792,0.0012635326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960548,0.00039850813,0.0011853832,0.0008775614,0.00073515094,0.00074857956],"domain_scores_gemma":[0.99521685,0.0013146738,0.00049579033,0.0023638592,0.00031552714,0.0002933172],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008816994,0.00045943318,0.0011212709,0.0007391181,0.00025436495,0.00041691161,0.0013566472,0.00018702573,0.00010750751],"category_scores_gemma":[0.00006517093,0.00042600383,0.00091639644,0.001268536,0.000045033168,0.00025675053,0.0000056809054,0.00016950881,0.00060334266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024863318,0.0013161668,0.00016785429,0.00052863744,0.009742204,0.000039663482,0.0008401146,0.9460477,0.008474168,0.0025977953,0.002293724,0.027703319],"study_design_scores_gemma":[0.009075025,0.00023280611,0.00027220647,0.00009417328,0.0011018951,0.000011187438,0.00008911276,0.9871443,0.00052865036,0.0000622433,0.0009469788,0.00044146006],"about_ca_topic_score_codex":0.00018749158,"about_ca_topic_score_gemma":0.000088120956,"teacher_disagreement_score":0.9780529,"about_ca_system_score_codex":0.00029013355,"about_ca_system_score_gemma":0.00017124668,"threshold_uncertainty_score":0.99981916},"labels":[],"label_agreement":null},{"id":"W2999262688","doi":"10.1109/tsmc.2019.2962973","title":"Adaptive Leaderless Consensus Control of Strict-Feedback Nonlinear Multiagent Systems With Unknown Control Directions","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backstepping; Control theory (sociology); Bounded function; Nonlinear system; Multi-agent system; Consensus; A priori and a posteriori; Computer science; Position (finance); Adaptive control; Control (management); Decentralised system; State (computer science); Mathematics; Artificial intelligence; Algorithm","score_opus":0.022657670042659492,"score_gpt":0.2106272823932751,"score_spread":0.1879696123506156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999262688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053906743,0.003954792,0.9804628,0.0003982543,0.003154501,0.0042248582,0.001221485,0.0005280075,0.00066463434],"genre_scores_gemma":[0.9977079,0.0000814045,0.00031825327,0.00008879061,0.0003083711,0.00056403666,0.000008476783,0.00009253202,0.0008302281],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934389,0.0013193198,0.0018193106,0.0013045297,0.0012546314,0.00086328614],"domain_scores_gemma":[0.9952444,0.0009097773,0.0010700267,0.0011231784,0.0008579766,0.0007946741],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007462823,0.000847601,0.001836427,0.0003573959,0.00039421112,0.00062598364,0.0009183955,0.000382609,0.000003605141],"category_scores_gemma":[0.000026366326,0.00073357834,0.0002798882,0.0009531001,0.00030022717,0.00026896232,0.000009758541,0.00059464376,0.00008460733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011175518,0.00094565476,0.00030880314,0.0017126271,0.0028854012,0.00020563604,0.0026842866,0.97584534,0.0028965105,0.008158979,0.0007724258,0.0024667853],"study_design_scores_gemma":[0.008519502,0.0013356095,0.00010336895,0.00081332296,0.00038457479,0.00028368435,0.0037258212,0.97770405,0.0002915988,0.0000010528904,0.0060214396,0.0008159597],"about_ca_topic_score_codex":0.0020246697,"about_ca_topic_score_gemma":0.00008003636,"teacher_disagreement_score":0.99231726,"about_ca_system_score_codex":0.00022802911,"about_ca_system_score_gemma":0.00023340953,"threshold_uncertainty_score":0.99951154},"labels":[],"label_agreement":null},{"id":"W2999569802","doi":"10.1515/pjbr-2019-0033","title":"Collective expression: how robotic swarms convey information with group motion","year":2019,"lang":"en","type":"article","venue":"Paladyn Journal of Behavioral Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Human–computer interaction; Swarm robotics; Robot; Artificial intelligence; Metric (unit); Swarm intelligence; Modality (human–computer interaction); Modalities; Motion (physics); Machine learning; Engineering","score_opus":0.01657520578754498,"score_gpt":0.23321795009696433,"score_spread":0.21664274430941935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999569802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064985916,0.000053392883,0.9323222,0.0004315884,0.001525623,0.00047476482,0.000005947868,0.000055010583,0.0001455504],"genre_scores_gemma":[0.97024435,0.000005064095,0.029406026,0.00005058063,0.00007972956,0.000006914419,0.000012339785,0.000014267073,0.00018075573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767023,0.000172574,0.0006449374,0.00020181411,0.000941074,0.0003693677],"domain_scores_gemma":[0.9971901,0.000077053584,0.0011809056,0.00046361086,0.00084818405,0.00024014748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046851303,0.00026021517,0.0005067013,0.000271434,0.00010788104,0.00052291667,0.0008277134,0.00012938304,0.00001305277],"category_scores_gemma":[0.00003232116,0.00019848754,0.0001477372,0.0005339143,0.00004401993,0.0034132234,0.000106717554,0.00039452093,0.000061358114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007093067,0.001982507,0.2397608,0.00029746702,0.00036454995,0.00034824316,0.012765457,0.686505,0.02153143,0.0069715157,0.0035296164,0.025234105],"study_design_scores_gemma":[0.043259263,0.018445162,0.27533183,0.003746806,0.0012877396,0.004690911,0.009177927,0.6204986,0.014913048,0.0013808835,0.0026841618,0.0045837048],"about_ca_topic_score_codex":0.000009183294,"about_ca_topic_score_gemma":0.0000035677158,"teacher_disagreement_score":0.9052584,"about_ca_system_score_codex":0.00040285639,"about_ca_system_score_gemma":0.00028856998,"threshold_uncertainty_score":0.80940866},"labels":[],"label_agreement":null},{"id":"W3001438486","doi":"10.1155/2020/2676105","title":"Research on Cooperative Control of the Hydraulic System of Multiple Intelligent Vehicles Combined Transportation","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hebei Provincial Key Research Projects; Anhui Provincial Department of Education; National Natural Science Foundation of China","keywords":"Synchronization (alternating current); PID controller; Controller (irrigation); Control system; Process (computing); Engineering; Automotive engineering; Control theory (sociology); Stability (learning theory); Control engineering; Control (management); Computer science; Simulation","score_opus":0.03340011116696416,"score_gpt":0.2877902714339358,"score_spread":0.25439016026697164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3001438486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6267869,0.00014161968,0.3708366,0.0011026589,0.00035651555,0.00064037024,0.000092856135,0.00002083643,0.000021667684],"genre_scores_gemma":[0.99889666,0.000017864313,0.00093079114,0.0000677484,0.000046209116,0.000013007016,0.000012070323,0.000012121119,0.000003533324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99689156,0.00033677288,0.0012978934,0.00021767999,0.0010568283,0.00019926108],"domain_scores_gemma":[0.9966795,0.00044635186,0.0011212749,0.00025927086,0.00137254,0.000121075274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070651347,0.00015331505,0.00049292337,0.00014627312,0.00008486422,0.000021876549,0.00074061897,0.000070605034,0.0000019712024],"category_scores_gemma":[0.00010698205,0.00011111031,0.00023392503,0.0007864842,0.00008467326,0.0004699007,0.000002994615,0.0003440716,0.0000022721997],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023180912,0.00033481643,0.0059268167,0.00042391705,0.00022830623,0.000033674678,0.010750985,0.8261554,0.12901045,0.021088837,0.000049129114,0.0036795507],"study_design_scores_gemma":[0.018494366,0.0051901434,0.4820988,0.0020801423,0.00020778089,0.0000068515383,0.011778426,0.1013719,0.3774706,0.0002802725,0.0005861611,0.00043456437],"about_ca_topic_score_codex":0.000023824607,"about_ca_topic_score_gemma":0.000041444127,"teacher_disagreement_score":0.72478354,"about_ca_system_score_codex":0.00008752634,"about_ca_system_score_gemma":0.00015615302,"threshold_uncertainty_score":0.4530947},"labels":[],"label_agreement":null},{"id":"W3002420931","doi":"10.1109/robio49542.2019.8961431","title":"Realization of Consensus with Collision and Obstacle Avoidance in an Unknown Environment for Multiple Robots","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mobile robot; Collision avoidance; Robot; Rendezvous; Fuzzy logic; Obstacle avoidance; Computer science; Realization (probability); Control engineering; Fuzzy control system; Controller (irrigation); Robot control; Collision; Distributed computing; Artificial intelligence; Engineering; Mathematics","score_opus":0.010989851726277746,"score_gpt":0.2133307615955263,"score_spread":0.20234090986924855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3002420931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4445279,0.000039477036,0.5544211,0.00006708106,0.000048482576,0.000749214,0.000014858439,0.000024138013,0.00010770875],"genre_scores_gemma":[0.97828275,0.0000039598644,0.021401538,0.00002264621,0.0000049200685,0.00003110365,0.000018008663,0.00000627945,0.00022881993],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906486,0.000057082976,0.0002500595,0.00031564775,0.00015945199,0.00015290473],"domain_scores_gemma":[0.9992489,0.0001577541,0.00013049369,0.00036471194,0.00004623365,0.000051868734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022541381,0.00009193632,0.0001759923,0.0000496726,0.000025074916,0.000036512192,0.0001855343,0.000041502954,0.0000023309656],"category_scores_gemma":[0.00002522102,0.0000750418,0.000013888626,0.000110168156,0.00002565613,0.00019135901,0.00004504513,0.000027111077,0.0000050054405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005318517,0.00081340404,0.44003823,0.0003028271,0.000051282732,0.000011510534,0.0016824006,0.355361,0.057717055,0.126877,0.00033798258,0.016275425],"study_design_scores_gemma":[0.0037440287,0.00040231444,0.04621017,0.00006162779,0.000004068175,0.00000407169,0.000101897094,0.9436977,0.004551415,0.00013958485,0.00091825513,0.00016486927],"about_ca_topic_score_codex":0.00016871362,"about_ca_topic_score_gemma":0.00022427234,"teacher_disagreement_score":0.5883367,"about_ca_system_score_codex":0.00004396869,"about_ca_system_score_gemma":0.000024111027,"threshold_uncertainty_score":0.3060116},"labels":[],"label_agreement":null},{"id":"W3003430042","doi":"10.1016/j.automatica.2020.108834","title":"A unitary distributed subgradient method for multi-agent optimization with different coupling sources","year":2020,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Unitary state; Coupling (piping); Multi-agent system; Mathematical optimization; Computer science; Mathematics; Distributed computing; Artificial intelligence; Engineering; Mechanical engineering","score_opus":0.037732034239152265,"score_gpt":0.2709853742062979,"score_spread":0.23325333996714565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003430042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008763111,0.0001038837,0.98587185,0.002882573,0.00015692723,0.0012523882,0.00012747597,0.0008297205,0.000012073388],"genre_scores_gemma":[0.53578186,0.0000024439767,0.46340147,0.00030160754,0.00005094213,0.00023540323,0.00018734434,0.000025793897,0.000013142462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978867,0.000104256804,0.0005130459,0.0006059019,0.00040470806,0.0004853447],"domain_scores_gemma":[0.99838704,0.00031701787,0.00026886773,0.00051640783,0.0001834299,0.00032725857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026842902,0.00031770903,0.00047014508,0.000069946575,0.00022303438,0.0002761545,0.0008396001,0.000078154626,0.000010531996],"category_scores_gemma":[0.00019232775,0.00024479235,0.00012423952,0.0004643605,0.00003530847,0.00028046744,0.0001691148,0.000118703516,0.000015374471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008730429,0.000503443,0.001412971,0.00039641664,0.0004709194,0.000037882823,0.0037158993,0.97679675,0.0007178743,0.011315589,0.0010139149,0.0035310101],"study_design_scores_gemma":[0.001972183,0.00025317003,0.0011260766,0.000070991446,0.000077454446,0.000007058214,0.00015212804,0.99474645,0.00061866577,0.000030113613,0.0006289973,0.00031672948],"about_ca_topic_score_codex":0.000023848155,"about_ca_topic_score_gemma":0.000007016171,"teacher_disagreement_score":0.5270188,"about_ca_system_score_codex":0.00010880107,"about_ca_system_score_gemma":0.00006525933,"threshold_uncertainty_score":0.9982342},"labels":[],"label_agreement":null},{"id":"W3004068726","doi":"10.1109/tsmc.2020.2965074","title":"RQ-CEASE: A Resilient Quantized Collaborative Event-Triggered Average-Consensus Sampled-Data Framework Under Denial of Service Attack","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Denial-of-service attack; Resilience (materials science); Computer science; Event (particle physics); State (computer science); Algorithm","score_opus":0.05760540575500644,"score_gpt":0.28788788775308644,"score_spread":0.23028248199808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004068726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036419086,0.0021275426,0.95133924,0.0018390592,0.0033250174,0.0026787831,0.0017771245,0.00033942753,0.00015469072],"genre_scores_gemma":[0.9978459,0.0000642556,0.0010047484,0.00029364685,0.00023480364,0.00015808512,0.00003742313,0.0000620781,0.00029906924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99396396,0.0010731887,0.0016958871,0.0014093487,0.0012012495,0.0006563685],"domain_scores_gemma":[0.9948834,0.0008167321,0.0008745109,0.0020971494,0.0007257674,0.0006024059],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007909335,0.0006274165,0.0012700654,0.00023290243,0.00031072836,0.00063822436,0.0017478325,0.00040831443,0.0000114299555],"category_scores_gemma":[0.000058291596,0.0006061082,0.00016595339,0.0015550912,0.00011947234,0.00029342808,0.000045804103,0.00050261023,0.00014118178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020489313,0.0017796827,0.0003520895,0.005544719,0.0036339483,0.00031578782,0.013862573,0.911504,0.009663188,0.03584464,0.013620237,0.00183025],"study_design_scores_gemma":[0.0046468386,0.0005159532,0.000115909774,0.0012797173,0.00023871163,0.00010390704,0.003224776,0.98253685,0.0007356559,0.000054214255,0.0056207962,0.00092667923],"about_ca_topic_score_codex":0.0011735809,"about_ca_topic_score_gemma":0.00021148761,"teacher_disagreement_score":0.9614268,"about_ca_system_score_codex":0.00015808667,"about_ca_system_score_gemma":0.0003589223,"threshold_uncertainty_score":0.99963903},"labels":[],"label_agreement":null},{"id":"W3004075126","doi":"10.1109/iros40897.2019.8968265","title":"Ergodic Flocking","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Flocking (texture); Ergodicity; Ergodic theory; Computer science; Robotics; Artificial intelligence; Robot; Mobile robot; Distributed computing; Mathematics","score_opus":0.004517793045706303,"score_gpt":0.1884267328673554,"score_spread":0.1839089398216491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004075126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03862547,0.00006611807,0.8798496,0.0006263693,0.0012495787,0.00022854251,0.0000010223964,0.00046975786,0.07888351],"genre_scores_gemma":[0.99135536,5.941284e-7,0.0034314964,0.00030556443,0.00004133226,0.000006155616,0.0000013481363,0.0000044317403,0.004853747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911994,0.000030702617,0.00014392946,0.00026382346,0.00021527224,0.00022632185],"domain_scores_gemma":[0.99921876,0.000043143056,0.00003969163,0.0005995152,0.000036791316,0.00006210926],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016817142,0.000079577825,0.00011376997,0.000048109203,0.00003051194,0.00014911372,0.00075458083,0.000034177425,0.00013303696],"category_scores_gemma":[0.000013749035,0.00006692803,0.000049359194,0.0001926842,0.000005431669,0.00033564607,0.00014708357,0.000055736207,0.0044353795],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005601939,0.00009944059,0.030615853,0.000039850558,0.0000702173,0.000035347315,0.00039731248,0.00086419994,0.02317299,0.880052,0.0141128795,0.050534364],"study_design_scores_gemma":[0.0024199137,0.00011797008,0.020681227,0.000064865155,0.000007637207,0.00004892167,0.00008722689,0.80375576,0.0056291055,0.0013476667,0.16512011,0.00071958266],"about_ca_topic_score_codex":0.000037090966,"about_ca_topic_score_gemma":0.0000036312383,"teacher_disagreement_score":0.9527299,"about_ca_system_score_codex":0.00003215878,"about_ca_system_score_gemma":0.000027967446,"threshold_uncertainty_score":0.9963398},"labels":[],"label_agreement":null},{"id":"W3005084212","doi":"","title":"Acoustic formation control for nonholonomic mobile robots.","year":2009,"lang":"en","type":"article","venue":"oURspace (University of Regina)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mobile robot; Nonholonomic system; Control (management); Robot; Computer science; Acoustics; Artificial intelligence; Physics","score_opus":0.009443428237711599,"score_gpt":0.2018773285592903,"score_spread":0.1924339003215787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005084212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062202937,0.000068285924,0.8221903,0.17064248,0.0001305114,0.00053168525,0.000023336857,0.00010755509,0.00008555198],"genre_scores_gemma":[0.9819872,0.000013047568,0.014502864,0.00008109383,0.00003286982,0.0000020800444,0.000013255472,0.0000051357383,0.0033624745],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992669,0.00004323024,0.000021348756,0.00024812206,0.00015306502,0.00026731854],"domain_scores_gemma":[0.99901825,0.000072241164,0.00024159419,0.00042757133,0.00014853921,0.00009179878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021343706,0.000116169285,0.0002509882,0.00012410246,0.00015384363,0.000042091167,0.0007294007,0.00007878411,8.7132605e-7],"category_scores_gemma":[0.000019042061,0.00014574069,0.00012174578,0.00015513762,0.00003748707,0.0008649376,0.000037043465,0.000064279484,0.000039625647],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027935705,0.00020386436,0.00018440704,0.0001529795,0.00015700159,0.000057996756,0.0014197379,0.10598916,0.025552806,0.03201244,0.7631777,0.070812546],"study_design_scores_gemma":[0.0046323566,0.0005676445,0.00079820334,0.0000495503,0.0000622726,0.000018313147,0.0010872392,0.55264705,0.00021696827,0.000052692973,0.4395804,0.00028728388],"about_ca_topic_score_codex":0.0000038751405,"about_ca_topic_score_gemma":0.000017900504,"teacher_disagreement_score":0.9757669,"about_ca_system_score_codex":0.00013174092,"about_ca_system_score_gemma":0.00005867855,"threshold_uncertainty_score":0.59431326},"labels":[],"label_agreement":null},{"id":"W3005230555","doi":"10.1109/tsmc.2019.2962827","title":"Event-Triggered Control for a Class of Nonlinear Multiagent Systems With Directed Graph","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Aperiodic graph; Multi-agent system; Nonlinear system; Bounded function; Computer science; Consensus; Control theory (sociology); Class (philosophy); Graph; Directed graph; Event (particle physics); Control (management); Algorithm; Mathematics; Theoretical computer science; Artificial intelligence","score_opus":0.017044372052807594,"score_gpt":0.22088285051776835,"score_spread":0.20383847846496075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005230555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006852701,0.0018786286,0.9813561,0.00022346852,0.0026030438,0.0053304248,0.0010467941,0.00056530966,0.00014354422],"genre_scores_gemma":[0.99740523,0.000045869747,0.00051085866,0.00007154268,0.00021175967,0.0011535012,0.000018261353,0.00008290386,0.00050006923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950246,0.00059504225,0.0015986955,0.0010997915,0.0009702966,0.00071157806],"domain_scores_gemma":[0.99637145,0.00048032278,0.0008970447,0.00097562827,0.00067930575,0.0005962398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006367845,0.0006591754,0.0014477605,0.0003107919,0.00026598948,0.00055167323,0.0008752472,0.0003089751,0.0000015740882],"category_scores_gemma":[0.00002003329,0.00055789546,0.00030458393,0.00077431335,0.00012622532,0.00028937784,0.000007316278,0.00030694623,0.000024417364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019376824,0.0017952226,0.00051321887,0.009328027,0.0046656085,0.00014610477,0.0047691558,0.93915457,0.018462803,0.01331068,0.0025859042,0.0033310312],"study_design_scores_gemma":[0.007047086,0.0012153971,0.000046582205,0.00081515824,0.00025198012,0.00007902504,0.0009226077,0.9840422,0.00074111036,0.0000028961333,0.004184882,0.00065104244],"about_ca_topic_score_codex":0.0008288865,"about_ca_topic_score_gemma":0.0000316776,"teacher_disagreement_score":0.99055254,"about_ca_system_score_codex":0.00013030933,"about_ca_system_score_gemma":0.00014748149,"threshold_uncertainty_score":0.99968725},"labels":[],"label_agreement":null},{"id":"W3005838681","doi":"10.1016/j.asoc.2020.106156","title":"A novel foraging algorithm for swarm robotics based on virtual pheromones and neural network","year":2020,"lang":"en","type":"article","venue":"Applied Soft Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Swarm robotics; Foraging; Swarm behaviour; Computer science; Artificial intelligence; Artificial neural network; Robotics; Pheromone; Scalability; Robot; Key (lock); Machine learning; Ecology","score_opus":0.02371398715057542,"score_gpt":0.2324431386205224,"score_spread":0.20872915146994697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005838681","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001319713,0.000039415503,0.99570924,0.0011729487,0.00045299664,0.00071286166,0.000011867912,0.0004922851,0.00008866003],"genre_scores_gemma":[0.6726225,1.5720407e-7,0.3245776,0.0022790893,0.00045743596,0.00002052679,0.000014647665,0.0000253197,0.000002697922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978789,0.000033239477,0.0004132223,0.00073472544,0.00031305876,0.0006268225],"domain_scores_gemma":[0.9983741,0.0007781526,0.00022405825,0.0003302046,0.00006643559,0.00022704841],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037760282,0.00030148833,0.00039809395,0.00004130474,0.0003642521,0.00035195518,0.0006642307,0.00008441155,4.0189042e-7],"category_scores_gemma":[0.00005110332,0.00031353912,0.00009151435,0.00036959874,0.0000376966,0.000114270784,0.00030339652,0.00021210189,0.0000065670715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019525385,0.00004205709,0.000047225432,0.000024850078,0.00002730822,0.0000048699762,0.000309519,0.78936076,0.00044302156,0.008753548,0.00023656027,0.20073077],"study_design_scores_gemma":[0.0020677627,0.00014442047,0.00009084751,0.00003770847,0.000016794018,0.0000044692515,0.00006181959,0.9967382,0.000115486044,0.000114733986,0.0002857655,0.0003219719],"about_ca_topic_score_codex":0.000006613626,"about_ca_topic_score_gemma":7.494085e-7,"teacher_disagreement_score":0.6713028,"about_ca_system_score_codex":0.000042782558,"about_ca_system_score_gemma":0.00004535027,"threshold_uncertainty_score":0.9999317},"labels":[],"label_agreement":null},{"id":"W3005908894","doi":"10.1109/tcyb.2020.2964430","title":"Adaptive Event-Triggered Control for Unknown Second-Order Nonlinear Multiagent Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"China Scholarship Council; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Nonlinear system; Controller (irrigation); Multi-agent system; Bounded function; Computer science; Consensus; Adaptive control; Event (particle physics); Control (management); Zeno's paradoxes; Tracking (education); Control engineering; Mathematics; Engineering; Artificial intelligence","score_opus":0.027902315791904917,"score_gpt":0.24634298323978798,"score_spread":0.21844066744788307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3005908894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007956915,0.0002139542,0.9918286,0.0011374542,0.00225572,0.0022463652,0.00094426546,0.00040685732,0.00017109724],"genre_scores_gemma":[0.9853826,0.000012914967,0.012061457,0.00085081457,0.00022654489,0.00046705455,0.00001380933,0.000053760778,0.0009310245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709386,0.00020384353,0.00075558265,0.0008139094,0.00052760704,0.0006051978],"domain_scores_gemma":[0.9976976,0.00044988003,0.00026330422,0.00068336324,0.00047144943,0.00043439778],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025530718,0.00042309213,0.00056843844,0.00011875685,0.0002376454,0.00026222036,0.0009424968,0.00021632058,0.000042003783],"category_scores_gemma":[0.00003194382,0.0004207617,0.00032470818,0.00052825286,0.000057946818,0.00028131128,0.0000049824002,0.00035249072,0.00025845948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00066564203,0.0014086337,0.000012945459,0.00029358367,0.001346866,0.00006344512,0.0024666425,0.94060284,0.007831496,0.0062993066,0.0043286784,0.034679893],"study_design_scores_gemma":[0.0049080024,0.000608733,0.000015066853,0.000050096736,0.000103353035,0.000007416303,0.00011411274,0.97243816,0.0041946643,0.000022636084,0.017095344,0.0004424438],"about_ca_topic_score_codex":0.000053626816,"about_ca_topic_score_gemma":0.000053745214,"teacher_disagreement_score":0.98458695,"about_ca_system_score_codex":0.00016037763,"about_ca_system_score_gemma":0.0001881716,"threshold_uncertainty_score":0.9998244},"labels":[],"label_agreement":null},{"id":"W3006481858","doi":"10.1016/j.ast.2020.105769","title":"Continuous constrained attitude regulation of multiple spacecraft on SO(3)","year":2020,"lang":"en","type":"article","venue":"Aerospace Science and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Spacecraft; Attitude control; Observer (physics); Control theory (sociology); Angular velocity; Function (biology); Modal; Control (management); Controller (irrigation); Computer science; Engineering; Control engineering; Physics; Aerospace engineering; Artificial intelligence","score_opus":0.011980717200993913,"score_gpt":0.22510947675842988,"score_spread":0.21312875955743596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006481858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70542294,0.0002919081,0.18494007,0.10548391,0.00045061123,0.0010060569,0.00002268274,0.0010311502,0.001350652],"genre_scores_gemma":[0.99447703,0.00000632933,0.0050573805,0.0003820658,0.000016663567,0.000013547188,0.0000010405453,0.0000051837796,0.000040749816],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99828076,0.000024035304,0.00024122676,0.00061515963,0.00046354684,0.00037529034],"domain_scores_gemma":[0.99872243,0.000080407975,0.00020220596,0.0005216154,0.00033611635,0.00013724041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036858092,0.00014942822,0.00028815382,0.00023363375,0.00020837452,0.00011900959,0.0010170538,0.00012274837,0.0000034747873],"category_scores_gemma":[0.00089474424,0.00013605045,0.000028603105,0.0019464665,0.0014733563,0.00037710665,0.0003084802,0.00014626766,0.000030118032],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016661594,0.00007221806,0.02387366,0.000021492566,0.000016245587,0.000012748063,0.00056652375,0.000071404625,0.6910483,0.2651633,0.0007489622,0.018388458],"study_design_scores_gemma":[0.0066976394,0.0027164756,0.049385935,0.00019768227,0.00003704624,0.00010383433,0.0016608627,0.35046232,0.56833565,0.0042552566,0.014966497,0.0011808027],"about_ca_topic_score_codex":0.00002404345,"about_ca_topic_score_gemma":0.000013088833,"teacher_disagreement_score":0.3503909,"about_ca_system_score_codex":0.000037560843,"about_ca_system_score_gemma":0.00019879482,"threshold_uncertainty_score":0.55479765},"labels":[],"label_agreement":null},{"id":"W3006834986","doi":"10.1109/tsmc.2020.2971850","title":"Pose Synchronization of Multiple Networked Manipulators Using Nonsingular Terminal Sliding Mode Control","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Synchronization (alternating current); Cartesian coordinate system; Computer science; Tracking error; Bounded function; Invertible matrix; Nonlinear system; Terminal (telecommunication); Terminal sliding mode; Tracking (education); Sliding mode control; Control (management); Mathematics; Channel (broadcasting); Artificial intelligence","score_opus":0.02579228337555823,"score_gpt":0.2320052903647815,"score_spread":0.2062130069892233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3006834986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05536953,0.00068475294,0.9392596,0.0000474632,0.0029183535,0.0013031553,0.00010099434,0.00023284716,0.00008329066],"genre_scores_gemma":[0.99886936,0.000015256275,0.00053883437,0.000047139965,0.00034173994,0.000051136063,0.0000060439115,0.000054444332,0.00007604395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964696,0.0004707932,0.0011534197,0.00073355,0.00066453504,0.0005080732],"domain_scores_gemma":[0.99788636,0.00019496026,0.0005996155,0.00064138765,0.0003135826,0.0003641188],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039012267,0.00043752033,0.000835767,0.00021966199,0.00027910288,0.00043210282,0.0005606909,0.00023822505,0.0000021572644],"category_scores_gemma":[0.00001972469,0.0004438875,0.0001710447,0.0005501052,0.00006316417,0.00037303037,0.000009132201,0.00025037213,0.000015769856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000726352,0.00013121332,0.0006048434,0.00065078883,0.00028311202,0.00005053529,0.0011556424,0.98413,0.010214505,0.0016191462,0.00008484536,0.0010027227],"study_design_scores_gemma":[0.0019869055,0.00019442874,0.00005606419,0.00055851537,0.00012576448,0.00012865657,0.00039671684,0.9951425,0.0007194506,0.000004195955,0.00028245713,0.00040429653],"about_ca_topic_score_codex":0.00091761857,"about_ca_topic_score_gemma":0.000017251277,"teacher_disagreement_score":0.9434998,"about_ca_system_score_codex":0.00017684768,"about_ca_system_score_gemma":0.000089574336,"threshold_uncertainty_score":0.9998013},"labels":[],"label_agreement":null},{"id":"W3007439752","doi":"","title":"VIRTUAL REALITY MODELING, ANALYSIS AND SIMULATION OF FORMATION FLYING OF TWO UNMANNED AERIAL VEHICLES","year":2018,"lang":"en","type":"article","venue":"Journal of Emerging Technologies and Innovative Research","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Autopilot; Computer science; Interface (matter); Modeling and simulation; Block diagram; Software; Visualization; Simulation software; Virtual reality; Block (permutation group theory); Simulation; VRML; Set (abstract data type); Real-time computing; Control engineering; Engineering; Human–computer interaction; Operating system; Artificial intelligence","score_opus":0.11630183028728881,"score_gpt":0.4153046299164614,"score_spread":0.2990027996291726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007439752","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49644482,0.00007904425,0.5029982,0.00034860158,0.000029628603,0.000063378975,0.0000032906503,0.000016836178,0.00001622328],"genre_scores_gemma":[0.9948864,0.00007877169,0.0049912585,0.0000021797744,0.000033466687,0.000001740556,0.0000013190972,0.0000029715352,0.0000019039801],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814576,0.00018066207,0.000764903,0.00015103488,0.0005574243,0.00020020541],"domain_scores_gemma":[0.9956077,0.0002258078,0.00063928164,0.00024676073,0.003258782,0.000021682474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034466374,0.000084071144,0.0003470229,0.001402874,0.00016635809,0.00006307873,0.0004626474,0.00007981582,9.3916424e-7],"category_scores_gemma":[0.0013196982,0.00006692058,0.000045772318,0.0034009449,0.00030937875,0.000744145,0.0003922596,0.00025261755,1.6183472e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005734355,0.00023549038,0.014662487,0.00021478979,0.0014395326,0.0000091656,0.005639933,0.094642736,0.24048764,0.10356469,0.00022872967,0.53830135],"study_design_scores_gemma":[0.00060399756,0.00040668965,0.0008685846,0.00008552406,0.000015527748,0.0000028721613,0.0024660595,0.9761075,0.013859914,0.005499377,0.000024052972,0.00005990717],"about_ca_topic_score_codex":0.00009341043,"about_ca_topic_score_gemma":0.000012497825,"teacher_disagreement_score":0.8814648,"about_ca_system_score_codex":0.0000497602,"about_ca_system_score_gemma":0.00005318302,"threshold_uncertainty_score":0.2728942},"labels":[],"label_agreement":null},{"id":"W3008451164","doi":"10.1016/j.automatica.2020.108895","title":"Distributed bearing vector estimation in multi-agent networks","year":2020,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Research Foundation of Korea","keywords":"Spanning tree; Graph; Enhanced Data Rates for GSM Evolution; Exponential growth; Bearing (navigation); Minimum spanning tree; Mathematics; Mathematical optimization; Computer science; Algorithm; Artificial intelligence; Theoretical computer science; Combinatorics; Mathematical analysis","score_opus":0.0301609344595697,"score_gpt":0.2571757547332516,"score_spread":0.22701482027368192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3008451164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007705596,0.000095116586,0.9878415,0.0028044267,0.00027199142,0.0004718727,0.000013865527,0.0007189356,0.00007669383],"genre_scores_gemma":[0.96360743,0.0000021659903,0.035885658,0.00032457363,0.000035928806,0.00006859578,0.000052281626,0.000013977855,0.000009373005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815154,0.00013303956,0.0005362888,0.00044235963,0.000306889,0.00042987688],"domain_scores_gemma":[0.9989645,0.00014149972,0.00015925345,0.00047330602,0.000046971894,0.00021448723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026126896,0.00019947339,0.00031012367,0.00006117556,0.00007647913,0.0002280255,0.0008254632,0.00009182509,0.000014292096],"category_scores_gemma":[0.00035558327,0.00019969697,0.00007505396,0.0007228626,0.000023326378,0.000451677,0.00024413333,0.00019043715,0.00026011368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003759694,0.00088212074,0.024501238,0.00052014686,0.00027620074,0.0004723133,0.00587848,0.8570606,0.0020830524,0.03388764,0.0071984665,0.06720212],"study_design_scores_gemma":[0.00084760354,0.00003284174,0.047124267,0.00005534071,0.000007844553,0.0000038352255,0.000019087718,0.9512494,0.00008195807,0.00004618015,0.00033694156,0.00019465247],"about_ca_topic_score_codex":0.000054291857,"about_ca_topic_score_gemma":0.00000931365,"teacher_disagreement_score":0.95590186,"about_ca_system_score_codex":0.00013466457,"about_ca_system_score_gemma":0.000040816583,"threshold_uncertainty_score":0.8143406},"labels":[],"label_agreement":null},{"id":"W3010781917","doi":"10.1109/tac.2020.2981035","title":"Asynchronous Gradient Push","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Asynchrony (computer programming); Asynchronous communication; Iterated function; Convergence (economics); Regular polygon; Multi-agent system; Convex function; Distributed algorithm; Convex optimization","score_opus":0.015313559181288967,"score_gpt":0.22333149657720366,"score_spread":0.2080179373959147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010781917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026367963,0.000052420808,0.98602414,0.0073764063,0.0011171208,0.0008836312,0.00005752877,0.001389198,0.00046274546],"genre_scores_gemma":[0.99411136,0.0000028300487,0.003193889,0.0023090057,0.00007476565,0.00022665334,0.0000014315109,0.000023687006,0.000056398974],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99765134,0.00019003483,0.0005700139,0.0005748236,0.0005195596,0.00049421046],"domain_scores_gemma":[0.9983657,0.00025610856,0.00016747399,0.00073106197,0.00008294314,0.00039671228],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021382088,0.0003046411,0.0004685269,0.00012245185,0.00021738018,0.00024759222,0.00097607897,0.000095999,0.00014946502],"category_scores_gemma":[0.000024510962,0.00028891346,0.00027631805,0.0004961721,0.00004326788,0.00037887914,0.0000027076344,0.00020894135,0.0013080174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001097372,0.0014249624,0.000044056666,0.00026185162,0.0011556455,0.00028262532,0.0042123157,0.10520893,0.011666755,0.008761152,0.0035779395,0.863294],"study_design_scores_gemma":[0.003195255,0.00028136978,0.00018714942,0.000035168858,0.00006397242,0.000023146555,0.000032705873,0.9932389,0.0012634891,0.000088006425,0.0012942349,0.00029660307],"about_ca_topic_score_codex":0.000027452896,"about_ca_topic_score_gemma":0.000011094132,"teacher_disagreement_score":0.99147457,"about_ca_system_score_codex":0.00015043363,"about_ca_system_score_gemma":0.00011537668,"threshold_uncertainty_score":0.9999563},"labels":[],"label_agreement":null},{"id":"W3011233081","doi":"10.1109/cdc40024.2019.9029758","title":"Event-triggered Broadcasting for Distributed Smooth Optimization","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Lipschitz continuity; Optimization problem; Computer science; Mathematical optimization; Convex function; Computation; Constant (computer programming); Convergence (economics); Convex optimization; Monotonic function; Broadcasting (networking); Graph; Global optimization; Distributed algorithm; Regular polygon; Rate of convergence; Mathematics; Distributed computing; Theoretical computer science; Algorithm; Telecommunications; Computer network","score_opus":0.012573693176381833,"score_gpt":0.24031753135295433,"score_spread":0.2277438381765725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011233081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001727167,0.000043553187,0.9939965,0.0005291376,0.00081467954,0.0010595135,0.00007474329,0.0004188603,0.0013358218],"genre_scores_gemma":[0.9220799,0.0000015195141,0.07589032,0.00017215403,0.00008375523,0.000091590686,0.00023316049,0.000017816923,0.0014297741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836516,0.000057923447,0.00039838228,0.0004914111,0.00026964486,0.0004174723],"domain_scores_gemma":[0.9986655,0.00019281449,0.0001942094,0.00061870017,0.00022053151,0.000108215594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003590333,0.00017685369,0.00024853987,0.00007820679,0.00010039545,0.00028406162,0.0007587934,0.00008428427,0.000065067994],"category_scores_gemma":[0.00014717407,0.0001611505,0.00012385238,0.00040662658,0.000010091611,0.00059764663,0.00012749384,0.000065201115,0.00015555514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007591261,0.00032203348,0.0043823305,0.00017984884,0.00016977514,0.000007907206,0.00023716495,0.8433292,0.005485293,0.09572348,0.013911996,0.036175046],"study_design_scores_gemma":[0.0016573232,0.00006635202,0.0003257077,0.00002653668,0.000007780085,0.0000025499237,0.000026835995,0.99054396,0.0004945157,0.00019104691,0.006438319,0.00021904273],"about_ca_topic_score_codex":0.00002943732,"about_ca_topic_score_gemma":0.0000026015664,"teacher_disagreement_score":0.92035276,"about_ca_system_score_codex":0.00010085564,"about_ca_system_score_gemma":0.00007226346,"threshold_uncertainty_score":0.65715265},"labels":[],"label_agreement":null},{"id":"W3011330315","doi":"10.1109/cdc40024.2019.9029369","title":"Distributed GNE seeking over networks in aggregative games with coupled constraints via forward-backward operator splitting","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Monotonic function; Nash equilibrium; Convergence (economics); Operator (biology); Subspace topology; Computer science; Aggregate (composite); Mathematical optimization; Affine transformation; Constant (computer programming); Property (philosophy); Population; Mathematics; Pure mathematics","score_opus":0.005450072010309319,"score_gpt":0.2124410598132869,"score_spread":0.2069909878029776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011330315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1823253,0.00008862715,0.81478626,0.000215837,0.00037258584,0.0010350929,0.00002916,0.0002672607,0.00087987597],"genre_scores_gemma":[0.9942465,0.0000035600185,0.00501178,0.00030261645,0.00007201984,0.000065564105,0.000068146255,0.000028466184,0.00020139251],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99675333,0.00018874646,0.0006789226,0.0009295015,0.0005508007,0.00089868123],"domain_scores_gemma":[0.9979996,0.00034999594,0.00034491456,0.00084589806,0.00023589747,0.00022369214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007455375,0.00042428324,0.0006774571,0.00013737597,0.00010176692,0.00045310616,0.0009990836,0.0001681319,0.00015522409],"category_scores_gemma":[0.00008380118,0.00034123118,0.00010900786,0.00095741596,0.00012976404,0.0009082156,0.00028748802,0.00036334345,0.00013026388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048953056,0.00087157224,0.7430802,0.00028123558,0.0012293344,0.0008330851,0.0032027203,0.13553342,0.011663925,0.049418997,0.0014570081,0.051938992],"study_design_scores_gemma":[0.0038952418,0.00013008725,0.020652095,0.00031251032,0.000013608699,0.000033742628,0.00025700824,0.97354877,0.00027496647,0.000055188873,0.00030970524,0.0005170938],"about_ca_topic_score_codex":0.00025530986,"about_ca_topic_score_gemma":0.00013695058,"teacher_disagreement_score":0.8380153,"about_ca_system_score_codex":0.00028028083,"about_ca_system_score_gemma":0.00016628312,"threshold_uncertainty_score":0.999904},"labels":[],"label_agreement":null},{"id":"W3012284353","doi":"10.1109/cdc40024.2019.9029296","title":"Optimal Distance-Based Formation Producing Control of Multi-Agent Systems with Energy Constraints and Collision Avoidance","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Collision avoidance; Collision; Computer science; Control (management); Energy (signal processing); Control theory (sociology); Multi-agent system; Mathematics; Computer security; Artificial intelligence","score_opus":0.008963289209531633,"score_gpt":0.20001250113909125,"score_spread":0.19104921192955962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012284353","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05323294,0.00032106435,0.94474083,0.000112490634,0.00028709703,0.0009271696,0.000045085457,0.000113170965,0.00022017586],"genre_scores_gemma":[0.9873803,0.0000037423365,0.012244827,0.000058602058,0.000018746267,0.00007335337,0.000013097512,0.000011234615,0.00019605167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804384,0.00015232562,0.0005218902,0.0005067791,0.00045739688,0.00031776243],"domain_scores_gemma":[0.99838746,0.00014478291,0.00042466933,0.00063111197,0.00029756408,0.00011444531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048291904,0.00021928863,0.0004217346,0.000101929305,0.00007634548,0.00018296193,0.0003970376,0.00006708796,0.000004248365],"category_scores_gemma":[0.000033443892,0.0001661004,0.000045539113,0.00025086798,0.000090721034,0.00069586467,0.00004776289,0.00007215174,0.000010169431],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004918119,0.0005808923,0.021507237,0.0012543213,0.00023241207,0.00003757373,0.0012158804,0.85126394,0.04066397,0.073494434,0.00028568675,0.00897187],"study_design_scores_gemma":[0.0048430404,0.00019766662,0.001404097,0.0003149855,0.00001274604,0.000019497107,0.00015253277,0.9871648,0.0052105435,0.0000017742238,0.00045735456,0.00022098488],"about_ca_topic_score_codex":0.00014445276,"about_ca_topic_score_gemma":0.000024979208,"teacher_disagreement_score":0.9341474,"about_ca_system_score_codex":0.00010084833,"about_ca_system_score_gemma":0.00010940077,"threshold_uncertainty_score":0.6773378},"labels":[],"label_agreement":null},{"id":"W3012353514","doi":"10.1088/1674-1056/ab7da2","title":"Hunting problems of multi-quadrotor systems via bearing-based hybrid protocols with hierarchical network*","year":2020,"lang":"en","type":"article","venue":"Chinese Physics B","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bearing (navigation); Computer science; Collision; Protocol (science); Collision avoidance; State (computer science); Displacement (psychology); Process (computing); Transmission (telecommunications); Artificial intelligence; Computer security; Telecommunications; Algorithm","score_opus":0.028188979207565638,"score_gpt":0.2577334387076396,"score_spread":0.22954445950007396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012353514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011849298,0.00004040296,0.9733947,0.0002752069,0.00015542972,0.013748226,0.000027412154,0.00036606172,0.00014324456],"genre_scores_gemma":[0.98368686,1.3451749e-7,0.009484145,0.00013697449,0.00060016534,0.0060030273,0.000029526784,0.00004719637,0.000011983529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719644,0.00019147279,0.0006530516,0.0007253705,0.0006632233,0.0005704574],"domain_scores_gemma":[0.99791306,0.00015243364,0.0005457936,0.0008408512,0.00026556107,0.00028227468],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003418658,0.00039906235,0.00072010525,0.00003827745,0.00014169455,0.00026109556,0.0013622349,0.00005977257,0.0000015932287],"category_scores_gemma":[0.00007078746,0.00030391695,0.00016415205,0.0008735341,0.00008883463,0.0004486064,0.0002727625,0.00035245938,0.000031950312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019527767,0.00091743795,0.07068364,0.0026930557,0.0002992586,0.00007485816,0.000975818,0.8926525,0.017615646,0.0070395353,0.0001815214,0.0066714273],"study_design_scores_gemma":[0.0023546687,0.0002603572,0.0017905062,0.0004151454,0.000012690051,0.0000056059894,0.0000034329346,0.9934548,0.0008065117,0.00020988402,0.00032777322,0.0003586048],"about_ca_topic_score_codex":0.00011585933,"about_ca_topic_score_gemma":0.0000057271172,"teacher_disagreement_score":0.9718375,"about_ca_system_score_codex":0.00004563654,"about_ca_system_score_gemma":0.00018585438,"threshold_uncertainty_score":0.9999413},"labels":[],"label_agreement":null},{"id":"W3012885570","doi":"10.1109/tac.2024.3495456","title":"Distributed Optimization With Uncertain Communications","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Subgradient method; Upper and lower bounds; Convergence (economics); Combinatorics; Sequence (biology); Rate of convergence; Random graph; Computer science; Mathematics; Regular polygon; Distributed algorithm; Convex function; Convex optimization; Mathematical optimization; Discrete mathematics; Order (exchange); Graph; Distributed computing; Telecommunications","score_opus":0.0165609722602428,"score_gpt":0.2525974811514587,"score_spread":0.23603650889121588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012885570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010568972,0.0001802983,0.9905073,0.005135034,0.0005880017,0.00087047915,0.0002606189,0.0020314457,0.00032115565],"genre_scores_gemma":[0.97484463,0.000014327984,0.024174908,0.00020755162,0.000021918593,0.0004903432,0.000031051157,0.000028260847,0.0001869778],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998012,0.00024548074,0.0004723534,0.00046067,0.0004511222,0.00035837138],"domain_scores_gemma":[0.9973131,0.0006253709,0.00009727245,0.0016767283,0.00013687948,0.00015068168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033803505,0.0002750055,0.0003191829,0.00025669136,0.00031361607,0.0006219449,0.0011696564,0.000095750176,0.00007341582],"category_scores_gemma":[0.000013062348,0.00022741215,0.00014569508,0.0010321141,0.000090432724,0.0006253501,0.0000038749645,0.00023316953,0.00021730848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019435874,0.0003122556,0.0000037387576,0.000085457425,0.00043296316,0.000041871295,0.00034667828,0.9131555,0.00023380914,0.005858175,0.00045470672,0.079055384],"study_design_scores_gemma":[0.0013451607,0.00012821965,0.000027453689,0.00021812161,0.00011405502,0.000049133865,0.000037772,0.99629724,0.00012797475,0.000079641286,0.0013194329,0.0002558183],"about_ca_topic_score_codex":0.00005128246,"about_ca_topic_score_gemma":0.00003878172,"teacher_disagreement_score":0.97473896,"about_ca_system_score_codex":0.0002458563,"about_ca_system_score_gemma":0.00020857528,"threshold_uncertainty_score":0.9273599},"labels":[],"label_agreement":null},{"id":"W3013111069","doi":"10.1109/tac.2020.2983108","title":"Event-Triggered Optimal Dynamic Formation of Heterogeneous Affine Nonlinear Multiagent Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; State Key Laboratory of Synthetical Automation for Process Industries; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Control theory (sociology); Nonlinear system; Affine transformation; Trajectory; Zeno's paradoxes; Control reconfiguration; Optimal control; Convergence (economics); Multi-agent system; Mathematical optimization; Mathematics; Control (management); Artificial intelligence","score_opus":0.013699066585027564,"score_gpt":0.2376282370940558,"score_spread":0.22392917050902825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013111069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021292368,0.00014704077,0.9741069,0.0010125703,0.0008684088,0.0016538035,0.00028077915,0.00061707565,0.00002106542],"genre_scores_gemma":[0.9951505,0.000008223675,0.0042766468,0.00020547156,0.00004103368,0.00023074503,0.000011491498,0.000028523295,0.00004736183],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696964,0.0002831114,0.0011779886,0.00047280022,0.0006676829,0.00042877393],"domain_scores_gemma":[0.9980951,0.00024278981,0.00049904065,0.000700943,0.0001958529,0.00026630625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029339542,0.00035013442,0.0006940201,0.00020065908,0.00014570953,0.00015992501,0.00082174665,0.00013414079,0.000042442047],"category_scores_gemma":[0.00002877845,0.00033318216,0.0003487901,0.00048736777,0.000038424085,0.0005045523,0.000004819434,0.00017442278,0.00020589698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009695556,0.0004266007,0.0000012495974,0.0003064168,0.0002723829,0.000032702654,0.0007472833,0.93784034,0.018944718,0.00004651854,0.00006178592,0.041223057],"study_design_scores_gemma":[0.0042215325,0.0004243327,0.000014456596,0.00011159788,0.000104963234,0.000035333313,0.00006816932,0.98811567,0.0064570876,0.0000026147777,0.00017077952,0.00027348005],"about_ca_topic_score_codex":0.000039478822,"about_ca_topic_score_gemma":0.000012348479,"teacher_disagreement_score":0.9738581,"about_ca_system_score_codex":0.00018929559,"about_ca_system_score_gemma":0.00010067029,"threshold_uncertainty_score":0.999912},"labels":[],"label_agreement":null},{"id":"W3016142375","doi":"10.1109/icassp40776.2020.9053329","title":"Decentralized Optimization with Non-Identical Sampling in Presence of Stragglers","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Convergence (economics); Mathematical optimization; Convex optimization; Regular polygon; Sampling (signal processing); Work (physics); Variable (mathematics); Sample (material); Optimization problem; Algorithm; Mathematics","score_opus":0.028337942600360617,"score_gpt":0.2506527238421389,"score_spread":0.22231478124177825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016142375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017274337,0.000015610533,0.9810164,0.0009089733,0.000058121914,0.00028844757,0.0000023894113,0.00006677104,0.00036892478],"genre_scores_gemma":[0.8713701,0.0000037900263,0.12850766,0.00008530096,0.000009254725,0.000007796343,0.0000036279564,0.0000046443974,0.000007879753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987986,0.000047440444,0.00033597334,0.00029310308,0.00030192843,0.0002229564],"domain_scores_gemma":[0.9993925,0.000082889965,0.00009734381,0.0002317662,0.00007458964,0.0001208793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013319356,0.00009671733,0.00019747058,0.000045394925,0.000017635599,0.0000863214,0.00055671035,0.00003684269,0.000024568113],"category_scores_gemma":[0.00010982294,0.00008067079,0.000029746094,0.000518948,0.000028801596,0.00040449415,0.00008390594,0.000069715585,0.000007259338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006739872,0.00009028938,0.0142781325,0.00005624749,0.000029562576,0.000021438193,0.0008853207,0.9712576,0.0025533363,0.009390908,0.00010955849,0.001260191],"study_design_scores_gemma":[0.0012592569,0.000055922927,0.0036235047,0.000044449174,0.000004311249,0.0000019560227,0.00008128678,0.99382746,0.00095368,0.000019220239,0.000029839059,0.00009910214],"about_ca_topic_score_codex":0.00011219181,"about_ca_topic_score_gemma":0.000025296487,"teacher_disagreement_score":0.8540957,"about_ca_system_score_codex":0.000024477482,"about_ca_system_score_gemma":0.00006569529,"threshold_uncertainty_score":0.32896593},"labels":[],"label_agreement":null},{"id":"W3021748674","doi":"10.1007/978-3-319-73008-0_30","title":"Decentralized Progressive Shape Formation with Robot Swarms","year":2018,"lang":"en","type":"book-chapter","venue":"Springer proceedings in advanced robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Robot; Swarm behaviour; Convergence (economics); Holonomic; Computer science; Graph; Swarm robotics; Robot locomotion; Algorithm; Topology (electrical circuits); Artificial intelligence; Robot control; Mathematics; Mobile robot; Theoretical computer science; Combinatorics","score_opus":0.01559439647989909,"score_gpt":0.2351629303651083,"score_spread":0.2195685338852092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021748674","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005621817,0.00220236,0.8797905,0.0008816212,0.0021526453,0.005589783,0.000032898133,0.0016368874,0.10715114],"genre_scores_gemma":[0.077920265,0.00061700365,0.87543935,0.0004782518,0.0009299373,0.00055449654,0.00012409447,0.0005333598,0.043403216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957522,0.000010109117,0.0010224784,0.001225532,0.0010075354,0.0009821398],"domain_scores_gemma":[0.9968016,0.00005202119,0.0013376732,0.0006314282,0.0009153095,0.00026195095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003384677,0.00087247696,0.0009338544,0.00045345395,0.00016295932,0.0004943139,0.0017399612,0.00048210076,0.000050073097],"category_scores_gemma":[0.00009339505,0.00078628777,0.0001597883,0.00030388462,0.00018732536,0.0018457785,0.00049326,0.0007467418,0.00018616887],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006055197,0.00038051803,0.0007047626,0.0020931086,0.0005662991,0.0004573002,0.004078661,0.018981641,0.001639228,0.8996115,0.0014674283,0.06941407],"study_design_scores_gemma":[0.026843918,0.003577591,0.0010117305,0.027688788,0.0007112693,0.0011382403,0.0005637939,0.61697775,0.008585954,0.09316318,0.20676216,0.012975609],"about_ca_topic_score_codex":0.0000017037751,"about_ca_topic_score_gemma":0.000008560986,"teacher_disagreement_score":0.8064483,"about_ca_system_score_codex":0.000659467,"about_ca_system_score_gemma":0.00014874038,"threshold_uncertainty_score":0.9994588},"labels":[],"label_agreement":null},{"id":"W3022912303","doi":"10.1109/tcst.2020.2990532","title":"A Novel Attitude-Tracking Control for Spacecraft Networks With Input Delays","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Control theory (sociology); Controller (irrigation); Fuzzy logic; Compensation (psychology); Tracking (education); Stability (learning theory); Spacecraft; Attitude control; Fuzzy control system; Computer science; Nonlinear system; Control (management); Control engineering; Engineering; Artificial intelligence; Physics; Aerospace engineering","score_opus":0.018340567838236503,"score_gpt":0.2306354790881148,"score_spread":0.2122949112498783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3022912303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041118162,0.00039596675,0.981665,0.009845679,0.001458295,0.0038343621,0.0002463451,0.0020909256,0.0000522376],"genre_scores_gemma":[0.99189955,0.0000064842197,0.004462315,0.0009957893,0.00023932596,0.0022469247,0.0000041106946,0.00007869755,0.00006680819],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615306,0.00013536257,0.000911905,0.0012513223,0.0004815964,0.0010667812],"domain_scores_gemma":[0.99696773,0.000545057,0.00049854204,0.001149323,0.0005103513,0.0003290084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004716839,0.00061338703,0.0011740299,0.0004546964,0.00044137245,0.0003554545,0.0016497106,0.00063966116,0.000003581421],"category_scores_gemma":[0.00004773673,0.0005495712,0.00029017837,0.0010104682,0.00016015228,0.00048691098,0.0000064852884,0.00075020024,0.000057188234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000779781,0.0004661671,0.00021455718,0.00015929913,0.0015097737,0.00009719591,0.00017850068,0.94995576,0.023028852,0.013008606,0.00039826584,0.010203264],"study_design_scores_gemma":[0.0150318565,0.0012459287,0.000027035447,0.00015855217,0.00020675501,0.00024700534,0.00009529116,0.97758555,0.0006499492,0.000020605736,0.0041131405,0.0006183425],"about_ca_topic_score_codex":0.00008138662,"about_ca_topic_score_gemma":0.000145224,"teacher_disagreement_score":0.99148834,"about_ca_system_score_codex":0.00021838731,"about_ca_system_score_gemma":0.00017041064,"threshold_uncertainty_score":0.9996956},"labels":[],"label_agreement":null},{"id":"W3023042311","doi":"10.1007/978-3-030-66723-8_20","title":"Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments","year":2021,"lang":"en","type":"preprint","venue":"Springer proceedings in advanced robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Metric (unit); Computer science; Approximation algorithm; Regular polygon; Algorithm; Robot; Event (particle physics); Range (aeronautics); Mathematical optimization; Constant (computer programming); Distributed algorithm; Distributed computing; Mathematics; Artificial intelligence; Engineering","score_opus":0.024972835149643734,"score_gpt":0.27137553985883367,"score_spread":0.24640270470918993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023042311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009212689,0.0003208348,0.9842089,0.00028656865,0.0020228676,0.0035874874,0.00011364043,0.0001876919,0.00005934875],"genre_scores_gemma":[0.51775885,0.00012612992,0.48030818,0.00006342653,0.00010901633,0.0011129747,0.00035694084,0.00007733122,0.000087168286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99439704,0.000042265554,0.0015411862,0.0021169253,0.0007335199,0.0011690456],"domain_scores_gemma":[0.9975034,0.00013170538,0.0010182238,0.000881294,0.0002482022,0.00021718709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008694538,0.00086739304,0.0012963929,0.0004717539,0.00011806474,0.0006820592,0.0020686078,0.0007119333,0.000002283488],"category_scores_gemma":[0.0004965657,0.0010325998,0.00028367952,0.00075277034,0.00007453006,0.0011367628,0.002036902,0.0012698297,0.000011082732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005824953,0.0011733476,0.008918745,0.0017204214,0.00013278732,0.000072339266,0.0015888419,0.9560462,0.010836741,0.0022115803,0.000028107703,0.017212635],"study_design_scores_gemma":[0.0049125077,0.000059252878,0.016763631,0.0012624632,0.000032113003,0.0000078603125,0.00020970407,0.9706001,0.0037400161,0.0010191067,0.0002463171,0.0011469036],"about_ca_topic_score_codex":0.000034064036,"about_ca_topic_score_gemma":0.000021721171,"teacher_disagreement_score":0.5085461,"about_ca_system_score_codex":0.0014739647,"about_ca_system_score_gemma":0.00017424338,"threshold_uncertainty_score":0.99921244},"labels":[],"label_agreement":null},{"id":"W3023288757","doi":"10.23919/siceiscs48470.2020.9083577","title":"Finite-Time Input to State Stability of Discontinuous Dynamical Systems: A Case Study of Networked Euler-Lagrange Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Lyapunov function; Dynamical systems theory; State (computer science); Convergence (economics); Stability (learning theory); Mathematics; Euler's formula; Control theory (sociology); Applied mathematics; Computer science; Mathematical analysis; Nonlinear system; Algorithm; Physics","score_opus":0.029255503327756355,"score_gpt":0.24400099525723254,"score_spread":0.21474549192947617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023288757","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.661137,0.00011615562,0.3346936,0.0001506164,0.0005148104,0.0027965952,0.0002007974,0.00023569276,0.00015472095],"genre_scores_gemma":[0.9992423,6.7363624e-7,0.0003575189,0.00003651484,0.0000802818,0.0001674172,0.0000108132135,0.000026560476,0.000077935816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99463636,0.001085768,0.0018238409,0.0009787307,0.0008756696,0.0005996426],"domain_scores_gemma":[0.9960716,0.0008150988,0.00062416506,0.0014490301,0.0005035173,0.000536602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011481129,0.00040489857,0.001364856,0.00013381714,0.00007883228,0.00023464015,0.0014591633,0.00010056581,0.000011180237],"category_scores_gemma":[0.0003640241,0.00033815933,0.00016661151,0.0012766958,0.00006256246,0.00039817035,0.0006617083,0.00019896054,0.00006106884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017979654,0.014601779,0.08369816,0.006718526,0.003999322,0.012224717,0.11567962,0.72179836,0.019558089,0.0050148075,0.005678232,0.009230395],"study_design_scores_gemma":[0.00223505,0.0013471693,0.0004926861,0.00011534204,0.00005834305,0.00008897261,0.0059814826,0.9891141,0.000050099865,0.000002265878,0.00013800361,0.0003764929],"about_ca_topic_score_codex":0.008573513,"about_ca_topic_score_gemma":0.000376656,"teacher_disagreement_score":0.3381053,"about_ca_system_score_codex":0.00012313816,"about_ca_system_score_gemma":0.000110041365,"threshold_uncertainty_score":0.999907},"labels":[],"label_agreement":null},{"id":"W3023360435","doi":"","title":"Redundant Persistent Acyclic Formations for Vision-Based Control of Distributed Multi-Agent Formations.","year":2019,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Control (management); Distributed computing; Multi-agent system; Geology; Artificial intelligence","score_opus":0.026395066848468422,"score_gpt":0.26148191985535324,"score_spread":0.2350868530068848,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3023360435","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013449071,0.000048061185,0.97629136,0.0036341504,0.0007093186,0.0016953379,0.0035947578,0.00008959213,0.00048837904],"genre_scores_gemma":[0.98714316,9.4694695e-7,0.010258484,0.00084230443,0.000027519523,0.00016327771,0.0014349496,0.000016289232,0.00011308722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743617,0.00010523462,0.00079551083,0.0004908018,0.0005758489,0.0005964292],"domain_scores_gemma":[0.9966339,0.00063096726,0.00043403436,0.00063091837,0.001131654,0.0005385204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045372223,0.0002942926,0.00044818668,0.00086115295,0.00029492428,0.00028467548,0.0010197817,0.00013669551,0.00008736691],"category_scores_gemma":[0.00023028544,0.0003024788,0.0003320907,0.0008014508,0.000073613446,0.00053653074,0.000033033848,0.00016814072,0.00023605277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006938037,0.00039161864,0.0022021844,0.00024183065,0.00031218096,0.0000057063376,0.00034769883,0.77517766,0.00033551877,0.20841497,0.0038113254,0.008689913],"study_design_scores_gemma":[0.0034647346,0.00027794822,0.010781722,0.00011899496,0.000026080195,0.0000051956736,0.00013981512,0.9797718,0.000056884604,0.00061586715,0.0044202474,0.00032072762],"about_ca_topic_score_codex":0.0011636147,"about_ca_topic_score_gemma":0.00078339514,"teacher_disagreement_score":0.9736941,"about_ca_system_score_codex":0.0005791338,"about_ca_system_score_gemma":0.0020495371,"threshold_uncertainty_score":0.9999427},"labels":[],"label_agreement":null},{"id":"W3025863088","doi":"10.1016/j.ifacol.2020.12.417","title":"Chance-Constrained MPC for Voronoi-based Multi-Agent System Deployment","year":2020,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Collège de Maisonneuve; Concordia University","funders":"","keywords":"Software deployment; Voronoi diagram; Chebyshev filter; Noise (video); Model predictive control; Position (finance); Computer science; Control theory (sociology); Mathematical optimization; Bounded function; Mathematics; Control (management); Artificial intelligence","score_opus":0.044880837196489436,"score_gpt":0.25793541891805083,"score_spread":0.2130545817215614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025863088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046388367,0.00040792115,0.97879773,0.011015036,0.0011506894,0.002132015,0.00049575017,0.0012254509,0.00013656776],"genre_scores_gemma":[0.59036607,0.000003312298,0.40634993,0.0020359405,0.00049326505,0.0004241315,0.00013318146,0.000051487914,0.00014269208],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644226,0.00014847312,0.0007927022,0.0011561984,0.00058970076,0.0008706588],"domain_scores_gemma":[0.9977715,0.0002032774,0.000366659,0.00084095146,0.00023393525,0.0005836485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004311983,0.000520287,0.0006999981,0.00009887051,0.00023872577,0.00024028927,0.0014974066,0.00016999558,0.000020336824],"category_scores_gemma":[0.00018083418,0.0004861362,0.00038878105,0.00043926665,0.000067492314,0.00032027665,0.00016820784,0.00020144334,0.00023020497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020921663,0.0064359815,0.0059839403,0.009768547,0.003927908,0.0016820012,0.014834373,0.063648716,0.47105673,0.087631255,0.0024305726,0.3305078],"study_design_scores_gemma":[0.0062053613,0.00032410776,0.00028332698,0.00015003681,0.000059843704,0.000011295822,0.00032429985,0.9819831,0.0041650613,0.000002691384,0.005916594,0.0005742303],"about_ca_topic_score_codex":0.000055976234,"about_ca_topic_score_gemma":0.000033632416,"teacher_disagreement_score":0.9183344,"about_ca_system_score_codex":0.00033336427,"about_ca_system_score_gemma":0.0002588351,"threshold_uncertainty_score":0.999759},"labels":[],"label_agreement":null},{"id":"W3026364537","doi":"10.1016/j.automatica.2020.109033","title":"Robust attitude alignment in multispacecraft systems with stochastic links failure","year":2020,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Quaternion; Spacecraft; Robustness (evolution); Attitude control; Control theory (sociology); Nonlinear system; Computer science; Convergence (economics); Control (management); Mathematics; Engineering; Control engineering; Aerospace engineering; Physics; Artificial intelligence","score_opus":0.024371214290219552,"score_gpt":0.21536828598294386,"score_spread":0.1909970716927243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026364537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006892399,0.0001413186,0.9822108,0.008481117,0.00022808921,0.0010964809,0.000013524513,0.00063974404,0.00029653808],"genre_scores_gemma":[0.974762,6.882284e-7,0.02453715,0.000351306,0.00007878464,0.00018458403,0.0000084320045,0.00002290587,0.000054107855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758977,0.00015804572,0.0005072626,0.0006058786,0.0006240199,0.00051500567],"domain_scores_gemma":[0.9986013,0.00016413165,0.00019342072,0.00067519443,0.00006968318,0.00029628037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000250765,0.00028637814,0.00046938917,0.00008907435,0.00007070693,0.000340714,0.0010224684,0.00015873986,0.000011382095],"category_scores_gemma":[0.00009994323,0.00023603794,0.000056989866,0.00055407896,0.000041115865,0.00037213942,0.00020408514,0.00031360865,0.0003672036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006280464,0.0007386329,0.005028034,0.001149705,0.00058560475,0.0010839249,0.012604393,0.9005256,0.0025463118,0.060852647,0.011897944,0.0029243485],"study_design_scores_gemma":[0.0015448877,0.00014533909,0.0019536526,0.00027195664,0.000018146484,0.000026441869,0.00023854178,0.9948057,0.000020896992,0.000018981053,0.00065018557,0.00030527316],"about_ca_topic_score_codex":0.00010710532,"about_ca_topic_score_gemma":0.000060054535,"teacher_disagreement_score":0.96786964,"about_ca_system_score_codex":0.0001416265,"about_ca_system_score_gemma":0.00010500258,"threshold_uncertainty_score":0.9625348},"labels":[],"label_agreement":null},{"id":"W3029740633","doi":"10.1109/lcsys.2020.3006187","title":"Neuro-Adaptive Formation Control and Target Tracking for Nonlinear Multi-Agent Systems With Time-Delay","year":2020,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Backstepping; Lyapunov function; Nonlinear system; Artificial neural network; Lyapunov stability; Controller (irrigation); Bounded function; Adaptive control; Tracking error; Computer science; Upper and lower bounds; Mathematics; Multi-agent system; Control (management); Artificial intelligence","score_opus":0.02075659460202849,"score_gpt":0.21346400929165674,"score_spread":0.19270741468962824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029740633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053800466,0.0007678833,0.9791015,0.005970278,0.0015359796,0.00601257,0.00062185456,0.0005916568,0.00001825975],"genre_scores_gemma":[0.9908922,0.0000025459015,0.0028428063,0.0042401804,0.00086568575,0.0010025928,0.00003711281,0.00008409425,0.00003278445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99528986,0.0006700414,0.0011960821,0.0011132816,0.0007692258,0.0009615348],"domain_scores_gemma":[0.9966874,0.00073148333,0.0009269151,0.00067283324,0.00043958102,0.000541747],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00091628183,0.0006696842,0.0012414763,0.0001752189,0.00034268582,0.0011102698,0.0009803376,0.00018832483,8.36854e-7],"category_scores_gemma":[0.00015057625,0.00057090906,0.00022034245,0.00034287004,0.0000875794,0.0015541534,0.000045673816,0.00031987022,0.00008675964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017249339,0.00029070303,0.0011060522,0.0014893285,0.0018555818,0.0005249954,0.0032650838,0.65450704,0.31439406,0.0014634886,0.018155461,0.0012232724],"study_design_scores_gemma":[0.014584229,0.0004737217,0.000094842246,0.00019238847,0.0001345216,0.00013529687,0.00012858528,0.9769021,0.00014345619,9.097719e-7,0.0065812543,0.00062866916],"about_ca_topic_score_codex":0.000112782356,"about_ca_topic_score_gemma":0.000004500058,"teacher_disagreement_score":0.98551214,"about_ca_system_score_codex":0.00020632223,"about_ca_system_score_gemma":0.00008104801,"threshold_uncertainty_score":0.9999267},"labels":[],"label_agreement":null},{"id":"W3030746880","doi":"10.1109/tcyb.2020.2991514","title":"On Containment for Linear Systems With Switching Topologies: A Novel State Transition Matrix Perspective","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Network topology; Linear system; State-transition matrix; Rank (graph theory); Matrix (chemical analysis); State (computer science); Convex hull; Topology (electrical circuits); Containment (computer programming); Computer science; Mathematics; Perspective (graphical); Mathematical optimization; Regular polygon; Symmetric matrix; Algorithm; Combinatorics","score_opus":0.024962333801483754,"score_gpt":0.2655162733770973,"score_spread":0.24055393957561358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3030746880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005104036,0.000043409465,0.98834664,0.003640621,0.0005732941,0.0015050456,0.00031638247,0.00036222333,0.0001083382],"genre_scores_gemma":[0.9901469,0.000011102731,0.008896874,0.00047611448,0.000071777846,0.00024897052,0.0000045708016,0.000033467706,0.00011023767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805737,0.00007439984,0.00038143594,0.0006346134,0.00045526586,0.0003969129],"domain_scores_gemma":[0.9986956,0.000318322,0.0001528715,0.00041033493,0.00022885119,0.00019400625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001690796,0.00030383613,0.00035276153,0.00010007392,0.00020847768,0.00019455203,0.00046581522,0.000096409196,0.0000036422846],"category_scores_gemma":[0.0000134670545,0.00026634955,0.00014505222,0.0002936354,0.00004185219,0.00021081582,0.0000021101685,0.00029146587,0.000035268982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005986182,0.00045062616,9.973253e-7,0.00009114241,0.00027223313,0.000020267662,0.008419936,0.96593916,0.0038664893,0.018783344,0.00009077027,0.0014663907],"study_design_scores_gemma":[0.0038947312,0.0024924516,0.0000091872425,0.00013410501,0.00008163639,0.000018900533,0.002314603,0.9844834,0.0054404335,0.000219709,0.0004950974,0.0004157294],"about_ca_topic_score_codex":0.00024129823,"about_ca_topic_score_gemma":0.000040833907,"teacher_disagreement_score":0.98504287,"about_ca_system_score_codex":0.00035299812,"about_ca_system_score_gemma":0.00009985406,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W3032057537","doi":"10.1109/tcyb.2020.2991540","title":"Exponential Consensus of Linear Systems Over Switching Network: A Subspace Method to Establish Necessity and Sufficiency","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"NSW Cyber Security Network; National Natural Science Foundation of China","keywords":"Observability; Mathematics; Convergence (economics); Subspace topology; Rank condition; Simple (philosophy); Rank (graph theory); Matrix (chemical analysis); Sequence (biology); Linear system; Piecewise linear function; Exponential function; Manifold (fluid mechanics); Controllability; Complement (music); Reachability; Rate of convergence; Strongly connected component; Control theory (sociology); Applied mathematics; Computer science; Discrete mathematics; Algorithm; Combinatorics; Control (management); Key (lock); Mathematical analysis","score_opus":0.024434276459384886,"score_gpt":0.26778349960509806,"score_spread":0.24334922314571317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3032057537","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05669439,0.00013430024,0.9404554,0.0008100524,0.0010009962,0.00052631344,0.000059896753,0.00017256362,0.00014611316],"genre_scores_gemma":[0.961617,0.000010310768,0.037932146,0.00021222976,0.00012515331,0.000020880187,0.0000011417816,0.000021132344,0.00006002211],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975413,0.00033491332,0.0005568835,0.00060576736,0.00051605137,0.00044505755],"domain_scores_gemma":[0.99832267,0.0004180425,0.00021624156,0.00049948524,0.00016210046,0.00038145419],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005477722,0.00025780394,0.000457067,0.000105462066,0.0001956267,0.00020480205,0.00058259454,0.00012946107,0.000006987782],"category_scores_gemma":[0.00003134957,0.00026481118,0.00011019578,0.0008061615,0.00003967296,0.00016076182,0.00001635519,0.0003043759,0.000016209828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015911412,0.0003365783,0.000281217,0.00017600147,0.00016971222,0.00004595354,0.0049128532,0.952478,0.022811629,0.0035984816,0.001169451,0.013860997],"study_design_scores_gemma":[0.0010251548,0.0002917933,0.00045798544,0.00009767536,0.000068832436,0.000022133063,0.00019280004,0.99173003,0.004218868,0.000019840265,0.0015470209,0.00032785797],"about_ca_topic_score_codex":0.0006177306,"about_ca_topic_score_gemma":0.00006657811,"teacher_disagreement_score":0.9049226,"about_ca_system_score_codex":0.000048698832,"about_ca_system_score_gemma":0.00008879199,"threshold_uncertainty_score":0.9999804},"labels":[],"label_agreement":null},{"id":"W3033016869","doi":"10.1016/j.ast.2020.105887","title":"Relay manoeuvre based fixed-time synchronized tracking control for UAV transport system","year":2020,"lang":"en","type":"article","venue":"Aerospace Science and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Drone; Control theory (sociology); Relay; Underactuation; Decoupling (probability); Computer science; Synchronization (alternating current); Control engineering; Engineering; Control (management); Artificial intelligence","score_opus":0.008939083253336626,"score_gpt":0.20876183158828365,"score_spread":0.19982274833494704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033016869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027258556,0.0003397727,0.9326232,0.036172424,0.0002971582,0.0014204051,0.000049537663,0.0015724555,0.00026647796],"genre_scores_gemma":[0.9900603,0.0000022255924,0.00904422,0.00059696205,0.000043299333,0.00017609504,0.000003615124,0.000016516065,0.00005676627],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970787,0.000038647835,0.00040477293,0.001117399,0.0005514683,0.0008089706],"domain_scores_gemma":[0.99819076,0.0001408892,0.00022922276,0.0007146364,0.00046735958,0.00025714186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009239603,0.00027672778,0.0005394007,0.0002837796,0.00052370515,0.00021547593,0.0019479678,0.00023670829,0.0000037800003],"category_scores_gemma":[0.0003618851,0.00025272,0.0000881949,0.0022651874,0.00063141977,0.0007012666,0.00010585602,0.00021660503,0.000052299925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001970442,0.0002097308,0.009782619,0.0006556847,0.0001642974,0.0002666332,0.0011129561,0.0012066176,0.68222773,0.26416475,0.0024848145,0.037527107],"study_design_scores_gemma":[0.0056080464,0.0005494698,0.0005283185,0.00012839634,0.000058613117,0.00005692528,0.00035715077,0.96601564,0.020949945,0.00011041635,0.0050948407,0.0005422178],"about_ca_topic_score_codex":0.0000125661645,"about_ca_topic_score_gemma":0.0000055314713,"teacher_disagreement_score":0.96480906,"about_ca_system_score_codex":0.00015522308,"about_ca_system_score_gemma":0.0004125947,"threshold_uncertainty_score":0.9999925},"labels":[],"label_agreement":null},{"id":"W3033674955","doi":"10.6084/m9.figshare.c.4246046.v2","title":"Supplementary material from \"Multiscale entropy rate analysis of complex mobile agents\"","year":2018,"lang":"en","type":"article","venue":"Figshare","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Entropy (arrow of time); Computer science; Mathematics; Physics; Thermodynamics","score_opus":0.04015593850634782,"score_gpt":0.2824739712589612,"score_spread":0.24231803275261335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3033674955","genre_codex":"dataset","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040901303,0.000013634297,0.0019315284,0.00005424806,0.00033047327,0.00044965322,0.95607126,0.00009558886,0.0001523006],"genre_scores_gemma":[0.6544982,3.5279803e-7,0.0008615748,0.00012105806,0.00017702211,0.00013613782,0.34415832,0.000008901176,0.000038375438],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812365,0.0001698551,0.0004900034,0.0005123717,0.00034377168,0.00036037623],"domain_scores_gemma":[0.9983476,0.00011757677,0.00030381093,0.0008953332,0.0002072642,0.00012843306],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00008548924,0.00020274936,0.00045003442,0.00018262815,0.00009405559,0.00017409836,0.0012797437,0.00006812813,0.40762317],"category_scores_gemma":[0.000069499314,0.00019604285,0.00021564745,0.0007173282,0.00001890932,0.00024270131,0.00047605453,0.00005506524,0.000737159],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059790407,0.00026801965,0.0024754358,0.00005808984,0.0021993879,0.000044110773,0.0008160758,0.00055335433,0.024536714,0.000111376015,0.9660241,0.0028535489],"study_design_scores_gemma":[0.001965591,0.00022631351,0.09460703,0.00022119463,0.00038242596,0.0000013523702,0.000079268786,0.508433,0.03143178,0.000043891938,0.36204016,0.0005679878],"about_ca_topic_score_codex":0.00070897664,"about_ca_topic_score_gemma":0.00019959468,"teacher_disagreement_score":0.6135969,"about_ca_system_score_codex":0.000066364024,"about_ca_system_score_gemma":0.000035245725,"threshold_uncertainty_score":0.9474934},"labels":[],"label_agreement":null},{"id":"W3035330354","doi":"10.1016/j.jfranklin.2020.05.018","title":"Distributed hunting problem of multi-quadrotor systems via bearing constraint method subject to time delays","year":2020,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Defense Basic Scientific Research Program of China; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Computer science; Bearing (navigation); Control theory (sociology); Observer (physics); Lipschitz continuity; Protocol (science); Artificial intelligence; Engineering; Mathematics; Control (management)","score_opus":0.027387218059469004,"score_gpt":0.26487356044523885,"score_spread":0.23748634238576985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035330354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012860673,0.00021106143,0.9820788,0.0018235758,0.0015356137,0.0012109588,0.000088312925,0.00007013924,0.00012088637],"genre_scores_gemma":[0.8648442,0.0000023153782,0.13449864,0.0002291149,0.0003451305,0.00002653318,0.0000033380988,0.000020489962,0.00003026067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625415,0.00043599092,0.001653904,0.00036547924,0.00084254565,0.00044795676],"domain_scores_gemma":[0.9966096,0.00021367164,0.0015964508,0.0005770091,0.0006289524,0.00037431697],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021034637,0.00030088102,0.0008574664,0.00014969209,0.0001946636,0.0002482352,0.0026524798,0.00013398264,0.0000058233895],"category_scores_gemma":[0.0006241665,0.00021937347,0.00043961938,0.0009507529,0.00009076948,0.0007178566,0.0005284641,0.0005377756,0.00004663336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026131747,0.00046957622,0.0047679567,0.0007238907,0.001516161,0.00030818066,0.0035024448,0.5981434,0.35685346,0.0065159993,0.0013096503,0.025627956],"study_design_scores_gemma":[0.0036488513,0.00036313402,0.0017424026,0.0011333185,0.00019052625,0.00059202337,0.00013160262,0.9605399,0.014534727,0.00007350575,0.016500056,0.00054996135],"about_ca_topic_score_codex":0.00018490807,"about_ca_topic_score_gemma":0.000008277733,"teacher_disagreement_score":0.8519835,"about_ca_system_score_codex":0.00017262399,"about_ca_system_score_gemma":0.0003207247,"threshold_uncertainty_score":0.89457905},"labels":[],"label_agreement":null},{"id":"W3038166928","doi":"10.1002/rnc.5090","title":"Robust and nonfragile consensus of positive multiagent systems via observer‐based output‐feedback protocols","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":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China; Glaucoma Research Foundation","keywords":"Semidefinite programming; Control theory (sociology); Observer (physics); Multi-agent system; Computer science; Consensus; Full state feedback; Linear matrix inequality; Graph; Output feedback; Linear programming; Linear system; Graph theory; Controller (irrigation); State (computer science); Mathematical optimization; Mathematics; Control (management); Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.04764029167520396,"score_gpt":0.26410738753345775,"score_spread":0.2164670958582538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038166928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04155339,0.00064743636,0.9449995,0.0076696835,0.0008841746,0.0037346822,0.00039376938,0.000040233175,0.00007712256],"genre_scores_gemma":[0.985917,0.000008631548,0.012948052,0.0004927224,0.00050393277,0.0000820623,0.000010037292,0.000015936239,0.000021630776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974809,0.0002228061,0.0010029054,0.00030584162,0.00076437247,0.00022314308],"domain_scores_gemma":[0.9966169,0.00037190018,0.0010628805,0.00017876634,0.0014736226,0.00029595412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005535371,0.0002376071,0.0005967348,0.00014952658,0.000055109304,0.0002559902,0.0007770886,0.00010067298,0.000006664412],"category_scores_gemma":[0.00027050872,0.00020172911,0.00016979258,0.00013064552,0.000097130425,0.00030425083,0.00011608365,0.00025245766,0.000004932276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009238676,0.0026047335,0.060012847,0.0010337882,0.0065601435,0.0035889293,0.003389618,0.80210894,0.059454717,0.0038086982,0.0054752994,0.042723604],"study_design_scores_gemma":[0.009620012,0.00050199596,0.0046784803,0.00036545808,0.000055918,0.0002103512,0.00008322659,0.9819167,0.00068663125,0.000008310268,0.0016738863,0.00019902024],"about_ca_topic_score_codex":0.00006358865,"about_ca_topic_score_gemma":0.0000045148195,"teacher_disagreement_score":0.9443636,"about_ca_system_score_codex":0.00006547484,"about_ca_system_score_gemma":0.00018604359,"threshold_uncertainty_score":0.8226275},"labels":[],"label_agreement":null},{"id":"W3041924304","doi":"10.1016/j.isatra.2020.07.005","title":"Distributed adaptive fault-tolerant close formation flight control of multiple trailing fixed-wing UAVs","year":2020,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"State Key Laboratory of Synthetical Automation for Process Industries; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Wake; Actuator; Flight control surfaces; Trailing edge; Computer science; Wing; Bounded function; Fault tolerance; Fixed wing; Engineering; Aerospace engineering; Control (management); Aerodynamics; Mathematics; Artificial intelligence; Distributed computing; Structural engineering","score_opus":0.024865543813465986,"score_gpt":0.22452103868434728,"score_spread":0.1996554948708813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041924304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00727983,0.00012302161,0.98766506,0.0022830854,0.00037507963,0.00070669875,0.0010501919,0.00036607267,0.00015095226],"genre_scores_gemma":[0.9958314,0.00000582281,0.003741636,0.00017935883,0.00007510692,0.0000802043,0.00005838042,0.000016823697,0.000011282989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997789,0.00017055614,0.0007518676,0.00044578497,0.0004351483,0.00040761995],"domain_scores_gemma":[0.9985438,0.000300799,0.0002689779,0.00041378298,0.00023295138,0.00023966217],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020444997,0.00025970352,0.00045653232,0.000097562974,0.00025258807,0.00010935276,0.000634761,0.00012428986,0.000019649535],"category_scores_gemma":[0.00006853894,0.00025805185,0.000294807,0.00062381127,0.000054974556,0.0012480763,0.000012952759,0.00027072406,0.000052073767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090131833,0.0014669304,0.00043197087,0.0005641275,0.0014813705,0.0001564882,0.032274373,0.5675488,0.3150351,0.012584417,0.0007881763,0.066766925],"study_design_scores_gemma":[0.0034380134,0.00012936778,0.00043941574,0.0000678273,0.000079743426,0.000018198383,0.0005480156,0.97680604,0.014755158,0.0000357428,0.0034034606,0.00027899691],"about_ca_topic_score_codex":0.00008052267,"about_ca_topic_score_gemma":0.000051655832,"teacher_disagreement_score":0.98855156,"about_ca_system_score_codex":0.00007802324,"about_ca_system_score_gemma":0.00007955252,"threshold_uncertainty_score":0.9999872},"labels":[],"label_agreement":null},{"id":"W3041951962","doi":"10.1142/s0218126621300051","title":"Distributed Neural Observer-Based Formation Strategy of Non-Affine Nonlinear Multi-Agent Systems with Unknown Dynamics","year":2020,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Nonlinear system; Artificial neural network; Computer science; State observer; Chaotic; Artificial intelligence; Control (management)","score_opus":0.029892862337541914,"score_gpt":0.2305346468607039,"score_spread":0.200641784523162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041951962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115868665,0.00062342617,0.8812436,0.00036617916,0.001084745,0.0006067877,0.0001324941,0.000057774974,0.00001632839],"genre_scores_gemma":[0.99804413,0.000009874061,0.0015327516,0.000065002845,0.0002555565,0.000008927296,0.000052810276,0.000023261735,0.000007683533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99647325,0.00026719985,0.0016369555,0.00036361627,0.0008504245,0.00040853114],"domain_scores_gemma":[0.99608046,0.00014722976,0.0020436926,0.00040131656,0.0008783788,0.00044889844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056240987,0.00037983147,0.0010206416,0.00019219666,0.00011135299,0.0005263072,0.0010121522,0.0001307129,5.7029183e-7],"category_scores_gemma":[0.000033323737,0.00029640333,0.00019577639,0.00063447456,0.000060743027,0.0010022754,0.00009349428,0.0003028472,0.0000022441668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009553321,0.0003366005,0.00261878,0.0016628545,0.00040683913,0.00029878746,0.0005981189,0.9784908,0.0018903665,0.0016340944,0.0004709321,0.0114962505],"study_design_scores_gemma":[0.0040535717,0.0010264295,0.0035382397,0.000650342,0.00006733587,0.00035119845,0.00033656042,0.98915637,0.0000790564,9.975074e-7,0.00044110816,0.00029879113],"about_ca_topic_score_codex":0.00010000531,"about_ca_topic_score_gemma":0.00001073335,"teacher_disagreement_score":0.88217545,"about_ca_system_score_codex":0.00020121933,"about_ca_system_score_gemma":0.00022994971,"threshold_uncertainty_score":0.9999488},"labels":[],"label_agreement":null},{"id":"W3042574210","doi":"10.1016/j.dam.2020.04.027","title":"Optimal online and offline algorithms for robot-assisted restoration of barrier coverage","year":2020,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; Carleton University; Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Competitive analysis; Algorithm; Online algorithm; Trajectory; Mobile robot; Position (finance); Upper and lower bounds; Computer science; Mathematics; Artificial intelligence","score_opus":0.03960009337925794,"score_gpt":0.2735784604253882,"score_spread":0.23397836704613026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042574210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008995021,0.00005470398,0.9887501,0.0005988619,0.00006696906,0.0008502569,0.00030001957,0.00011214017,0.00027190236],"genre_scores_gemma":[0.5189889,0.0000055663313,0.48053756,0.00014048234,0.00007318631,0.00006492707,0.00013962194,0.000020012645,0.000029758576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.000016773949,0.0005704291,0.0003494089,0.00029883688,0.00021915487],"domain_scores_gemma":[0.9988146,0.00016639181,0.00034849747,0.00040610073,0.000109680186,0.0001547445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021332977,0.00019892177,0.00042961648,0.0000436304,0.00006789475,0.00009837054,0.0004421658,0.00008632639,0.0000038006074],"category_scores_gemma":[0.00012419777,0.00017955837,0.00007744277,0.00021578807,0.000046375226,0.00017812796,0.00015883162,0.00008621487,0.0000050538574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026097475,0.00085493363,0.000042938802,0.0031572902,0.00054251775,0.000018972982,0.0115781985,0.014978024,0.37397888,0.5407706,0.0025936267,0.05122306],"study_design_scores_gemma":[0.0018458194,0.00014490166,0.00016022261,0.000042936008,0.000054554635,0.0000045076613,0.00028369558,0.9890636,0.0056727026,0.001483062,0.000984448,0.00025951394],"about_ca_topic_score_codex":0.0000026334424,"about_ca_topic_score_gemma":0.0000014843084,"teacher_disagreement_score":0.9740856,"about_ca_system_score_codex":0.000023303128,"about_ca_system_score_gemma":0.00004761604,"threshold_uncertainty_score":0.7322178},"labels":[],"label_agreement":null},{"id":"W3043092302","doi":"10.1162/isal_a_00280","title":"Simulations on Herding a Flock of Birds Away from an Aircraft using an Unmanned Aerial Vehicle","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Herding; Flock; Aeronautics; Remotely operated underwater vehicle; Computer science; Aerospace engineering; Marine engineering; Environmental science; Geography; Engineering; Mobile robot; Artificial intelligence; Robot; Ecology; Biology; Forestry","score_opus":0.059227992721084456,"score_gpt":0.2961485199970036,"score_spread":0.23692052727591914,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043092302","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59286886,0.000005020839,0.4057689,0.0005142093,0.00026944015,0.00017525312,0.00005289723,0.0002359895,0.000109449946],"genre_scores_gemma":[0.9897807,1.1537636e-7,0.009387476,0.0004255111,0.00035025884,0.000002816327,0.0000275079,0.000017069415,0.000008545875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998311,0.00018123133,0.00039084005,0.00050136837,0.00035522864,0.00026032396],"domain_scores_gemma":[0.9988006,0.000105158186,0.00013541512,0.0006064859,0.00010264535,0.00024971788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012475724,0.00016441371,0.00027917913,0.00006781639,0.00012756628,0.00018322766,0.0007421461,0.00007959822,0.00005085394],"category_scores_gemma":[0.000068829664,0.00015911086,0.00007370641,0.0004319543,0.000021852784,0.0008511654,0.00013319027,0.000091464586,0.000033015378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000106007545,0.00045288933,0.003505591,0.000017091186,0.00009743638,0.0000207708,0.003251793,0.49440545,0.48760116,0.006485968,0.00014035968,0.003915509],"study_design_scores_gemma":[0.0011150565,0.0002252214,0.0012039976,0.000020056928,0.000012448738,4.7165454e-7,0.000111821195,0.983556,0.013226122,0.00013896229,0.00021081028,0.00017906529],"about_ca_topic_score_codex":0.0009575208,"about_ca_topic_score_gemma":0.000090385176,"teacher_disagreement_score":0.48915052,"about_ca_system_score_codex":0.000054766955,"about_ca_system_score_gemma":0.00007801281,"threshold_uncertainty_score":0.64883524},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02538535915877381,"score_gpt":0.2325033385913612,"score_spread":0.20711797943258742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043172417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01672521,0.00024727648,0.97894883,0.0010270927,0.0012058229,0.00085124315,0.00028566096,0.0003513839,0.00035748215],"genre_scores_gemma":[0.9969451,0.000020509511,0.0021471751,0.00015995912,0.00006322707,0.00006287948,0.000004650135,0.000029154306,0.0005673505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972787,0.0002622531,0.0008293204,0.0005700767,0.0006387173,0.00042093446],"domain_scores_gemma":[0.99806654,0.00025554307,0.00029945176,0.000795816,0.00023236878,0.0003502864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021678003,0.00030213324,0.00049629173,0.00012642797,0.00010275347,0.00012839882,0.00084440265,0.00014959216,0.00003836278],"category_scores_gemma":[0.000023477696,0.00030370828,0.00024271829,0.0005887304,0.00008569605,0.0001256525,0.00000758586,0.00025387082,0.00053189625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021850603,0.0011731456,0.000046055706,0.0003316897,0.0007613314,0.00010851477,0.002911972,0.84893876,0.122766495,0.0020819097,0.008311343,0.012350283],"study_design_scores_gemma":[0.0017347402,0.00034064098,0.00006010188,0.000101124046,0.00009202599,0.000013443416,0.0000806844,0.9399017,0.0532395,0.000015262909,0.0040584845,0.0003622609],"about_ca_topic_score_codex":0.00014569105,"about_ca_topic_score_gemma":0.000009251912,"teacher_disagreement_score":0.9802199,"about_ca_system_score_codex":0.00007990108,"about_ca_system_score_gemma":0.000112005844,"threshold_uncertainty_score":0.9999415},"labels":[],"label_agreement":null},{"id":"W3043491432","doi":"10.1155/2020/2069631","title":"Distance-Based Formation Control for Quadrotors with Collision Avoidance via Lyapunov Barrier Functions","year":2020,"lang":"en","type":"article","venue":"International Journal of Aerospace Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Control theory (sociology); Underactuation; Decoupling (probability); Collision avoidance; Lyapunov function; Collision; Stability (learning theory); Computer science; Lyapunov stability; Control (management); Engineering; Control engineering; Artificial intelligence; Nonlinear system; Physics","score_opus":0.007517407829207486,"score_gpt":0.20284695475795966,"score_spread":0.19532954692875218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043491432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077686347,0.00008667263,0.98630834,0.004255219,0.0011263378,0.00032357112,0.000047129663,0.00007182056,0.000012287148],"genre_scores_gemma":[0.9751273,0.0000019494555,0.02420675,0.00022492537,0.00035970638,0.00003630113,0.000007843953,0.000016133441,0.000019102737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985762,0.000022954267,0.00044562956,0.00016393297,0.00060287624,0.00018839359],"domain_scores_gemma":[0.9983337,0.00019059794,0.0004227665,0.00013535307,0.00074366597,0.00017393993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002495639,0.00016010445,0.00023138702,0.0001175683,0.000057090867,0.00021701212,0.00068475015,0.000045157914,0.0000036628185],"category_scores_gemma":[0.00021709857,0.0001375021,0.00014089727,0.00020204808,0.000012848341,0.0010564561,0.000023288827,0.00016297704,0.0000058061523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038147162,0.000045229575,0.0008971403,0.000039200782,0.00019393461,0.000032564545,0.00028857758,0.9725641,0.021856088,0.0018568793,0.0009251062,0.0009196984],"study_design_scores_gemma":[0.0036318975,0.00027259873,0.00054397935,0.00015439672,0.000020226731,0.000039581286,0.000032334574,0.9783292,0.005256594,0.000010788677,0.011541649,0.00016676124],"about_ca_topic_score_codex":0.0000034453506,"about_ca_topic_score_gemma":0.00000321697,"teacher_disagreement_score":0.96735865,"about_ca_system_score_codex":0.00022144715,"about_ca_system_score_gemma":0.000089958696,"threshold_uncertainty_score":0.5607173},"labels":[],"label_agreement":null},{"id":"W3045264779","doi":"10.1109/jas.2020.1003288","title":"Formation-containment control using dynamic event-triggering mechanism for multi-agent systems","year":2020,"lang":"en","type":"article","venue":"IEEE/CAA Journal of Automatica Sinica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Containment (computer programming); Event (particle physics); Set (abstract data type); Convergence (economics); Distributed computing; Mechanism (biology); Control (management); Holonomic; Multi-agent system; Mobile robot; Robot; Control theory (sociology); Artificial intelligence","score_opus":0.05207191200711912,"score_gpt":0.3045710648764912,"score_spread":0.2524991528693721,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045264779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020503955,0.00035118943,0.9729563,0.002228127,0.0022815957,0.0014423485,0.000057983194,0.00016495776,0.000013516696],"genre_scores_gemma":[0.94441307,0.000014932421,0.05472715,0.00050728285,0.00023487877,0.00004896745,0.0000027489732,0.000037848815,0.000013146207],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99518424,0.0003551249,0.0024923123,0.00039024794,0.0009409648,0.00063708954],"domain_scores_gemma":[0.9955699,0.00043283013,0.002255682,0.00052906014,0.0007207026,0.00049184164],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001437076,0.00039358632,0.0010652845,0.00020813441,0.00024201839,0.0005514862,0.0015230351,0.00015540085,0.000004827065],"category_scores_gemma":[0.0004942002,0.00034708428,0.00055104244,0.00033095197,0.000035968696,0.0013110483,0.00009468133,0.00029906517,0.00003564358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082518137,0.0024389548,0.00013122559,0.004061551,0.0052393884,0.00095509045,0.011467248,0.2516069,0.6387643,0.06552052,0.0051702727,0.013819338],"study_design_scores_gemma":[0.0059505403,0.0004698667,0.000049368802,0.00043058067,0.00017879426,0.00027162384,0.00024849517,0.98897994,0.0023703,0.00016923354,0.0005398551,0.00034138685],"about_ca_topic_score_codex":0.000008759276,"about_ca_topic_score_gemma":0.0000016233521,"teacher_disagreement_score":0.92390907,"about_ca_system_score_codex":0.00058079226,"about_ca_system_score_gemma":0.0003444534,"threshold_uncertainty_score":0.99989814},"labels":[],"label_agreement":null},{"id":"W3045708570","doi":"10.23919/acc45564.2020.9147291","title":"Robust Suboptimal Output Synchronization of Nonlinear Heterogeneous Agents","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Riccati equation; Nonlinear system; Bounded function; Computer science; Synchronization (alternating current); Stability theory; Mathematical optimization; Multi-agent system; Mathematics; Control (management); Partial differential equation","score_opus":0.04808331632145327,"score_gpt":0.23458587862724484,"score_spread":0.18650256230579157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045708570","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012909354,0.00006149047,0.9843029,0.0009668594,0.00023237067,0.0002501904,0.000021444486,0.00023338292,0.0010220093],"genre_scores_gemma":[0.96875226,0.0000035651485,0.030517366,0.00045325735,0.00009856638,0.0000062060926,0.0000258298,0.000011655183,0.0001312685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985837,0.000060250488,0.00038245486,0.00038057042,0.000351537,0.0002414975],"domain_scores_gemma":[0.9990998,0.000028168552,0.00015575941,0.00040157992,0.00015005513,0.00016462785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010086186,0.00014435669,0.00023319584,0.000044049673,0.000042030493,0.00008712546,0.000828502,0.000062607396,0.000053726755],"category_scores_gemma":[0.00006939352,0.00013522619,0.00009080744,0.00035682437,0.000023335098,0.00027859776,0.00021375154,0.000063413456,0.00018676854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000082637445,0.000701608,0.010977992,0.00037659777,0.0004647659,0.00026476316,0.0023413207,0.90292966,0.0061295186,0.009294915,0.013405211,0.053031035],"study_design_scores_gemma":[0.0005621744,0.00010158476,0.0003056208,0.000009762512,0.000008841524,0.000007717412,0.000012313294,0.9943878,0.0026769037,0.000005292177,0.0017860064,0.00013596381],"about_ca_topic_score_codex":0.00003235202,"about_ca_topic_score_gemma":0.0000032983153,"teacher_disagreement_score":0.9558429,"about_ca_system_score_codex":0.000037907434,"about_ca_system_score_gemma":0.00005794533,"threshold_uncertainty_score":0.5514364},"labels":[],"label_agreement":null},{"id":"W3045780627","doi":"10.23919/acc45564.2020.9147221","title":"Dynamic Event-triggered Formation Control for Multi-agent Systems: A Co-design Optimization Approach","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Flexibility (engineering); Computer science; Convergence (economics); Event (particle physics); Multi-agent system; Rate of convergence; Interval (graph theory); Optimization problem; Class (philosophy); Control (management); Mathematical optimization; Control theory (sociology); Distributed computing; Artificial intelligence; Algorithm; Mathematics","score_opus":0.05668252654703898,"score_gpt":0.27474975876901786,"score_spread":0.21806723222197888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045780627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015929882,0.0002066028,0.99259263,0.0008703378,0.00034415338,0.005008519,0.00010452737,0.00067057717,0.00018669023],"genre_scores_gemma":[0.6402532,0.0000058639603,0.3578367,0.00052813336,0.00005408199,0.0009435761,0.00019393087,0.000025916699,0.00015861442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997243,0.00036441715,0.0008219766,0.0006342092,0.0004516749,0.0004847104],"domain_scores_gemma":[0.9983438,0.00016420225,0.0004246755,0.00049895135,0.0003015424,0.0002668123],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007270773,0.00030855165,0.00047756158,0.00011688364,0.00019741047,0.00053520483,0.00093451265,0.00014481801,0.0000059001795],"category_scores_gemma":[0.00017532676,0.00027709123,0.00017965471,0.00039541555,0.000019322479,0.0011618845,0.000056306075,0.00010184167,0.00006388733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006814282,0.00014155294,0.000008323614,0.00019373029,0.0000899833,0.0000022484778,0.00045220595,0.99048305,0.0009011771,0.004450727,0.0024826864,0.0007261882],"study_design_scores_gemma":[0.005764442,0.00016417015,0.000014657678,0.000023146962,0.000036253805,0.000007772913,0.00021466566,0.9929584,0.00013939857,0.000008504348,0.0003548904,0.00031365466],"about_ca_topic_score_codex":0.000021090469,"about_ca_topic_score_gemma":8.334338e-7,"teacher_disagreement_score":0.6402373,"about_ca_system_score_codex":0.0002436823,"about_ca_system_score_gemma":0.00010337835,"threshold_uncertainty_score":0.9999681},"labels":[],"label_agreement":null},{"id":"W3045829962","doi":"10.23919/acc45564.2020.9147933","title":"Distributed Consensus Protocols for Time-Varying Multi-Agent Networks with Improved Convergence Properties","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Convergence (economics); Network topology; Computer science; Topology (electrical circuits); Multi-agent system; Consensus; Eigenvalues and eigenvectors; Stability (learning theory); Control theory (sociology); Distributed computing; Control (management); Mathematics; Computer network; Artificial intelligence","score_opus":0.04929825750033854,"score_gpt":0.2557485990593181,"score_spread":0.2064503415589796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045829962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006202037,0.000055952692,0.967812,0.002650859,0.00014493396,0.027691824,0.00009563998,0.00085774413,0.000070832015],"genre_scores_gemma":[0.90508604,0.0000011374194,0.06901613,0.0012505174,0.00017709137,0.023796016,0.000086228334,0.00005501092,0.000531839],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997167,0.00012683503,0.0006430531,0.000946365,0.00033874062,0.000778041],"domain_scores_gemma":[0.997974,0.00013528096,0.00031374505,0.0007051286,0.00045095553,0.0004209144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030885026,0.00041913742,0.00053736387,0.000037494236,0.00025648947,0.0004287438,0.0012538616,0.00012406404,0.00002347168],"category_scores_gemma":[0.00020878567,0.00030449647,0.00014089361,0.00049379055,0.00010672564,0.0003229095,0.00027615315,0.00018750252,0.000086870736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008198433,0.0033926775,0.014370689,0.0036277256,0.0036625788,0.0005518991,0.005898353,0.2992072,0.5313582,0.015500537,0.083820894,0.030410819],"study_design_scores_gemma":[0.0039770547,0.0004675631,0.0001242238,0.00009797977,0.000022297561,0.000015511028,0.000043540666,0.98140574,0.0080001205,0.0000040565114,0.0053520068,0.0004898817],"about_ca_topic_score_codex":0.000048061127,"about_ca_topic_score_gemma":0.000007363913,"teacher_disagreement_score":0.90446585,"about_ca_system_score_codex":0.000092459464,"about_ca_system_score_gemma":0.00021450357,"threshold_uncertainty_score":0.9999407},"labels":[],"label_agreement":null},{"id":"W3047684850","doi":"10.1109/tac.2020.3014316","title":"Resource-Aware Exact Decentralized Optimization Using Event-Triggered Broadcasting","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematical optimization; Optimization problem; Convex optimization; Upper and lower bounds; Leverage (statistics); Convergence (economics); Computer science; Iterated function; Convex function; Computation; Mathematics; Augmented Lagrangian method; Regular polygon; Algorithm","score_opus":0.02882566723098209,"score_gpt":0.2561294497542897,"score_spread":0.2273037825233076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3047684850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027141313,0.00006309292,0.9921888,0.0020136598,0.00053312746,0.0011528418,0.00006960975,0.0012050994,0.00005963127],"genre_scores_gemma":[0.9825078,0.0000039271995,0.016234715,0.0010279409,0.00006680126,0.00008086074,0.0000063822304,0.000041948737,0.000029586117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966976,0.000470224,0.000894737,0.00067358534,0.0006548002,0.00060904777],"domain_scores_gemma":[0.9980274,0.00040106196,0.00038806748,0.0006483004,0.00014129971,0.00039389965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003438557,0.00038840642,0.0006003034,0.0001901377,0.0003918726,0.00039598174,0.0008132696,0.00014977112,0.00018595741],"category_scores_gemma":[0.000073793344,0.00039337287,0.0003105956,0.00086235144,0.00003731797,0.0006019761,0.00000474402,0.00023976676,0.00010214219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051048057,0.00013408439,0.000009559815,0.000054063792,0.00016355608,0.000026946356,0.00049497635,0.96182925,0.0020452791,0.000036969705,0.000119453594,0.035034828],"study_design_scores_gemma":[0.0049832757,0.00010911911,0.000023810815,0.00013519416,0.00012850882,0.00002094214,0.00008233901,0.9929395,0.0009339132,0.000009620171,0.00027082465,0.00036297835],"about_ca_topic_score_codex":0.00004089092,"about_ca_topic_score_gemma":0.000003691185,"teacher_disagreement_score":0.9797937,"about_ca_system_score_codex":0.00024444042,"about_ca_system_score_gemma":0.0001741793,"threshold_uncertainty_score":0.9998518},"labels":[],"label_agreement":null},{"id":"W3080775155","doi":"10.1177/1077546320948347","title":"Finite-time consensus of heterogeneous unknown nonlinear multi-agent systems with external disturbances via event-triggered control","year":2020,"lang":"en","type":"article","venue":"Journal of Vibration and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Nonlinear system; Multi-agent system; Lyapunov function; Consensus; Computer science; Lyapunov stability; Artificial neural network; Position (finance); Mathematics; Topology (electrical circuits); Control (management); Artificial intelligence","score_opus":0.012129072202857541,"score_gpt":0.22013702142275862,"score_spread":0.20800794921990107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080775155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024847224,0.0027686497,0.9696856,0.0015824226,0.00037476912,0.0006103807,0.00008029464,0.000039007627,0.000011647017],"genre_scores_gemma":[0.99590594,0.00001964949,0.0031625312,0.0005851854,0.00026629388,0.000013112425,0.0000031828074,0.000016122194,0.000027984488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706393,0.0004129644,0.0012673836,0.0003126994,0.00065946253,0.0002835442],"domain_scores_gemma":[0.996754,0.0003630018,0.0016568167,0.00025856306,0.00060314074,0.0003645167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047534273,0.00028532266,0.00087716355,0.000116216856,0.00010157338,0.0002660085,0.0005206947,0.00009721719,0.000009698444],"category_scores_gemma":[0.00016053615,0.00020858175,0.000202077,0.0002198864,0.000086439606,0.0003785766,0.000032728298,0.00021269848,0.000011402594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00790939,0.0018438873,0.014231468,0.00065198774,0.0038384413,0.0016226573,0.002482703,0.5334794,0.40834528,0.0015578675,0.00071063876,0.02332631],"study_design_scores_gemma":[0.0127927195,0.0011522664,0.0008661349,0.00015554615,0.0001347984,0.00022079717,0.000039115563,0.9824101,0.0015145532,0.000010231839,0.00048097936,0.00022278365],"about_ca_topic_score_codex":0.000019534486,"about_ca_topic_score_gemma":0.0000044522785,"teacher_disagreement_score":0.9710587,"about_ca_system_score_codex":0.000044841374,"about_ca_system_score_gemma":0.0001782417,"threshold_uncertainty_score":0.8505717},"labels":[],"label_agreement":null},{"id":"W3085629799","doi":"10.1109/jsyst.2020.3019169","title":"Guaranteed Performance Design for Formation Tracking and Collision Avoidance of Multiple USVs With Disturbances and Unmodeled Dynamics","year":2020,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Sultan Qaboos University","keywords":"Control theory (sociology); Trajectory; Parametric statistics; Computer science; Artificial neural network; Controller (irrigation); Collision avoidance; Lyapunov function; Underactuation; Vehicle dynamics; Engineering; Collision; Control engineering; Artificial intelligence; Control (management); Mathematics","score_opus":0.03663386510515897,"score_gpt":0.22068687121389577,"score_spread":0.1840530061087368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3085629799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32141808,0.00065552647,0.6769643,0.00011056348,0.00023250544,0.0005628109,0.000022980368,0.000026770469,0.000006468182],"genre_scores_gemma":[0.9918969,0.000055913497,0.00786186,0.000022374077,0.000109392495,0.00003214866,0.0000024004041,0.000012132791,0.00000687895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984439,0.00014008317,0.000578323,0.00024728104,0.00034254696,0.00024788734],"domain_scores_gemma":[0.9985429,0.0002163911,0.0006571841,0.00015182588,0.00029468487,0.00013698358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068455905,0.00017752896,0.00040227434,0.00007017729,0.00026390515,0.00034808205,0.0003350916,0.0000611438,8.080864e-8],"category_scores_gemma":[0.00006812121,0.00013455286,0.000035529265,0.00020209591,0.000045109056,0.0012640222,0.000024025307,0.0001412275,4.8677265e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015590615,0.00012228433,0.025312167,0.003182598,0.00028394585,0.000045421348,0.009120725,0.9104485,0.028830323,0.0017433448,0.00046254537,0.018889066],"study_design_scores_gemma":[0.0023394339,0.00049004226,0.0008669402,0.00045546383,0.000019979374,0.0003848121,0.00021469196,0.9934172,0.0015433879,0.0000143421485,0.000091128124,0.0001625969],"about_ca_topic_score_codex":0.000012894768,"about_ca_topic_score_gemma":0.000008342292,"teacher_disagreement_score":0.6704788,"about_ca_system_score_codex":0.00007399895,"about_ca_system_score_gemma":0.000053996184,"threshold_uncertainty_score":0.5486906},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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)","score_opus":0.021180777289537454,"score_gpt":0.24303742717034063,"score_spread":0.22185664988080317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089274412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026354296,0.0011246548,0.9650003,0.0058464645,0.0010063313,0.0004556419,0.00017303624,0.000023498273,0.000015819347],"genre_scores_gemma":[0.990978,0.00003365197,0.0074149077,0.00057522784,0.0009233633,0.000012311908,0.000021513724,0.000016552025,0.000024441586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980478,0.00008952655,0.00077340583,0.00023387946,0.0006682938,0.00018703996],"domain_scores_gemma":[0.99659705,0.00017508231,0.0009235146,0.00014780519,0.0019675274,0.00018902076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003480556,0.00018224306,0.00044528212,0.00013370498,0.00005970846,0.00024615185,0.0008697461,0.00007360017,0.0000045314832],"category_scores_gemma":[0.00015656094,0.000144795,0.0001379853,0.00016612413,0.000029647652,0.00037368116,0.000060710987,0.00012282302,0.0000044282633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005883427,0.0008747093,0.014215575,0.0007092754,0.0052491375,0.0008453642,0.003680319,0.90577143,0.008307681,0.002480285,0.0029897445,0.04899303],"study_design_scores_gemma":[0.007029114,0.0005192637,0.00033427303,0.00017953952,0.00010191822,0.000251625,0.00009355018,0.9860659,0.00014938408,0.000008902505,0.005102998,0.0001635373],"about_ca_topic_score_codex":0.000028181315,"about_ca_topic_score_gemma":0.000011846708,"teacher_disagreement_score":0.96462375,"about_ca_system_score_codex":0.00008346926,"about_ca_system_score_gemma":0.00026230954,"threshold_uncertainty_score":0.5904569},"labels":[],"label_agreement":null},{"id":"W3092179424","doi":"10.1109/icuas48674.2020.9214055","title":"Distributed algorithm for the navigation of a swarm of nano-quadrotors in cluttered environments","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Swarm behaviour; Collision avoidance; Computer science; Position (finance); Swarm robotics; Obstacle avoidance; Robot; Obstacle; Cohesion (chemistry); Feature (linguistics); Distributed computing; Simple (philosophy); Flocking (texture); Artificial intelligence; Algorithm; Control theory (sociology); Collision; Mobile robot; Control (management); Computer security","score_opus":0.020678855249109708,"score_gpt":0.2382802113265129,"score_spread":0.2176013560774032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092179424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011755212,0.000045011966,0.9856774,0.001099288,0.000100598816,0.0010472607,0.00022095743,0.000026444159,0.000027807677],"genre_scores_gemma":[0.98820555,0.0000026284595,0.011462323,0.00009998986,0.000022574597,0.000118918295,0.0000628504,0.0000062801923,0.00001889895],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986941,0.0000671878,0.0005019358,0.00025989034,0.0002872444,0.00018964929],"domain_scores_gemma":[0.9991152,0.0001961031,0.00025649788,0.0003410503,0.000032811222,0.000058336176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002642975,0.00011438677,0.00024166169,0.000029053661,0.000029452214,0.000022130118,0.0007727261,0.000052175255,0.0000048356524],"category_scores_gemma":[0.000040256527,0.00008437119,0.00009625388,0.00033002856,0.000043478038,0.00017996263,0.00012877933,0.00005641631,0.000006187625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030360953,0.0019120971,0.01863022,0.0006929621,0.0009162275,0.000028942433,0.009502113,0.018292874,0.33808732,0.03372635,0.005195111,0.5727122],"study_design_scores_gemma":[0.0020106647,0.00014792674,0.0039215875,0.000037068963,0.00001430555,0.0000011163843,0.0001521991,0.923267,0.06713703,0.0001449701,0.0030383242,0.00012780319],"about_ca_topic_score_codex":0.00011164426,"about_ca_topic_score_gemma":0.0000027035344,"teacher_disagreement_score":0.9764503,"about_ca_system_score_codex":0.00004492282,"about_ca_system_score_gemma":0.000027667427,"threshold_uncertainty_score":0.34405574},"labels":[],"label_agreement":null},{"id":"W3092800917","doi":"10.1109/tsp.2021.3104981","title":"Multi-Agent Estimation and Filtering for Minimizing Team Mean-Squared Error","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Minimum mean square error; Mean squared error; Kalman filter; Mathematics; Computer science; Estimation; Mathematical optimization; Algorithm; Statistics; Control theory (sociology); Estimator; Control (management); Artificial intelligence","score_opus":0.04673251531580367,"score_gpt":0.28987971798365963,"score_spread":0.24314720266785597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3092800917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038212175,0.0002346646,0.99459517,0.00027572358,0.00035624288,0.0003886676,0.000031133375,0.0002568189,0.000040335046],"genre_scores_gemma":[0.80598617,0.0000029256269,0.1935707,0.00010059979,0.000031650467,0.00013334102,0.0000059838194,0.000020134079,0.00014850206],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982806,0.00007523531,0.00040777706,0.0005980076,0.00028760414,0.00035078722],"domain_scores_gemma":[0.99906784,0.00016003373,0.00014990986,0.00026649513,0.00022262958,0.00013307248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027156685,0.00022725221,0.00026079256,0.00013881882,0.0005306824,0.00052679126,0.00026079215,0.00009190346,0.000007635123],"category_scores_gemma":[0.000014489913,0.0002401964,0.00010993791,0.00033527648,0.00003346725,0.00084725826,0.0000049614773,0.00016293999,0.000009659045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005335668,0.00036414887,0.000007096343,0.00045924573,0.0000840149,0.000022976234,0.002861717,0.1301844,0.15981261,0.000044623517,0.000051955616,0.70605385],"study_design_scores_gemma":[0.0012663268,0.000057980174,0.000030155219,0.00026647534,0.00003855261,0.000042114985,0.00028526923,0.9182182,0.07930088,0.000046300753,0.00020168263,0.00024608057],"about_ca_topic_score_codex":0.000008506702,"about_ca_topic_score_gemma":0.000016632195,"teacher_disagreement_score":0.802165,"about_ca_system_score_codex":0.00011105981,"about_ca_system_score_gemma":0.0001490419,"threshold_uncertainty_score":0.9794925},"labels":[],"label_agreement":null},{"id":"W3095352644","doi":"10.1155/2020/4723687","title":"Collision Avoidance of 3D Rectangular Planes by Multiple Cooperating Autonomous Agents","year":2020,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lyapunov function; Control theory (sociology); Collision avoidance; Traverse; Workspace; Equilibrium point; Position (finance); Computer science; Ordinary differential equation; Point (geometry); Robot; Collision; Mathematics; Differential equation; Artificial intelligence; Control (management); Geometry; Physics; Mathematical analysis","score_opus":0.012546841149335138,"score_gpt":0.23285552164348858,"score_spread":0.22030868049415345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3095352644","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5168811,0.00050227507,0.48152864,0.00040259174,0.0003629703,0.00020089289,0.00007282866,0.00003381103,0.000014896802],"genre_scores_gemma":[0.9651326,0.000044834593,0.034576327,0.00011956534,0.000060834296,0.0000037692273,0.000041097046,0.0000109332295,0.000010058431],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982075,0.00006795527,0.0009056247,0.00020533231,0.00044807323,0.00016551217],"domain_scores_gemma":[0.9983019,0.00011055238,0.00096588087,0.00014776988,0.0003419908,0.00013191238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021667096,0.00014180302,0.00035998845,0.0000568255,0.00006403774,0.000037673813,0.0004387276,0.0000565423,0.0000045563233],"category_scores_gemma":[0.00013490017,0.00013263807,0.00009332236,0.0003248205,0.00001862822,0.0008845001,0.00000501064,0.00016151732,0.0000029575324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029962472,0.00016338048,0.0043870974,0.00014921626,0.000098180746,0.00012773795,0.0064204712,0.536439,0.43426856,0.00024225787,0.00068133423,0.016723147],"study_design_scores_gemma":[0.023423688,0.0034080707,0.10830868,0.0014251784,0.00024042,0.0000855546,0.0022548707,0.485983,0.3449532,0.00016045354,0.0283228,0.0014340406],"about_ca_topic_score_codex":0.000010246365,"about_ca_topic_score_gemma":0.000010068124,"teacher_disagreement_score":0.4482515,"about_ca_system_score_codex":0.000047137455,"about_ca_system_score_gemma":0.0000779017,"threshold_uncertainty_score":0.54088235},"labels":[],"label_agreement":null},{"id":"W3097637184","doi":"10.1109/tnse.2020.3035964","title":"A Graph-Theoretic Equilibrium Analysis of Attacker-Defender Game on Consensus Dynamics Under $\\mathcal {H}_2$ Performance Metric","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Notation; Network topology; Norm (philosophy); Metric (unit); Discrete mathematics; Game theory; Graph; Computer science; Theoretical computer science; Graph theory; Mathematics; Combinatorics; Mathematical economics; Computer network; Engineering; Arithmetic","score_opus":0.017663726207209733,"score_gpt":0.21923280397010578,"score_spread":0.20156907776289604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097637184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22384003,0.000058014877,0.77501565,0.00031247028,0.00040559866,0.00013357376,0.000014621191,0.0001383647,0.00008166755],"genre_scores_gemma":[0.9981845,0.000027905018,0.0015577596,0.000161747,0.00003231439,0.000014001421,0.0000013587094,0.000012003914,0.000008385559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784505,0.000033006676,0.00036744095,0.0005628702,0.0006682851,0.0005233341],"domain_scores_gemma":[0.9988339,0.00022872393,0.00009470134,0.0004394536,0.00013409117,0.0002691249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327612,0.00022647528,0.0003813544,0.0007133517,0.0001402904,0.00014544796,0.0006467962,0.00007070309,0.00000469254],"category_scores_gemma":[0.000022450504,0.0002158874,0.00014633329,0.008574026,0.00020984093,0.0002855924,0.000010685375,0.00024845378,0.0000075152952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014151244,0.00002813121,0.0000743117,0.000027370465,0.00014195403,0.0000031259679,0.00013292024,0.9926276,0.00071484287,0.004129578,0.00001102448,0.0020949761],"study_design_scores_gemma":[0.0002781076,0.00015786439,0.0016356565,0.000037667767,0.000145557,0.0000048251727,0.000030657306,0.99694484,0.00050916494,0.000020928303,0.000019715852,0.00021502149],"about_ca_topic_score_codex":0.000009057151,"about_ca_topic_score_gemma":0.0000036714862,"teacher_disagreement_score":0.7743445,"about_ca_system_score_codex":0.00011642183,"about_ca_system_score_gemma":0.00009076827,"threshold_uncertainty_score":0.8803633},"labels":[],"label_agreement":null},{"id":"W3098788150","doi":"10.1109/lcsys.2020.3037038","title":"Convergence Analysis of a Continuous-Time Distributed Gradient Descent Algorithm","year":2020,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Convergence (economics); Gradient descent; Computer science; Descent (aeronautics); Computation; Rate of convergence; Distributed algorithm; Gradient method; Mathematical optimization; Algorithm; Stochastic gradient descent; Nonlinear conjugate gradient method; Mathematics; Distributed computing; Artificial intelligence; Artificial neural network; Key (lock); Engineering","score_opus":0.010932280381030172,"score_gpt":0.20260620276703156,"score_spread":0.1916739223860014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098788150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033039827,0.0003435314,0.95812994,0.0040794113,0.0015347706,0.0012978332,0.0011336221,0.0004137759,0.000027276887],"genre_scores_gemma":[0.9973714,0.0000044015583,0.0005016762,0.0015846214,0.00023478853,0.00015148692,0.000099539655,0.000028249748,0.000023875858],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947866,0.0006645475,0.0015351122,0.0010842457,0.0010571203,0.00087235484],"domain_scores_gemma":[0.99651086,0.00033242366,0.001031066,0.0011561543,0.0003894901,0.0005800213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007210019,0.00052066654,0.0018544472,0.00035220984,0.00012501897,0.0002955878,0.0019888135,0.00014682734,0.000017925175],"category_scores_gemma":[0.0001350884,0.0004982074,0.00073756196,0.0022771463,0.00012885516,0.00044518072,0.00010619502,0.00023635653,0.00019189404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019555507,0.0006161855,0.015638482,0.00041860258,0.02091687,0.00081337144,0.0023820696,0.28974116,0.6244195,0.0023648257,0.034714587,0.0077787926],"study_design_scores_gemma":[0.0029618149,0.00011901792,0.0021978298,0.000060073646,0.00089913013,0.000010480873,0.000046936224,0.98959196,0.0005976373,0.0000011076619,0.0030188626,0.0004951721],"about_ca_topic_score_codex":0.00046467726,"about_ca_topic_score_gemma":0.0000044136586,"teacher_disagreement_score":0.9643315,"about_ca_system_score_codex":0.0002388331,"about_ca_system_score_gemma":0.00008094666,"threshold_uncertainty_score":0.999747},"labels":[],"label_agreement":null},{"id":"W3098888447","doi":"10.1109/tac.2019.2929206","title":"Push-sum on random graphs","year":2017,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Rate of convergence; Convergence of random variables; Mathematics; Random graph; Convergence tests; Computer science; Discrete mathematics; Mathematical optimization; Applied mathematics; Graph; Random variable; Statistics; Telecommunications; Economics","score_opus":0.06290900643233902,"score_gpt":0.1838327829134068,"score_spread":0.12092377648106778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3098888447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36416942,0.00003085584,0.5912754,0.0006399511,0.0017865687,0.0005135553,0.000022330036,0.0004803974,0.041081555],"genre_scores_gemma":[0.9967991,0.000014014487,0.00010630181,0.00010247767,0.000046631474,8.773456e-7,0.0000028264094,0.000009179162,0.002918608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985902,0.00010427579,0.00014062796,0.00067088846,0.00011407413,0.00037997848],"domain_scores_gemma":[0.997307,0.000102611106,0.00023966108,0.002068138,0.000091472146,0.00019112903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002782582,0.0001940875,0.0002449117,0.00013865312,0.00062365533,0.0003544218,0.0027722204,0.00009114323,0.00001905942],"category_scores_gemma":[0.000100811005,0.00020075165,0.00018563533,0.00021313215,0.00011057284,0.00089579745,0.00034826784,0.00015623964,0.0006182547],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121424695,0.00013275266,0.009279779,0.000010504204,0.0000955873,0.00059192703,0.00007907883,0.0037120618,0.0002580724,0.9819967,0.0017602474,0.0019618277],"study_design_scores_gemma":[0.02333312,0.00040700717,0.06517425,0.00017803055,0.00012889436,0.000024236102,0.00013097456,0.81672215,0.0013004999,0.065577276,0.025413038,0.0016104933],"about_ca_topic_score_codex":0.00014200581,"about_ca_topic_score_gemma":0.000036707257,"teacher_disagreement_score":0.91641945,"about_ca_system_score_codex":0.000079046695,"about_ca_system_score_gemma":0.000044260578,"threshold_uncertainty_score":0.8186414},"labels":[],"label_agreement":null},{"id":"W3099972933","doi":"10.3929/ethz-b-000461784","title":"Performance and Design of Consensus on Matrix-Weighted and Time-Scaled Graphs","year":2020,"lang":"en","type":"article","venue":"Repository for Publications and Research Data (ETH Zurich)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Army Research Office; Army Research Laboratory; Air Force Office of Scientific Research; National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Consensus; Uniform consensus; Consensus algorithm; Matrix (chemical analysis); Graph theory; Mathematical optimization; Mathematics; Algorithm; Combinatorics; Artificial intelligence; Multi-agent system","score_opus":0.12523684867198323,"score_gpt":0.342692922188972,"score_spread":0.21745607351698878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099972933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24664804,0.0075182277,0.6684213,0.055483233,0.00042608558,0.011922399,0.00307676,0.00084308867,0.005660835],"genre_scores_gemma":[0.9772484,0.00022774372,0.021402787,0.000042880656,0.00006239839,0.00013997515,0.00017888764,0.00001582427,0.00068115775],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979733,0.00033903774,0.00033489428,0.00065678085,0.0003996294,0.00029632],"domain_scores_gemma":[0.9970461,0.0010583502,0.0001297613,0.0010217413,0.00045655915,0.00028745603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015718065,0.00012008851,0.00021400665,0.00022610753,0.00048193792,0.00040504168,0.00093988795,0.00007801135,0.0000014843432],"category_scores_gemma":[0.00048232224,0.00009954485,0.000019212503,0.00066648185,0.0002602866,0.0005095946,0.0005860022,0.0001740172,0.000003960043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010955108,0.0012806016,0.0149521,0.0025333678,0.00096894614,0.000032839802,0.0024281947,0.00019196548,0.15057291,0.23831378,0.5188688,0.06876098],"study_design_scores_gemma":[0.0012335076,0.0006003735,0.0059452895,0.000053303313,0.000022572902,0.00004872868,0.00005027961,0.95753366,0.0014827035,0.00027927727,0.032552976,0.00019733387],"about_ca_topic_score_codex":0.000022181093,"about_ca_topic_score_gemma":3.2269762e-7,"teacher_disagreement_score":0.9573417,"about_ca_system_score_codex":0.000016427373,"about_ca_system_score_gemma":0.00013137457,"threshold_uncertainty_score":0.40593213},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10295522049147493,"score_gpt":0.32512758337237907,"score_spread":0.22217236288090414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104550706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015003207,0.00032150137,0.9541031,0.0016254982,0.00085125316,0.0026756364,0.000902919,0.0012326684,0.023284217],"genre_scores_gemma":[0.9701797,0.00017177005,0.008386239,0.000068201516,0.00088838267,0.0000064579567,0.0003625656,0.00009417141,0.019842513],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9906027,0.0015392582,0.0005433547,0.0024553523,0.002133576,0.0027258059],"domain_scores_gemma":[0.99146324,0.001080303,0.00044656338,0.0019025448,0.003729825,0.001377536],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0025059835,0.00081089,0.0009845487,0.0023152148,0.003132372,0.0008931706,0.005464726,0.0006210959,0.00009123313],"category_scores_gemma":[0.00028756497,0.000965844,0.00065337704,0.0061772214,0.0015282801,0.0030399219,0.0020948101,0.001173694,0.00027656506],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0075369067,0.005517879,0.003065597,0.0023978397,0.0034881127,0.031341955,0.012577349,0.003127607,0.056612495,0.33733442,0.17215022,0.36484963],"study_design_scores_gemma":[0.0076483404,0.0013687945,0.00022488991,0.0003048029,0.00021803267,0.00009265754,0.007845412,0.20479618,0.007955948,0.00057453493,0.76734674,0.0016236411],"about_ca_topic_score_codex":0.0011771803,"about_ca_topic_score_gemma":0.0004079808,"teacher_disagreement_score":0.9551765,"about_ca_system_score_codex":0.0027283805,"about_ca_system_score_gemma":0.0019045174,"threshold_uncertainty_score":0.9999162},"labels":[],"label_agreement":null},{"id":"W3106330152","doi":"10.1109/iecon43393.2020.9254455","title":"Improving Performance for Multi-Agent Systems using Fuzzy-Logic Tuning and Mixed Feedback Controller","year":2020,"lang":"en","type":"article","venue":"IECON 2020 The 46th Annual Conference of the IEEE Industrial Electronics Society","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Fuzzy logic; Controller (irrigation); Computer science; Synchronization (alternating current); Linear matrix inequality; Nonlinear system; Lyapunov function; Multi-agent system; Stability (learning theory); State (computer science); Lyapunov stability; Fuzzy control system; Full state feedback; Control engineering; Control (management); Engineering; Mathematics; Mathematical optimization; Artificial intelligence; Algorithm","score_opus":0.09533097337301268,"score_gpt":0.2622768654137951,"score_spread":0.16694589204078242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3106330152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5154228,0.0018687345,0.4681324,0.005915095,0.0034684269,0.0045929872,0.00034051022,0.0002140819,0.000044941396],"genre_scores_gemma":[0.9974743,0.00006686271,0.0011900506,0.00049231056,0.00054259395,0.00008908219,0.0000055883784,0.000030466785,0.00010873008],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965016,0.0003976251,0.00089455274,0.000737193,0.00053746684,0.00093150936],"domain_scores_gemma":[0.9971895,0.00034314956,0.0010314367,0.00060630974,0.000599068,0.00023053023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015290395,0.00044580895,0.00076187606,0.000024157356,0.000687923,0.000532326,0.0022788632,0.000357945,0.0000020156274],"category_scores_gemma":[0.0004538852,0.00030254648,0.00042869127,0.0005112396,0.00023264044,0.0006173823,0.00043173527,0.00088994124,0.0000037676314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0029771333,0.00088305527,0.004167383,0.0023043195,0.00584868,0.000012545587,0.049331553,0.17578366,0.54828125,0.051935848,0.035922,0.122552544],"study_design_scores_gemma":[0.0045985724,0.00035834507,0.00004737355,0.000097298565,0.0001208376,0.000013797255,0.0016044329,0.986367,0.0046820794,0.000079367164,0.0016591139,0.00037177262],"about_ca_topic_score_codex":0.0001686218,"about_ca_topic_score_gemma":0.000010270414,"teacher_disagreement_score":0.81058335,"about_ca_system_score_codex":0.00026359237,"about_ca_system_score_gemma":0.0010036584,"threshold_uncertainty_score":0.99994266},"labels":[],"label_agreement":null},{"id":"W3107287005","doi":"10.48550/arxiv.2012.00239","title":"Optimal Distributed Control for Leader-Follower Networks: A Scalable Design","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Optimal control; Mathematical optimization; State (computer science); Riccati equation; Computer science; Function (biology); Focus (optics); Algebraic Riccati equation; Control theory (sociology); Control (management); Mathematics","score_opus":0.09506591087206537,"score_gpt":0.19561826142275204,"score_spread":0.10055235055068668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107287005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010986486,0.00019564695,0.9922968,0.0008003591,0.0015037827,0.0025724547,0.00056642,0.0008294963,0.0001363534],"genre_scores_gemma":[0.9892398,0.000025407879,0.009195303,0.0002738279,0.00030488023,0.00003839011,0.00027183554,0.00005495321,0.00059559866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99554795,0.00044260704,0.00054343726,0.0021991644,0.00020344915,0.0010633825],"domain_scores_gemma":[0.9960687,0.0006138596,0.00060817087,0.0017277194,0.00043861478,0.0005429212],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006365681,0.00073135254,0.0010601664,0.00018231537,0.00030457618,0.0005192813,0.0037875404,0.0006350601,0.000018476389],"category_scores_gemma":[0.00021186884,0.0008520117,0.00070942135,0.0008639114,0.00013248314,0.00055735745,0.0012614944,0.000760513,0.0001228012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028224752,0.00012903665,0.0002464108,0.00008211291,0.0004935579,0.00029599835,0.00005602007,0.96285117,0.00004740836,0.026933076,0.008447931,0.00013504174],"study_design_scores_gemma":[0.0041133985,0.00016948937,0.0001232147,0.00011951675,0.000285402,0.0000051130833,0.000050879786,0.9886848,0.00004599662,0.0027983598,0.002768638,0.00083524425],"about_ca_topic_score_codex":0.0000717001,"about_ca_topic_score_gemma":0.0000072473736,"teacher_disagreement_score":0.9881412,"about_ca_system_score_codex":0.0004855142,"about_ca_system_score_gemma":0.00044485833,"threshold_uncertainty_score":0.99939305},"labels":[],"label_agreement":null},{"id":"W3107446066","doi":"10.1016/j.isatra.2020.11.030","title":"Secure consensus of multi-agent systems with redundant signal and communication interference via distributed dynamic event-triggered control","year":2020,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Southwest University for Nationalities; Natural Sciences and Engineering Research Council of Canada; Scientific Research Foundation of Hunan Provincial Education Department; National Natural Science Foundation of China","keywords":"Computer science; Interference (communication); SIGNAL (programming language); Scheme (mathematics); Transmission (telecommunications); Protocol (science); Deception; Event (particle physics); Distributed computing; Control theory (sociology); Controller (irrigation); Control (management); Computer network; Telecommunications; Artificial intelligence; Mathematics","score_opus":0.016510382752903573,"score_gpt":0.23261883702794586,"score_spread":0.2161084542750423,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107446066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073827566,0.0008104711,0.987597,0.0020928646,0.00014986953,0.000942147,0.0008068674,0.00020445957,0.0000135759665],"genre_scores_gemma":[0.99713975,0.000025194573,0.0025632575,0.00006377226,0.000009127744,0.000102682876,0.000058358266,0.000017302014,0.00002055632],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978699,0.00038632832,0.0006512475,0.00047360628,0.00031243064,0.00030648097],"domain_scores_gemma":[0.9982266,0.00024371072,0.000357848,0.00062564504,0.00028654133,0.00025968594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021969122,0.00027259605,0.00050424144,0.000078998084,0.00020990471,0.00014901368,0.0006759223,0.000110466266,0.000013898841],"category_scores_gemma":[0.000019955336,0.00024311795,0.00010165422,0.00045541837,0.00018987549,0.00024080431,0.000025877096,0.00030325446,0.000012233608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028505009,0.004263396,0.003184187,0.0026155075,0.0063284677,0.00032176072,0.024950027,0.61210966,0.2970023,0.0070932223,0.001074093,0.038206875],"study_design_scores_gemma":[0.0034587223,0.0002582427,0.0009909245,0.00018026833,0.00012702312,0.000060565508,0.0004746469,0.99331665,0.00065175444,0.000016504404,0.00019426802,0.0002704367],"about_ca_topic_score_codex":0.0003391212,"about_ca_topic_score_gemma":0.0001409236,"teacher_disagreement_score":0.989757,"about_ca_system_score_codex":0.00010506513,"about_ca_system_score_gemma":0.00012433305,"threshold_uncertainty_score":0.9914062},"labels":[],"label_agreement":null},{"id":"W3107885531","doi":"10.1126/sciadv.aba3148","title":"Rapid evolution of coordinated and collective movement in response to artificial selection","year":2020,"lang":"en","type":"article","venue":"Science Advances","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Knut och Alice Wallenbergs Stiftelse; Svenska Forskningsrådet Formas","keywords":"Selection (genetic algorithm); Movement (music); Computer science; Cognitive science; Artificial intelligence; Biology; Communication; Neuroscience; Evolutionary biology; Psychology; Physics","score_opus":0.01590260783936504,"score_gpt":0.2607331361356117,"score_spread":0.24483052829624669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107885531","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62092865,0.00027141537,0.3750474,0.0027687436,0.00023298009,0.0005227712,0.000007040106,0.00006309994,0.00015790135],"genre_scores_gemma":[0.9970902,0.0000015905155,0.0027103485,0.00013396256,0.000014201639,0.000026284184,1.8455056e-7,0.0000020500336,0.000021151578],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985731,0.00011797771,0.0002463434,0.0004521972,0.0003648875,0.00024544017],"domain_scores_gemma":[0.99937344,0.00008561116,0.00010430456,0.00012550317,0.00018850392,0.00012261866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009636204,0.00008264747,0.00014829665,0.0002536781,0.00012836895,0.00007565814,0.000438673,0.000019337202,0.0000020618027],"category_scores_gemma":[0.0006944523,0.00008016035,0.000015059794,0.0038982586,0.00014268962,0.0009914623,0.00012080076,0.00005431382,0.0000060790876],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038835075,0.00004757675,0.0031305808,0.000010057289,0.000003009689,0.000002435672,0.0018231149,0.004836313,0.9580624,0.003219495,0.000040774856,0.028435865],"study_design_scores_gemma":[0.0015653989,0.002127272,0.15215018,0.00010070064,0.0000061126084,0.00000429771,0.0018424825,0.39914858,0.43463624,0.0065344702,0.0014090566,0.0004751959],"about_ca_topic_score_codex":0.000040010666,"about_ca_topic_score_gemma":0.000037102243,"teacher_disagreement_score":0.5234262,"about_ca_system_score_codex":0.00031637857,"about_ca_system_score_gemma":0.00035425837,"threshold_uncertainty_score":0.32688442},"labels":[],"label_agreement":null},{"id":"W3110225681","doi":"10.1515/spma-2020-0117","title":"Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]","year":2020,"lang":"en","type":"erratum","venue":"Special Matrices","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; University of Regina","funders":"","keywords":"Spec#; Multiplicity (mathematics); Mathematics; Lemma (botany); Inverse; Eigenvalues and eigenvectors; Combinatorics; Graph; Discrete mathematics; Computer science; Mathematical analysis; Physics; Geometry","score_opus":0.025360225250276272,"score_gpt":0.24885324596245484,"score_spread":0.22349302071217858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110225681","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044200025,0.019462336,0.08821159,0.027518556,0.2818692,0.03412639,0.012070077,0.0027444977,0.5295774],"genre_scores_gemma":[0.12320942,0.016248107,0.14923894,0.014926549,0.21776626,0.01103306,0.00931369,0.001724976,0.456539],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9937837,0.0006449063,0.0015481256,0.0013720896,0.0016340717,0.0010170958],"domain_scores_gemma":[0.99630815,0.0002350963,0.0012418354,0.0015622262,0.00030846096,0.000344224],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010474543,0.00077129866,0.0012675042,0.00096189656,0.0003294766,0.0006718586,0.005378928,0.00057822117,0.00015921044],"category_scores_gemma":[0.00020760011,0.00063549174,0.0005120033,0.0045516253,0.00012885002,0.00070684234,0.0008535652,0.0012430425,0.00089135196],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041004136,0.00029140557,0.00044948762,0.00034125833,0.00009581319,0.00008922177,0.0025466238,0.00027244506,0.000047587062,0.0053391014,0.9896848,0.0008012375],"study_design_scores_gemma":[0.00089843717,0.00028225928,0.0029857026,0.0003596718,0.00013864387,0.000014982222,0.00054897723,0.0029843235,0.000027383228,0.002062078,0.98882955,0.00086798635],"about_ca_topic_score_codex":0.0038687505,"about_ca_topic_score_gemma":0.006696831,"teacher_disagreement_score":0.11878941,"about_ca_system_score_codex":0.00025526792,"about_ca_system_score_gemma":0.0005856754,"threshold_uncertainty_score":0.9998866},"labels":[],"label_agreement":null},{"id":"W3110445582","doi":"10.48550/arxiv.2012.00260","title":"Near-Optimal Control Strategy in Leader-Follower Networks: A Case Study for Linear Quadratic Mean-Field Teams","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Mathematical optimization; Graph; Quadratic equation; State (computer science); Computer science; Mathematics; Function (biology); Convergence (economics); Optimal control; Control (management); Control theory (sociology); Theoretical computer science; Algorithm","score_opus":0.08016830532489101,"score_gpt":0.228582710252549,"score_spread":0.148414404927658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110445582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26953492,0.00009014883,0.7263814,0.00018347499,0.00060130295,0.0027822184,0.000042491003,0.00026061843,0.0001234359],"genre_scores_gemma":[0.99847233,0.000008485313,0.00073247857,0.00021639469,0.00021578807,0.000039561786,0.000023487983,0.000044111923,0.00024736449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99574906,0.00051989476,0.0007116685,0.0019842945,0.00020135674,0.00083373307],"domain_scores_gemma":[0.9966371,0.0006546433,0.0005075119,0.0015826675,0.0002482541,0.00036980424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070143054,0.00067153946,0.0010811774,0.0002278523,0.00024290128,0.00047706033,0.0022459296,0.00049951463,0.000011151343],"category_scores_gemma":[0.00014699795,0.00076321076,0.00045123269,0.0008426765,0.000077061035,0.000539911,0.00091229856,0.0011203398,0.000045089288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023566459,0.00056471396,0.0034740847,0.00009338103,0.0003922724,0.018282175,0.0011952965,0.97162145,0.0000059907497,0.0034131997,0.0002800622,0.00044170883],"study_design_scores_gemma":[0.0059228116,0.00073808373,0.00012300996,0.00009224136,0.0002161,0.000057634934,0.0035309945,0.98814845,0.0000038347557,0.00035580737,0.000105880055,0.00070512574],"about_ca_topic_score_codex":0.0026434842,"about_ca_topic_score_gemma":0.0019426653,"teacher_disagreement_score":0.72893745,"about_ca_system_score_codex":0.00035179307,"about_ca_system_score_gemma":0.0005405761,"threshold_uncertainty_score":0.9994819},"labels":[],"label_agreement":null},{"id":"W3111227127","doi":"10.1007/s10846-020-01269-y","title":"Connectivity Preservation and Obstacle Avoidance in Small Multi-Spacecraft Formation with Distributed Adaptive Tracking Control","year":2020,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"China Scholarship Council","keywords":"Spacecraft; Collision avoidance; Obstacle avoidance; Controller (irrigation); Obstacle; Control theory (sociology); Collision; Computer science; Adaptive control; Lyapunov function; Tracking (education); Lyapunov stability; Control engineering; Engineering; Aerospace engineering; Control (management); Mobile robot; Physics; Artificial intelligence; Geography","score_opus":0.061055639678598304,"score_gpt":0.24236817364331245,"score_spread":0.18131253396471414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111227127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058943883,0.0012206795,0.9371905,0.0012763069,0.00040942474,0.0008860933,0.000016444668,0.00004749815,0.000009202971],"genre_scores_gemma":[0.9959046,0.000022936996,0.0038064257,0.000085864645,0.00012621401,0.00002390122,0.0000046745095,0.000015875914,0.00000950263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997127,0.00051951816,0.0011746475,0.0003371083,0.00047542513,0.00036628745],"domain_scores_gemma":[0.99689454,0.0005118506,0.0013589491,0.00026181087,0.00070834096,0.0002645137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011064562,0.00027465363,0.00072946306,0.00016315367,0.00008690284,0.00038421154,0.0005968725,0.00010581383,0.0000010582767],"category_scores_gemma":[0.00056056253,0.00021994447,0.0000994252,0.0005388986,0.00004120757,0.0018826505,0.00006349828,0.0003760726,0.000006006622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005465968,0.000335113,0.029847631,0.0003617474,0.00029222656,0.00028390568,0.0056274477,0.9530711,0.00340305,0.0032144322,0.000104139915,0.0029125754],"study_design_scores_gemma":[0.0029054033,0.00058430986,0.013835446,0.00069349504,0.000040092043,0.00027748605,0.0016036979,0.97899336,0.0006873739,0.00002639485,0.00011179317,0.00024117874],"about_ca_topic_score_codex":0.00016766517,"about_ca_topic_score_gemma":0.00015226388,"teacher_disagreement_score":0.9369607,"about_ca_system_score_codex":0.00032170437,"about_ca_system_score_gemma":0.000114523114,"threshold_uncertainty_score":0.8969075},"labels":[],"label_agreement":null},{"id":"W3111773089","doi":"10.1109/tcyb.2020.3035713","title":"Hybrid Event-Triggered and Impulsive Control Strategy for Multiagent Systems With Switching Topologies","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Network topology; Control theory (sociology); Multi-agent system; Computer science; Lyapunov function; Control (management); Event (particle physics); Consensus; Topology (electrical circuits); Mathematics; Computer network; Artificial intelligence; Nonlinear system; Physics","score_opus":0.025115473268141623,"score_gpt":0.24780034308270663,"score_spread":0.222684869814565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111773089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016157927,0.00026112585,0.979996,0.0009736978,0.00056442275,0.0014851728,0.00024425532,0.0002777935,0.000039564424],"genre_scores_gemma":[0.9966199,0.000027885768,0.0026360871,0.0002859847,0.00007753603,0.00024524957,0.0000041402654,0.000027653647,0.00007559325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980762,0.00011971338,0.0004410487,0.00060810155,0.000322828,0.00043211787],"domain_scores_gemma":[0.9985965,0.00036994685,0.00019897163,0.00040084007,0.00017430447,0.0002594623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015571622,0.00031343725,0.0004255203,0.000078387646,0.00022963225,0.0003600552,0.0004901899,0.000086395215,0.0000031153459],"category_scores_gemma":[0.000017711123,0.000266632,0.0001131565,0.00016066854,0.00005511883,0.00026490795,0.000003987242,0.0002342319,0.000014767062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005616451,0.00038098058,0.000077193574,0.00029981468,0.0008114122,0.00014231862,0.0017750955,0.93267936,0.0067387833,0.004674451,0.00055329397,0.051305663],"study_design_scores_gemma":[0.0046274792,0.0011568883,0.00009521648,0.00007009134,0.000121835525,0.000050862538,0.00042952911,0.9873221,0.00505842,0.000095627394,0.00055333646,0.000418592],"about_ca_topic_score_codex":0.00012586686,"about_ca_topic_score_gemma":0.000025792033,"teacher_disagreement_score":0.98046196,"about_ca_system_score_codex":0.00007629702,"about_ca_system_score_gemma":0.00009252919,"threshold_uncertainty_score":0.9999786},"labels":[],"label_agreement":null},{"id":"W3112122514","doi":"10.1109/tcyb.2020.3035557","title":"Fault-Tolerant Cooperative Control for Multiple Vehicle Systems Based on Topology Reconfiguration","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Fundamental Research Funds for the Central Universities; Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Control reconfiguration; Fault tolerance; Synchronization (alternating current); Computer science; Topology (electrical circuits); Control theory (sociology); Fault (geology); Scheme (mathematics); Distributed computing; Control (management); Engineering; Mathematics; Embedded system","score_opus":0.027414498238569656,"score_gpt":0.24293465338652404,"score_spread":0.2155201551479544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112122514","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019532782,0.000029605373,0.9889071,0.0046582324,0.001692573,0.0017497265,0.00044727483,0.00030163504,0.0002605728],"genre_scores_gemma":[0.9958278,0.0000032492999,0.001460111,0.0018702266,0.0001332173,0.00047686472,0.000017711953,0.000029419542,0.0001813878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782705,0.0002715192,0.00053689175,0.00063289976,0.00033067976,0.00040095666],"domain_scores_gemma":[0.99793667,0.0008515159,0.00017206218,0.00050438807,0.00030371043,0.00023163925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020513356,0.0002936308,0.00042150117,0.00009824609,0.00026127658,0.00022241268,0.0005357094,0.00018579292,0.000018088509],"category_scores_gemma":[0.00005709901,0.00028399556,0.00017169245,0.0002873358,0.000055811353,0.00018990369,0.0000012888587,0.00026614818,0.0001496934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031980188,0.00027164505,0.00001233407,0.00003899319,0.000085650325,0.000008864336,0.00048605775,0.98272914,0.0074423132,0.0021361995,0.00071067037,0.005758335],"study_design_scores_gemma":[0.005009256,0.00108231,0.000036350266,0.000039203467,0.0000393659,0.0000031872803,0.00008011652,0.97688,0.012594519,0.000011943001,0.00393897,0.00028476058],"about_ca_topic_score_codex":0.00008295657,"about_ca_topic_score_gemma":0.000050221683,"teacher_disagreement_score":0.99387455,"about_ca_system_score_codex":0.00012951232,"about_ca_system_score_gemma":0.00011757759,"threshold_uncertainty_score":0.9999612},"labels":[],"label_agreement":null},{"id":"W3112970337","doi":"10.1109/syscon47679.2020.9275901","title":"Autonomous assembly of structures using pinning control and formation algorithms","year":2020,"lang":"en","type":"article","venue":"2020 IEEE International Systems Conference (SysCon)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Mobile robot; Robot; Computer science; Architecture; Control (management); Distributed computing; Control system; Control engineering; Algorithm; Artificial intelligence; Engineering","score_opus":0.049811931953521835,"score_gpt":0.2793893702265747,"score_spread":0.22957743827305283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112970337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057244238,0.0002273747,0.93770504,0.0014890246,0.0019460473,0.0005892977,0.00014571997,0.00015439851,0.00049884396],"genre_scores_gemma":[0.99650776,0.00000873836,0.002725531,0.0002625486,0.0003931731,0.000031901855,0.00002249314,0.000015329711,0.00003250144],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973765,0.00019277853,0.00092165143,0.0005284742,0.0006795862,0.00030098844],"domain_scores_gemma":[0.99798876,0.00014031403,0.00076994486,0.0002967664,0.00059691106,0.0002073289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003432218,0.00028023878,0.00053610967,0.00012301304,0.00009690833,0.0005871939,0.0010896488,0.0001260476,0.0000130183535],"category_scores_gemma":[0.00013854851,0.00027403515,0.00009793292,0.00022287478,0.000059901125,0.0013460526,0.00013690424,0.0001877907,0.000022123842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002445909,0.0001734709,0.0054600006,0.0011986998,0.0018278834,0.00028039617,0.008727445,0.052952617,0.5578957,0.3337871,0.002811503,0.03464055],"study_design_scores_gemma":[0.0014018699,0.00007965457,0.00088074576,0.0001591111,0.000025027608,0.00010310675,0.0002065976,0.9932278,0.0023841383,0.00011916879,0.0011484614,0.00026432876],"about_ca_topic_score_codex":0.0005190526,"about_ca_topic_score_gemma":0.000008075379,"teacher_disagreement_score":0.9402752,"about_ca_system_score_codex":0.00013641451,"about_ca_system_score_gemma":0.00018373085,"threshold_uncertainty_score":0.9999712},"labels":[],"label_agreement":null},{"id":"W3113277878","doi":"10.1049/cth2.12026","title":"Fixed‐time orientation estimation and network localisation of multi‐agent systems","year":2020,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Settling time; Convergence (economics); Orientation (vector space); Control theory (sociology); Fixed point; Computer science; Displacement (psychology); Stability (learning theory); Mathematics; Control engineering; Artificial intelligence; Engineering; Step response","score_opus":0.011153628132659408,"score_gpt":0.23353993987595187,"score_spread":0.22238631174329246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113277878","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025348044,0.0007386282,0.99463725,0.00058375706,0.00006745039,0.0011668857,0.00005720537,0.000119866265,0.00009412895],"genre_scores_gemma":[0.9963935,0.0000139389695,0.002759433,0.0002323742,0.00012490188,0.00039440597,0.000042712265,0.000007947259,0.000030779793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986776,0.00028917883,0.0003828997,0.00034034933,0.00015392805,0.00015601952],"domain_scores_gemma":[0.99884135,0.00038065677,0.0002605062,0.0002728325,0.00011466349,0.00013000116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006549708,0.00012980404,0.00024271348,0.000031484673,0.00016100855,0.000122269,0.00022044928,0.00006311856,0.0000031948143],"category_scores_gemma":[0.0000821265,0.0001254135,0.00003477038,0.000256874,0.000073597555,0.00030617422,0.000045616987,0.00006552277,0.000025232132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066471555,0.00006528,0.00038292445,0.00009771034,0.00008032543,7.240044e-7,0.0007553089,0.050391,0.0046053417,0.9005865,0.00019605231,0.04277237],"study_design_scores_gemma":[0.0013849239,0.00005066279,0.0008489663,0.000024264089,0.000048124224,0.000004005452,0.00010935393,0.99135864,0.00010620814,0.0040214127,0.001912137,0.00013132038],"about_ca_topic_score_codex":0.000009451249,"about_ca_topic_score_gemma":4.3513532e-7,"teacher_disagreement_score":0.9938587,"about_ca_system_score_codex":0.000018152048,"about_ca_system_score_gemma":0.000023345425,"threshold_uncertainty_score":0.5114214},"labels":[],"label_agreement":null},{"id":"W3115157362","doi":"10.1109/tnse.2020.3047232","title":"Distributed Prescribed-Time Interval Bipartite Consensus of Multi-Agent Systems on Directed Graphs: Theory and Experiment","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Qatar National Research Fund; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Bipartite graph; Multi-agent system; Spanning tree; Laplacian matrix; Interval (graph theory); Protocol (science); Computer science; Consensus; Directed graph; Strongly connected component; Mathematics; Mathematical optimization; Topology (electrical circuits); Theoretical computer science; Discrete mathematics; Algorithm; Combinatorics; Graph; Artificial intelligence","score_opus":0.01787272224156212,"score_gpt":0.22009656368736633,"score_spread":0.20222384144580421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115157362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0617058,0.00048709993,0.9360559,0.00014955954,0.00079197047,0.00040325103,0.00005268277,0.00033578742,0.000017933582],"genre_scores_gemma":[0.9980617,0.000028525285,0.0017434098,0.00005423099,0.000033225937,0.00005309502,0.0000014768526,0.000012001237,0.000012297285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981292,0.0000952872,0.00037523056,0.0005405458,0.00042656856,0.00043315525],"domain_scores_gemma":[0.99891555,0.00022989968,0.00009248833,0.00033133174,0.000114164344,0.00031656775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962715,0.00023400644,0.00032105358,0.00014260113,0.00020394786,0.00019177423,0.000428111,0.000057220175,0.0000021486178],"category_scores_gemma":[0.00004455985,0.00021395068,0.000061063634,0.0010266745,0.00017794207,0.00023070005,0.000014336367,0.00017063633,0.000006279897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000934299,0.00011868035,0.000023471326,0.00008179597,0.0001046088,0.000014925722,0.0010751721,0.9184364,0.07352862,0.0032485416,0.00023030749,0.0030440218],"study_design_scores_gemma":[0.0006001278,0.0002116266,0.00024820102,0.00018837317,0.000020710857,0.00001042962,0.00006612184,0.9884174,0.009743829,0.000005936972,0.00026257694,0.00022466537],"about_ca_topic_score_codex":0.000018548182,"about_ca_topic_score_gemma":8.5833983e-7,"teacher_disagreement_score":0.93635595,"about_ca_system_score_codex":0.00006347115,"about_ca_system_score_gemma":0.000051108815,"threshold_uncertainty_score":0.8724656},"labels":[],"label_agreement":null},{"id":"W3120053557","doi":"10.1109/cdc42340.2020.9303904","title":"On the exact convergence to Nash equilibrium in monotone regimes under partial-information","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Monotone polygon; Monotonic function; Convergence (economics); Mathematical optimization; Best response; Graph; Strongly monotone; Computer science; Mathematical economics; Relaxation (psychology); Epsilon-equilibrium; Mathematics; Applied mathematics; Theoretical computer science; Economics; Mathematical analysis","score_opus":0.02758736467433188,"score_gpt":0.2401377603069041,"score_spread":0.21255039563257222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120053557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054331068,0.000011252145,0.8780523,0.06010088,0.00037825434,0.0007353454,0.000006063618,0.00023728501,0.006147554],"genre_scores_gemma":[0.98850816,0.0000010602691,0.00032456074,0.010897785,0.00003525347,0.000061000348,0.000003829695,0.000004395481,0.00016392699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864566,0.00010460774,0.0003496541,0.00025645152,0.00035193498,0.0002916933],"domain_scores_gemma":[0.9990133,0.00017849015,0.00008861562,0.00051139324,0.00005370887,0.00015446595],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031202292,0.00013610246,0.00015622174,0.000054237487,0.000041627525,0.00024385648,0.00097603485,0.00004381808,0.00007883951],"category_scores_gemma":[0.00018797987,0.00009514357,0.00004755568,0.0005723359,0.000016522574,0.0009284705,0.00021459747,0.00010747434,0.0018991205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007544531,0.000065317334,0.0006393278,0.000026135398,0.000036263824,0.0000111744075,0.0036736836,0.027914112,0.00408843,0.9021018,0.058671903,0.0026964175],"study_design_scores_gemma":[0.0007534966,0.00017038028,0.0030396688,0.000039143146,0.0000032413975,0.0000019910472,0.0003749193,0.9686195,0.01166132,0.0010875707,0.013937936,0.00031078854],"about_ca_topic_score_codex":0.00010939154,"about_ca_topic_score_gemma":0.000006999818,"teacher_disagreement_score":0.9407054,"about_ca_system_score_codex":0.00005916639,"about_ca_system_score_gemma":0.00005597177,"threshold_uncertainty_score":0.998878},"labels":[],"label_agreement":null},{"id":"W3120255068","doi":"10.1109/tac.2020.3048931","title":"Bounded Observer-Based Consensus Algorithm for Robust Finite-Time Tracking Control of Multiple Nonholonomic Chained-Form Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Control theory (sociology); Bounded function; Robustness (evolution); Nonholonomic system; Upper and lower bounds; Computer science; Mathematics; Robust control; Multi-agent system; Uniform boundedness; Mobile robot; Control system; Robot; Engineering; Control (management); Artificial intelligence","score_opus":0.02625241115459884,"score_gpt":0.23415718127110305,"score_spread":0.2079047701165042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120255068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046493257,0.00016671783,0.98680806,0.00074293255,0.0022358557,0.0029083632,0.0017721052,0.00068594894,0.00003066696],"genre_scores_gemma":[0.9692764,0.0000016110414,0.029117059,0.00027018215,0.00008080022,0.00092230045,0.00003128977,0.0000621566,0.00023816914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956718,0.0004720633,0.0015760683,0.0008590243,0.0006053951,0.0008156399],"domain_scores_gemma":[0.9917129,0.005187761,0.0007541435,0.001335571,0.00074017566,0.00026940033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009939994,0.0005524111,0.0013827854,0.0003273233,0.00037791993,0.00039558965,0.0008616327,0.0002789722,0.00004077476],"category_scores_gemma":[0.00022336886,0.00057209184,0.0007272328,0.00054467935,0.00011803583,0.0003042039,0.000003700622,0.00024445145,0.00008019829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023250107,0.0015459437,0.0000314562,0.0005361166,0.0014010735,0.00010371287,0.00031816302,0.85551906,0.016152933,0.0003419885,0.0001587424,0.1236583],"study_design_scores_gemma":[0.021215826,0.0003480141,0.00011922128,0.0003143827,0.00028915066,0.000041102245,0.00008187727,0.9720716,0.004815082,0.000030264115,0.00016767441,0.00050584425],"about_ca_topic_score_codex":0.000116083604,"about_ca_topic_score_gemma":0.000050238807,"teacher_disagreement_score":0.9646271,"about_ca_system_score_codex":0.00036319462,"about_ca_system_score_gemma":0.00067547243,"threshold_uncertainty_score":0.99967307},"labels":[],"label_agreement":null},{"id":"W31203745","doi":"10.1007/978-1-4419-8393-0_6","title":"Perspectives and Future Directions of Research","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Engineering ethics; Political science; Engineering","score_opus":0.058123575297326265,"score_gpt":0.3003538860050147,"score_spread":0.24223031070768847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W31203745","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000036144654,0.007975139,0.009908348,0.00067790016,0.00044931335,0.0003367353,0.0000306457,0.000141596,0.98047674],"genre_scores_gemma":[0.01142954,0.0031874904,0.0026366585,0.000014343511,0.00072272547,0.000025716503,0.0000059323997,0.000032688917,0.9819449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849504,0.000055620683,0.0002459979,0.0005310057,0.00044952237,0.00022281647],"domain_scores_gemma":[0.9983249,0.000117977004,0.00011833724,0.0007729559,0.000561003,0.000104864564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045460308,0.00018490409,0.0003146557,0.00036189583,0.000114817325,0.00007598887,0.00067317596,0.00024054594,0.0002392762],"category_scores_gemma":[0.000021609827,0.00015714882,0.00009658077,0.00009222266,0.00020284786,0.00017341667,0.0003213661,0.00038444818,0.00008581283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030194988,0.000017235141,0.00000464029,0.000023825103,0.00007043587,0.000006145773,0.0012403914,2.8003459e-8,0.000015304928,0.9815086,0.0023319384,0.014778409],"study_design_scores_gemma":[0.00024823874,0.00011205602,0.00025344465,0.00011762669,0.00001598606,0.000022915814,0.00039833493,0.0001426109,0.000031654043,0.03906907,0.9593311,0.00025698275],"about_ca_topic_score_codex":0.00015211012,"about_ca_topic_score_gemma":0.000044211418,"teacher_disagreement_score":0.9569991,"about_ca_system_score_codex":0.000064223794,"about_ca_system_score_gemma":0.00009135602,"threshold_uncertainty_score":0.6408343},"labels":[],"label_agreement":null},{"id":"W3120407551","doi":"10.1109/cdc42340.2020.9303934","title":"Distance-Based Formation Control Over Directed Triangulated Laman Graphs in 2-D Space","year":2020,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ambiguity; Computer science; Enhanced Data Rates for GSM Evolution; Directed graph; Graph; Mathematics; Algorithm; Mathematical optimization; Theoretical computer science; Artificial intelligence","score_opus":0.013174526591122554,"score_gpt":0.21522513844946708,"score_spread":0.20205061185834453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120407551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01740421,0.000077872886,0.9724295,0.0064696423,0.00020127739,0.00079992105,0.000025222282,0.0009170734,0.001675273],"genre_scores_gemma":[0.99714893,0.0000010977973,0.0013897903,0.0012743745,0.00002874529,0.000050335402,0.000035234614,0.000010806179,0.00006071289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817425,0.00021508035,0.00047404077,0.000402193,0.00036715853,0.00036726633],"domain_scores_gemma":[0.9990136,0.0001344237,0.0001778927,0.0004054918,0.00008917799,0.00017938644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002480792,0.00020004295,0.00033693534,0.00013282533,0.00005409809,0.0002057086,0.00060448726,0.00008673803,0.000040474806],"category_scores_gemma":[0.00014605795,0.00017914287,0.00011064267,0.0011994812,0.000020567508,0.0007291217,0.000039044517,0.00013201644,0.00007191205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024021172,0.001482831,0.08245788,0.0005737545,0.00045890064,0.00064641767,0.006393161,0.033309706,0.080063425,0.70943046,0.057146326,0.02563505],"study_design_scores_gemma":[0.008107421,0.000061140105,0.016423916,0.000028809434,0.000008057752,8.255695e-7,0.000021597909,0.9704316,0.001218017,0.00023516541,0.0032270658,0.00023633563],"about_ca_topic_score_codex":0.00015441253,"about_ca_topic_score_gemma":0.00014043224,"teacher_disagreement_score":0.9797447,"about_ca_system_score_codex":0.0001004831,"about_ca_system_score_gemma":0.000054610413,"threshold_uncertainty_score":0.7305234},"labels":[],"label_agreement":null},{"id":"W3124355509","doi":"","title":"Digraphs with distinguishable dynamics under the multi-agent agreement protocol","year":2014,"lang":"en","type":"article","venue":"D-Scholarship@Pitt (University of Pittsburgh)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Digraph; Laplacian matrix; Algebraic graph theory; Computer science; Algebraic number; Topology (electrical circuits); Algebraic connectivity; Mathematics; Set (abstract data type); Graph; Protocol (science); Directed graph; Adjacency matrix; Theoretical computer science; Discrete mathematics; Combinatorics","score_opus":0.019858975832660344,"score_gpt":0.22828885025833687,"score_spread":0.2084298744256765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124355509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01039645,0.00002153493,0.97242534,0.0015591667,0.00020940909,0.014403042,0.000020773952,0.00023123999,0.0007330315],"genre_scores_gemma":[0.9888903,0.0000041827598,0.009651783,0.00023685671,0.00006404058,0.0005185558,0.000024175451,0.000033088945,0.00057700975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9967643,0.00045293546,0.00035035698,0.0008097358,0.0009487539,0.00067389297],"domain_scores_gemma":[0.9968275,0.00019336973,0.00057581294,0.0016697568,0.00044411264,0.0002894561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014349563,0.00038838654,0.00046765443,0.00020055857,0.00074303674,0.000277183,0.0030512966,0.00015502634,0.000044225097],"category_scores_gemma":[0.000094669806,0.00032728072,0.00023713021,0.0008471371,0.00027621308,0.00099872,0.0006599932,0.00045885594,0.00006313074],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088771776,0.0044062124,0.25712505,0.0013085569,0.0021964454,0.00039083918,0.0074461238,0.0101731075,0.0028000097,0.6128781,0.0028044486,0.09758341],"study_design_scores_gemma":[0.01588509,0.0012588942,0.5973257,0.0007134149,0.00030300382,0.00006331299,0.004181452,0.2268541,0.00017474715,0.015697416,0.13536741,0.0021754515],"about_ca_topic_score_codex":0.000463871,"about_ca_topic_score_gemma":0.0006899769,"teacher_disagreement_score":0.97849387,"about_ca_system_score_codex":0.00029728562,"about_ca_system_score_gemma":0.00013386589,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W3126027265","doi":"10.1631/fitee.2110000","title":"Distributed filtering and control of complex networks and systems","year":2021,"lang":"en","type":"article","venue":"Frontiers of Information Technology & Electronic Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Complex network; Distributed computing; World Wide Web","score_opus":0.0027493898803347436,"score_gpt":0.16723494180406212,"score_spread":0.16448555192372738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126027265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010656984,0.0056436523,0.98286647,0.00019651698,0.00019762981,0.00019628322,0.000030054278,0.0001953047,0.000017088518],"genre_scores_gemma":[0.9936543,0.0001399616,0.006115827,0.000010327494,0.000007881178,0.000023931878,0.000039682705,0.0000053832746,0.0000026780972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883384,0.000017194969,0.00051981816,0.00014036533,0.00013872664,0.0003500598],"domain_scores_gemma":[0.9991567,0.00003488334,0.0002647297,0.00031517213,0.00018383608,0.000044656008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021704187,0.0001423826,0.00038207785,0.00027761696,0.00003904785,0.000052983007,0.00030169467,0.0001684306,4.2615198e-7],"category_scores_gemma":[0.000105476785,0.00015734568,0.000033376273,0.00048081466,0.00005188689,0.0006024304,0.00012208501,0.00020296723,3.1485476e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004340815,0.00006532085,0.01043417,0.0009118323,0.0011268853,0.0000134043,0.0003893073,0.4308553,0.04696635,0.4768637,0.0015970974,0.030733204],"study_design_scores_gemma":[0.00087550463,0.000058920312,0.0010245276,0.000049842834,0.000017295322,0.00006574302,0.0001419972,0.9918257,0.0030229907,0.00007238927,0.0027136595,0.00013143814],"about_ca_topic_score_codex":0.0000073078154,"about_ca_topic_score_gemma":6.689956e-7,"teacher_disagreement_score":0.98299736,"about_ca_system_score_codex":0.000075646625,"about_ca_system_score_gemma":0.000054322303,"threshold_uncertainty_score":0.6416371},"labels":[],"label_agreement":null},{"id":"W3128916254","doi":"10.1109/tcst.2021.3055370","title":"Event-Triggered Formation Control for a Class of Uncertain Euler–Lagrange Systems: Theory and Experiment","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Program of Shanghai Academic Research Leader; National Natural Science Foundation of China","keywords":"Control theory (sociology); Cascade; Protocol (science); Computer science; Zeno's paradoxes; Transformation (genetics); Event (particle physics); Class (philosophy); Stability (learning theory); Control (management); Mathematics; Engineering; Artificial intelligence; Physics","score_opus":0.01373104240285836,"score_gpt":0.2506790904879436,"score_spread":0.23694804808508527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128916254","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037903101,0.004904547,0.98368955,0.0011104567,0.0023755443,0.0030736967,0.0004861263,0.0005129871,0.000056773028],"genre_scores_gemma":[0.99608934,0.00004017731,0.0004053928,0.00008500505,0.000059031576,0.0030790404,0.000008336598,0.00003227861,0.00020140516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99621445,0.0007665653,0.0012442693,0.0007418087,0.00042758242,0.0006053357],"domain_scores_gemma":[0.99624276,0.0012061308,0.0006251873,0.0011165098,0.0006714357,0.00013799549],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012947778,0.0004059395,0.0010868916,0.0006067811,0.0002713198,0.00017877844,0.0006810879,0.00050045387,0.000003323688],"category_scores_gemma":[0.00010105788,0.00038606414,0.00026107862,0.00057478563,0.00013219795,0.0004443286,0.000006376018,0.0002692076,0.000013776482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015160153,0.0014996951,0.000046934296,0.0018872359,0.0026606228,0.00011208947,0.0012336376,0.060721785,0.36268964,0.5391157,0.00072322093,0.02779341],"study_design_scores_gemma":[0.024199555,0.0010864085,0.000014102735,0.00074168306,0.00039032506,0.00042254798,0.0028309177,0.91548026,0.04701729,0.001423661,0.0055450588,0.0008481779],"about_ca_topic_score_codex":0.000081232094,"about_ca_topic_score_gemma":0.000044243006,"teacher_disagreement_score":0.992299,"about_ca_system_score_codex":0.00029141112,"about_ca_system_score_gemma":0.00017364431,"threshold_uncertainty_score":0.99985915},"labels":[],"label_agreement":null},{"id":"W3129112770","doi":"10.1090/proc/15295","title":"Flocking in a two-agent Cucker-Smale model with large delay","year":2021,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Canada Research Chairs","keywords":"Flocking (texture); Computer science; Control theory (sociology); Artificial intelligence; Physics","score_opus":0.012898287470910208,"score_gpt":0.25516729571086055,"score_spread":0.24226900823995035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129112770","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59525985,0.000038762646,0.4005027,0.001605615,0.000028992814,0.0003120548,0.000008673434,0.00009287425,0.0021504778],"genre_scores_gemma":[0.8884196,0.0000048513475,0.110877916,0.00042717988,0.00002165019,0.00005317275,5.4239933e-7,0.000017594473,0.00017748568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979421,0.000019217634,0.0004441274,0.00044738277,0.0006337146,0.0005134503],"domain_scores_gemma":[0.9987298,0.0000971189,0.00042602848,0.00035291156,0.0002849579,0.000109159024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005930646,0.0002110059,0.00051331223,0.000023185263,0.000118821714,0.00013572023,0.0011202196,0.000031185806,0.000005248702],"category_scores_gemma":[0.00015613894,0.00014327608,0.00027166872,0.0011196885,0.00017937213,0.00028550168,0.0006450046,0.0002494646,0.000009811293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007591598,0.0032967613,0.0670099,0.0015656721,0.00078178785,0.000029180115,0.032078166,0.006442752,0.06184935,0.8187465,0.004984671,0.0031393175],"study_design_scores_gemma":[0.000905358,0.000036562746,0.0009684341,0.00025027193,0.000033493394,0.000045236528,0.0019059494,0.97807115,0.004374274,0.013062751,0.00009667634,0.00024986733],"about_ca_topic_score_codex":0.000020233101,"about_ca_topic_score_gemma":0.000004055034,"teacher_disagreement_score":0.97162837,"about_ca_system_score_codex":0.00013873883,"about_ca_system_score_gemma":0.00011178354,"threshold_uncertainty_score":0.58426285},"labels":[],"label_agreement":null},{"id":"W3129711367","doi":"10.1049/iet-cta.2020.0281","title":"Distributed adaptive consensus tracking control for non‐linear multi‐agent systems with time‐varying delays","year":2020,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Bounded function; Computer science; Convergence (economics); Multi-agent system; Controller (irrigation); Adaptive control; Consensus; Neighbourhood (mathematics); Linear system; Tracking (education); Uniform boundedness; Control (management); Mathematics; Artificial intelligence","score_opus":0.022335757830031222,"score_gpt":0.24524194434587807,"score_spread":0.22290618651584684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129711367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008169381,0.000492449,0.98995876,0.0012836942,0.00007237925,0.0047594863,0.0021522364,0.00036596137,0.00009809397],"genre_scores_gemma":[0.9917126,0.0000038020264,0.0042119785,0.00073582534,0.0002703695,0.0028834317,0.00009974502,0.000035444362,0.000046780988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974437,0.00035127028,0.00059354183,0.0008296118,0.00024947623,0.0005324533],"domain_scores_gemma":[0.99651635,0.0017162125,0.0003917387,0.00057775294,0.00041108843,0.00038685766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008743889,0.0003763761,0.0006432163,0.000057007695,0.0005287463,0.000284407,0.0006838416,0.00013028989,0.0000031049315],"category_scores_gemma":[0.00015127152,0.00032440576,0.00014136668,0.00034312467,0.00015373346,0.00022952612,0.00005622166,0.00021157163,0.00005717057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052579055,0.0009385007,0.00065010786,0.00043589133,0.0028321065,0.00009544795,0.0019095805,0.1312868,0.05181934,0.7828148,0.0011345531,0.020824973],"study_design_scores_gemma":[0.010634054,0.00025951792,0.00013675126,0.000057944697,0.00021816064,0.000036850928,0.00025111425,0.9821868,0.0002066589,0.000556072,0.0050191595,0.00043694707],"about_ca_topic_score_codex":0.000012105112,"about_ca_topic_score_gemma":0.0000012904868,"teacher_disagreement_score":0.9908957,"about_ca_system_score_codex":0.00005955422,"about_ca_system_score_gemma":0.00010273469,"threshold_uncertainty_score":0.9999208},"labels":[],"label_agreement":null},{"id":"W3131117591","doi":"10.1155/2021/8427437","title":"Adaptive Fuzzy Cooperative Control for Nonlinear Multiagent Systems with Unknown Control Coefficient and Actuator Fault","year":2021,"lang":"en","type":"article","venue":"Complexity","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Liaoning Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Backstepping; Fuzzy logic; Nonlinear system; Controller (irrigation); Adaptive control; Computer science; Fuzzy control system; Actuator; Multi-agent system; Bounded function; Adaptive neuro fuzzy inference system; Convex hull; Norm (philosophy); Mathematics; Control (management); Artificial intelligence; Regular polygon","score_opus":0.038403177973637265,"score_gpt":0.2607470568329057,"score_spread":0.22234387885926846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131117591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012349328,0.00090660993,0.98038757,0.0008487419,0.00071654253,0.002810172,0.0014702007,0.00024448545,0.00026633227],"genre_scores_gemma":[0.9848216,0.000005630345,0.013752758,0.00042387232,0.00019606802,0.00045836176,0.000095834104,0.000031136216,0.00021472407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965896,0.0004720745,0.00060214364,0.0010807429,0.0005482222,0.0007072198],"domain_scores_gemma":[0.9961502,0.0007520466,0.00032772918,0.0008843273,0.0014938164,0.00039185528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005581134,0.00046766252,0.0009186434,0.00007841602,0.00045891493,0.0005602189,0.0006667306,0.00012910803,0.000007680622],"category_scores_gemma":[0.00026564443,0.00037968348,0.00014083413,0.0003729741,0.00027633004,0.0003341935,0.00016463842,0.00022756387,0.000029203671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038885341,0.004806428,0.0019321962,0.00093103637,0.0051456825,0.0010379907,0.0068693063,0.108714886,0.015381902,0.82649684,0.008786786,0.01600842],"study_design_scores_gemma":[0.012818201,0.00054594444,0.0009197658,0.00011811192,0.000079818325,0.00008585371,0.0005727718,0.97365576,0.0004869377,0.000104543265,0.010090328,0.0005219573],"about_ca_topic_score_codex":0.00010387462,"about_ca_topic_score_gemma":0.00014415261,"teacher_disagreement_score":0.9724723,"about_ca_system_score_codex":0.00020597418,"about_ca_system_score_gemma":0.0003875322,"threshold_uncertainty_score":0.99986553},"labels":[],"label_agreement":null},{"id":"W3133940770","doi":"10.1109/tac.2020.3030758","title":"On Zeno Behavior in Event-Triggered Finite-Time Consensus of Multiagent Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Zeno's paradoxes; Multi-agent system; Computer science; Event (particle physics); State (computer science); Consensus; Interval (graph theory); Quantum Zeno effect; Function (biology); Control theory (sociology); Topology (electrical circuits); Mathematics; Control (management); Algorithm; Artificial intelligence; Physics","score_opus":0.019009896128598783,"score_gpt":0.24255835127780384,"score_spread":0.22354845514920507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133940770","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055452567,0.0000743703,0.9389679,0.001172022,0.00091764674,0.0024891456,0.00033156332,0.0004890496,0.00010577551],"genre_scores_gemma":[0.9985356,0.000001974974,0.0004861847,0.00033607852,0.00002543216,0.0004739362,0.000003672768,0.000030429233,0.00010673659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964307,0.00052393036,0.0012495231,0.0006150834,0.0007037442,0.00047704956],"domain_scores_gemma":[0.9969757,0.0013795961,0.00041928823,0.0008147854,0.0001304016,0.00028020705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042101,0.00037846575,0.0008807062,0.00033519563,0.000099160316,0.000117311014,0.00080279,0.00016499108,0.000101512014],"category_scores_gemma":[0.00010391838,0.00036557432,0.00030882258,0.0006676722,0.00005851558,0.00014109438,0.0000037479313,0.00026814858,0.0005894798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053637865,0.0034314867,0.00007642428,0.00044638442,0.0005779051,0.00042525565,0.001842566,0.89995646,0.04226082,0.0010515886,0.00092500646,0.04846975],"study_design_scores_gemma":[0.006657579,0.00060885923,0.0003621762,0.00019541531,0.00010049671,0.000009075749,0.000054966546,0.9897972,0.001833231,0.0000128834,0.000059534214,0.00030862243],"about_ca_topic_score_codex":0.00013501328,"about_ca_topic_score_gemma":0.000013479936,"teacher_disagreement_score":0.943083,"about_ca_system_score_codex":0.0001880033,"about_ca_system_score_gemma":0.00015515237,"threshold_uncertainty_score":0.9998796},"labels":[],"label_agreement":null},{"id":"W3134596872","doi":"10.1109/tcyb.2021.3059200","title":"Cooperative Adaptive Model-Free Control With Model-Free Estimation and Online Gain Tuning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Mitacs","keywords":"Computer science; Control theory (sociology); Nonlinear system; Convergence (economics); Controller (irrigation); Multi-agent system; Observer (physics); Adaptive control; Spanning tree; Graph; Control engineering; Control (management); Artificial intelligence; Mathematics; Engineering; Theoretical computer science","score_opus":0.021466185301889065,"score_gpt":0.23448072051572372,"score_spread":0.21301453521383465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134596872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004529474,0.0000965817,0.992238,0.001349198,0.00015601174,0.0004471387,0.0006062981,0.00020953809,0.000367752],"genre_scores_gemma":[0.83036506,0.00002415488,0.16860883,0.0003166316,0.000019023797,0.00006191337,0.00001442499,0.000027790633,0.00056215544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791545,0.0001610835,0.00039072224,0.000642537,0.0005127614,0.00037743483],"domain_scores_gemma":[0.9977992,0.00022372688,0.00013464973,0.0011673169,0.00047378353,0.0002013021],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00017375805,0.00032973982,0.000379491,0.00012130953,0.00025218466,0.00023807031,0.0006627982,0.00013453761,0.0000056080094],"category_scores_gemma":[0.00003561355,0.0003120004,0.00007522904,0.00040703465,0.000107141954,0.00049315486,0.000013653235,0.00038181915,0.00000857392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069456946,0.00024745555,0.000002367294,0.000010161465,0.00011687399,0.000029269335,0.0006486149,0.9840752,0.0010973504,0.006543636,0.00011676769,0.007042847],"study_design_scores_gemma":[0.0040245736,0.00025003782,0.000015052484,0.000100912366,0.0001009952,0.00004511615,0.00012192754,0.9901443,0.0033293453,0.0015127689,0.000013422332,0.0003415233],"about_ca_topic_score_codex":0.000046736914,"about_ca_topic_score_gemma":0.0005123487,"teacher_disagreement_score":0.8258356,"about_ca_system_score_codex":0.00014071174,"about_ca_system_score_gemma":0.00030203827,"threshold_uncertainty_score":0.9999332},"labels":[],"label_agreement":null},{"id":"W3143874352","doi":"10.1109/ssd.2011.5967698","title":"Multi-robot target pursuit: Towards an opportunistic control architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Robot; Computer science; Action selection; Artificial intelligence; Probabilistic logic; Inference; Machine learning; Human–computer interaction; Perception","score_opus":0.06381290151147082,"score_gpt":0.26101700008132145,"score_spread":0.19720409856985063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3143874352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029849555,0.0000603605,0.98773754,0.0005702146,0.0008895379,0.00063565635,0.00010873364,0.0008111206,0.008888374],"genre_scores_gemma":[0.81314915,0.0000012605791,0.18444206,0.0009430937,0.00010770364,0.000076922224,0.000035555724,0.000024966983,0.0012192782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711126,0.00026140618,0.00051751157,0.0008159847,0.00054770795,0.00074611953],"domain_scores_gemma":[0.9975029,0.000053622356,0.00019298005,0.0014717699,0.00018673038,0.0005919827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528275,0.00037291305,0.00046091204,0.00016037063,0.00015269805,0.00028223713,0.0026796032,0.00015565731,0.00033591816],"category_scores_gemma":[0.00011901395,0.00030513332,0.00016360809,0.0002811448,0.00008646835,0.00060543517,0.00021893307,0.0002521981,0.00028982334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004311306,0.0064780023,0.0105689075,0.00025314538,0.0014194102,0.0026564938,0.013951387,0.0031385303,0.08201629,0.4417432,0.008864107,0.4284794],"study_design_scores_gemma":[0.008472076,0.00084793026,0.03927208,0.000049510276,0.00008646077,0.00022213232,0.00020791216,0.9238638,0.0017158679,0.004555104,0.018985556,0.0017215473],"about_ca_topic_score_codex":0.00046895235,"about_ca_topic_score_gemma":0.00007331684,"teacher_disagreement_score":0.9207253,"about_ca_system_score_codex":0.000064706815,"about_ca_system_score_gemma":0.00019670062,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W3144594103","doi":"10.1007/978-3-030-62147-6_8","title":"Distributed Consensus Control for Nonlinear Multi-agent Systems","year":2021,"lang":"en","type":"book-chapter","venue":"Studies in systems, decision and control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Bellman equation; Consensus; Dynamic programming; Nonlinear system; Mathematical optimization; Computer science; Optimal control; Heuristic; Multi-agent system; Control theory (sociology); Function (biology); Mathematics; Control (management); Artificial intelligence","score_opus":0.06871922818185047,"score_gpt":0.3213294340802961,"score_spread":0.25261020589844563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144594103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050169674,0.16879985,0.8019712,0.0004739611,0.012317963,0.007712949,0.0067068357,0.00033772743,0.0016293527],"genre_scores_gemma":[0.87332046,0.0054602604,0.005436376,0.0009374682,0.002882695,0.0050947266,0.0008078692,0.0004735596,0.105586596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99131733,0.00049864635,0.0033850698,0.0022898712,0.0013336203,0.0011754485],"domain_scores_gemma":[0.98856616,0.0052078855,0.0016136641,0.0019978208,0.0021668174,0.00044764692],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002687826,0.001421282,0.004358385,0.0005141124,0.00046942916,0.0008050356,0.0014093978,0.0008943046,0.0000057736256],"category_scores_gemma":[0.0016113723,0.0012402446,0.0006461616,0.00021935873,0.00035781498,0.00017765247,0.00051355246,0.0006612602,0.000081291466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0034567672,0.0014157766,0.0011029962,0.009529101,0.023259781,0.008236514,0.0023169264,0.021737333,0.00040395412,0.7449457,0.13500412,0.04859103],"study_design_scores_gemma":[0.030102389,0.00034663707,0.0000625598,0.005227783,0.000512913,0.00035012243,0.001315803,0.48981184,0.000002046596,0.0005087222,0.46994996,0.0018092486],"about_ca_topic_score_codex":0.000079745005,"about_ca_topic_score_gemma":0.000087849105,"teacher_disagreement_score":0.8732703,"about_ca_system_score_codex":0.0007654715,"about_ca_system_score_gemma":0.00034225776,"threshold_uncertainty_score":0.99985373},"labels":[],"label_agreement":null},{"id":"W3154716977","doi":"10.1016/j.ifacol.2020.12.2608","title":"Obstacle Avoidance of Swarms Using Pinning Control","year":2020,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Swarm behaviour; Obstacle; Obstacle avoidance; Computer science; Limiting; Path (computing); Control (management); Swarm robotics; Collision avoidance; Motion planning; Trajectory; Distributed computing; Mathematical optimization; Artificial intelligence; Engineering; Computer security; Mobile robot; Mathematics; Computer network; Robot; Geography; Collision","score_opus":0.03933059787843516,"score_gpt":0.24503613901121196,"score_spread":0.2057055411327768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154716977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11409057,0.000843163,0.878096,0.005522382,0.00041055898,0.0004052239,0.00011897744,0.00029197612,0.00022115462],"genre_scores_gemma":[0.8258145,0.0000042960182,0.17218842,0.0016750975,0.00024249218,0.000007661328,0.00000963125,0.00002017215,0.000037770344],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776244,0.00012511632,0.0005770054,0.0005711548,0.00049185083,0.00047243404],"domain_scores_gemma":[0.9985174,0.00015706143,0.00035719038,0.000542047,0.00017503262,0.00025127333],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026577865,0.0002608201,0.0005332328,0.00006167102,0.00010963286,0.00009776877,0.0010958804,0.00009532498,0.000022648357],"category_scores_gemma":[0.000270726,0.0002502174,0.00017456566,0.0005693169,0.000066878136,0.00048517698,0.00015517195,0.00022065741,0.00006154276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015734068,0.00033390324,0.007213994,0.00030371707,0.00039319284,0.00022759491,0.004957084,0.03389096,0.9225997,0.005679625,0.000075015174,0.024167906],"study_design_scores_gemma":[0.0026741007,0.00013003936,0.0012161062,0.00009600794,0.00003461916,0.000019632429,0.0001545585,0.9888251,0.00544513,0.00003158954,0.0010335175,0.00033958696],"about_ca_topic_score_codex":0.00012888221,"about_ca_topic_score_gemma":0.0000053638637,"teacher_disagreement_score":0.9549342,"about_ca_system_score_codex":0.00007056937,"about_ca_system_score_gemma":0.00011732191,"threshold_uncertainty_score":0.999995},"labels":[],"label_agreement":null},{"id":"W3154972654","doi":"10.1109/access.2021.3073633","title":"Distributed Time-Varying Output Formation Tracking Control for General Linear Multi-Agent Systems With Multiple Leaders and Relative Output-Feedback","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; AGE-WELL","keywords":"Observability; Computer science; Control theory (sociology); Multi-agent system; Observer (physics); Protocol (science); Tracking (education); Decentralised system; Control (management); Distributed computing; Mathematics; Artificial intelligence","score_opus":0.062243803738754204,"score_gpt":0.290311518138533,"score_spread":0.2280677143997788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3154972654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042033646,0.0005021247,0.953471,0.0005133785,0.00090475095,0.0017374834,0.0004981092,0.00029626073,0.00004324713],"genre_scores_gemma":[0.988511,0.000009221866,0.0099188965,0.00018524403,0.00025800586,0.00033053444,0.00030498108,0.000044326407,0.0004377773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684215,0.00028767835,0.0007706822,0.00086591806,0.00051078096,0.00072279194],"domain_scores_gemma":[0.9972303,0.0005225526,0.0005317192,0.0006757906,0.0007889984,0.0002506193],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0005114803,0.00043377106,0.000664986,0.00013810572,0.00041835321,0.0011802935,0.00087533984,0.0001912752,0.0000016028843],"category_scores_gemma":[0.00026821147,0.0003875858,0.00015050269,0.00048334323,0.000090512985,0.003516417,0.00014063498,0.00024760544,0.000029491956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013990178,0.0018177246,0.053641867,0.0029112396,0.003723054,0.00092457066,0.012738371,0.8380363,0.04357158,0.003921847,0.0076734065,0.029641021],"study_design_scores_gemma":[0.008356486,0.00008852155,0.002725322,0.00023677792,0.00009562193,0.00009482744,0.00021391158,0.98277444,0.0036590528,0.000019766714,0.0012260858,0.00050919654],"about_ca_topic_score_codex":0.000119577984,"about_ca_topic_score_gemma":0.00003114877,"teacher_disagreement_score":0.94647735,"about_ca_system_score_codex":0.00024188576,"about_ca_system_score_gemma":0.00013871265,"threshold_uncertainty_score":0.9998576},"labels":[],"label_agreement":null},{"id":"W3156097280","doi":"10.48550/arxiv.2104.11096","title":"On the exact convergence to Nash equilibrium in hypomonotone regimes under full and partial-information","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Convergence (economics); Monotonic function; Monotone polygon; Mathematical economics; Best response; Computer science; Relaxation (psychology); Mathematical optimization; Complete information; Mathematics; Economics; Mathematical analysis","score_opus":0.05089289433059843,"score_gpt":0.18853113719166872,"score_spread":0.1376382428610703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3156097280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5557557,0.00003309897,0.44131273,0.0009142806,0.0005566586,0.0005501117,0.00001552007,0.000091368776,0.0007705846],"genre_scores_gemma":[0.999023,0.000037599188,0.00011697298,0.00046209278,0.00002655823,0.0000066981643,0.00002123269,0.00000848262,0.0002973375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810743,0.00028398648,0.00030818663,0.00075710245,0.00016337351,0.00037993793],"domain_scores_gemma":[0.9978521,0.00027645743,0.00025367356,0.0012975378,0.00014373663,0.00017649881],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046525538,0.00029548586,0.0003341607,0.00022874636,0.00008653131,0.00040200874,0.001380973,0.00019749357,0.000025032974],"category_scores_gemma":[0.00012230157,0.00028234045,0.000107384825,0.00066817465,0.000065385146,0.0008623852,0.0016198902,0.00040365144,0.00013659785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014458828,0.00013613189,0.001607861,0.00012529179,0.00016006279,0.00027376326,0.0016902905,0.49444285,0.00050201826,0.4990621,0.001298898,0.00055615325],"study_design_scores_gemma":[0.0008939407,0.00009686473,0.004851572,0.00034941643,0.000032635635,0.0000080976,0.0007164936,0.98558444,0.0007311626,0.005424367,0.00067941344,0.0006316158],"about_ca_topic_score_codex":0.00031515255,"about_ca_topic_score_gemma":0.000057020698,"teacher_disagreement_score":0.4936377,"about_ca_system_score_codex":0.000255321,"about_ca_system_score_gemma":0.00019788611,"threshold_uncertainty_score":0.99996287},"labels":[],"label_agreement":null},{"id":"W3157461824","doi":"10.1109/tac.2021.3077347","title":"Cooperative Output Regulation With Asynchronous Transmissions and Time-Varying Delays","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Asynchronous communication; Stability (learning theory); Notation; Lyapunov function; Controller (irrigation); Transmission (telecommunications); Mathematics; Computer science; Control theory (sociology); Applied mathematics; Discrete mathematics; Control (management); Arithmetic; Telecommunications; Artificial intelligence","score_opus":0.010171862799620936,"score_gpt":0.2195819367449395,"score_spread":0.20941007394531858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157461824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006113133,0.00011505802,0.989985,0.0017031503,0.00022082125,0.0006875637,0.000051691357,0.00049364305,0.0006299366],"genre_scores_gemma":[0.9897425,0.000006000325,0.009056047,0.0002816128,0.000022708562,0.00015537828,0.0000063303446,0.000023527698,0.00070585945],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979478,0.00029401688,0.00043824548,0.0005620457,0.0004027191,0.00035513722],"domain_scores_gemma":[0.99839777,0.00042256867,0.00012520232,0.0006068861,0.00023198938,0.00021559234],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018753095,0.0002895713,0.000441772,0.00014171694,0.00043510657,0.0003038391,0.00026397363,0.00010733828,0.0001451115],"category_scores_gemma":[0.000015338455,0.00024767412,0.000104211824,0.00046082048,0.000062974344,0.00051949744,0.0000020118832,0.00017893057,0.00011168621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001784931,0.0012680033,0.000029967383,0.0001805695,0.0013827567,0.0003317203,0.004123306,0.31436962,0.06798722,0.0028272222,0.00034583698,0.6069753],"study_design_scores_gemma":[0.004024376,0.00020059114,0.0004287301,0.000184371,0.0001275713,0.00018008925,0.000046442874,0.9895408,0.0047422945,0.00006663064,0.00016028408,0.00029781758],"about_ca_topic_score_codex":0.000017394907,"about_ca_topic_score_gemma":0.00001927506,"teacher_disagreement_score":0.9836294,"about_ca_system_score_codex":0.00011861629,"about_ca_system_score_gemma":0.00027743797,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W3159548938","doi":"10.1109/tcns.2023.3259468","title":"An Inexact-Penalty Method for GNE Seeking in Games With Dynamic Agents","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Penalty method; Mathematical optimization; Mathematics","score_opus":0.018927410379170704,"score_gpt":0.29117414128581764,"score_spread":0.2722467309066469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159548938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027749955,0.00014463573,0.99211997,0.00023081565,0.001952922,0.0021703048,0.00014452604,0.00040497325,0.000056871188],"genre_scores_gemma":[0.99427927,0.0000111550435,0.004364869,0.00007968386,0.00013271224,0.00088187883,0.000015772057,0.00004885089,0.00018580552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.0006391095,0.00092857034,0.0007424799,0.0005591543,0.0007839544],"domain_scores_gemma":[0.9972312,0.00095319335,0.0004415796,0.0009706135,0.00021847259,0.00018494899],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018948498,0.0003626199,0.00089208956,0.0004539717,0.00018147928,0.00018714054,0.0009513651,0.0001667087,0.0000031588868],"category_scores_gemma":[0.000010768029,0.00032156496,0.00020257145,0.0015141871,0.000036169116,0.00054801925,0.000002820558,0.00024949832,0.000020494648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002528021,0.00016271361,0.0002023958,0.00012372158,0.00023791415,0.000025262783,0.00022939789,0.9877009,0.0013820864,0.0003749059,0.0001916009,0.009116341],"study_design_scores_gemma":[0.004893328,0.0005165735,0.00090471614,0.000407202,0.000065203334,0.000021192292,0.000122868,0.99202424,0.0000584157,0.00004788449,0.0006218749,0.00031649327],"about_ca_topic_score_codex":0.0002976873,"about_ca_topic_score_gemma":0.0005412333,"teacher_disagreement_score":0.99150425,"about_ca_system_score_codex":0.00018975369,"about_ca_system_score_gemma":0.00012194338,"threshold_uncertainty_score":0.99992365},"labels":[],"label_agreement":null},{"id":"W3159863916","doi":"","title":"Cooperative Output Regulation with Mixed Time- and Event-triggered Observers.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Observer (physics); Control theory (sociology); Convergence (economics); Zeno's paradoxes; Bounded function; Computer science; Function (biology); Event (particle physics); Sampling (signal processing); Discrete time and continuous time; Exponential function; Network topology; Mathematics; Control (management); Statistics; Artificial intelligence; Telecommunications","score_opus":0.049053068827063076,"score_gpt":0.17126145984107613,"score_spread":0.12220839101401305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159863916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42546585,0.0001309797,0.5725327,0.00015948614,0.00036319517,0.0005789862,0.00004801406,0.0002247992,0.00049597357],"genre_scores_gemma":[0.99416107,0.00003241469,0.001053707,0.000046386096,0.000046806756,0.0000027082053,0.0001746114,0.000020425909,0.0044618924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973652,0.00040560125,0.00026726248,0.0014270747,0.00017655849,0.00035832424],"domain_scores_gemma":[0.9975666,0.00011528735,0.0003729059,0.0012378047,0.0004923945,0.00021502623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026687654,0.0004139954,0.00054659875,0.00017508092,0.00019079643,0.0004336482,0.0010027386,0.00029988642,0.000024899226],"category_scores_gemma":[0.00004687411,0.00043303779,0.0001392432,0.00064052857,0.00010857314,0.00071367616,0.0011792891,0.00038924062,0.00005618091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029115687,0.00045093606,0.007634179,0.00029635444,0.0015369575,0.0020872455,0.0015413007,0.9222796,0.0011854742,0.058518417,0.0019594012,0.002218983],"study_design_scores_gemma":[0.0020686602,0.00010461398,0.011701607,0.00030913227,0.00015237012,0.0000131407805,0.00019027576,0.9833815,0.00040727362,0.0006521559,0.00030309483,0.00071618264],"about_ca_topic_score_codex":0.00019651845,"about_ca_topic_score_gemma":0.00012490133,"teacher_disagreement_score":0.571479,"about_ca_system_score_codex":0.0002875612,"about_ca_system_score_gemma":0.00036553576,"threshold_uncertainty_score":0.9998121},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.03542768205325776,"score_gpt":0.32149202255703924,"score_spread":0.2860643405037815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165280930","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027116286,0.96550214,0.03078841,0.00031126934,0.001950575,0.0011134755,0.00024129973,0.000027564449,0.000038121656],"genre_scores_gemma":[0.0032902097,0.9945775,0.00095020037,0.00036959132,0.0006446838,0.000026914304,0.000048772756,0.000052646035,0.00003943182],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9933431,0.0013529633,0.00331771,0.0005039954,0.0010260914,0.00045611293],"domain_scores_gemma":[0.99156296,0.0014531277,0.00411923,0.0011005072,0.0014628919,0.00030126286],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015768561,0.00086651323,0.006259015,0.000282642,0.00010359007,0.00016233054,0.0023566876,0.0003353336,0.000018098815],"category_scores_gemma":[0.0021415362,0.0005336146,0.0017709668,0.0009796018,0.0001016202,0.00033461134,0.00023623959,0.0010052674,0.000029852674],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013655672,0.0014896672,0.000020178793,0.058619473,0.0041371738,0.0009838077,0.0003738617,0.001056656,0.00005945134,0.002240561,0.008016264,0.92286634],"study_design_scores_gemma":[0.0040669595,0.0007227382,0.000009884744,0.18170062,0.0014572162,0.0007233668,0.000010297371,0.005293305,0.000009531566,0.000027773596,0.8053037,0.00067463325],"about_ca_topic_score_codex":0.0000045863617,"about_ca_topic_score_gemma":0.000003941461,"teacher_disagreement_score":0.92219174,"about_ca_system_score_codex":0.00026802163,"about_ca_system_score_gemma":0.0013241024,"threshold_uncertainty_score":0.9997115},"labels":[],"label_agreement":null},{"id":"W3165400679","doi":"","title":"Scalable Multi-Robot System for Non-myopic Spatial Sampling.","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Scalability; Robot; Computer science; Sampling (signal processing); Constraint (computer-aided design); Adaptive sampling; Distributed computing; Field (mathematics); Motion planning; Real-time computing; Focus (optics); Key (lock); Artificial intelligence; Computer vision; Engineering; Mathematics","score_opus":0.09719552001684933,"score_gpt":0.20996586742039094,"score_spread":0.11277034740354161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3165400679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03008205,0.00009513854,0.96343666,0.00005990427,0.0039009424,0.0014043032,0.00014567543,0.00054492016,0.00033039087],"genre_scores_gemma":[0.98131347,0.000016092414,0.016686393,0.000041484036,0.0002635596,0.000021208542,0.00016816083,0.000044670498,0.0014449747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996179,0.00020301477,0.0005173168,0.0021171262,0.00019186703,0.0007916681],"domain_scores_gemma":[0.9959261,0.00023814419,0.0005734106,0.0023190628,0.0006098349,0.00033344448],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004667241,0.000588476,0.000895766,0.00028403001,0.00031548287,0.00060150103,0.003056677,0.000569351,0.000010935679],"category_scores_gemma":[0.00009567388,0.00071333884,0.0005930122,0.0005750044,0.000072359784,0.00045486377,0.0022442986,0.000539499,0.00010974686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014318404,0.00086359214,0.0073895482,0.003749792,0.0013606508,0.0012558947,0.0007626026,0.9323684,0.001881211,0.045451697,0.0007035073,0.0040699164],"study_design_scores_gemma":[0.0024298013,0.00005129018,0.0016531994,0.00059634674,0.00015240957,0.000009997711,0.0002339116,0.9928752,0.00046112278,0.00017424976,0.00061637803,0.0007460823],"about_ca_topic_score_codex":0.0013204797,"about_ca_topic_score_gemma":0.0002756283,"teacher_disagreement_score":0.9512314,"about_ca_system_score_codex":0.00081037794,"about_ca_system_score_gemma":0.00055622426,"threshold_uncertainty_score":0.99953175},"labels":[],"label_agreement":null},{"id":"W3166143222","doi":"10.1109/tnnls.2021.3085396","title":"Nonnegative Consensus Tracking of Networked Systems With Convergence Rate Optimization","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Innovation and Technology Fund; Research Grants Council, University Grants Committee","keywords":"MIMO; Computer science; Rate of convergence; Semidefinite programming; Convergence (economics); Control theory (sociology); Graph; Mathematical optimization; Controller (irrigation); Optimization problem; Protocol (science); Control (management); Mathematics; Theoretical computer science; Algorithm; Artificial intelligence","score_opus":0.013930930954332923,"score_gpt":0.21404264210779933,"score_spread":0.2001117111534664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166143222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018957932,0.0010962754,0.97663283,0.0000990157,0.002416735,0.0005097006,0.00000973253,0.0002029883,0.00007478711],"genre_scores_gemma":[0.9986558,0.000080775026,0.000552538,0.00002666807,0.00011681151,0.00006433249,0.000007895493,0.000029650728,0.00046553445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966397,0.0013230979,0.0006497504,0.0006238142,0.00033530119,0.00042832165],"domain_scores_gemma":[0.9976887,0.0007637574,0.0004941547,0.00041203364,0.000478677,0.00016268594],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006127217,0.0003102943,0.0005714686,0.00010691868,0.00044441668,0.00039173025,0.0002638566,0.0001511941,0.0000051780435],"category_scores_gemma":[0.000020864138,0.0002724281,0.00009420215,0.0007959375,0.00009926951,0.00029397113,0.0000049545097,0.0005743159,0.000002289565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060749735,0.000047358637,0.00017055066,0.00009280164,0.00013115049,0.000063907275,0.00023077308,0.9973333,0.00018618861,0.00022669935,0.000024087954,0.0014324306],"study_design_scores_gemma":[0.0010153981,0.00023886138,0.00010309566,0.0004694506,0.00005279263,0.00021260894,0.0005874554,0.99677545,0.00014358385,5.69831e-7,0.00011425765,0.00028648382],"about_ca_topic_score_codex":0.00021016548,"about_ca_topic_score_gemma":0.000017254559,"teacher_disagreement_score":0.9796979,"about_ca_system_score_codex":0.00005131627,"about_ca_system_score_gemma":0.000066618224,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W3169775723","doi":"10.1109/lcsys.2021.3089136","title":"Spectral Properties of the Normalized Rigidity Matrix for Triangular Formations","year":2021,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Rigidity (electromagnetism); Singular value; Mathematics; Infinitesimal; Matrix (chemical analysis); Mathematical analysis; Transformation matrix; Pure mathematics; Classical mechanics; Physics; Kinematics; Eigenvalues and eigenvectors","score_opus":0.01996165510481244,"score_gpt":0.22771625067715864,"score_spread":0.2077545955723462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169775723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120931916,0.0009634361,0.86385065,0.006389781,0.0049662623,0.0024655687,0.00019307675,0.00015875047,0.00008056615],"genre_scores_gemma":[0.9979335,0.000001686165,0.0004135515,0.00057218596,0.00035337117,0.00044853133,0.000006139665,0.000017251805,0.0002537686],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99719113,0.0005170361,0.0008881204,0.00037415794,0.0005283934,0.0005011874],"domain_scores_gemma":[0.9977083,0.00017687526,0.0005387122,0.0011276737,0.00035576298,0.00009267189],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007681694,0.00024415916,0.00060913677,0.00007997061,0.00024942658,0.00032351454,0.0011837204,0.000091990594,0.0000017781201],"category_scores_gemma":[0.00019447265,0.00017289302,0.0004723108,0.00037536194,0.000069808375,0.0005752816,0.00005943698,0.00013363844,0.000017556047],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007554559,0.00009539946,0.00038894,0.00041611213,0.00038252672,0.000013836729,0.00054546987,0.01729708,0.95916855,0.012401873,0.009098032,0.00011661002],"study_design_scores_gemma":[0.024051141,0.00010433651,0.0014111664,0.00070640875,0.00033513314,0.00023693508,0.00033607727,0.79808056,0.14182286,0.000119921744,0.031786013,0.001009464],"about_ca_topic_score_codex":0.00016615701,"about_ca_topic_score_gemma":0.000027575106,"teacher_disagreement_score":0.8770016,"about_ca_system_score_codex":0.00014839332,"about_ca_system_score_gemma":0.00018612594,"threshold_uncertainty_score":0.7050373},"labels":[],"label_agreement":null},{"id":"W3171097229","doi":"10.1109/icra48506.2021.9561304","title":"Model Predictive Control for Dynamic Quadrotor Bearing Formations","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Model predictive control; Control theory (sociology); Robustness (evolution); Computer science; Double integrator; Kinematics; Control engineering; Decentralised system; Visual servoing; Computation; Controller (irrigation); Bearing (navigation); Robot; Multi-agent system; Control (management); Engineering; Artificial intelligence; Algorithm","score_opus":0.024988380204900636,"score_gpt":0.2689122604976338,"score_spread":0.24392388029273315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171097229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008129928,0.00014002372,0.9902811,0.0007824055,0.0012178498,0.003749358,0.0007838981,0.00064229156,0.0015900786],"genre_scores_gemma":[0.90905434,0.0000056763374,0.086372,0.00020390657,0.00007204705,0.0032363003,0.0003414966,0.000027868447,0.00068636745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972466,0.00009499803,0.00074355217,0.00091761514,0.00045548074,0.0005417201],"domain_scores_gemma":[0.9970898,0.00023144152,0.00040610705,0.0014844395,0.00060809014,0.00018011074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048716206,0.00039954516,0.0006431439,0.00017535072,0.00020109849,0.00093422836,0.0018174511,0.00035066158,0.000006947149],"category_scores_gemma":[0.00016385825,0.0004009525,0.00045202704,0.0001479559,0.000027754731,0.0007535525,0.0010355215,0.00042588718,0.000017683507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028347455,0.0001766179,0.00007777672,0.00038383825,0.00059054274,0.000005835365,0.0011867802,0.9547812,0.0005766183,0.03876505,0.0009349034,0.0024925235],"study_design_scores_gemma":[0.001466754,0.0000331697,0.00019134412,0.00014032687,0.000068398156,0.000004639762,0.000120189994,0.99408233,0.000050274622,0.0033595723,0.000099128214,0.0003838448],"about_ca_topic_score_codex":0.00008098235,"about_ca_topic_score_gemma":0.00008491846,"teacher_disagreement_score":0.90824133,"about_ca_system_score_codex":0.00041867036,"about_ca_system_score_gemma":0.0006121595,"threshold_uncertainty_score":0.99984425},"labels":[],"label_agreement":null},{"id":"W3175809341","doi":"10.23919/ecc57647.2023.10178297","title":"Navigating A Mobile Robot Using Switching Distributed Sensor Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Trajectory; Computer science; Robot; Controller (irrigation); Mobile robot; Estimator; Task (project management); Real-time computing; Wireless sensor network; State (computer science); Control theory (sociology); Artificial intelligence; Engineering; Control (management); Algorithm; Mathematics","score_opus":0.027323933505520374,"score_gpt":0.2984812225610989,"score_spread":0.2711572890555785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175809341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10674441,0.000049036305,0.8899837,0.00020812714,0.0007887939,0.00042379854,0.000015861842,0.0016884475,0.00009783505],"genre_scores_gemma":[0.9821528,0.0000032441276,0.01730347,0.0001103572,0.00020883344,0.000056323333,0.00006963062,0.00002549673,0.00006979871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974672,0.00015577674,0.00051998696,0.00062400254,0.0004156681,0.00081732066],"domain_scores_gemma":[0.9984473,0.00026017014,0.00019946821,0.0007776032,0.00011763707,0.00019780832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071090146,0.00025899513,0.00033036555,0.000052962612,0.00035939564,0.0005349288,0.0009260266,0.00011672766,0.000012131571],"category_scores_gemma":[0.00009156807,0.0002417349,0.0001416309,0.0016867795,0.000018935958,0.00057260675,0.0005004082,0.0003680386,0.00019269307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045308357,0.000039902923,0.001921185,0.000021373164,0.00006493828,0.00014574907,0.00038322105,0.9549413,0.009969339,0.0013913735,0.0004866281,0.03063048],"study_design_scores_gemma":[0.00045910472,0.000021921907,0.0008774046,0.000102894344,0.000009477544,0.00003484201,0.00026958692,0.997167,0.00029369694,0.000058899594,0.00041083893,0.00029431432],"about_ca_topic_score_codex":0.0003180425,"about_ca_topic_score_gemma":0.000013040454,"teacher_disagreement_score":0.8754084,"about_ca_system_score_codex":0.00013845896,"about_ca_system_score_gemma":0.00004692415,"threshold_uncertainty_score":0.98576635},"labels":[],"label_agreement":null},{"id":"W3178494447","doi":"10.1109/icps49255.2021.9468180","title":"Distributed Robust Finite-Time Containment Control of Euler-Lagrange Systems","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Convergence (economics); Control theory (sociology); Controller (irrigation); Computer science; Convex hull; Terminal sliding mode; Sliding mode control; Euler's formula; Mathematics; Control (management); Regular polygon; Physics","score_opus":0.014385052520880556,"score_gpt":0.20588314786344822,"score_spread":0.19149809534256768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3178494447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001612452,0.0010344973,0.9912068,0.0009834238,0.0009993892,0.0006348108,0.0006094557,0.0003200651,0.002599101],"genre_scores_gemma":[0.99685466,0.00000884691,0.0014277085,0.00016765638,0.00009256182,0.00009099312,0.00018462814,0.000018010556,0.0011549355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99661136,0.00042352293,0.0009331722,0.0006817494,0.0007551052,0.000595078],"domain_scores_gemma":[0.9965835,0.00081311,0.00038749527,0.0013134304,0.0006463977,0.00025603798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006176482,0.00032207975,0.0008054389,0.00009100164,0.0001026876,0.00029775334,0.001101207,0.00015184331,0.00013728047],"category_scores_gemma":[0.0003577616,0.00029068135,0.00024520684,0.00068034424,0.000058671616,0.0003972625,0.00023346124,0.00014981552,0.00031919123],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003256215,0.004318911,0.017647864,0.0011859802,0.003928455,0.0021737996,0.0010896281,0.21105552,0.13036714,0.56762475,0.051204912,0.0090773795],"study_design_scores_gemma":[0.005958091,0.00015557164,0.0021352763,0.00015556929,0.0000861044,0.000058841397,0.00024308113,0.9702527,0.0034534137,0.00007385922,0.016857095,0.0005704333],"about_ca_topic_score_codex":0.00019867231,"about_ca_topic_score_gemma":0.000013713911,"teacher_disagreement_score":0.9952422,"about_ca_system_score_codex":0.00017486062,"about_ca_system_score_gemma":0.00019644134,"threshold_uncertainty_score":0.9999545},"labels":[],"label_agreement":null},{"id":"W3182775342","doi":"10.1177/01423312211024006","title":"Adaptive consensus for heterogeneous unknown nonlinear multi-agent systems with asymmetric input dead-zone: A finite-time approach","year":2021,"lang":"en","type":"article","venue":"Transactions of the Institute of Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Nonlinear system; Multi-agent system; Artificial neural network; Dead zone; Lyapunov function; Consensus; Computer science; Mathematics; Adaptive control; Lyapunov stability; Imperfect; Artificial intelligence; Control (management)","score_opus":0.03653924416721825,"score_gpt":0.21886791935825742,"score_spread":0.18232867519103918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182775342","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029456012,0.0018760514,0.9921805,0.0002825942,0.00058771233,0.0017348628,0.00022364408,0.000056359448,0.0001126733],"genre_scores_gemma":[0.97499996,0.000012383947,0.02450895,0.000035170415,0.00003454507,0.0002190385,0.000006057301,0.000016754382,0.0001671373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975259,0.00021523492,0.00066182483,0.00047727666,0.0007986608,0.0003211561],"domain_scores_gemma":[0.9973923,0.00016027628,0.00041199347,0.00074263907,0.0011697501,0.00012305207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070860394,0.00029295034,0.00064953294,0.00015984754,0.00024406877,0.00008397942,0.0006063879,0.00010711438,0.0000011300087],"category_scores_gemma":[0.00010139964,0.00021456578,0.0002680064,0.00059203734,0.00018365575,0.00017364803,0.000024109595,0.00015181018,0.0000019088613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011486837,0.0030300429,0.00023296878,0.00094139134,0.004733239,0.000033946504,0.0005990677,0.92984134,0.03492986,0.0028258367,0.00006931627,0.021614287],"study_design_scores_gemma":[0.010064892,0.0003649137,0.000115617324,0.00026753545,0.00054218527,0.00009349559,0.000080341844,0.97684026,0.009405302,0.000009986598,0.001896183,0.0003192878],"about_ca_topic_score_codex":0.00016536817,"about_ca_topic_score_gemma":0.000103156686,"teacher_disagreement_score":0.97205436,"about_ca_system_score_codex":0.00012391646,"about_ca_system_score_gemma":0.00044199798,"threshold_uncertainty_score":0.8749739},"labels":[],"label_agreement":null},{"id":"W3184318763","doi":"10.23919/acc50511.2021.9483285","title":"Formation Control with Dynamic Non-Autonomous Leader Using Sampled-Data Event-Triggered Communication","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Faculty of Graduate Studies, Dalhousie University; Natural Sciences and Engineering Research Council of Canada; Research Nova Scotia","keywords":"Control theory (sociology); Computer science; Controller (irrigation); Mobile robot; Stability (learning theory); Lyapunov function; State (computer science); Tracking (education); Control (management); Event (particle physics); Protocol (science); Robot; Algorithm; Artificial intelligence","score_opus":0.04068224852406258,"score_gpt":0.2849862090571321,"score_spread":0.24430396053306955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184318763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007832754,0.0003196318,0.9886812,0.0018082939,0.00014396154,0.0004785934,0.000072348,0.00019657315,0.0004666353],"genre_scores_gemma":[0.9536846,0.0000088817005,0.04523591,0.00034937257,0.00001943874,0.000023189568,0.00046792373,0.000013880662,0.00019677474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811137,0.0002433312,0.0004759591,0.00046875497,0.00035500474,0.00034558264],"domain_scores_gemma":[0.99632424,0.00015313373,0.00027871173,0.0028293442,0.00031975837,0.00009478123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048153606,0.00019236136,0.0002971098,0.000082298655,0.0002249565,0.00045895844,0.0017167514,0.00007969103,0.000022885117],"category_scores_gemma":[0.000061177714,0.0001684364,0.000051227275,0.00044755172,0.00003590579,0.002207287,0.00040258607,0.00014826527,0.0000685683],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006093776,0.004372837,0.007886142,0.0011747498,0.0036497267,0.00058415794,0.011008395,0.1854764,0.29358205,0.10211323,0.01577443,0.37376848],"study_design_scores_gemma":[0.002282578,0.000024719859,0.0007879147,0.000063437365,0.000035851008,0.000075152675,0.0002224943,0.9943534,0.0007456812,0.00012120966,0.0010597591,0.0002278086],"about_ca_topic_score_codex":0.00022616734,"about_ca_topic_score_gemma":0.00048255254,"teacher_disagreement_score":0.94585186,"about_ca_system_score_codex":0.00022719848,"about_ca_system_score_gemma":0.00028675055,"threshold_uncertainty_score":0.68686366},"labels":[],"label_agreement":null},{"id":"W3185520260","doi":"10.82308/55504","title":"Team optimal decentralized estimation and control of networked linear quadratic systems","year":2021,"lang":"en","type":"article","venue":"eScholarship@McGill (McGill)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fonds de recherche du Québec – Nature et technologies; Isfahan University of Technology; Natural Sciences and Engineering Research Council of Canada; University of Southern California; Mitacs; McGill University","keywords":"Estimation; Computer science; Control (management); Quadratic equation; Linear system; Mathematical optimization; Optimal control; Control theory (sociology); Mathematics; Engineering; Artificial intelligence; Systems engineering","score_opus":0.013566252890405889,"score_gpt":0.22838971855491827,"score_spread":0.21482346566451238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3185520260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8652951,0.005149236,0.116636164,0.00024430986,0.0034729263,0.0028391504,0.0010817201,0.0010346709,0.0042467257],"genre_scores_gemma":[0.9861303,0.00007594309,0.013264595,0.00012838394,0.000035473877,0.00009254422,0.00005370547,0.000044567358,0.00017451934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953043,0.0009928545,0.0012134786,0.000940801,0.0007991116,0.00074947655],"domain_scores_gemma":[0.99666893,0.0005634494,0.00062715693,0.0011106281,0.00061621016,0.00041360108],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013264581,0.0004581259,0.0009172333,0.00015665941,0.00047591922,0.0002695425,0.0008439078,0.00027600897,0.000014321638],"category_scores_gemma":[0.00096031476,0.0004672368,0.00020865741,0.00078363286,0.000087132976,0.0012974814,0.00028449565,0.00042401842,0.00006499604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002774868,0.0008863173,0.000722646,0.0008524985,0.001033943,0.00036962968,0.00004280831,0.12838618,0.117829576,0.6188942,0.000029974362,0.1306747],"study_design_scores_gemma":[0.0056628995,0.00016376279,0.00048057578,0.00038804195,0.00015293524,0.0001618522,0.00007498209,0.96698064,0.0145576475,0.0011695129,0.009534456,0.00067269587],"about_ca_topic_score_codex":0.00014923338,"about_ca_topic_score_gemma":0.000026636611,"teacher_disagreement_score":0.83859444,"about_ca_system_score_codex":0.00026654935,"about_ca_system_score_gemma":0.00009145003,"threshold_uncertainty_score":0.9997779},"labels":[],"label_agreement":null},{"id":"W3186771113","doi":"10.1109/med51440.2021.9480212","title":"A Near-Optimal Solution to a Class of Deep Structured Teams with Nonlinear Dynamics","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Class (philosophy); Dynamics (music); Computer science; Nonlinear dynamical systems; Mathematical optimization; Artificial intelligence; Mathematics; Physics","score_opus":0.0055345857146823,"score_gpt":0.21662269365425324,"score_spread":0.21108810793957095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186771113","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0953661,0.000022522932,0.9021012,0.000973984,0.00019163919,0.00022946787,0.000024963976,0.00012037177,0.0009697411],"genre_scores_gemma":[0.73975974,3.332425e-7,0.2597694,0.00014338021,0.000028879647,0.000010810725,0.000030093626,0.000008867784,0.00024847896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998477,0.000067941575,0.0002989322,0.00042793705,0.00040328724,0.00032494217],"domain_scores_gemma":[0.99865884,0.000038727663,0.00010959628,0.0006982807,0.00034554477,0.00014901005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013060439,0.00015759312,0.00026591413,0.000051459658,0.000073310264,0.00017360701,0.00055070856,0.000075654614,0.000021177304],"category_scores_gemma":[0.000052204217,0.00013009635,0.00006647139,0.000646837,0.00003781551,0.00023782098,0.00022437732,0.00010327239,0.00002955833],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068851374,0.0016747393,0.025719853,0.00042466272,0.0013058753,0.0008243016,0.0066549834,0.38744956,0.060659923,0.26135564,0.002851592,0.25039038],"study_design_scores_gemma":[0.00095307326,0.00013313923,0.0019729484,0.000020654394,0.00001230312,0.000051002047,0.00015739819,0.9933933,0.002331137,0.000032958385,0.0007695957,0.00017246578],"about_ca_topic_score_codex":0.00014986075,"about_ca_topic_score_gemma":0.0013140047,"teacher_disagreement_score":0.6443937,"about_ca_system_score_codex":0.00014626089,"about_ca_system_score_gemma":0.00023532879,"threshold_uncertainty_score":0.5305175},"labels":[],"label_agreement":null},{"id":"W3188394678","doi":"10.1109/ebccsp53293.2021.9502363","title":"Event-Based Broadcasting for Stochastic Subgradient Algorithms","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Subgradient method; Computer science; Broadcasting (networking); Convergence (economics); Event (particle physics); Stochastic optimization; Stochastic approximation; Set (abstract data type); Algorithm; Mathematical optimization; Protocol (science); Stochastic process; Distributed computing; Theoretical computer science; Machine learning; Computer network; Mathematics; Asynchronous communication","score_opus":0.025238328759609737,"score_gpt":0.26913339146943005,"score_spread":0.2438950627098203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188394678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000794852,0.00020481569,0.9959711,0.00103224,0.0010253014,0.00039784974,0.00002714456,0.00027305412,0.00027364952],"genre_scores_gemma":[0.9158852,2.0926993e-7,0.08238367,0.00038907095,0.00012883246,0.00014522209,0.00003989563,0.000014393201,0.0010135192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982745,0.000066792294,0.00034330296,0.0005433488,0.00030482328,0.0004672103],"domain_scores_gemma":[0.99850684,0.00032216453,0.00010718265,0.00060366985,0.00030175218,0.00015840394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032373492,0.00016848142,0.00022650829,0.00006396236,0.00014558774,0.00025368293,0.0005545239,0.000053602944,0.000022486816],"category_scores_gemma":[0.00026600706,0.00016072071,0.0001651993,0.0003677148,0.000016319696,0.000198957,0.000110363784,0.00007217032,0.000058484507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006628346,0.0016926387,0.0006294337,0.00039761869,0.00045905562,0.00043012205,0.0010787073,0.25660846,0.027118878,0.2803335,0.015346672,0.41583863],"study_design_scores_gemma":[0.0013523696,0.00005742012,0.0001462475,0.000038500133,0.000011894147,0.000016860657,0.000038878396,0.9919084,0.0029506064,0.00025484725,0.0030155596,0.00020842208],"about_ca_topic_score_codex":0.000028294287,"about_ca_topic_score_gemma":0.000020400561,"teacher_disagreement_score":0.9150903,"about_ca_system_score_codex":0.00009571002,"about_ca_system_score_gemma":0.0002241564,"threshold_uncertainty_score":0.65540004},"labels":[],"label_agreement":null},{"id":"W3191892035","doi":"10.1137/20m1328130","title":"Formation Tracking of Nonholonomic Systems on the Special Euclidean Group under Fixed and Switching Topologies: An Affine Formation Strategy","year":2021,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Mathematics; Affine transformation; Network topology; Group (periodic table); Euclidean geometry; Nonholonomic system; Euclidean group; Pure mathematics; Topology (electrical circuits); Combinatorics; Affine space; Geometry; Computer science; Robot; Artificial intelligence","score_opus":0.025123598587166715,"score_gpt":0.23902137231105283,"score_spread":0.21389777372388613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191892035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06631819,0.00021719682,0.930752,0.0015940634,0.00050668995,0.00029352054,0.000008969438,0.000031443644,0.00027796585],"genre_scores_gemma":[0.9982794,0.00012765841,0.0009096927,0.00019580298,0.00044590054,0.0000075368325,0.00001706674,0.000007957252,0.000008992712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983903,0.0003972113,0.00056749786,0.00019677203,0.0002540791,0.00019413822],"domain_scores_gemma":[0.99869674,0.00025517825,0.00055891735,0.00020869811,0.00020259425,0.00007787827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008529856,0.00015478839,0.00026008478,0.00011885998,0.00033364637,0.0007979192,0.00021197084,0.00008186393,0.0000071197783],"category_scores_gemma":[0.00010863706,0.0001113115,0.000051864798,0.00014275798,0.000021437841,0.0016979217,0.000027820492,0.00020414188,0.0000014453792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010613714,0.000069078684,0.000048498106,0.00002827654,0.00004042219,0.00001001555,0.0005315763,0.9335377,0.002337445,0.046719488,0.00005133408,0.01651999],"study_design_scores_gemma":[0.0020157185,0.00034528621,0.0014993245,0.00012219817,0.000022453969,0.00016009511,0.00107955,0.9939294,0.00019162173,0.00045101176,0.000059852857,0.0001234769],"about_ca_topic_score_codex":0.0000070003694,"about_ca_topic_score_gemma":0.000017097198,"teacher_disagreement_score":0.9319612,"about_ca_system_score_codex":0.00008777291,"about_ca_system_score_gemma":0.000039295177,"threshold_uncertainty_score":0.7694353},"labels":[],"label_agreement":null},{"id":"W3194284630","doi":"10.1007/s11071-021-06818-0","title":"Finite-time encirclement rotating tracking for surface formation targets with bearing-only measurements","year":2021,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Defense Basic Scientific Research Program of China; National Natural Science Foundation of China","keywords":"Ellipse; Trajectory; Control theory (sociology); Tracking (education); Rotation (mathematics); Estimator; Translation (biology); Acceleration; Bounded function; Mathematics; Computer science; Mathematical analysis; Physics; Geometry; Artificial intelligence; Control (management); Classical mechanics","score_opus":0.028460732699020188,"score_gpt":0.25357847428535185,"score_spread":0.22511774158633166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194284630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050582178,0.00006397389,0.94752294,0.00037876735,0.0002519258,0.0006203317,0.00011942555,0.00018129277,0.000279161],"genre_scores_gemma":[0.58335584,0.0000025494282,0.41535997,0.0001432593,0.000097925265,0.000037609905,0.0006874751,0.0000364747,0.00027889002],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978515,0.00009193145,0.0004840119,0.00047213573,0.0006215482,0.00047890117],"domain_scores_gemma":[0.9982027,0.00017749294,0.00029275063,0.0005219696,0.0006969293,0.00010818599],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067491835,0.00022103061,0.0002781422,0.000053000516,0.00023544735,0.0003709025,0.0005131192,0.000078719815,0.0000062685845],"category_scores_gemma":[0.0002050505,0.00022487821,0.00009570062,0.00034624126,0.000015657044,0.00077808095,0.00012682541,0.00013971883,0.00003730464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019731265,0.0015826036,0.05118199,0.0010761354,0.0009423084,0.00017200931,0.005057562,0.561719,0.02552933,0.0068284767,0.00037343724,0.34533983],"study_design_scores_gemma":[0.0013352198,0.00009291038,0.0007782807,0.000105931154,0.000025528048,0.00002090476,0.000090386275,0.9946491,0.0020564394,0.00005676282,0.0005229281,0.00026561136],"about_ca_topic_score_codex":0.000018195571,"about_ca_topic_score_gemma":0.00021986415,"teacher_disagreement_score":0.5327737,"about_ca_system_score_codex":0.0002917248,"about_ca_system_score_gemma":0.0002589818,"threshold_uncertainty_score":0.9170267},"labels":[],"label_agreement":null},{"id":"W3195713246","doi":"10.17023/v700-pn93","title":"Decentralized Optimization With Non-Identical Sampling In Presence Of Stragglers","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Compute Canada","keywords":"Heuristic; Weighting; Mathematical optimization; Estimator; Convergence (economics); Variance (accounting); Computer science; Sampling (signal processing); Variable (mathematics); Regular polygon; Mathematics; Statistics","score_opus":0.06391244786781124,"score_gpt":0.1993619378314037,"score_spread":0.13544948996359246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195713246","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.266301,0.000034607845,0.7328299,0.000027294358,0.00024065652,0.0003527174,0.000010273227,0.00005488309,0.00014861433],"genre_scores_gemma":[0.9815944,0.000081356244,0.018189143,0.0000097760285,0.000013134278,0.0000018788288,0.000041812007,0.000013261175,0.000055271124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978415,0.00019288248,0.0003888848,0.0009992293,0.00019208483,0.00038546175],"domain_scores_gemma":[0.9979985,0.00014792047,0.00038628426,0.0010391063,0.0002804481,0.0001477636],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027196849,0.00027195076,0.0004967553,0.00025163594,0.000046224424,0.000178861,0.0014978709,0.00022732271,0.0000194287],"category_scores_gemma":[0.00008689674,0.00030747073,0.00013560131,0.000909993,0.00009523571,0.0005144331,0.0008751127,0.00038018398,0.0000034868149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004402121,0.00012099921,0.010928358,0.00010935193,0.00007832023,0.00028389512,0.00022863066,0.9820122,0.00008744981,0.0060196673,0.0000055972196,0.00008152093],"study_design_scores_gemma":[0.0014048617,0.00002815088,0.005214416,0.0005370113,0.000049541315,0.0000043769587,0.0002195994,0.9918185,0.00015667929,0.00025965914,0.0000054415154,0.00030175698],"about_ca_topic_score_codex":0.0005732668,"about_ca_topic_score_gemma":0.00022187893,"teacher_disagreement_score":0.71529335,"about_ca_system_score_codex":0.00022987303,"about_ca_system_score_gemma":0.0003886565,"threshold_uncertainty_score":0.9999377},"labels":[],"label_agreement":null},{"id":"W3196681936","doi":"10.1007/978-3-030-63591-6_22","title":"Impulsive Distance-Based Formation Tracking Control of Multi-agent Systems","year":2021,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Impulse (physics); Lyapunov function; Integrator; Computer science; Multi-agent system; Controller (irrigation); Term (time); Moment (physics); Tracking (education); Control (management); Mathematics; Artificial intelligence; Bandwidth (computing)","score_opus":0.026968890135058314,"score_gpt":0.2491061568374424,"score_spread":0.22213726670238407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3196681936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027438995,0.0011695783,0.9841551,0.000036488218,0.0007541454,0.0017810392,0.00094429,0.00015266222,0.010979237],"genre_scores_gemma":[0.31495875,0.00031131168,0.6537595,0.00010289837,0.0003557372,0.00050596235,0.00031904812,0.00040660513,0.029280195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948609,0.000027629565,0.0023776127,0.00080194254,0.0012867592,0.0006451411],"domain_scores_gemma":[0.9942502,0.00047172123,0.0027730884,0.0006996982,0.0016238178,0.00018148712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010205378,0.00077373296,0.001588506,0.0004718946,0.00010653432,0.0005628155,0.0013018465,0.00042977976,0.000014663306],"category_scores_gemma":[0.0005367198,0.00081226893,0.00023038959,0.00017530836,0.00012153119,0.0004784035,0.00021573047,0.0006303923,0.000035992274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012318739,0.00021277768,0.000062878586,0.0064729583,0.0001615018,0.00011122412,0.0014485277,0.00087825896,0.0004942274,0.98783284,0.00024215442,0.0020703513],"study_design_scores_gemma":[0.0029039998,0.00010777355,0.000056706886,0.0060927216,0.00022911803,0.000033839966,0.00033027327,0.9673567,0.00042436222,0.013839941,0.007501493,0.0011230978],"about_ca_topic_score_codex":0.000016116335,"about_ca_topic_score_gemma":0.000018336632,"teacher_disagreement_score":0.9739929,"about_ca_system_score_codex":0.00067538646,"about_ca_system_score_gemma":0.00026242627,"threshold_uncertainty_score":0.9994328},"labels":[],"label_agreement":null},{"id":"W3198091728","doi":"10.1007/978-3-030-63591-6_20","title":"Impulsive Consensus of Complex-Valued Multi-agent Systems with Hybrid Protocols","year":2021,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Protocol (science); Multi-agent system; Network topology; Consensus; Computer science; Domain (mathematical analysis); Topology (electrical circuits); Lyapunov function; Control theory (sociology); Complex network; Mathematics; Artificial intelligence; Computer network; Control (management)","score_opus":0.048429133317558645,"score_gpt":0.2847019810175241,"score_spread":0.23627284769996543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198091728","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000994381,0.00029226695,0.94228226,0.00004330801,0.00042243933,0.023297418,0.0016606945,0.0002741764,0.031628005],"genre_scores_gemma":[0.0075001284,0.000035488774,0.9500575,0.000037563725,0.00015486803,0.0041257977,0.00013157059,0.0003034517,0.03765362],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99401754,0.000034623175,0.002362969,0.0011925681,0.0016005277,0.00079177634],"domain_scores_gemma":[0.99335533,0.00036642913,0.0028965878,0.0010444742,0.0020725443,0.000264648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009653437,0.00101821,0.002144658,0.00044849992,0.00011287675,0.00054416,0.001701998,0.0003091435,0.000029638746],"category_scores_gemma":[0.00041461794,0.0009577971,0.00017378242,0.00018492354,0.0003079689,0.00014961387,0.0006568413,0.00075636554,0.000055524273],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002988177,0.00039153444,0.000092555136,0.008744612,0.000462945,0.0006487086,0.00129634,0.00018004068,0.0004851288,0.98520863,0.001835661,0.0006239663],"study_design_scores_gemma":[0.0109091895,0.001219368,0.0003064699,0.031200694,0.0007712777,0.0012673644,0.0013494653,0.86570317,0.0013717853,0.048034947,0.03242576,0.0054404894],"about_ca_topic_score_codex":0.000040735427,"about_ca_topic_score_gemma":0.000018478377,"teacher_disagreement_score":0.93717366,"about_ca_system_score_codex":0.00047495347,"about_ca_system_score_gemma":0.0004921226,"threshold_uncertainty_score":0.99928725},"labels":[],"label_agreement":null},{"id":"W3198132069","doi":"10.1109/lcsys.2021.3128152","title":"Consensus-Based Distributed Estimation in the Presence of Heterogeneous, Time-Invariant Delays","year":2021,"lang":"en","type":"preprint","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Observability; Estimator; A priori and a posteriori; Upper and lower bounds; Computer science; Control theory (sociology); Convergence (economics); Wireless sensor network; Kronecker product; Transmission (telecommunications); Mathematical optimization; Distributed computing; Mathematics; Kronecker delta; Control (management); Applied mathematics; Computer network; Statistics; Telecommunications","score_opus":0.014577127143404374,"score_gpt":0.23228651893881067,"score_spread":0.2177093917954063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198132069","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06781491,0.00093447726,0.9182359,0.0055371905,0.002846587,0.003477695,0.0009176699,0.00021216336,0.00002340135],"genre_scores_gemma":[0.9965592,0.0000027500025,0.0010034335,0.0010035806,0.00017186554,0.00085992273,0.00034944763,0.000041754756,0.000008021405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9909136,0.0033702473,0.002058962,0.0013614659,0.001439663,0.0008560431],"domain_scores_gemma":[0.9925563,0.0019963202,0.0017198683,0.0031140933,0.0004490396,0.00016438226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002684329,0.00076044013,0.0015964798,0.00032882363,0.00013105663,0.0010190398,0.0035889691,0.00048156732,0.0000039867905],"category_scores_gemma":[0.0005015302,0.00064271135,0.00051289616,0.0006321156,0.00017400757,0.00019879507,0.00026553744,0.0008335651,0.00003479252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004996722,0.00016647986,0.00031429983,0.00050822814,0.00028895607,0.00063791126,0.00034862943,0.97131497,0.023722226,0.00019639278,0.0023288864,0.00012308291],"study_design_scores_gemma":[0.0026383526,0.000048917955,0.00045379938,0.0011642751,0.00011455783,0.00011700608,0.000040265037,0.9941675,0.00054797885,0.000016468392,0.00012569397,0.0005652024],"about_ca_topic_score_codex":0.0016461706,"about_ca_topic_score_gemma":0.00006513788,"teacher_disagreement_score":0.9287443,"about_ca_system_score_codex":0.00041514853,"about_ca_system_score_gemma":0.0005478048,"threshold_uncertainty_score":0.99960244},"labels":[],"label_agreement":null},{"id":"W3200793648","doi":"10.1109/taes.2021.3111719","title":"Neural Network-Based Formation Control With Target Tracking for Second-Order Nonlinear Multiagent Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backstepping; Nonlinear system; Control theory (sociology); Multi-agent system; Artificial neural network; Lyapunov function; Tracking error; Computer science; Controller (irrigation); Graph theory; Adaptive control; Mathematics; Artificial intelligence; Control (management)","score_opus":0.01115552796563327,"score_gpt":0.21916728892620557,"score_spread":0.2080117609605723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200793648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072020944,0.002372971,0.9858757,0.0006171948,0.001581664,0.0019227918,0.00013238353,0.00026019017,0.000034995854],"genre_scores_gemma":[0.9962713,0.00002154047,0.0016872,0.00021702237,0.0002193031,0.0008416784,0.000034744287,0.000047956317,0.0006592671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692565,0.00030145617,0.00054335967,0.00071497966,0.0004509447,0.0010635888],"domain_scores_gemma":[0.9980218,0.00032228,0.0003123125,0.0006425941,0.0004962722,0.00020476512],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058379286,0.00041853884,0.000618661,0.00011113844,0.00051906635,0.0007368756,0.00033446937,0.00018501104,0.0000056302506],"category_scores_gemma":[0.000008857386,0.00037329143,0.00016391884,0.0005575326,0.000036598365,0.00059382466,0.0000021651838,0.00036398973,0.000010533771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001595169,0.00016196755,0.000045858564,0.00029674533,0.00024483658,0.000015693926,0.0001529483,0.99404794,0.0026560153,0.0008040294,0.00042029427,0.0009941504],"study_design_scores_gemma":[0.005419238,0.00052209897,0.0000133755,0.00019916277,0.00008577797,0.0001609766,0.00019174152,0.9805339,0.0036361446,0.000004066974,0.0088068945,0.00042662848],"about_ca_topic_score_codex":0.00007904909,"about_ca_topic_score_gemma":0.00038507816,"teacher_disagreement_score":0.9890692,"about_ca_system_score_codex":0.00031723626,"about_ca_system_score_gemma":0.00037124485,"threshold_uncertainty_score":0.9998719},"labels":[],"label_agreement":null},{"id":"W3202406729","doi":"10.1109/spac53836.2021.9539908","title":"Group Consensus of Second-order Multi-agent Systems via Intermittent Sampled Control","year":2021,"lang":"en","type":"article","venue":"2021 International Conference on Security, Pattern Analysis, and Cybernetics（SPAC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission Foundation; Chongqing University of Science and Technology; Ministère de l'Éducation, du Loisir et du Sport Québec","keywords":"Consistency (knowledge bases); Controller (irrigation); Protocol (science); Control theory (sociology); Multi-agent system; Computer science; Range (aeronautics); Control (management); Group (periodic table); Order (exchange); Topology (electrical circuits); Mathematics; Distributed computing; Engineering; Artificial intelligence; Combinatorics","score_opus":0.02525436721362598,"score_gpt":0.2696995546711178,"score_spread":0.2444451874574918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202406729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074755795,0.00078522967,0.9177204,0.0015709861,0.0017572254,0.00050245895,0.00082128163,0.00007791552,0.0020087194],"genre_scores_gemma":[0.9972805,0.00016848813,0.00060778396,0.00047267327,0.00015791153,0.00007147273,0.0003416284,0.00002422986,0.00087532954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952751,0.0006003354,0.0012557184,0.0012186934,0.0011201209,0.0005300443],"domain_scores_gemma":[0.9959224,0.00030424845,0.0007592103,0.0010551445,0.0016285315,0.00033047018],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00056999596,0.00052480656,0.0011018916,0.0005337813,0.000108232736,0.0007041153,0.0012415192,0.0002110597,0.0009738358],"category_scores_gemma":[0.0001394019,0.00052128057,0.00046725315,0.0007274262,0.00017144858,0.00017608897,0.00047751656,0.00039042317,0.00008544196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048415747,0.008639751,0.37238374,0.0010460377,0.047582168,0.002532449,0.011116446,0.0032783912,0.06823973,0.3819861,0.0033578153,0.099353194],"study_design_scores_gemma":[0.004797288,0.00020284184,0.043300834,0.00025470284,0.00073432183,0.00009280682,0.0010273857,0.944323,0.0012830453,0.0008711511,0.002225151,0.0008874537],"about_ca_topic_score_codex":0.0014562102,"about_ca_topic_score_gemma":0.004226675,"teacher_disagreement_score":0.9410446,"about_ca_system_score_codex":0.00014493338,"about_ca_system_score_gemma":0.00014741042,"threshold_uncertainty_score":0.9999394},"labels":[],"label_agreement":null},{"id":"W3202952732","doi":"10.3390/app11199145","title":"Publish and Subscribe-Based Formation and Containment Control of Heterogeneous Robotic System with Actuator Time Delay","year":2021,"lang":"en","type":"article","venue":"Applied Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"King Fahd University of Petroleum and Minerals","keywords":"Flocking (texture); Computer science; Obstacle avoidance; Distributed computing; Obstacle; Actuator; Control reconfiguration; Interoperability; Control engineering; Middleware (distributed applications); Real-time computing; Embedded system; Engineering; Mobile robot; Robot; Artificial intelligence","score_opus":0.008507614464868581,"score_gpt":0.1879197752965483,"score_spread":0.1794121608316797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202952732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17342977,0.00030057033,0.8244447,0.00045303596,0.00008360013,0.0005530083,0.000013757441,0.0000971096,0.00062441884],"genre_scores_gemma":[0.99549824,0.0000010844512,0.0042800456,0.0001484169,0.0000115797075,0.000038609523,0.0000051810007,0.000004556667,0.00001230031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836046,0.00008522068,0.00031313574,0.00044168785,0.0005140487,0.0002854437],"domain_scores_gemma":[0.9990274,0.00018172822,0.00023123914,0.0002904962,0.00013927981,0.00012991036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006487538,0.00015201856,0.00031220727,0.000084725754,0.0001915921,0.0005119215,0.00038976598,0.000046005553,0.0000029976381],"category_scores_gemma":[0.000022044087,0.00011627865,0.000022452828,0.0003792749,0.000200808,0.0005191521,0.000075464646,0.000048526224,0.000005988238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038232398,0.00072440103,0.009883931,0.0015852186,0.00061262236,0.00041484472,0.0040886854,0.07092925,0.3297058,0.5465069,0.0004810588,0.034684982],"study_design_scores_gemma":[0.0030899358,0.0002600444,0.0007947063,0.00011436831,0.000047124213,0.00017460456,0.00055869564,0.97383696,0.020572841,0.00008593031,0.00014571742,0.0003190918],"about_ca_topic_score_codex":0.000018274926,"about_ca_topic_score_gemma":0.000022775741,"teacher_disagreement_score":0.90290767,"about_ca_system_score_codex":0.00005511314,"about_ca_system_score_gemma":0.00015186174,"threshold_uncertainty_score":0.49364704},"labels":[],"label_agreement":null},{"id":"W3205621933","doi":"10.1109/tase.2021.3115770","title":"Cooperative Localization in Mobile Robots Using Event-Triggered Mechanism: Theory and Experiments","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mobile robot; Robot; Computer science; Event (particle physics); Distributed computing; Mechanism (biology); Control engineering; Artificial intelligence; Engineering","score_opus":0.01595542731625405,"score_gpt":0.26611978208206993,"score_spread":0.2501643547658159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205621933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10880845,0.0000933544,0.8904535,0.000023877568,0.00032918784,0.00017940562,0.0000027903122,0.000099546,0.000009868243],"genre_scores_gemma":[0.99513865,0.000020438967,0.0047150124,0.00005361703,0.00000573562,0.00004624378,7.2310786e-7,0.0000056505537,0.000013949478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889404,0.0000619177,0.00021213443,0.0003351188,0.0003052701,0.00019154308],"domain_scores_gemma":[0.99949944,0.00006195596,0.000039162773,0.00017739266,0.00014188439,0.00008014289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006068076,0.000110322326,0.00012544588,0.00026726222,0.00020289712,0.00026647068,0.00013937504,0.00004126766,0.0000050572885],"category_scores_gemma":[0.000028825078,0.00011496817,0.000015944894,0.0010718175,0.000038109036,0.0011290055,0.000005571582,0.00007241535,0.0000027530452],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022010013,0.000036111116,0.0000024210005,0.000011119673,0.000005718031,0.000004859591,0.0010394339,0.7963441,0.1938652,0.0040659853,6.143704e-7,0.0046222233],"study_design_scores_gemma":[0.00030651863,0.000018880644,0.000067265384,0.00005674418,0.0000032049138,0.0000140768925,0.00023074029,0.85918593,0.13993473,0.000070613474,0.000008138017,0.00010316724],"about_ca_topic_score_codex":0.000008070654,"about_ca_topic_score_gemma":0.000002997584,"teacher_disagreement_score":0.8863302,"about_ca_system_score_codex":0.00014918389,"about_ca_system_score_gemma":0.00011875543,"threshold_uncertainty_score":0.4688266},"labels":[],"label_agreement":null},{"id":"W3206364061","doi":"10.1109/cdc45484.2021.9683216","title":"Receding Horizon Control in Deep Structured Teams: A Provably Tractable Large-Scale Approach with Application to Swarm Robotics","year":2021,"lang":"en","type":"article","venue":"2021 60th IEEE Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Computer science; Constraint (computer-aided design); Transformation (genetics); Optimal control; Optimization problem; Reinforcement learning; Artificial intelligence; Mathematics","score_opus":0.011204193349595621,"score_gpt":0.24144045845231238,"score_spread":0.23023626510271675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3206364061","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01689442,0.00023256328,0.977555,0.0015212392,0.00043997436,0.0018126304,0.00007031708,0.00011565638,0.001358201],"genre_scores_gemma":[0.9743741,0.00003829777,0.023938768,0.00076602475,0.00013969239,0.0004642333,0.00003091563,0.000036068584,0.0002118684],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953342,0.00032537917,0.00086394185,0.0016100579,0.00096380594,0.00090258394],"domain_scores_gemma":[0.99680424,0.00040477657,0.00032979035,0.0012724741,0.00070023065,0.0004885033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009282574,0.0005358552,0.0010085177,0.0003160378,0.00024243607,0.0008993176,0.00096417795,0.00028619022,0.000025204969],"category_scores_gemma":[0.00025922374,0.0004554268,0.00011679178,0.0011619326,0.00004912173,0.0005513763,0.0001140529,0.0005239105,0.00005861152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028254788,0.0020394875,0.0047751595,0.00014863492,0.00035564823,0.0003174753,0.0021605354,0.090958804,0.07481271,0.054192334,0.000871144,0.7665426],"study_design_scores_gemma":[0.01369733,0.0005981783,0.002603467,0.00025330455,0.00006415808,0.00006147606,0.0008974496,0.9766236,0.0011549664,0.00120584,0.002101567,0.00073869654],"about_ca_topic_score_codex":0.00005296778,"about_ca_topic_score_gemma":0.0006055993,"teacher_disagreement_score":0.9574797,"about_ca_system_score_codex":0.00021722479,"about_ca_system_score_gemma":0.00042854567,"threshold_uncertainty_score":0.9997898},"labels":[],"label_agreement":null},{"id":"W3207097712","doi":"10.1109/icra48506.2021.9561054","title":"Model Predictive Control for Cooperative Hunting in Obstacle Rich and Dynamic Environments","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Obstacle; Obstacle avoidance; Maxima and minima; Computer science; Collision avoidance; Model predictive control; Planner; Reciprocal; Control (management); Collision; Trajectory; Control theory (sociology); Motion planning; Robot; Artificial intelligence; Mobile robot; Mathematics; Geography; Computer security","score_opus":0.012756079775276883,"score_gpt":0.23546676161027438,"score_spread":0.2227106818349975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207097712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040673617,0.00017397932,0.9572436,0.00068946544,0.000060962946,0.0005761712,0.000077411096,0.0000443964,0.00046037202],"genre_scores_gemma":[0.99023056,0.0000058861324,0.008567878,0.00042688556,0.000010942678,0.00013064514,0.000014390875,0.000008522508,0.00060429476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987105,0.00007966461,0.00026349036,0.00049270375,0.00016239565,0.00029125708],"domain_scores_gemma":[0.9993827,0.00017431877,0.0000689461,0.00023248726,0.00005717905,0.00008436454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019507443,0.00013540394,0.00023605864,0.000034225257,0.00007437398,0.00012814859,0.00024295173,0.00006002508,0.0000036372785],"category_scores_gemma":[0.00011182514,0.00013114345,0.000033547007,0.00014818236,0.00002451547,0.0004395767,0.00012493822,0.00008072475,0.0000059277318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017890401,0.00074122805,0.022491107,0.00012127266,0.0004333818,0.00008907307,0.007401346,0.81190574,0.08927906,0.049690176,0.00043922054,0.017229466],"study_design_scores_gemma":[0.002962514,0.000046835234,0.0023338846,0.000013815295,0.000008617269,0.0000027769593,0.00024396274,0.9933453,0.0006558277,0.00015390136,0.00009730461,0.00013522065],"about_ca_topic_score_codex":0.000009836222,"about_ca_topic_score_gemma":0.000039486284,"teacher_disagreement_score":0.94955695,"about_ca_system_score_codex":0.00008976224,"about_ca_system_score_gemma":0.00006422877,"threshold_uncertainty_score":0.5347875},"labels":[],"label_agreement":null},{"id":"W3207446171","doi":"10.1109/icra48506.2021.9561204","title":"An Adaptive Fuzzy Reinforcement Learning Cooperative Approach for the Autonomous Control of Flock Systems","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Computer science; Robustness (evolution); Control theory (sociology); Fuzzy logic; Fuzzy control system; Adaptive neuro fuzzy inference system; Collision avoidance; Control engineering; Collision; Artificial intelligence; Control (management); Engineering","score_opus":0.030155505694635446,"score_gpt":0.2559310061074484,"score_spread":0.22577550041281297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207446171","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001933879,0.0012255798,0.98809254,0.00012736942,0.0013591812,0.0053904224,0.000076362056,0.00027549057,0.003259666],"genre_scores_gemma":[0.9837929,0.000014692623,0.011869101,0.00007843732,0.0002457269,0.0024282306,0.0002558211,0.0000356219,0.0012794952],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955461,0.00076620816,0.0011804855,0.0012225707,0.00069812534,0.00058651477],"domain_scores_gemma":[0.9948298,0.00063187775,0.0010053208,0.001953359,0.0014056674,0.00017399192],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016239997,0.0005771543,0.0011939931,0.00012294733,0.00032727126,0.0010165324,0.0027312597,0.00035567768,0.000007508041],"category_scores_gemma":[0.00016181378,0.00041075223,0.00039529795,0.00025083518,0.00009575272,0.00037532081,0.0007998057,0.00071870943,0.0000048313927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056484903,0.00010840965,0.0000151159165,0.00018427697,0.00078647345,0.0000047279727,0.0013515187,0.94441384,0.00038679177,0.051662404,0.00013692188,0.0008930322],"study_design_scores_gemma":[0.0016433311,0.00043783712,0.000030475729,0.00013051816,0.00013217167,0.0000113953965,0.0033992487,0.99299014,0.00029046202,0.000016857684,0.00047190813,0.00044566308],"about_ca_topic_score_codex":0.0010759031,"about_ca_topic_score_gemma":0.000016040136,"teacher_disagreement_score":0.9835995,"about_ca_system_score_codex":0.00031630724,"about_ca_system_score_gemma":0.00080094597,"threshold_uncertainty_score":0.9998344},"labels":[],"label_agreement":null},{"id":"W3207653625","doi":"10.1177/01423312211049936","title":"Consensus of a class of nonlinear fractional-order multi-agent systems via dynamic output feedback controller","year":2021,"lang":"en","type":"article","venue":"Transactions of the Institute of Measurement and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Control theory (sociology); Nonlinear system; Controller (irrigation); Schur complement; Exponential stability; Class (philosophy); Complement (music); Mathematics; Linear matrix inequality; Stability (learning theory); Consensus; Multi-agent system; Mathematical optimization; Lyapunov stability; State (computer science); Computer science; Control (management); Algorithm","score_opus":0.027778223559062426,"score_gpt":0.23292766558639724,"score_spread":0.20514944202733482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207653625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015979173,0.0023827562,0.97768086,0.0009986579,0.0015909643,0.000974536,0.0002329855,0.000028756453,0.00013132725],"genre_scores_gemma":[0.99608815,0.00003948396,0.0035924767,0.000030659958,0.00002002298,0.000045042194,0.0000033219803,0.000012142884,0.0001686853],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99684757,0.00026604987,0.0012067612,0.00035547095,0.001082443,0.00024171392],"domain_scores_gemma":[0.9961633,0.00012816481,0.00087558426,0.0007342552,0.0020072854,0.00009141398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008292559,0.00025618006,0.000869316,0.00013890961,0.00012241818,0.000027906543,0.0005903531,0.00013268579,0.000006499301],"category_scores_gemma":[0.00012983047,0.00020663164,0.00036704625,0.0004242379,0.00029448024,0.00019933176,0.000028100758,0.0001927108,0.0000020377886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007984311,0.003100964,0.0013779417,0.0013412117,0.0048566256,0.000012072244,0.00054249295,0.24460351,0.72585565,0.0028449453,0.00008717446,0.014579007],"study_design_scores_gemma":[0.017858183,0.0001881294,0.0043223156,0.000653481,0.00071585865,0.000053200507,0.0002513441,0.95398486,0.019204255,0.000062499406,0.002363794,0.00034208404],"about_ca_topic_score_codex":0.0004786532,"about_ca_topic_score_gemma":0.00027787505,"teacher_disagreement_score":0.980109,"about_ca_system_score_codex":0.00010189484,"about_ca_system_score_gemma":0.00045788958,"threshold_uncertainty_score":0.84261936},"labels":[],"label_agreement":null},{"id":"W3208337653","doi":"","title":"Model-Free Reinforcement Learning Approach for Leader-Follower Formation Using Nonholonomic Mobile Robots","year":2020,"lang":"en","type":"article","venue":"The Florida AI Research Society","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Reinforcement learning; Mobile robot; Kinematics; Trajectory; Robot; Computer science; Control theory (sociology); Set (abstract data type); Robot kinematics; Nonholonomic system; Robot control; Artificial intelligence; Control engineering; Control (management); Engineering","score_opus":0.18459684527783993,"score_gpt":0.3575252320394087,"score_spread":0.1729283867615688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208337653","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070366557,0.00012390366,0.9871344,0.0028673601,0.00015865627,0.0021364402,0.000013126068,0.0002038584,0.00032559902],"genre_scores_gemma":[0.96494687,0.000020546204,0.032846168,0.00058790355,0.00046274936,0.0007161677,0.0000589439,0.000033335105,0.00032729984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967532,0.00027792383,0.00044886637,0.0005498902,0.0010324261,0.00093768886],"domain_scores_gemma":[0.9980606,0.00022908479,0.00015054121,0.0009413108,0.0004018398,0.00021661457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003028157,0.00022090768,0.00028680393,0.000046291465,0.0010691432,0.00055226125,0.0025184173,0.00012871009,0.000004874432],"category_scores_gemma":[0.00019935505,0.00017609065,0.00032185076,0.0005693253,0.00012749148,0.0011200128,0.0010522698,0.00078809913,0.00004094941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003336548,0.000020985917,0.000013566026,0.000100262776,0.00006536073,5.6773086e-7,0.00732014,0.9690095,0.0051085427,0.0015905184,0.01619828,0.00053890987],"study_design_scores_gemma":[0.001289656,0.00015606443,0.0000039369384,0.000015058377,0.000010685924,0.0000027770072,0.0012531682,0.99298483,0.0010453735,0.00016313234,0.0028840555,0.00019125527],"about_ca_topic_score_codex":0.000044228793,"about_ca_topic_score_gemma":8.3737365e-7,"teacher_disagreement_score":0.95791024,"about_ca_system_score_codex":0.00046337873,"about_ca_system_score_gemma":0.00027040913,"threshold_uncertainty_score":0.8223093},"labels":[],"label_agreement":null},{"id":"W3209152046","doi":"10.1109/tsmc.2021.3119670","title":"Distributed Integral-Type Edge Event- and Self-Triggered Synchronization for Nonlinear Multiagent Systems","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Lipschitz continuity; Enhanced Data Rates for GSM Evolution; Nonlinear system; Synchronization (alternating current); Zeno's paradoxes; Computer science; Control theory (sociology); Type (biology); Event (particle physics); Multi-agent system; Function (biology); Mathematics; Control (management); Mathematical analysis; Artificial intelligence; Physics; Telecommunications; Geometry","score_opus":0.014593916912399174,"score_gpt":0.23818298392326545,"score_spread":0.22358906701086628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209152046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010934535,0.0058393623,0.9702504,0.000118985314,0.0084291,0.0029187826,0.000881348,0.00053955143,0.00008791682],"genre_scores_gemma":[0.99577427,0.00044193928,0.0008051709,0.000026239342,0.00030828887,0.00058516866,0.00018032517,0.000076901946,0.0018016956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953523,0.00061458745,0.0013523805,0.0012400551,0.00069667504,0.0007439652],"domain_scores_gemma":[0.996531,0.00037387988,0.0005086094,0.0011106704,0.0010034913,0.00047236079],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007625719,0.00063816493,0.0010213268,0.0002780705,0.0005096715,0.0015432761,0.00054128456,0.00041022216,0.000002490085],"category_scores_gemma":[0.000040145456,0.00061819406,0.00019145536,0.00075994997,0.00007403519,0.00041468366,0.000019750654,0.00031461354,0.000041579577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009317655,0.011509087,0.0026502353,0.03288492,0.01126944,0.0009367059,0.012415311,0.7579925,0.025685895,0.08858106,0.018760694,0.036382396],"study_design_scores_gemma":[0.002836737,0.0003409803,0.00007363236,0.0008034515,0.00019862223,0.00042789467,0.0010906154,0.966019,0.00066583493,0.000009316066,0.026829498,0.0007044635],"about_ca_topic_score_codex":0.00044897464,"about_ca_topic_score_gemma":0.000050423256,"teacher_disagreement_score":0.98483974,"about_ca_system_score_codex":0.00039515045,"about_ca_system_score_gemma":0.00023716636,"threshold_uncertainty_score":0.99962693},"labels":[],"label_agreement":null},{"id":"W3211042025","doi":"10.1109/cdc45484.2021.9683724","title":"Deep Structured Teams in Arbitrary-Size Linear Networks: Decentralized Estimation, Optimal Control and Separation Principle","year":2021,"lang":"en","type":"article","venue":"2021 60th IEEE Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kalman filter; Curse of dimensionality; Mathematical optimization; Computer science; Optimal control; Linear system; Mathematics; Linear-quadratic-Gaussian control; Separation principle; Deep learning; Control theory (sociology); Nonlinear system; Artificial intelligence; Control (management)","score_opus":0.01232964050328096,"score_gpt":0.2837180941247158,"score_spread":0.2713884536214349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211042025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07823552,0.0011098986,0.91758174,0.0011067055,0.0007678702,0.00089013693,0.00003812384,0.00009252886,0.00017750074],"genre_scores_gemma":[0.9850403,0.00031332046,0.013269499,0.0009792462,0.00011359004,0.000107947155,0.00003160893,0.000023065924,0.00012141582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959313,0.0005201275,0.0010093972,0.0011756113,0.00067852216,0.0006850284],"domain_scores_gemma":[0.99682605,0.0010754069,0.0003471151,0.00085190556,0.0004861646,0.00041332832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007142014,0.0004915575,0.0009109241,0.000166084,0.00023335859,0.0008962177,0.0005824655,0.00030349416,0.00012341476],"category_scores_gemma":[0.00068861176,0.00045138196,0.00012808136,0.00055582833,0.00009673178,0.0007000474,0.00010714145,0.00043625972,0.00003422791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031525004,0.00086907385,0.008951406,0.00009127214,0.0005269489,0.0009555989,0.0011648685,0.33788773,0.013062352,0.11522301,0.00084236235,0.5172729],"study_design_scores_gemma":[0.01383779,0.00014983508,0.014987217,0.00015727233,0.00004371732,0.00005271035,0.000066937544,0.96755755,0.000234438,0.0016913604,0.00077761745,0.00044354695],"about_ca_topic_score_codex":0.000034144272,"about_ca_topic_score_gemma":0.0001947804,"teacher_disagreement_score":0.9068048,"about_ca_system_score_codex":0.000111765454,"about_ca_system_score_gemma":0.0003641285,"threshold_uncertainty_score":0.99979377},"labels":[],"label_agreement":null},{"id":"W3211537996","doi":"10.1109/iecon48115.2021.9589164","title":"Terminal Sliding Mode Control for the Formation of a Team of Quadrotors and Mobile Robots","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Terminal sliding mode; Terminal (telecommunication); Mobile robot; Control theory (sociology); Controller (irrigation); Sliding mode control; Computer science; Robot; Mode (computer interface); Scheme (mathematics); Control engineering; Stability (learning theory); Control (management); Topology (electrical circuits); Engineering; Artificial intelligence; Computer network; Nonlinear system; Mathematics","score_opus":0.015409915053410822,"score_gpt":0.26386390912042507,"score_spread":0.24845399406701424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211537996","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020900229,0.00017855938,0.9776541,0.000142259,0.00010831815,0.00075170374,0.00003283742,0.00002283002,0.00020916318],"genre_scores_gemma":[0.9941097,0.000004150177,0.005553757,0.000034930436,0.000017615359,0.00018490657,0.0000029375299,0.000003270769,0.0000887698],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916685,0.000050437662,0.00034825355,0.00014151598,0.00016054013,0.00013241134],"domain_scores_gemma":[0.99895406,0.0003448832,0.00019571059,0.00029685654,0.00017746139,0.000031038435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032104756,0.00007338408,0.0001947346,0.000033311593,0.000056374884,0.000048997186,0.00026955534,0.00003208973,0.000002440125],"category_scores_gemma":[0.000076710516,0.0000506509,0.00007059337,0.000115869116,0.000018483792,0.0003256283,0.00005858372,0.00003064483,6.830587e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027453768,0.0008314124,0.0046074647,0.0016404621,0.00058075297,0.000015008433,0.013150005,0.08062865,0.420183,0.28562373,0.003948415,0.18851656],"study_design_scores_gemma":[0.0011645919,0.00007351904,0.00025728365,0.000032057716,0.00001960836,0.000017406088,0.00035462098,0.9702697,0.027059508,0.00020348367,0.0004880868,0.00006016612],"about_ca_topic_score_codex":0.000048124803,"about_ca_topic_score_gemma":0.00001962786,"teacher_disagreement_score":0.97320944,"about_ca_system_score_codex":0.000017754972,"about_ca_system_score_gemma":0.00004482244,"threshold_uncertainty_score":0.20654838},"labels":[],"label_agreement":null},{"id":"W3213683457","doi":"10.1109/iecon48115.2021.9589174","title":"Distributed Formation Tracking Control with Edge-Triggered Communication Mechanism","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Asynchronous communication; Controller (irrigation); Computer science; Tracking error; Tracking (education); Enhanced Data Rates for GSM Evolution; Generator (circuit theory); Mobile robot; Event (particle physics); Linear matrix inequality; Control (management); Robot; Mathematics; Mathematical optimization; Artificial intelligence; Power (physics)","score_opus":0.015084108658135656,"score_gpt":0.22201186193910882,"score_spread":0.20692775328097318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3213683457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026621767,0.00017168607,0.9922113,0.0023476172,0.0001422631,0.0003907805,0.000048202346,0.00043579075,0.0015902114],"genre_scores_gemma":[0.98539686,0.000011020269,0.01377182,0.0003037453,0.000025381232,0.000069135676,0.00026962784,0.000010976339,0.00014140617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820757,0.00028810065,0.00042097995,0.00034120778,0.0004055529,0.0003365879],"domain_scores_gemma":[0.99771076,0.00017703044,0.00023623795,0.0011946454,0.0005649773,0.00011632905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041229016,0.00018540015,0.00027779758,0.00006461077,0.00024106837,0.0005300509,0.0008314679,0.00008735402,0.000026892272],"category_scores_gemma":[0.00009376228,0.00015721175,0.00007658618,0.0005621729,0.000023083683,0.0014751875,0.00012271827,0.0001516257,0.000077968645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063764666,0.0004127944,0.00038457377,0.000076591896,0.00025037004,0.00010377763,0.00082809245,0.0011861009,0.030628446,0.9377108,0.0023427021,0.02601197],"study_design_scores_gemma":[0.009350499,0.00013749758,0.0033898973,0.00020039418,0.000086536296,0.00031278274,0.0006306048,0.9023487,0.06706247,0.0075781224,0.008090961,0.00081155676],"about_ca_topic_score_codex":0.000031765114,"about_ca_topic_score_gemma":0.000080128884,"teacher_disagreement_score":0.98273474,"about_ca_system_score_codex":0.00014141896,"about_ca_system_score_gemma":0.000113837654,"threshold_uncertainty_score":0.6410909},"labels":[],"label_agreement":null},{"id":"W3214295241","doi":"10.1016/j.neunet.2021.11.013","title":"A second-order accelerated neurodynamic approach for distributed convex optimization","year":2021,"lang":"en","type":"article","venue":"Neural Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Mathematical optimization; Convergence (economics); Convex optimization; Computer science; Rate of convergence; Convex function; Optimization problem; Linear matrix inequality; Regular polygon; Mathematics","score_opus":0.021228152051041907,"score_gpt":0.2382383351433796,"score_spread":0.21701018309233772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214295241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017986082,0.00024013838,0.9947477,0.00063560624,0.0010066597,0.0007407134,0.00008634623,0.00042514308,0.0003190623],"genre_scores_gemma":[0.96487767,0.000010035191,0.030434893,0.001170888,0.00026658108,0.00021907638,0.002610429,0.000039296257,0.00037113408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976047,0.00021533745,0.0004780132,0.00082469493,0.00024570164,0.00063152297],"domain_scores_gemma":[0.99813694,0.00017014501,0.00020963003,0.0007524235,0.00055864005,0.00017223922],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018196915,0.0002959907,0.00039401546,0.00005395931,0.00021695308,0.000579694,0.00079026987,0.00019250368,0.000049404232],"category_scores_gemma":[0.00010562232,0.00029785302,0.00014902625,0.0011330893,0.00003407389,0.00054694864,0.0001978751,0.0002735118,0.000004344598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019894554,0.00009123289,0.00012423088,0.000023861341,0.00004177856,0.00002304305,0.00001893257,0.9928368,0.00022063065,0.0012045492,0.0032231524,0.0021719362],"study_design_scores_gemma":[0.0015451043,0.000047135767,0.00046987992,0.000008088885,0.000019816114,0.00004847378,0.0000118790185,0.995969,0.000065538676,0.000022085966,0.0014968504,0.00029613922],"about_ca_topic_score_codex":0.0000046730993,"about_ca_topic_score_gemma":0.0000070496026,"teacher_disagreement_score":0.96431285,"about_ca_system_score_codex":0.00006800551,"about_ca_system_score_gemma":0.00008317973,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W3214397884","doi":"10.1139/juvs-2021-0014","title":"Adaptive augmented torque control of a quadcopter with an aerial manipulator","year":2021,"lang":"en","type":"article","venue":"Drone Systems and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quadcopter; Control theory (sociology); Adaptive control; Controller (irrigation); Lyapunov function; Feedback linearization; Computer science; Lyapunov stability; Control engineering; Linearization; Trajectory; Tracking error; Nonlinear system; Engineering; Artificial intelligence; Control (management)","score_opus":0.013867156187839551,"score_gpt":0.22731336022008908,"score_spread":0.21344620403224954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214397884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00732387,0.00056587136,0.9899691,0.00010734277,0.00012147864,0.0009493201,0.00014263541,0.00008447039,0.0007359145],"genre_scores_gemma":[0.9968786,0.0000029795942,0.0018830687,0.000027145905,0.00014107881,0.00069962227,0.000030740503,0.000010406333,0.00032633904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987489,0.00010694133,0.00033764614,0.00040827805,0.00021234527,0.000185891],"domain_scores_gemma":[0.99872106,0.00004369183,0.00020260783,0.0006584852,0.00024044157,0.00013370115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001487556,0.00013891522,0.0003065379,0.000042210773,0.00009838618,0.00012855254,0.00026628003,0.000058860158,0.0000066034527],"category_scores_gemma":[0.000004514979,0.00011950803,0.00003568459,0.00023393074,0.00004538538,0.00023767678,0.000045683915,0.00005723364,0.000017125476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103922095,0.0005820858,0.00086621096,0.00017652565,0.00035565905,0.000023346629,0.00048812438,0.001762135,0.016951459,0.97201604,0.00026526672,0.006409222],"study_design_scores_gemma":[0.022038145,0.001998786,0.012089518,0.00059254206,0.00043190943,0.00064761867,0.004552905,0.84780353,0.005821089,0.0012667333,0.10058415,0.0021730852],"about_ca_topic_score_codex":0.00031731694,"about_ca_topic_score_gemma":0.000038740578,"teacher_disagreement_score":0.98955476,"about_ca_system_score_codex":0.000036168167,"about_ca_system_score_gemma":0.00009400168,"threshold_uncertainty_score":0.48733962},"labels":[],"label_agreement":null},{"id":"W3214453168","doi":"10.1109/iecon48115.2021.9589244","title":"Multi-Quadcopter Formation Control Using Sampled-Data Event-Triggered Communication With Gain Optimization","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Control theory (sociology); Computer science; Controller (irrigation); Quadcopter; Linear matrix inequality; Event (particle physics); Protocol (science); Multi-agent system; Tracking error; Sampling (signal processing); Control (management); Control engineering; Engineering; Mathematical optimization; Mathematics","score_opus":0.06608362207869409,"score_gpt":0.29290141204187875,"score_spread":0.22681778996318466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214453168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004912073,0.00034474433,0.9970638,0.00093495473,0.00012196728,0.0005373496,0.00006759881,0.0002268422,0.00021152433],"genre_scores_gemma":[0.5401163,0.00001659561,0.45884112,0.0003043707,0.000020531943,0.0000199908,0.00059154717,0.000011404771,0.000078102836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978508,0.00046317422,0.0005182933,0.0004777309,0.00038623516,0.00030379568],"domain_scores_gemma":[0.99650854,0.00016153856,0.00032189302,0.0024172072,0.0004912017,0.0000996374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063892326,0.0001948534,0.00026779278,0.00009289127,0.00023705144,0.000523603,0.0013571382,0.00008630558,0.000043588505],"category_scores_gemma":[0.00012526308,0.00017054108,0.000047067217,0.0005045548,0.000028584202,0.0027904036,0.00037063027,0.000119596465,0.000031390646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008700564,0.00066177966,0.0010859673,0.00009517677,0.0003022264,0.000038653598,0.0008841095,0.95547014,0.008769226,0.0070729186,0.0013840885,0.024148677],"study_design_scores_gemma":[0.003227935,0.000019380852,0.00017429392,0.00006768514,0.000033542918,0.00003547053,0.0001264869,0.99484533,0.0007714266,0.000025212788,0.00044961524,0.00022361579],"about_ca_topic_score_codex":0.00016599552,"about_ca_topic_score_gemma":0.00019209154,"teacher_disagreement_score":0.5396251,"about_ca_system_score_codex":0.00015202211,"about_ca_system_score_gemma":0.00017150285,"threshold_uncertainty_score":0.6954464},"labels":[],"label_agreement":null},{"id":"W3214569263","doi":"10.1109/tii.2021.3127197","title":"Self-Triggered Min–Max DMPC for Asynchronous Multiagent Systems With Communication Delays","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; China Scholarship Council; University of Victoria","keywords":"Asynchronous communication; Multi-agent system; Computer science; Distributed computing; Computer network; Artificial intelligence","score_opus":0.03830719534709976,"score_gpt":0.2436673398987946,"score_spread":0.20536014455169485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3214569263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027760596,0.00008945932,0.9919127,0.00030799175,0.0018679131,0.0018080757,0.00024047098,0.00042415777,0.0005731675],"genre_scores_gemma":[0.94657034,0.0000479711,0.052047256,0.00013837156,0.00012626137,0.0006987194,0.00008686165,0.000032339816,0.00025186542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973502,0.00020029943,0.0011269411,0.00026516823,0.00055911276,0.00049828924],"domain_scores_gemma":[0.996723,0.00054224516,0.0005089499,0.001433144,0.0005706334,0.00022205042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055382075,0.00033643638,0.0004792168,0.00019853766,0.0005300064,0.00065927755,0.0009544078,0.0003495282,0.000009384516],"category_scores_gemma":[0.00003313795,0.00031132292,0.00018552048,0.0006939059,0.000048127033,0.0010706299,0.000009941453,0.00048931275,0.00007633874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063732127,0.0032376798,0.00006909515,0.00097605184,0.0029455125,0.000049975282,0.0135871675,0.84463847,0.00036462842,0.009574149,0.011370982,0.11254895],"study_design_scores_gemma":[0.007983982,0.00046392056,0.0000061592805,0.00028404282,0.00019896182,0.00012423005,0.0015624913,0.9533868,0.007383796,0.000018189052,0.028000323,0.00058710383],"about_ca_topic_score_codex":0.000080177706,"about_ca_topic_score_gemma":0.000030794363,"teacher_disagreement_score":0.9437943,"about_ca_system_score_codex":0.00046457225,"about_ca_system_score_gemma":0.00061220716,"threshold_uncertainty_score":0.9999339},"labels":[],"label_agreement":null},{"id":"W3215249818","doi":"10.1109/rose52750.2021.9611776","title":"A Policy Iteration Approach for Flock Motion Control","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flocking (texture); Computer science; Reinforcement learning; Adjacency list; Multi-agent system; Graph; Mathematical optimization; Autonomous agent; Mobile robot; Convergence (economics); Robot; Artificial intelligence; Theoretical computer science; Mathematics; Algorithm","score_opus":0.02321695933361669,"score_gpt":0.2648606132504982,"score_spread":0.2416436539168815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215249818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023540216,0.000117481846,0.9912433,0.0017454788,0.0010184075,0.0023083654,0.00011549804,0.00042736964,0.0027886964],"genre_scores_gemma":[0.88715065,0.0000035585515,0.10845259,0.0005343369,0.0007897245,0.0012073121,0.00090469915,0.000022503133,0.00093462475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99728525,0.00021818295,0.00058862945,0.0010804426,0.00040215158,0.0004253542],"domain_scores_gemma":[0.9975924,0.0000941329,0.00031916148,0.0013481267,0.0005098599,0.0001363228],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00053479115,0.00035610702,0.00054788135,0.00023833645,0.00011592297,0.0015472951,0.0011948367,0.0003755989,0.000005707201],"category_scores_gemma":[0.00022663947,0.00034414613,0.00036175238,0.00026775664,0.000015611206,0.000406931,0.0005118762,0.00026999236,0.00001216611],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008612336,0.0014434198,0.00045428702,0.0021273461,0.0012963697,0.000023624249,0.0026018305,0.3382326,0.0059775845,0.53340006,0.008208011,0.10614873],"study_design_scores_gemma":[0.0015185653,0.000025932226,0.00025031323,0.00004193252,0.000029175333,0.0000091390275,0.00003097406,0.9960489,0.00025886492,0.0010768026,0.00037978374,0.0003295965],"about_ca_topic_score_codex":0.0002587392,"about_ca_topic_score_gemma":0.000011309137,"teacher_disagreement_score":0.88691527,"about_ca_system_score_codex":0.00026662476,"about_ca_system_score_gemma":0.0004260385,"threshold_uncertainty_score":0.99990106},"labels":[],"label_agreement":null},{"id":"W3216729193","doi":"10.1002/rnc.5908","title":"Hybrid‐triggered formation tracking control of mobile robots without velocity measurements","year":2021,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Asynchronous communication; Control theory (sociology); Computer science; Transmission (telecommunications); Event (particle physics); Mobile robot; Observer (physics); Sampling (signal processing); Position (finance); Control (management); Relative velocity; Robot; Stability (learning theory); Real-time computing; Detector; Artificial intelligence; Computer network; Telecommunications","score_opus":0.03374138308675026,"score_gpt":0.27067946687658745,"score_spread":0.2369380837898372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216729193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08965964,0.0010820515,0.90694946,0.0008199881,0.0011139086,0.00020561935,0.00007293328,0.000018701332,0.00007768723],"genre_scores_gemma":[0.98948526,0.000046160327,0.009871545,0.00019790183,0.00034839433,0.0000064787,0.000011101527,0.000009256288,0.000023894965],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974316,0.00020482946,0.0009854634,0.00019256494,0.0009872398,0.00019831987],"domain_scores_gemma":[0.995692,0.00017111753,0.0010417753,0.00019365617,0.0027767685,0.00012464613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009906174,0.00016481028,0.00048892625,0.00018308329,0.000057633944,0.00022118955,0.00067183975,0.00005954623,0.000013810431],"category_scores_gemma":[0.00035199014,0.00014684137,0.00020800553,0.00010703719,0.000035063807,0.0010655853,0.00005764954,0.00019459023,0.0000038789008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028474836,0.002859348,0.06645461,0.00026218564,0.007204505,0.0014439679,0.0019410907,0.29876983,0.22787423,0.0025011424,0.0012636197,0.386578],"study_design_scores_gemma":[0.017453196,0.00022217685,0.0055936426,0.0003285011,0.00013712874,0.0009282282,0.000081690145,0.9556126,0.017501332,0.00016900188,0.0017099032,0.0002626242],"about_ca_topic_score_codex":0.000011645137,"about_ca_topic_score_gemma":0.00000765803,"teacher_disagreement_score":0.89982563,"about_ca_system_score_codex":0.0001107532,"about_ca_system_score_gemma":0.00022443607,"threshold_uncertainty_score":0.59880173},"labels":[],"label_agreement":null},{"id":"W3217321847","doi":"10.1109/ssrr53300.2021.9597872","title":"Adaptive model-free formation-tracking controller and observer for collaborative payload transport by four drones","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Payload (computing); Control theory (sociology); Computer science; Controller (irrigation); Trajectory; Topology (electrical circuits); Position (finance); Observer (physics); Drone; Rigid body; Engineering; Physics; Control (management); Artificial intelligence; Network packet","score_opus":0.04050537809101586,"score_gpt":0.23565175506983224,"score_spread":0.19514637697881637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217321847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038363796,0.0006225721,0.99085516,0.0019817883,0.00015627602,0.00087414065,0.000512949,0.00014456504,0.0010161821],"genre_scores_gemma":[0.96069896,0.000022298216,0.037293807,0.00042988945,0.0000328616,0.00023728664,0.00006097465,0.000014109189,0.0012097948],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998294,0.000077421544,0.00044888424,0.0004902483,0.0003220712,0.00036738135],"domain_scores_gemma":[0.9982333,0.00022312374,0.00016683331,0.0004454323,0.0007962806,0.00013503131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002998583,0.00023102647,0.00039730963,0.000042909152,0.00019667576,0.00023686988,0.00050410297,0.000101522375,0.0000071529153],"category_scores_gemma":[0.00008560248,0.0002061389,0.00010362466,0.00030906475,0.00003392976,0.0015646457,0.0000817421,0.000082802915,0.0000057505817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007070032,0.00081032445,0.0023469925,0.00041026977,0.0015188837,0.0001331683,0.011394672,0.028159477,0.04603874,0.77160394,0.09834936,0.038527176],"study_design_scores_gemma":[0.0051660095,0.00007694086,0.00055658864,0.00003792712,0.000037775993,0.0000109439225,0.0006415607,0.9822693,0.0040967944,0.0043476447,0.0024300553,0.00032849758],"about_ca_topic_score_codex":0.000029786268,"about_ca_topic_score_gemma":0.00022468732,"teacher_disagreement_score":0.9568626,"about_ca_system_score_codex":0.00006519324,"about_ca_system_score_gemma":0.00015246593,"threshold_uncertainty_score":0.84061},"labels":[],"label_agreement":null},{"id":"W346289610","doi":"10.1007/978-3-319-15916-4_7","title":"Bio-inspired Routing Strategies for Wireless Sensor Networks","year":2015,"lang":"en","type":"book-chapter","venue":"Intelligent systems reference library","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Swarm intelligence; Wireless sensor network; Distributed computing; Swarm behaviour; Variety (cybernetics); Routing (electronic design automation); Simple (philosophy); Wireless ad hoc network; Wireless; Artificial intelligence; Computer network; Data science; Human–computer interaction; Telecommunications; Machine learning","score_opus":0.07655066415417264,"score_gpt":0.26317135233441635,"score_spread":0.18662068818024372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346289610","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026224947,0.006252799,0.74271464,0.0002026936,0.0052768593,0.0031608928,0.0006133722,0.0017772022,0.2399753],"genre_scores_gemma":[0.41525313,0.0005465003,0.002955116,0.00026118258,0.0036196152,0.00079786975,0.002185295,0.00055678224,0.5738245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99352044,0.00021114358,0.0021531326,0.0018534441,0.0010615533,0.0012002727],"domain_scores_gemma":[0.99443424,0.0005047412,0.0016489128,0.0022885695,0.0005126901,0.00061085453],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0006748491,0.0013176678,0.0017833322,0.00045931267,0.00026024415,0.0026817764,0.0037080247,0.0013595611,0.00005408896],"category_scores_gemma":[0.00003675158,0.0012053184,0.00050041266,0.00021225397,0.00014166304,0.002402796,0.0007731878,0.00087629666,0.0005255079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005605367,0.000040936106,0.000032200296,0.000435108,0.00039234248,0.00009913582,0.0002212341,0.0039441176,0.00002719429,0.9596054,0.02459324,0.010553016],"study_design_scores_gemma":[0.00068165164,0.0003093602,0.000005002832,0.0028860567,0.000106178726,0.000088956345,0.00044500834,0.34179908,0.00007043314,0.009657651,0.64197093,0.0019797035],"about_ca_topic_score_codex":0.000093085844,"about_ca_topic_score_gemma":0.000007516808,"teacher_disagreement_score":0.9499478,"about_ca_system_score_codex":0.00028361467,"about_ca_system_score_gemma":0.0010042773,"threshold_uncertainty_score":0.99995744},"labels":[],"label_agreement":null},{"id":"W346619096","doi":"10.1049/iet-cta.2010.0571","title":"Reconfigurable cooperative control of networked lagrangian systems under actuator saturation constraints","year":2012,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Controller (irrigation); Convergence (economics); Computer science; Exponential stability; Control engineering; Control (management); Engineering; Nonlinear system","score_opus":0.009999350138391238,"score_gpt":0.232981043477423,"score_spread":0.22298169333903176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W346619096","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018916305,0.0018813277,0.99042404,0.0003895537,0.00029793932,0.0018612246,0.00021602717,0.0001323369,0.00290594],"genre_scores_gemma":[0.9981425,0.00001788416,0.00019030111,0.00033600655,0.00027940972,0.00078680733,0.000030903997,0.00001335583,0.00020284962],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978455,0.00066706486,0.00052536256,0.000340907,0.0001961475,0.00042504442],"domain_scores_gemma":[0.99743354,0.001144461,0.00035902194,0.0005694368,0.00026475472,0.00022878683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015901874,0.00023032505,0.00044793624,0.000075408396,0.00026160586,0.00016479297,0.00042768125,0.00013908077,0.000027233657],"category_scores_gemma":[0.0000738941,0.00019899334,0.00008810541,0.00027885468,0.00023130255,0.0006026681,0.000019429135,0.00015258328,0.000050328734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006645617,0.00011018007,0.00015165511,0.00002098055,0.00019473257,2.9515436e-7,0.0002477627,0.0009995196,0.010187919,0.97833353,0.00012566372,0.00956131],"study_design_scores_gemma":[0.0754172,0.0012240176,0.02453688,0.0009892537,0.0024375124,0.00054804067,0.012342806,0.5892105,0.010672056,0.08953945,0.18655594,0.006526328],"about_ca_topic_score_codex":0.000015469062,"about_ca_topic_score_gemma":0.000002248959,"teacher_disagreement_score":0.99625087,"about_ca_system_score_codex":0.000043976812,"about_ca_system_score_gemma":0.000072179086,"threshold_uncertainty_score":0.8114712},"labels":[],"label_agreement":null},{"id":"W4200129931","doi":"10.1109/tcyb.2021.3133463","title":"Distributed Active Fault-Tolerant Cooperative Control for Multiagent Systems With Communication Delays and External Disturbances","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Fault tolerance; Computer science; Distributed computing; Multi-agent system; Control (management); Artificial intelligence","score_opus":0.01429794506948253,"score_gpt":0.23665133359711635,"score_spread":0.2223533885276338,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200129931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012147065,0.00087220693,0.9830226,0.00049011764,0.00047368868,0.0011578572,0.0016540831,0.00013286967,0.000049514336],"genre_scores_gemma":[0.9930749,0.00011369581,0.0058296593,0.000099131204,0.000033038676,0.0005573211,0.00006478786,0.000023944438,0.00020351035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979516,0.0002940561,0.00043758316,0.00057616504,0.00037514197,0.000365436],"domain_scores_gemma":[0.997595,0.0005987503,0.0002140897,0.00076158403,0.00064965093,0.00018090643],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018392442,0.00031223448,0.0004276301,0.00006231172,0.00042957618,0.00043925678,0.00048415517,0.0001176384,0.0000041735907],"category_scores_gemma":[0.000017430035,0.00026926326,0.00009789301,0.00029029528,0.00013014082,0.00035539994,0.0000061244264,0.0002669491,0.0000077630575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011097749,0.0020273016,0.00020444591,0.00022103792,0.0015821726,0.00012117523,0.0044114445,0.9251487,0.009671484,0.012598859,0.0004465919,0.042456973],"study_design_scores_gemma":[0.0061574094,0.0004181026,0.0009977388,0.00029844444,0.00018164598,0.0001079759,0.00065019797,0.9756878,0.013051858,0.00005729101,0.001902832,0.00048868643],"about_ca_topic_score_codex":0.00014451542,"about_ca_topic_score_gemma":0.00026659356,"teacher_disagreement_score":0.9809278,"about_ca_system_score_codex":0.0001690839,"about_ca_system_score_gemma":0.00012857855,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W4205522428","doi":"10.1109/icrae53653.2021.9657767","title":"Deep Reinforcement Learning for Flocking Control of UAVs in Complex Environments","year":2021,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Flocking (texture); Reinforcement learning; Computer science; Markov decision process; Kinematics; Partially observable Markov decision process; Collision; Swarm behaviour; Artificial intelligence; Distributed computing; Markov process; Markov chain; Machine learning; Markov model; Mathematics","score_opus":0.02372252897729252,"score_gpt":0.24398575172371179,"score_spread":0.22026322274641927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205522428","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015768652,0.00008959481,0.9959167,0.0002410868,0.000116043775,0.0003926808,0.0000011511996,0.00003441457,0.0016314491],"genre_scores_gemma":[0.9925293,0.0000039148863,0.006573339,0.00017082911,0.000021477576,0.000059807342,0.000027885306,0.00000733559,0.00060612947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985141,0.00009732737,0.0004793336,0.00031541215,0.00027858315,0.00031522498],"domain_scores_gemma":[0.99920374,0.00016767657,0.00016390873,0.00036043773,0.00004467115,0.000059576992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003337936,0.00012150148,0.00029175004,0.00006720884,0.000055768818,0.00005622825,0.00040584055,0.000045936184,0.000057482168],"category_scores_gemma":[0.00009551794,0.00012305994,0.00009182416,0.00016555304,0.000017011276,0.00019097538,0.0001348421,0.00007826449,0.000017754614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033663113,0.00016621698,0.009755175,0.00007350859,0.00012561915,0.00002883802,0.000591669,0.8657517,0.06714953,0.03996365,0.00012987884,0.016230552],"study_design_scores_gemma":[0.0030061295,0.000055906476,0.003606266,0.000022120648,0.0000068918084,0.0000030502433,0.00011368006,0.98191684,0.003622726,0.00007317649,0.007446517,0.00012670484],"about_ca_topic_score_codex":0.000039508104,"about_ca_topic_score_gemma":0.000025907366,"teacher_disagreement_score":0.99095243,"about_ca_system_score_codex":0.000096137934,"about_ca_system_score_gemma":0.000034188848,"threshold_uncertainty_score":0.5018239},"labels":[],"label_agreement":null},{"id":"W4205668644","doi":"10.1109/ccta48906.2021.9658832","title":"Application of Sliding Mode Control for the Formation of Heterogeneous Multi-Agent Systems","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Control Technology and Applications (CCTA)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mobile robot; Sliding mode control; Control theory (sociology); Computer science; Scheme (mathematics); Multi-agent system; Mode (computer interface); Stability (learning theory); Control (management); Robot; Control engineering; Topology (electrical circuits); Distributed computing; Engineering; Artificial intelligence; Mathematics; Nonlinear system","score_opus":0.02476084229374412,"score_gpt":0.27066131193716475,"score_spread":0.24590046964342063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205668644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015531352,0.0012059349,0.99154645,0.0024372104,0.00015426314,0.0026497326,0.00028486433,0.0001094678,0.000058959253],"genre_scores_gemma":[0.9934318,0.00011754459,0.0017424717,0.000068827314,0.000049352864,0.0044963453,0.000026748621,0.000012833894,0.000054096028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980912,0.00010656422,0.00073344726,0.0005403985,0.00022682677,0.000301565],"domain_scores_gemma":[0.9967609,0.00047783845,0.0006507612,0.0011922397,0.00085645687,0.00006177955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038229433,0.0002280993,0.00052515033,0.00023898834,0.00026281562,0.00008106287,0.0008703437,0.0002530714,0.000001998333],"category_scores_gemma":[0.00009224623,0.00019389103,0.00012426195,0.00064070424,0.00015877253,0.0001634273,0.00006399145,0.0001752892,0.00000991285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046342233,0.0002729683,0.00020498665,0.0001496807,0.00020621136,0.0000014582125,0.000074289266,0.012832714,0.15973537,0.77203333,0.000047676196,0.05439496],"study_design_scores_gemma":[0.002561696,0.00008783839,0.000064025226,0.0000544168,0.00009684619,0.000025813457,0.00018078496,0.9651326,0.027190063,0.0021408165,0.0022910256,0.00017410159],"about_ca_topic_score_codex":0.000017998278,"about_ca_topic_score_gemma":0.000023163717,"teacher_disagreement_score":0.9918786,"about_ca_system_score_codex":0.000052590978,"about_ca_system_score_gemma":0.00011573465,"threshold_uncertainty_score":0.7906647},"labels":[],"label_agreement":null},{"id":"W4205779814","doi":"10.1109/smc52423.2021.9658635","title":"Multi-Agent Formation Control With Obstacle Avoidance Using Proximal Policy Optimization","year":2021,"lang":"en","type":"article","venue":"2021 IEEE International Conference on Systems, Man, and Cybernetics (SMC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Obstacle; Obstacle avoidance; Computer science; Reinforcement learning; Centroid; Control (management); Field (mathematics); Order (exchange); Multi-agent system; Holonomic; State information; Artificial intelligence; Distributed computing; State (computer science); Robot; Algorithm; Mobile robot; Mathematics; Business","score_opus":0.05426866731148646,"score_gpt":0.286836777811927,"score_spread":0.23256811050044054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205779814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017141452,0.000248939,0.9769517,0.0010164599,0.0012347894,0.0006587329,0.00013730492,0.00009223795,0.002518351],"genre_scores_gemma":[0.9867567,0.000099320256,0.01057446,0.0002563859,0.00034121584,0.000090088346,0.00008406615,0.000025794283,0.001771967],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99706095,0.0002764493,0.0006835938,0.0006973052,0.0008710893,0.0004106033],"domain_scores_gemma":[0.99745005,0.00008813681,0.0004961122,0.00053401606,0.0012469793,0.00018472988],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00032786283,0.00034672968,0.00040579744,0.00022266316,0.00018871695,0.0012136315,0.00065205287,0.00013719239,0.00003301887],"category_scores_gemma":[0.00009324236,0.00032581307,0.00007390027,0.00033294514,0.00006938594,0.00079341885,0.00010411775,0.00021218005,0.000047227957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025327347,0.00087079225,0.0026860435,0.0003773356,0.00072713895,0.00040922547,0.0020866424,0.63376296,0.02831855,0.32397908,0.0005356894,0.005993251],"study_design_scores_gemma":[0.0024544995,0.00009693404,0.0005097477,0.00038868532,0.00002860466,0.00019849378,0.00037119837,0.9929848,0.0011127637,0.00005019516,0.0014340604,0.00037007203],"about_ca_topic_score_codex":0.00030248225,"about_ca_topic_score_gemma":0.000082472914,"teacher_disagreement_score":0.9696152,"about_ca_system_score_codex":0.0003474338,"about_ca_system_score_gemma":0.00039286216,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W4205992844","doi":"10.3934/mbe.2022134","title":"Coverage control of mobile sensor networks with directional sensing","year":2022,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Control theory (sociology); Mobile robot; Controller (irrigation); Position (finance); Invariant (physics); Orientation (vector space); Wireless sensor network; Control (management); Artificial intelligence; Mathematics; Robot","score_opus":0.00488757924057895,"score_gpt":0.18373305746777688,"score_spread":0.17884547822719793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205992844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026584908,0.00008065541,0.972162,0.00007958058,0.00032966532,0.00029675217,0.000015159345,0.00018243391,0.0002688519],"genre_scores_gemma":[0.97384083,8.2154367e-7,0.025989503,0.000037623606,0.000035345267,0.000043251828,0.0000014355923,0.000009375199,0.000041805906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982364,0.0000570121,0.0003404573,0.0003315359,0.00066975725,0.00036480767],"domain_scores_gemma":[0.99902534,0.00036489,0.00012722923,0.0003263272,0.000053099073,0.00010308979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006193196,0.0001567417,0.00030507718,0.00011387714,0.00017752139,0.00010424856,0.0005608516,0.00002665518,0.000031710435],"category_scores_gemma":[0.00006715572,0.00012852091,0.000071830385,0.000734366,0.000062666106,0.00020679134,0.00016524388,0.0001618406,0.0000049452583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006887139,0.0000811094,0.000107007065,0.000031482075,0.000029906112,0.000024230316,0.00018852408,0.96665704,0.012870476,0.01889193,0.000017722376,0.0010937048],"study_design_scores_gemma":[0.00037530923,0.00013306993,0.000121045094,0.000031269326,0.000009273084,0.0001057445,0.00006505264,0.9974782,0.00076192734,0.00009983564,0.00065312075,0.00016617912],"about_ca_topic_score_codex":0.000006837682,"about_ca_topic_score_gemma":2.931177e-7,"teacher_disagreement_score":0.9472559,"about_ca_system_score_codex":0.00007764243,"about_ca_system_score_gemma":0.000043884,"threshold_uncertainty_score":0.5240931},"labels":[],"label_agreement":null},{"id":"W4206309972","doi":"10.1109/ccta48906.2021.9658741","title":"Cyber-Attack Detection in Discrete-Time Nonlinear Multi-Agent Systems Using Neural Networks","year":2021,"lang":"en","type":"article","venue":"2021 IEEE Conference on Control Technology and Applications (CCTA)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Residual; Computer science; Nonlinear system; Lyapunov function; Control theory (sociology); Artificial neural network; Multi-agent system; Exploit; Controller (irrigation); Discrete time and continuous time; Observer (physics); Detector; Cyber-attack; Artificial intelligence; Algorithm; Mathematics; Control (management); Computer security; Telecommunications","score_opus":0.025357541819062183,"score_gpt":0.2735880156479563,"score_spread":0.24823047382889413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206309972","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04183387,0.00072592753,0.9537192,0.0015717248,0.00041170497,0.0012304067,0.000057502202,0.00030142095,0.00014825567],"genre_scores_gemma":[0.99657965,0.0000585037,0.001954682,0.000107119944,0.00015011386,0.0008292693,0.000025885345,0.00002238168,0.00027241628],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972305,0.00023397902,0.0006486722,0.0010678228,0.00023076669,0.0005882516],"domain_scores_gemma":[0.99790335,0.00015589378,0.00029728908,0.0011665961,0.00033668478,0.00014019561],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003239284,0.00036085345,0.00059999037,0.00044954286,0.00031829375,0.0003136463,0.0007856946,0.00047686056,0.000011743541],"category_scores_gemma":[0.0000689733,0.0003721946,0.00009311421,0.0015566844,0.00017966205,0.0002742277,0.00015822268,0.00060292735,0.0000741684],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015609065,0.0019301915,0.0066833277,0.00016637807,0.00060618704,0.0004165597,0.00016415435,0.24008434,0.27546328,0.16694771,0.00015575699,0.30722603],"study_design_scores_gemma":[0.0019125951,0.00006031509,0.00037668494,0.000072243616,0.000034741857,0.00007923996,0.000091243135,0.9943099,0.001169794,0.00015172854,0.0013933295,0.00034817503],"about_ca_topic_score_codex":0.00004304,"about_ca_topic_score_gemma":0.0001115136,"teacher_disagreement_score":0.95474577,"about_ca_system_score_codex":0.00014337545,"about_ca_system_score_gemma":0.00012475185,"threshold_uncertainty_score":0.999873},"labels":[],"label_agreement":null},{"id":"W4206998461","doi":"10.1142/s2737480721400057","title":"Adaptive Modeling for Downwash Effects in Multi-UAV Path Planning","year":2021,"lang":"en","type":"article","venue":"Guidance Navigation and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Downwash; Motion planning; Path (computing); Cylinder; Computer science; Simulation; Flow (mathematics); Aerospace engineering; Robot; Physics; Engineering; Artificial intelligence; Mechanics; Aerodynamics; Mechanical engineering","score_opus":0.028912380916863094,"score_gpt":0.2799872610146656,"score_spread":0.2510748800978025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206998461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024245853,0.0022231585,0.9719905,0.00035569866,0.0003109269,0.0007001251,0.000028479091,0.00009630888,0.000048919246],"genre_scores_gemma":[0.9794292,0.000004036961,0.019688053,0.00040188775,0.00006003053,0.00033063252,0.000024587562,0.000010268167,0.000051312854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984411,0.00014979218,0.00037933464,0.000498421,0.00019950273,0.00033184458],"domain_scores_gemma":[0.9990025,0.0002567994,0.0001293969,0.00028465292,0.00023244116,0.000094200805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044515738,0.0001711295,0.00030978926,0.0000553437,0.00011947617,0.00017597125,0.00024497055,0.00009167295,5.209565e-7],"category_scores_gemma":[0.00019431529,0.00017483783,0.000071569,0.00023402696,0.000015685018,0.0004127204,0.000049070553,0.00012721444,0.0000054628836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058661314,0.0008397845,0.038752247,0.0008507267,0.0004290866,0.0007408703,0.007896758,0.5213417,0.09299582,0.12782452,0.00079758494,0.20694429],"study_design_scores_gemma":[0.0065096454,0.00004631698,0.0022561725,0.00036695614,0.000011241662,0.000009502235,0.0001268327,0.98902845,0.00040927983,0.0008315331,0.00021035752,0.00019373365],"about_ca_topic_score_codex":0.000031475265,"about_ca_topic_score_gemma":0.000006104345,"teacher_disagreement_score":0.9551833,"about_ca_system_score_codex":0.00007178303,"about_ca_system_score_gemma":0.00008596975,"threshold_uncertainty_score":0.71296793},"labels":[],"label_agreement":null},{"id":"W4210497642","doi":"10.1109/tie.2022.3146582","title":"Event-Triggered Formation Tracking Control With Application to Multiple Mobile Robots","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Dalhousie University","keywords":"Control theory (sociology); Mobile robot; Computer science; Controller (irrigation); Lyapunov function; Lyapunov stability; Tracking error; Tracking (education); Linear matrix inequality; Robot; Mathematics; Control (management); Mathematical optimization; Artificial intelligence; Nonlinear system","score_opus":0.017334045441842926,"score_gpt":0.23525946115564775,"score_spread":0.21792541571380483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210497642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010244566,0.000046623074,0.985207,0.00063421053,0.000641143,0.0027199532,0.00012401586,0.0003472167,0.00003527181],"genre_scores_gemma":[0.995639,0.0000036656993,0.00037012898,0.00026366586,0.00009561677,0.0034614606,0.000025763184,0.000029578223,0.00011107337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972437,0.00029592542,0.00052995374,0.0005613453,0.0007369469,0.00063213374],"domain_scores_gemma":[0.998543,0.00019822406,0.0002621938,0.0006831782,0.00013601643,0.0001773465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005510456,0.00026783402,0.00031640776,0.00029789383,0.0007720171,0.00018560927,0.00082360546,0.000124747,0.000023256434],"category_scores_gemma":[0.0000117047775,0.00027674832,0.00013270527,0.0012826101,0.000015612188,0.0006352806,0.0000054475336,0.0008041443,0.000047682148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037057273,0.00029821045,0.0000073475762,0.0000035570652,0.0000678744,0.0000027293868,0.00020342304,0.89834625,0.0067091417,0.00032947384,0.00025381078,0.09340762],"study_design_scores_gemma":[0.010125202,0.0025778734,0.000013418706,0.000024627141,0.00008966037,0.000053325504,0.00019500667,0.9264378,0.034378376,0.00007677529,0.025404666,0.0006232682],"about_ca_topic_score_codex":0.000094185474,"about_ca_topic_score_gemma":0.0001523346,"teacher_disagreement_score":0.9853945,"about_ca_system_score_codex":0.0011796108,"about_ca_system_score_gemma":0.0003703488,"threshold_uncertainty_score":0.99996847},"labels":[],"label_agreement":null},{"id":"W4210972576","doi":"10.1007/978-1-4614-5073-3_1","title":"Introduction","year":2012,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Toronto","funders":"","keywords":"Psychology","score_opus":0.0171464605684479,"score_gpt":0.20800020971340488,"score_spread":0.19085374914495698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210972576","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.260367e-7,0.0005915347,0.3477056,0.0016752579,0.0025558474,0.00019423789,0.000007116173,0.0003688023,0.6469015],"genre_scores_gemma":[0.001539964,0.000032275242,0.002888577,0.00014404843,0.004008284,0.0000108791055,0.000045461995,0.000027373015,0.99130315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985381,0.00001499436,0.0003103714,0.00049020734,0.000361768,0.00028456099],"domain_scores_gemma":[0.9983983,0.00002550231,0.0001958936,0.0011408208,0.00010891203,0.00013058315],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00023113098,0.00027009353,0.0002943507,0.00012276169,0.000051515595,0.00013932698,0.0008341035,0.000247341,0.0012054787],"category_scores_gemma":[0.000012512829,0.0002435038,0.00013803114,0.000029324632,0.000024824638,0.00041042455,0.00021081865,0.00022420273,0.008265033],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.852293e-7,0.000006621104,0.0000010636006,0.000008480457,0.000038332753,0.0000029104776,0.0000141840055,0.0000018375463,0.000033158125,0.86527956,0.09539304,0.039220035],"study_design_scores_gemma":[0.00012863356,0.000014725652,0.000010573434,0.000013292245,0.000017657658,0.000026515025,7.0063265e-7,0.0006233678,0.000039939954,0.0048662657,0.9939828,0.00027551447],"about_ca_topic_score_codex":0.000009268716,"about_ca_topic_score_gemma":0.000003353721,"teacher_disagreement_score":0.8985898,"about_ca_system_score_codex":0.00011959812,"about_ca_system_score_gemma":0.000040581395,"threshold_uncertainty_score":0.9997076},"labels":[],"label_agreement":null},{"id":"W4212869235","doi":"10.3389/frobt.2021.771520","title":"Balancing Collective Exploration and Exploitation in Multi-Agent and Multi-Robot Systems: A Review","year":2022,"lang":"en","type":"review","venue":"Frontiers in Robotics and AI","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Flexibility (engineering); Benchmark (surveying); Robot; Swarm behaviour; Distributed computing; Dilemma; Swarm intelligence; Data science; Management science; Risk analysis (engineering); Artificial intelligence; Human–computer interaction; Machine learning; Particle swarm optimization","score_opus":0.08286976716573653,"score_gpt":0.31518880852801834,"score_spread":0.23231904136228182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212869235","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.4755997e-7,0.5532939,0.4442018,0.00008526928,0.00079138094,0.0015775877,0.000019855637,0.000024391893,0.0000055987307],"genre_scores_gemma":[0.000035218458,0.9662925,0.03249796,0.000086797794,0.00002656926,0.0008257459,0.00007406651,0.000032719392,0.00012842186],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965738,0.000792743,0.0010519237,0.00089986273,0.00030614165,0.00037553077],"domain_scores_gemma":[0.998704,0.0001724293,0.00052986055,0.00039697092,0.000061879575,0.00013486051],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011061954,0.0004648103,0.0018262692,0.0005262742,0.00015942639,0.00032582236,0.00036242453,0.00018340332,8.7298207e-7],"category_scores_gemma":[0.00022605441,0.0004482916,0.00009358713,0.0008741517,0.00004818179,0.00059995323,0.0003269696,0.00047266626,0.0000012298951],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008114542,0.00029561474,0.0007396016,0.068991765,0.0002485527,0.00017100628,0.0027035892,0.007942543,5.5249603e-7,0.0008653233,0.0032510704,0.9147823],"study_design_scores_gemma":[0.002074679,0.00011012102,0.00011106581,0.04820603,0.00028917816,0.000064426175,0.0007735456,0.7601741,6.054387e-8,0.00007611695,0.18717216,0.00094851136],"about_ca_topic_score_codex":0.00007876173,"about_ca_topic_score_gemma":0.00003748048,"teacher_disagreement_score":0.91383374,"about_ca_system_score_codex":0.00061430817,"about_ca_system_score_gemma":0.00022531934,"threshold_uncertainty_score":0.99979687},"labels":[],"label_agreement":null},{"id":"W4213130154","doi":"10.1109/camsap.2009.5413236","title":"Selective Gossip","year":2009,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Computer science; Coding (social sciences); Algorithm; Theoretical computer science; Focus (optics); Mathematics; Statistics","score_opus":0.00881599337313097,"score_gpt":0.23010645018230635,"score_spread":0.2212904568091754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213130154","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014864671,0.000040933828,0.8878066,0.0020830848,0.00020379771,0.00014192027,0.000001019227,0.00045470143,0.10778146],"genre_scores_gemma":[0.9907375,4.4996375e-7,0.006358459,0.000850257,0.00005210856,0.000005005416,0.0000010508687,0.0000019678685,0.0019931803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991774,0.00003567841,0.00013249506,0.0002495247,0.0001745128,0.00023037319],"domain_scores_gemma":[0.999414,0.000027970205,0.000038678463,0.00037484645,0.00006693866,0.00007752669],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001248032,0.000084487285,0.00010566068,0.000043298463,0.00005635104,0.00014327397,0.0006034092,0.000034943347,0.0000134367165],"category_scores_gemma":[0.000027634698,0.000070155314,0.000045065648,0.00031655107,0.0000071084464,0.00034268526,0.000032559223,0.000060824445,0.00039536908],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068158984,0.0001812107,0.0005940155,0.0000031524896,0.000033759356,0.00002907456,0.0004238083,0.00014417485,0.008766915,0.8117866,0.043842297,0.13418818],"study_design_scores_gemma":[0.0042659207,0.0009123384,0.23568812,0.000049679198,0.00001856507,0.00010356297,0.00009718402,0.5933826,0.031235378,0.049026847,0.083703876,0.00151591],"about_ca_topic_score_codex":0.00001880519,"about_ca_topic_score_gemma":0.00000322896,"teacher_disagreement_score":0.9892511,"about_ca_system_score_codex":0.0000463935,"about_ca_system_score_gemma":0.00003403473,"threshold_uncertainty_score":0.50818014},"labels":[],"label_agreement":null},{"id":"W4220729634","doi":"10.1109/tnnls.2022.3153077","title":"Adaptive Neural Coordinated Control for Multiple Euler-Lagrange Systems With Periodic Event-Triggered Sampling","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Control theory (sociology); Synchronization (alternating current); Sampling (signal processing); Event (particle physics); Computer science; Control (management); Schedule; Artificial neural network; Scheme (mathematics); Function (biology); Mathematics; Artificial intelligence; Detector","score_opus":0.021321236276566877,"score_gpt":0.226701528502502,"score_spread":0.20538029222593512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220729634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02191902,0.0016054653,0.9684373,0.000188002,0.0045198966,0.0026140811,0.00015500131,0.0005511649,0.000010081132],"genre_scores_gemma":[0.9971162,0.000008470389,0.00010999872,0.000074028,0.00022583947,0.0019468326,0.0000277913,0.00006933486,0.00042150603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955509,0.0013331283,0.0007335955,0.00096508296,0.0005665716,0.0008507618],"domain_scores_gemma":[0.9969588,0.0015365632,0.00051617215,0.00048865576,0.00022839106,0.00027139907],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00094166456,0.00050972454,0.00079865823,0.00024657333,0.0024820708,0.0007334453,0.000624502,0.00013730915,0.000005175814],"category_scores_gemma":[0.000021949445,0.00045433486,0.00023409033,0.0007058155,0.000075183045,0.00043976534,0.000010764345,0.0011654483,0.0000027863932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056322623,0.00010416116,0.00023782912,0.00006746631,0.0002146797,0.0000260948,0.00029925993,0.9938851,0.00016097954,0.00010595497,0.00009080663,0.0042444644],"study_design_scores_gemma":[0.0050880257,0.0015668416,0.00014170047,0.000118639,0.0001024112,0.00019703389,0.0011952433,0.9892951,0.0000035811843,7.431279e-7,0.0017755413,0.00051508896],"about_ca_topic_score_codex":0.0007692203,"about_ca_topic_score_gemma":0.000036231002,"teacher_disagreement_score":0.9751972,"about_ca_system_score_codex":0.00020885552,"about_ca_system_score_gemma":0.000053797645,"threshold_uncertainty_score":0.99979085},"labels":[],"label_agreement":null},{"id":"W4220917593","doi":"10.1109/icmre54455.2022.9734093","title":"Distributed Self-organized Collective Motion Control with Layered Structure for Robot Swarm","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Swarm behaviour; Robot; Computer science; Motion (physics); Motion control; Robot kinematics; Motion planning; Mobile robot; Swarm robotics; Work (physics); Distributed computing; Artificial intelligence; Engineering; Mechanical engineering","score_opus":0.006752459062181528,"score_gpt":0.19786781242306173,"score_spread":0.1911153533608802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220917593","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070373383,0.000031069212,0.98623693,0.0013942191,0.00049835234,0.0024060148,0.0014415284,0.0007902875,0.00016425362],"genre_scores_gemma":[0.9848212,2.3881756e-7,0.01347385,0.00032329882,0.0000688643,0.0005518366,0.00029118566,0.00002842659,0.00044109434],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975352,0.00027259463,0.00036843255,0.000713169,0.0005806607,0.0005299185],"domain_scores_gemma":[0.998301,0.00024151117,0.00027331783,0.000643712,0.00038836704,0.00015207307],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003186408,0.00029337485,0.00044761816,0.00011899382,0.00069758575,0.00024741076,0.0010408292,0.000070850205,0.00009192806],"category_scores_gemma":[0.00007383736,0.00024710104,0.00010979848,0.0010831666,0.000021883763,0.00033871378,0.00019176082,0.00021498775,0.0000071280197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058619687,0.0042428244,0.011608404,0.00035294096,0.0068268925,0.00029950633,0.011110923,0.6149171,0.10643274,0.14078914,0.090136126,0.0074214125],"study_design_scores_gemma":[0.03128464,0.0013829066,0.0063669165,0.000011302254,0.00016171976,0.0001505899,0.0005612194,0.9406275,0.008389068,0.0020422752,0.008025508,0.0009963616],"about_ca_topic_score_codex":0.000066656714,"about_ca_topic_score_gemma":0.000046176265,"teacher_disagreement_score":0.97778386,"about_ca_system_score_codex":0.0007636694,"about_ca_system_score_gemma":0.00033634112,"threshold_uncertainty_score":0.99999815},"labels":[],"label_agreement":null},{"id":"W4221102161","doi":"10.1007/s11227-022-04305-w","title":"Improved reinforcement learning in cooperative multi-agent environments using knowledge transfer","year":2022,"lang":"en","type":"article","venue":"The Journal of Supercomputing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Abstraction; State space; Convergence (economics); Process (computing); Artificial intelligence; Fuse (electrical); Mechanism (biology); State (computer science); Space (punctuation); Transfer of learning; Class (philosophy); Machine learning; Distributed computing; Algorithm","score_opus":0.03410398160610389,"score_gpt":0.26108662622533757,"score_spread":0.22698264461923368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4221102161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3396178,0.00042288948,0.6591298,0.00010507881,0.00044760839,0.00023264268,9.2248865e-7,0.000012512128,0.000030767456],"genre_scores_gemma":[0.99824065,0.000013385573,0.0014538809,0.00008525295,0.00008640969,0.0000043918544,0.000001561393,0.000016260095,0.00009820368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996942,0.001061974,0.0009062244,0.00020252552,0.00046596956,0.00042133135],"domain_scores_gemma":[0.999163,0.00020965813,0.00021086742,0.00026192114,0.0000621539,0.000092455324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003164259,0.00020008656,0.00034587414,0.00019686516,0.0005948789,0.00008656122,0.0012307498,0.000032234813,0.000024082401],"category_scores_gemma":[0.000051651918,0.00015620948,0.000129945,0.00041780339,0.00003808739,0.00043317382,0.0005233195,0.00083954714,0.000005362364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026874692,0.00013923847,0.0005779192,0.0000071756454,0.000060089493,0.000028227778,0.011088157,0.9133945,0.07241602,0.000085269,0.000009370585,0.002167121],"study_design_scores_gemma":[0.0021996563,0.00024379494,0.0005987154,0.000055564265,0.000023550834,0.00018884818,0.0023692849,0.9914036,0.0018322888,0.0000029923356,0.0009085783,0.00017315983],"about_ca_topic_score_codex":0.000091606176,"about_ca_topic_score_gemma":0.0000069502175,"teacher_disagreement_score":0.65862286,"about_ca_system_score_codex":0.00066394696,"about_ca_system_score_gemma":0.00015145888,"threshold_uncertainty_score":0.6370038},"labels":[],"label_agreement":null},{"id":"W4224134962","doi":"10.1002/rnc.6119","title":"Stochastic fixed‐time formation for nonlinear multi‐agent systems under a discontinuous protocol","year":2022,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Settling time; Nonlinear system; Protocol (science); Control theory (sociology); Computer science; Upper and lower bounds; Simple (philosophy); Tracking (education); Multi-agent system; Stability (learning theory); Control (management); Mathematics; Mathematical optimization; Control engineering; Engineering; Mathematical analysis","score_opus":0.022600181502319013,"score_gpt":0.274660298795582,"score_spread":0.252060117293263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224134962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017540377,0.00011470724,0.9818133,0.0017029425,0.001533811,0.012563612,0.00046204586,0.00004107764,0.000014435483],"genre_scores_gemma":[0.91793567,0.0000041587964,0.054636817,0.0008166479,0.0027152263,0.022642137,0.00014797911,0.00007295828,0.0010284238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974386,0.00019517721,0.0009661068,0.0002522559,0.0008671787,0.00028070045],"domain_scores_gemma":[0.99749553,0.00027095503,0.0010100554,0.00020625703,0.0008696395,0.00014755837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010713164,0.00021214789,0.00041501867,0.00028706636,0.00020827183,0.00041795772,0.0011089748,0.000052919215,0.000016867192],"category_scores_gemma":[0.00015807198,0.0001838366,0.00022636593,0.00012279325,0.00003116697,0.0007699157,0.00019255835,0.00026171253,0.000008531379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002156851,0.0014060254,0.00023059663,0.00011190189,0.0012556727,0.00018351506,0.0006731334,0.9709615,0.0045008846,0.0028327776,0.003357355,0.0123297805],"study_design_scores_gemma":[0.010822815,0.00040310997,0.000085063264,0.00007000884,0.000041713953,0.00055286894,0.00016502348,0.97075826,0.000025140682,0.000040259383,0.016847143,0.00018858456],"about_ca_topic_score_codex":0.000013592132,"about_ca_topic_score_gemma":0.0000032534629,"teacher_disagreement_score":0.92717654,"about_ca_system_score_codex":0.00025930218,"about_ca_system_score_gemma":0.00017634343,"threshold_uncertainty_score":0.7496639},"labels":[],"label_agreement":null},{"id":"W4225013385","doi":"10.1155/2022/3639586","title":"Cooperative Tracking Control of the Multiple-High-Speed Trains System Using a Tunable Artificial Potential Function","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for Central Universities of the Central South University; National Natural Science Foundation of China; Education Department of Hunan Province","keywords":"Train; Range (aeronautics); Tracking (education); Block (permutation group theory); Computer science; Control theory (sociology); Function (biology); Potential field; Simulation; Control (management); Artificial intelligence; Engineering; Mathematics; Aerospace engineering","score_opus":0.015152272802190475,"score_gpt":0.22594609781903632,"score_spread":0.21079382501684585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225013385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43932554,0.00005989754,0.5585264,0.000087745524,0.001611351,0.0003001057,0.00006771779,0.000018474724,0.0000027836354],"genre_scores_gemma":[0.99784,0.0000010192923,0.0019490692,0.000032095308,0.00013737689,0.000009050903,0.000010650942,0.000013588278,0.0000071349386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974077,0.00030061958,0.0010565202,0.00020747959,0.00080958504,0.00021810534],"domain_scores_gemma":[0.99761146,0.00008998349,0.0014427486,0.00022012003,0.0005730414,0.0000626537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006272259,0.00015518421,0.00039194492,0.00014982982,0.00038207427,0.000057978028,0.00048712298,0.00004263249,0.000007524035],"category_scores_gemma":[0.0000404659,0.00012700532,0.00025948003,0.0005514596,0.00003326099,0.0009166922,0.000008397661,0.00030186263,4.2420828e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036001773,0.000089760244,0.0002389342,0.000025775911,0.00008300159,0.000025386056,0.0009910224,0.7407176,0.25317103,0.002917294,0.0000022789113,0.001377927],"study_design_scores_gemma":[0.01337937,0.0010478185,0.0799846,0.00031588742,0.0005400127,0.00020258599,0.010233782,0.87189955,0.021295065,0.00039246483,0.00024252478,0.00046632605],"about_ca_topic_score_codex":0.00003990464,"about_ca_topic_score_gemma":0.00002966421,"teacher_disagreement_score":0.5585145,"about_ca_system_score_codex":0.00025905343,"about_ca_system_score_gemma":0.0002095857,"threshold_uncertainty_score":0.5179126},"labels":[],"label_agreement":null},{"id":"W4225158077","doi":"10.1109/tcyb.2022.3166481","title":"A Multirobot Person Search System for Finding Multiple Dynamic Users in Human-Centered Environments","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; AGE-WELL; Ontario Centres of Excellence","keywords":"Robot; Set (abstract data type); Cluster analysis; Action (physics); Selection (genetic algorithm); Search problem; Path (computing); Graph; Fuzzy logic","score_opus":0.046045388429642606,"score_gpt":0.2705196836000002,"score_spread":0.2244742951703576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225158077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13682437,0.000026373627,0.86029685,0.00012076466,0.0010020693,0.001247784,0.00030071166,0.00013951685,0.000041579435],"genre_scores_gemma":[0.99544454,0.0000032655191,0.0029215114,0.00003280511,0.0000141168675,0.0006981898,0.000025661175,0.000041084826,0.00081883604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974311,0.00026649484,0.0004325129,0.0006768118,0.0005998954,0.000593208],"domain_scores_gemma":[0.99883896,0.00023563177,0.00012289532,0.0006530296,0.000021056345,0.00012842027],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042849992,0.0002598606,0.0003033465,0.0003577753,0.00058353826,0.000118448464,0.0009538797,0.000083403014,0.000016999358],"category_scores_gemma":[0.0000048831057,0.00031237683,0.00019307139,0.00038071064,0.000038928,0.00017827936,0.000013238201,0.00042324828,0.000028471657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011384362,0.0011062208,0.0005169939,0.000119753335,0.00013417914,0.000050628198,0.0038216142,0.93754077,0.046933755,0.00029551648,0.000054608052,0.009312141],"study_design_scores_gemma":[0.004370711,0.00028239054,0.0009469198,0.00005988881,0.000024500117,0.000018174595,0.0017092547,0.98698175,0.0048212484,0.0000035309192,0.00045156054,0.00033005243],"about_ca_topic_score_codex":0.00028018618,"about_ca_topic_score_gemma":0.00019543963,"teacher_disagreement_score":0.85862017,"about_ca_system_score_codex":0.001474469,"about_ca_system_score_gemma":0.00004341292,"threshold_uncertainty_score":0.9999328},"labels":[],"label_agreement":null},{"id":"W4225533125","doi":"10.1093/imamat/hxac029","title":"Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation","year":2022,"lang":"en","type":"article","venue":"IMA Journal of Applied Mathematics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Vector Institute; University of Toronto","funders":"Vector Institute","keywords":"Gossip; Mathematics; Heat equation; Poisson's equation; Poisson distribution; Acceleration; Limit (mathematics); Applied mathematics; Mathematical analysis; Physics","score_opus":0.042034310605269874,"score_gpt":0.2670758552640364,"score_spread":0.2250415446587665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225533125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068348036,0.00015756265,0.98762774,0.0010356706,0.0005776338,0.00036120313,0.000012245019,0.00002809606,0.0033650377],"genre_scores_gemma":[0.8939433,0.00001041235,0.10569791,0.000115254865,0.00015382355,0.00003469787,0.0000034855723,0.000015859654,0.000025245063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974356,0.0000726815,0.0010501742,0.0001482679,0.0010819258,0.0002113363],"domain_scores_gemma":[0.99706715,0.00039764782,0.0017277888,0.00050874363,0.0002501603,0.00004850105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014887837,0.00015302416,0.00036783158,0.00008963654,0.0002502583,0.0001642431,0.0014216162,0.000038974213,0.00003982294],"category_scores_gemma":[0.00009197671,0.00011116592,0.00014342934,0.00044608105,0.0000461934,0.00038701363,0.00025040496,0.0003052788,0.000010680843],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005227411,0.000766305,0.000007178137,0.00014272604,0.00027004606,0.000021990569,0.01991372,0.024540259,0.028962454,0.8965573,0.002943568,0.025822217],"study_design_scores_gemma":[0.0035465483,0.00048913946,0.00013003332,0.000106058134,0.00018264612,0.00041162854,0.0063107884,0.675954,0.025164368,0.2771755,0.010026842,0.00050248596],"about_ca_topic_score_codex":0.000005420011,"about_ca_topic_score_gemma":4.6688774e-7,"teacher_disagreement_score":0.8871085,"about_ca_system_score_codex":0.00014173838,"about_ca_system_score_gemma":0.00015174919,"threshold_uncertainty_score":0.4533215},"labels":[],"label_agreement":null},{"id":"W4226085542","doi":"10.1109/tii.2022.3157595","title":"Distributed Event-Triggered Bipartite Consensus for Multiagent Systems Against Injection Attacks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bipartite graph; Multi-agent system; Computer science; Consensus; Distributed computing; Event (particle physics); Computer security; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.055698788210991806,"score_gpt":0.27142090932311475,"score_spread":0.21572212111212294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226085542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016933111,0.000025163166,0.96545404,0.0003436663,0.010201017,0.002810309,0.003613524,0.0005154406,0.0001037257],"genre_scores_gemma":[0.996662,0.000005169564,0.0007543513,0.0002074054,0.00019042981,0.0015933895,0.00023977584,0.000030588137,0.0003168459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960982,0.00033635952,0.0016521247,0.00035192986,0.00087370793,0.0006876777],"domain_scores_gemma":[0.9973032,0.0005030947,0.00076828734,0.0008790627,0.000276158,0.00027022435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010920662,0.00039756845,0.00052791485,0.00044395772,0.0012561707,0.00045351815,0.00092563214,0.0002519316,0.000018418461],"category_scores_gemma":[0.00006581598,0.00042198456,0.00034266332,0.0011736101,0.000058019978,0.00052636175,0.00001887201,0.0007914428,0.000059981732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020124257,0.0003398467,0.0000112593225,0.000048951144,0.00022635372,0.0000056526364,0.00076235994,0.973373,0.00017955984,0.00038619488,0.012836868,0.011628717],"study_design_scores_gemma":[0.0058866353,0.00063843373,0.0000039626775,0.00005688884,0.000078025485,0.000041708034,0.0017179174,0.9434417,0.0017545673,0.000015733249,0.045857612,0.00050685194],"about_ca_topic_score_codex":0.00010945519,"about_ca_topic_score_gemma":0.000009167717,"teacher_disagreement_score":0.97972894,"about_ca_system_score_codex":0.00094022736,"about_ca_system_score_gemma":0.00038374914,"threshold_uncertainty_score":0.9998232},"labels":[],"label_agreement":null},{"id":"W4226183323","doi":"10.23977/jemm.2022.070106","title":"Design of H∞ Predictive Controller for Networked Control System","year":2022,"lang":"en","type":"article","venue":"Journal of Engineering Mechanics and Machinery","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Control theory (sociology); Dropout (neural networks); Network packet; Networked control system; Computer science; Model predictive control; Observer (physics); Compensation (psychology); Lyapunov function; Packet loss; Controller (irrigation); Linear matrix inequality; Bernoulli's principle; Control system; Control (management); Mathematics; Mathematical optimization; Engineering; Nonlinear system; Artificial intelligence","score_opus":0.008363148142955641,"score_gpt":0.1880381628584976,"score_spread":0.17967501471554195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226183323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00044821654,0.0011690655,0.9964956,0.00007383107,0.0012901847,0.00043596106,0.000043059845,0.00003592492,0.000008160243],"genre_scores_gemma":[0.9882813,0.000009811026,0.011471213,0.000027764001,0.00013396614,0.000049913764,9.684527e-7,0.000014970922,0.000010112006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869406,0.00010803756,0.00055702106,0.00013711362,0.00030208126,0.00020165763],"domain_scores_gemma":[0.9986884,0.00038319244,0.0005113846,0.00014720135,0.00017347504,0.00009635073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016802767,0.00013647277,0.00047615892,0.00015613048,0.000078015255,0.000036611753,0.00044311263,0.000036592788,0.0000010169889],"category_scores_gemma":[0.000072225295,0.000119058604,0.00013721154,0.00013303045,0.0000027411509,0.00011905169,0.00008280221,0.00019232424,8.530122e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019624151,0.000033461853,0.000003941612,0.000060331062,0.0002481084,0.000013269461,0.00006128863,0.95756507,0.0066868193,0.033973765,0.00022393726,0.00093377166],"study_design_scores_gemma":[0.0034954322,0.0006353912,0.000010359128,0.000051647985,0.00006745358,0.00014525701,0.00003912597,0.9943384,0.000054167882,0.00032299696,0.00073974923,0.000100002035],"about_ca_topic_score_codex":0.0000031491381,"about_ca_topic_score_gemma":5.1763994e-8,"teacher_disagreement_score":0.9878331,"about_ca_system_score_codex":0.00009200945,"about_ca_system_score_gemma":0.000057190628,"threshold_uncertainty_score":0.4855069},"labels":[],"label_agreement":null},{"id":"W4226299421","doi":"10.1109/tac.2022.3140260","title":"Safe Coverage of Moving Domains for Vehicles With Second-Order Dynamics","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Double integrator; Collision avoidance; Reachability; Bounded function; Control theory (sociology); Controller (irrigation); Collision; Computer science; Pairwise comparison; Integrator; Domain (mathematical analysis); Regular polygon; Vehicle dynamics; Controllability; Mathematical optimization; Topology (electrical circuits); Mathematics; Applied mathematics; Multi-agent system; Engineering; Control (management); Algorithm; Mathematical analysis; Geometry; Aerospace engineering; Artificial intelligence","score_opus":0.007464937813505351,"score_gpt":0.21625570994869786,"score_spread":0.2087907721351925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226299421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024129083,0.000023496776,0.9717273,0.0005954216,0.00055905303,0.001417056,0.00094518263,0.00028190177,0.0003215075],"genre_scores_gemma":[0.9902409,9.439591e-7,0.008054129,0.0002938315,0.000014064778,0.00090647995,0.000009849375,0.000028566797,0.00045125064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997927,0.00019479709,0.0005546474,0.00040935318,0.00053268345,0.00038150867],"domain_scores_gemma":[0.99801874,0.0007198953,0.0003144791,0.00070827716,0.00014050855,0.00009809278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004559241,0.00024082622,0.00047851482,0.00022513542,0.0004439616,0.00009271412,0.00073597924,0.000051706807,0.00015010733],"category_scores_gemma":[0.000012195435,0.00022890097,0.00019298389,0.0004980131,0.000046410838,0.00028030068,0.000005081407,0.00018400638,0.0000113293945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044547455,0.001566874,0.00009374476,0.00041869152,0.0012681325,0.00004277875,0.0014700975,0.750333,0.007998123,0.012888205,0.0002671463,0.22320774],"study_design_scores_gemma":[0.006165317,0.00050536805,0.00022361826,0.00003056177,0.000085134685,0.000032452164,0.00014838789,0.9911775,0.0006150354,0.00025831387,0.0005096695,0.00024866647],"about_ca_topic_score_codex":0.000040979576,"about_ca_topic_score_gemma":0.00013530352,"teacher_disagreement_score":0.9661118,"about_ca_system_score_codex":0.0003228358,"about_ca_system_score_gemma":0.00021610777,"threshold_uncertainty_score":0.9334311},"labels":[],"label_agreement":null},{"id":"W4234992441","doi":"10.7287/peerj.preprints.674","title":"Super-individual based model for fish migration","year":2014,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Penn West Exploration (Canada)","funders":"","keywords":"Fish <Actinopterygii>; IBM; Fish migration; Focus (optics); Motion (physics); Computer science; Collective motion; Ecology; Fishery; Artificial intelligence; Biology; Physics","score_opus":0.04970382953900401,"score_gpt":0.26679960391451385,"score_spread":0.21709577437550984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234992441","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014038029,0.000015698031,0.99002475,0.0042427867,0.0011243366,0.0013647733,0.00054674706,0.00053844636,0.0007386718],"genre_scores_gemma":[0.87787217,0.0000011032246,0.11700139,0.0016522779,0.00024199623,0.00071028474,0.0010950783,0.000027494063,0.0013982069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99740714,0.00010862057,0.000533463,0.0009698081,0.0005507182,0.0004302453],"domain_scores_gemma":[0.9975617,0.00024199503,0.00024283188,0.0015012731,0.00030352717,0.00014867853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000789507,0.00036544356,0.00045723133,0.00015123238,0.00010512668,0.0008015181,0.002308498,0.00038487485,0.000011965268],"category_scores_gemma":[0.00014828764,0.00034612833,0.00032768794,0.000088940156,0.00002051009,0.00023436143,0.00062072487,0.00024580932,0.000036612375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022366228,0.00021948227,0.00025518567,0.00044279973,0.00018240609,0.0000023937155,0.0005689473,0.7443635,0.00028001002,0.03528617,0.20959754,0.0087792305],"study_design_scores_gemma":[0.0008397775,0.000031123815,0.00011151442,0.00005354829,0.00003637848,7.044937e-7,0.0000047657336,0.9912973,0.00032065733,0.0020579374,0.0048502753,0.00039599958],"about_ca_topic_score_codex":0.000118198695,"about_ca_topic_score_gemma":0.00053657265,"teacher_disagreement_score":0.87646836,"about_ca_system_score_codex":0.00010139477,"about_ca_system_score_gemma":0.00036234342,"threshold_uncertainty_score":0.9998991},"labels":[],"label_agreement":null},{"id":"W4237733695","doi":"10.1002/9781119263081.oth1","title":"Bibliography","year":2018,"lang":"en","type":"other","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Citation; Computer science; Heading (navigation); Artificial intelligence; Operations research; Library science; Engineering; Aerospace engineering","score_opus":0.01185230789279846,"score_gpt":0.2347640126522238,"score_spread":0.22291170475942534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237733695","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9734538e-8,0.00021685545,0.3971496,0.0000746943,0.0010496156,0.00014694502,0.000010261211,0.0010318827,0.60032016],"genre_scores_gemma":[0.00006426577,0.0002564183,0.014058094,0.00022302353,0.00059819483,0.000027882072,0.000013702623,0.00016711974,0.9845913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987014,0.00004347039,0.00016606074,0.00048776416,0.00031517123,0.0002861552],"domain_scores_gemma":[0.99848676,0.000017082604,0.00015000539,0.0011993963,0.00004042032,0.00010634344],"candidate_categories":["bibliometrics","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011644446,0.00022635613,0.0002527354,0.012423312,0.000023815563,0.000243818,0.001713584,0.00021632439,0.0032585661],"category_scores_gemma":[0.0000055679975,0.00018546513,0.00014829914,0.009455751,0.000042495296,0.00009053095,0.00020017223,0.00006103724,0.011364153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0076011e-7,0.000015124708,0.000087939894,0.000010649813,0.000058435693,0.000005872767,0.0000017667817,3.1401967e-8,0.0000043808705,0.007472766,0.991534,0.0008088346],"study_design_scores_gemma":[0.00019407517,0.000020168709,0.000046778994,0.00005219394,0.0000060263064,0.0000032262296,9.834981e-7,0.000655176,0.000010124437,0.00013836265,0.9986441,0.00022878942],"about_ca_topic_score_codex":0.00033435758,"about_ca_topic_score_gemma":0.000056152854,"teacher_disagreement_score":0.38427117,"about_ca_system_score_codex":0.000004044382,"about_ca_system_score_gemma":0.000017328337,"threshold_uncertainty_score":0.99877},"labels":[],"label_agreement":null},{"id":"W4241434187","doi":"10.1007/978-3-642-28804-3_1","title":"Introduction","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Class (philosophy); Computer science; Transformation (genetics); Context (archaeology); State space; State (computer science); Property (philosophy); Distributed computing; Theoretical computer science; Artificial intelligence; Mathematics; Algorithm; Geography","score_opus":0.011928923014505015,"score_gpt":0.2218375477233043,"score_spread":0.20990862470879929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241434187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001209598,0.0022893422,0.92965347,0.007931473,0.0014499638,0.00050448964,0.000028608532,0.0001241814,0.05800639],"genre_scores_gemma":[0.989032,0.00040569666,0.0035168806,0.00360225,0.0017287635,0.000053627617,0.000058814985,0.000014086665,0.0015879138],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810815,0.00003731618,0.0006120557,0.00032063774,0.00056347484,0.0003583491],"domain_scores_gemma":[0.9987135,0.00024773617,0.0004489303,0.00035168408,0.00013952781,0.000098631805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010444858,0.0002880524,0.00037726416,0.00048479476,0.00019433477,0.00057843776,0.0006574668,0.00027336885,0.0000623369],"category_scores_gemma":[0.00024424706,0.00022827517,0.000071741626,0.00018294629,0.00019502157,0.0048837187,0.00010030571,0.00031262805,0.0001939955],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012311378,0.00000772193,0.00013173485,0.000043175958,0.000025564032,9.58863e-7,0.0005635871,0.0014871414,0.00003717549,0.42632204,0.0005162291,0.57085234],"study_design_scores_gemma":[0.0014081416,0.00014390144,0.000617007,0.00009802664,0.000028096116,0.00005967264,0.000007688949,0.10407429,0.000051723946,0.027906723,0.8649325,0.0006722194],"about_ca_topic_score_codex":0.000029611896,"about_ca_topic_score_gemma":0.000019975716,"teacher_disagreement_score":0.9890199,"about_ca_system_score_codex":0.000079312646,"about_ca_system_score_gemma":0.00010197625,"threshold_uncertainty_score":0.9308791},"labels":[],"label_agreement":null},{"id":"W4243912606","doi":"10.1109/ssd.2011.5981486","title":"Multi-robot target pursuit: towards an opportunistic control architecture","year":2011,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Robot; Action selection; Probabilistic logic; Artificial intelligence; Inference; Machine learning; Human–computer interaction; Perception","score_opus":0.06381290151147082,"score_gpt":0.26101700008132145,"score_spread":0.19720409856985063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243912606","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029849555,0.0000603605,0.98773754,0.0005702146,0.0008895379,0.00063565635,0.00010873364,0.0008111206,0.008888374],"genre_scores_gemma":[0.81314915,0.0000012605791,0.18444206,0.0009430937,0.00010770364,0.000076922224,0.000035555724,0.000024966983,0.0012192782],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711126,0.00026140618,0.00051751157,0.0008159847,0.00054770795,0.00074611953],"domain_scores_gemma":[0.9975029,0.000053622356,0.00019298005,0.0014717699,0.00018673038,0.0005919827],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006528275,0.00037291305,0.00046091204,0.00016037063,0.00015269805,0.00028223713,0.0026796032,0.00015565731,0.00033591816],"category_scores_gemma":[0.00011901395,0.00030513332,0.00016360809,0.0002811448,0.00008646835,0.00060543517,0.00021893307,0.0002521981,0.00028982334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004311306,0.0064780023,0.0105689075,0.00025314538,0.0014194102,0.0026564938,0.013951387,0.0031385303,0.08201629,0.4417432,0.008864107,0.4284794],"study_design_scores_gemma":[0.008472076,0.00084793026,0.03927208,0.000049510276,0.00008646077,0.00022213232,0.00020791216,0.9238638,0.0017158679,0.004555104,0.018985556,0.0017215473],"about_ca_topic_score_codex":0.00046895235,"about_ca_topic_score_gemma":0.00007331684,"teacher_disagreement_score":0.9207253,"about_ca_system_score_codex":0.000064706815,"about_ca_system_score_gemma":0.00019670062,"threshold_uncertainty_score":0.9999401},"labels":[],"label_agreement":null},{"id":"W4244001582","doi":"10.1007/978-3-662-53120-4_300739","title":"Virtual Joint Tolerancing","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Joint (building); Computer science; Engineering; Architectural engineering","score_opus":0.022901137471617976,"score_gpt":0.2071566587781792,"score_spread":0.18425552130656123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244001582","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000023978234,0.00012830422,0.41708502,0.00023129913,0.0016925021,0.00032479336,0.000016270234,0.00030593498,0.5802135],"genre_scores_gemma":[0.021342993,0.000009606849,0.0016700953,0.0006078567,0.00032474758,0.00000794281,0.000027567066,0.000047885693,0.9759613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975278,0.000021239619,0.000584418,0.00081370265,0.0006640145,0.00038885628],"domain_scores_gemma":[0.99772656,0.00007515575,0.00030784452,0.0015960267,0.00014407728,0.00015030829],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002892365,0.00044271682,0.00065799686,0.00017648622,0.00006208551,0.0002991226,0.0013140062,0.00034199227,0.00042958691],"category_scores_gemma":[0.00001805719,0.00039884477,0.00030430447,0.00003540309,0.000026572357,0.00031441162,0.0004709415,0.00036689278,0.008652401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017103105,0.0000068454847,0.0000022651307,0.000018715058,0.00006941303,0.0000339672,0.000048852788,0.000080732345,0.000109475965,0.9717276,0.011216391,0.01668402],"study_design_scores_gemma":[0.0011733281,0.00018781751,0.000041028376,0.00047878287,0.00003815335,0.000060673083,0.000011097944,0.046550225,0.00019651592,0.0054520094,0.9444818,0.0013285794],"about_ca_topic_score_codex":0.000029604278,"about_ca_topic_score_gemma":0.0000126781015,"teacher_disagreement_score":0.96627563,"about_ca_system_score_codex":0.0001786796,"about_ca_system_score_gemma":0.00022538213,"threshold_uncertainty_score":0.99984634},"labels":[],"label_agreement":null},{"id":"W4244576934","doi":"10.4018/978-1-7998-1754-3.ch098","title":"Adaptive Swarm Coordination and Formation Control","year":2019,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Swarm behaviour; Adaptive control; Computer science; Control engineering; Control (management); Control theory (sociology); Engineering; Artificial intelligence","score_opus":0.014985293111376896,"score_gpt":0.2192263315292921,"score_spread":0.20424103841791522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244576934","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016599188,0.00026106474,0.3662766,0.00014500297,0.0006067943,0.0008915976,0.00022740732,0.00018510832,0.63138986],"genre_scores_gemma":[0.96136945,0.0000017987674,0.00056650897,0.00037195557,0.00014990379,0.000029485158,0.000014956181,0.000022619368,0.03747331],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998091,0.00004548336,0.0004717284,0.0005639209,0.0005060268,0.00032188764],"domain_scores_gemma":[0.9983855,0.00007208364,0.0005039908,0.00061898975,0.00027790066,0.00014153682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021950131,0.00040791382,0.00052009895,0.000090523805,0.00009438846,0.00029711935,0.0006103246,0.0003645545,0.0000031957368],"category_scores_gemma":[0.000019560646,0.00040721835,0.0001436417,0.000022121487,0.000049503535,0.0003901902,0.00017558466,0.00020397265,0.0003722388],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002262067,0.0000047357994,0.000005612682,0.00002818044,0.00008296214,0.000014185895,0.00004812315,0.000023638926,0.000018561203,0.98625433,0.0014887534,0.01200827],"study_design_scores_gemma":[0.0117526045,0.0009778396,0.0004200379,0.0011464373,0.00040364283,0.00037707842,0.000054081695,0.2745459,0.0001279377,0.58699965,0.120375186,0.0028195933],"about_ca_topic_score_codex":0.00004420283,"about_ca_topic_score_gemma":0.000029909263,"teacher_disagreement_score":0.9613529,"about_ca_system_score_codex":0.00041009,"about_ca_system_score_gemma":0.00016091745,"threshold_uncertainty_score":0.999838},"labels":[],"label_agreement":null},{"id":"W4245655023","doi":"10.1007/978-1-4419-8393-0_1","title":"Introduction","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fault detection and isolation; Isolation (microbiology); Reliability (semiconductor); Computer science; Drone; Mobile robot; Engineering; Architecture; Control (management); Fault tolerance; Real-time computing; Robot; Control engineering; Systems engineering; Distributed computing; Artificial intelligence; Geography","score_opus":0.02285907024211522,"score_gpt":0.20029088012376206,"score_spread":0.17743180988164683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245655023","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.2058675e-8,0.00011327711,0.37336043,0.0006718958,0.0017390128,0.00016001724,0.0000052422943,0.00032980205,0.6236202],"genre_scores_gemma":[0.0007838631,0.000021579559,0.0026201142,0.00012920024,0.0015039848,0.000010362954,0.000028650778,0.000025709087,0.99487656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99851406,0.000013477347,0.00032634745,0.00063493464,0.0002938178,0.00021738955],"domain_scores_gemma":[0.9982962,0.000016735568,0.00020653121,0.0012501209,0.00013334205,0.00009706557],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00017111297,0.00027400188,0.00030083078,0.00013677531,0.000047617046,0.000117346804,0.0010334305,0.00024761766,0.001569257],"category_scores_gemma":[0.000012340204,0.00024729784,0.0001437001,0.000028125143,0.00003016395,0.00027928228,0.00021616346,0.00021709007,0.007096659],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012875034,0.0000058184255,4.2437813e-7,0.000007094819,0.000040759525,0.00000886843,0.000019795682,7.8013517e-7,0.00001484012,0.8814812,0.0992433,0.01917589],"study_design_scores_gemma":[0.00013787248,0.000031073425,0.0000068317077,0.00001700643,0.000014665846,0.000024675874,5.243203e-7,0.0004216382,0.00005129308,0.03220558,0.96680456,0.00028429483],"about_ca_topic_score_codex":0.000024917648,"about_ca_topic_score_gemma":0.0000073174524,"teacher_disagreement_score":0.8675612,"about_ca_system_score_codex":0.00008415708,"about_ca_system_score_gemma":0.00005311048,"threshold_uncertainty_score":0.9999979},"labels":[],"label_agreement":null},{"id":"W4249078251","doi":"10.1109/tsp.2012.2215604","title":"Average-Consensus in a Deterministic Framework— Part II: Central Connectivity","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Signal Processing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Consensus algorithm; Convergence (economics); Computer science; Rate of convergence; Mathematical proof; Upper and lower bounds; Uniform consensus; Node (physics); Algorithm; Process (computing); Mathematical optimization; Consensus; Mathematics; Theoretical computer science; Artificial intelligence; Multi-agent system; Key (lock)","score_opus":0.029734754738576133,"score_gpt":0.2662125139550908,"score_spread":0.2364777592165147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249078251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08111904,0.00012746423,0.9168046,0.00023868876,0.0009427479,0.00030391396,0.00002118278,0.00024071641,0.00020164067],"genre_scores_gemma":[0.9960252,0.0000018949347,0.0034319344,0.00019700412,0.00014906174,0.00008467789,0.0000010355402,0.000021745787,0.00008743384],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975161,0.00021521011,0.0004691743,0.00048356992,0.00040466018,0.00091128756],"domain_scores_gemma":[0.9987079,0.00040025602,0.00016362032,0.00036925395,0.00007360938,0.00028536445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047671772,0.0002852556,0.00033467318,0.00020905404,0.00045929186,0.00022058997,0.0004538434,0.00017673604,0.000047449543],"category_scores_gemma":[0.000028467177,0.00028922234,0.00012311984,0.0006069701,0.00007201545,0.0007023777,0.000005507682,0.00055966515,0.000060034654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003424492,0.0047817826,0.0041943155,0.00042332106,0.0001773438,0.00026001094,0.012433535,0.11222829,0.006685472,0.0024440775,0.00016737558,0.855862],"study_design_scores_gemma":[0.0029028798,0.0003668298,0.0055646,0.0011456226,0.00007792026,0.000269589,0.00025490744,0.9634903,0.022093827,0.0011213829,0.0012945635,0.0014175803],"about_ca_topic_score_codex":0.000032097218,"about_ca_topic_score_gemma":0.000021830365,"teacher_disagreement_score":0.91490614,"about_ca_system_score_codex":0.00022605144,"about_ca_system_score_gemma":0.00018172762,"threshold_uncertainty_score":0.999956},"labels":[],"label_agreement":null},{"id":"W4252369141","doi":"10.1002/9781119263081.oth4","title":"Bibliography","year":2018,"lang":"en","type":"other","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mechatronics; Citation; Library science; Computer science; Flatness (cosmology); Humanities; Philosophy; Physics; Artificial intelligence","score_opus":0.01185230789279846,"score_gpt":0.2347640126522238,"score_spread":0.22291170475942534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252369141","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.9734538e-8,0.00021685545,0.3971496,0.0000746943,0.0010496156,0.00014694502,0.000010261211,0.0010318827,0.60032016],"genre_scores_gemma":[0.00006426577,0.0002564183,0.014058094,0.00022302353,0.00059819483,0.000027882072,0.000013702623,0.00016711974,0.9845913],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987014,0.00004347039,0.00016606074,0.00048776416,0.00031517123,0.0002861552],"domain_scores_gemma":[0.99848676,0.000017082604,0.00015000539,0.0011993963,0.00004042032,0.00010634344],"candidate_categories":["bibliometrics","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00011644446,0.00022635613,0.0002527354,0.012423312,0.000023815563,0.000243818,0.001713584,0.00021632439,0.0032585661],"category_scores_gemma":[0.0000055679975,0.00018546513,0.00014829914,0.009455751,0.000042495296,0.00009053095,0.00020017223,0.00006103724,0.011364153],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.0076011e-7,0.000015124708,0.000087939894,0.000010649813,0.000058435693,0.000005872767,0.0000017667817,3.1401967e-8,0.0000043808705,0.007472766,0.991534,0.0008088346],"study_design_scores_gemma":[0.00019407517,0.000020168709,0.000046778994,0.00005219394,0.0000060263064,0.0000032262296,9.834981e-7,0.000655176,0.000010124437,0.00013836265,0.9986441,0.00022878942],"about_ca_topic_score_codex":0.00033435758,"about_ca_topic_score_gemma":0.000056152854,"teacher_disagreement_score":0.38427117,"about_ca_system_score_codex":0.000004044382,"about_ca_system_score_gemma":0.000017328337,"threshold_uncertainty_score":0.99877},"labels":[],"label_agreement":null},{"id":"W4252820767","doi":"10.1002/9781119263081.ch4","title":"Output‐feedback Solutions to Formation Control","year":2018,"lang":"en","type":"other","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Lyapunov function; Synchronization (alternating current); Controller (irrigation); Position (finance); Computer science; Nonlinear system; Bounded function; Solver; MATLAB; Passivity; Lyapunov stability; Filter (signal processing); Nonlinear control; Control engineering; Control (management); Mathematics; Engineering","score_opus":0.022852321050370227,"score_gpt":0.23747722878800395,"score_spread":0.21462490773763374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252820767","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.8683885e-7,0.000050772527,0.5614652,0.00080552784,0.0009860431,0.0006070977,0.000060138133,0.0006800842,0.43534493],"genre_scores_gemma":[0.007306951,0.0000037137072,0.011522997,0.0010648476,0.0007685561,0.00015722682,0.000048397313,0.00014550636,0.9789818],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9981093,0.00009206534,0.00036464614,0.0004893591,0.00041443456,0.0005301924],"domain_scores_gemma":[0.9982376,0.000037084217,0.00023653275,0.0011353209,0.00012984533,0.00022363245],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002740805,0.00030101964,0.00037951575,0.0003545611,0.00009273755,0.00028453246,0.0013874371,0.0002518736,0.0008200394],"category_scores_gemma":[0.000056489727,0.00026743909,0.00012828581,0.00032622504,0.000029005289,0.00027561502,0.00021483259,0.00008603629,0.028364182],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017451224,0.000025109179,0.0000037539169,0.0000166512,0.00004868381,0.0000018984168,0.000039877446,0.000012997075,0.000021015006,0.015189885,0.9808237,0.0038147033],"study_design_scores_gemma":[0.00077688973,0.000052102354,0.000038714676,0.00009534374,0.00001726612,0.000006729669,0.00000980885,0.04093852,0.000009749152,0.00008115866,0.95765316,0.00032052404],"about_ca_topic_score_codex":0.00023921742,"about_ca_topic_score_gemma":0.00031348542,"teacher_disagreement_score":0.54994226,"about_ca_system_score_codex":0.00012876354,"about_ca_system_score_gemma":0.00007006757,"threshold_uncertainty_score":0.99997777},"labels":[],"label_agreement":null},{"id":"W4254141912","doi":"10.1007/978-1-4419-1549-8_11","title":"Interconnection-Based Performance Analysis for a Class of Decentralized Controllers","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decentralised system; Controller (irrigation); Hierarchical control system; Interconnection; Block (permutation group theory); Computer science; Key (lock); Computation; Function (biology); Scale (ratio); Class (philosophy); Control system; Control engineering; Distributed computing; Control (management); Engineering; Mathematics; Algorithm","score_opus":0.03323385624167595,"score_gpt":0.2297142815336749,"score_spread":0.19648042529199894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254141912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000050590224,0.00014845982,0.8890984,0.00012660002,0.00056589424,0.001055583,0.0001318084,0.00017948846,0.10864316],"genre_scores_gemma":[0.874056,0.000042714822,0.0067861998,0.00027587614,0.00006521324,0.00018812831,0.00016088698,0.000051332456,0.118373685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748147,0.000038589737,0.00097644306,0.00071550277,0.00038698054,0.00040103262],"domain_scores_gemma":[0.9969082,0.00034513298,0.000872542,0.0011558202,0.0005618223,0.00015647382],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043781372,0.00045297775,0.0013044723,0.0007178734,0.000075894146,0.00008223685,0.0012906854,0.00033538105,0.00035639494],"category_scores_gemma":[0.00005055727,0.00040205318,0.0011846863,0.00020424364,0.00008111008,0.00021560793,0.000082265644,0.00016179186,0.000048867954],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00078540965,0.00018917189,0.0010098505,0.00045240016,0.012024245,0.000008554531,0.00024201398,0.004600407,0.00018018066,0.9592941,0.003500304,0.017713355],"study_design_scores_gemma":[0.0068463786,0.0004238024,0.0002109327,0.0002140854,0.0019059966,0.0000023288806,0.00000897796,0.8926332,0.00076091185,0.0018310167,0.0942498,0.00091257354],"about_ca_topic_score_codex":0.000094440176,"about_ca_topic_score_gemma":0.00013899192,"teacher_disagreement_score":0.9574631,"about_ca_system_score_codex":0.00016116264,"about_ca_system_score_gemma":0.00020734653,"threshold_uncertainty_score":0.9998431},"labels":[],"label_agreement":null},{"id":"W4254873127","doi":"10.24124/2019/59010","title":"Conan Veitch","year":2019,"lang":"en","type":"dissertation","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Northern British Columbia","funders":"","keywords":"Flocking (texture); Ergodicity; Robotics; Computer science; Artificial intelligence; Robot; Distributed computing; Mathematics","score_opus":0.009318041291590567,"score_gpt":0.24491810666968258,"score_spread":0.23560006537809203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254873127","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005847491,0.0009060948,0.24822836,0.00045052898,0.018981906,0.0017058766,0.0000618846,0.0012531156,0.72256476],"genre_scores_gemma":[0.6976421,0.00001036392,0.001401541,0.00023170852,0.00014449154,0.00007302558,0.0013297445,0.00003594382,0.2991311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825144,0.00004916966,0.00034727852,0.00058527855,0.0004496604,0.0003171866],"domain_scores_gemma":[0.99842316,0.00006717514,0.00022678489,0.001019799,0.00017419772,0.000088893525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00016240573,0.00026813117,0.00037558627,0.00012156482,0.000049364757,0.00029832358,0.0015834755,0.00027613257,0.00009546101],"category_scores_gemma":[0.000031749685,0.0002425783,0.00014853542,0.00021246895,0.000005386464,0.00027324547,0.00005554162,0.000204371,0.0038215497],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048200596,0.0002728397,0.0006731298,0.00071350834,0.000498075,0.00009441689,0.0022727568,0.00006205636,0.0070652757,0.76155317,0.08282766,0.1439189],"study_design_scores_gemma":[0.0072925272,0.00052420486,0.0275286,0.0010079041,0.00022043308,0.00005548754,0.0024394311,0.22093818,0.01647599,0.0034279502,0.71416086,0.005928442],"about_ca_topic_score_codex":0.00012604811,"about_ca_topic_score_gemma":0.00005119891,"teacher_disagreement_score":0.75812525,"about_ca_system_score_codex":0.00006654529,"about_ca_system_score_gemma":0.00020971983,"threshold_uncertainty_score":0.9969541},"labels":[],"label_agreement":null},{"id":"W4255418999","doi":"10.1007/978-1-4419-1549-8_8","title":"Decentralized Implementation of Centralized Controllers for Interconnected Systems","year":2011,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Decentralised system; Distributed computing; Context (archaeology); Controller (irrigation); Computer science; Control engineering; Set (abstract data type); Homogeneous; Computation; Control system; Control (management); Engineering; Mathematics","score_opus":0.036595216552154294,"score_gpt":0.2710840706287833,"score_spread":0.234488854076629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255418999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003057471,0.0010021814,0.9151365,0.00015406164,0.0029695241,0.005802398,0.00078063254,0.00042875635,0.07369535],"genre_scores_gemma":[0.6479801,0.0006229516,0.01505039,0.000395947,0.00048022877,0.001460731,0.0019612531,0.00039032986,0.33165807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963378,0.00009251698,0.0016421427,0.00079934765,0.000491451,0.00063676125],"domain_scores_gemma":[0.9963311,0.0002817314,0.0014350433,0.0010393439,0.00068767706,0.00022512232],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048551336,0.00059789896,0.0013897124,0.0003085137,0.00007152893,0.00017180518,0.0014378955,0.00037959736,0.00045649055],"category_scores_gemma":[0.00004116531,0.00054563925,0.0006065323,0.000067351655,0.00006259772,0.0003422015,0.00015162663,0.00014866046,0.000058114827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014060675,0.000030646566,0.000018849505,0.0002131072,0.00086163514,0.000005517174,0.0002551127,0.0000105283925,0.00043496545,0.985883,0.006961714,0.0051842923],"study_design_scores_gemma":[0.06535232,0.0014220611,0.00016485534,0.001630845,0.0014115374,0.00006378028,0.0005977485,0.03682382,0.0042321263,0.030106112,0.8542619,0.0039329035],"about_ca_topic_score_codex":0.0006098776,"about_ca_topic_score_gemma":0.00012543339,"teacher_disagreement_score":0.95577693,"about_ca_system_score_codex":0.0002362872,"about_ca_system_score_gemma":0.00024060857,"threshold_uncertainty_score":0.99969953},"labels":[],"label_agreement":null},{"id":"W4280503329","doi":"10.1049/cth2.12255","title":"Minimal‐time complex consensus for multi‐agent systems with time delay","year":2022,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Control theory (sociology); Multi-agent system; Computer science; Consensus; Control (management); Artificial intelligence","score_opus":0.019888856192681447,"score_gpt":0.24903938310277388,"score_spread":0.22915052691009244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280503329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015397343,0.0005633669,0.9909244,0.0007542205,0.000081483166,0.0038215688,0.001416891,0.00029968238,0.00059861806],"genre_scores_gemma":[0.98402286,0.0000014586822,0.0045470493,0.00048055968,0.00010726461,0.008516656,0.000119615885,0.000027506725,0.0021770569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784034,0.0005054898,0.00040673825,0.00060313626,0.0002536523,0.00039063644],"domain_scores_gemma":[0.9976273,0.0010517855,0.00026268314,0.0007284367,0.00015862037,0.00017117882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012567817,0.00023581453,0.00039690486,0.00008278423,0.0008626605,0.00019912777,0.000759693,0.00004618806,0.00003924064],"category_scores_gemma":[0.000032100983,0.00021328684,0.000092929135,0.00025640038,0.00012644938,0.00008924687,0.00013384478,0.00013093503,0.000096183256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006023194,0.0005766925,0.00008059916,0.00006557197,0.00048374373,0.000016588861,0.00034219783,0.008524909,0.017100994,0.9602186,0.005133532,0.0068542156],"study_design_scores_gemma":[0.0062769298,0.0002776651,0.00019755041,0.000012775239,0.0001196493,0.00017679851,0.00024567364,0.7899611,0.000030178568,0.0017821663,0.20047946,0.00044007742],"about_ca_topic_score_codex":0.000011462649,"about_ca_topic_score_gemma":9.25509e-7,"teacher_disagreement_score":0.98637736,"about_ca_system_score_codex":0.00007457993,"about_ca_system_score_gemma":0.00008037305,"threshold_uncertainty_score":0.8697585},"labels":[],"label_agreement":null},{"id":"W4280551875","doi":"10.1109/syscon53536.2022.9773824","title":"Influence of Network Topology on UAVs Formation Control based on Distributed Consensus","year":2022,"lang":"en","type":"article","venue":"2022 IEEE International Systems Conference (SysCon)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Network topology; Topology (electrical circuits); Distributed computing; Trajectory; Task (project management); Consensus; Telecommunications network; MATLAB; Logical topology; Multi-agent system; Computer network; Artificial intelligence; Engineering","score_opus":0.020188128653279878,"score_gpt":0.25256532540418886,"score_spread":0.23237719675090898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280551875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27942348,0.00009135543,0.6951712,0.005072549,0.010185067,0.0023907877,0.0034033614,0.00042070192,0.0038415277],"genre_scores_gemma":[0.9978414,0.0000022287827,0.00008398333,0.00070394273,0.00021608261,0.00059365545,0.00027961415,0.000018875511,0.00026021834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9949419,0.0009954785,0.0012105341,0.0007864277,0.0015147466,0.00055092026],"domain_scores_gemma":[0.9959816,0.0009174756,0.0011504766,0.0011387436,0.0006553662,0.00015635602],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013911426,0.00036537883,0.0006351559,0.0003259327,0.0003221284,0.00020608093,0.00228056,0.00011978125,0.00012846716],"category_scores_gemma":[0.00032669413,0.00037694618,0.00018500707,0.0005248921,0.00011032998,0.00031145883,0.0001902242,0.00047410975,0.000096998876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024638305,0.00018445692,0.0015840684,0.0000357586,0.00012564797,0.00005611698,0.00009985845,0.85421187,0.0016738245,0.13777657,0.0035089948,0.00049643335],"study_design_scores_gemma":[0.0029807978,0.00060171576,0.0029713197,0.00017571366,0.00001998254,0.00006273144,0.00015111084,0.98157173,0.00040055029,0.00037255004,0.010309416,0.00038236115],"about_ca_topic_score_codex":0.0003828353,"about_ca_topic_score_gemma":0.000027335274,"teacher_disagreement_score":0.71841794,"about_ca_system_score_codex":0.00064099306,"about_ca_system_score_gemma":0.00031370771,"threshold_uncertainty_score":0.9998683},"labels":[],"label_agreement":null},{"id":"W4280582195","doi":"10.21203/rs.3.rs-1595006/v1","title":"Predefined-time stability for a class of dynamical systems and its application on the consensus control for nonlinear multi-agent systems","year":2022,"lang":"en","type":"preprint","venue":"Research Square","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Nonlinear system; Class (philosophy); Multi-agent system; Stability (learning theory); Control theory (sociology); Control (management); Computer science; Consensus; Artificial intelligence; Machine learning; Physics","score_opus":0.0902227529326887,"score_gpt":0.3646822461384377,"score_spread":0.274459493205749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280582195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048059516,0.004094625,0.8321432,0.0043133395,0.0015083159,0.072478056,0.036846686,0.0003834038,0.00017285942],"genre_scores_gemma":[0.9727009,0.000018975932,0.00065128336,0.000015953672,0.00019306387,0.02555051,0.0005539209,0.0000583422,0.00025704235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991529,0.0027192887,0.0012896241,0.001655233,0.0018374173,0.000969471],"domain_scores_gemma":[0.9858287,0.008437022,0.00073333975,0.0024068858,0.0023131552,0.00028089705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009902756,0.00047956264,0.001136198,0.00030976694,0.000569822,0.000504691,0.0023257746,0.0004171285,0.0000070627184],"category_scores_gemma":[0.002634613,0.00037583816,0.00037996756,0.00042486942,0.00020634117,0.00006680117,0.0013353166,0.001032985,0.000015379585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058291377,0.006988589,0.002000594,0.070618525,0.0039225863,0.000043052274,0.0031357626,0.24085979,0.03431299,0.61730313,0.010545679,0.0044401563],"study_design_scores_gemma":[0.002739502,0.0005809931,0.00020222348,0.00042900964,0.000043845357,0.000005257752,0.00046552753,0.98969406,0.00011463107,0.00013194502,0.0052789245,0.0003140946],"about_ca_topic_score_codex":0.00035109193,"about_ca_topic_score_gemma":0.000018244815,"teacher_disagreement_score":0.9246414,"about_ca_system_score_codex":0.0009506386,"about_ca_system_score_gemma":0.0007347538,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null},{"id":"W4280602588","doi":"10.1038/s41467-022-30552-9","title":"Author Correction: Transition from simple to complex contagion in collective decision-making","year":2022,"lang":"en","type":"erratum","venue":"Nature Communications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Simple (philosophy); Transition (genetics); Computer science; Epistemology; Chemistry; Philosophy","score_opus":0.03311028663350525,"score_gpt":0.33293052450645383,"score_spread":0.2998202378729486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280602588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013134397,0.0125886435,0.79743147,0.030307889,0.10588813,0.005687176,0.0059070885,0.0012848179,0.04077343],"genre_scores_gemma":[0.943434,0.00017422519,0.029064449,0.0038291628,0.0007422197,0.0016875273,0.011276735,0.00011305752,0.009678617],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9955847,0.0011517679,0.00090594037,0.0009935366,0.00089998625,0.00046405618],"domain_scores_gemma":[0.9915289,0.0024967052,0.00048653944,0.004853964,0.00047004773,0.00016380928],"candidate_categories":["metaepi_narrow","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0006918669,0.00046757786,0.0007794662,0.00083340704,0.0010180288,0.0004189399,0.006578312,0.0009924029,0.00020583389],"category_scores_gemma":[0.00094155734,0.00055033877,0.0002585096,0.002933699,0.00006184,0.00039131404,0.0016509873,0.0047992943,0.00005900647],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041734573,0.00021365703,0.00005285313,0.0000061071432,0.00007574879,0.000014035816,0.0021878132,0.0006698921,0.000028860188,0.0017917485,0.9859138,0.009003715],"study_design_scores_gemma":[0.0005408832,0.00007149101,0.007488902,0.00032139075,0.0000395032,0.000013258116,0.00037253683,0.15330826,0.000001618037,0.0019278758,0.8354131,0.00050115876],"about_ca_topic_score_codex":0.0008151366,"about_ca_topic_score_gemma":0.014393214,"teacher_disagreement_score":0.9433027,"about_ca_system_score_codex":0.002378505,"about_ca_system_score_gemma":0.0008293822,"threshold_uncertainty_score":0.9996948},"labels":[],"label_agreement":null},{"id":"W4283008758","doi":"10.1177/10775463221105931","title":"Practical finite-time consensus of multi-agent systems with unknown nonlinear dynamics and the asymmetric input dead zone","year":2022,"lang":"en","type":"article","venue":"Journal of Vibration and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Nonlinear system; Control theory (sociology); Dead zone; Multi-agent system; Computer science; Imperfect; Position (finance); Artificial neural network; Protocol (science); Consensus; Adaptive control; Topology (electrical circuits); Mathematics; Control (management); Artificial intelligence","score_opus":0.012952246931921124,"score_gpt":0.2423345890873257,"score_spread":0.22938234215540457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283008758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010896966,0.0009477465,0.9809724,0.0062088617,0.00031509617,0.00053579063,0.00004186887,0.000016103662,0.00006518523],"genre_scores_gemma":[0.9936655,0.00002263748,0.005845429,0.00026431752,0.00006752984,0.00001774765,0.0000036698245,0.000008509938,0.000104663224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975463,0.0007640787,0.00074042537,0.00017576099,0.0006031968,0.0001701979],"domain_scores_gemma":[0.99686706,0.0012932956,0.0011188455,0.00023018412,0.00036838814,0.00012224943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016547185,0.00014301087,0.0004918683,0.00021211393,0.00020768578,0.00021751835,0.00027957984,0.00004426894,0.0000040367877],"category_scores_gemma":[0.00038945366,0.00009223754,0.00007719043,0.00040686244,0.00011813941,0.0002483965,0.0000899096,0.00030837677,0.0000015394321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020799302,0.0065018553,0.016539901,0.00074957503,0.0077737425,0.002092469,0.00727979,0.39222723,0.013204283,0.4438988,0.004516989,0.08441606],"study_design_scores_gemma":[0.011686772,0.0005497978,0.00055280083,0.000025852994,0.00010580913,0.00073000265,0.0002943934,0.9851365,0.000028326976,0.000014358045,0.00077249296,0.00010286225],"about_ca_topic_score_codex":0.00003360707,"about_ca_topic_score_gemma":0.000009566536,"teacher_disagreement_score":0.98276854,"about_ca_system_score_codex":0.00007507005,"about_ca_system_score_gemma":0.00022191806,"threshold_uncertainty_score":0.37613377},"labels":[],"label_agreement":null},{"id":"W4283026787","doi":"10.1007/s41315-022-00245-z","title":"Proximal policy optimization for formation navigation and obstacle avoidance","year":2022,"lang":"en","type":"article","venue":"International Journal of Intelligent Robotics and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Reinforcement learning; Centroid; Obstacle avoidance; Computer science; Function (biology); Bearing (navigation); Order (exchange); Obstacle; Control (management); Artificial intelligence; State (computer science); State information; Holonomic; Algorithm; Robot; Mobile robot; Political science; Economics; Law","score_opus":0.015832247824039334,"score_gpt":0.2791423078751722,"score_spread":0.26331006005113283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283026787","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011228274,0.00027208414,0.99346954,0.0043687113,0.00023492891,0.00042206116,0.000046811445,0.000016606702,0.00004644367],"genre_scores_gemma":[0.9163004,0.00012671719,0.082776755,0.00019905345,0.00028987287,0.00017870676,0.00006645959,0.000008615485,0.000053423697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891514,0.000035015055,0.0004641,0.00013957957,0.00034120757,0.00010494314],"domain_scores_gemma":[0.9986639,0.00009894742,0.00048666453,0.00011481538,0.00056722097,0.000068440546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033625498,0.00008316721,0.000111311754,0.00019409401,0.00021077257,0.000204374,0.00048360386,0.000022236285,0.0000033312172],"category_scores_gemma":[0.000050978535,0.00008420134,0.0000526368,0.00017442534,0.000024737516,0.0004637404,0.00014749503,0.00010676406,7.3740705e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023938182,0.00012736554,0.00013074107,0.000018082765,0.00005781465,0.0000017301284,0.00036796782,0.6278437,0.00052928145,0.311193,0.0001826333,0.059523787],"study_design_scores_gemma":[0.0005306371,0.0001186522,0.00011707925,0.000023943332,0.000015063782,0.00029363358,0.00023179814,0.9732931,0.00064466463,0.0075779837,0.017041242,0.00011217424],"about_ca_topic_score_codex":0.0000072601597,"about_ca_topic_score_gemma":4.7655283e-7,"teacher_disagreement_score":0.9151776,"about_ca_system_score_codex":0.00017877303,"about_ca_system_score_gemma":0.0000793876,"threshold_uncertainty_score":0.3433631},"labels":[],"label_agreement":null},{"id":"W4283212685","doi":"10.1109/tiv.2022.3175647","title":"Consensus Formation Tracking for Multiple AUV Systems Using Distributed Bioinspired Sliding Mode Control","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Vehicles","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Robustness (evolution); Sliding mode control; Nonlinear system; Lyapunov function; Computer science; Bounded function; Control engineering; Lyapunov stability; Controller (irrigation); Consensus; Engineering; Multi-agent system; Artificial intelligence; Mathematics; Control (management)","score_opus":0.058074053649909835,"score_gpt":0.27925863082409313,"score_spread":0.2211845771741833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283212685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06029922,0.00014236492,0.93170154,0.00026261248,0.0025876777,0.0020237826,0.0024572336,0.00051702803,0.000008540757],"genre_scores_gemma":[0.9968532,0.000005934284,0.0019844067,0.00009235057,0.00007222865,0.00084859284,0.0000618568,0.000042853582,0.00003860189],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99664664,0.0004089033,0.0009865032,0.0006416229,0.00064903963,0.00066726457],"domain_scores_gemma":[0.9976229,0.0008343762,0.0004345469,0.00064033136,0.00028766113,0.00018016263],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00071202964,0.0003694076,0.0004796334,0.00038638682,0.0014959166,0.00038107892,0.00082859513,0.000110910485,0.00000869854],"category_scores_gemma":[0.000038962124,0.00040462593,0.00035724312,0.00059453706,0.000041831856,0.00049239764,0.000009725483,0.0003487909,0.00001631698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023483927,0.0003043132,0.000045961464,0.00007788274,0.00014952666,0.000010989733,0.0005022073,0.94387007,0.046097107,0.0011422555,0.0001082657,0.0074566],"study_design_scores_gemma":[0.0018818339,0.00020929141,0.000012854469,0.00007139935,0.000080381076,0.00007585592,0.00080429413,0.9406274,0.05419577,0.0000673134,0.0015750886,0.00039853028],"about_ca_topic_score_codex":0.00032485215,"about_ca_topic_score_gemma":0.000037021902,"teacher_disagreement_score":0.93655396,"about_ca_system_score_codex":0.0009128661,"about_ca_system_score_gemma":0.000120487,"threshold_uncertainty_score":0.99984056},"labels":[],"label_agreement":null},{"id":"W4283655307","doi":"10.23890/ijast.vm03is01.0102","title":"A Leader-Follower Trajectory Tracking Controller for Multi-Quadrotor Formation Flight","year":2022,"lang":"en","type":"article","venue":"International Journal of Aviation Science and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Backstepping; Control theory (sociology); Trajectory; Lyapunov function; Controller (irrigation); Lyapunov stability; Displacement (psychology); Nonlinear system; Constant (computer programming); Tracking (education); Computer science; Control engineering; Nonlinear control; Control (management); Engineering; Adaptive control; Artificial intelligence; Physics","score_opus":0.035490599603479056,"score_gpt":0.3063417776234212,"score_spread":0.27085117801994213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283655307","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04861303,0.00017761985,0.9402797,0.008642586,0.0018040551,0.00036903343,0.0000180822,0.000058995658,0.000036849742],"genre_scores_gemma":[0.99128145,0.0000062182,0.008221614,0.00028268262,0.00007554734,0.0000707617,0.0000019137563,0.000004408068,0.000055425855],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979877,0.00004038643,0.00053657143,0.00021946697,0.0010097175,0.00020619734],"domain_scores_gemma":[0.9972329,0.000085481566,0.000686747,0.00013280577,0.0018063099,0.000055713164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017327963,0.00009333824,0.00018290695,0.0012107217,0.00028132903,0.00022487166,0.0015706896,0.000047868845,0.000007685761],"category_scores_gemma":[0.0005956516,0.000085404215,0.00007181533,0.0007043194,0.00013702778,0.0017006627,0.00017902355,0.0001881477,0.0000025502568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033994642,0.00086035905,0.0071786908,0.000024566845,0.00033543585,0.00010364471,0.0039902283,0.0013727994,0.38573882,0.2702211,0.0023805287,0.32745385],"study_design_scores_gemma":[0.018517576,0.0014762996,0.00831705,0.00008827665,0.00005709479,0.002396177,0.0032470764,0.82090497,0.038601734,0.012161837,0.09353478,0.00069714227],"about_ca_topic_score_codex":0.0000022870256,"about_ca_topic_score_gemma":0.0000026277958,"teacher_disagreement_score":0.9426684,"about_ca_system_score_codex":0.00037103271,"about_ca_system_score_gemma":0.0002577494,"threshold_uncertainty_score":0.34826827},"labels":[],"label_agreement":null},{"id":"W4285119239","doi":"10.1007/978-3-030-96087-2_6","title":"Rendezvous of Unicycles","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rendezvous; Control theory (sociology); Controller (irrigation); Stability (learning theory); Control engineering; Kinematics; Engineering; Computer science; Control (management); Artificial intelligence; Aerospace engineering; Physics","score_opus":0.013744297307788781,"score_gpt":0.22839167029534485,"score_spread":0.21464737298755607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285119239","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008182471,0.002909991,0.75135887,0.0030322473,0.00089923374,0.00081456325,0.0002062318,0.00012151655,0.24057555],"genre_scores_gemma":[0.996726,0.00024354507,0.0013502949,0.0011746803,0.00005074978,0.000029331317,0.000027561679,0.000006675999,0.0003911604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798095,0.000049693732,0.000732755,0.00027612044,0.00072103104,0.00023942867],"domain_scores_gemma":[0.9983138,0.0004994836,0.0006647171,0.00035462686,0.000109849265,0.000057509213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008985018,0.00023388385,0.00044336877,0.00053127896,0.000179102,0.00022509518,0.0010289027,0.00015884459,0.00007042897],"category_scores_gemma":[0.00023365527,0.00019278692,0.00008811602,0.00022893083,0.00023214359,0.0021819384,0.00020571388,0.00028658853,0.0000109791845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002076512,0.00001007915,0.00017992622,0.00007090043,0.000037385267,0.0000038142962,0.000878694,0.007414673,0.000041487387,0.6957349,0.0000722795,0.2955351],"study_design_scores_gemma":[0.0034119377,0.0006072736,0.0008935748,0.000277525,0.000046103003,0.00007082169,0.000042869135,0.2684803,0.000116301984,0.097595796,0.62740856,0.001048914],"about_ca_topic_score_codex":0.00012655223,"about_ca_topic_score_gemma":0.00006098013,"teacher_disagreement_score":0.9966442,"about_ca_system_score_codex":0.00006264885,"about_ca_system_score_gemma":0.00016613412,"threshold_uncertainty_score":0.7861622},"labels":[],"label_agreement":null},{"id":"W4285130772","doi":"10.1007/978-3-030-96087-2_8","title":"Unicycle Formations with Parallel and Circular Motions","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Geology; Geometry; Geodesy; Computer science; Geography; Mathematics","score_opus":0.01290412002848172,"score_gpt":0.21760895914459324,"score_spread":0.20470483911611154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285130772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007040477,0.0009584435,0.9463159,0.0034942667,0.00016363215,0.0006716969,0.00009581464,0.00009162498,0.048138205],"genre_scores_gemma":[0.99213135,0.0002929244,0.004970086,0.0021126473,0.000042960182,0.00011743418,0.00007094784,0.000009238217,0.00025240454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983122,0.000043263644,0.0005052265,0.0002934248,0.00057226093,0.00027365753],"domain_scores_gemma":[0.9988616,0.00024798294,0.0003761319,0.00031454416,0.0001064225,0.00009329589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005920181,0.00025690012,0.00033190058,0.0004720515,0.0005612493,0.0006319127,0.0005670399,0.00013053391,0.000037846225],"category_scores_gemma":[0.00009776096,0.00019987198,0.00004810911,0.00024758928,0.00024578135,0.00421769,0.00014495889,0.0003148751,0.000011941968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016762717,0.000016752801,0.00037651483,0.000091893344,0.00007532577,0.0000064264655,0.0021215961,0.055820975,0.000007496912,0.81318593,0.00007915392,0.12820119],"study_design_scores_gemma":[0.003332813,0.00039303466,0.0019146616,0.00015516099,0.000053072614,0.00016913681,0.000061231345,0.78423655,0.0000025306,0.041288026,0.16758001,0.0008137582],"about_ca_topic_score_codex":0.00007394326,"about_ca_topic_score_gemma":0.00006668039,"teacher_disagreement_score":0.99206096,"about_ca_system_score_codex":0.00006811361,"about_ca_system_score_gemma":0.00016628871,"threshold_uncertainty_score":0.8150543},"labels":[],"label_agreement":null},{"id":"W4285132317","doi":"10.1007/978-3-030-96087-2_1","title":"Introduction","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01057266458499677,"score_gpt":0.2189377693005068,"score_spread":0.20836510471551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285132317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001256614,0.0011076735,0.8594434,0.015879285,0.0019150159,0.000680408,0.00006441655,0.0001633642,0.120733835],"genre_scores_gemma":[0.97688764,0.0006860532,0.004909199,0.010463074,0.0017774054,0.00023057444,0.00021371226,0.000030768795,0.0048015714],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9979304,0.000051340106,0.00061797566,0.0003981385,0.00071517733,0.00028694817],"domain_scores_gemma":[0.9987295,0.00027845334,0.0004560186,0.00036395117,0.00010403381,0.00006798689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010506451,0.00026880068,0.00036697314,0.0005677096,0.00033185002,0.0005836444,0.00082409714,0.00016987888,0.00022836466],"category_scores_gemma":[0.00026305075,0.0002276616,0.00007673665,0.00024840506,0.00016670699,0.0039055992,0.00017337513,0.0004062819,0.00007079648],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001796798,0.000007688137,0.000056794895,0.000036836343,0.000027417444,0.0000032521723,0.00056176604,0.009052088,0.000021865302,0.70911765,0.00080764893,0.28028905],"study_design_scores_gemma":[0.00089123996,0.00015208873,0.00012880846,0.000027789249,0.0000118328835,0.000039427447,0.000007424976,0.11103419,0.000010418606,0.020847335,0.86648256,0.000366875],"about_ca_topic_score_codex":0.000053679418,"about_ca_topic_score_gemma":0.000024488148,"teacher_disagreement_score":0.97687507,"about_ca_system_score_codex":0.00012149392,"about_ca_system_score_gemma":0.00015196361,"threshold_uncertainty_score":0.9283771},"labels":[],"label_agreement":null},{"id":"W4285148990","doi":"10.1109/tro.2022.3175438","title":"Energy Autonomy for Robot Systems With Constrained Resources","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Robot; Resilience (materials science); Battery (electricity); Computer science; Mobile robot; Energy (signal processing); Work (physics); Autonomy; Control engineering; Key (lock); Relation (database); Simulation; Distributed computing; Engineering; Artificial intelligence; Power (physics); Computer security","score_opus":0.015887333098524553,"score_gpt":0.2117975281566986,"score_spread":0.19591019505817406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285148990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000080137754,0.00006445431,0.9956836,0.0008507421,0.001742345,0.00059481134,0.00017893458,0.00041327116,0.00039168703],"genre_scores_gemma":[0.97280884,0.0000017398775,0.02373967,0.00020892188,0.00006221018,0.00082741486,0.00001167086,0.00003377051,0.0023057694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979831,0.00017285942,0.0003968976,0.0005267468,0.00047369412,0.00044668786],"domain_scores_gemma":[0.9985518,0.00028284636,0.00018826744,0.0007046141,0.00012132347,0.00015117001],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002678353,0.00025221542,0.00033070747,0.00021274446,0.00074132415,0.00023907407,0.00086764526,0.000059646365,0.000014857283],"category_scores_gemma":[0.0000023150105,0.00024310364,0.00014347263,0.0004921199,0.00006566597,0.00020331619,0.0000060770117,0.00022097962,0.000007833701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004517989,0.00019388851,0.00000336277,0.00001971862,0.00012399572,0.000014502299,0.00022682473,0.98491895,0.00018001074,0.010525474,0.00020933384,0.0035387755],"study_design_scores_gemma":[0.0017713814,0.0006101404,0.0000067908136,0.000026227835,0.00006367141,0.00010883663,0.00032145815,0.98266196,0.0004302433,0.00005764179,0.013577731,0.0003639181],"about_ca_topic_score_codex":0.0001242814,"about_ca_topic_score_gemma":0.000026847289,"teacher_disagreement_score":0.97272867,"about_ca_system_score_codex":0.00032319818,"about_ca_system_score_gemma":0.00026833688,"threshold_uncertainty_score":0.99134785},"labels":[],"label_agreement":null},{"id":"W4285243778","doi":"10.1007/978-3-030-96087-2_5","title":"Rendezvous of Flying Robots","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rendezvous; Robot; Robotics; Computer science; Underactuation; Mobile robot; Artificial intelligence; Control engineering; Control theory (sociology); Engineering; Aerospace engineering; Control (management)","score_opus":0.016888477599317032,"score_gpt":0.23347728213280447,"score_spread":0.21658880453348744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285243778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000027962278,0.0015699876,0.8896074,0.0014553785,0.0007378394,0.0005562497,0.00007941374,0.000079257115,0.10588648],"genre_scores_gemma":[0.9957698,0.00016267388,0.002275118,0.0012665509,0.000064260516,0.000038563096,0.000026954813,0.00000771635,0.00038838005],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779725,0.000048870843,0.00078930636,0.00030264969,0.0007913075,0.00027060314],"domain_scores_gemma":[0.99826735,0.00048471644,0.0007228511,0.00034205263,0.000120781995,0.000062226405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010061079,0.00025057542,0.00047702182,0.00055702735,0.0002661686,0.00027553842,0.0009803707,0.00016527886,0.00006634194],"category_scores_gemma":[0.00026471275,0.0002100686,0.000094705196,0.00024966052,0.00018190278,0.0025030763,0.00020981288,0.00032054688,0.000011606341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025882542,0.00001205927,0.00021156963,0.00011100647,0.000049645332,0.0000061159876,0.0017092667,0.03287747,0.0000756796,0.47913405,0.000083533225,0.4857037],"study_design_scores_gemma":[0.003736891,0.00059947977,0.0007812736,0.00038427857,0.000050832477,0.00008988443,0.00004722541,0.7288755,0.00008630851,0.053050585,0.21113119,0.0011665433],"about_ca_topic_score_codex":0.000106009305,"about_ca_topic_score_gemma":0.000032161784,"teacher_disagreement_score":0.99574184,"about_ca_system_score_codex":0.00007444645,"about_ca_system_score_gemma":0.0001879125,"threshold_uncertainty_score":0.85663486},"labels":[],"label_agreement":null},{"id":"W4285258822","doi":"10.1007/978-3-030-96087-2_4","title":"Control Primitives","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Integrator; Control theory (sociology); Control (management); Kinematics; Double integrator; Construct (python library); Computer science; Mathematics; Control engineering; Engineering; Physics; Classical mechanics; Artificial intelligence; Programming language; Telecommunications","score_opus":0.012507611255034128,"score_gpt":0.22652484453481997,"score_spread":0.21401723327978583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285258822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021627264,0.0014513758,0.8395804,0.0045310864,0.0008516341,0.0010134662,0.0001987254,0.00016215596,0.15218951],"genre_scores_gemma":[0.99220634,0.00014774805,0.00089147885,0.0059005325,0.00012779777,0.0001084504,0.00003729652,0.000011307455,0.0005690283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724996,0.000093653536,0.0008206941,0.00047415541,0.00092989526,0.0004316553],"domain_scores_gemma":[0.99779505,0.0008995955,0.00064191816,0.0004051397,0.00014557184,0.0001127557],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012320688,0.00039532795,0.0005992004,0.0006249957,0.00042061528,0.0007539249,0.0012199803,0.000231227,0.0001378616],"category_scores_gemma":[0.00036579891,0.00032726393,0.00013109675,0.00023591773,0.0002942588,0.003985453,0.00018508916,0.00050465844,0.000053923726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043380107,0.000015033508,0.0002670774,0.000056014782,0.000073649404,0.000010824902,0.0008885737,0.007432533,0.000031005136,0.8033113,0.00014622994,0.18772437],"study_design_scores_gemma":[0.005681407,0.00049167365,0.0010901042,0.00016927681,0.000051050483,0.00007343595,0.000023730016,0.32534498,0.000023252958,0.03937611,0.62653846,0.0011365423],"about_ca_topic_score_codex":0.00007259468,"about_ca_topic_score_gemma":0.000029389761,"teacher_disagreement_score":0.99218476,"about_ca_system_score_codex":0.00012563213,"about_ca_system_score_gemma":0.00026773172,"threshold_uncertainty_score":0.9999179},"labels":[],"label_agreement":null},{"id":"W4285262332","doi":"10.1109/tie.2022.3174275","title":"Learning-Based Robust Bipartite Consensus Control for a Class of Multiagent Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bipartite graph; Class (philosophy); Computer science; Multi-agent system; Robust control; Control (management); Control system; Artificial intelligence; Theoretical computer science; Engineering","score_opus":0.03968367788049255,"score_gpt":0.24250994852204127,"score_spread":0.20282627064154873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285262332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060037836,0.00019952032,0.9870705,0.00077473785,0.0028521877,0.0022629448,0.00052809017,0.0002782534,0.000029965122],"genre_scores_gemma":[0.99779564,0.0000038027288,0.00021098003,0.000088746216,0.00010522353,0.0013816665,0.00001920868,0.000038487175,0.00035623484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626416,0.0007739821,0.0008514295,0.0006122437,0.000720283,0.0007779254],"domain_scores_gemma":[0.9974438,0.0009515159,0.0005386646,0.0006532578,0.0002460742,0.00016671345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011613026,0.000314966,0.0005887644,0.0003362165,0.0006557761,0.000116436684,0.0008407291,0.00020394998,0.00002488486],"category_scores_gemma":[0.00006469543,0.0003469558,0.00037064767,0.0008012868,0.00006455024,0.000096376,0.0000048179754,0.001072835,0.000008841877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00059292384,0.00042197917,0.000009125517,0.00002101269,0.00022042471,0.0000053519657,0.0000649728,0.9913358,0.0023049933,0.0011975743,0.00075497816,0.0030708571],"study_design_scores_gemma":[0.010801554,0.0023352194,0.0000013258641,0.000025905521,0.0001189386,0.000015387319,0.00011055812,0.9472598,0.00591787,0.000011766562,0.033085734,0.00031594402],"about_ca_topic_score_codex":0.00015711249,"about_ca_topic_score_gemma":0.000032649918,"teacher_disagreement_score":0.99179184,"about_ca_system_score_codex":0.00078123657,"about_ca_system_score_gemma":0.0010940346,"threshold_uncertainty_score":0.99989825},"labels":[],"label_agreement":null},{"id":"W4285282233","doi":"10.1007/978-3-030-96087-2_3","title":"Coordination Problems","year":2022,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.013804683975225383,"score_gpt":0.2231719374721584,"score_spread":0.20936725349693303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285282233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001662461,0.0011806787,0.8266183,0.005978027,0.00085044175,0.0010037348,0.00007519235,0.00015454345,0.16412243],"genre_scores_gemma":[0.9936025,0.00015817641,0.0011615227,0.0032211854,0.00011514832,0.00014641033,0.000081148195,0.0000114993045,0.0015024127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997846,0.0000523359,0.00066198554,0.00035685516,0.00078736775,0.00029546226],"domain_scores_gemma":[0.99857605,0.00037665188,0.0005442241,0.000298101,0.00013510833,0.00006989454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011408746,0.00027688447,0.0003711313,0.00058501074,0.0003463509,0.00066844973,0.0009019996,0.00018311248,0.00009066452],"category_scores_gemma":[0.00022019818,0.00023313251,0.00007550287,0.00026887722,0.00015411462,0.0040026517,0.00017841869,0.00036469832,0.000041016898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010882599,0.000011112126,0.00020618198,0.00008098253,0.00003071825,0.0000033244546,0.0009839335,0.016398989,0.000027562923,0.72664,0.0002409236,0.25536543],"study_design_scores_gemma":[0.0015564627,0.00021852484,0.00021643676,0.00009954182,0.000014309902,0.000029133987,0.0000084578105,0.46645933,0.0000076267856,0.04309948,0.48779017,0.0005005181],"about_ca_topic_score_codex":0.00009587248,"about_ca_topic_score_gemma":0.00005642484,"teacher_disagreement_score":0.9935859,"about_ca_system_score_codex":0.00012520826,"about_ca_system_score_gemma":0.0001715655,"threshold_uncertainty_score":0.95068675},"labels":[],"label_agreement":null},{"id":"W4285292987","doi":"10.1109/tie.2022.3176242","title":"Observer-Based Dynamic Event-Triggered Adaptive Control of Distributed Networked Systems With Application to Ground Vehicles","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Adaptive control; Control system; Vehicle dynamics; Control theory (sociology); Observer (physics); Control (management); Control engineering; Distributed computing; Engineering; Artificial intelligence; Automotive engineering","score_opus":0.01806276291127786,"score_gpt":0.22787868825741392,"score_spread":0.20981592534613605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285292987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019799996,0.00016541591,0.9747532,0.00050058577,0.0008418603,0.0026574468,0.0010168473,0.00025629957,0.000008338559],"genre_scores_gemma":[0.9978057,0.0000030856766,0.00018168199,0.000084642044,0.000060824903,0.0016782128,0.00008818715,0.000038634837,0.000059014907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960925,0.0006719078,0.0007883898,0.0007426404,0.0009634959,0.0007410401],"domain_scores_gemma":[0.99767554,0.00037779694,0.00052643206,0.00094704446,0.00025472688,0.00021845961],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00071962073,0.00037486193,0.0006106333,0.0002764415,0.0005309533,0.00012787821,0.0011790353,0.00018494313,0.000008698824],"category_scores_gemma":[0.000010972426,0.0003801962,0.00019795961,0.0020870948,0.00005143817,0.00024941794,0.000007699609,0.0008597187,0.000010102444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013941543,0.00047758737,0.000011452152,0.000009378728,0.00024974285,0.000005180755,0.000040124145,0.98549455,0.0022101412,0.0013103422,0.0001207961,0.008676571],"study_design_scores_gemma":[0.00709479,0.0026025951,0.000037605278,0.00004969536,0.00013903917,0.000010595036,0.00011012644,0.9854999,0.0016988837,0.00004690549,0.0022891553,0.00042071275],"about_ca_topic_score_codex":0.00044048572,"about_ca_topic_score_gemma":0.00014841469,"teacher_disagreement_score":0.9780057,"about_ca_system_score_codex":0.0016456177,"about_ca_system_score_gemma":0.00097463257,"threshold_uncertainty_score":0.999865},"labels":[],"label_agreement":null},{"id":"W4285726314","doi":"10.1007/s10846-022-01674-5","title":"A Visual Predictive Control Framework for Robust and Constrained Multi-Agent Formation Control","year":2022,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robustness (evolution); Model predictive control; Computer science; Control theory (sociology); Computer vision; Artificial intelligence; Visual servoing; Perspective (graphical); Control (management); Image (mathematics)","score_opus":0.029626335408576586,"score_gpt":0.2736443901314525,"score_spread":0.24401805472287588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285726314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00097558554,0.0024464037,0.98843557,0.0007017971,0.0048286817,0.0024057338,0.0001121101,0.00007602519,0.000018123026],"genre_scores_gemma":[0.9818017,0.000023934483,0.017106343,0.00023982312,0.00043114639,0.00029880533,0.000008351388,0.000029619796,0.000060267426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99529153,0.00075688417,0.0019481818,0.0004054152,0.0010251317,0.0005728752],"domain_scores_gemma":[0.99496424,0.0013652341,0.0021052863,0.00037964896,0.00083556323,0.00035002592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027647628,0.00036517673,0.0010207734,0.00040256325,0.000426834,0.00043943623,0.0009873578,0.00013367862,0.000013162955],"category_scores_gemma":[0.0006463615,0.00032135073,0.00038330647,0.0003460834,0.00007743926,0.0006938989,0.00013234958,0.0005195224,0.000007429759],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048023215,0.00053341646,0.0008017036,0.00019941818,0.00086860766,0.00008729865,0.0016925327,0.97386384,0.0005045173,0.017619384,0.000833452,0.0025155898],"study_design_scores_gemma":[0.005334852,0.0016063062,0.000252834,0.000272712,0.00018986811,0.0011531126,0.0029551175,0.9867018,0.000058538775,0.00023342171,0.0009462202,0.00029520498],"about_ca_topic_score_codex":0.00002504922,"about_ca_topic_score_gemma":0.0000017966706,"teacher_disagreement_score":0.98082614,"about_ca_system_score_codex":0.00065166247,"about_ca_system_score_gemma":0.0002468754,"threshold_uncertainty_score":0.9999239},"labels":[],"label_agreement":null},{"id":"W4286579125","doi":"10.1109/tcyb.2022.3186207","title":"Resilient Finite-Time Consensus Tracking for Nonholonomic High-Order Chained-Form Systems Against DoS Attacks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Nonholonomic system; Tracking (education); Order (exchange); Computer science; Control theory (sociology); Artificial intelligence; Mobile robot; Robot; Economics; Psychology; Control (management)","score_opus":0.01821887670518513,"score_gpt":0.23677012986801968,"score_spread":0.21855125316283455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286579125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037210487,0.000107875676,0.9536533,0.0008589702,0.0044852695,0.0018723148,0.0010524607,0.00045825858,0.00030109534],"genre_scores_gemma":[0.9932413,0.000009936704,0.0029104715,0.0002785134,0.00011816103,0.0008665871,0.000058010544,0.00006490456,0.0024520857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967734,0.00023999976,0.00082826236,0.00082410075,0.0006092132,0.0007249813],"domain_scores_gemma":[0.9972897,0.00082112255,0.00033181123,0.0011053557,0.00024312006,0.0002088551],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064705644,0.00040072866,0.0005053721,0.00032184584,0.0007990666,0.00029823463,0.0011216573,0.0001400809,0.00003168443],"category_scores_gemma":[0.00002673163,0.0004470911,0.0002542894,0.00060459506,0.00007558971,0.00014675308,0.000016761154,0.0004783998,0.00018961317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009520101,0.00043415013,0.0000063454313,0.00004995511,0.00016831905,0.000032132797,0.00054957083,0.9837678,0.0027371373,0.0015692048,0.0016453159,0.008944848],"study_design_scores_gemma":[0.0030548174,0.0005199962,0.00005601623,0.000051785093,0.00007583519,0.000042720083,0.00018110352,0.97291994,0.0021196394,0.00006564976,0.020293115,0.0006193559],"about_ca_topic_score_codex":0.00013603276,"about_ca_topic_score_gemma":0.00002770557,"teacher_disagreement_score":0.95603085,"about_ca_system_score_codex":0.0005797004,"about_ca_system_score_gemma":0.00020339963,"threshold_uncertainty_score":0.99979806},"labels":[],"label_agreement":null},{"id":"W4287020858","doi":"10.48550/arxiv.2108.11071","title":"Decentralized optimization with non-identical sampling in presence of\\n stragglers","year":2021,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristic; Weighting; Mathematical optimization; Estimator; Convergence (economics); Variance (accounting); Computer science; Variable (mathematics); Sampling (signal processing); Regular polygon; Mathematics; Statistics","score_opus":0.07233236711043145,"score_gpt":0.20169077258358545,"score_spread":0.129358405473154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287020858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32499793,0.00008213809,0.67308193,0.00004118735,0.00062264415,0.0008854385,0.00002677046,0.00005488866,0.00020709493],"genre_scores_gemma":[0.98406404,0.00048012144,0.015120776,0.000016465992,0.0000363824,0.0000038440003,0.000081479746,0.000037875525,0.00015899306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99416804,0.00065978867,0.0011325807,0.0025274009,0.00045805916,0.0010541036],"domain_scores_gemma":[0.9950393,0.00044997453,0.0011438851,0.002058448,0.0008485167,0.0004599003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007611225,0.00074401527,0.0012608968,0.0005637932,0.00016929026,0.0005102152,0.0028968735,0.0005634355,0.00012755251],"category_scores_gemma":[0.0002460104,0.000895166,0.00037597673,0.0027724896,0.0003965843,0.0013650127,0.0016260978,0.0009214567,0.000016137054],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000282011,0.000473003,0.024276832,0.00032020346,0.00027394283,0.00092242926,0.0007988383,0.96550006,0.00020762185,0.0066770194,0.0000047517105,0.00026330803],"study_design_scores_gemma":[0.004054607,0.000107781416,0.00965789,0.0018841896,0.00021826843,0.000017538987,0.0010326431,0.9817912,0.00023708754,0.00017867114,0.000012889311,0.0008072159],"about_ca_topic_score_codex":0.001448053,"about_ca_topic_score_gemma":0.00053432886,"teacher_disagreement_score":0.65906614,"about_ca_system_score_codex":0.0006577643,"about_ca_system_score_gemma":0.0012034563,"threshold_uncertainty_score":0.9993499},"labels":[],"label_agreement":null},{"id":"W4287557386","doi":"10.48550/arxiv.2012.02838","title":"MinMax Mean-Field Team Approach for a Leader-Follower Network: A\\n Saddle-Point Strategy","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Saddle point; Minimax; Mean field theory; Saddle; Mathematics; Field (mathematics); Robustness (evolution); Mathematical optimization; Computer science; Control theory (sociology); Control (management); Physics; Geometry","score_opus":0.13342618601335202,"score_gpt":0.20716534075715656,"score_spread":0.07373915474380455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287557386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002302724,0.00045672007,0.95964164,0.00054769986,0.0031601894,0.005061586,0.0002679732,0.0006223043,0.027939145],"genre_scores_gemma":[0.9848947,0.00015566066,0.006883063,0.00070614764,0.0013813346,0.000052667576,0.00024710948,0.00013938121,0.00553997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9884521,0.0008306188,0.0015774487,0.005728518,0.00068770256,0.0027236238],"domain_scores_gemma":[0.99095494,0.0008857028,0.0017242366,0.0038924913,0.0011681976,0.0013744248],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0018835055,0.0019076678,0.002375343,0.00041107275,0.0008993324,0.0011221102,0.0074358755,0.0016590311,0.0001075998],"category_scores_gemma":[0.0003471187,0.0023119329,0.0021148473,0.0022178553,0.00034303262,0.0013867287,0.0036799351,0.002211233,0.0003517557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010259375,0.0008912156,0.0005400281,0.0010203201,0.0018486477,0.00035457296,0.0013286484,0.7993897,0.00012881595,0.15484573,0.035651464,0.002974901],"study_design_scores_gemma":[0.0048494525,0.0008952115,0.000088556684,0.00037686856,0.0007817036,0.00002630027,0.0017409043,0.969983,0.00012519489,0.008381013,0.010480846,0.0022709689],"about_ca_topic_score_codex":0.00054981094,"about_ca_topic_score_gemma":0.00013612714,"teacher_disagreement_score":0.9825919,"about_ca_system_score_codex":0.0012086988,"about_ca_system_score_gemma":0.0015882265,"threshold_uncertainty_score":0.9999148},"labels":[],"label_agreement":null},{"id":"W4287584939","doi":"10.48550/arxiv.2012.00239","title":"Optimal Distributed Control for Leader-Follower Networks: A Scalable\\n Design","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Optimal control; Mathematical optimization; State (computer science); Riccati equation; Computer science; Function (biology); Algebraic Riccati equation; Focus (optics); Scalability; Bellman equation; Control theory (sociology); Control (management); Mathematics","score_opus":0.0952777526811871,"score_gpt":0.1961559212913064,"score_spread":0.1008781686101193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287584939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001090376,0.00020350513,0.99184513,0.0008849829,0.0016279621,0.002706787,0.0006324577,0.00088183105,0.00012695511],"genre_scores_gemma":[0.9894549,0.00002817684,0.009000371,0.00030401364,0.00033767882,0.00003998073,0.00029216098,0.00005860769,0.00048408195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99526757,0.00049622223,0.000585638,0.002330362,0.00021850195,0.0011016765],"domain_scores_gemma":[0.9957919,0.000681611,0.00065903127,0.0018186433,0.0004670224,0.00058177736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066824706,0.00078918785,0.001122723,0.00019932137,0.00030945367,0.0005358961,0.004043783,0.00068517245,0.000017979824],"category_scores_gemma":[0.00023605791,0.00091719924,0.0007627069,0.0009152404,0.00014616188,0.0005602363,0.0013161628,0.0008247685,0.00011873055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031272386,0.00013337441,0.00025453587,0.00008778446,0.0005511074,0.00034726824,0.000061442595,0.961822,0.000045532317,0.028444333,0.0077648987,0.00017501866],"study_design_scores_gemma":[0.004330333,0.00017850607,0.00015316877,0.00013042739,0.00031639574,0.000005836425,0.00005303598,0.98855114,0.000039075276,0.0028016665,0.0025433186,0.00089710025],"about_ca_topic_score_codex":0.00006516093,"about_ca_topic_score_gemma":0.000007601304,"teacher_disagreement_score":0.9883646,"about_ca_system_score_codex":0.0005030434,"about_ca_system_score_gemma":0.0004667121,"threshold_uncertainty_score":0.99932784},"labels":[],"label_agreement":null},{"id":"W4287585121","doi":"10.48550/arxiv.2012.00260","title":"Near-Optimal Control Strategy in Leader-Follower Networks: A Case Study\\n for Linear Quadratic Mean-Field Teams","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Graph; Quadratic equation; State (computer science); Mathematics; Function (biology); Computer science; Convergence (economics); Optimal control; Control (management); Control theory (sociology); Theoretical computer science; Algorithm","score_opus":0.08730076364931984,"score_gpt":0.23010860562185653,"score_spread":0.1428078419725367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287585121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3117648,0.00020340041,0.6796647,0.0002954066,0.0013670665,0.0061675734,0.00010868439,0.00025375324,0.00017465017],"genre_scores_gemma":[0.9975167,0.000045494784,0.0006457566,0.0003690114,0.00053955003,0.000073479874,0.000042065556,0.000112765876,0.00065516174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9895126,0.0015304177,0.0019041728,0.004536047,0.00044418222,0.0020725783],"domain_scores_gemma":[0.9921502,0.001790042,0.0014025121,0.0029233154,0.0006991384,0.0010347754],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0017704993,0.001667395,0.0025563336,0.00047167542,0.00076989154,0.0011633897,0.004088239,0.0011662127,0.00006224356],"category_scores_gemma":[0.0003842344,0.0020111117,0.0011843322,0.0022819354,0.00029636465,0.0012988057,0.0016045113,0.0024708584,0.0001672057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011677671,0.0016124285,0.0054651233,0.00024570414,0.0010992063,0.04429753,0.003141288,0.93784624,0.00001371765,0.0036672917,0.00023985936,0.0012038123],"study_design_scores_gemma":[0.015595077,0.002459008,0.0001849689,0.00030681188,0.0008262245,0.00020994246,0.013376325,0.9647657,0.0000068437002,0.00028544807,0.0002591115,0.0017244964],"about_ca_topic_score_codex":0.0060633654,"about_ca_topic_score_gemma":0.0041951304,"teacher_disagreement_score":0.6857519,"about_ca_system_score_codex":0.00092069834,"about_ca_system_score_gemma":0.0015131513,"threshold_uncertainty_score":0.9998735},"labels":[],"label_agreement":null},{"id":"W4287882695","doi":"10.1109/isie51582.2022.9831670","title":"Formation Shaping Control for Multi-Agent Systems with Obstacle Avoidance and Dynamic Leader Selection","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 31st International Symposium on Industrial Electronics (ISIE)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Collision avoidance; Obstacle avoidance; Obstacle; Computer science; Mobile robot; Process (computing); Collision; Controller (irrigation); Control theory (sociology); Displacement (psychology); Robot; Trajectory; Control engineering; Control (management); Real-time computing; Artificial intelligence; Engineering","score_opus":0.041614744870765115,"score_gpt":0.2659374443167727,"score_spread":0.22432269944600758,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287882695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06336519,0.0004562823,0.92361265,0.003215031,0.0053232154,0.003101794,0.00044813124,0.00032331565,0.00015436143],"genre_scores_gemma":[0.99637544,0.000029625679,0.00036551885,0.000330026,0.0003977672,0.0016152479,0.00018681263,0.000047501402,0.00065207126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99625176,0.00034297482,0.0007263134,0.0008306212,0.0011074189,0.0007409172],"domain_scores_gemma":[0.99828124,0.0002781442,0.0006395587,0.0003634257,0.00029584297,0.00014177625],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011264366,0.00037436755,0.00040345074,0.00026419133,0.00080466695,0.0005576898,0.0010440291,0.00015538723,0.000019336541],"category_scores_gemma":[0.00007199899,0.00038508695,0.00013171708,0.0004915578,0.000031045445,0.00082031795,0.0001172725,0.0008035609,0.000012561116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0041321027,0.0017420781,0.0014276274,0.00016777981,0.0021016148,0.000058650032,0.0023951484,0.63129693,0.20686227,0.12672931,0.008294026,0.014792432],"study_design_scores_gemma":[0.008301726,0.0010778117,0.00003644213,0.00005437031,0.000047167614,0.00019190939,0.00021986863,0.96778804,0.0025997404,0.0000388866,0.019206664,0.00043734643],"about_ca_topic_score_codex":0.00009527238,"about_ca_topic_score_gemma":0.000057441535,"teacher_disagreement_score":0.9330102,"about_ca_system_score_codex":0.002780861,"about_ca_system_score_gemma":0.00027764842,"threshold_uncertainty_score":0.9998601},"labels":[],"label_agreement":null},{"id":"W4288062503","doi":"10.1109/tie.2022.3192673","title":"Event-Triggered Consensus Control for Multirobot Systems With Cooperative Localization","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Controller (irrigation); Consensus; Event (particle physics); Control theory (sociology); Computer science; Mobile robot; Transmission (telecommunications); Laplacian matrix; Robot; Eigenvalues and eigenvectors; Control (management); Multi-agent system; Artificial intelligence; Theoretical computer science","score_opus":0.027379704579544962,"score_gpt":0.2445655147585739,"score_spread":0.21718581017902894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4288062503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000869907,0.00017401805,0.9913897,0.0006911777,0.0024953207,0.0034291707,0.0006122707,0.0003071799,0.000031273117],"genre_scores_gemma":[0.9966618,0.0000057055177,0.0001852945,0.00018874537,0.00014906668,0.0021616432,0.000039200844,0.000043321288,0.00056525256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966152,0.00065101683,0.000638955,0.0006953243,0.00066713383,0.00073239405],"domain_scores_gemma":[0.99800795,0.0005479521,0.0003416728,0.0005995556,0.00033901405,0.00016383405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067254086,0.00035385715,0.00050682627,0.00023627665,0.0011446497,0.00024685962,0.00068495446,0.00018039442,0.000020141546],"category_scores_gemma":[0.000029040913,0.00033983277,0.00016378475,0.0009641309,0.00005918394,0.00019532227,0.0000038428984,0.000758799,0.00001127031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009185869,0.0003475466,0.0000047639637,0.000008744048,0.00030307003,0.00000878361,0.00011537147,0.9896855,0.00054973544,0.003553608,0.0012894089,0.0032149095],"study_design_scores_gemma":[0.01463496,0.0025386335,6.1619795e-7,0.000027696013,0.00012307265,0.000052616768,0.00019731419,0.9629518,0.0027151338,0.00003231092,0.016284818,0.00044106238],"about_ca_topic_score_codex":0.00013710673,"about_ca_topic_score_gemma":0.000063979394,"teacher_disagreement_score":0.99579185,"about_ca_system_score_codex":0.001071688,"about_ca_system_score_gemma":0.0011264858,"threshold_uncertainty_score":0.99990535},"labels":[],"label_agreement":null},{"id":"W4289829126","doi":"10.1109/med54222.2022.9837278","title":"Distributed Least-Squares over Directed Networks","year":2022,"lang":"en","type":"article","venue":"2022 30th Mediterranean Conference on Control and Automation (MED)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algebraic number; Computer science; Linear equation; Algebraic equation; System of linear equations; Linear system; Least-squares function approximation; Mathematics; Exponential growth; Mathematical optimization; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.018928573596814536,"score_gpt":0.24040938628221392,"score_spread":0.22148081268539938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4289829126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030942349,0.0011067414,0.93623096,0.016034033,0.006502394,0.0024532701,0.0016155336,0.0032297939,0.0018849219],"genre_scores_gemma":[0.99675375,0.000023408451,0.00012882426,0.0011855782,0.00030909246,0.0005267762,0.0006296239,0.000027213591,0.00041572738],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955466,0.0008348964,0.000755579,0.000935761,0.0012184384,0.00070874626],"domain_scores_gemma":[0.9976986,0.0004351434,0.00049149216,0.0008203026,0.0002105824,0.0003438826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008991587,0.00045600583,0.0006352021,0.00027525012,0.00078332284,0.00054640113,0.0011681515,0.00012422327,0.0008620458],"category_scores_gemma":[0.0001727338,0.0004365627,0.00015341128,0.0006309861,0.00010506996,0.00058422243,0.00032332598,0.00059704337,0.0000473227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011521493,0.001996761,0.0047654565,0.0002724184,0.0012994059,0.0007582377,0.005837401,0.033776607,0.013170863,0.194541,0.15638207,0.58604765],"study_design_scores_gemma":[0.004131428,0.00031743996,0.016421635,0.000044770208,0.000038396956,0.00003377492,0.00016981758,0.96178925,0.000017848513,0.00047140906,0.016087988,0.00047626888],"about_ca_topic_score_codex":0.00007278266,"about_ca_topic_score_gemma":0.00003106504,"teacher_disagreement_score":0.96581143,"about_ca_system_score_codex":0.0001875646,"about_ca_system_score_gemma":0.00017580716,"threshold_uncertainty_score":0.9998086},"labels":[],"label_agreement":null},{"id":"W4292072226","doi":"10.23919/ecc55457.2022.9838106","title":"Distributed Convex Optimization on the Nonnegative Orthant","year":2022,"lang":"en","type":"article","venue":"2022 European Control Conference (ECC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Orthant; Lipschitz continuity; Mathematical optimization; Convex function; Convex optimization; Regular polygon; Mathematics; Euclidean geometry; Optimization problem; Graph; Concave function; Computer science; Applied mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.021196967455432657,"score_gpt":0.20412487843519506,"score_spread":0.1829279109797624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292072226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024280802,0.00009833749,0.9664978,0.009903347,0.0012825773,0.0014462266,0.0009780525,0.00051680754,0.016848812],"genre_scores_gemma":[0.9955979,0.0000092484415,0.00025856297,0.0025968526,0.00013911258,0.00029055992,0.00022268042,0.00004408914,0.0008409874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9933507,0.0032118445,0.0006947712,0.00095885765,0.0010868426,0.0006969841],"domain_scores_gemma":[0.996607,0.00073099893,0.00056521664,0.0015229977,0.0003649432,0.00020886208],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0020319857,0.00043377207,0.0004855935,0.00014674875,0.0010991584,0.00061187265,0.0032095101,0.00003965474,0.0011341821],"category_scores_gemma":[0.00049168064,0.00034556756,0.00021036364,0.0008197469,0.00012966272,0.00036685783,0.0008333933,0.00073769793,0.00042593275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004288469,0.00082231226,0.0010069663,0.000025360623,0.0006708246,0.0008092891,0.002387293,0.39980626,0.0026634163,0.55164605,0.027707294,0.012026058],"study_design_scores_gemma":[0.0031701848,0.00045023914,0.0017869759,0.000026536081,0.000043530716,0.000027222113,0.0005766245,0.95188326,0.0000830053,0.00018243663,0.041224737,0.0005452577],"about_ca_topic_score_codex":0.000041207637,"about_ca_topic_score_gemma":0.0000075280914,"teacher_disagreement_score":0.99316984,"about_ca_system_score_codex":0.00024060639,"about_ca_system_score_gemma":0.00025894376,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W4292825650","doi":"10.1109/taes.2022.3201065","title":"Robust Distributed Sensor Fault Detection and Diagnosis Within Formation Control of Multiagent Systems","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"China Postdoctoral Science Foundation; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Fault detection and isolation; Observer (physics); Fault (geology); Estimator; Fault indicator; Multi-agent system; Control theory (sociology); Computer science; Fault tolerance; Stuck-at fault; Engineering; Control engineering; Distributed computing; Real-time computing; Control (management); Artificial intelligence; Mathematics; Actuator","score_opus":0.014015985088522736,"score_gpt":0.20370781170718857,"score_spread":0.18969182661866585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292825650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08297515,0.0016760766,0.91175246,0.00024345942,0.0013432902,0.0014857544,0.00033654278,0.00017768574,0.000009547345],"genre_scores_gemma":[0.9981838,0.0001472974,0.000041151066,0.000026191577,0.00003792365,0.0013947122,0.000011556153,0.000024433708,0.00013291821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704283,0.0005598478,0.00064875284,0.00056963484,0.0006074965,0.0005714228],"domain_scores_gemma":[0.99843615,0.00024333052,0.00050051836,0.0005091793,0.00014865707,0.00016215067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084170944,0.0003211544,0.0005399354,0.00023275419,0.00067611836,0.00024727394,0.00031865865,0.00011811015,0.0000030747728],"category_scores_gemma":[0.000012678125,0.0003202848,0.000113777736,0.0005681841,0.000052506504,0.0004235748,0.000008559564,0.00044065923,0.000004572147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000175408,0.0003325268,0.00014703786,0.0003012548,0.00033210637,0.00000940144,0.0010197515,0.97412485,0.019753303,0.001335444,0.0001353008,0.002333595],"study_design_scores_gemma":[0.0029508334,0.0008454355,0.00005959927,0.00008370168,0.000106290354,0.000264253,0.0017410344,0.9851912,0.006854231,0.0000050307535,0.0015470304,0.00035131947],"about_ca_topic_score_codex":0.00080541347,"about_ca_topic_score_gemma":0.0001639445,"teacher_disagreement_score":0.91520864,"about_ca_system_score_codex":0.00056481804,"about_ca_system_score_gemma":0.000083431565,"threshold_uncertainty_score":0.9999249},"labels":[],"label_agreement":null},{"id":"W4292939416","doi":"10.1007/s10514-022-10048-7","title":"Scalable multirobot planning for informed spatial sampling","year":2022,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Scalability; Robot; Sampling (signal processing); Software deployment; Distributed computing; Field (mathematics); Adaptive sampling; Range (aeronautics); Real-time computing; Artificial intelligence; Computer vision; Database","score_opus":0.048885151624193865,"score_gpt":0.29530688189343757,"score_spread":0.2464217302692437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292939416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038088872,0.00014189839,0.9914572,0.00048338322,0.0017185727,0.00092136697,0.00005983007,0.000521251,0.00088758854],"genre_scores_gemma":[0.93253076,6.1845907e-7,0.0650818,0.00043500972,0.00016844022,0.00077965274,0.00010979285,0.00003059258,0.00086331373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977159,0.00007173981,0.0005674504,0.0005552581,0.00038620576,0.0007034484],"domain_scores_gemma":[0.9984569,0.00034966652,0.00029452532,0.00067019596,0.0000797274,0.00014899929],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005275184,0.00023557589,0.00033475837,0.00016691137,0.00080444163,0.00027147672,0.0013771701,0.000060654325,0.000037797687],"category_scores_gemma":[0.00014496758,0.00026268783,0.00015362176,0.00031578678,0.000023464634,0.00045716183,0.0006512317,0.00021906375,0.000043735537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050482857,0.00016510564,0.00204325,0.000054961365,0.00009828997,0.00002523114,0.0018527866,0.9302304,0.0019302504,0.0069845873,0.0032433535,0.053321347],"study_design_scores_gemma":[0.0019829867,0.0001814843,0.00204481,0.000020218067,0.000014071665,0.000034998957,0.00012875233,0.92283577,0.00035864505,0.00031098607,0.07167648,0.00041081497],"about_ca_topic_score_codex":0.0003284607,"about_ca_topic_score_gemma":0.000021310838,"teacher_disagreement_score":0.9287219,"about_ca_system_score_codex":0.00044047917,"about_ca_system_score_gemma":0.0003497877,"threshold_uncertainty_score":0.99998254},"labels":[],"label_agreement":null},{"id":"W4294690636","doi":"10.23919/acc53348.2022.9867634","title":"A Modified Gradient Flow for Distributed Convex Optimization on Directed Networks","year":2022,"lang":"en","type":"article","venue":"2022 American Control Conference (ACC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lipschitz continuity; Convex function; Gradient descent; Mathematical optimization; Convex optimization; A priori and a posteriori; Regular polygon; Digraph; Function (biology); Computer science; Mathematics; Flow (mathematics); Combinatorics; Pure mathematics; Artificial intelligence; Artificial neural network","score_opus":0.016156486648480534,"score_gpt":0.23000757939656616,"score_spread":0.2138510927480856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294690636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010028139,0.00014100732,0.9894476,0.002662611,0.0014447105,0.0023208493,0.0016798163,0.0009170254,0.00038357126],"genre_scores_gemma":[0.9891838,0.000019068018,0.0046409173,0.0014940689,0.00015749349,0.0031628734,0.0010829822,0.0000499084,0.00020889346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99515134,0.0008117789,0.00080737885,0.0012825776,0.00087048695,0.0010764205],"domain_scores_gemma":[0.99629396,0.00076212897,0.000820958,0.0012733324,0.0004954744,0.00035412237],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077197026,0.00053734507,0.0010096639,0.00026696417,0.0008090478,0.0004382551,0.0020319487,0.000074950156,0.00017520551],"category_scores_gemma":[0.00034178412,0.00056409993,0.0003278333,0.0014638167,0.00017635875,0.0003260807,0.00035698753,0.0005217066,0.000013621735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046736663,0.0002900408,0.00020548693,0.000009037304,0.000181954,0.000024441879,0.00017491674,0.9517603,0.0001500262,0.022019299,0.0042468314,0.020470329],"study_design_scores_gemma":[0.0047884705,0.0009372915,0.0006021471,0.000015619444,0.000067219415,0.00001082842,0.00021070059,0.9858644,0.000011679317,0.00015161389,0.0067300033,0.0006100502],"about_ca_topic_score_codex":0.00027840675,"about_ca_topic_score_gemma":0.000026977346,"teacher_disagreement_score":0.988181,"about_ca_system_score_codex":0.0005580238,"about_ca_system_score_gemma":0.00035484685,"threshold_uncertainty_score":0.99968106},"labels":[],"label_agreement":null},{"id":"W4294691862","doi":"10.23919/acc53348.2022.9867544","title":"A Distributed Newton Algorithm for Optimal Resource Allocation in Multi-Agent Systems","year":2022,"lang":"en","type":"article","venue":"2022 American Control Conference (ACC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Robustness (evolution); Lagrange multiplier; Computer science; Resource allocation; Mathematical optimization; Newton's method; Multi-agent system; Distributed algorithm; Distributed computing; Resource management (computing); Resource (disambiguation); Optimal allocation; Mathematics; Artificial intelligence; Computer network","score_opus":0.025769480282850955,"score_gpt":0.2628941645902702,"score_spread":0.23712468430741926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294691862","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032263885,0.00039699618,0.9872892,0.002911435,0.0009011378,0.0030309933,0.0017682667,0.0003863056,0.00008928408],"genre_scores_gemma":[0.98587275,0.000010141589,0.007158173,0.0005391805,0.00012068464,0.004987103,0.0006374383,0.00005120968,0.00062332494],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942068,0.0010964932,0.0011294134,0.001386957,0.0010072105,0.0011731415],"domain_scores_gemma":[0.996556,0.0005362758,0.0009194203,0.0012938494,0.0003653287,0.0003291198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015694023,0.000533332,0.0010616651,0.0004143895,0.0005124796,0.00053901254,0.0025519428,0.000081304875,0.00004442619],"category_scores_gemma":[0.00024054015,0.00059088226,0.00026962132,0.0015388954,0.00016362955,0.00048002796,0.0005539782,0.0005678894,0.000027952521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010198428,0.003462086,0.005445327,0.00019371872,0.0011387817,0.00047702438,0.0043915403,0.31200674,0.011727066,0.057088412,0.02022399,0.5828255],"study_design_scores_gemma":[0.0056349565,0.0005263811,0.0016318184,0.000026397583,0.000040812785,0.000030415324,0.0024206478,0.9156515,0.000030263172,0.000017717386,0.07339313,0.0005959789],"about_ca_topic_score_codex":0.0023266962,"about_ca_topic_score_gemma":0.00009817618,"teacher_disagreement_score":0.98264635,"about_ca_system_score_codex":0.0010280382,"about_ca_system_score_gemma":0.00059531315,"threshold_uncertainty_score":0.99965423},"labels":[],"label_agreement":null},{"id":"W4294811301","doi":"10.1109/tac.2022.3204543","title":"On the Exact Convergence to Nash Equilibrium in Hypomonotone Regimes Under Full and Partial-Decision Information","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Lipschitz continuity; Convergence (economics); Monotone polygon; Monotonic function; Mathematical economics; Mathematical optimization; Best response; Solution concept; Computer science; Property (philosophy); Complete information; Mathematics; Applied mathematics; Economics; Pure mathematics; Mathematical analysis","score_opus":0.012572015732398922,"score_gpt":0.23293613832789198,"score_spread":0.22036412259549307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294811301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13884136,0.00001700289,0.8532376,0.0052917483,0.000885882,0.0013486872,0.00005634795,0.00021425093,0.00010709493],"genre_scores_gemma":[0.99667484,0.000002271132,0.00035155684,0.0020115084,0.0000112788075,0.0008547868,0.0000018742583,0.000010991004,0.00008090203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975439,0.00038791244,0.0006347613,0.00035414007,0.00070355984,0.00037576118],"domain_scores_gemma":[0.99753165,0.0013040553,0.00018270423,0.00078526535,0.000057496272,0.00013883607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093948276,0.00023272452,0.00031598657,0.00033342105,0.00032359824,0.00025239965,0.00073673006,0.000053133062,0.00017216665],"category_scores_gemma":[0.00006243478,0.00018997237,0.00009742824,0.0007043204,0.00003639732,0.0006668394,0.0000143779225,0.00026116375,0.00021042576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00056401745,0.00062457426,0.00002292191,0.000043459626,0.00017373878,0.000023741815,0.003725075,0.81288266,0.005209028,0.015398782,0.0024017328,0.15893027],"study_design_scores_gemma":[0.002344436,0.00037435893,0.00065304147,0.000049701455,0.000017819346,0.000021036243,0.00025410895,0.9941062,0.0006007783,0.00064527185,0.0007101801,0.00022308707],"about_ca_topic_score_codex":0.00007709299,"about_ca_topic_score_gemma":0.000020610027,"teacher_disagreement_score":0.85783345,"about_ca_system_score_codex":0.00024785326,"about_ca_system_score_gemma":0.000097630706,"threshold_uncertainty_score":0.77468485},"labels":[],"label_agreement":null},{"id":"W4295832165","doi":"10.1109/tmech.2022.3203439","title":"Decentralized Event-Triggered Cooperative Localization in Multirobot Systems Under Random Delays: With/Without Timestamps Mechanism","year":2022,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Bounded function; Covariance; Timestamp; Event (particle physics); Synchronization (alternating current); Mobile robot; Robot; Distributed computing; Control theory (sociology); Control (management); Real-time computing; Mathematics; Artificial intelligence; Computer network","score_opus":0.013859160810480541,"score_gpt":0.2374040014070268,"score_spread":0.22354484059654625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295832165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036315084,0.00039101345,0.9906998,0.00042865577,0.0017291666,0.0024593922,0.00019426976,0.00042617926,0.000040006278],"genre_scores_gemma":[0.9947665,0.00009635092,0.0030098762,0.00026705384,0.000024690391,0.0012871515,0.00007079121,0.00007105272,0.00040653383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947721,0.0012905253,0.0009416084,0.0010172918,0.001115069,0.0008634036],"domain_scores_gemma":[0.9979749,0.00024050489,0.00035784434,0.0009784648,0.00021057196,0.00023776447],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010409316,0.0005291072,0.00076592696,0.0005032281,0.00077872124,0.00030946446,0.0010423401,0.00017427641,0.00010921848],"category_scores_gemma":[0.000011956662,0.00050756824,0.00019126646,0.0014176785,0.00004749329,0.0006581562,0.000023754546,0.000747462,0.000075980606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004548982,0.00056965015,0.000009325319,0.00002574244,0.00017449418,0.00002975861,0.0005941867,0.9776022,0.0012615356,0.018358432,0.00006764639,0.0008521517],"study_design_scores_gemma":[0.013601202,0.0004868406,0.0000036746035,0.00009875762,0.000080871614,0.00005974909,0.000993396,0.9800471,0.002233586,0.00044587225,0.0013463511,0.000602578],"about_ca_topic_score_codex":0.0004218485,"about_ca_topic_score_gemma":0.00029345206,"teacher_disagreement_score":0.991135,"about_ca_system_score_codex":0.0014605602,"about_ca_system_score_gemma":0.0005743526,"threshold_uncertainty_score":0.9997376},"labels":[],"label_agreement":null},{"id":"W4295855124","doi":"10.23919/acc53348.2022.9867281","title":"Distance-Based Formation Control of Nonlinear Agents Over Planar Directed Graphs","year":2022,"lang":"en","type":"article","venue":"2022 American Control Conference (ACC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Double integrator; Nonlinear system; Control theory (sociology); Topology (electrical circuits); Controller (irrigation); Constraint (computer-aided design); Integrator; Multi-agent system; Planar; Mathematics; Riccati equation; Nonlinear control; Computer science; Mathematical optimization; Control (management); Mathematical analysis; Physics; Artificial intelligence; Combinatorics; Geometry; Partial differential equation","score_opus":0.014317097151487422,"score_gpt":0.23663183696911494,"score_spread":0.2223147398176275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295855124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025922725,0.00021313438,0.96657443,0.0014923587,0.00077918015,0.0015115797,0.0021116652,0.0005527443,0.0008421624],"genre_scores_gemma":[0.9962134,0.000009979255,0.0012429325,0.0015055562,0.000052524763,0.00060469407,0.00023804198,0.000033958062,0.000098943296],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948587,0.0009888485,0.0010796778,0.0008310397,0.0014306174,0.00081114256],"domain_scores_gemma":[0.996097,0.0004929794,0.0014340489,0.0012793657,0.00042389953,0.00027265472],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076243683,0.00047291725,0.0010958043,0.00042349676,0.00041573023,0.00020167643,0.0021749611,0.000058925125,0.00035645638],"category_scores_gemma":[0.00017133143,0.00048971985,0.00036471643,0.0015616596,0.0002590627,0.00064581557,0.00016671578,0.00046734847,0.000026813641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010021394,0.007961964,0.16936041,0.0007862797,0.00488817,0.0010645993,0.006779394,0.048800513,0.14565872,0.26486057,0.04213499,0.297683],"study_design_scores_gemma":[0.008578139,0.0006214964,0.012084549,0.00003241236,0.000096188705,0.000009434,0.0003330584,0.95828754,0.00024641267,0.00022714987,0.018888041,0.0005956034],"about_ca_topic_score_codex":0.0009499675,"about_ca_topic_score_gemma":0.00012479637,"teacher_disagreement_score":0.97029066,"about_ca_system_score_codex":0.00033245698,"about_ca_system_score_gemma":0.0004890747,"threshold_uncertainty_score":0.99975544},"labels":[],"label_agreement":null},{"id":"W4296184735","doi":"10.1007/978-981-19-4258-7_7","title":"Continuous Constrained Attitude Regulation on SO(3)","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Spacecraft; Observer (physics); Attitude control; Control theory (sociology); Angular velocity; Modal; Function (biology); Control (management); Controller (irrigation); SIGNAL (programming language); Computer science; Engineering; Control engineering; Physics; Aerospace engineering; Artificial intelligence","score_opus":0.018564173147895328,"score_gpt":0.2248861939576758,"score_spread":0.2063220208097805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296184735","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004127809,0.00011686622,0.10746012,0.0009812244,0.0013758644,0.0007713948,0.00010732509,0.00065792864,0.8885251],"genre_scores_gemma":[0.063548826,0.000013227525,0.0018592414,0.0009125192,0.00028213148,0.000066349974,0.00029902597,0.00006187354,0.9329568],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99720657,0.000060755418,0.0006010243,0.0008923636,0.0008846323,0.00035465363],"domain_scores_gemma":[0.99777156,0.00018035437,0.00045363407,0.0013187664,0.0001335562,0.0001421048],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036988483,0.0004545631,0.00058808096,0.00023427575,0.00023533935,0.00033836826,0.0012804257,0.00025524027,0.0030912075],"category_scores_gemma":[0.000032041527,0.00044855414,0.0002678595,0.0000615264,0.00009446116,0.00022656054,0.00034264455,0.0004231421,0.00100891],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009809035,0.000024401732,0.000005663107,0.000012305523,0.00008913138,0.00006653269,0.00003920527,0.00011552893,0.00004682413,0.97627157,0.011629823,0.0116892],"study_design_scores_gemma":[0.0010938917,0.00022243804,0.00012158566,0.000089302965,0.000036556587,0.000045368193,0.000005748417,0.007388499,0.000027170086,0.009441255,0.98083687,0.0006913],"about_ca_topic_score_codex":0.000039978924,"about_ca_topic_score_gemma":0.000016436454,"teacher_disagreement_score":0.96920705,"about_ca_system_score_codex":0.00029286055,"about_ca_system_score_gemma":0.00020473567,"threshold_uncertainty_score":0.9997966},"labels":[],"label_agreement":null},{"id":"W4296186953","doi":"10.1007/978-981-19-4258-7_2","title":"Literature Review","year":2022,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Spacecraft; Aerospace; Robotics; Automation; Aeronautics; Engineering; Artificial intelligence; Computer science; Aerospace engineering; Systems engineering; Operations research; Robot; Mechanical engineering","score_opus":0.018559997924227897,"score_gpt":0.23029786830169113,"score_spread":0.21173787037746322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296186953","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0563569e-9,0.17712373,0.016669208,0.002326149,0.0009601132,0.0005680545,0.000094838455,0.00035046382,0.8019074],"genre_scores_gemma":[0.0000077358445,0.036218997,0.001144015,0.0047281506,0.00016730918,0.00006458839,0.000255325,0.000034144083,0.95737976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978297,0.000046622274,0.00047596387,0.00072054437,0.00066907867,0.00025811145],"domain_scores_gemma":[0.9977291,0.00005612884,0.00028478447,0.0016743508,0.00013116164,0.00012445444],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033950637,0.00038258114,0.0005931396,0.00011900204,0.0000946303,0.00022950544,0.0021082049,0.00017346811,0.0035088707],"category_scores_gemma":[0.000023593957,0.00033122193,0.0003455637,0.00011186502,0.000015513035,0.00030962343,0.0006929622,0.0005927732,0.0010370958],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3080567e-7,0.0000048790052,1.2224301e-7,0.00050290755,0.000042690666,0.000192562,0.000011420696,4.6662979e-7,9.853964e-7,0.7928495,0.19488339,0.011510674],"study_design_scores_gemma":[0.00012315741,0.000026369415,6.1083017e-7,0.0034950553,0.000028108696,0.00010361776,2.0632295e-7,0.00018103297,5.4979034e-7,0.0030011237,0.9926867,0.00035350863],"about_ca_topic_score_codex":0.0000034925297,"about_ca_topic_score_gemma":0.0000017210893,"teacher_disagreement_score":0.7978033,"about_ca_system_score_codex":0.00013304445,"about_ca_system_score_gemma":0.00009599915,"threshold_uncertainty_score":0.999914},"labels":[],"label_agreement":null},{"id":"W4296911594","doi":"10.1109/adconip55568.2022.9894148","title":"A Distributed Convex Optimization Algorithm with Continuous-Time Communication","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Smoothness; Computer science; Convex function; Mathematical optimization; Convex optimization; Distributed algorithm; Regular polygon; Class (philosophy); Telecommunications network; Optimization problem; Algorithm; Mathematics; Distributed computing; Artificial intelligence; Computer network","score_opus":0.005246507658086871,"score_gpt":0.19030453488478014,"score_spread":0.18505802722669326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296911594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022863614,0.000079912585,0.9944314,0.0016128256,0.00010308046,0.000544164,0.00015135923,0.0005894219,0.002259221],"genre_scores_gemma":[0.6720115,0.000006881211,0.3217717,0.0007072138,0.000036127476,0.0006033694,0.0019476652,0.000036815632,0.0028787444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981213,0.0003647935,0.00031995086,0.00038346808,0.0005127044,0.00029777564],"domain_scores_gemma":[0.99826694,0.00011492784,0.0002283836,0.0010980992,0.00019233789,0.00009930208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047203386,0.00016865329,0.00025831012,0.00008541086,0.00046499862,0.00024764624,0.0014511525,0.000034827834,0.00036622692],"category_scores_gemma":[0.00002280236,0.00015431448,0.00005136087,0.0006560625,0.00004628813,0.00048410063,0.00055253005,0.00018164345,0.000071082206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012757238,0.0014337077,0.0017071324,0.000026782156,0.0005320073,0.00012499987,0.0014704401,0.8253831,0.0008205718,0.062809534,0.043529663,0.062034465],"study_design_scores_gemma":[0.0013469061,0.00014200642,0.00017834269,0.0000066648104,0.000012523426,0.00005260477,0.00015040871,0.98474765,0.00007766455,0.00006207996,0.012996649,0.00022648335],"about_ca_topic_score_codex":0.00012746366,"about_ca_topic_score_gemma":0.0000028276916,"teacher_disagreement_score":0.6726597,"about_ca_system_score_codex":0.00019029019,"about_ca_system_score_gemma":0.00009217515,"threshold_uncertainty_score":0.62927616},"labels":[],"label_agreement":null},{"id":"W4296928288","doi":"10.48550/arxiv.1602.04146","title":"Decoupled Dynamics Distributed Control for Strings of Nonlinear\\n Autonomous Agents","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Agence Universitaire de la Francophonie; Agence Nationale de la Recherche","keywords":"Nonlinear system; Decoupling (probability); Computer science; Bounded function; Control theory (sociology); Scalability; String (physics); Decentralised system; Position (finance); Topology (electrical circuits); Controller (irrigation); Multi-agent system; Collision; Trajectory; Distributed computing; Control (management); Control engineering; Mathematics; Engineering; Artificial intelligence","score_opus":0.04229650682567298,"score_gpt":0.1996865212452522,"score_spread":0.15739001441957923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296928288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062816136,0.000036976828,0.9282839,0.00019256926,0.0011048163,0.001519728,0.005516081,0.0003195437,0.00021030016],"genre_scores_gemma":[0.99728155,0.00002049034,0.0014446966,0.000040139945,0.00010402554,0.000012716641,0.00046189674,0.000037833543,0.0005966279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968046,0.00015190081,0.0006833423,0.0014524106,0.0001904828,0.00071727275],"domain_scores_gemma":[0.9955108,0.00044246353,0.0011473981,0.0019006088,0.0006969492,0.00030177916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048347315,0.0005583855,0.0009828293,0.0002998576,0.00014301842,0.0001329883,0.003355326,0.0005126469,0.000013822334],"category_scores_gemma":[0.00018898174,0.00057887955,0.0006282052,0.0004320766,0.00013877841,0.0003768817,0.0012077119,0.00034442765,0.000034407225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00091603794,0.0013953472,0.025272937,0.0013879419,0.0033616773,0.00054540357,0.00023507877,0.35425097,0.00060291984,0.604395,0.0021716435,0.005465099],"study_design_scores_gemma":[0.004832162,0.00009804621,0.0013811268,0.00020920587,0.00019962512,0.0000029653518,0.000022520468,0.98392665,0.00012034741,0.007857105,0.00076722156,0.0005830234],"about_ca_topic_score_codex":0.00013510474,"about_ca_topic_score_gemma":0.00007094608,"teacher_disagreement_score":0.9344654,"about_ca_system_score_codex":0.00092152634,"about_ca_system_score_gemma":0.0004916428,"threshold_uncertainty_score":0.9996663},"labels":[],"label_agreement":null},{"id":"W4298407679","doi":"10.48550/arxiv.1011.2235","title":"Multiscale Gossip for Efficient Decentralized Averaging in Wireless\\n Packet Networks","year":2010,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Gossip; Binary logarithm; Hierarchy; Computer science; De Bruijn sequence; Scaling; Network packet; Key (lock); Wireless network; Gossip protocol; Scale (ratio); Theoretical computer science; State (computer science); Distributed algorithm; Mathematics; Wireless; Discrete mathematics; Algorithm; Distributed computing; Computer network; Geography","score_opus":0.049827731463047656,"score_gpt":0.19642520102734656,"score_spread":0.14659746956429892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298407679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3691366,0.00013404897,0.62313586,0.00011411037,0.0041755657,0.0027178326,0.0001423791,0.0002215834,0.00022200336],"genre_scores_gemma":[0.9968678,0.00027876976,0.0013326053,0.00010199501,0.00030664654,0.000033571392,0.00016643587,0.00010102212,0.00081119826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906316,0.0008037508,0.0014200051,0.004199347,0.00035160617,0.0025936943],"domain_scores_gemma":[0.992774,0.0009908597,0.0014097661,0.0032388286,0.00063969084,0.0009468273],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":["metaepi_narrow","research_integrity"],"category_scores_codex":[0.0018776563,0.0014156128,0.001821117,0.000737512,0.00066453184,0.00082028477,0.00504517,0.0015901383,0.00007865845],"category_scores_gemma":[0.00020007629,0.0017666502,0.0011008363,0.0019094013,0.000450184,0.000584473,0.0025853436,0.002512661,0.00013270101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004681137,0.00082968996,0.0066200523,0.00024684297,0.00025477633,0.00056784,0.0007750748,0.9474497,0.00034504983,0.037473578,0.00014716032,0.004822137],"study_design_scores_gemma":[0.009497704,0.000082438004,0.0047846767,0.0007389569,0.00020957061,0.000013992385,0.00017554477,0.98057735,0.00018755568,0.00083057093,0.0012160798,0.001685544],"about_ca_topic_score_codex":0.00073717866,"about_ca_topic_score_gemma":0.0007550241,"teacher_disagreement_score":0.62773114,"about_ca_system_score_codex":0.0013002362,"about_ca_system_score_gemma":0.00059980556,"threshold_uncertainty_score":0.9998594},"labels":[],"label_agreement":null},{"id":"W4300342219","doi":"10.48550/arxiv.1610.01461","title":"Cooperative Output Regulation of Linear Multi-agent Systems with\\n Communication Constraints","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Computer science; Information exchange; Interconnection; Process (computing); Multi-agent system; Discrete time and continuous time; Distributed computing; Topology (electrical circuits); Control (management); Control theory (sociology); Mathematical optimization; Mathematics; Computer network; Telecommunications; Artificial intelligence","score_opus":0.08386988781110571,"score_gpt":0.2042176628754824,"score_spread":0.12034777506437669,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300342219","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031328056,0.00014565465,0.9651324,0.00009344655,0.0004953508,0.0011819118,0.00019523808,0.00022218213,0.00120572],"genre_scores_gemma":[0.99590856,0.00005432899,0.0021553386,0.000013369223,0.000041640596,0.000007630332,0.000092091934,0.000023222932,0.001703832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972722,0.00066163135,0.0005261365,0.0009863944,0.00021419357,0.000339472],"domain_scores_gemma":[0.9951927,0.00021500314,0.0010406387,0.0023668525,0.0010113071,0.00017349259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000521727,0.00040983458,0.0006385297,0.00026175752,0.00018525447,0.00011686545,0.0021469651,0.00034681213,0.000010953329],"category_scores_gemma":[0.00006534823,0.00036736336,0.00016310267,0.00041674144,0.00040668837,0.0004940775,0.0010825621,0.00036704852,0.000080712816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014106244,0.0004484081,0.00502768,0.0003777141,0.0008469034,0.00010318773,0.0011343849,0.66528517,0.0009898314,0.3243045,0.0003540033,0.0009871557],"study_design_scores_gemma":[0.0025569403,0.000091689806,0.002863901,0.0010856121,0.0001084791,0.000010394405,0.00025240463,0.99120104,0.00040307757,0.00053283706,0.00033169697,0.00056190917],"about_ca_topic_score_codex":0.00021528864,"about_ca_topic_score_gemma":0.00003514901,"teacher_disagreement_score":0.9645805,"about_ca_system_score_codex":0.00040530658,"about_ca_system_score_gemma":0.00035439464,"threshold_uncertainty_score":0.9998778},"labels":[],"label_agreement":null},{"id":"W4302024648","doi":"10.1155/2022/8385913","title":"Decentralized Adaptive Fault-Tolerant Cooperative Control for Multiple UAVs with Input Saturation and State Constraints","year":2022,"lang":"en","type":"article","venue":"International Journal of Aerospace Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Aeronautical Science Foundation of China; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Control theory (sociology); Actuator; Bounded function; Computer science; Observer (physics); Artificial neural network; Fuzzy logic; State observer; Fault tolerance; Control engineering; Engineering; Control (management); Mathematics; Nonlinear system; Artificial intelligence; Distributed computing","score_opus":0.0074948814663338545,"score_gpt":0.21211799312644763,"score_spread":0.2046231116601138,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4302024648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09400775,0.000121431935,0.90330404,0.0011580489,0.00089621404,0.0003443487,0.0001321508,0.00003141551,0.0000045965858],"genre_scores_gemma":[0.98114187,0.000009745213,0.018614536,0.000079450736,0.00007126334,0.000041829553,0.000007705698,0.000013091118,0.000020528623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863476,0.000059975457,0.00037193578,0.00018477546,0.0005448947,0.00020365482],"domain_scores_gemma":[0.99848896,0.00031391962,0.0003550906,0.000095487936,0.0006409542,0.0001056124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036029087,0.0001574883,0.00025667588,0.00013908332,0.00009016657,0.00020319934,0.00047599728,0.000021669452,0.0000055663672],"category_scores_gemma":[0.00014793414,0.00013826927,0.00006855085,0.000110762616,0.000031034175,0.00054306455,0.000070336064,0.00021939573,5.108978e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083145406,0.00008787809,0.001032502,0.000008998426,0.0007459158,0.00014351604,0.0020519344,0.97010946,0.01580729,0.005975297,0.00018614555,0.0030196172],"study_design_scores_gemma":[0.009992856,0.0005120348,0.001720617,0.00008319516,0.000023435834,0.00042270188,0.00044040786,0.9830151,0.0018663822,0.000029785519,0.0016632769,0.00023019043],"about_ca_topic_score_codex":0.000014057244,"about_ca_topic_score_gemma":0.0000057528127,"teacher_disagreement_score":0.8871341,"about_ca_system_score_codex":0.00024162914,"about_ca_system_score_gemma":0.000115902825,"threshold_uncertainty_score":0.5638457},"labels":[],"label_agreement":null},{"id":"W4303044269","doi":"10.1002/rnc.6381","title":"Leaderless output sign consensus of heterogeneous multi‐agent systems over signed graphs","year":2022,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"National Natural Science Foundation of China","keywords":"Adjacency matrix; Sign (mathematics); Multi-agent system; Control theory (sociology); Observer (physics); Computer science; Consensus; Graph; Controller (irrigation); Directed graph; Signed graph; Topology (electrical circuits); State (computer science); Network topology; Graph theory; Mathematics; Control (management); Theoretical computer science; Algorithm; Artificial intelligence; Combinatorics","score_opus":0.027968084054582433,"score_gpt":0.25395631531314716,"score_spread":0.22598823125856474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303044269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2432537,0.004666676,0.74191976,0.0019406264,0.0068725,0.00064832746,0.0005874428,0.00005522903,0.00005571583],"genre_scores_gemma":[0.9971548,0.000020801444,0.0022362138,0.00019927899,0.00024818428,0.000013732559,0.000007785186,0.000015678972,0.000103579754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969828,0.00038023136,0.0010220109,0.00026025766,0.0011077741,0.00024690223],"domain_scores_gemma":[0.997397,0.00032887253,0.0010905081,0.00024168869,0.00078665995,0.00015527966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009102444,0.00020457937,0.00051637803,0.0003635574,0.000109013396,0.00016600115,0.0012224372,0.000058025595,0.000019287329],"category_scores_gemma":[0.000106230065,0.00018635795,0.00027055288,0.0001506672,0.00007700972,0.00018007965,0.00019404922,0.000275055,0.0000026558002],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001786836,0.0017348967,0.009946854,0.00009587052,0.003802565,0.0027599707,0.0012674994,0.9395312,0.01820963,0.0044455174,0.0026482928,0.013770832],"study_design_scores_gemma":[0.010111454,0.00047453097,0.0010342817,0.000078690486,0.00007819841,0.001489083,0.00028957732,0.9809058,0.00024838472,0.000046744215,0.0049775164,0.00026575226],"about_ca_topic_score_codex":0.000078979334,"about_ca_topic_score_gemma":0.0000060910365,"teacher_disagreement_score":0.75390106,"about_ca_system_score_codex":0.00012974902,"about_ca_system_score_gemma":0.00016002114,"threshold_uncertainty_score":0.7599457},"labels":[],"label_agreement":null},{"id":"W4304694551","doi":"10.1162/artl_a_00390","title":"Adapting the Exploration–Exploitation Balance in Heterogeneous Swarms: Tracking Evasive Targets","year":2022,"lang":"en","type":"article","venue":"Artificial Life","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Scalability; Robustness (evolution); Swarm behaviour; Distributed computing; Flexibility (engineering); Robot; Artificial intelligence","score_opus":0.05391451266901266,"score_gpt":0.2619877827377134,"score_spread":0.20807327006870074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4304694551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3147271,0.0008320905,0.667573,0.0116052115,0.0029581643,0.0014429917,0.000044518038,0.000428375,0.00038860345],"genre_scores_gemma":[0.99814767,0.0000026593088,0.00048357766,0.00074764155,0.00018952882,0.00037519116,0.000018487995,0.000013396085,0.000021851447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977016,0.00047811476,0.000506013,0.0004093845,0.0005464726,0.0003584459],"domain_scores_gemma":[0.9988979,0.00026556276,0.00023811798,0.00044132484,0.00008620939,0.00007090157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095394644,0.00013980774,0.00017329217,0.00010127682,0.0005527909,0.0002447592,0.0008112128,0.000028188504,0.000022003676],"category_scores_gemma":[0.00035377432,0.00012960471,0.000072423994,0.0006089876,0.000024830353,0.0007276575,0.00022098921,0.0002228534,0.00007176572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011762309,0.00046563242,0.0034063219,0.000025115252,0.00008495184,0.00017233718,0.032690182,0.8280483,0.015963575,0.07060298,0.0017328794,0.046690114],"study_design_scores_gemma":[0.00057922595,0.00013588613,0.0014915686,0.000022727998,0.000009920229,0.000015567452,0.0050171125,0.97624844,0.004028933,0.006408528,0.005638641,0.00040346966],"about_ca_topic_score_codex":0.0001074798,"about_ca_topic_score_gemma":0.00013250698,"teacher_disagreement_score":0.6834206,"about_ca_system_score_codex":0.00015184763,"about_ca_system_score_gemma":0.00011452672,"threshold_uncertainty_score":0.5285127},"labels":[],"label_agreement":null},{"id":"W4307942636","doi":"10.3390/electronics11213545","title":"Adaptive Discontinuous Control for Fixed-Time Consensus of Nonlinear Multi-Agent Systems","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Nonlinear system; Adaptive control; Control theory (sociology); Multi-agent system; Computer science; Control (management); Dimension (graph theory); Consensus; Protocol (science); Control engineering; Distributed computing; Engineering; Mathematics; Artificial intelligence","score_opus":0.01518763172079787,"score_gpt":0.23557262057389347,"score_spread":0.2203849888530956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4307942636","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101997405,0.009431217,0.9734035,0.0005610858,0.0012467625,0.003193894,0.0014984171,0.00030036678,0.00016497477],"genre_scores_gemma":[0.99200225,0.000011475599,0.0054440335,0.00010180401,0.00011411386,0.00076027174,0.00007728643,0.000042721218,0.0014460552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669975,0.00042122422,0.00076741975,0.0006462233,0.0005905923,0.00087476434],"domain_scores_gemma":[0.99764186,0.00047743143,0.0006041351,0.00085813337,0.0002816897,0.00013674946],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010281267,0.0003065836,0.000703783,0.00014130425,0.0003181627,0.00009493476,0.001334464,0.00007626801,0.000012408121],"category_scores_gemma":[0.00012934915,0.00031338766,0.00029118458,0.00040050063,0.000058309175,0.00011299838,0.0002449904,0.00031477102,0.00002845687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030173967,0.006841523,0.0011870126,0.00062939996,0.0060051796,0.0003434132,0.00419018,0.4676743,0.15919754,0.26633742,0.050020896,0.034555744],"study_design_scores_gemma":[0.0049086437,0.00097641436,0.00003763438,0.000016046573,0.00006711986,0.000050615814,0.00017347702,0.93730503,0.00065956166,0.00007395195,0.055386383,0.00034511343],"about_ca_topic_score_codex":0.000054011074,"about_ca_topic_score_gemma":0.000017083792,"teacher_disagreement_score":0.9818025,"about_ca_system_score_codex":0.00050115504,"about_ca_system_score_gemma":0.0004984354,"threshold_uncertainty_score":0.9999318},"labels":[],"label_agreement":null},{"id":"W4308213901","doi":"10.1109/wisee49342.2022.9926901","title":"Consensus Control of Multi-Agent Systems With Uncertain Communication Links","year":2022,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Digraph; Asynchronous communication; Computer science; Controller (irrigation); Multi-agent system; Control (management); Control theory (sociology); Consensus; Distributed computing; Mathematics; Artificial intelligence; Computer network; Discrete mathematics","score_opus":0.027015055794214156,"score_gpt":0.24733895131872774,"score_spread":0.2203238955245136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308213901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00675539,0.0012983775,0.9866404,0.0015700909,0.00043705924,0.0013853854,0.00012489187,0.00030884673,0.0014795567],"genre_scores_gemma":[0.99247175,0.000003571129,0.0061573796,0.0002046836,0.00001308652,0.00031487792,0.000025544266,0.0000141406,0.0007949496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727243,0.0008173244,0.0005864824,0.00037816283,0.0006300795,0.0003155218],"domain_scores_gemma":[0.9972939,0.00036458045,0.00045664422,0.0015101361,0.00026487664,0.00010985752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010058662,0.00018871749,0.00040039976,0.00012357379,0.00028514033,0.000101184785,0.0016253052,0.00006893729,0.000026359035],"category_scores_gemma":[0.000043951615,0.00015896997,0.0000798023,0.0004549514,0.00008195306,0.000106909276,0.000343427,0.00034580517,0.000019497362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035619142,0.0018995377,0.016856143,0.0002523762,0.0010325107,0.00016812544,0.0029999833,0.6605874,0.007999971,0.29388517,0.0077397265,0.006222891],"study_design_scores_gemma":[0.00438456,0.00023821104,0.0007872649,0.000031889344,0.000026698266,0.000076947435,0.0009469886,0.9845468,0.00012139063,0.000023239252,0.008570803,0.00024519756],"about_ca_topic_score_codex":0.0013480467,"about_ca_topic_score_gemma":0.000043805492,"teacher_disagreement_score":0.9857164,"about_ca_system_score_codex":0.00019616351,"about_ca_system_score_gemma":0.00016845565,"threshold_uncertainty_score":0.6482607},"labels":[],"label_agreement":null},{"id":"W4308642527","doi":"10.1145/3548606.3563535","title":"Poster","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Drone; Spoofing attack; Swarm behaviour; Computer science; Crash; Exploit; Artificial intelligence; Computer security; Swarm robotics","score_opus":0.03253762696232373,"score_gpt":0.25563381874576857,"score_spread":0.22309619178344484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308642527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70524895,0.0031012301,0.02094435,0.1927213,0.004092242,0.006038298,0.00080995704,0.0014838225,0.065559864],"genre_scores_gemma":[0.996768,0.00004640031,0.0023215539,0.0005940142,0.000025514588,0.000141397,0.000007166186,0.000008769302,0.00008720855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840677,0.00011843595,0.0003684805,0.00038876804,0.00047916907,0.00023839992],"domain_scores_gemma":[0.9971772,0.00020656172,0.00032464173,0.0019126058,0.00030025112,0.00007873066],"candidate_categories":["open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.0005759521,0.0001834536,0.000257024,0.0001107926,0.0008081991,0.00025158984,0.00888887,0.000038587088,0.000031639596],"category_scores_gemma":[0.00006773006,0.00015692381,0.00011394886,0.00054339215,0.00015051168,0.00031254932,0.011508803,0.00053940073,0.00000526223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026709264,0.0005702726,0.0047799954,0.000059008213,0.000091161004,5.6187264e-7,0.0048210938,0.000012603902,0.0019416765,0.96566373,0.006067785,0.015965397],"study_design_scores_gemma":[0.003657974,0.0013325271,0.030875748,0.00025572095,0.00012362377,0.00021884682,0.0018852002,0.67664576,0.0027303188,0.2194912,0.06114452,0.0016385799],"about_ca_topic_score_codex":0.000038935672,"about_ca_topic_score_gemma":0.0000045017036,"teacher_disagreement_score":0.74617255,"about_ca_system_score_codex":0.000067922825,"about_ca_system_score_gemma":0.00007265338,"threshold_uncertainty_score":0.99648595},"labels":[],"label_agreement":null},{"id":"W4310588863","doi":"10.1109/tcyb.2022.3222459","title":"Distributed Event-Triggered Quantized Fault-Tolerant Control of Linear Multiagent Systems With External Disturbances and Parameter Uncertainties","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qinglan Project of Jiangsu Province of China; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; State Key Laboratory of Mechanics and Control of Mechanical Structures; National Natural Science Foundation of China","keywords":"Control theory (sociology); Consensus; Actuator; Computer science; Lyapunov function; Lyapunov stability; Controller (irrigation); Fault tolerance; Multi-agent system; Distributed computing; Control (management); Nonlinear system; Physics","score_opus":0.014600446239997438,"score_gpt":0.23298529389189312,"score_spread":0.2183848476518957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310588863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.098533735,0.0008013711,0.8973537,0.00018108204,0.0010013231,0.0009158019,0.0010671124,0.00013677009,0.000009100822],"genre_scores_gemma":[0.9973941,0.000041953575,0.0018809316,0.00005368557,0.000029555498,0.00035286724,0.000016428112,0.000027140075,0.0002033574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968137,0.00044059215,0.00076035014,0.00061591656,0.00091973576,0.0004497124],"domain_scores_gemma":[0.9979923,0.00048560541,0.00043099123,0.00071690924,0.00019867034,0.00017553066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038687524,0.00036294866,0.00064501015,0.00016882291,0.000410709,0.0001618578,0.0007306599,0.000077845834,0.000017125774],"category_scores_gemma":[0.000013400132,0.00030770843,0.0001729036,0.00046074542,0.00016467494,0.000196316,0.000012063302,0.00038519676,0.0000053040026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007162506,0.0008360625,0.0004978682,0.00011370126,0.00048179622,0.000067269815,0.0009989683,0.9880818,0.0024591128,0.00090572896,0.0000853825,0.0047560195],"study_design_scores_gemma":[0.00549,0.0008199606,0.00063713075,0.00012291233,0.00015196318,0.00006273587,0.0004751113,0.9884319,0.0022803035,0.000041346142,0.0010612502,0.000425418],"about_ca_topic_score_codex":0.0006192077,"about_ca_topic_score_gemma":0.000047528178,"teacher_disagreement_score":0.89886034,"about_ca_system_score_codex":0.00015416548,"about_ca_system_score_gemma":0.00009965854,"threshold_uncertainty_score":0.9999375},"labels":[],"label_agreement":null},{"id":"W4310673721","doi":"10.1016/j.apm.2022.10.049","title":"Scaled consensus problems of multi agent systems via impulsive protocols","year":2022,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Multi-agent system; Consensus; Mathematical optimization; Computer science; Directed graph; Scalar (mathematics); Algebraic graph theory; Graph theory; Mathematics; Lyapunov function; Graph; Topology (electrical circuits); Theoretical computer science; Algorithm; Nonlinear system; Artificial intelligence","score_opus":0.052365554584083776,"score_gpt":0.2667526221876268,"score_spread":0.21438706760354304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310673721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017815875,0.00006804485,0.9765405,0.00006903471,0.00013187411,0.01973742,0.000031668667,0.000260672,0.0013791656],"genre_scores_gemma":[0.9028349,5.623458e-7,0.06919365,0.000030336814,0.000031823572,0.02776129,0.000008805112,0.00003691712,0.00010174516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963624,0.00017715954,0.0012273995,0.00067394035,0.0009735744,0.00058554986],"domain_scores_gemma":[0.9976303,0.00036846887,0.0005980271,0.0010574951,0.00014787796,0.00019784392],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011496705,0.00032218976,0.0007654688,0.0001375239,0.00026679673,0.00012221183,0.0013015436,0.000086176755,0.000024963654],"category_scores_gemma":[0.00002666044,0.00030136356,0.00016541586,0.00044423534,0.00009007868,0.00007712461,0.0006097016,0.00032370217,0.000082278304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024185996,0.00056049885,0.000003040141,0.00071509916,0.00008278846,0.000015187165,0.0009461603,0.721128,0.007428623,0.26835197,0.000065133776,0.00067933445],"study_design_scores_gemma":[0.0014290991,0.000076519136,6.7016043e-7,0.00012503714,0.000023246039,0.000043848195,0.0001960206,0.97638756,0.00081913103,0.020281818,0.0003108139,0.00030625705],"about_ca_topic_score_codex":0.00003102012,"about_ca_topic_score_gemma":3.509207e-7,"teacher_disagreement_score":0.9073469,"about_ca_system_score_codex":0.0001679182,"about_ca_system_score_gemma":0.00008479471,"threshold_uncertainty_score":0.99994385},"labels":[],"label_agreement":null},{"id":"W4310969568","doi":"10.1109/iecon49645.2022.9968386","title":"Affine Formation Control of Multiple Quadcopters","year":2022,"lang":"en","type":"article","venue":"IECON 2022 – 48th Annual Conference of the IEEE Industrial Electronics Society","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Quadcopter; Control theory (sociology); Affine transformation; Computer science; Underactuation; Integrator; Controller (irrigation); Convergence (economics); Sliding mode control; Layer (electronics); Control (management); Control engineering; Engineering; Mathematics; Nonlinear system; Artificial intelligence; Aerospace engineering; Bandwidth (computing); Materials science; Computer network","score_opus":0.02978069051675223,"score_gpt":0.22540525142497717,"score_spread":0.19562456090822494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310969568","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.65659225,0.00094532286,0.3175346,0.008037902,0.008237444,0.0042814687,0.0032092254,0.0003392967,0.0008225387],"genre_scores_gemma":[0.99905795,0.000019849445,0.000118638265,0.00020365097,0.00014218582,0.0001262425,0.000032694057,0.000016972037,0.00028180535],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99623185,0.00060092274,0.0009744863,0.00045497817,0.0010530218,0.00068472495],"domain_scores_gemma":[0.9969322,0.00028922173,0.0012402144,0.0009241726,0.00050457317,0.00010959853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016075432,0.0002950613,0.0006020372,0.00007552288,0.00041481786,0.00009103946,0.0027640506,0.00019374257,0.00007880147],"category_scores_gemma":[0.00024817814,0.0002658419,0.0005798299,0.00082918466,0.0001394109,0.0007096603,0.00042342994,0.0010169295,0.000004079907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020487055,0.0035964525,0.0052100783,0.00039940112,0.0033882232,0.0000139932945,0.038303625,0.1324897,0.41404733,0.098419905,0.18645121,0.11563138],"study_design_scores_gemma":[0.023486907,0.0021025615,0.00028624912,0.00009890584,0.00021588521,0.00004630724,0.006447971,0.81220025,0.104839705,0.0016244411,0.047476526,0.0011742696],"about_ca_topic_score_codex":0.00027445788,"about_ca_topic_score_gemma":0.00005129072,"teacher_disagreement_score":0.67971057,"about_ca_system_score_codex":0.0005588317,"about_ca_system_score_gemma":0.0013215876,"threshold_uncertainty_score":0.9999794},"labels":[],"label_agreement":null},{"id":"W4312270764","doi":"10.1109/access.2022.3227076","title":"A Secure Decentralized Event-Triggered Cooperative Localization in Multi-Robot Systems Under Cyber Attack","year":2022,"lang":"en","type":"article","venue":"IEEE Access","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Mobile robot; Bounded function; Denial-of-service attack; Event (particle physics); Convergence (economics); Distributed computing; Resilience (materials science); Vulnerability (computing); Computer network; Real-time computing; Computer security; Artificial intelligence; The Internet; Mathematics","score_opus":0.06925134915125818,"score_gpt":0.3405940039052651,"score_spread":0.27134265475400693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312270764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02156834,0.0008458354,0.97219783,0.0004566367,0.0029955907,0.0015212196,0.000076709155,0.0002336719,0.000104174556],"genre_scores_gemma":[0.9981151,0.000020057803,0.00021612475,0.0006005856,0.0000548417,0.0006014887,0.00006160564,0.000029929004,0.0003002415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959021,0.0012195741,0.0007575175,0.00077512464,0.0007347218,0.0006109318],"domain_scores_gemma":[0.9983814,0.00015497452,0.0003404704,0.00073557906,0.0002300414,0.0001575388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007420804,0.00030922398,0.000492566,0.0002593035,0.00039848173,0.000774891,0.0021127965,0.0001023914,0.00007714221],"category_scores_gemma":[0.00006381154,0.00030999776,0.000102714504,0.0017018663,0.00003665343,0.0012543076,0.0004490287,0.00037499995,0.000057048725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039425333,0.00036310373,0.0027548233,0.000039913033,0.00007281295,0.00008425153,0.000979388,0.98797053,0.0006378961,0.0019447565,0.0047966326,0.00031646516],"study_design_scores_gemma":[0.004449486,0.00004796251,0.0015845856,0.00007634592,0.000014941779,0.000021367865,0.0003392609,0.98782766,0.00042481808,0.000044853674,0.004729856,0.00043885698],"about_ca_topic_score_codex":0.00083532924,"about_ca_topic_score_gemma":0.0003223053,"teacher_disagreement_score":0.97654676,"about_ca_system_score_codex":0.00066911563,"about_ca_system_score_gemma":0.00024233821,"threshold_uncertainty_score":0.9999352},"labels":[],"label_agreement":null},{"id":"W4312281527","doi":"10.1109/tmech.2022.3220086","title":"Investigating the Effects of Polynomial Trajectories on Energy Consumption of Quadrotors","year":2022,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Polynomial; Kinematics; Trajectory; Acceleration; Energy consumption; Energy (signal processing); Control theory (sociology); Boundary (topology); Polynomial and rational function modeling; Power (physics); Monte Carlo method; Computer science; Applied mathematics; Mathematics; Physics; Mathematical analysis; Classical mechanics; Engineering; Artificial intelligence; Statistics","score_opus":0.013003628119635423,"score_gpt":0.226339706955169,"score_spread":0.21333607883553357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312281527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15927432,0.00018359693,0.8362782,0.00029362616,0.003062768,0.0005911736,0.0001214087,0.00014727475,0.000047639445],"genre_scores_gemma":[0.99862003,0.000020724327,0.0008237339,0.000101198384,0.00003667966,0.0002970337,0.000005815997,0.000019503166,0.00007526379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9976103,0.000515292,0.00050616683,0.00036105505,0.0006964914,0.00031072088],"domain_scores_gemma":[0.9980034,0.0007447631,0.00037415136,0.0007352509,0.00006441111,0.00007797662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045688605,0.00021695298,0.00032338107,0.0002008769,0.00043343668,0.00003736962,0.0008895135,0.00007218795,0.00002610563],"category_scores_gemma":[0.0000318269,0.00019141477,0.00022822389,0.0004992537,0.00010382612,0.00017668461,0.000014994181,0.00037914648,0.00000529434],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032533807,0.0020432267,0.00023965017,0.00069179205,0.0009420576,0.000013648989,0.007945369,0.47424898,0.25867784,0.17089479,0.0010635934,0.08291371],"study_design_scores_gemma":[0.0050241663,0.0038007419,0.00041658938,0.0002757975,0.00023384184,0.000033026434,0.00091177534,0.22613296,0.7565592,0.0013263094,0.0044248183,0.00086079905],"about_ca_topic_score_codex":0.00029652455,"about_ca_topic_score_gemma":0.000044440567,"teacher_disagreement_score":0.8393457,"about_ca_system_score_codex":0.00025187907,"about_ca_system_score_gemma":0.00020085915,"threshold_uncertainty_score":0.7805668},"labels":[],"label_agreement":null},{"id":"W4312361566","doi":"10.1109/tnse.2022.3217460","title":"Flocks, Mobs, and Figure Eights: Swarming as a Lemniscatic Arch","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Swarm behaviour; Arch; Swarming (honey bee); Computer science; Mathematics; Artificial intelligence; Geometry; Mathematical optimization; Algorithm; Structural engineering; Engineering","score_opus":0.007847835142662553,"score_gpt":0.20089226501244603,"score_spread":0.19304442986978348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312361566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05764116,0.00043195533,0.9397105,0.0003490118,0.0012078632,0.0002460992,0.0000062603076,0.00021384015,0.00019330104],"genre_scores_gemma":[0.99693066,0.00002931074,0.0026009767,0.00012326326,0.000057296864,0.00011052725,4.2045323e-7,0.000009811435,0.00013770835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824107,0.000029363857,0.00020054553,0.00048154438,0.00055469,0.00049281615],"domain_scores_gemma":[0.9992976,0.00009098926,0.000039888724,0.00034255692,0.000043575856,0.00018534342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069719146,0.00015952263,0.00015986325,0.00021161289,0.0010227127,0.00020061743,0.00058755546,0.0000269492,0.000008844011],"category_scores_gemma":[0.000008696151,0.00016203792,0.000034259854,0.001315718,0.00007574648,0.000521347,0.000020905869,0.00029771472,0.0000057911366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038487046,0.000030936957,0.000024916968,0.000020095516,0.000016697066,0.000016573937,0.0005561705,0.9805641,0.002616009,0.001884527,0.00013463016,0.014131484],"study_design_scores_gemma":[0.0002857502,0.000106766216,0.00023978823,0.00004235792,0.000011203242,0.00011040888,0.000095053816,0.99389297,0.0004030635,0.00006756239,0.004511634,0.00023342014],"about_ca_topic_score_codex":0.00005052499,"about_ca_topic_score_gemma":0.000004285408,"teacher_disagreement_score":0.9392895,"about_ca_system_score_codex":0.00011861998,"about_ca_system_score_gemma":0.00012441134,"threshold_uncertainty_score":0.78659827},"labels":[],"label_agreement":null},{"id":"W4313010128","doi":"10.1109/taes.2022.3219039","title":"Directed Distance-Based Formation Control of Nonlinear Heterogeneous Agents in 3-D Space","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nonlinear system; Directed graph; State space; Multi-agent system; Set (abstract data type); Exponential stability; Space (punctuation); Stability (learning theory); Mathematics; Computer science; Class (philosophy); Topology (electrical circuits); Discrete mathematics; Mathematical optimization; Combinatorics; Artificial intelligence","score_opus":0.011451584466844114,"score_gpt":0.22285627230352043,"score_spread":0.21140468783667632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313010128","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053704605,0.0007856307,0.9432716,0.00038753534,0.00059614313,0.00092683634,0.00013348482,0.00015441369,0.00003975399],"genre_scores_gemma":[0.99920076,0.000034370634,0.00009639869,0.00006294738,0.000016637985,0.00041735484,0.000008984916,0.00001925049,0.00014329582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976313,0.00039022707,0.0004980335,0.00041980032,0.0005071119,0.0005535112],"domain_scores_gemma":[0.99894243,0.00012910762,0.00027028192,0.00049566414,0.000069517075,0.00009302279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046950538,0.00023209999,0.00042421787,0.00024896834,0.00024684158,0.00008718967,0.00041783106,0.000067849985,0.0000086382215],"category_scores_gemma":[0.00000474432,0.00024427753,0.00011604821,0.0006967884,0.000031162068,0.00020669568,0.0000038016244,0.0003288838,0.0000059596796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036230485,0.00071807974,0.00031568005,0.00017841806,0.00015038771,0.000026768004,0.0006862274,0.98435473,0.009020281,0.0016640492,0.00012443111,0.0023986613],"study_design_scores_gemma":[0.0036148783,0.0005031612,0.00007077503,0.00006153552,0.00002504582,0.000042874093,0.00013194892,0.98810494,0.0047228714,0.000011590655,0.0024608597,0.00024951887],"about_ca_topic_score_codex":0.00039112757,"about_ca_topic_score_gemma":0.00028229362,"teacher_disagreement_score":0.94549614,"about_ca_system_score_codex":0.0005722532,"about_ca_system_score_gemma":0.00015680114,"threshold_uncertainty_score":0.9961349},"labels":[],"label_agreement":null},{"id":"W4313148232","doi":"10.1109/tcns.2022.3210328","title":"Distributed Multirobot Coverage Control of Nonconvex Environments With Guarantees","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Subadditivity; Computer science; Approximation algorithm; Robot; Partition (number theory); Range (aeronautics); Metric (unit); Regular polygon; Distributed algorithm; Time complexity; Algorithm; Mathematics; Distributed computing; Artificial intelligence","score_opus":0.008805584091516471,"score_gpt":0.19698351708289757,"score_spread":0.1881779329913811,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313148232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031949563,0.0006842169,0.9894004,0.00017434407,0.002185666,0.0021403423,0.0019817872,0.00014520719,0.00009310332],"genre_scores_gemma":[0.99851155,0.000016309217,0.00022635247,0.00011220252,0.00010945862,0.00076134445,0.000026587384,0.000047068195,0.00018913925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947559,0.0009869676,0.001392013,0.000762308,0.0013608468,0.00074195996],"domain_scores_gemma":[0.9963778,0.00080465304,0.001157477,0.001329126,0.00013355666,0.00019737736],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009566571,0.0004996183,0.0013380101,0.0002114027,0.00043437653,0.000082479455,0.0014044722,0.00013027326,0.000041054358],"category_scores_gemma":[0.0000075131493,0.00046116728,0.00038627282,0.00075857615,0.00015029487,0.0003562816,0.000010601318,0.00047812142,0.000017278018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00086130254,0.00067649374,0.0005649374,0.000067013294,0.00090257655,0.000045400055,0.00013890052,0.9907897,0.0037237366,0.0006231927,0.0002058249,0.0014009279],"study_design_scores_gemma":[0.01909386,0.0017239363,0.0007745359,0.0002029291,0.00029505504,0.000091557515,0.00014862831,0.97173905,0.0005953386,0.000018741484,0.004713921,0.0006024156],"about_ca_topic_score_codex":0.0002534457,"about_ca_topic_score_gemma":0.000023016955,"teacher_disagreement_score":0.99531657,"about_ca_system_score_codex":0.00033872912,"about_ca_system_score_gemma":0.00014173592,"threshold_uncertainty_score":0.999784},"labels":[],"label_agreement":null},{"id":"W4313244753","doi":"10.3390/electronics12010083","title":"Stochastic Fixed-Time Tracking Control for the Chaotic Multi-Agent-Based Supply Chain Networks with Nonlinear Communication","year":2022,"lang":"en","type":"article","venue":"Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Correctness; Nonlinear system; Multi-agent system; Settling time; Control theory (sociology); Supply chain; Supply chain network; Mathematical optimization; Protocol (science); Distributed computing; Supply chain management; Control (management); Mathematics; Control engineering; Engineering; Algorithm","score_opus":0.011689188185004955,"score_gpt":0.2268071391758325,"score_spread":0.21511795099082756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313244753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00091363443,0.0059527284,0.9874213,0.0030522821,0.00019227588,0.0021353345,0.00007944724,0.00024693183,0.000006117493],"genre_scores_gemma":[0.9920709,0.000013095822,0.005370684,0.00078901387,0.00009111778,0.0012673029,0.00017923304,0.000048172915,0.00017044574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99734217,0.0004328523,0.00040387138,0.00048226144,0.00048681983,0.00085200137],"domain_scores_gemma":[0.99682426,0.0012132793,0.0003496472,0.0013472367,0.00017263877,0.00009295112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001400562,0.000282042,0.00034191777,0.00008868562,0.0011469845,0.00025241388,0.0022060946,0.000061997045,0.000018745046],"category_scores_gemma":[0.00009061263,0.00022753293,0.00015269505,0.00053194904,0.000062709296,0.00018731668,0.00016108104,0.0005875862,0.0000123540585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013301213,0.00020757488,0.000060677896,0.000008738913,0.00014658658,0.0000029801186,0.00018878847,0.98935026,0.0002905187,0.0021900353,0.0003274056,0.007093406],"study_design_scores_gemma":[0.004583344,0.00044466957,0.00013582886,0.000018191848,0.00008279694,0.000016882324,0.00004959484,0.9871566,0.00004745441,0.000026866619,0.0071635903,0.00027414665],"about_ca_topic_score_codex":0.000021761058,"about_ca_topic_score_gemma":0.000089569774,"teacher_disagreement_score":0.9911573,"about_ca_system_score_codex":0.00046033194,"about_ca_system_score_gemma":0.00036933378,"threshold_uncertainty_score":0.92785233},"labels":[],"label_agreement":null},{"id":"W4313643885","doi":"10.1109/tnse.2023.3234720","title":"Connectivity Preservation and Collision Avoidance in Multi-Agent Systems Using Model Predictive Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Model predictive control; Collision avoidance; Computer science; Position (finance); Control theory (sociology); Distributed computing; Controller (irrigation); Multi-agent system; Field (mathematics); Scheme (mathematics); Topology (electrical circuits); Control (management); Collision; Artificial intelligence; Engineering; Mathematics; Computer security","score_opus":0.03265230708582384,"score_gpt":0.244379077081941,"score_spread":0.21172676999611717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313643885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19317234,0.0001007279,0.80529636,0.000050526523,0.00070260756,0.00045804586,0.000014989776,0.00019857298,0.0000057979137],"genre_scores_gemma":[0.9973006,0.000052286843,0.0024750417,0.00001969472,0.000029407025,0.00009541694,4.4940364e-7,0.000010156927,0.000016916492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982507,0.00004743732,0.00026405277,0.0005244072,0.00042830655,0.00048510052],"domain_scores_gemma":[0.9992075,0.00019259045,0.00006281261,0.00027552075,0.00011843161,0.00014317005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013432363,0.0001712438,0.00022448931,0.0003144527,0.0003451939,0.00026818036,0.00030714058,0.000069810085,1.1031163e-7],"category_scores_gemma":[0.00003735251,0.00017387961,0.000024957837,0.0018296625,0.00007369796,0.0014149742,0.000010259699,0.00018977356,0.0000019039198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009506947,0.000021139103,0.00015025333,0.000024669924,0.000008161878,0.0000041101234,0.0002316637,0.9930293,0.0057485597,0.00031722942,0.0000075131575,0.0004478789],"study_design_scores_gemma":[0.0007808828,0.000038216986,0.0028322372,0.00016674427,0.000007519815,0.0000069594357,0.00003979313,0.99571204,0.00022235507,0.000014524891,0.000013704009,0.00016500332],"about_ca_topic_score_codex":0.00008947479,"about_ca_topic_score_gemma":0.000019193076,"teacher_disagreement_score":0.8041283,"about_ca_system_score_codex":0.0002111974,"about_ca_system_score_gemma":0.00010890158,"threshold_uncertainty_score":0.7090605},"labels":[],"label_agreement":null},{"id":"W4314946892","doi":"10.1109/cdc51059.2022.9993370","title":"Leader-follower bearing-based distributed pose estimation for multi-vehicle networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Observer (physics); Control theory (sociology); Scheme (mathematics); Nonlinear system; Stability (learning theory); Pose; Estimation; Computer science; Position (finance); Exponential stability; Property (philosophy); Bearing (navigation); State (computer science); Angular velocity; Exponential function; Mathematics; Algorithm; Engineering; Artificial intelligence; Machine learning; Physics","score_opus":0.045814860392392964,"score_gpt":0.2845109741130211,"score_spread":0.23869611372062816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4314946892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008493639,0.00019918033,0.98508155,0.0017892146,0.0019468672,0.0015693844,0.0005461879,0.00030134286,0.00007265105],"genre_scores_gemma":[0.9921714,0.000008068302,0.004941343,0.0014060324,0.00009462599,0.0008751087,0.0001801892,0.00003518408,0.00028807094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960435,0.00035346652,0.00077923544,0.0011352854,0.00093956164,0.0007489653],"domain_scores_gemma":[0.99704254,0.0008748504,0.0004026781,0.0010308913,0.00031332497,0.00033569682],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011565698,0.0004523284,0.00066093943,0.00025862927,0.000944864,0.00068019587,0.0013632977,0.00015742167,0.00014657238],"category_scores_gemma":[0.00032820014,0.0004433677,0.00026961984,0.0005880664,0.00007922029,0.0003924878,0.00021902463,0.0005046714,0.000041046613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031786165,0.0020349142,0.0017310721,0.00005946145,0.0003307743,0.00015552409,0.0003936315,0.46373293,0.007186678,0.040923025,0.016942313,0.46333107],"study_design_scores_gemma":[0.011559965,0.0005815511,0.0020315712,0.000048829275,0.000044400407,0.000009273066,0.00010501743,0.97981596,0.00009995549,0.0006784505,0.0045414497,0.0004835518],"about_ca_topic_score_codex":0.000059137437,"about_ca_topic_score_gemma":0.000054580934,"teacher_disagreement_score":0.98367774,"about_ca_system_score_codex":0.00021682677,"about_ca_system_score_gemma":0.00022870884,"threshold_uncertainty_score":0.9998018},"labels":[],"label_agreement":null},{"id":"W4314946928","doi":"10.1109/cdc51059.2022.9992388","title":"Input design for the optimal control of networked moments","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Control (management); Control theory (sociology); Control engineering; Engineering; Artificial intelligence","score_opus":0.04409814724773364,"score_gpt":0.2688049474457881,"score_spread":0.22470680019805445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4314946928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032571754,0.00066623633,0.98941994,0.002046473,0.0017253336,0.0023532705,0.00027066452,0.00009159649,0.00016932712],"genre_scores_gemma":[0.99512416,0.00005841008,0.0016485302,0.0013319481,0.00011280597,0.0012438974,0.00000816059,0.000024732615,0.00044736444],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9959695,0.00063264417,0.00084002054,0.0008196323,0.0011118636,0.0006263801],"domain_scores_gemma":[0.99467474,0.003145437,0.00052564504,0.0011257543,0.0003196467,0.0002087683],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002289607,0.00037811848,0.00073918514,0.00019752704,0.00073739997,0.00033639488,0.0021551372,0.00009560982,0.00016780802],"category_scores_gemma":[0.000255712,0.00028651342,0.00025430444,0.00046004512,0.00011419983,0.0002476564,0.00024815334,0.00037500245,0.000020347445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008263112,0.001044257,0.0005003484,0.000039165898,0.0011053318,0.00007069799,0.0009416494,0.28737792,0.014107194,0.0951063,0.028952679,0.56249136],"study_design_scores_gemma":[0.012130186,0.0010327705,0.00049287925,0.00003309255,0.00008047724,0.000015150721,0.00019891778,0.9709618,0.00012898614,0.0017696787,0.012837287,0.00031877388],"about_ca_topic_score_codex":0.00003265572,"about_ca_topic_score_gemma":0.0000057612256,"teacher_disagreement_score":0.99186695,"about_ca_system_score_codex":0.00010195754,"about_ca_system_score_gemma":0.00022692778,"threshold_uncertainty_score":0.9999587},"labels":[],"label_agreement":null},{"id":"W4315471796","doi":"10.1109/cdc51059.2022.9992975","title":"Distributed Nash Equilibrium Seeking for Decomposable Pseudo-Gradient","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Best response; Mathematical economics; Regular polygon; Mathematical optimization; Folk theorem; Epsilon-equilibrium; Game theory; Convex function; Function (biology); Component (thermodynamics); Computer science; Mathematics; Applied mathematics; Equilibrium selection; Repeated game; Physics","score_opus":0.026902103619868955,"score_gpt":0.2639364667199602,"score_spread":0.23703436310009124,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315471796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038470104,0.0002712003,0.95199674,0.002363797,0.0030100225,0.0016842597,0.0011887883,0.00034721306,0.00066786364],"genre_scores_gemma":[0.99537,0.00002243236,0.001733977,0.001152899,0.00013837499,0.00091259705,0.00011772141,0.000038547078,0.00051350106],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951048,0.00039676888,0.0009200395,0.0013946944,0.0011858268,0.0009979086],"domain_scores_gemma":[0.9963971,0.0011166448,0.0004455993,0.0012728509,0.0003245893,0.0004432301],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014292288,0.0005186385,0.00084199524,0.00031810976,0.0008998918,0.00086395827,0.0020470172,0.00012490568,0.00022870286],"category_scores_gemma":[0.0002479165,0.0005050831,0.00031712436,0.0006673259,0.00008137373,0.00047034552,0.00054553914,0.00048190285,0.00006979152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047355844,0.0025598367,0.0028442207,0.00016513883,0.0009051236,0.00045377552,0.0012740262,0.01672924,0.13264287,0.3568099,0.09564202,0.38523823],"study_design_scores_gemma":[0.009583183,0.00093487836,0.00096678187,0.0000674708,0.00005459654,0.000072644274,0.00024135652,0.9275513,0.00028457088,0.008222666,0.05128745,0.0007331006],"about_ca_topic_score_codex":0.000053486125,"about_ca_topic_score_gemma":0.00003270857,"teacher_disagreement_score":0.9568998,"about_ca_system_score_codex":0.00028652724,"about_ca_system_score_gemma":0.00024217312,"threshold_uncertainty_score":0.99974006},"labels":[],"label_agreement":null},{"id":"W4315488743","doi":"10.1109/cdc51059.2022.9992508","title":"Robust Formation Control of Nonlinear Agents with Distance Constraints","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 61st Conference on Decision and Control (CDC)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Nonlinear system; Robust control; Exponential stability; Lyapunov function; Graph theory; Lyapunov stability; Multi-agent system; Integral sliding mode; Controller (irrigation); Convergence (economics); Computer science; Nonlinear control; Sliding mode control; Mathematics; Mathematical optimization; Topology (electrical circuits); Control (management); Artificial intelligence","score_opus":0.03366938353568659,"score_gpt":0.24278893089306977,"score_spread":0.2091195473573832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315488743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018985339,0.00016061675,0.97586024,0.00085909804,0.0006776889,0.0010929409,0.0007317827,0.000118051335,0.0015142385],"genre_scores_gemma":[0.9971126,0.000032302807,0.0015270987,0.0008078785,0.000045675086,0.00023043435,0.000031717114,0.000020985959,0.00019135796],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960067,0.00040112986,0.000867565,0.0007879029,0.0014114972,0.00052518817],"domain_scores_gemma":[0.99727196,0.00048896985,0.00066321046,0.0009374572,0.00037548493,0.00026294356],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009267097,0.00039102774,0.00075209694,0.00026714566,0.0004464492,0.00027988033,0.0012562501,0.00008748505,0.00040211607],"category_scores_gemma":[0.00011892331,0.0003352292,0.00014344761,0.00052899733,0.00020188715,0.0005727442,0.00014703184,0.0004186147,0.000038794165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008202155,0.0026323725,0.004890731,0.00020412868,0.0009063812,0.0006626093,0.0022964054,0.038941972,0.018256718,0.17613195,0.009623865,0.7372507],"study_design_scores_gemma":[0.015749048,0.0010118408,0.0019344926,0.00013001611,0.000059781316,0.00008600061,0.0005192832,0.9730216,0.00021615795,0.0006838951,0.006077907,0.0005099668],"about_ca_topic_score_codex":0.000028881004,"about_ca_topic_score_gemma":0.000040514537,"teacher_disagreement_score":0.9781272,"about_ca_system_score_codex":0.00013759527,"about_ca_system_score_gemma":0.00021072176,"threshold_uncertainty_score":0.99991},"labels":[],"label_agreement":null},{"id":"W4315628851","doi":"10.1016/j.ins.2023.01.063","title":"Predefined-time stability for a class of dynamical systems and its application on the consensus control for nonlinear multi-agent systems","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Settling time; Nonlinear system; Upper and lower bounds; Control theory (sociology); Computer science; Convergence (economics); Stability (learning theory); Multi-agent system; Class (philosophy); Protocol (science); Mathematical optimization; Control (management); Topology (electrical circuits); Mathematics; Control engineering; Engineering; Artificial intelligence","score_opus":0.04857077906702088,"score_gpt":0.2867977733831677,"score_spread":0.2382269943161468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315628851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06896666,0.000073764844,0.9193071,0.0021330414,0.00067337643,0.0069142478,0.001508215,0.0002403328,0.00018323572],"genre_scores_gemma":[0.99788356,0.000002040934,0.0006213917,0.00007283143,0.000032443142,0.0013036823,0.00004783256,0.0000038927487,0.000032350134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788266,0.00013733623,0.0008203701,0.00028730862,0.0005543289,0.00031799817],"domain_scores_gemma":[0.996481,0.0019152856,0.0005853958,0.00038169653,0.0005574448,0.000079169506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036211167,0.00015264656,0.00029772928,0.00016717461,0.0003490542,0.00039976358,0.00074608455,0.00008062918,6.0207753e-7],"category_scores_gemma":[0.0008843003,0.00010244098,0.000079434336,0.00061139825,0.00015741929,0.00058086286,0.00006866884,0.000054379998,0.00005250117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003427479,0.0003141874,0.0010170367,0.0021721758,0.0002387249,5.870332e-7,0.0042250385,0.21152724,0.014424398,0.7510722,0.004428283,0.01023736],"study_design_scores_gemma":[0.001141707,0.00015952124,0.00035543126,0.00004155877,0.000009858464,0.0000030102356,0.000557441,0.99410546,0.00022154298,0.000052567808,0.003238612,0.00011328358],"about_ca_topic_score_codex":0.000044466637,"about_ca_topic_score_gemma":0.0000035911094,"teacher_disagreement_score":0.9289169,"about_ca_system_score_codex":0.000070566755,"about_ca_system_score_gemma":0.00013541194,"threshold_uncertainty_score":0.4177422},"labels":[],"label_agreement":null},{"id":"W4316661137","doi":"10.1109/tac.2023.3237484","title":"Local Topology Inference of Mobile Robotic Networks Under Formation Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Unobservable; Estimator; Mobile robot; Topology (electrical circuits); Robot; Network topology; Range (aeronautics); Inference; Computer science; Convergence (economics); Control theory (sociology); Mathematics; Artificial intelligence; Control (management); Engineering","score_opus":0.015734799414566927,"score_gpt":0.2577132828098427,"score_spread":0.24197848339527575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316661137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002963545,0.00004609666,0.99281126,0.0006934301,0.0012765133,0.0011855321,0.000035001376,0.0009136267,0.000074987984],"genre_scores_gemma":[0.99854714,0.000009936174,0.00039765658,0.0003359273,0.000026491245,0.00055224216,0.0000059222725,0.000019433539,0.00010527171],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973281,0.00035027755,0.0009106898,0.00039033327,0.00044994478,0.00057064067],"domain_scores_gemma":[0.9972954,0.0012345298,0.00033495546,0.0008043242,0.00017767644,0.00015311567],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005589632,0.00028533163,0.0006641086,0.00037978461,0.00018229714,0.000094043055,0.0007396351,0.00019520827,0.00007456507],"category_scores_gemma":[0.000023105438,0.00026928863,0.00024184398,0.00089226663,0.00012897598,0.0005306542,0.0000040956857,0.00021918556,0.0003150339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020442436,0.00013565716,0.0000074395966,0.000043679796,0.00013562276,0.0000076753895,0.00017728664,0.9407962,0.0005830112,0.0018256236,0.00010417339,0.056163218],"study_design_scores_gemma":[0.003925231,0.00027564607,0.0005471556,0.00007415997,0.0000882662,0.000017249542,0.00013392957,0.9939298,0.00038209322,0.00036377148,0.000036347214,0.00022637093],"about_ca_topic_score_codex":0.00006953426,"about_ca_topic_score_gemma":0.000061252904,"teacher_disagreement_score":0.9955836,"about_ca_system_score_codex":0.00015790966,"about_ca_system_score_gemma":0.00011478569,"threshold_uncertainty_score":0.9999759},"labels":[],"label_agreement":null},{"id":"W4318454202","doi":"10.1007/s11071-022-08212-w","title":"Dual-arm aerial continuum manipulation systems: modeling, pre-grasp planning, and control","year":2023,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workspace; GRASP; Payload (computing); Robotic arm; Control engineering; Control theory (sociology); Dual (grammatical number); Control system; Computer science; Stiffness; Control (management); Engineering; Simulation; Robot; Artificial intelligence; Network packet","score_opus":0.020318672617282787,"score_gpt":0.26310659497829947,"score_spread":0.24278792236101668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318454202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20659328,0.00018754968,0.7884938,0.00021711623,0.002516906,0.0007131614,0.00017842134,0.0008467851,0.00025295242],"genre_scores_gemma":[0.9969217,0.000010281713,0.001495811,0.000046458994,0.0005916653,0.00006475926,0.00035307038,0.00003704201,0.00047919864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976256,0.00014598307,0.00060851517,0.000608409,0.00047467952,0.0005368053],"domain_scores_gemma":[0.9985519,0.00016118772,0.00031560464,0.00062381127,0.00017413615,0.00017333857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000636875,0.00028809815,0.00043285152,0.00020908103,0.00017598316,0.00050746335,0.00049635227,0.0002085389,0.0000017997485],"category_scores_gemma":[0.00016898011,0.00029000544,0.00008526309,0.00041807917,0.000037482565,0.00042394848,0.00018759699,0.00020682576,0.000071410024],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002489627,0.0003153394,0.0448179,0.00037717406,0.00044560368,0.000368315,0.001570287,0.89966094,0.0011721158,0.044875525,0.0020582445,0.004089566],"study_design_scores_gemma":[0.002047414,0.00008177766,0.0026043325,0.00007556981,0.000029460696,0.00003074261,0.000095627685,0.99375105,0.0000037850257,0.00018347593,0.00080030994,0.0002964308],"about_ca_topic_score_codex":0.00022770392,"about_ca_topic_score_gemma":0.00009249878,"teacher_disagreement_score":0.79032844,"about_ca_system_score_codex":0.00012896593,"about_ca_system_score_gemma":0.000072504496,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W4319865621","doi":"10.1109/tie.2023.3239870","title":"Fully Distributed Event-Triggered Formation Control for Multiple Quadrotors","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Control theory (sociology); Sliding mode control; Underactuation; Reachability; Computer science; Lyapunov function; Lyapunov stability; Nonlinear system; Control (management); Artificial intelligence; Physics","score_opus":0.03639874907860714,"score_gpt":0.26117091076402266,"score_spread":0.22477216168541553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319865621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052333097,0.000032240005,0.9854737,0.001566284,0.002412416,0.0029666775,0.0012186522,0.0010801209,0.000016627433],"genre_scores_gemma":[0.99751335,0.000020213785,0.00016734021,0.00011304161,0.00023669969,0.0014572205,0.00021221953,0.000039178656,0.00024074604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966094,0.00024716547,0.0008403546,0.00061471935,0.0005795234,0.0011088649],"domain_scores_gemma":[0.9976665,0.00079317915,0.0003274291,0.00073352817,0.0002501976,0.00022921115],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008674664,0.0003809489,0.00048045153,0.0004049188,0.0005692223,0.00028590177,0.00091186265,0.00042795134,0.000011792591],"category_scores_gemma":[0.00013480414,0.00039332837,0.00040846606,0.0016616842,0.000035911205,0.00082508073,0.0000037397213,0.00060875365,0.00019020369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027803776,0.0013775461,0.00006124299,0.00011686663,0.0012266247,0.000030404706,0.00057439634,0.7177404,0.02168593,0.008536132,0.041986212,0.20388387],"study_design_scores_gemma":[0.013341259,0.000825603,0.000018815079,0.000046743444,0.0000953508,0.000009536987,0.000060639337,0.93430173,0.023993714,0.00055865466,0.026216924,0.000531036],"about_ca_topic_score_codex":0.000052053423,"about_ca_topic_score_gemma":0.00011046812,"teacher_disagreement_score":0.99228,"about_ca_system_score_codex":0.0007315493,"about_ca_system_score_gemma":0.00048136644,"threshold_uncertainty_score":0.9998519},"labels":[],"label_agreement":null},{"id":"W4319879691","doi":"10.1007/s11071-023-08268-2","title":"Double event-triggered leader-following consensus and fault detection for Lipschitz nonlinear multi-agent systems via periodic sampling strategy","year":2023,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Lipschitz continuity; Control theory (sociology); Nonlinear system; Lyapunov stability; Observer (physics); Weighting; Mathematics; Computer science; Fault detection and isolation; Controller (irrigation); Stability (learning theory); Matrix (chemical analysis); Mathematical optimization; Control (management); Artificial intelligence; Actuator","score_opus":0.05205781951323269,"score_gpt":0.3064331393306814,"score_spread":0.2543753198174487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319879691","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27930707,0.00032622454,0.7150273,0.00022307415,0.0024558762,0.0015537437,0.00031293172,0.0007766856,0.000017128314],"genre_scores_gemma":[0.96535826,0.000029092502,0.032488383,0.000045035456,0.00044608334,0.0002429596,0.0004541126,0.0000943482,0.0008417303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963423,0.00014662876,0.0009571637,0.0010486206,0.0005590478,0.00094622513],"domain_scores_gemma":[0.997895,0.00032956892,0.0003783598,0.000802318,0.0002896594,0.00030510916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010189718,0.0004985452,0.00066962343,0.00035604974,0.0006099756,0.0007895858,0.00070396264,0.00034284467,0.0000010852087],"category_scores_gemma":[0.00014363255,0.00051481684,0.0003171752,0.00088490825,0.000074784126,0.00032763707,0.00022899988,0.00036935078,0.00009322947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009003336,0.00155349,0.0067443,0.0033315562,0.0023302867,0.0006116383,0.0039333813,0.66539186,0.07207018,0.00436916,0.0002823294,0.23848146],"study_design_scores_gemma":[0.0042830002,0.0001641037,0.00033411858,0.000108919914,0.000060455375,0.000053396776,0.00072993274,0.9915054,0.0002380073,0.000028737968,0.001959885,0.00053408305],"about_ca_topic_score_codex":0.00041668763,"about_ca_topic_score_gemma":0.00058347377,"teacher_disagreement_score":0.6860512,"about_ca_system_score_codex":0.00034197533,"about_ca_system_score_gemma":0.00020965592,"threshold_uncertainty_score":0.99973035},"labels":[],"label_agreement":null},{"id":"W4320037891","doi":"10.1007/978-981-19-6613-2_352","title":"Multi-UAV Cooperative Hunting Using PSO in 3D Cluttered Environment","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Obstacle; Downwash; Flocking (texture); Computer science; Obstacle avoidance; Trajectory; Artificial intelligence; Computer vision; Position (finance); Control theory (sociology); Engineering; Robot; Geography; Aerospace engineering; Mobile robot; Aerodynamics","score_opus":0.02040008737555193,"score_gpt":0.22320274637849988,"score_spread":0.20280265900294794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320037891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021530614,0.00095033745,0.9968113,0.00011050544,0.0005014666,0.0007325525,0.000015297226,0.00035154083,0.000311699],"genre_scores_gemma":[0.82409585,0.0002474834,0.17005774,0.00039138139,0.00092719623,0.00020420188,0.00012519621,0.0005868356,0.0033641367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99643266,0.000057422447,0.0008808165,0.0010976333,0.0005386908,0.0009927658],"domain_scores_gemma":[0.9982707,0.0006762848,0.00021065125,0.00066371396,0.000039590403,0.00013905519],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038972788,0.00073072646,0.00091699883,0.00086705235,0.000064375774,0.00016931783,0.00092991965,0.0006819896,0.000013595799],"category_scores_gemma":[0.00048598577,0.00077743776,0.00017173958,0.00054913724,0.000026410064,0.00020148551,0.0003277259,0.0016796496,0.0000842233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074211566,0.000038308684,0.000083712344,0.00005772197,0.00007505427,0.00033514894,0.00021467022,0.9736244,0.0073151453,0.0023646364,0.0000033153046,0.015880462],"study_design_scores_gemma":[0.00085309416,0.000048537768,0.0002107234,0.00040257562,0.000017380005,0.000020584217,4.0183446e-7,0.99602854,0.0005124126,0.00020732978,0.00094414194,0.00075428246],"about_ca_topic_score_codex":0.0001071648,"about_ca_topic_score_gemma":0.00006447769,"teacher_disagreement_score":0.82675356,"about_ca_system_score_codex":0.0012177804,"about_ca_system_score_gemma":0.00009959262,"threshold_uncertainty_score":0.9994677},"labels":[],"label_agreement":null},{"id":"W4320038054","doi":"10.1007/978-981-19-6613-2_248","title":"Fractional-Order Sliding-Mode Fault-Tolerant Control of Unmanned Aerial Vehicles Against Actuator Faults with Time-Delay","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Actuator; Observer (physics); Controller (irrigation); Mode (computer interface); Fault (geology); Fault tolerance; Lyapunov function; Engineering; Sliding mode control; Lyapunov stability; Control engineering; Computer science; Control (management); Nonlinear system; Artificial intelligence; Physics","score_opus":0.006176186208974871,"score_gpt":0.20403890923623602,"score_spread":0.19786272302726116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320038054","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007865294,0.00037910623,0.9955427,0.0003267536,0.00062314596,0.00088085246,0.000106117564,0.00065337314,0.0007014454],"genre_scores_gemma":[0.9926378,0.000039737126,0.0050380807,0.00017511872,0.00060386746,0.00009763298,0.0001202367,0.00021616396,0.0010713729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962476,0.000050524173,0.00091143587,0.00096210686,0.0009773598,0.00085096096],"domain_scores_gemma":[0.99685055,0.0014991206,0.00042372532,0.0007328083,0.00029212664,0.00020169458],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028715353,0.00081238337,0.0012752617,0.0006996037,0.00007416549,0.00010145636,0.0010250659,0.0007986086,0.000012483716],"category_scores_gemma":[0.0006064464,0.00072501355,0.00025767033,0.0006746923,0.000035252997,0.00022857866,0.00010744076,0.0013125872,0.00008292323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025943175,0.00007510031,0.000017189268,0.000118386546,0.00058758503,0.00026728833,0.0001325629,0.96324617,0.013857428,0.011377635,0.00005983807,0.010001398],"study_design_scores_gemma":[0.0025498534,0.00022781009,0.00003356536,0.00048016958,0.00006923561,0.000032386593,3.6801427e-7,0.99119645,0.0014955272,0.0006457672,0.0024227472,0.00084612775],"about_ca_topic_score_codex":0.000041502135,"about_ca_topic_score_gemma":0.000016884766,"teacher_disagreement_score":0.9918513,"about_ca_system_score_codex":0.00042274786,"about_ca_system_score_gemma":0.0002655557,"threshold_uncertainty_score":0.9995201},"labels":[],"label_agreement":null},{"id":"W4320038461","doi":"10.1007/978-981-19-6613-2_297","title":"Distributed Finite-Time Fault-Tolerant Cooperative Control of Multiple UAVs Against Thrust Loss Fault and External Disturbances","year":2023,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Thrust; Observer (physics); Fault tolerance; Controller (irrigation); Fault (geology); Engineering; Position (finance); Computer science; Control engineering; Control (management); Distributed computing; Aerospace engineering; Artificial intelligence; Geology; Physics","score_opus":0.007575191133562112,"score_gpt":0.1995295201609248,"score_spread":0.19195432902736267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4320038461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004573607,0.003285435,0.9934126,0.00018702695,0.00041812894,0.0008761931,0.0006432165,0.00039947018,0.00032054336],"genre_scores_gemma":[0.9972479,0.00017427652,0.0013652747,0.00007921811,0.00023980069,0.000077430544,0.00019218132,0.00010591304,0.0005180323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99628276,0.000070401016,0.0010474952,0.0010445834,0.000700622,0.0008541491],"domain_scores_gemma":[0.99548066,0.0030204647,0.00038501289,0.0006510116,0.00023704325,0.0002257838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031220316,0.0008659451,0.0014950051,0.00043400942,0.00009087835,0.00018853301,0.0010434992,0.00066135824,0.0000092582795],"category_scores_gemma":[0.0014997051,0.000787401,0.00025696636,0.00055586424,0.00010627068,0.00022437729,0.00020424252,0.0012977511,0.00002949996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011991444,0.000085476706,0.00025655856,0.00021980105,0.0004087013,0.0004929538,0.00024795657,0.954289,0.006249211,0.009069821,0.00003372932,0.02852683],"study_design_scores_gemma":[0.0021270048,0.00016498858,0.00029680712,0.0006657642,0.00004833075,0.00002068705,6.2940796e-7,0.99343586,0.00088800205,0.00053370313,0.001013713,0.000804494],"about_ca_topic_score_codex":0.000032711425,"about_ca_topic_score_gemma":0.000019504127,"teacher_disagreement_score":0.9967905,"about_ca_system_score_codex":0.00028849265,"about_ca_system_score_gemma":0.0001106278,"threshold_uncertainty_score":0.9994577},"labels":[],"label_agreement":null},{"id":"W4323041602","doi":"10.1016/j.automatica.2023.110949","title":"Comments on “Pose localization of leader–follower networks with direction measurements” [Automatica 120 (2020) 109125]","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observer (physics); Control theory (sociology); Mathematics; Stability (learning theory); Computer science; Artificial intelligence; Physics; Control (management); Machine learning","score_opus":0.025092439669759704,"score_gpt":0.24888204692109664,"score_spread":0.22378960725133692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323041602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009938609,0.00005252681,0.97983104,0.0015590872,0.0012236136,0.0011376387,0.000011410365,0.002122497,0.004123556],"genre_scores_gemma":[0.9964883,0.00000756794,0.0026119163,0.00033628725,0.00007112019,0.000114462484,0.000054626358,0.000035142348,0.00028060994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969634,0.00028455132,0.00067711616,0.00049134943,0.0010734473,0.0005101615],"domain_scores_gemma":[0.9980771,0.00022919229,0.00038554566,0.0009547503,0.00020617178,0.00014725121],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075379637,0.0002921069,0.00044862684,0.00020843434,0.00019202742,0.00016553032,0.00073322223,0.00012267618,0.00003340824],"category_scores_gemma":[0.00015142583,0.00024689813,0.000101681224,0.0015854877,0.00006569702,0.0003935417,0.00013118556,0.00013946336,0.00035770846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037517576,0.0041376017,0.032279287,0.0015901807,0.0033607183,0.0003188887,0.007850102,0.4814932,0.0038014257,0.019593922,0.27941397,0.1657855],"study_design_scores_gemma":[0.0013012264,0.0002697097,0.008443646,0.00037569774,0.000052543146,0.0000075792213,0.0000668673,0.9870467,0.0005904595,0.00013131114,0.0014434977,0.00027075424],"about_ca_topic_score_codex":0.00003716055,"about_ca_topic_score_gemma":0.000014183236,"teacher_disagreement_score":0.9865497,"about_ca_system_score_codex":0.00015021571,"about_ca_system_score_gemma":0.00006541168,"threshold_uncertainty_score":0.99999833},"labels":[],"label_agreement":null},{"id":"W4323854560","doi":"10.1142/s2737480723500048","title":"Multi-UAV Cooperative Hunting in Cluttered Environments Considering Downwash Effects","year":2023,"lang":"en","type":"article","venue":"Guidance Navigation and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Downwash; Drone; Obstacle; Obstacle avoidance; Flocking (texture); Computer science; Motion planning; Particle swarm optimization; Swarm behaviour; Control theory (sociology); Spinning; Artificial intelligence; Simulation; Engineering; Aerospace engineering; Robot; Aerodynamics; Mobile robot; Geography; Algorithm; Physics","score_opus":0.01400048956068777,"score_gpt":0.2493345156378507,"score_spread":0.23533402607716292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323854560","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44622627,0.00046577927,0.549886,0.0011315077,0.0005457017,0.0012796611,0.000024831259,0.0003405931,0.00009966796],"genre_scores_gemma":[0.99763215,0.000012446964,0.0014350695,0.00046087726,0.000044591423,0.00021949403,0.000020404328,0.000012361651,0.00016262422],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981132,0.0002449569,0.00044143098,0.0005146652,0.0002672006,0.00041855228],"domain_scores_gemma":[0.99906635,0.00029928592,0.00016980957,0.00032478917,0.000037050744,0.00010269967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005988909,0.00020406481,0.00031780658,0.00012044726,0.00017061303,0.00021498282,0.0003082426,0.000086853164,0.0000024843987],"category_scores_gemma":[0.00020033201,0.00020655022,0.000046833808,0.00043611127,0.000051983734,0.0005265107,0.00011107252,0.00016249192,0.00015352799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007722279,0.00024906767,0.18065016,0.00025753112,0.000206675,0.00046735292,0.0045721824,0.013954532,0.701061,0.00506761,0.0005903408,0.0928463],"study_design_scores_gemma":[0.0088493675,0.00004852118,0.1457384,0.00030429536,0.000010869707,0.000010265008,0.00013579552,0.8383516,0.004448273,0.00009476867,0.0016633094,0.00034455568],"about_ca_topic_score_codex":0.00006574044,"about_ca_topic_score_gemma":0.000018417382,"teacher_disagreement_score":0.824397,"about_ca_system_score_codex":0.00008155912,"about_ca_system_score_gemma":0.000029324843,"threshold_uncertainty_score":0.84228736},"labels":[],"label_agreement":null},{"id":"W4324359512","doi":"10.3390/drones7030197","title":"Finite-Time Adaptive Consensus Tracking Control Based on Barrier Function and Cascaded High-Gain Observer","year":2023,"lang":"en","type":"article","venue":"Drones","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Science Foundation of Sichuan Province; China Aerodynamics Research and Development Center","keywords":"Control theory (sociology); Multi-agent system; Computer science; Nonlinear system; Consensus; Lyapunov function; Observer (physics); Adaptive control; Control (management); Artificial intelligence","score_opus":0.02394604916094553,"score_gpt":0.22119096049010045,"score_spread":0.19724491132915492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4324359512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22972861,0.0002533901,0.7564177,0.00611558,0.0025722333,0.0017038253,0.00048195853,0.002040325,0.0006863879],"genre_scores_gemma":[0.9985215,0.0000011956374,0.00032074907,0.0005008317,0.00010564814,0.000060221246,0.000034260793,0.000019856265,0.00043571385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809426,0.0002875177,0.00029807416,0.00054198713,0.00037081775,0.00040736987],"domain_scores_gemma":[0.99801046,0.0011358602,0.0001386173,0.0004597502,0.00010930222,0.0001459952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054333534,0.00023168552,0.0003235989,0.00018238102,0.00018893165,0.00018634467,0.0002944116,0.00012299279,0.000028077506],"category_scores_gemma":[0.0002638919,0.00021662627,0.000081826445,0.00043997576,0.000060046186,0.00019649738,0.00005361199,0.00014638595,0.00047919454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035585465,0.0010952177,0.026345225,0.00041151667,0.0018171071,0.0022342054,0.0033268852,0.57464814,0.10613787,0.122329436,0.049170718,0.108925104],"study_design_scores_gemma":[0.0032926663,0.00018008982,0.03309611,0.000059080096,0.000030830335,0.000003478103,0.00005025636,0.9613949,0.000383204,0.00059268944,0.00065404415,0.00026262918],"about_ca_topic_score_codex":0.00011114209,"about_ca_topic_score_gemma":0.000014984065,"teacher_disagreement_score":0.7687929,"about_ca_system_score_codex":0.00005970588,"about_ca_system_score_gemma":0.00006575954,"threshold_uncertainty_score":0.8833763},"labels":[],"label_agreement":null},{"id":"W4327705382","doi":"10.1109/tcns.2022.3203360","title":"Resilient Distributed State Estimation for LTI Systems Under Time-Varying Deception Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Observability; Computer science; Network topology; Control theory (sociology); LTI system theory; Detector; State (computer science); Convergence (economics); Linear system; Algorithm; Mathematics; Control (management); Artificial intelligence","score_opus":0.0215846529145851,"score_gpt":0.26081721352767195,"score_spread":0.23923256061308684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327705382","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021363096,0.00033674057,0.9858496,0.00032412735,0.005749895,0.0035055433,0.001097896,0.00095927226,0.000040568724],"genre_scores_gemma":[0.9970491,0.000020641759,0.00056613673,0.000036934485,0.00023116586,0.0012277885,0.00017360847,0.00005903337,0.00063560525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99531806,0.0005702745,0.0014968636,0.0008185966,0.0008595268,0.0009366964],"domain_scores_gemma":[0.9960337,0.0013401589,0.00079711294,0.0010601507,0.0005237456,0.0002450856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00168732,0.00046508672,0.00095282367,0.00037142204,0.00047291853,0.00040333273,0.0008122546,0.0002427901,0.000004429471],"category_scores_gemma":[0.000029062987,0.00046030368,0.00037506098,0.0014067823,0.00006181094,0.0006099368,0.0000061971296,0.00024055051,0.00026917306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019993747,0.00011047307,0.000016841235,0.00019892944,0.00033704162,0.000005806003,0.00008120632,0.9891001,0.0016307933,0.0006942278,0.0051035867,0.00252105],"study_design_scores_gemma":[0.0037327174,0.00029265133,0.00012632688,0.0005185862,0.000114868475,0.000016829486,0.000050641735,0.99338216,0.00017760537,0.00012001736,0.0010653544,0.0004022513],"about_ca_topic_score_codex":0.00012168341,"about_ca_topic_score_gemma":0.000013737568,"teacher_disagreement_score":0.9949128,"about_ca_system_score_codex":0.00039939518,"about_ca_system_score_gemma":0.00014097171,"threshold_uncertainty_score":0.9997849},"labels":[],"label_agreement":null},{"id":"W4327873639","doi":"10.48550/arxiv.2110.12217","title":"Deep Structured Teams in Arbitrary-Size Linear Networks: Decentralized\\n Estimation, Optimal Control and Separation Principle","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Kalman filter; Curse of dimensionality; Mathematical optimization; Mathematics; Computer science; Optimal control; Separation principle; Linear system; Deep learning; Control theory (sociology); Nonlinear system; Artificial intelligence; Control (management)","score_opus":0.020027700006117,"score_gpt":0.20767891775890227,"score_spread":0.18765121775278526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327873639","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25896853,0.0003261768,0.7391798,0.00006533416,0.00049903075,0.00071395014,0.000017249913,0.0001610846,0.00006887903],"genre_scores_gemma":[0.9872145,0.00013083518,0.01222751,0.000105073,0.0000732766,0.0000068444365,0.00012180087,0.000022405395,0.00009776152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694633,0.00042388626,0.00051018625,0.0013886711,0.00017257586,0.0005583184],"domain_scores_gemma":[0.9977312,0.0002501528,0.00044946137,0.0010798003,0.0002319371,0.0002574433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003707647,0.00046490735,0.0006660349,0.00018464407,0.00014370675,0.0004101514,0.0011301951,0.0004680185,0.000022591094],"category_scores_gemma":[0.00013435971,0.00055454887,0.00017407673,0.0006623839,0.00008582119,0.0007923897,0.00075533363,0.0006734791,0.000010416871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061459315,0.000070957765,0.006677305,0.000053599615,0.00011944895,0.0002971457,0.00020975128,0.97736084,0.00003316337,0.014781119,0.000020251382,0.00031496602],"study_design_scores_gemma":[0.0028697872,0.000030096577,0.0134363985,0.00012008809,0.000078480734,0.000014613702,0.00006791469,0.981756,0.000027649403,0.0010199235,0.000092341455,0.00048675286],"about_ca_topic_score_codex":0.00020039026,"about_ca_topic_score_gemma":0.00026980092,"teacher_disagreement_score":0.728246,"about_ca_system_score_codex":0.00038684675,"about_ca_system_score_gemma":0.00031980738,"threshold_uncertainty_score":0.9996906},"labels":[],"label_agreement":null},{"id":"W4360908927","doi":"10.1007/978-3-030-54621-2_797-1","title":"Decentralized Multiobjective Optimization Algorithms","year":2022,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Computer science; Mathematical optimization; Optimization algorithm; Multi-objective optimization; Algorithm; Mathematics","score_opus":0.011294851586935417,"score_gpt":0.22428162127845347,"score_spread":0.21298676969151806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360908927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8890284e-7,0.00046815342,0.6907937,0.00009826493,0.0013529209,0.0009116652,0.00012945884,0.00023567998,0.3060099],"genre_scores_gemma":[0.00036950235,0.009668633,0.7991885,0.00013291492,0.00042166415,0.00030947805,0.0034457638,0.00025730673,0.18620625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964724,0.00013745311,0.0010599528,0.0009309329,0.0010051858,0.00039403103],"domain_scores_gemma":[0.9969106,0.00017195292,0.0013108252,0.0009332914,0.0005147307,0.00015863462],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035973205,0.0005522218,0.000748653,0.00046388392,0.00020338764,0.00010809746,0.0012173476,0.00036828071,0.001638563],"category_scores_gemma":[0.00014818774,0.0006304959,0.0002869515,0.0002783881,0.000069991605,0.0008835673,0.000402489,0.00038800976,0.000031614483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002106525,0.00006398259,0.0000071104764,0.000035610294,0.00012746282,0.00001622993,0.00029479148,0.95406705,0.0000017011799,0.03879239,0.0010371084,0.0055354997],"study_design_scores_gemma":[0.0013609035,0.000110848705,0.000007337473,0.00007873671,0.00010068928,0.000011759777,0.000013898787,0.9147009,0.000010696692,0.00039387573,0.082606725,0.00060358294],"about_ca_topic_score_codex":0.000047853504,"about_ca_topic_score_gemma":0.000002856318,"teacher_disagreement_score":0.119803645,"about_ca_system_score_codex":0.00044869998,"about_ca_system_score_gemma":0.00032470663,"threshold_uncertainty_score":0.99961466},"labels":[],"label_agreement":null},{"id":"W4360976138","doi":"10.1007/s11721-023-00225-4","title":"Effect of swarm density on collective tracking performance","year":2023,"lang":"en","type":"article","venue":"Swarm Intelligence","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Economic Development Board - Singapore","keywords":"Swarm behaviour; Computer science; Task (project management); Set (abstract data type); Collective behavior; Particle swarm optimization; Key (lock); Artificial intelligence; Machine learning; Engineering","score_opus":0.023989379168546397,"score_gpt":0.2825469802915612,"score_spread":0.25855760112301485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4360976138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8177793,0.00004370228,0.17802905,0.00009925571,0.0010569526,0.0005832356,0.000009676009,0.00043198612,0.001966826],"genre_scores_gemma":[0.999133,0.000025433126,0.00017784856,0.000045039997,0.000058133064,0.000035863617,0.0000045666375,0.000014629146,0.00050550746],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9977051,0.00024816615,0.0004245856,0.0005656409,0.0005695157,0.00048701715],"domain_scores_gemma":[0.9977949,0.0009341503,0.00020914654,0.0007482563,0.00020426005,0.00010924696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0013180274,0.00025038625,0.0003933808,0.00026203782,0.00017425352,0.00008675698,0.0012350727,0.00009417341,0.0000062063164],"category_scores_gemma":[0.00043239119,0.00021961004,0.00014405258,0.0017701259,0.00008208337,0.00031557115,0.00021943891,0.0002370218,0.0008665971],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082439044,0.0004499445,0.026475798,0.001135544,0.00040940248,0.00030200044,0.010708643,0.07349866,0.017070405,0.020256836,0.0030960809,0.8457723],"study_design_scores_gemma":[0.00024418934,0.0010700853,0.0050363853,0.00018163209,0.000013428745,0.000012003407,0.000047174533,0.19716266,0.7954509,0.00034459337,0.00017602222,0.0002608904],"about_ca_topic_score_codex":0.00004317207,"about_ca_topic_score_gemma":0.0000054777684,"teacher_disagreement_score":0.84551144,"about_ca_system_score_codex":0.00017986455,"about_ca_system_score_gemma":0.00010591885,"threshold_uncertainty_score":0.99991137},"labels":[],"label_agreement":null},{"id":"W4361009571","doi":"10.3390/s23073477","title":"Event-Triggered Sliding Mode Neural Network Controller Design for Heterogeneous Multi-Agent Systems","year":2023,"lang":"en","type":"article","venue":"Sensors","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Robustness (evolution); Control theory (sociology); Computer science; Artificial neural network; Robust control; Multi-agent system; Protocol (science); Controller (irrigation); Consensus; Sliding mode control; Upper and lower bounds; Control system; Control (management); Engineering; Artificial intelligence; Nonlinear system; Mathematics","score_opus":0.06299225844506787,"score_gpt":0.2922016420874506,"score_spread":0.22920938364238272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361009571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03597395,0.0006041442,0.9540815,0.0003582813,0.004374896,0.0031946097,0.000088048444,0.0013049217,0.000019671217],"genre_scores_gemma":[0.9929673,0.000015724865,0.0043696905,0.00012907197,0.0005326095,0.0005359624,0.000034852354,0.0000664958,0.0013482652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958,0.00060254446,0.00082864676,0.0009084676,0.0005359131,0.0013244271],"domain_scores_gemma":[0.9975256,0.0007649377,0.00035319186,0.0008275185,0.00022391714,0.0003048715],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001132077,0.0004407629,0.00070625794,0.00019834515,0.00041531655,0.00048204616,0.0010786479,0.00018402807,0.0000019724184],"category_scores_gemma":[0.00020352796,0.00041131797,0.0003786411,0.00077133975,0.00002864045,0.00023051315,0.00018299943,0.00016135996,0.0002977574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006347124,0.0000405568,0.00006370664,0.00004136344,0.00016604729,0.00008836587,0.00022333131,0.9913228,0.0013713305,0.0010302691,0.004703551,0.0008851845],"study_design_scores_gemma":[0.0030219778,0.00010498716,0.00007878295,0.00006194104,0.000036521673,0.00003362058,0.0000659765,0.9932472,0.00034251556,0.000117838885,0.002456082,0.00043255134],"about_ca_topic_score_codex":0.000086424676,"about_ca_topic_score_gemma":0.0000087254175,"teacher_disagreement_score":0.9569934,"about_ca_system_score_codex":0.00019197227,"about_ca_system_score_gemma":0.00006526755,"threshold_uncertainty_score":0.9998339},"labels":[],"label_agreement":null},{"id":"W4362681493","doi":"10.1109/tsipn.2023.3264992","title":"Fault Estimation and Fault-Tolerant Tracking Control for Multi-Agent Systems With Lipschitz Nonlinearities Using Double Periodic Event-Triggered Mechanism","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Signal and Information Processing over Networks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Lipschitz continuity; Observer (physics); Weighting; Computer science; Controller (irrigation); Nonlinear system; Linear matrix inequality; Fault tolerance; Mathematics; Control (management); Mathematical optimization; Distributed computing; Artificial intelligence","score_opus":0.028352130626289395,"score_gpt":0.26372716779618194,"score_spread":0.23537503716989255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362681493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016238892,0.00017676361,0.98150504,0.00007460669,0.00046260166,0.0011236789,0.000072032875,0.0003381735,0.000008227413],"genre_scores_gemma":[0.9939081,0.000026359645,0.005506319,0.0001570903,0.000059072776,0.0002426745,0.000037885482,0.000018318446,0.00004415913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981837,0.000053513235,0.0006537105,0.0003060659,0.0003977364,0.00040522125],"domain_scores_gemma":[0.9989358,0.00009753396,0.0003669899,0.00016935465,0.00029064258,0.00013963801],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047172236,0.0002945899,0.0003565506,0.00029910382,0.00092298345,0.0015254577,0.00018592882,0.00016172949,0.0000020404327],"category_scores_gemma":[0.0000038736102,0.0002519655,0.00007057806,0.00048638563,0.000055930504,0.0043666195,0.000004431985,0.00022664118,0.0000041145513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019296265,0.0000421601,0.000008141631,0.0002746059,0.000062777486,0.0000016676557,0.0011184192,0.95005375,0.00013729345,0.0003857763,0.000011799022,0.047710646],"study_design_scores_gemma":[0.004992874,0.00014805187,0.000061360704,0.00047936518,0.0000722624,0.000033939534,0.00042170132,0.9930649,0.00027384429,0.000024979727,0.000117212665,0.00030954793],"about_ca_topic_score_codex":0.00006160775,"about_ca_topic_score_gemma":0.000007323958,"teacher_disagreement_score":0.97766924,"about_ca_system_score_codex":0.000084659696,"about_ca_system_score_gemma":0.00011816416,"threshold_uncertainty_score":0.99999326},"labels":[],"label_agreement":null},{"id":"W4366274198","doi":"10.21203/rs.3.rs-2806476/v1","title":"A Multi-model Distributed Controller for Swarm Navigation: Obstacle Clearance Strategy","year":2023,"lang":"en","type":"preprint","venue":"Research Square","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Obstacle; Swarm behaviour; Controller (irrigation); Obstacle avoidance; Computer science; Position (finance); Path (computing); Control theory (sociology); Boundary (topology); Robot; Distributed computing; Control (management); Mobile robot; Artificial intelligence; Mathematics; Computer network; Business; Geography","score_opus":0.20820748665144007,"score_gpt":0.4308212205386929,"score_spread":0.2226137338872528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366274198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039677587,0.00089583325,0.9786085,0.002187464,0.00086466526,0.0065370793,0.0057311673,0.0011296435,0.00007791767],"genre_scores_gemma":[0.97799635,0.00006238836,0.011535901,0.000037656377,0.00041472595,0.005030432,0.002185315,0.00012573175,0.0026114732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918038,0.0007926604,0.0010770303,0.0021613664,0.0022599294,0.001905178],"domain_scores_gemma":[0.9925667,0.001245529,0.00040248,0.0023735,0.002867796,0.0005439886],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.003936545,0.00062870793,0.0010157012,0.0004408932,0.0006702089,0.0017239037,0.004090084,0.0007403532,0.0000058784367],"category_scores_gemma":[0.0012153187,0.00062904874,0.0005963793,0.0011915313,0.00020636246,0.00047833277,0.0023575434,0.0019522761,0.00045757616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006951335,0.0012700998,0.00045527477,0.005301912,0.00089976983,0.00030121635,0.0017842639,0.9008774,0.0025773058,0.03417583,0.035424065,0.016237687],"study_design_scores_gemma":[0.0036801167,0.00016540501,0.0017580019,0.0009679426,0.000017732486,0.000004637687,0.00018698417,0.98239774,0.00021285357,0.0077044163,0.002306967,0.0005972198],"about_ca_topic_score_codex":0.00038618053,"about_ca_topic_score_gemma":0.00007426001,"teacher_disagreement_score":0.97402865,"about_ca_system_score_codex":0.0008276547,"about_ca_system_score_gemma":0.0011543621,"threshold_uncertainty_score":0.9996161},"labels":[],"label_agreement":null},{"id":"W4367055710","doi":"10.1049/cth2.12476","title":"Distributed adaptive event‐triggered fault‐tolerant cooperative control of multiple UAVs and UGVs under DoS attacks","year":2023,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qinglan Project of Jiangsu Province of China; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Denial-of-service attack; Control theory (sociology); Computer science; Bounded function; Actuator; Scheme (mathematics); Fault tolerance; Lyapunov function; Event (particle physics); Tracking (education); Control (management); Distributed computing; Mathematics; The Internet; Artificial intelligence","score_opus":0.014052260023947986,"score_gpt":0.2576108668229219,"score_spread":0.2435586067989739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367055710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011309317,0.00062594283,0.9820465,0.0011392584,0.00008521053,0.0022057327,0.0021883594,0.0002862285,0.000113442504],"genre_scores_gemma":[0.99782443,0.000040661736,0.0001658361,0.0002760601,0.000077441204,0.0013095762,0.00014891714,0.000019598314,0.00013744988],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997373,0.0005805021,0.00062328955,0.0006882962,0.00028186233,0.00045306116],"domain_scores_gemma":[0.99616265,0.0022604517,0.00031996617,0.00069408555,0.00033518887,0.00022766818],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010742982,0.00032203426,0.0006203375,0.00013463231,0.00038626813,0.00014292603,0.0005652952,0.0001462774,0.000008353042],"category_scores_gemma":[0.00016127992,0.00028267136,0.00012381193,0.00069501,0.00029316783,0.00032416784,0.00012264121,0.00020255418,0.000058011105],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005847652,0.0003233223,0.000783983,0.00005091612,0.00068624585,0.000011848668,0.00067927036,0.01164178,0.015727794,0.95510185,0.00040220443,0.0140060345],"study_design_scores_gemma":[0.020257046,0.00032816688,0.011430444,0.00011100461,0.00027134933,0.000028045524,0.001768496,0.9103545,0.0010746048,0.04613422,0.0073590577,0.00088306196],"about_ca_topic_score_codex":0.00002195977,"about_ca_topic_score_gemma":0.000010901153,"teacher_disagreement_score":0.98651516,"about_ca_system_score_codex":0.00004295903,"about_ca_system_score_gemma":0.00008100781,"threshold_uncertainty_score":0.99996257},"labels":[],"label_agreement":null},{"id":"W4367663078","doi":"10.1109/tcns.2023.3272291","title":"Dual-Stage Heterogeneous Multiagent Systems Surrounding Control for a Motional Target","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Dual (grammatical number); Computer science; Stage (stratigraphy); Multi-agent system; Control system; Control (management); Control theory (sociology); Engineering; Artificial intelligence; Electrical engineering","score_opus":0.02893360317998349,"score_gpt":0.2551357552760707,"score_spread":0.22620215209608718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367663078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017129778,0.00099151,0.97506964,0.00024184724,0.014418432,0.0047333376,0.0018446464,0.0009210386,0.00006657796],"genre_scores_gemma":[0.99462175,0.000021157672,0.00047739755,0.000086991735,0.000918647,0.002487563,0.000044063763,0.00008962625,0.0012528285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9937576,0.00083258044,0.0018152468,0.0010771068,0.0011575038,0.0013599556],"domain_scores_gemma":[0.99467546,0.0022136762,0.0008960467,0.0012374226,0.0005905642,0.00038682998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0024767155,0.0006428604,0.0014533087,0.000500455,0.0005925071,0.00046731145,0.0010460392,0.0003318185,0.000010812335],"category_scores_gemma":[0.00004386367,0.0006319728,0.00076486147,0.0010939951,0.000085045685,0.00049728696,0.0000067474357,0.0003159529,0.00014673438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022969015,0.00020163176,0.00009387554,0.0002922376,0.00091462315,0.000059985432,0.000100802536,0.99099386,0.0015900274,0.003703393,0.0013647134,0.00045517072],"study_design_scores_gemma":[0.008131086,0.0004016753,0.0000748865,0.0003303202,0.0001308471,0.0000661525,0.000084643914,0.98339564,0.00014338094,0.00003397486,0.0066763014,0.00053109357],"about_ca_topic_score_codex":0.00021155333,"about_ca_topic_score_gemma":0.000026715019,"teacher_disagreement_score":0.9929088,"about_ca_system_score_codex":0.0003581983,"about_ca_system_score_gemma":0.00019075417,"threshold_uncertainty_score":0.99961317},"labels":[],"label_agreement":null},{"id":"W4368232757","doi":"10.1109/tii.2023.3272666","title":"Distributed Leader Follower Formation Control of Mobile Robots Based on Bioinspired Neural Dynamics and Adaptive Sliding Innovation Filter","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backstepping; Control theory (sociology); Robustness (evolution); Sliding mode control; Mobile robot; Computer science; Control engineering; Estimator; Robust control; Filter (signal processing); Adaptive control; Robot; Engineering; Control system; Control (management); Artificial intelligence; Nonlinear system; Mathematics","score_opus":0.0554487684065851,"score_gpt":0.2563756124094012,"score_spread":0.2009268440028161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368232757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03956016,0.0000017176618,0.95657915,0.0003405243,0.0011635212,0.0010714954,0.0009099122,0.0002920156,0.00008152851],"genre_scores_gemma":[0.9986796,0.0000017431453,0.0006906674,0.00017367366,0.00004032315,0.00016750208,0.00019861611,0.000015251648,0.00003266015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975588,0.00011414138,0.0011985591,0.00019236896,0.0005577227,0.00037846205],"domain_scores_gemma":[0.9981823,0.00039607266,0.0005840209,0.00045390727,0.0002925037,0.00009120385],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056078203,0.00028065304,0.00039956116,0.00078492484,0.00023639087,0.00018406055,0.0003643629,0.00028789425,0.000006149017],"category_scores_gemma":[0.00005216592,0.00026833705,0.00011826414,0.0021894674,0.000053563577,0.0013997598,0.0000056612457,0.0004087553,0.00002952897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023569135,0.0001379534,0.000033852673,0.00004794384,0.000078675526,0.0000028998752,0.0006914576,0.963995,0.00035123972,0.0014560126,0.0005155574,0.032453746],"study_design_scores_gemma":[0.004352157,0.00053975504,0.00004943584,0.00011988559,0.000038902283,0.000003518321,0.0005625311,0.98973477,0.004266917,0.000017287937,0.00007531664,0.00023955037],"about_ca_topic_score_codex":0.000020300817,"about_ca_topic_score_gemma":0.0000076063166,"teacher_disagreement_score":0.9591194,"about_ca_system_score_codex":0.0002459571,"about_ca_system_score_gemma":0.00010308248,"threshold_uncertainty_score":0.9999769},"labels":[],"label_agreement":null},{"id":"W4376481262","doi":"10.1109/tmech.2023.3270819","title":"Event-Based Secure Consensus Control for Multirobot Systems With Cooperative Localization Against DoS Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Robot; Event (particle physics); Computer science; Position (finance); Consensus; Synchronization (alternating current); Consensus algorithm; Computer network; Distributed computing; Artificial intelligence; Multi-agent system; Algorithm","score_opus":0.018120083022796243,"score_gpt":0.25737712123443435,"score_spread":0.2392570382116381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376481262","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013810374,0.00009033273,0.9899874,0.0011458957,0.0019871735,0.0032854215,0.0010392487,0.0010630218,0.000020513593],"genre_scores_gemma":[0.9951993,0.00001404005,0.0023804358,0.00034048085,0.00009024538,0.0013341213,0.00019520351,0.00007585292,0.00037029927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964958,0.000367531,0.00070159574,0.0009131224,0.00068522734,0.00083674496],"domain_scores_gemma":[0.9972142,0.0006256424,0.00031282706,0.0009470761,0.0006444793,0.00025576304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00065483,0.0005102693,0.00060460815,0.00036322488,0.00065496116,0.00035695444,0.00069059414,0.00027635138,0.0000052964187],"category_scores_gemma":[0.00003135152,0.0004560028,0.00024976936,0.0011913077,0.000083534476,0.0002850721,0.000004549137,0.00036409262,0.00020255368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020995297,0.0002020936,0.000010105525,0.00010500262,0.00024101534,0.000019871117,0.00019045234,0.99261475,0.001155719,0.0032455737,0.00072087,0.0012846001],"study_design_scores_gemma":[0.007905886,0.0005994309,0.0000050047693,0.00019114501,0.00009868299,0.000009495783,0.00030971915,0.9842988,0.0022891178,0.000021905398,0.003756628,0.0005141843],"about_ca_topic_score_codex":0.000043392643,"about_ca_topic_score_gemma":0.00012476573,"teacher_disagreement_score":0.9938183,"about_ca_system_score_codex":0.00044315658,"about_ca_system_score_gemma":0.0005377966,"threshold_uncertainty_score":0.9997892},"labels":[],"label_agreement":null},{"id":"W4377000432","doi":"10.1109/tcsi.2023.3274191","title":"Distributed Fault Detection and Dynamic Event-Triggered Consensus for Heterogeneous Multiagent Systems Under Deception Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing Municipal Natural Science Foundation; National Natural Science Foundation of China","keywords":"Deception; Computer science; Observer (physics); Control theory (sociology); Multi-agent system; Lyapunov stability; Information exchange; Linear matrix inequality; Consensus; Bernoulli distribution; Fault (geology); Distributed computing; Random variable; Control (management); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.02193196704628385,"score_gpt":0.2554640295382822,"score_spread":0.23353206249199832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4377000432","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10282452,0.00067148276,0.88973993,0.00020132183,0.003082881,0.002256503,0.0006123983,0.00059661875,0.000014339797],"genre_scores_gemma":[0.9984512,0.00013512743,0.000030006837,0.000033099925,0.000057904133,0.00070023705,0.000058431484,0.000049942217,0.00048405924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966611,0.00038199322,0.0007841435,0.0009947893,0.0005257773,0.00065216],"domain_scores_gemma":[0.99805933,0.0003676112,0.0002936675,0.0006772068,0.00021334525,0.00038883367],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007028034,0.000446711,0.0005896373,0.00035486565,0.00072393613,0.0005488168,0.0002998277,0.00032258965,0.0000017189194],"category_scores_gemma":[0.00002794018,0.00043083195,0.00021914694,0.0005943961,0.00010249621,0.00019237667,0.0000064077117,0.00019321985,0.000026520982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009583505,0.00023013083,0.000023663293,0.00092724053,0.00096022105,0.000074072246,0.0006766056,0.7226417,0.18988265,0.00068794924,0.00024027757,0.08355967],"study_design_scores_gemma":[0.0027461464,0.00028668984,0.00032269588,0.00024140322,0.00012230554,0.00032226616,0.0009337523,0.99096,0.0014651554,0.000027753347,0.0019992113,0.000572612],"about_ca_topic_score_codex":0.00016166641,"about_ca_topic_score_gemma":0.00012090669,"teacher_disagreement_score":0.89562666,"about_ca_system_score_codex":0.00033266106,"about_ca_system_score_gemma":0.000073374445,"threshold_uncertainty_score":0.99981433},"labels":[],"label_agreement":null},{"id":"W4378191602","doi":"10.1109/syscon53073.2023.10131115","title":"Assessment of Distributed Flocking Algorithms for Multi-Fixed-Wings UAVs using SIL Simulation","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Flocking (texture); Computer science; Aerodynamics; Underactuation; Nonlinear system; MATLAB; Software; Algorithm; Distributed computing; Simulation; Robot; Aerospace engineering; Artificial intelligence; Engineering; Operating system","score_opus":0.12083659391835319,"score_gpt":0.38790696136540953,"score_spread":0.26707036744705637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378191602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023605103,0.000014193412,0.97396743,0.000110764064,0.0006871395,0.00081136345,0.00019629551,0.0005552171,0.000052478506],"genre_scores_gemma":[0.8432956,8.394275e-7,0.15625669,0.000028496352,0.0000750783,0.000046268506,0.00017523018,0.000018575742,0.00010326786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977038,0.000086662905,0.0006603291,0.00054171664,0.0005011729,0.0005063501],"domain_scores_gemma":[0.99813926,0.00043397702,0.00032693648,0.0005903471,0.00039854375,0.00011094022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082971336,0.0002233905,0.00038679622,0.0002171839,0.00019676064,0.00018261973,0.0007144767,0.000108660584,0.000005547856],"category_scores_gemma":[0.00019904265,0.0002134695,0.00018653568,0.0010423973,0.000028294371,0.00057338027,0.00026152356,0.000090561836,0.0000112497055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073469823,0.0001851593,0.006869059,0.0001408956,0.0001473629,0.000010834572,0.0002612701,0.9485389,0.020975078,0.008977327,0.00024615097,0.013640634],"study_design_scores_gemma":[0.0015236299,0.000044552184,0.01239047,0.000056707868,0.000022185988,0.0000015476152,0.000090765214,0.9835795,0.0012863023,0.00010880461,0.0006621397,0.00023335915],"about_ca_topic_score_codex":0.00015432543,"about_ca_topic_score_gemma":0.00000979701,"teacher_disagreement_score":0.81969047,"about_ca_system_score_codex":0.00020413302,"about_ca_system_score_gemma":0.0001235328,"threshold_uncertainty_score":0.87050337},"labels":[],"label_agreement":null},{"id":"W4378191837","doi":"10.1109/syscon53073.2023.10131085","title":"An Algorithm for Flock Formation Control using Distributed Consensus","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Flocking (texture); Computer science; Algorithm; Consensus algorithm; A priori and a posteriori; Control theory (sociology); Control (management); Artificial intelligence","score_opus":0.03507484617500893,"score_gpt":0.2912333924779123,"score_spread":0.25615854630290336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378191837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005040289,0.00001372881,0.9908884,0.00058280036,0.0006521228,0.000959356,0.00067278976,0.0011307015,0.00005982059],"genre_scores_gemma":[0.93051386,7.264276e-7,0.0684915,0.0001842713,0.00015564523,0.000113539165,0.00043357303,0.00001725631,0.00008964745],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824524,0.000112318936,0.0004386972,0.00038341238,0.00029331885,0.000527018],"domain_scores_gemma":[0.9985547,0.0002337995,0.00015881157,0.00059366005,0.00028825414,0.00017074724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005903473,0.00018211427,0.0002657852,0.00014469092,0.00023752866,0.0003275354,0.00063270214,0.000092267415,0.0000047325043],"category_scores_gemma":[0.00008136873,0.0001691845,0.00010780863,0.000625878,0.00002480686,0.0006116883,0.00005581784,0.00006213948,0.000100268764],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014030155,0.00068972557,0.000855347,0.0002550109,0.0006295761,0.00020439365,0.0013169758,0.09620824,0.09024013,0.09188555,0.065468915,0.65210587],"study_design_scores_gemma":[0.0024226205,0.000076116645,0.00032588368,0.000011358719,0.000016761369,0.000023454704,0.00010595897,0.9926387,0.0010903248,0.0005091821,0.0025615927,0.00021801432],"about_ca_topic_score_codex":0.00006662352,"about_ca_topic_score_gemma":0.00001004617,"teacher_disagreement_score":0.9254736,"about_ca_system_score_codex":0.00011643871,"about_ca_system_score_gemma":0.0000713871,"threshold_uncertainty_score":0.68991435},"labels":[],"label_agreement":null},{"id":"W4378220299","doi":"10.1002/asjc.3120","title":"Distributed dynamic matrix control with constrained optimization for collision and obstacle avoidance of simulated multiple quadcopters","year":2023,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Collision avoidance; Obstacle avoidance; Computer science; Control theory (sociology); Collision; Obstacle; Control (management); Mathematical optimization; Mathematics; Mobile robot; Robot; Artificial intelligence","score_opus":0.005512750932837378,"score_gpt":0.23492331845065156,"score_spread":0.2294105675178142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378220299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04593071,0.00020652967,0.9499739,0.0019929523,0.00026459762,0.0010511365,0.00048968487,0.000081259976,0.000009239516],"genre_scores_gemma":[0.99228597,0.000009572822,0.007528279,0.00004528698,0.000034591074,0.000016097012,0.000037036687,0.000022130509,0.000021017513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976394,0.00021018433,0.0009910623,0.0002914123,0.00045507692,0.0004128523],"domain_scores_gemma":[0.99645656,0.0008812565,0.0012398749,0.0003321902,0.00087005034,0.0002200769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087876566,0.00025170727,0.000765115,0.00027716253,0.00012900344,0.00014638793,0.0005511191,0.00011070632,0.0000032492553],"category_scores_gemma":[0.0005751428,0.00020598763,0.00017134346,0.0006259378,0.00012027601,0.00059890095,0.000025882357,0.00015820416,0.0000028658694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013758937,0.000090304115,0.0025096855,0.00007760821,0.00041660812,0.000073066665,0.00025499947,0.9877952,0.0037757326,0.00049278454,0.00014200414,0.00299611],"study_design_scores_gemma":[0.024927104,0.00073148916,0.0032641029,0.000195745,0.00011436543,0.00008136023,0.00026056555,0.9698694,0.00015815583,0.000078196754,0.000118538876,0.00020101212],"about_ca_topic_score_codex":0.0000061807964,"about_ca_topic_score_gemma":0.0000050748845,"teacher_disagreement_score":0.9463553,"about_ca_system_score_codex":0.00008679773,"about_ca_system_score_gemma":0.00019562445,"threshold_uncertainty_score":0.8399932},"labels":[],"label_agreement":null},{"id":"W4378232224","doi":"10.22541/au.168499086.69554621/v1","title":"Fixed-time Event-Based Consensus Tracking for Networked Euler-Lagrange Systems with Limited-time State Constraint.","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Backstepping; Zeno's paradoxes; Control theory (sociology); Computer science; Convergence (economics); Constraint (computer-aided design); Observer (physics); Discrete time and continuous time; Mathematical optimization; Control (management); Mathematics; Adaptive control; Artificial intelligence","score_opus":0.038790367531049585,"score_gpt":0.256196492500132,"score_spread":0.2174061249690824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378232224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035169527,0.0003910196,0.97772187,0.0016646767,0.003658728,0.0065431595,0.0020361184,0.0037011444,0.00076634175],"genre_scores_gemma":[0.95970535,0.0000117281115,0.024796177,0.0003497944,0.0008294522,0.002684314,0.0020531076,0.00037084814,0.009199255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99201113,0.000748853,0.0018554333,0.0024440712,0.0012241829,0.0017163098],"domain_scores_gemma":[0.99115753,0.0029896365,0.0015427504,0.0026677279,0.001087337,0.0005550078],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002403061,0.0012783023,0.001988686,0.0005221265,0.00033804396,0.0019755058,0.0028581517,0.0006591197,0.000034697245],"category_scores_gemma":[0.00020215106,0.0011133786,0.0006769737,0.0008463437,0.0002581455,0.00021841767,0.0007045213,0.0008380153,0.0007859808],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041426552,0.00037110125,0.00025633175,0.0016937444,0.0022420215,0.0005678775,0.00029828146,0.9401805,0.0012980347,0.0017145465,0.04257479,0.00838852],"study_design_scores_gemma":[0.0038628902,0.00025711756,0.00012314235,0.0016806667,0.00021456432,0.000047012356,0.000077852026,0.9886735,0.00016394454,0.00013565876,0.0033557808,0.0014078885],"about_ca_topic_score_codex":0.0006027759,"about_ca_topic_score_gemma":0.00009987605,"teacher_disagreement_score":0.9561884,"about_ca_system_score_codex":0.0004277158,"about_ca_system_score_gemma":0.0011824889,"threshold_uncertainty_score":0.9999969},"labels":[],"label_agreement":null},{"id":"W4378977491","doi":"10.1016/j.ins.2023.119276","title":"Refined fault tolerant tracking control of fixed-wing UAVs via fractional calculus and interval type-2 fuzzy neural network under event-triggered communication","year":2023,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Computer science; Fault tolerance; Interval (graph theory); Fuzzy logic; Event (particle physics); Tracking (education); Artificial neural network; Synchronization (alternating current); Fault (geology); Real-time computing; Control (management); Distributed computing; Mathematics; Computer network; Artificial intelligence","score_opus":0.03363522350224157,"score_gpt":0.29347387469805825,"score_spread":0.2598386511958167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378977491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13458684,0.00018528331,0.85927534,0.0034819539,0.0010582387,0.00038953612,0.000019125006,0.00024164107,0.00076204294],"genre_scores_gemma":[0.9986663,0.000009767144,0.00079571945,0.000423465,0.000041194457,0.000015807995,0.000028989052,0.0000026287998,0.000016139658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981206,0.000156783,0.0006747464,0.00016886,0.000594719,0.00028427778],"domain_scores_gemma":[0.9985017,0.0003664311,0.00047142807,0.0002969646,0.00029400492,0.00006945953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015562396,0.00012224392,0.00021483313,0.00020377977,0.00040371384,0.00040988624,0.0007340386,0.00006340824,0.000008028773],"category_scores_gemma":[0.00015772381,0.00010483134,0.000058995975,0.0012131453,0.00014233876,0.0036635287,0.00015221418,0.00012486299,0.000044532026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007958097,0.00004738076,0.0041721747,0.00006699062,0.000084878375,0.0000022591971,0.003833265,0.8139286,0.001790109,0.038267795,0.0022631253,0.13546385],"study_design_scores_gemma":[0.0006818672,0.000057733374,0.0231375,0.00005491032,0.0000065749127,0.000010460911,0.00042506872,0.9734278,0.000069590154,0.0009139368,0.0010955489,0.00011901326],"about_ca_topic_score_codex":0.00016328793,"about_ca_topic_score_gemma":0.00003657001,"teacher_disagreement_score":0.8640794,"about_ca_system_score_codex":0.00004880759,"about_ca_system_score_gemma":0.000086992135,"threshold_uncertainty_score":0.4274898},"labels":[],"label_agreement":null},{"id":"W4379033929","doi":"10.1109/lcsys.2023.3282021","title":"Quantized Distributed Online Projection-Free Convex Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Quantization (signal processing); Mathematical optimization; Regret; Convex function; Convex optimization; Optimization problem; Computation; Distributed algorithm; Online algorithm; Bandwidth (computing); Convergence (economics); Regular polygon; Algorithm; Mathematics; Distributed computing; Computer network","score_opus":0.01990068372436155,"score_gpt":0.24061035831735153,"score_spread":0.22070967459298999,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379033929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010461707,0.00012477957,0.9671155,0.009096756,0.0074330885,0.0020917684,0.0009946882,0.0026270158,0.000054651962],"genre_scores_gemma":[0.9957546,0.000010535406,0.0008700124,0.0011327065,0.0008389329,0.0005389624,0.0005488413,0.000061373554,0.00024403293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99533695,0.0006489457,0.0011115185,0.0009695747,0.00096440385,0.0009685975],"domain_scores_gemma":[0.99654,0.00045638697,0.0005970475,0.0017926298,0.00035796588,0.00025593583],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010556295,0.00048080517,0.00085636636,0.0004706554,0.0003095571,0.000735947,0.002063808,0.00020702582,0.000005395948],"category_scores_gemma":[0.00039972697,0.00046098288,0.00023706471,0.0020347422,0.00007840392,0.0008287725,0.00013366668,0.0002848688,0.0003089674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008005846,0.00013926701,0.000958165,0.0001433619,0.00041246213,0.0001987788,0.0001768239,0.8612577,0.032470398,0.0019699666,0.10183888,0.00035418104],"study_design_scores_gemma":[0.0068776887,0.00005841006,0.0008098726,0.00011174237,0.0000485247,0.00004582136,0.0000802737,0.9857529,0.00006492221,0.000010826157,0.0056365505,0.0005024715],"about_ca_topic_score_codex":0.0005121994,"about_ca_topic_score_gemma":0.00002320422,"teacher_disagreement_score":0.9852929,"about_ca_system_score_codex":0.00029651835,"about_ca_system_score_gemma":0.00012894123,"threshold_uncertainty_score":0.9997842},"labels":[],"label_agreement":null},{"id":"W4379033969","doi":"10.1109/lcsys.2023.3281894","title":"Data-Driven Event-Triggered Bipartite Consensus for Multi-Agent Systems Preventing DoS Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Higher Education Discipline Innovation Project","keywords":"Bipartite graph; Computer science; Consensus; Lyapunov function; Multi-agent system; Graph theory; Linearization; Distributed computing; Theoretical computer science; Control theory (sociology); Mathematical optimization; Graph; Nonlinear system; Mathematics; Artificial intelligence; Control (management)","score_opus":0.08871966394969565,"score_gpt":0.318000305138985,"score_spread":0.2292806411892893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379033969","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025768578,0.0011583938,0.93913275,0.00308706,0.017529296,0.0081464015,0.0031330723,0.002016619,0.000027826827],"genre_scores_gemma":[0.9928512,0.000010433692,0.00092822,0.0006391537,0.0014348375,0.002360198,0.00047425175,0.00012905707,0.001172648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9911219,0.0012530513,0.0023120563,0.0021108557,0.0012189654,0.0019831862],"domain_scores_gemma":[0.99262875,0.0012887728,0.0014117868,0.003724221,0.00042518965,0.00052129466],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036752017,0.0008292309,0.001554585,0.00056993513,0.0005778926,0.0014935522,0.0041001868,0.00030397574,0.0000017881857],"category_scores_gemma":[0.00047001292,0.0008030009,0.0004732369,0.0010950747,0.00011376759,0.0008155524,0.0004024278,0.000359863,0.0009923464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016722933,0.00032417072,0.0023481546,0.0017856115,0.0024919773,0.0006519054,0.0006549059,0.51935405,0.16381982,0.0020330083,0.30522302,0.0011461444],"study_design_scores_gemma":[0.008207761,0.00007058564,0.00030272783,0.0004984587,0.00016495904,0.00006078992,0.00014835701,0.942427,0.00007075356,0.0000028935833,0.04722349,0.0008222433],"about_ca_topic_score_codex":0.00043771276,"about_ca_topic_score_gemma":0.00004931187,"teacher_disagreement_score":0.9670826,"about_ca_system_score_codex":0.00041448555,"about_ca_system_score_gemma":0.000208791,"threshold_uncertainty_score":0.9997855},"labels":[],"label_agreement":null},{"id":"W4379509038","doi":"10.1007/s10846-023-01881-8","title":"A Concurrent Mission-Planning Methodology for Robotic Swarms Using Collaborative Motion-Control Strategies","year":2023,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Swarm behaviour; Robot; Swarm robotics; Motion planning; Plan (archaeology); Task (project management); Computer science; Engineering; Control (management); Distributed computing; Artificial intelligence; Simulation; Control engineering; Systems engineering; Geography","score_opus":0.15148744781513676,"score_gpt":0.3849910843342633,"score_spread":0.23350363651912656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379509038","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024701317,0.0037550118,0.9794492,0.00047404176,0.012340775,0.0013229307,0.000013512931,0.00013684851,0.000037552305],"genre_scores_gemma":[0.9858807,0.00003974903,0.012977582,0.000048360325,0.00082392356,0.000041323772,0.0000090255035,0.00004151264,0.00013785956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9943196,0.0013042704,0.002205975,0.0005147753,0.0008613514,0.00079399947],"domain_scores_gemma":[0.992611,0.0025445002,0.0021606435,0.0005020436,0.0018137483,0.000368068],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0041740215,0.00044560825,0.0014446159,0.0007709892,0.00027464892,0.0007445999,0.0013625026,0.00021549898,0.0000061543474],"category_scores_gemma":[0.0010776162,0.0003568606,0.00044321181,0.001308563,0.000075103926,0.0008776622,0.0001068224,0.00035414795,0.000042987987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004053073,0.000087450855,0.00030624747,0.00021157217,0.0005253405,0.00013402439,0.0016514419,0.98059124,0.004193699,0.0095299175,0.0012835063,0.0014450124],"study_design_scores_gemma":[0.0016309225,0.00047124317,0.00016702755,0.0009857315,0.00018662652,0.00049507734,0.007790226,0.9859294,0.0006498196,0.00059860596,0.0007255332,0.0003697388],"about_ca_topic_score_codex":0.000053466734,"about_ca_topic_score_gemma":0.0000018633816,"teacher_disagreement_score":0.98341054,"about_ca_system_score_codex":0.0004537001,"about_ca_system_score_gemma":0.0007565045,"threshold_uncertainty_score":0.99988836},"labels":[],"label_agreement":null},{"id":"W4380606948","doi":"10.1109/tfuzz.2023.3285649","title":"Adaptive Fuzzy Prescribed Performance Output-Feedback Cooperative Control for Uncertain Nonlinear Multiagent Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Fuzzy Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Fuzzy logic; Computer science; Controller (irrigation); Multi-agent system; Settling time; Fuzzy control system; Nonlinear system; Tracking error; Adaptive control; Scheme (mathematics); Boundary (topology); Tracking (education); Control (management); Mathematics; Control engineering; Artificial intelligence; Engineering","score_opus":0.04268474274792038,"score_gpt":0.25983434926040755,"score_spread":0.21714960651248716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380606948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050732284,0.00032617187,0.971999,0.0003402652,0.010867112,0.007041137,0.0021240818,0.0015460924,0.00068289426],"genre_scores_gemma":[0.9879978,0.00004539841,0.0007422401,0.00009655092,0.00046956292,0.004550209,0.000066372115,0.00010097523,0.0059309294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939674,0.0007125628,0.0014118465,0.0014370495,0.0011338282,0.0013372806],"domain_scores_gemma":[0.9955639,0.00096659234,0.00049650465,0.001525283,0.0009789425,0.0004687784],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001434142,0.000799938,0.001178034,0.0006085571,0.00087723153,0.0007618244,0.0015762135,0.00037080413,0.0000034838874],"category_scores_gemma":[0.000044954784,0.0007332415,0.00044840667,0.0015125574,0.000120632816,0.0010029499,0.000011874613,0.0004973029,0.0011185172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039069008,0.00036329415,0.000023089051,0.0004270871,0.0007270333,0.00003881751,0.001169411,0.98533094,0.0014730996,0.0015191671,0.004307012,0.004230389],"study_design_scores_gemma":[0.0057449625,0.0008599185,0.000079391284,0.0004784584,0.00011171061,0.000038669423,0.0012001544,0.9831267,0.0009132349,0.000007896894,0.00664938,0.0007895453],"about_ca_topic_score_codex":0.0006245075,"about_ca_topic_score_gemma":0.00004603479,"teacher_disagreement_score":0.9829245,"about_ca_system_score_codex":0.00060519617,"about_ca_system_score_gemma":0.00033617223,"threshold_uncertainty_score":0.99965924},"labels":[],"label_agreement":null},{"id":"W4380839101","doi":"10.1109/tcyb.2023.3281902","title":"Resilient Output Formation-Tracking of Heterogeneous Multiagent Systems Against General Byzantine Attacks: A Twin-Layer Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; Southeast University; National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Robustness (evolution); Stateless protocol; Node (physics); Resilience (materials science); Byzantine fault tolerance; Bounded function; Controller (irrigation); Computer network; Mathematics; Engineering; Fault tolerance","score_opus":0.043453194654715345,"score_gpt":0.266456956821803,"score_spread":0.22300376216708764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380839101","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109069325,0.0001311965,0.8869277,0.000093580114,0.0017902898,0.00087424635,0.0001487958,0.00048874633,0.00047611634],"genre_scores_gemma":[0.9949405,0.00008514437,0.003549924,0.000067861765,0.00009572511,0.00016937318,0.00003904662,0.000045492456,0.0010069088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99655724,0.00022681332,0.0010263359,0.0006310004,0.000914618,0.0006440135],"domain_scores_gemma":[0.9978717,0.00015572358,0.00036014096,0.0011043311,0.00029814406,0.00020995334],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048075913,0.00037538775,0.00048674614,0.00045062107,0.00022207243,0.00024401146,0.0009496759,0.0001839299,0.0000035080284],"category_scores_gemma":[0.000015161646,0.00037095408,0.0002853542,0.0009770598,0.00006399757,0.00035577334,0.000015134434,0.0002799165,0.00020849137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019325349,0.00037086467,0.000030107763,0.00014963851,0.00013693297,0.000030331754,0.0009966933,0.9811779,0.006617266,0.0003318237,0.0006256842,0.009513423],"study_design_scores_gemma":[0.0011348852,0.000113129405,0.00021166595,0.00011590729,0.00004456626,0.000042590975,0.00013474164,0.96981704,0.025745817,0.0000053778876,0.0022744832,0.00035979445],"about_ca_topic_score_codex":0.00010213433,"about_ca_topic_score_gemma":0.000018765833,"teacher_disagreement_score":0.8858712,"about_ca_system_score_codex":0.00012764525,"about_ca_system_score_gemma":0.00006778361,"threshold_uncertainty_score":0.99987423},"labels":[],"label_agreement":null},{"id":"W4380875757","doi":"10.1109/tnnls.2023.3282234","title":"Neural-Network-Based Adaptive Fault-Tolerant Cooperative Control of Heterogeneous Multiagent Systems With Multiple Faults and DoS Attacks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Neural Networks and Learning Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Qinglan Project of Jiangsu Province of China; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Backstepping; Control theory (sociology); Denial-of-service attack; Fault tolerance; Computer science; Actuator; Lyapunov stability; Artificial neural network; Lyapunov function; Nonlinear system; Adaptive control; Control engineering; Engineering; Control (management); Distributed computing; Artificial intelligence","score_opus":0.01584161497690889,"score_gpt":0.2230232192047247,"score_spread":0.2071816042278158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380875757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13137232,0.0011219159,0.86357087,0.00009560112,0.0014710893,0.0018024574,0.00007290753,0.00048612308,0.000006690768],"genre_scores_gemma":[0.9989924,0.00004411351,0.000083773615,0.00006283708,0.00016376136,0.00040339163,0.000019081943,0.000060541315,0.00017008942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954233,0.0013326433,0.0008587544,0.0009750614,0.00058022793,0.0008299971],"domain_scores_gemma":[0.9969453,0.0013694639,0.0005093998,0.0005344326,0.00031236836,0.0003289916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069542835,0.0005852196,0.000983524,0.00022628727,0.00077242136,0.000363188,0.00040130402,0.00023377142,0.0000014359695],"category_scores_gemma":[0.000016282293,0.00046629785,0.00015366988,0.00082445703,0.00017067528,0.00033351404,0.000009927605,0.0007974541,0.000007967732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039033257,0.000074408796,0.0009499828,0.00010546931,0.0002548318,0.00011347224,0.00032433853,0.99474216,0.00016994956,0.000025922052,0.000038612412,0.002810503],"study_design_scores_gemma":[0.004310787,0.0012214477,0.00052561995,0.00046329235,0.00008377473,0.00012938032,0.00030688877,0.99224645,0.000039912567,1.8074716e-7,0.00019474627,0.00047751653],"about_ca_topic_score_codex":0.0005452416,"about_ca_topic_score_gemma":0.0000853724,"teacher_disagreement_score":0.8676201,"about_ca_system_score_codex":0.00006843075,"about_ca_system_score_gemma":0.00004223298,"threshold_uncertainty_score":0.99977887},"labels":[],"label_agreement":null},{"id":"W4381327651","doi":"10.1109/lcsys.2023.3287953","title":"Bearing-Based Distributed Pose Estimation for Multi-Agent Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observer (physics); Pose; Scheme (mathematics); Computer science; Multi-agent system; Position (finance); Estimation; Graph; State (computer science); Control theory (sociology); Network topology; Topology (electrical circuits); Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Engineering; Control (management)","score_opus":0.02993182152712734,"score_gpt":0.261925939465747,"score_spread":0.23199411793861965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381327651","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046349796,0.00015291176,0.9779262,0.0040971884,0.0077625434,0.0032896327,0.0004039298,0.0017263737,0.0000062500776],"genre_scores_gemma":[0.99386275,0.0000012132441,0.0020108928,0.0012513062,0.00061184046,0.0017066106,0.00039381036,0.00006251307,0.00009908331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995778,0.00038875014,0.0010203061,0.00097023486,0.0006506056,0.0011920795],"domain_scores_gemma":[0.99695545,0.00069631415,0.000554166,0.0012147131,0.0002613465,0.00031800664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001463406,0.0005006236,0.0007585765,0.00033639494,0.00037787118,0.00080845645,0.0014016149,0.00021842237,0.0000012997257],"category_scores_gemma":[0.00023235462,0.00049491826,0.00037672074,0.0009331587,0.00006003496,0.0005191385,0.00006345755,0.00022860999,0.00022618273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047258767,0.00006852591,0.0004185947,0.00011745371,0.00016809884,0.00005711236,0.000052836138,0.96420366,0.008281236,0.00069878943,0.02502636,0.00086008146],"study_design_scores_gemma":[0.007051887,0.000060391583,0.0016220054,0.00014494543,0.000059824586,0.000009503413,0.000015169733,0.9865986,0.00009761188,0.000006631582,0.0038270685,0.0005063527],"about_ca_topic_score_codex":0.00018722893,"about_ca_topic_score_gemma":0.000017732365,"teacher_disagreement_score":0.9892278,"about_ca_system_score_codex":0.00039471284,"about_ca_system_score_gemma":0.00009856558,"threshold_uncertainty_score":0.99975026},"labels":[],"label_agreement":null},{"id":"W4382242829","doi":"10.1007/978-3-031-29933-9_17","title":"Coordinated Path-Following for Multi-Agent Fixed-Wing Aircraft","year":2023,"lang":"en","type":"book-chapter","venue":"Sustainable aviation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Fixed wing; Path (computing); Control theory (sociology); Topology (electrical circuits); Linearization; Controller (irrigation); Concatenation (mathematics); Synchronization (alternating current); Feedback linearization; Computer science; Mathematics; Control (management); Wing; Nonlinear system; Engineering; Aerospace engineering; Artificial intelligence; Physics; Computer network; Combinatorics","score_opus":0.030964419650574473,"score_gpt":0.26490792017637765,"score_spread":0.23394350052580318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382242829","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000042121635,0.00039220654,0.98184216,0.0005719563,0.0025695902,0.0034750982,0.00010537599,0.0014597833,0.009541678],"genre_scores_gemma":[0.060367987,0.000022462078,0.006595905,0.00015388001,0.0003923201,0.0006348113,0.0009791261,0.00022259982,0.9306309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99606204,0.00007418519,0.0008896088,0.0011828407,0.000700224,0.0010910721],"domain_scores_gemma":[0.99683374,0.00028245812,0.0006788375,0.0011005184,0.0009032781,0.00020115964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012430821,0.00064280344,0.000752937,0.0005528573,0.0005571661,0.00060082035,0.0012026777,0.0005860597,0.000011617128],"category_scores_gemma":[0.00050213275,0.0007148588,0.00061897247,0.0003072962,0.000027459064,0.0009113947,0.00044354642,0.00036667567,0.00033781104],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049812006,0.000081338905,0.00011014547,0.0010028244,0.0005937056,0.00071127136,0.00077835616,0.0010233128,0.0001496376,0.97684485,0.008517263,0.010137478],"study_design_scores_gemma":[0.008818837,0.00055937935,0.0006844322,0.0014249303,0.0006148722,0.00001755934,0.0012541049,0.52339154,0.00028492176,0.07246671,0.38683397,0.0036487533],"about_ca_topic_score_codex":0.00011840551,"about_ca_topic_score_gemma":0.000013192198,"teacher_disagreement_score":0.9752463,"about_ca_system_score_codex":0.0013840963,"about_ca_system_score_gemma":0.00043547407,"threshold_uncertainty_score":0.99953026},"labels":[],"label_agreement":null},{"id":"W4382243108","doi":"10.1007/978-3-031-29933-9_25","title":"Nonlinear Control of Multi-quadrotor Flight Formations","year":2023,"lang":"en","type":"book-chapter","venue":"Sustainable aviation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Backstepping; Control theory (sociology); Nonlinear system; Displacement (psychology); Constant (computer programming); Lyapunov function; Trajectory; Controller (irrigation); Lyapunov stability; Nonlinear control; Control engineering; Track (disk drive); Computer science; Frame (networking); Motion control; Control (management); Engineering; Adaptive control; Robot; Physics; Artificial intelligence","score_opus":0.015776015374259558,"score_gpt":0.23765816969146297,"score_spread":0.22188215431720343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382243108","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000009967384,0.00021367174,0.9542139,0.0005429138,0.0006719755,0.0026226947,0.00030112834,0.0005409534,0.04088276],"genre_scores_gemma":[0.07344009,0.000041081337,0.0037113742,0.000114749855,0.0003095292,0.00032551397,0.00062909996,0.00010860572,0.92131996],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997287,0.000060558905,0.00094623223,0.0005037583,0.00067065854,0.00053183263],"domain_scores_gemma":[0.996356,0.00019251466,0.0009940662,0.0010214039,0.0013119961,0.00012400633],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000660846,0.00038015933,0.0006042911,0.0005543016,0.0001963063,0.00017953172,0.000962602,0.0003959567,0.00003210506],"category_scores_gemma":[0.00024462293,0.00039532187,0.00027515256,0.00023763507,0.000045774268,0.00089314143,0.00020960125,0.00027776073,0.0005343532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001515194,0.00006254913,0.000030112293,0.00048091568,0.00018084332,0.00005544647,0.0003537861,0.00052439346,0.00005524107,0.9947263,0.0017244912,0.0017907594],"study_design_scores_gemma":[0.006419416,0.00034225994,0.00040346937,0.0004614212,0.00027438605,0.000013722476,0.00036652983,0.61980593,0.000346868,0.03969673,0.33040684,0.0014624164],"about_ca_topic_score_codex":0.000102149876,"about_ca_topic_score_gemma":0.0000172632,"teacher_disagreement_score":0.9550296,"about_ca_system_score_codex":0.00045090207,"about_ca_system_score_gemma":0.0003984104,"threshold_uncertainty_score":0.99984986},"labels":[],"label_agreement":null},{"id":"W4382360845","doi":"10.1051/sands/2023017","title":"Event-triggered resilient consensus control of multiple unmanned systems against periodic DoS attacks based on state predictor","year":2023,"lang":"en","type":"article","venue":"Security and Safety","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education, Science and Technology; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Control theory (sociology); Computer science; Denial-of-service attack; Controller (irrigation); Resilience (materials science); State (computer science); Consensus; Multi-agent system; Control (management); Artificial intelligence; Algorithm","score_opus":0.010500891766611243,"score_gpt":0.23052412625172677,"score_spread":0.22002323448511554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382360845","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8821524,0.00094889,0.10045263,0.0026192956,0.0027311451,0.00409114,0.005221747,0.0010686932,0.0007140773],"genre_scores_gemma":[0.9993961,0.000043046468,0.00004154555,0.00015426257,0.000057277604,0.00007155584,0.0001254279,0.000017843298,0.000092939605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965176,0.0006421327,0.0008720145,0.0006854115,0.00069704885,0.00058578607],"domain_scores_gemma":[0.99736875,0.0008661268,0.0003804162,0.00088015455,0.00022452236,0.0002800361],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012897868,0.00031689316,0.0006468506,0.00022927082,0.00026930994,0.00014600897,0.00057517836,0.00015189208,0.000003315223],"category_scores_gemma":[0.00033037268,0.00028879964,0.00017055783,0.0005770173,0.00015538232,0.00012588948,0.00012137557,0.00023763522,0.000061476305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.014973487,0.00421915,0.114280395,0.0066285706,0.00244163,0.0021223426,0.028976321,0.71882665,0.023969606,0.036528416,0.029021135,0.018012311],"study_design_scores_gemma":[0.007645159,0.0002612392,0.009851659,0.00027847066,0.000019746154,0.000003248882,0.00023632328,0.9771645,0.00021746269,0.00010115888,0.003924421,0.00029661943],"about_ca_topic_score_codex":0.00012453961,"about_ca_topic_score_gemma":0.000048231308,"teacher_disagreement_score":0.25833786,"about_ca_system_score_codex":0.00010991534,"about_ca_system_score_gemma":0.00019878804,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W4382371059","doi":"10.1109/tcns.2023.3290424","title":"SMO-Based Distributed Tracking Control for Linear MASs With Event-Triggering Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Special Project for Research and Development in Key areas of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Event (particle physics); Tracking (education); Control (management); Distributed computing; Control theory (sociology); Physics; Artificial intelligence","score_opus":0.022201969474104754,"score_gpt":0.25247935105022845,"score_spread":0.2302773815761237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382371059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008645349,0.0003397185,0.9920426,0.0007084615,0.0014871774,0.002996115,0.0007615871,0.0007735215,0.000026294634],"genre_scores_gemma":[0.9965102,0.000012205914,0.0016029531,0.00008145171,0.00020159896,0.0013867747,0.00007664986,0.00006048061,0.00006767989],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996137,0.00057374686,0.0011615024,0.00063039834,0.0006711745,0.00082616974],"domain_scores_gemma":[0.99500006,0.0020381573,0.0007440813,0.0014182039,0.00059734023,0.0002021817],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016603603,0.00043422618,0.00096999074,0.00028192054,0.0004940323,0.00023147334,0.0011994045,0.00021877607,0.0000028139045],"category_scores_gemma":[0.000028967357,0.000395742,0.00038399792,0.0013473593,0.000083133215,0.0004409912,0.0000026892062,0.00032136045,0.000028219238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047038184,0.00012151185,0.00012392756,0.00014632085,0.00041845947,0.000008686613,0.00004529497,0.9942089,0.0011841415,0.00075789995,0.00031082032,0.0022037022],"study_design_scores_gemma":[0.010345167,0.00041341138,0.00018461003,0.0006267359,0.00017566765,0.0000076064644,0.000055913733,0.98527956,0.0005177351,0.000035586036,0.001972497,0.00038553384],"about_ca_topic_score_codex":0.00008580698,"about_ca_topic_score_gemma":0.000052383464,"teacher_disagreement_score":0.99564564,"about_ca_system_score_codex":0.00020454744,"about_ca_system_score_gemma":0.00018422346,"threshold_uncertainty_score":0.99984944},"labels":[],"label_agreement":null},{"id":"W4382702739","doi":"10.1007/978-3-031-26564-8_6","title":"Event-Based Robust Control Techniques for Wheel-Based Robots Under Cyber-Attack and Dynamic Quantizer","year":2023,"lang":"en","type":"book-chapter","venue":"Studies in computational intelligence","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mobile robot; Robot; Cyber-physical system; Controller (irrigation); Computer science; Denial-of-service attack; Cyber-attack; Control engineering; Engineering; Real-time computing; Artificial intelligence; Computer security","score_opus":0.12849351879856355,"score_gpt":0.3746665030762329,"score_spread":0.24617298427766934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382702739","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000062804475,0.002245952,0.9910054,0.0020565584,0.0011538558,0.0019638794,0.0003106912,0.00044781587,0.00080952403],"genre_scores_gemma":[0.78381205,0.0005314339,0.1818263,0.003035926,0.0004185368,0.0021891347,0.0007267991,0.00036667066,0.027093166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99614286,0.00010433895,0.001199488,0.0012714565,0.0007315908,0.0005502548],"domain_scores_gemma":[0.9938688,0.0038661938,0.0006000226,0.0005775406,0.0009736096,0.00011382903],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009000556,0.0007070984,0.0010369963,0.0005788497,0.00025163507,0.00018610258,0.0010348932,0.00032192413,0.000006830067],"category_scores_gemma":[0.00026451214,0.00071361405,0.00028823438,0.00023907595,0.00048234887,0.00020313455,0.00026622403,0.0004109908,0.000066474444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042740543,0.000048513128,0.000019997187,0.00027593123,0.00027626974,0.0000344137,0.00007396663,0.8071039,0.0000035116186,0.18555057,0.00095605414,0.005614165],"study_design_scores_gemma":[0.00066298636,0.00019286652,0.00008144207,0.0011417575,0.000058693528,0.0000059984122,0.00005250632,0.9185841,0.000021062033,0.07740339,0.0011073503,0.0006878642],"about_ca_topic_score_codex":0.00001746156,"about_ca_topic_score_gemma":0.00018794602,"teacher_disagreement_score":0.8091791,"about_ca_system_score_codex":0.00049949024,"about_ca_system_score_gemma":0.0003723925,"threshold_uncertainty_score":0.9995315},"labels":[],"label_agreement":null},{"id":"W4382933824","doi":"10.1109/isas59543.2023.10164387","title":"Distributed Fault-Tolerant Time-Varying Formation Control for Multiple UAVs and UGVs under Directed Topologies","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Network topology; Fault tolerance; Computer science; Bounded function; Actuator; Control theory (sociology); Multi-agent system; Function (biology); Scheme (mathematics); Lyapunov function; Topology (electrical circuits); Boundary (topology); Control (management); Distributed computing; Mathematics; Artificial intelligence","score_opus":0.02382093578614958,"score_gpt":0.2518656055418743,"score_spread":0.22804466975572474,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382933824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019091057,0.000075156044,0.9733738,0.0029091295,0.0003622702,0.0011753823,0.0003314297,0.002466005,0.00021577952],"genre_scores_gemma":[0.99516195,0.000007970798,0.0034935474,0.00019345884,0.00005193718,0.00025824667,0.00037885472,0.00001518089,0.00043883015],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981359,0.00011263191,0.00046033217,0.00046044178,0.00026438688,0.0005662742],"domain_scores_gemma":[0.9981006,0.00096662826,0.00016433936,0.00044684522,0.00020005212,0.00012154307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045361562,0.00023723459,0.0003731682,0.00014956441,0.0003034056,0.00035476178,0.0005124467,0.00012127548,0.000008367181],"category_scores_gemma":[0.00037175088,0.0002002211,0.00010260756,0.00052140834,0.00004975528,0.00085818366,0.00016789233,0.000085834065,0.00012609112],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015458202,0.0012010054,0.014343348,0.0014948864,0.0024736407,0.00019134053,0.006545717,0.12725411,0.26499456,0.15421282,0.18270473,0.24303803],"study_design_scores_gemma":[0.003680141,0.00006156316,0.003889154,0.000025629113,0.000018630542,0.00000948665,0.00015868637,0.9870317,0.0013467664,0.0009001301,0.0026118818,0.00026624202],"about_ca_topic_score_codex":0.00006862283,"about_ca_topic_score_gemma":0.000024410027,"teacher_disagreement_score":0.97607094,"about_ca_system_score_codex":0.00008542154,"about_ca_system_score_gemma":0.00003332177,"threshold_uncertainty_score":0.81647795},"labels":[],"label_agreement":null},{"id":"W4382935827","doi":"10.23919/acc55779.2023.10155852","title":"Existence of a Unique Invariant Measure and Ergodic Property in AIMD-based Multi-resource Allocation","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Ergodic theory; Computer science; Bottleneck; Multiplicative function; Mathematical optimization; Resource allocation; Markov process; Multi-agent system; Markov chain; Distributed computing; Mathematics; Artificial intelligence; Computer network","score_opus":0.07436138642551565,"score_gpt":0.26721891261780184,"score_spread":0.1928575261922862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382935827","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004182353,0.00019905416,0.98992854,0.002615481,0.00027650353,0.0018793554,0.00003676252,0.00041278297,0.0004691658],"genre_scores_gemma":[0.9629916,0.000013164798,0.035343073,0.00018188308,0.00002554163,0.00039638067,0.00006062876,0.000031895248,0.0009558323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996505,0.000574583,0.0008500231,0.0010976652,0.0006007247,0.0003719659],"domain_scores_gemma":[0.997463,0.00019812342,0.0004502156,0.001447436,0.0002961785,0.00014506666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017658368,0.00037671064,0.00063427933,0.0003839762,0.00004862215,0.00019869495,0.0016582728,0.00038570623,0.0000029087944],"category_scores_gemma":[0.00045791437,0.00028042193,0.00010671516,0.00055511395,0.000096467775,0.00017480493,0.0011086994,0.0005189139,0.000017856224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010749836,0.008496409,0.09724179,0.024417426,0.0019274375,0.0017787921,0.027557993,0.41096652,0.081520356,0.1931828,0.010860047,0.14097545],"study_design_scores_gemma":[0.0014471357,0.000050633706,0.010954794,0.0012594953,0.00001683911,0.000005265068,0.00007497534,0.98387134,0.00121269,0.00032691218,0.00035640722,0.0004235173],"about_ca_topic_score_codex":0.0053056506,"about_ca_topic_score_gemma":0.0019430061,"teacher_disagreement_score":0.95880926,"about_ca_system_score_codex":0.00019490912,"about_ca_system_score_gemma":0.00069674297,"threshold_uncertainty_score":0.9999648},"labels":[],"label_agreement":null},{"id":"W4382935911","doi":"10.23919/acc55779.2023.10155832","title":"Formation Control for a Class of Nonlinear Multi-Agent Systems Using Three-Layer Neural Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Nonlinear system; Artificial neural network; Tracking error; Lyapunov function; Bounded function; Computer science; Affine transformation; Exponential stability; Lyapunov stability; Mathematics; Control (management); Artificial intelligence; Mathematical analysis","score_opus":0.06850014144843972,"score_gpt":0.2905319932838215,"score_spread":0.2220318518353818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382935911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0145050725,0.00012328595,0.98104197,0.00020887399,0.0017350285,0.0018440052,0.00007804485,0.00042932777,0.00003441569],"genre_scores_gemma":[0.9907509,0.000002061103,0.00862487,0.00008912376,0.00020427149,0.00015970987,0.000046680027,0.000022209908,0.000100148645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997731,0.000116778756,0.00080967956,0.0003844931,0.00038257148,0.0005755],"domain_scores_gemma":[0.9982267,0.0002729468,0.00040436842,0.0006172797,0.00035206098,0.00012665257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008158097,0.00023053383,0.00045965947,0.0001913332,0.00014268514,0.0002184598,0.00074985827,0.00013397959,0.0000018299695],"category_scores_gemma":[0.00007426261,0.00019835233,0.00020924932,0.00062797114,0.00002714645,0.0007192318,0.00013180976,0.00010093901,0.000024011573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043077293,0.00009644346,0.00090433785,0.00018122073,0.00012334979,0.000008799958,0.00014621402,0.9826615,0.005440362,0.006189167,0.0010042568,0.0032013138],"study_design_scores_gemma":[0.0030205688,0.000072423616,0.00041113005,0.00004793206,0.000030267305,0.000012003701,0.00007445041,0.9953481,0.00017280225,0.000014265763,0.00059091276,0.00020517346],"about_ca_topic_score_codex":0.00018479237,"about_ca_topic_score_gemma":0.00005369756,"teacher_disagreement_score":0.9762459,"about_ca_system_score_codex":0.00010730197,"about_ca_system_score_gemma":0.00004407466,"threshold_uncertainty_score":0.8088573},"labels":[],"label_agreement":null},{"id":"W4382936275","doi":"10.23919/acc55779.2023.10156573","title":"Distributed Hybrid Attitude Estimation for Multi-agent Systems on SO(3)","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Convergence (economics); Nonlinear system; Computer science; Angular velocity; Multi-agent system; Graph; Control theory (sociology); Estimation; Constant (computer programming); Scheme (mathematics); Orientation (vector space); Topology (electrical circuits); Mathematics; Theoretical computer science; Artificial intelligence; Engineering; Control (management); Mathematical analysis","score_opus":0.058563212082174784,"score_gpt":0.30789038153904114,"score_spread":0.24932716945686634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382936275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003782142,0.00004667934,0.98902607,0.0009001403,0.0021710736,0.00165361,0.00043753334,0.0018319522,0.00015077753],"genre_scores_gemma":[0.9845194,0.000004502812,0.0118701765,0.00015651798,0.00012900315,0.0007694551,0.00079791364,0.000030075642,0.0017229345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974186,0.00010847731,0.00056951825,0.00071968266,0.00053091795,0.0006528463],"domain_scores_gemma":[0.99815136,0.00029611707,0.0002046834,0.00094115414,0.00020229488,0.00020439843],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000735147,0.0002917382,0.0003619201,0.00021164492,0.0003145652,0.0007041889,0.0010485426,0.00007982064,0.0000051852235],"category_scores_gemma":[0.00027897774,0.00025734853,0.00017281661,0.0006199824,0.000031620046,0.00041040027,0.00017848388,0.000102182225,0.0015108152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008914343,0.00094494666,0.0010195386,0.0006108926,0.00050369283,0.0001761196,0.0004326186,0.40924776,0.0031013496,0.32616612,0.22117645,0.0365314],"study_design_scores_gemma":[0.0016045428,0.00010436472,0.002078376,0.00006415703,0.00001372503,0.000009271516,0.00003156945,0.9779251,0.0006915383,0.00010210683,0.017076513,0.0002987276],"about_ca_topic_score_codex":0.00009982313,"about_ca_topic_score_gemma":0.000008805954,"teacher_disagreement_score":0.98073727,"about_ca_system_score_codex":0.00023167554,"about_ca_system_score_gemma":0.00008483102,"threshold_uncertainty_score":0.9999879},"labels":[],"label_agreement":null},{"id":"W4382999244","doi":"10.1109/taes.2023.3291351","title":"Distributed Simultaneous Fault Estimation and Cluster Consensus Control of Small Satellites","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observer (physics); Jacobian matrix and determinant; Topology (electrical circuits); Cluster (spacecraft); Computer science; Control theory (sociology); Network topology; Fault (geology); Mathematics; Algorithm; Applied mathematics; Control (management); Combinatorics; Artificial intelligence; Physics","score_opus":0.010007074328062943,"score_gpt":0.22293205211933606,"score_spread":0.21292497779127312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382999244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12004966,0.00080429064,0.8767294,0.00071422843,0.00042029753,0.0007990354,0.00017003999,0.00029567833,0.000017322467],"genre_scores_gemma":[0.9991067,0.00018520396,0.00018250036,0.00003991774,0.000023127033,0.00009736171,0.000014117609,0.000020568978,0.00033052603],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786234,0.0002212265,0.0004947812,0.00051296863,0.00029307607,0.0006155829],"domain_scores_gemma":[0.9980039,0.0010283388,0.00021815293,0.0004501238,0.00014760153,0.00015189481],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005084848,0.000282503,0.0004792333,0.0001856774,0.00020896854,0.00019355511,0.00025215177,0.00016422242,0.0000011910785],"category_scores_gemma":[0.000039418373,0.0002635469,0.000085048414,0.0005934921,0.00009392877,0.000105800675,0.0000040819596,0.0002361878,0.00003234713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024304484,0.00018372078,0.00013024197,0.00039676816,0.00048316672,0.000036096168,0.00082838803,0.94558996,0.01943665,0.0039109103,0.00023524114,0.028525809],"study_design_scores_gemma":[0.0022074564,0.0003240156,0.000063017374,0.00010821213,0.000062020605,0.000093973395,0.00016237411,0.9939437,0.0021891622,0.00006757323,0.0005240165,0.00025446745],"about_ca_topic_score_codex":0.00024192236,"about_ca_topic_score_gemma":0.00009966581,"teacher_disagreement_score":0.879057,"about_ca_system_score_codex":0.000118257296,"about_ca_system_score_gemma":0.000092830225,"threshold_uncertainty_score":0.9999817},"labels":[],"label_agreement":null},{"id":"W4384563452","doi":"10.1016/j.cogr.2023.07.004","title":"Reinforcement learning for swarm robotics: An overview of applications, algorithms and simulators","year":2023,"lang":"en","type":"article","venue":"Cognitive Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Artificial intelligence; Swarm robotics; Reinforcement learning; Robotics; Robot; Swarm behaviour; Computer science; Swarm intelligence; Ant robotics; Machine learning; Field (mathematics); Popularity; Robot control; Mobile robot; Particle swarm optimization; Mathematics","score_opus":0.08144672949125539,"score_gpt":0.3443128008019918,"score_spread":0.26286607131073636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384563452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004906963,0.0005655213,0.99721354,0.00013664163,0.00014460053,0.0011285747,0.000019722493,0.00021783607,0.000082875325],"genre_scores_gemma":[0.97784287,0.00027614247,0.020958088,0.00009520668,0.00010689805,0.00022079612,0.00021464699,0.000028916002,0.00025644645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847806,0.00008160727,0.0004171418,0.00041426613,0.00027699955,0.000331912],"domain_scores_gemma":[0.99832374,0.0005258138,0.00024849616,0.00030449056,0.00045505405,0.00014243253],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045976712,0.00018073506,0.0003109475,0.00014668475,0.000168036,0.00009480649,0.0003641202,0.00007740394,0.000001430259],"category_scores_gemma":[0.00019966418,0.00018782816,0.000077190605,0.000529961,0.000064480926,0.00028709756,0.0002084816,0.000106954816,0.000030740088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009421577,0.00006709193,0.0010149985,0.00024926502,0.00010236323,0.0000032997466,0.00034603607,0.90668267,0.000097942204,0.04223039,0.000043926513,0.04915261],"study_design_scores_gemma":[0.0010264085,0.00020373697,0.0012410596,0.00012146784,0.000060035192,0.0000022081786,0.00028836788,0.99493045,0.00033726438,0.0010020204,0.0005679975,0.00021898061],"about_ca_topic_score_codex":0.000008827477,"about_ca_topic_score_gemma":0.0000016489544,"teacher_disagreement_score":0.97735214,"about_ca_system_score_codex":0.000037806636,"about_ca_system_score_gemma":0.00005903486,"threshold_uncertainty_score":0.765941},"labels":[],"label_agreement":null},{"id":"W4385235947","doi":"10.1109/med59994.2023.10185698","title":"Event-Triggered Consensus Control of Multi-Agent System under Periodic DoS Attacks","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"State Key Laboratory of Mechanics and Control of Mechanical Structures; Natural Sciences and Engineering Research Council of Canada; Aeronautical Science Foundation of China; Nanjing University of Aeronautics and Astronautics; China Postdoctoral Science Foundation; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; Ministry of Education","keywords":"Denial-of-service attack; Computer science; Controller (irrigation); Multi-agent system; Control theory (sociology); Event (particle physics); Consensus; Network topology; Topology (electrical circuits); Control (management); Distributed computing; Computer network; The Internet; Mathematics; Artificial intelligence; Physics","score_opus":0.032606811684779656,"score_gpt":0.2758897676710066,"score_spread":0.24328295598622693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385235947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034137327,0.0003375414,0.958201,0.0013834126,0.0018828594,0.0014637879,0.0001636619,0.0016178986,0.00081250415],"genre_scores_gemma":[0.99651843,0.000004486469,0.001165058,0.00017132747,0.00006384678,0.00011966259,0.000023857372,0.000027336215,0.0019059812],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963012,0.0004030096,0.0010520922,0.00073748577,0.0007625705,0.00074368925],"domain_scores_gemma":[0.99726653,0.0003911022,0.0004184011,0.0013043686,0.00033816372,0.00028144434],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000979476,0.0003554947,0.0007308782,0.00031071343,0.00017845693,0.00019214625,0.0012651338,0.0001729935,0.000028572376],"category_scores_gemma":[0.000109480425,0.00030682216,0.00032022776,0.001036299,0.000106913736,0.00016341223,0.00024198233,0.00016153652,0.0016604222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052696315,0.0025726438,0.027984042,0.0034196337,0.0050125862,0.002348333,0.0054846476,0.12042577,0.19798248,0.52820766,0.08247527,0.02356],"study_design_scores_gemma":[0.0071201646,0.00010373696,0.007047737,0.0001513726,0.000055368302,0.000044533557,0.0011568789,0.98055756,0.0013094003,0.00004025125,0.0019413988,0.00047160845],"about_ca_topic_score_codex":0.0002070988,"about_ca_topic_score_gemma":0.000032508247,"teacher_disagreement_score":0.9623811,"about_ca_system_score_codex":0.00023411885,"about_ca_system_score_gemma":0.0002307395,"threshold_uncertainty_score":0.99993837},"labels":[],"label_agreement":null},{"id":"W4385325555","doi":"10.1109/tsmc.2023.3292426","title":"Resilient Formation Tracking of Spacecraft Swarm Against Actuation Attacks: A Distributed Lyapunov-Based Model Predictive Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Department of Education of Guangdong Province; Southeast University; National Natural Science Foundation of China","keywords":"Control theory (sociology); Computer science; Lyapunov function; Spacecraft; Controller (irrigation); Lyapunov stability; Trajectory; Swarm behaviour; Stability (learning theory); Control engineering; Engineering; Control (management); Artificial intelligence; Nonlinear system; Aerospace engineering; Machine learning","score_opus":0.030137711389498046,"score_gpt":0.24344093827534832,"score_spread":0.21330322688585027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385325555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030734057,0.00018096952,0.9638318,0.00008504442,0.0011751448,0.002152227,0.0007020619,0.00063556805,0.00050314295],"genre_scores_gemma":[0.9983969,0.00004563911,0.00033090968,0.000016704847,0.00006450914,0.0005602957,0.0001752982,0.00004624366,0.00036354695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958576,0.00038959176,0.0012660894,0.0007786302,0.0011152576,0.0005928641],"domain_scores_gemma":[0.99737996,0.00024449202,0.0007131016,0.0009629228,0.00044550854,0.00025400057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010616978,0.00046869353,0.000721102,0.0006302973,0.00031515496,0.00046222,0.0006140769,0.0002984169,4.3286434e-7],"category_scores_gemma":[0.000019222647,0.00045281468,0.00020449559,0.001171173,0.00009190867,0.00064623734,0.000010415706,0.00029331556,0.000034317596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054952874,0.00021844567,0.000030157858,0.0006948228,0.00011512297,0.000005755749,0.0013010965,0.9928617,0.0025920032,0.00090823986,0.00041148934,0.00080620905],"study_design_scores_gemma":[0.0016078268,0.00019057891,0.00016483747,0.00061432034,0.000070703456,0.000019758321,0.001528829,0.9929963,0.0021855033,0.000016028722,0.0002141751,0.000391134],"about_ca_topic_score_codex":0.00015923519,"about_ca_topic_score_gemma":0.000022517386,"teacher_disagreement_score":0.9676628,"about_ca_system_score_codex":0.00034766312,"about_ca_system_score_gemma":0.00013600657,"threshold_uncertainty_score":0.99979234},"labels":[],"label_agreement":null},{"id":"W4385451899","doi":"10.23919/ecc57647.2023.10178280","title":"Optimal Target Capture and Station Keeping Control of Mobile Agents without Global Position Information","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Beacon; Mobile robot; Position (finance); Optimal control; Convergence (economics); Motion control; Motion planning; Global Positioning System; Control theory (sociology); Mathematical optimization; Real-time computing; Control (management); Artificial intelligence; Mathematics; Robot; Telecommunications","score_opus":0.007685103527996069,"score_gpt":0.24532092272203043,"score_spread":0.23763581919403437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385451899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1146058,0.00002589313,0.883393,0.00018537609,0.00019609803,0.00047968945,0.0001456683,0.00021911248,0.0007493793],"genre_scores_gemma":[0.9941956,0.0000027574933,0.0053695096,0.00017918802,0.0000150266005,0.00004602873,0.00016129474,0.0000026865878,0.000027912974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896604,0.000060545746,0.00033155113,0.00015213618,0.00029761725,0.00019211152],"domain_scores_gemma":[0.9993749,0.000029731527,0.00018754938,0.00018588254,0.0001552736,0.00006664437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002861696,0.00010051616,0.00016637958,0.000081118415,0.00006248143,0.00013874452,0.00020192942,0.0000597873,0.00000625063],"category_scores_gemma":[0.000032076598,0.00009477092,0.000033897955,0.0003629771,0.000018708948,0.0014533831,0.00006085371,0.000041876043,0.000052899966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037778722,0.00033474888,0.1166684,0.0008201811,0.00070724246,0.000046694277,0.014825036,0.62303495,0.012810239,0.14043227,0.016446067,0.073496394],"study_design_scores_gemma":[0.0014456718,0.00006679298,0.030549226,0.000023377577,0.000009598288,0.0000076113834,0.00026726918,0.966578,0.0002463987,0.00015455308,0.0005387511,0.00011275693],"about_ca_topic_score_codex":0.00015631522,"about_ca_topic_score_gemma":0.0000049353484,"teacher_disagreement_score":0.8795898,"about_ca_system_score_codex":0.00006457114,"about_ca_system_score_gemma":0.000037472197,"threshold_uncertainty_score":0.3864646},"labels":[],"label_agreement":null},{"id":"W4385484956","doi":"10.1109/icphm57936.2023.10194041","title":"A Distributed Fault Detection and Estimation for Formation of Clusters of Small Satellites","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Observer (physics); Fault detection and isolation; Satellite; Control theory (sociology); Computer science; State vector; Nonlinear system; Fault (geology); State (computer science); State observer; Estimation; Control (management); Algorithm; Engineering; Artificial intelligence","score_opus":0.023466273360805697,"score_gpt":0.24650036518422824,"score_spread":0.22303409182342254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385484956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10000195,0.000015954274,0.89908797,0.0001364477,0.00009816762,0.00043944232,0.000057323694,0.00012899969,0.000033758246],"genre_scores_gemma":[0.98573905,0.0000051235315,0.014073594,0.0000074771733,0.000006494882,0.000044706765,0.0000955911,0.000003628153,0.000024323941],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922186,0.000032113534,0.00034823993,0.00014305359,0.00012526219,0.00012944186],"domain_scores_gemma":[0.9992234,0.00018950806,0.00021268785,0.00018311471,0.0001590518,0.00003223995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032504406,0.00007405746,0.00014942052,0.00013058678,0.000039675808,0.000037751102,0.00016337032,0.000047589976,4.3240138e-7],"category_scores_gemma":[0.00014617773,0.000067212815,0.000045249908,0.0004149274,0.000019187257,0.00038160992,0.000051875966,0.00002132107,0.00000338922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015932617,0.00013569853,0.0006842772,0.0018422098,0.00011794739,0.0000014137561,0.0026500828,0.057096723,0.2265582,0.020890016,0.0004735043,0.6893906],"study_design_scores_gemma":[0.0005934149,0.00008066502,0.0019126821,0.000026755955,0.00000890222,0.0000021488083,0.000087983564,0.9364764,0.059919488,0.0007393322,0.0000919982,0.00006023551],"about_ca_topic_score_codex":0.00004189372,"about_ca_topic_score_gemma":0.000028584549,"teacher_disagreement_score":0.8857371,"about_ca_system_score_codex":0.000025530568,"about_ca_system_score_gemma":0.000011492587,"threshold_uncertainty_score":0.2740859},"labels":[],"label_agreement":null},{"id":"W4385488776","doi":"10.3390/drones7080503","title":"Fault Detection and Fault-Tolerant Cooperative Control of Multi-UAVs under Actuator Faults, Sensor Faults, and Wind Disturbances","year":2023,"lang":"en","type":"article","venue":"Drones","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; Government of Jiangsu Province; Nanjing University of Aeronautics and Astronautics; Chinese Aeronautical Establishment; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Control theory (sociology); Backstepping; Actuator; Fault detection and isolation; Fault (geology); Lyapunov function; Computer science; Engineering; Control engineering; Control (management); Adaptive control; Nonlinear system; Artificial intelligence","score_opus":0.01687773053502796,"score_gpt":0.24732430469157207,"score_spread":0.23044657415654413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385488776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73289263,0.0010880231,0.26311153,0.0007961768,0.0005983008,0.00088661356,0.00025322856,0.0003393587,0.00003414324],"genre_scores_gemma":[0.9987189,0.0000937434,0.00056213536,0.000095576914,0.000079913225,0.000053264386,0.000019619429,0.00002205711,0.0003547867],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99771017,0.0002162049,0.00051456736,0.00071337406,0.00039684423,0.00044883048],"domain_scores_gemma":[0.99851656,0.00037184736,0.00026620284,0.0004396966,0.00023093585,0.00017475513],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035938376,0.00034114256,0.0005735802,0.00017177516,0.0002613072,0.00014077422,0.00036347113,0.00015545997,0.0000037060167],"category_scores_gemma":[0.0001347753,0.000285671,0.0000773034,0.00044728478,0.00020728995,0.00057370047,0.00014616699,0.00017114021,0.000043660857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011101421,0.0013215283,0.029349836,0.0013712392,0.0025951678,0.0003693194,0.027023291,0.024984801,0.700691,0.013539844,0.0010987967,0.19654505],"study_design_scores_gemma":[0.008153523,0.00032649914,0.09479143,0.00016869047,0.00008607012,0.00006013282,0.0029137381,0.8782332,0.011740132,0.00014739243,0.0026103135,0.00076890487],"about_ca_topic_score_codex":0.0002569749,"about_ca_topic_score_gemma":0.00021266617,"teacher_disagreement_score":0.85324836,"about_ca_system_score_codex":0.00004883818,"about_ca_system_score_gemma":0.00004465318,"threshold_uncertainty_score":0.9999595},"labels":[],"label_agreement":null},{"id":"W4385576067","doi":"10.3390/robotics12040112","title":"A Hybrid Motion Planning Algorithm for Multi-Mobile Robot Formation Planning","year":2023,"lang":"en","type":"article","venue":"Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"National Natural Science Foundation of China","keywords":"Robot; Mobile robot; Obstacle; Motion planning; Computer science; Trajectory; Controller (irrigation); Obstacle avoidance; Backstepping; Position (finance); Control theory (sociology); Control engineering; Simulation; Artificial intelligence; Engineering; Control (management); Adaptive control","score_opus":0.06542956649740544,"score_gpt":0.31459288607297065,"score_spread":0.2491633195755652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385576067","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006831047,0.00011005216,0.9960795,0.00012885702,0.0011771639,0.00084287685,0.0000499213,0.00089093874,0.000037554335],"genre_scores_gemma":[0.420829,0.000005185242,0.5773806,0.0001129274,0.000316982,0.0003802105,0.0005114642,0.00004474299,0.00041890988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982624,0.000060932027,0.00043289227,0.00038231767,0.00032031382,0.0005411126],"domain_scores_gemma":[0.9989116,0.00016308602,0.00022599808,0.00043603164,0.00014817514,0.00011511479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005068595,0.00020196172,0.0002528291,0.0002205606,0.0002653544,0.00028102298,0.0005922313,0.000079386475,0.000001000272],"category_scores_gemma":[0.000085945954,0.0002117162,0.00011356071,0.000405688,0.000015335509,0.0008100902,0.00015569472,0.0001267613,0.00015040049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030090966,0.00004827147,0.00014527794,0.000053161133,0.000029078734,0.000034727454,0.00072838477,0.91606975,0.00040619445,0.00081037433,0.0021732498,0.07949852],"study_design_scores_gemma":[0.0010755237,0.000072732226,0.0006522867,0.000089213536,0.000014521738,0.000025028166,0.00014610449,0.9956029,0.00079537655,0.00015783637,0.0011339438,0.00023455296],"about_ca_topic_score_codex":0.0000067734672,"about_ca_topic_score_gemma":5.115532e-7,"teacher_disagreement_score":0.42014587,"about_ca_system_score_codex":0.0001275756,"about_ca_system_score_gemma":0.000035233366,"threshold_uncertainty_score":0.8633536},"labels":[],"label_agreement":null},{"id":"W4386025822","doi":"10.1109/tcyb.2023.3301737","title":"Distributed Neurodynamics-Based Backstepping Optimal Control for Robust Constrained Consensus of Underactuated Underwater Vehicles Fleet","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Backstepping; Underactuation; Nonholonomic system; Unmanned underwater vehicle; Computer science; Control theory (sociology); Controller (irrigation); Bounded function; Constraint (computer-aided design); Underwater; Protocol (science); Control engineering; Control (management); Artificial intelligence; Engineering; Mobile robot; Robot; Mathematics; Adaptive control","score_opus":0.028717811247495405,"score_gpt":0.25038750473937116,"score_spread":0.22166969349187576,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386025822","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030951366,0.000008840688,0.9621287,0.0017473347,0.00089761073,0.0011450392,0.0024482734,0.00063063717,0.000042213804],"genre_scores_gemma":[0.9886935,0.00000423549,0.0106074875,0.0001896683,0.000027765602,0.00012362891,0.00017666406,0.000049040264,0.00012802781],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99714357,0.00020749586,0.00083796954,0.00064989843,0.00046584313,0.0006952086],"domain_scores_gemma":[0.99673015,0.0016043336,0.0003043522,0.00075209665,0.00040396475,0.0002051204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042067355,0.00039011275,0.0005572488,0.00033501224,0.00024236999,0.00016995687,0.0006912074,0.00021402452,0.000016099402],"category_scores_gemma":[0.000049133643,0.00040100343,0.0003152095,0.0008635461,0.00022814058,0.000118276184,0.0000051035145,0.0002741774,0.00007768987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017031365,0.00023189052,0.000020968344,0.00007193032,0.00019888316,0.000024161127,0.000081142236,0.9845688,0.011040038,0.00069408317,0.00041977357,0.002478047],"study_design_scores_gemma":[0.00549836,0.000325723,0.00026299935,0.000081350176,0.00011399957,0.000012745987,0.00008933361,0.98239726,0.010510296,0.000115165014,0.00021912502,0.00037367007],"about_ca_topic_score_codex":0.00005961269,"about_ca_topic_score_gemma":0.00006031797,"teacher_disagreement_score":0.9577421,"about_ca_system_score_codex":0.00014109745,"about_ca_system_score_gemma":0.00024494418,"threshold_uncertainty_score":0.9998442},"labels":[],"label_agreement":null},{"id":"W4386133918","doi":"10.1109/tsmc.2023.3299754","title":"Data-Driven Event-Triggered Formation of MIMO Multiagent Systems With Constrained Information","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; Higher Education Discipline Innovation Project","keywords":"Computer science; Fading; Jacobian matrix and determinant; MIMO; Nonlinear system; Bipartite graph; Control (management); Event (particle physics); Compensation (psychology); Distributed computing; Control theory (sociology); Channel (broadcasting); Computer network; Theoretical computer science; Mathematics; Artificial intelligence","score_opus":0.028489123187544055,"score_gpt":0.24222432637306032,"score_spread":0.21373520318551625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386133918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010160528,0.00034737485,0.9806131,0.00009021634,0.003184944,0.002839126,0.001563895,0.00059988635,0.000600931],"genre_scores_gemma":[0.99832463,0.000097663105,0.00017789961,0.000016178838,0.000078809346,0.00037263695,0.00024478714,0.000032813612,0.00065457425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955106,0.00046471047,0.0016789475,0.0006119721,0.0011542833,0.0005795094],"domain_scores_gemma":[0.99630356,0.00025414766,0.0009920524,0.0016976385,0.00046840464,0.0002842095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010838202,0.00046897758,0.00081425376,0.00069524173,0.00027939444,0.00082375517,0.0011405235,0.00024454802,0.0000017903345],"category_scores_gemma":[0.000014378856,0.00040443704,0.00010180285,0.0010352804,0.000112520815,0.0018971262,0.000023694296,0.00024915638,0.00019594553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015456934,0.00032008742,0.00008824814,0.004086141,0.0007407149,0.00005530181,0.0037006645,0.9687276,0.0017280012,0.010534349,0.004335278,0.005529055],"study_design_scores_gemma":[0.0023179923,0.00029202102,0.000078350626,0.0009640803,0.000094121155,0.00017632093,0.0030628412,0.9858338,0.0002328601,0.0000032729972,0.0064960727,0.00044827283],"about_ca_topic_score_codex":0.0009991619,"about_ca_topic_score_gemma":0.000063836036,"teacher_disagreement_score":0.9881641,"about_ca_system_score_codex":0.00016945088,"about_ca_system_score_gemma":0.00013922072,"threshold_uncertainty_score":0.99984074},"labels":[],"label_agreement":null},{"id":"W4386439316","doi":"10.1109/tmech.2023.3273395","title":"Distributed Adaptive Dynamic Event-Triggered Control for Multiple Quadrotors","year":2023,"lang":"en","type":"article","venue":"IEEE/ASME Transactions on Mechatronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale; Government of Canada","keywords":"Control theory (sociology); Sliding mode control; Integral sliding mode; Underactuation; Lemma (botany); Computer science; Lyapunov function; Lyapunov stability; Nonlinear system; Adaptive control; Manifold (fluid mechanics); Control (management); Engineering; Artificial intelligence","score_opus":0.018579818271204605,"score_gpt":0.2601504642875828,"score_spread":0.2415706460163782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386439316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031233768,0.000069181006,0.9847195,0.0011070567,0.0025542288,0.0029359395,0.003938864,0.0015398681,0.0000119811075],"genre_scores_gemma":[0.99322724,0.000027344426,0.004058413,0.00011695648,0.000054804885,0.001813016,0.00020615914,0.000069037094,0.0004270241],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961239,0.00025284424,0.0007803279,0.0010168807,0.00067161996,0.0011544188],"domain_scores_gemma":[0.9969844,0.0009116664,0.000299574,0.0011966345,0.00029025553,0.00031742433],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007716581,0.00051961624,0.00063102215,0.0004403086,0.0005986305,0.00021781346,0.0013008752,0.00029747505,0.00001822821],"category_scores_gemma":[0.00006915203,0.0005342485,0.00063381676,0.0013820136,0.000058102516,0.0005914697,0.000011318057,0.0004473168,0.00052446255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010957369,0.0013412023,0.000036097215,0.00017027768,0.001547343,0.00007033454,0.0006702234,0.9013183,0.014828462,0.018092327,0.0024557777,0.05837388],"study_design_scores_gemma":[0.005806859,0.00047191355,0.00007195215,0.00005554805,0.000096071824,0.0000070543383,0.0001959709,0.98636526,0.002326296,0.0013487557,0.0027044765,0.00054985646],"about_ca_topic_score_codex":0.000067815745,"about_ca_topic_score_gemma":0.00015345811,"teacher_disagreement_score":0.99010384,"about_ca_system_score_codex":0.0007002876,"about_ca_system_score_gemma":0.00029633148,"threshold_uncertainty_score":0.9997109},"labels":[],"label_agreement":null},{"id":"W4386766554","doi":"10.1109/tmc.2023.3315961","title":"Multi-Agent Deep Reinforcement Learning to Enable Dynamic TDD in a Multi-Cell Environment","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Reinforcement learning; Computer science; Distributed computing; Human–computer interaction; Artificial intelligence","score_opus":0.019648982804701794,"score_gpt":0.2545781797765407,"score_spread":0.2349291969718389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386766554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03962503,0.00006139501,0.95705247,0.000083977764,0.0009690681,0.0014692046,0.0000045589677,0.0006836396,0.000050652798],"genre_scores_gemma":[0.97841686,0.00003231073,0.019483684,0.000105863866,0.000020929912,0.00040495608,0.000010908893,0.000045374883,0.0014791305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964287,0.0002423743,0.00079695997,0.0009928624,0.00055717985,0.0009818797],"domain_scores_gemma":[0.99846476,0.00023290483,0.00018504294,0.0007911131,0.000045895325,0.000280275],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079403503,0.00039924233,0.00041013624,0.0006556116,0.00044897213,0.00020117583,0.00091400935,0.00012512933,0.000030171059],"category_scores_gemma":[0.000012321125,0.0004450388,0.00019688619,0.0011615804,0.000027768952,0.00025568876,0.000044638684,0.0005526485,0.0017838051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009372938,0.0003529598,0.000050528866,0.000035341367,0.000025770505,0.000047660844,0.0021896767,0.95577055,0.00995981,0.0000034205787,0.000015124733,0.031539813],"study_design_scores_gemma":[0.002167555,0.00022807854,0.0003493422,0.00010470909,0.000011436686,0.000005773795,0.00062193035,0.9912024,0.003744815,0.0000014585089,0.0011338581,0.00042862314],"about_ca_topic_score_codex":0.00016388677,"about_ca_topic_score_gemma":0.00006983252,"teacher_disagreement_score":0.9387918,"about_ca_system_score_codex":0.000769208,"about_ca_system_score_gemma":0.0000545633,"threshold_uncertainty_score":0.99980015},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012698885169362878,"score_gpt":0.2469724852578422,"score_spread":0.23427360008847933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386902756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011875422,0.000026488135,0.97932017,0.0020126726,0.0014419537,0.0017501066,0.0017582002,0.0017690009,0.000046008554],"genre_scores_gemma":[0.99787277,0.0000015985087,0.0011526399,0.00024646122,0.000039498736,0.00048479292,0.000042186133,0.000049391932,0.00011068657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99525625,0.00063712517,0.00140427,0.00078310724,0.0010089644,0.0009102776],"domain_scores_gemma":[0.9955567,0.0018006136,0.00060115336,0.001409459,0.0003028829,0.0003291838],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00088953925,0.00055616105,0.0010900104,0.0005339055,0.000349259,0.00019189158,0.001123217,0.00022468774,0.000065070395],"category_scores_gemma":[0.00009483723,0.0005416382,0.00060995313,0.0014201096,0.00010207097,0.00024296719,0.000004177109,0.0003097281,0.0003114228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021580722,0.00051944266,0.00006914889,0.00020962677,0.00071861484,0.00014687079,0.00021326308,0.9141722,0.066766545,0.0006102588,0.00048774568,0.015870532],"study_design_scores_gemma":[0.011334407,0.0002156643,0.0005826871,0.00016406752,0.00018891918,0.000014868388,0.00003884864,0.97980165,0.006874064,0.00022197,0.00008908275,0.00047375835],"about_ca_topic_score_codex":0.00011242862,"about_ca_topic_score_gemma":0.000037124268,"teacher_disagreement_score":0.9859973,"about_ca_system_score_codex":0.00029915044,"about_ca_system_score_gemma":0.000283169,"threshold_uncertainty_score":0.9997035},"labels":[],"label_agreement":null},{"id":"W4386950795","doi":"10.1016/j.chaos.2023.114067","title":"Event-triggered impulsive control for multi-agent systems with actuation delay and continuous/periodic sampling","year":2023,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Event (particle physics); Flexibility (engineering); Sampling (signal processing); Controller (irrigation); Control (management); Upper and lower bounds; Computer science; Lyapunov function; Interval (graph theory); Mathematics; Physics; Telecommunications; Artificial intelligence; Statistics","score_opus":0.039336153153046456,"score_gpt":0.3002962847282028,"score_spread":0.26096013157515635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386950795","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13585545,0.0009138189,0.85743463,0.0005222787,0.0010586615,0.0032117155,0.00038688316,0.0005924179,0.00002416404],"genre_scores_gemma":[0.99462175,0.0000307209,0.0030083188,0.00015688244,0.00027826655,0.0014002316,0.00015573412,0.00005532362,0.00029277476],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966303,0.00017850989,0.00078455557,0.0009378441,0.0005135529,0.00095524336],"domain_scores_gemma":[0.99702907,0.0007624803,0.0005831016,0.00081470044,0.0004647389,0.0003459345],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00097061344,0.00045839456,0.0008102068,0.00030860465,0.0004838979,0.00075856433,0.00068990584,0.00021062256,0.000003668449],"category_scores_gemma":[0.0003566713,0.00039289388,0.0001768841,0.00056255277,0.000096473515,0.0007181249,0.00013837448,0.00019524246,0.00009940799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033371632,0.004757616,0.07950039,0.0056813373,0.012729355,0.0017580395,0.06572525,0.09058278,0.37928066,0.08057347,0.025565218,0.2505087],"study_design_scores_gemma":[0.010077971,0.00045019787,0.007637812,0.00036611647,0.00016126316,0.00009809636,0.0015831144,0.96991044,0.00089176337,0.00016499979,0.0077431723,0.00091505615],"about_ca_topic_score_codex":0.00017493086,"about_ca_topic_score_gemma":0.000032144482,"teacher_disagreement_score":0.87932765,"about_ca_system_score_codex":0.00019264105,"about_ca_system_score_gemma":0.00020568278,"threshold_uncertainty_score":0.9998523},"labels":[],"label_agreement":null},{"id":"W4387092518","doi":"10.1109/access.2023.3320063","title":"Consensus Tracking of Multi-Agent Systems in Presence of Uncertain Dynamics and Communications Faults","year":2023,"lang":"en","type":"article","venue":"IEEE Access","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multi-agent system; Tracking (education); Distributed computing; Artificial intelligence","score_opus":0.10564593265302528,"score_gpt":0.3597231717953198,"score_spread":0.2540772391422945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387092518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8332957,0.000958568,0.16244778,0.00060786103,0.000949987,0.0011383893,0.0002308422,0.00018173482,0.00018911486],"genre_scores_gemma":[0.9990481,0.000070396236,0.00073542923,0.000008254366,0.000008783998,0.000056456156,0.000014175785,0.000008816456,0.000049545983],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824417,0.00027254884,0.0006447896,0.0002966248,0.00028714753,0.00025472595],"domain_scores_gemma":[0.997448,0.000724293,0.00037365148,0.0011822482,0.00020733668,0.00006442658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069597096,0.00012973546,0.00034276786,0.00025036043,0.000058193244,0.00009812951,0.0022276212,0.00007444946,3.2272527e-7],"category_scores_gemma":[0.0002075212,0.0001298941,0.0000421225,0.0010220299,0.0001445681,0.00031568346,0.000488986,0.00012303803,0.0000038486164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008599628,0.0012965326,0.5163942,0.0028252117,0.00038802385,0.00022292715,0.010627491,0.30726662,0.03202749,0.064078376,0.0010770669,0.06371009],"study_design_scores_gemma":[0.0007281172,0.000015962436,0.050692488,0.0002491012,0.0000063908024,0.000006381763,0.0003281649,0.9472584,0.0005073672,0.000058844704,0.00003387535,0.00011486615],"about_ca_topic_score_codex":0.0034362574,"about_ca_topic_score_gemma":0.0012122602,"teacher_disagreement_score":0.6399918,"about_ca_system_score_codex":0.000071491195,"about_ca_system_score_gemma":0.000071527844,"threshold_uncertainty_score":0.52969277},"labels":[],"label_agreement":null},{"id":"W4387185559","doi":"10.1002/rnc.6913","title":"Reinforced unscented Kalman filter for consensus achievement of uncertain multi‐agent systems subject to actuator faults","year":2023,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Control theory (sociology); Kalman filter; Computer science; Actuator; Artificial neural network; Lyapunov function; Extended Kalman filter; Fault detection and isolation; Fault tolerance; Fault (geology); Lyapunov stability; Nonlinear system; Artificial intelligence; Control (management)","score_opus":0.03748437472945259,"score_gpt":0.2946753903560604,"score_spread":0.2571910156266078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387185559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24566668,0.00016321338,0.743606,0.005183922,0.0035171153,0.0011740393,0.0006055466,0.000066640096,0.000016894779],"genre_scores_gemma":[0.9885809,0.000020028467,0.010229194,0.00026508202,0.0004376095,0.00003139119,0.000034977296,0.000016879168,0.0003839529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975908,0.000112139,0.0010358833,0.000249267,0.000711672,0.0003002387],"domain_scores_gemma":[0.99698263,0.0004799134,0.000717927,0.00023087782,0.00137618,0.00021248207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010792259,0.00020287832,0.00047238026,0.00043716238,0.000059931688,0.00012946934,0.00088939274,0.00007599098,0.0000031313166],"category_scores_gemma":[0.0004858938,0.000168139,0.00022067777,0.00022380328,0.000032754826,0.00017801297,0.00010837778,0.00012800402,0.0000123262125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008305003,0.0010150783,0.010012955,0.0004919546,0.007213684,0.0010613509,0.0030243706,0.76644135,0.14987642,0.009848204,0.019882048,0.022827584],"study_design_scores_gemma":[0.010119393,0.00042765762,0.0017576052,0.00028492432,0.0000488088,0.00008123219,0.00021407164,0.9783087,0.0011889027,0.000008285382,0.007361979,0.00019845994],"about_ca_topic_score_codex":0.00006738695,"about_ca_topic_score_gemma":0.00001330005,"teacher_disagreement_score":0.7429142,"about_ca_system_score_codex":0.00012334085,"about_ca_system_score_gemma":0.00015029027,"threshold_uncertainty_score":0.68565094},"labels":[],"label_agreement":null},{"id":"W4387319238","doi":"10.1109/tac.2023.3321866","title":"Distributed Byzantine-Resilient Observer for High-Order Integrator Multiagent Systems on Directed Graphs: An Edge-Based Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Observer (physics); Integrator; Network topology; Multi-agent system; Computer science; Directed graph; Strongly connected component; Mathematics; Algorithm; Artificial intelligence","score_opus":0.0229102764582032,"score_gpt":0.24984213637923852,"score_spread":0.22693185992103532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02600824,0.000031551426,0.95956606,0.00049275724,0.0029742743,0.0045663365,0.001518396,0.0048185075,0.000023886028],"genre_scores_gemma":[0.9913003,0.0000025892175,0.0033304119,0.00019078975,0.000070542184,0.0044498667,0.00035509,0.00008110873,0.00021932162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994926,0.0007328396,0.0011561648,0.0012316342,0.00094672665,0.0010066503],"domain_scores_gemma":[0.9958727,0.0011488007,0.00040538984,0.0015907718,0.00054627954,0.00043605396],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093040906,0.0007053919,0.00097256026,0.0006789816,0.0005662199,0.0005425252,0.001290944,0.00027905847,0.000016573342],"category_scores_gemma":[0.00012545071,0.0006112777,0.00045134773,0.0021325843,0.00008027163,0.0004166521,0.000004787916,0.00034679446,0.00019402087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002926148,0.0033368017,0.000051286504,0.00048670004,0.0008360333,0.000035912813,0.0003695218,0.96005595,0.0052271765,0.004715604,0.002231779,0.022360649],"study_design_scores_gemma":[0.008997109,0.00062597863,0.00111988,0.00018632894,0.000169678,0.000004059372,0.00013296268,0.98566455,0.0017932678,0.00003139384,0.00065551145,0.0006193033],"about_ca_topic_score_codex":0.00022306992,"about_ca_topic_score_gemma":0.00003847537,"teacher_disagreement_score":0.96529204,"about_ca_system_score_codex":0.00023405162,"about_ca_system_score_gemma":0.00021820309,"threshold_uncertainty_score":0.99963385},"labels":[],"label_agreement":null},{"id":"W4387369423","doi":"10.1177/09596518231199205","title":"Model-based event/self-triggered fixed-time consensus of nonlinear multi-agent systems","year":2023,"lang":"en","type":"article","venue":"Proceedings of the Institution of Mechanical Engineers Part I Journal of Systems and Control Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Protocol (science); Computer science; Multi-agent system; Nonlinear system; Network topology; Distributed computing; Consensus; Topology (electrical circuits); Event (particle physics); Control theory (sociology); Computer network; Mathematics; Control (management); Artificial intelligence; Medicine","score_opus":0.01437402375925867,"score_gpt":0.213156939385923,"score_spread":0.19878291562666434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387369423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10259084,0.0013395619,0.8923148,0.00022849957,0.0022758462,0.000972982,0.000097653494,0.00016069396,0.000019142646],"genre_scores_gemma":[0.99584866,0.00003256333,0.0039277785,0.0000054373963,0.00011691215,0.00002376167,0.0000010916169,0.000020937396,0.000022887452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967163,0.000032980042,0.0017986427,0.0002505346,0.00084374344,0.00035778433],"domain_scores_gemma":[0.99690247,0.00020161227,0.0014398709,0.0002467837,0.0010031831,0.00020611352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002006442,0.00030086067,0.0010651307,0.00040453504,0.00006390307,0.00006401483,0.00087842694,0.00018552825,3.9056616e-7],"category_scores_gemma":[0.0005478222,0.00023120015,0.0003685512,0.00065919687,0.000052566527,0.00027171255,0.000102174505,0.0002781231,0.0000016115439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048366877,0.00009537893,0.00003110259,0.00093573733,0.0003121293,0.000004170243,0.000077215765,0.88494545,0.0989519,0.014447377,0.00009121242,0.000059970465],"study_design_scores_gemma":[0.0033255802,0.00016250431,0.000030249807,0.0014905896,0.00013861692,0.00006566367,0.00007911152,0.9880756,0.006100131,0.000009381792,0.00033177898,0.00019077896],"about_ca_topic_score_codex":0.000016697804,"about_ca_topic_score_gemma":1.304949e-7,"teacher_disagreement_score":0.8932578,"about_ca_system_score_codex":0.00011779561,"about_ca_system_score_gemma":0.00018527615,"threshold_uncertainty_score":0.94280684},"labels":[],"label_agreement":null},{"id":"W4387757734","doi":"10.1109/lra.2023.3325776","title":"CoNi-MPC: Cooperative Non-inertial Frame Based Model Predictive Control","year":2023,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"National Natural Science Foundation of China","keywords":"Computer science; Inertial measurement unit; Inertial frame of reference; Frame (networking); Trajectory; Control theory (sociology); Model predictive control; Reference frame; Motion (physics); Controller (irrigation); Artificial intelligence; Robot; Computer vision; Simulation; Control (management)","score_opus":0.012176917279572886,"score_gpt":0.23071561507544971,"score_spread":0.21853869779587684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387757734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018517867,0.0000075288162,0.9672423,0.012362195,0.00066470297,0.0005110592,0.00007967778,0.00056498294,0.000049670813],"genre_scores_gemma":[0.9911578,0.0000018468162,0.005032515,0.0035277344,0.0001079371,0.000073254705,0.00003838606,0.000016188906,0.00004431486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838686,0.00010353532,0.00035627582,0.00042193543,0.0003747849,0.00035662227],"domain_scores_gemma":[0.99903536,0.0001892523,0.00016094837,0.00033976673,0.00014458102,0.00013011575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028688897,0.00021601052,0.00028656973,0.00016749007,0.00019440278,0.00033394317,0.00035434242,0.00009309746,0.0000019829483],"category_scores_gemma":[0.000050494706,0.00020331994,0.00006977355,0.0003966793,0.00006972854,0.0004727698,0.000040538205,0.00014620883,0.00008275122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008852782,0.000022832017,0.00012047664,0.000015341418,0.00004649757,0.0000135686905,0.00025415918,0.96702427,0.02612001,0.0015328074,0.0046289293,0.00021223137],"study_design_scores_gemma":[0.0019832607,0.00005103596,0.0016102057,0.000040424817,0.000022069311,0.0000021897272,0.000014488112,0.9952828,0.00067998306,0.000048817805,0.000046178873,0.00021852809],"about_ca_topic_score_codex":0.000013132062,"about_ca_topic_score_gemma":0.0000028534255,"teacher_disagreement_score":0.97264,"about_ca_system_score_codex":0.000070263,"about_ca_system_score_gemma":0.00009073427,"threshold_uncertainty_score":0.8291147},"labels":[],"label_agreement":null},{"id":"W4387805818","doi":"10.1109/tase.2023.3324526","title":"Observer-Based Event-Triggered Consensus Control of Multi-Agent Systems With Time-Varying Communication Delays","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observer (physics); Consensus; Multi-agent system; Computer science; Control theory (sociology); Control (management); Consensus algorithm; Event (particle physics); Control system; Control engineering; Engineering; Artificial intelligence; Algorithm","score_opus":0.023198354802304245,"score_gpt":0.24053291260262571,"score_spread":0.21733455780032146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387805818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.065956734,0.00005195642,0.93240786,0.00020846487,0.00028090723,0.00046257008,0.000029027322,0.00058980036,0.0000126561035],"genre_scores_gemma":[0.9948634,0.000006098712,0.004963782,0.000023565379,0.000005040303,0.00009611609,0.0000033568344,0.000011563232,0.000027090282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982391,0.00007049572,0.0004121548,0.00033038523,0.000643876,0.00030397245],"domain_scores_gemma":[0.9985237,0.00028125886,0.00016976021,0.0005642775,0.00033318342,0.00012783245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011184533,0.00016742601,0.00023946319,0.00053839915,0.00029963988,0.00021153405,0.0005216588,0.000055234337,0.0000017848369],"category_scores_gemma":[0.000039101138,0.00015481906,0.000046612382,0.0018167796,0.000105144434,0.00050641585,0.0000044644316,0.00011754879,0.000034256365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007689212,0.00004076787,0.000014937008,0.000050830586,0.000022166609,0.0000026057678,0.00017036534,0.94943583,0.04822545,0.00014004158,0.000010430115,0.0018789077],"study_design_scores_gemma":[0.0013180546,0.000060437065,0.0009503932,0.00018479799,0.00001689367,0.000007981361,0.000044324403,0.9892831,0.007941696,0.0000013812793,0.0000295254,0.00016140315],"about_ca_topic_score_codex":0.000051673687,"about_ca_topic_score_gemma":0.0000025250713,"teacher_disagreement_score":0.9289067,"about_ca_system_score_codex":0.00014384113,"about_ca_system_score_gemma":0.00017712594,"threshold_uncertainty_score":0.6313338},"labels":[],"label_agreement":null},{"id":"W4387933289","doi":"10.1109/wisee58383.2023.10289252","title":"Cooperative Fault-Tolerant Reconfigurable Control of Heterogeneous Wireless and Networked Space Robotics and Satellite Systems","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control reconfiguration; Actuator; Fault tolerance; Control engineering; Computer science; Synchronization (alternating current); Control theory (sociology); Robotics; Distributed computing; Multi-agent system; Controller (irrigation); Wireless; Control system; Robot; Engineering; Embedded system; Control (management); Artificial intelligence; Channel (broadcasting); Computer network; Telecommunications","score_opus":0.015376246569518196,"score_gpt":0.22383028332720128,"score_spread":0.2084540367576831,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387933289","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114347234,0.0050765197,0.87368405,0.0013805272,0.001302639,0.0018659101,0.00008276796,0.00064002513,0.0016203098],"genre_scores_gemma":[0.9981367,0.0003404986,0.00033861896,0.00006549418,0.000050889925,0.00003952914,0.000010740643,0.000017773078,0.0009997782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791217,0.00026264696,0.0005341254,0.00053887814,0.00028083165,0.00047135196],"domain_scores_gemma":[0.998473,0.00038385869,0.00021445953,0.0004954349,0.0002356559,0.00019758145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005522636,0.00025906434,0.0006338516,0.00011064368,0.00012975662,0.00034119457,0.0003883173,0.00011662797,0.0000025256236],"category_scores_gemma":[0.000031697946,0.00021679408,0.000051554365,0.00047190094,0.000097182674,0.0002620385,0.00008971956,0.00011039129,0.00002818052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016735819,0.00015905147,0.0051809843,0.00060203683,0.00092083827,0.00033125942,0.0023001402,0.8138058,0.022840803,0.1227503,0.0014562425,0.029485164],"study_design_scores_gemma":[0.0016352138,0.0001226546,0.0004304311,0.00011796253,0.000022368744,0.000069205766,0.00018034338,0.99513614,0.00079430465,0.000037791997,0.0011998066,0.00025377292],"about_ca_topic_score_codex":0.00021961551,"about_ca_topic_score_gemma":0.000040802082,"teacher_disagreement_score":0.8837894,"about_ca_system_score_codex":0.00003105257,"about_ca_system_score_gemma":0.00004702598,"threshold_uncertainty_score":0.8840606},"labels":[],"label_agreement":null},{"id":"W4388455620","doi":"10.1016/j.cnsns.2023.107672","title":"Finite-time robust formation control of multiple aerial robotic vehicles with uncertainties and time-varying complex perturbations","year":2023,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Zhejiang Sci-Tech University; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Controller (irrigation); Sliding mode control; Lyapunov stability; Computer science; Lyapunov function; Robust control; Position (finance); Control system; Control (management); Engineering; Physics; Artificial intelligence; Nonlinear system","score_opus":0.05243020772770432,"score_gpt":0.28976940117857813,"score_spread":0.23733919345087381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388455620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06712239,0.00011160345,0.9293192,0.0023916198,0.000046118053,0.00066518056,0.000029671835,0.00017078171,0.00014344453],"genre_scores_gemma":[0.9750013,0.000020134754,0.024791874,0.0000518473,0.000014415729,0.000027385804,0.00007017911,0.000005877242,0.000017027885],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985792,0.00015657757,0.00039333923,0.00026472934,0.00037452573,0.00023160575],"domain_scores_gemma":[0.9971556,0.0015254839,0.000190935,0.0006890763,0.0003624674,0.000076440854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007695891,0.00011815122,0.0002315534,0.00031923293,0.00047387558,0.00019000421,0.000793345,0.000045331446,0.0000026045154],"category_scores_gemma":[0.0008413206,0.00010380451,0.000021273716,0.0019112279,0.00048452336,0.0011635128,0.00031843293,0.00010545185,0.000016909773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026215099,0.00007970143,0.0026872433,0.000015328756,0.000007787925,4.551611e-7,0.0008535688,0.98103416,0.0058191414,0.0008838225,0.000011176327,0.00858138],"study_design_scores_gemma":[0.00092827243,0.00005765074,0.012709933,0.000043687556,0.000008277471,0.0000018013957,0.000075637545,0.98567826,0.0000526748,0.00012249607,0.00020237225,0.00011896363],"about_ca_topic_score_codex":0.00006122549,"about_ca_topic_score_gemma":0.000008023528,"teacher_disagreement_score":0.9078789,"about_ca_system_score_codex":0.00007127471,"about_ca_system_score_gemma":0.000097314754,"threshold_uncertainty_score":0.4233025},"labels":[],"label_agreement":null},{"id":"W4388473479","doi":"10.1016/j.automatica.2023.111357","title":"Cooperative concurrent targeting for planar arrays of point sources","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"National Key Research and Development Program of China; Brock University; National Natural Science Foundation of China","keywords":"Intersection (aeronautics); Planar; Orientation (vector space); Point (geometry); Boundary (topology); Geometry; Convergence (economics); Plane (geometry); Coordinate system; Topology (electrical circuits); Mathematics; Computer science; Mathematical analysis; Combinatorics; Engineering; Aerospace engineering","score_opus":0.022644044143961567,"score_gpt":0.26926562877331567,"score_spread":0.2466215846293541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388473479","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021618158,0.000080923135,0.9743631,0.0013100031,0.0005921764,0.00073536346,0.000090934205,0.0006751453,0.00053419446],"genre_scores_gemma":[0.98869556,0.0000023021803,0.010878108,0.00006375738,0.000055352393,0.00013165415,0.00004788188,0.000011036113,0.00011434874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986224,0.00008723584,0.0004426217,0.0002722385,0.00025569584,0.00031977452],"domain_scores_gemma":[0.9987411,0.0005200032,0.00020258808,0.00031636684,0.0001413069,0.000078647536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056765194,0.00013332763,0.00030006433,0.000091049566,0.00010770983,0.00008539956,0.00060800824,0.00004462136,0.000009398008],"category_scores_gemma":[0.00038409542,0.00011409528,0.00009227192,0.0003813155,0.000043401673,0.00019370319,0.00008695155,0.000056962414,0.00014323911],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028820701,0.00045810879,0.00110779,0.0013119833,0.0007875969,0.000050937182,0.029389247,0.009309669,0.065807745,0.6588639,0.1983213,0.03456291],"study_design_scores_gemma":[0.00076385046,0.000116132294,0.0004689637,0.00009525677,0.000013138756,0.0000022592515,0.0004885951,0.9866374,0.006568682,0.0009826095,0.0036900989,0.00017300877],"about_ca_topic_score_codex":0.000011930934,"about_ca_topic_score_gemma":0.0000017817811,"teacher_disagreement_score":0.97732776,"about_ca_system_score_codex":0.000028492008,"about_ca_system_score_gemma":0.00006388466,"threshold_uncertainty_score":0.46526706},"labels":[],"label_agreement":null},{"id":"W4388544048","doi":"10.1109/tsmc.2023.3326830","title":"A Self-Triggered Impulsive Approach to Group Consensus of MASs With Sensing/Actuation Delays","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Control theory (sociology); Impulse (physics); Computer science; Interval (graph theory); Controller (irrigation); Upper and lower bounds; Flexibility (engineering); Lyapunov function; Control (management); Mathematics; Artificial intelligence; Physics; Nonlinear system","score_opus":0.014504012891196667,"score_gpt":0.21175731130507344,"score_spread":0.1972532984138768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388544048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037425738,0.00016091613,0.95602334,0.00007082161,0.0015530854,0.0025199538,0.00014439128,0.0006650005,0.0014367552],"genre_scores_gemma":[0.99568313,0.000021196607,0.0032342444,0.000020729885,0.00008228858,0.00021409402,0.000014717922,0.00005477572,0.00067479425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99626327,0.00039538945,0.00096090476,0.0008737372,0.000906946,0.0005997671],"domain_scores_gemma":[0.99748373,0.00031439727,0.00045929782,0.0009963352,0.00039329982,0.0003529425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008149411,0.0004519126,0.00079082,0.00063186674,0.00023294443,0.00040627207,0.00049323007,0.00022490846,4.6875238e-7],"category_scores_gemma":[0.000008646865,0.00039930636,0.00012616189,0.0014078305,0.0000704219,0.00015016078,0.000008368545,0.00022743687,0.00008944679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007856419,0.0018189038,0.00029460355,0.0074431943,0.004115173,0.00040569625,0.032952026,0.85716325,0.036879335,0.03929794,0.0046823113,0.014161916],"study_design_scores_gemma":[0.0023616885,0.0006643621,0.00014248758,0.0005568755,0.00014484425,0.0003998292,0.003874763,0.988942,0.0008295783,0.000024126664,0.0013769551,0.0006824405],"about_ca_topic_score_codex":0.00065182516,"about_ca_topic_score_gemma":0.000031884658,"teacher_disagreement_score":0.95825744,"about_ca_system_score_codex":0.00018533549,"about_ca_system_score_gemma":0.00009248043,"threshold_uncertainty_score":0.99984586},"labels":[],"label_agreement":null},{"id":"W4388717346","doi":"10.48550/arxiv.2311.08270","title":"A consensus-based algorithm for non-convex multiplayer games","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz; European Commission","keywords":"Initialization; Computer science; Mathematical optimization; Convergence (economics); Swarm behaviour; Game theory; Regular polygon; Cournot competition; Limit (mathematics); Nash equilibrium; Algorithm; Mathematics; Mathematical economics","score_opus":0.09412424359455232,"score_gpt":0.21218545481452997,"score_spread":0.11806121121997765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388717346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065712286,0.000040690218,0.9870747,0.00034493167,0.002479962,0.0017186385,0.0005973903,0.00096676225,0.00020571478],"genre_scores_gemma":[0.9669363,0.000016332588,0.027983943,0.00019124911,0.00020316715,0.00003618376,0.00017514855,0.000071402625,0.004386294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964449,0.00017683505,0.00044349954,0.0019638685,0.00018964597,0.00078124925],"domain_scores_gemma":[0.99589795,0.0007761666,0.00052020245,0.0020067785,0.0004816613,0.00031721705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00054388546,0.00058827334,0.0007757643,0.00047460708,0.00021265533,0.00027267754,0.0027362183,0.00052902737,0.000010774295],"category_scores_gemma":[0.000114267685,0.0006952727,0.0006169827,0.000665067,0.00013995958,0.00017092605,0.0012465003,0.0005177952,0.00038947756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044402937,0.0014710944,0.0073398678,0.0019816374,0.0033556847,0.0062068966,0.0010491762,0.8086844,0.00081539666,0.058036976,0.04961078,0.061004065],"study_design_scores_gemma":[0.0028683785,0.0000676719,0.0005588239,0.0001865883,0.000106511696,0.0000030782332,0.000061497245,0.9899992,0.00027498184,0.0027718628,0.0023743075,0.00072710053],"about_ca_topic_score_codex":0.00032596185,"about_ca_topic_score_gemma":0.0000570219,"teacher_disagreement_score":0.96036506,"about_ca_system_score_codex":0.00034421583,"about_ca_system_score_gemma":0.00057190657,"threshold_uncertainty_score":0.99954987},"labels":[],"label_agreement":null},{"id":"W4388720929","doi":"10.1109/iecon51785.2023.10312069","title":"Decentralized Time-Varying Formation with Dynamic Leader Selection","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"FP7 Ideas; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Computer science; Process (computing); Selection (genetic algorithm); Set (abstract data type); Multi-agent system; Position (finance); Protocol (science); Negotiation; Distributed computing; Enhanced Data Rates for GSM Evolution; Point (geometry); Robot; Center (category theory); Control (management); Real-time computing; Artificial intelligence; Mathematics","score_opus":0.013109407388806164,"score_gpt":0.23688379963747114,"score_spread":0.22377439224866497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388720929","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017016165,0.000012284813,0.9784344,0.00093611336,0.00014279068,0.00030911446,0.000001951808,0.0014124,0.0017348063],"genre_scores_gemma":[0.99126756,0.0000043027744,0.005899334,0.00010876475,0.000015076976,0.000039216557,0.000047808095,0.000010451833,0.0026075065],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988954,0.000058000085,0.00019140031,0.00023915884,0.00028238396,0.0003336706],"domain_scores_gemma":[0.9995093,0.00004234521,0.00007731842,0.00022785454,0.00007939999,0.00006381165],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002016038,0.000111400004,0.00012355416,0.00013846775,0.000121551195,0.00020376967,0.0003106355,0.00004343912,0.000033189164],"category_scores_gemma":[0.000015955467,0.00008906665,0.000034753855,0.0009828096,0.0000101345195,0.0010296017,0.00004642659,0.00006341018,0.0015761819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043314428,0.0006426278,0.0069685536,0.00060099,0.0009671107,0.00029525938,0.010079325,0.13896908,0.35014483,0.07437422,0.1047222,0.31180266],"study_design_scores_gemma":[0.0008206576,0.00003471654,0.0012081206,0.000019991368,0.000005780723,0.00003589992,0.000028492925,0.99489707,0.0013091384,0.00008660541,0.0014188467,0.00013468713],"about_ca_topic_score_codex":0.000028323586,"about_ca_topic_score_gemma":0.000024641242,"teacher_disagreement_score":0.9742514,"about_ca_system_score_codex":0.00011064838,"about_ca_system_score_gemma":0.000034291428,"threshold_uncertainty_score":0.9992012},"labels":[],"label_agreement":null},{"id":"W4388903727","doi":"10.1016/j.ifacol.2023.10.1735","title":"Event-Triggered Consensus of Nonlinear Agents with Quantized Broadcasts: A Hybrid System Approach","year":2023,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Asynchronous communication; Computer science; Aperiodic graph; Broadcasting (networking); Consensus; Nonlinear system; Encoder; Distributed computing; Event (particle physics); Multi-agent system; Information exchange; Computer network; Artificial intelligence; Telecommunications; Mathematics","score_opus":0.02359600305254909,"score_gpt":0.2535754522411684,"score_spread":0.22997944918861932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388903727","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.68160045,0.0005892762,0.3039349,0.0016144098,0.0016404609,0.0031700595,0.0015576663,0.0030039833,0.0028887969],"genre_scores_gemma":[0.82922715,0.000012651238,0.16927367,0.00008346227,0.00018091792,0.000088604815,0.00032822866,0.000058156085,0.00074712967],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99572635,0.000325549,0.0009906682,0.001007541,0.0011033984,0.0008465026],"domain_scores_gemma":[0.99710053,0.00025123273,0.0005953649,0.0013915679,0.00035878093,0.0003025461],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00084673706,0.00049846503,0.0009768844,0.00036159047,0.00017101114,0.00014586127,0.0014251387,0.00013118214,0.000011374869],"category_scores_gemma":[0.00013941458,0.00040891118,0.0002741966,0.0016522164,0.00013713882,0.00021543136,0.00027603077,0.00026407812,0.00028328467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01272033,0.023506414,0.045235228,0.029921692,0.024987813,0.02940463,0.029792925,0.1297123,0.38195336,0.09709524,0.019611068,0.17605901],"study_design_scores_gemma":[0.0059115733,0.0002575657,0.0010870367,0.00031836273,0.00008688647,0.00024893368,0.0011169603,0.98816293,0.0013880586,0.00001015809,0.00084431714,0.000567241],"about_ca_topic_score_codex":0.0002221035,"about_ca_topic_score_gemma":0.000017106115,"teacher_disagreement_score":0.8584506,"about_ca_system_score_codex":0.00016537726,"about_ca_system_score_gemma":0.00027097182,"threshold_uncertainty_score":0.99983627},"labels":[],"label_agreement":null},{"id":"W4388904308","doi":"10.1016/j.ifacol.2023.10.926","title":"Reciprocal Safety Velocity Cones for Decentralized Collision Avoidance in Multi-Agent Systems","year":2023,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Collision avoidance; Workspace; Range (aeronautics); Collision; Control theory (sociology); Computer science; Reciprocal; Decentralised system; Euclidean space; Multi-agent system; Distributed computing; Algorithm; Mathematical optimization; Control (management); Robot; Artificial intelligence; Mathematics; Engineering; Mathematical analysis; Aerospace engineering","score_opus":0.05242178144553153,"score_gpt":0.30788103807029127,"score_spread":0.25545925662475977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388904308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11375617,0.0015637466,0.87183636,0.0031683154,0.0036640293,0.0039019138,0.0008917638,0.0011447645,0.00007291502],"genre_scores_gemma":[0.7015711,0.00067915843,0.29215556,0.00045040858,0.00041602866,0.0012228459,0.0008009627,0.00011110593,0.002592803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99603724,0.00030341028,0.0010020384,0.0010171382,0.0006196674,0.0010204728],"domain_scores_gemma":[0.9977315,0.0006203582,0.00030953364,0.0008042183,0.0002588307,0.00027555114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00145918,0.0004146683,0.0007517801,0.00024060813,0.00026849762,0.00024339781,0.0012361766,0.0002452773,0.0000050177314],"category_scores_gemma":[0.0006148961,0.0003870876,0.00021723572,0.0013351734,0.00006737223,0.00045549354,0.0002463554,0.0002476086,0.00023164313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073310556,0.008452115,0.049990848,0.004945398,0.002094098,0.002599727,0.026089692,0.39895195,0.2229712,0.08840631,0.0071541336,0.18101346],"study_design_scores_gemma":[0.0074010184,0.00011107174,0.014119218,0.00023157081,0.000016536584,0.000014080852,0.00034730232,0.9617129,0.00038731357,0.000030006999,0.015126937,0.00050205947],"about_ca_topic_score_codex":0.00032765913,"about_ca_topic_score_gemma":0.0002637453,"teacher_disagreement_score":0.5878149,"about_ca_system_score_codex":0.00045804164,"about_ca_system_score_gemma":0.00018801582,"threshold_uncertainty_score":0.9998581},"labels":[],"label_agreement":null},{"id":"W4388904464","doi":"10.1016/j.ifacol.2023.10.619","title":"Distributed optimization by Newton consensus over connected digraphs","year":2023,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hessian matrix; Newton's method; Quasi-Newton method; Computer science; Mathematical optimization; Computation; Distributed algorithm; Graph; Laplace operator; Mathematics; Algorithm; Theoretical computer science; Applied mathematics; Distributed computing; Nonlinear system","score_opus":0.010732077975522324,"score_gpt":0.23847112115517202,"score_spread":0.2277390431796497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388904464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10928854,0.0005018522,0.8605511,0.016527526,0.0021802152,0.0013894155,0.004259293,0.004631323,0.00067070615],"genre_scores_gemma":[0.84209216,0.00016857123,0.13439459,0.0017411988,0.0005481833,0.00022507086,0.015795156,0.00016438577,0.004870706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707323,0.00018612818,0.0005724929,0.0008125107,0.0006025207,0.0007530898],"domain_scores_gemma":[0.99800855,0.0003586875,0.00026627217,0.0008584585,0.00022121883,0.00028682814],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033021515,0.00038181958,0.00044275666,0.00020869164,0.00023542599,0.00029491648,0.0009262795,0.0002058672,0.000081622245],"category_scores_gemma":[0.00036625424,0.00037012532,0.00017493521,0.002133651,0.0000896805,0.00030834644,0.00020571618,0.00021928827,0.00026507315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00061971537,0.002667744,0.021096764,0.00046122,0.0024670926,0.0017561391,0.0033386578,0.4722043,0.24725573,0.035893776,0.17923519,0.033003677],"study_design_scores_gemma":[0.0025750953,0.00008967903,0.0027731806,0.000046826095,0.00003243199,0.000019579837,0.00010506114,0.9840801,0.000657494,0.000062349376,0.009033891,0.0005243297],"about_ca_topic_score_codex":0.00019545929,"about_ca_topic_score_gemma":0.000032715274,"teacher_disagreement_score":0.7328036,"about_ca_system_score_codex":0.000120097335,"about_ca_system_score_gemma":0.00009415371,"threshold_uncertainty_score":0.99987507},"labels":[],"label_agreement":null},{"id":"W4388905208","doi":"10.1016/j.ifacol.2023.10.117","title":"Rate analysis of dual averaging for nonconvex distributed optimization","year":2023,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Knut och Alice Wallenbergs Stiftelse; Vetenskapsrådet; Stiftelsen för Strategisk Forskning","keywords":"Measure (data warehouse); Rate of convergence; Convergence (economics); Dual (grammatical number); Mathematical optimization; Mathematics; Regular polygon; Norm (philosophy); Convex optimization; Distributed algorithm; Optimization problem; Computer science; Applied mathematics; Distributed computing","score_opus":0.021388582203056856,"score_gpt":0.27213711508058913,"score_spread":0.2507485328775323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388905208","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023905173,0.00003900933,0.9717463,0.001624692,0.0004291127,0.00043628804,0.0013623246,0.00040076245,0.000056341298],"genre_scores_gemma":[0.7527005,0.000024962514,0.24052201,0.00021653251,0.00018633332,0.00011707151,0.005678498,0.000033133227,0.0005209805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798745,0.00011107258,0.0005715404,0.00054326426,0.00033872397,0.0004479292],"domain_scores_gemma":[0.998232,0.00038986103,0.00032301468,0.0006180122,0.00031333134,0.00012379646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072248996,0.00022067368,0.0005526577,0.00048745496,0.00013202349,0.0001184308,0.000600057,0.000097630465,0.000027983064],"category_scores_gemma":[0.00028016273,0.00021410684,0.00032979797,0.0035813649,0.000037462716,0.00035511726,0.00014325902,0.00008524205,0.000027815599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003676964,0.00010719484,0.0019049937,0.00005680002,0.0013442363,0.000023167395,0.00054788426,0.9847989,0.006067339,0.0017528662,0.000102893275,0.0032569284],"study_design_scores_gemma":[0.0011446194,0.000048484468,0.0048888153,0.00002074513,0.00031738306,0.000001345498,0.000107843225,0.99241906,0.00047737415,0.000023892007,0.0003331405,0.00021730564],"about_ca_topic_score_codex":0.00006727652,"about_ca_topic_score_gemma":0.000030364337,"teacher_disagreement_score":0.7312243,"about_ca_system_score_codex":0.00008358027,"about_ca_system_score_gemma":0.00007838399,"threshold_uncertainty_score":0.87310237},"labels":[],"label_agreement":null},{"id":"W4388917616","doi":"10.1016/j.ifacol.2023.10.048","title":"Adaptive cooperative output regulation of general directed knowledge-based leader-following networks","year":2023,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Control theory (sociology); Observer (physics); Convergence (economics); Computer science; Controller (irrigation); Rate of convergence; Matrix (chemical analysis); Adaptive control; Output feedback; Tracking error; Exponential growth; State (computer science); Mathematical optimization; Control (management); Mathematics; Algorithm; Artificial intelligence; Key (lock)","score_opus":0.033059201919989185,"score_gpt":0.26910608235995853,"score_spread":0.23604688043996935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388917616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08679541,0.0008003116,0.90326154,0.0014661766,0.0024927082,0.001139358,0.00012851776,0.0019658378,0.001950155],"genre_scores_gemma":[0.9331823,0.0000051151687,0.06306628,0.000106716645,0.00035514554,0.000058414735,0.00030649477,0.00003414807,0.00288538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973981,0.0003458764,0.0005773362,0.00066507515,0.00045159803,0.0005620517],"domain_scores_gemma":[0.99826384,0.00033796218,0.0002573819,0.0006253862,0.0003595408,0.00015589269],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005148469,0.00033360912,0.00054854585,0.00025047557,0.00019023503,0.00009927934,0.00071826845,0.00018241045,0.000011265012],"category_scores_gemma":[0.00017265853,0.00031347084,0.00026218835,0.0018175967,0.00007426176,0.0003856359,0.00014526854,0.0002179472,0.000117127514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024593968,0.0007941429,0.0027787024,0.00010788325,0.00097333157,0.00015237008,0.005461011,0.8373089,0.0681734,0.00873064,0.001403521,0.073870145],"study_design_scores_gemma":[0.0016682108,0.00013579526,0.0098576555,0.00012842409,0.000035281144,0.0000018093907,0.00014136692,0.9856243,0.0016817853,0.000014995753,0.00038959488,0.00032077605],"about_ca_topic_score_codex":0.00009653142,"about_ca_topic_score_gemma":0.000089127796,"teacher_disagreement_score":0.8463869,"about_ca_system_score_codex":0.00014941215,"about_ca_system_score_gemma":0.0002016358,"threshold_uncertainty_score":0.99993175},"labels":[],"label_agreement":null},{"id":"W4389215222","doi":"10.1016/j.automatica.2023.111417","title":"Resilient and constrained consensus against adversarial attacks: A distributed MPC framework","year":2023,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robustness (evolution); Subsequence; Consensus; Adversarial system; Convergence (economics); Resilience (materials science); Distributed computing; Mathematical optimization; Multi-agent system; Mathematics; Artificial intelligence","score_opus":0.015372967291396193,"score_gpt":0.2615588138102654,"score_spread":0.2461858465188692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389215222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29597932,0.00018994857,0.67376536,0.01502713,0.0028443802,0.0019163624,0.00074210233,0.006058687,0.0034767261],"genre_scores_gemma":[0.9881807,0.000009415748,0.011151483,0.00028347684,0.00009983183,0.000062778054,0.00009692073,0.000018450202,0.00009693091],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741864,0.00021957306,0.00058749295,0.00061146374,0.00050894456,0.00065389567],"domain_scores_gemma":[0.9973744,0.0011182396,0.0002022766,0.0009068612,0.00011135288,0.0002868744],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058340793,0.0002785201,0.00042929148,0.0001562188,0.00023255774,0.0003227106,0.0007025134,0.00018728073,0.000016419597],"category_scores_gemma":[0.0012407396,0.00026461805,0.00010196705,0.000995527,0.00022026066,0.00015461794,0.00037181427,0.00022147837,0.00056054635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018226088,0.000701294,0.0058490764,0.0007411457,0.0014135767,0.0030393573,0.007683638,0.003958655,0.0078119733,0.67815465,0.20638849,0.08407585],"study_design_scores_gemma":[0.0023767897,0.00010646551,0.013970479,0.00029044904,0.000041020223,0.0000525681,0.00037306498,0.9680471,0.0001772406,0.0060305255,0.007973698,0.00056064443],"about_ca_topic_score_codex":0.000016908438,"about_ca_topic_score_gemma":0.0000037243067,"teacher_disagreement_score":0.9640884,"about_ca_system_score_codex":0.000082104765,"about_ca_system_score_gemma":0.00015671783,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W4389388812","doi":"10.1007/978-981-99-7661-4","title":"Fault-Tolerant Cooperative Control of Unmanned Aerial Vehicles","year":2023,"lang":"en","type":"book","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Government of Jiangsu Province; China Postdoctoral Science Foundation; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Fault tolerance; Control (management); Fault (geology); Computer science; Aeronautics; Engineering; Distributed computing; Artificial intelligence; Geology; Seismology","score_opus":0.017716388926870472,"score_gpt":0.2383340792310665,"score_spread":0.22061769030419603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389388812","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000071795024,0.00047173855,0.7932249,0.0010037752,0.0052623106,0.002615245,0.0012466848,0.0013539626,0.1947496],"genre_scores_gemma":[0.07992558,0.000020073478,0.0005227929,0.0003047861,0.0007185116,0.00013919003,0.00022057981,0.000085501866,0.918063],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99651694,0.00022583181,0.0010334406,0.0008596431,0.0008294089,0.00053472514],"domain_scores_gemma":[0.99693894,0.0005212474,0.0005929085,0.0011845948,0.0005844959,0.0001778056],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051141647,0.0005430283,0.0012959904,0.00024746577,0.00010475841,0.0002291107,0.0020766642,0.00045681602,0.000058251044],"category_scores_gemma":[0.00012381392,0.00046320804,0.00034698067,0.0002696571,0.00013400492,0.00027931982,0.00032018864,0.00034057556,0.0009892575],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025677675,0.0002488458,0.000018691211,0.00037231948,0.0019592526,0.0003525156,0.0010220628,0.003917771,0.003568956,0.61259985,0.36711732,0.00856563],"study_design_scores_gemma":[0.021439107,0.0012051451,0.00020382776,0.0016154863,0.00039079384,0.000041443196,0.0001472746,0.6111407,0.002382022,0.007392201,0.3507613,0.0032806739],"about_ca_topic_score_codex":0.000090485184,"about_ca_topic_score_gemma":0.000060587223,"teacher_disagreement_score":0.7927021,"about_ca_system_score_codex":0.00020484214,"about_ca_system_score_gemma":0.0008683892,"threshold_uncertainty_score":0.9997886},"labels":[],"label_agreement":null},{"id":"W4389388870","doi":"10.1007/978-981-99-7661-4_1","title":"Introduction","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Payload (computing); Computer science; Task (project management); Collision avoidance; Artificial intelligence; Real-time computing; Engineering; Computer security; Systems engineering; Collision","score_opus":0.023050927302889046,"score_gpt":0.21782595290089074,"score_spread":0.1947750255980017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389388870","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.672121e-8,0.0000464303,0.2770854,0.003881405,0.0040283916,0.00023261941,0.000014316121,0.0012737825,0.71343756],"genre_scores_gemma":[0.00014334577,0.000021688009,0.0010675788,0.00010323702,0.0019597544,0.000013923586,0.00006142269,0.000038330098,0.99659073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983423,0.000012895746,0.00032851016,0.0006678766,0.00041498546,0.00023346301],"domain_scores_gemma":[0.9984551,0.000044901793,0.00016557677,0.0011302476,0.000118001,0.00008614653],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00022936675,0.00025484004,0.00029742104,0.0001861609,0.0000558057,0.00019130162,0.00094174757,0.00023042508,0.00032150073],"category_scores_gemma":[0.000028033688,0.00023780506,0.00014720518,0.000064199834,0.000023246343,0.00021317413,0.00027075413,0.00022428083,0.017864227],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.279468e-7,0.0000024228816,2.3463429e-7,0.000008965273,0.00003935237,0.000016344307,0.000008770172,0.000010320414,0.00001562069,0.791076,0.19864897,0.010172349],"study_design_scores_gemma":[0.00014731805,0.000022606835,0.000008316488,0.000025461073,0.00001258286,0.00001441531,0.0000013480185,0.0037912796,0.00001924131,0.02363922,0.9720304,0.00028782932],"about_ca_topic_score_codex":0.0000137624165,"about_ca_topic_score_gemma":0.00001137988,"teacher_disagreement_score":0.7733814,"about_ca_system_score_codex":0.00009680362,"about_ca_system_score_gemma":0.000055616296,"threshold_uncertainty_score":0.9829005},"labels":[],"label_agreement":null},{"id":"W4389389246","doi":"10.1007/978-981-99-7661-4_4","title":"Distributed FTCC of Multi-UAVs Under Actuator Fault and Input Saturation","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Actuator; Aeronautics; Real-time computing; Computer security; Aerospace engineering; Engineering; Artificial intelligence","score_opus":0.03586540431923043,"score_gpt":0.25047186350989026,"score_spread":0.21460645919065982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389389246","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000100564605,0.00030239503,0.97288513,0.00096058036,0.0012858816,0.0011304156,0.0010033915,0.00082776626,0.021503901],"genre_scores_gemma":[0.29126313,0.00031144422,0.012344898,0.0003780811,0.00039436237,0.00009235967,0.0022026496,0.00021582133,0.69279724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973227,0.000045940687,0.00079731626,0.0008399145,0.00063403114,0.00036012052],"domain_scores_gemma":[0.9976328,0.00025242553,0.0005718007,0.0010100898,0.00033769195,0.00019521429],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029212408,0.0005072453,0.00071890256,0.0002465389,0.00009290625,0.00022342923,0.00086641754,0.0005360399,0.000036996236],"category_scores_gemma":[0.00009100964,0.00045113434,0.0001911357,0.00014062067,0.00010752418,0.000383129,0.00047118383,0.0003329724,0.00025212634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024434501,0.00007014709,0.000026549014,0.00022117302,0.00053568865,0.00005040444,0.00025167526,0.00017378337,0.0018120954,0.9726018,0.007991173,0.016241131],"study_design_scores_gemma":[0.017233739,0.0009780672,0.009782584,0.0028991322,0.0008834073,0.00019538381,0.0004060319,0.62610525,0.0037647968,0.060998384,0.26856944,0.008183802],"about_ca_topic_score_codex":0.00009292853,"about_ca_topic_score_gemma":0.00011969605,"teacher_disagreement_score":0.96054024,"about_ca_system_score_codex":0.00013693271,"about_ca_system_score_gemma":0.00014305352,"threshold_uncertainty_score":0.99979407},"labels":[],"label_agreement":null},{"id":"W4389389330","doi":"10.1007/978-981-99-7661-4_3","title":"Distributed FTCC of Multi-UAVs with Prescribed Performance","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Robustness (evolution); Computer science; Control (management); Distributed computing; Fuzzy logic; Distributed control system; Control theory (sociology); Artificial intelligence","score_opus":0.033041694166926656,"score_gpt":0.21855926066525824,"score_spread":0.1855175664983316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389389330","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009734989,0.00029487818,0.80202305,0.00031315183,0.0011396443,0.0018649837,0.0011899573,0.00177442,0.19130254],"genre_scores_gemma":[0.09901996,0.00009810177,0.007826012,0.000070545575,0.00014077603,0.00010346915,0.00066197227,0.00015737728,0.8919218],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966295,0.00003360645,0.00085654104,0.00096283306,0.0009505787,0.00056695833],"domain_scores_gemma":[0.99663407,0.00014214223,0.000679092,0.0018490441,0.00048415366,0.00021150074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031952886,0.0006450357,0.00093332183,0.00026275733,0.00009710735,0.00014164811,0.002137554,0.00037958202,0.00006715701],"category_scores_gemma":[0.000034969315,0.000512019,0.00022699594,0.00021940029,0.00014684933,0.00042043082,0.00053063745,0.00041337637,0.00064081687],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026556526,0.00040588947,0.0010450747,0.0017773339,0.0024680793,0.00046998603,0.0006919407,0.0031003759,0.0006152854,0.92501515,0.02905369,0.035091646],"study_design_scores_gemma":[0.011511223,0.0017224618,0.0060023265,0.004280966,0.00051008986,0.00013423672,0.00005571201,0.6501916,0.002351708,0.0014656063,0.31668574,0.005088372],"about_ca_topic_score_codex":0.00007523658,"about_ca_topic_score_gemma":0.000071429655,"teacher_disagreement_score":0.92354953,"about_ca_system_score_codex":0.00012454485,"about_ca_system_score_gemma":0.00022558979,"threshold_uncertainty_score":0.99973315},"labels":[],"label_agreement":null},{"id":"W4389398670","doi":"10.1007/978-981-99-7661-4_6","title":"Distributed Finite-Time FTCC of Multi-UAVs with Multiple Leader UAVs","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Containment (computer programming); Convex hull; Computer science; Controller (irrigation); Control theory (sociology); Control (management); Actuator; Control engineering; Engineering; Regular polygon; Mathematics; Artificial intelligence","score_opus":0.03487518624492587,"score_gpt":0.22309972580558285,"score_spread":0.188224539560657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389398670","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000018666968,0.0002589179,0.9181216,0.000679919,0.0009296144,0.0019354481,0.003092287,0.0020130782,0.07295049],"genre_scores_gemma":[0.03444266,0.000035972276,0.012251924,0.0001709763,0.00023418429,0.00012538023,0.0018570086,0.00027640857,0.9506055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99493873,0.000082571714,0.0012873376,0.0015270781,0.0012743823,0.0008898903],"domain_scores_gemma":[0.99457526,0.0009849628,0.000975218,0.002439732,0.0006646413,0.00036020594],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045996846,0.0010324408,0.001547846,0.00045374816,0.0001433771,0.000230843,0.0026369612,0.00071426574,0.00025107246],"category_scores_gemma":[0.0002374186,0.00085507793,0.00047417646,0.00035917974,0.00026346388,0.00043570966,0.00071233476,0.00064329815,0.0038111813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00087957334,0.0021945857,0.0023899525,0.0028735895,0.010602015,0.0034889537,0.0024909333,0.02320899,0.005002789,0.7644832,0.14288826,0.039497152],"study_design_scores_gemma":[0.01241962,0.0009127393,0.0011627874,0.002259863,0.00047328818,0.000083859144,0.000106688734,0.75945723,0.0010947989,0.0016249164,0.21577287,0.004631318],"about_ca_topic_score_codex":0.00019186441,"about_ca_topic_score_gemma":0.00019097238,"teacher_disagreement_score":0.90586966,"about_ca_system_score_codex":0.00018731097,"about_ca_system_score_gemma":0.00029459962,"threshold_uncertainty_score":0.99939},"labels":[],"label_agreement":null},{"id":"W4389398676","doi":"10.1007/978-981-99-7661-4_5","title":"Distributed FTCC of Multi-UAVs with Multiple Leader UAVs","year":2023,"lang":"en","type":"book-chapter","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Control (management); Trajectory; Computer science; Tracking (education); State (computer science); Control theory (sociology); Track (disk drive); Artificial intelligence; Algorithm; Physics","score_opus":0.04347193103245176,"score_gpt":0.2326402963658306,"score_spread":0.18916836533337886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389398676","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019429823,0.00027723104,0.9244409,0.0006184325,0.0011136831,0.0015908801,0.001692546,0.0016035239,0.06864336],"genre_scores_gemma":[0.081270345,0.000054433396,0.014479165,0.0001743257,0.0002627659,0.00013926286,0.0012476748,0.00028076553,0.90209126],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9954415,0.000061281535,0.0011328452,0.0013871775,0.0011883426,0.0007888671],"domain_scores_gemma":[0.9955021,0.0004313932,0.00086107844,0.0022797114,0.00060512446,0.00032059755],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039073304,0.0008993229,0.0013160447,0.000373836,0.0001240375,0.00019590734,0.0024283754,0.0006164158,0.00010695327],"category_scores_gemma":[0.000117231764,0.00073073624,0.0004100896,0.0002926628,0.00023438007,0.00039061802,0.0006263517,0.0005859647,0.0012837901],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025297323,0.00069047796,0.0016601078,0.0012093418,0.0036034063,0.0012176229,0.0009228387,0.0028642227,0.0013039963,0.91581756,0.04968677,0.020770678],"study_design_scores_gemma":[0.022331227,0.0014239246,0.0043760356,0.0039112135,0.00075553317,0.00022585732,0.00035461533,0.44233543,0.002295522,0.0037589509,0.510407,0.007824719],"about_ca_topic_score_codex":0.00026056913,"about_ca_topic_score_gemma":0.00048530786,"teacher_disagreement_score":0.9120586,"about_ca_system_score_codex":0.00018260384,"about_ca_system_score_gemma":0.00026275445,"threshold_uncertainty_score":0.99951434},"labels":[],"label_agreement":null},{"id":"W4389443959","doi":"10.1007/s10846-023-02018-7","title":"Neuro-Adaptive Formation Control of Nonlinear Multi-Agent Systems With Communication Delays","year":2023,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Nonlinear system; Bounded function; Lyapunov function; A priori and a posteriori; Multi-agent system; Backstepping; Artificial neural network; Matrix (chemical analysis); Layer (electronics); Computer science; Directed graph; Adaptive control; Mathematics; Control (management); Algorithm; Artificial intelligence; Mathematical analysis","score_opus":0.04056161917758585,"score_gpt":0.2608148717298956,"score_spread":0.22025325255230974,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389443959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045981416,0.0022672063,0.9891057,0.00029077393,0.002277399,0.0012422696,0.00002482493,0.00011891184,0.00007479777],"genre_scores_gemma":[0.9948147,0.00018014983,0.0045723054,0.00003349419,0.00017904969,0.000047598387,0.000014633803,0.00003493056,0.00012314695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.994569,0.00092507055,0.0024436263,0.0003031997,0.0012756787,0.00048344067],"domain_scores_gemma":[0.9928911,0.0007814741,0.0031686726,0.0010486008,0.0018463194,0.00026383906],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002570837,0.00035656878,0.0010484038,0.00064933486,0.00015197843,0.000323704,0.0018312122,0.00014841656,0.0000018064003],"category_scores_gemma":[0.00025440677,0.00026975202,0.0002803247,0.0010604691,0.00007818232,0.0010549123,0.00014283927,0.0003852124,0.000110171284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013135142,0.00026607388,0.0008980059,0.000286173,0.00046645905,0.00009925576,0.0013072452,0.9894433,0.0012489688,0.0042260895,0.0008801445,0.0007469145],"study_design_scores_gemma":[0.0018488684,0.00067057,0.00053206156,0.0012231489,0.00011513332,0.0006419076,0.0021985834,0.9913239,0.00038588684,0.000010617407,0.00079871155,0.0002506293],"about_ca_topic_score_codex":0.00021717248,"about_ca_topic_score_gemma":0.000013114107,"teacher_disagreement_score":0.99021655,"about_ca_system_score_codex":0.00035433323,"about_ca_system_score_gemma":0.00020015969,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W4389665344","doi":"10.1109/iros55552.2023.10342286","title":"On Cyber-Attacks Mitigation for Distributed Trajectory Generators","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Memorial University of Newfoundland","funders":"","keywords":"Computer science; Trajectory; Distributed computing; Invariant (physics); Decomposition; Mechanism (biology); Process (computing); Computer security; Mathematics","score_opus":0.020490842649372044,"score_gpt":0.2641454467349633,"score_spread":0.24365460408559128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389665344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059594836,0.000015082273,0.93448406,0.0013353999,0.0012805862,0.00071009697,0.00024913708,0.0013126625,0.0010181369],"genre_scores_gemma":[0.99497044,0.0000014578245,0.0026301388,0.00036652837,0.0001650901,0.0002861222,0.00049918756,0.000018913981,0.0010621069],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.000073976444,0.0003151649,0.00049948704,0.00033334608,0.00044038022],"domain_scores_gemma":[0.9987467,0.00031669307,0.000095405165,0.00057405554,0.00012518908,0.00014196536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003791297,0.00018499573,0.00020266208,0.00015371332,0.0001686147,0.00020103535,0.00064544025,0.00009639773,0.000015573738],"category_scores_gemma":[0.00014207415,0.00016726664,0.00013939767,0.00075330585,0.000021259631,0.0002806778,0.00006426175,0.00007677172,0.0004879225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037412585,0.0002151529,0.00075748534,0.000070310736,0.00017053286,0.00003394505,0.00036299828,0.011271155,0.013144471,0.40072483,0.5452769,0.02793483],"study_design_scores_gemma":[0.003510603,0.00032959698,0.010910077,0.000052446067,0.000023897872,0.0000056444196,0.00009771296,0.90285516,0.02878619,0.0057435045,0.046887834,0.0007973492],"about_ca_topic_score_codex":0.000019128232,"about_ca_topic_score_gemma":0.000022099748,"teacher_disagreement_score":0.93537563,"about_ca_system_score_codex":0.00011424071,"about_ca_system_score_gemma":0.000065626635,"threshold_uncertainty_score":0.68209356},"labels":[],"label_agreement":null},{"id":"W4390285456","doi":"10.1109/tcst.2023.3343596","title":"Edge-Based Communication-Triggered Formation Tracking Control With Application to Multiple Mobile Robots","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Control Systems Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Lyapunov function; Controller (irrigation); Mobile robot; Exponential stability; Computer science; Linear matrix inequality; Mathematics; Mathematical optimization; Robot; Control (management); Artificial intelligence; Nonlinear system","score_opus":0.011300177409197847,"score_gpt":0.23489869833161878,"score_spread":0.22359852092242094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390285456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005189666,0.00013279174,0.9821753,0.0028945662,0.0005433141,0.005280077,0.00016303686,0.0035657187,0.000055547163],"genre_scores_gemma":[0.9874676,0.000006424446,0.0014389306,0.00021489366,0.000036524143,0.010661057,0.0000278789,0.00005102901,0.00009567832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966874,0.00032567675,0.0009142427,0.00078592345,0.0005584193,0.00072834926],"domain_scores_gemma":[0.99583316,0.00073351554,0.00045395558,0.002228066,0.0005597365,0.0001915719],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007804328,0.00042039482,0.00071001507,0.0014614206,0.0006021653,0.00028773706,0.0016877069,0.00040346588,0.0000028561942],"category_scores_gemma":[0.000041649648,0.00039641402,0.00015265918,0.0024599384,0.00009531474,0.0006355905,0.000006514179,0.0004494979,0.00062274316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017468253,0.00024211638,0.000115315765,0.000067264096,0.00015522225,0.000010032356,0.00015275287,0.9397506,0.019348431,0.0013412999,0.00023844918,0.038403828],"study_design_scores_gemma":[0.007500299,0.00043711104,0.0001371978,0.00017544933,0.000064696746,0.00003825027,0.00021541935,0.98053277,0.0069157104,0.000046698693,0.0034865104,0.00044987505],"about_ca_topic_score_codex":0.00018186583,"about_ca_topic_score_gemma":0.00034403033,"teacher_disagreement_score":0.9822779,"about_ca_system_score_codex":0.0003955535,"about_ca_system_score_gemma":0.00012713503,"threshold_uncertainty_score":0.9998488},"labels":[],"label_agreement":null},{"id":"W4390496261","doi":"10.1016/j.automatica.2023.111489","title":"Adaptive output observers-based distributed tracking","year":2024,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Beijing Institute of Technology Research Fund Program for Young Scholars; Beijing Association for Science and Technology; National Natural Science Foundation of China","keywords":"Control theory (sociology); Observer (physics); Tracking (education); Computer science; Controller (irrigation); State observer; Dimension (graph theory); Adaptive control; Multi-agent system; Control engineering; Control (management); Engineering; Mathematics; Artificial intelligence; Nonlinear system","score_opus":0.037408914206249075,"score_gpt":0.2617055551027377,"score_spread":0.2242966408964886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390496261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034749336,0.00038130852,0.9880859,0.0025415549,0.0010900942,0.00038564394,0.00011800192,0.0027510833,0.0011714357],"genre_scores_gemma":[0.9881709,8.4433606e-7,0.011254167,0.00017636271,0.000080497346,0.0000658496,0.000052341275,0.000021963184,0.00017703975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785733,0.00014296686,0.00043894534,0.0005652801,0.00050770055,0.00048780118],"domain_scores_gemma":[0.9984286,0.0004483945,0.00008641124,0.00077107886,0.00010020676,0.00016530122],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00041403816,0.00025067962,0.0002983045,0.00013252262,0.00012286699,0.0008060475,0.0010314565,0.00010130237,0.000031777534],"category_scores_gemma":[0.00015052325,0.00022524543,0.00019165427,0.00077338977,0.00004804635,0.00068833353,0.00012746122,0.0001955694,0.00091219903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003881834,0.00081607356,0.0009928556,0.0010191243,0.00104791,0.0022971493,0.0028374083,0.009809147,0.0018960604,0.602131,0.06807323,0.30904117],"study_design_scores_gemma":[0.00038611158,0.000065174405,0.0037132974,0.0002600304,0.000030905092,0.000012494876,0.00003510633,0.98401916,0.00046251292,0.0010672802,0.009679154,0.00026874794],"about_ca_topic_score_codex":0.000032064487,"about_ca_topic_score_gemma":0.0000049717696,"teacher_disagreement_score":0.98469603,"about_ca_system_score_codex":0.00019717858,"about_ca_system_score_gemma":0.00021477217,"threshold_uncertainty_score":0.9998657},"labels":[],"label_agreement":null},{"id":"W4390569937","doi":"10.1016/j.automatica.2023.111497","title":"Protocol selection for second-order consensus against disturbance","year":2024,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Basic Research Program of Shaanxi Province; Young Scientists Fund; Program for New Century Excellent Talents in University; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; University of Alberta","keywords":"Disturbance (geology); Protocol (science); Laplacian matrix; Control theory (sociology); Position (finance); Computer science; Transformation (genetics); Eigenvalues and eigenvectors; Selection (genetic algorithm); Graph; Signed graph; Order (exchange); Topology (electrical circuits); Mathematics; Control (management); Theoretical computer science; Physics; Artificial intelligence; Combinatorics","score_opus":0.017515244184434335,"score_gpt":0.29196886353997265,"score_spread":0.2744536193555383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390569937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010729141,0.000040984916,0.9267876,0.0018114832,0.00081353803,0.062103823,0.000044533084,0.0021689176,0.005156204],"genre_scores_gemma":[0.6699798,1.9349106e-7,0.063964725,0.00050082436,0.00030896108,0.2602739,0.000022360664,0.000052297222,0.0048969355],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851125,0.00006885998,0.00038114924,0.0004591667,0.00022581623,0.0003537605],"domain_scores_gemma":[0.99899876,0.0003033693,0.00008472257,0.00039313722,0.00013585298,0.000084144755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003213744,0.00018027455,0.00021031771,0.00008359644,0.00012523094,0.0005016297,0.00044379712,0.000076376484,0.000030425794],"category_scores_gemma":[0.0001435469,0.0001558286,0.0000960905,0.00050842244,0.000032858028,0.00023423077,0.00006116766,0.00010720185,0.00025319553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058091267,0.0004684664,0.00040002857,0.0051319776,0.0006496438,0.00008781541,0.001885086,0.000844598,0.019873811,0.39986584,0.36248243,0.20825222],"study_design_scores_gemma":[0.00053422054,0.00006031495,0.00024699848,0.00011732553,0.000007854918,0.000017544404,0.0000073739216,0.8105488,0.0010152718,0.0013889881,0.18587747,0.00017785985],"about_ca_topic_score_codex":0.000005097293,"about_ca_topic_score_gemma":0.0000101683545,"teacher_disagreement_score":0.8628229,"about_ca_system_score_codex":0.000109420296,"about_ca_system_score_gemma":0.00018957687,"threshold_uncertainty_score":0.6354506},"labels":[],"label_agreement":null},{"id":"W4390788172","doi":"10.1109/tase.2024.3349634","title":"Event-Based Adaptive Sliding-Mode Containment Control for Multiple Networked Mechanical Systems With Parameter Uncertainties","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Special Project for Research and Development in Key areas of Guangdong Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Adaptive control; Containment (computer programming); Sliding mode control; Estimator; Lyapunov function; Computer science; Lyapunov stability; Bounded function; Adaptive system; Event (particle physics); Nonlinear system; Control engineering; Engineering; Control (management); Mathematics; Artificial intelligence","score_opus":0.015132996712832289,"score_gpt":0.2384357607614916,"score_spread":0.22330276404865929,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390788172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005231866,0.00007272315,0.9916917,0.0002525536,0.0012511191,0.00085896533,0.000039669547,0.000597121,0.0000042629154],"genre_scores_gemma":[0.99214685,0.0000020012264,0.0071702753,0.000050606544,0.000031617663,0.0005649358,0.0000015500328,0.000014136715,0.000018052342],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982679,0.000032104224,0.00029343166,0.00048782234,0.0005439379,0.00037480885],"domain_scores_gemma":[0.99877745,0.000589124,0.00005445103,0.00025955623,0.00017970047,0.00013974492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007519384,0.00019774341,0.00022019024,0.0002964752,0.00025621214,0.0007063613,0.00031024215,0.000057620775,9.4528065e-7],"category_scores_gemma":[0.000030795418,0.00016145165,0.0000653658,0.0006485835,0.00004892349,0.00082461204,0.000002013624,0.000121581805,0.0000051419165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002861973,0.000023902467,0.0000013828452,0.000055043536,0.000043501313,0.0000029211951,0.00013632693,0.98552275,0.005462894,0.0047861864,0.000016353693,0.0039201165],"study_design_scores_gemma":[0.0009378369,0.00023397556,0.000023102019,0.0002483716,0.000028328528,0.000009818168,0.00008074742,0.99419564,0.003789479,0.000014406038,0.00023693292,0.0002013467],"about_ca_topic_score_codex":0.000037100588,"about_ca_topic_score_gemma":0.000007492574,"teacher_disagreement_score":0.98691493,"about_ca_system_score_codex":0.0002908469,"about_ca_system_score_gemma":0.00017841099,"threshold_uncertainty_score":0.68114585},"labels":[],"label_agreement":null},{"id":"W4390811581","doi":"10.1016/j.jfranklin.2024.01.009","title":"Hybrid protocols for leader–follower consensus of multi-agent systems with distributed delays","year":2024,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Consensus; Multi-agent system; Computer science; Distributed computing; Artificial intelligence","score_opus":0.04121331711846778,"score_gpt":0.2902255774758158,"score_spread":0.24901226035734803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390811581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009878303,0.001274382,0.970629,0.00136068,0.005658499,0.010676075,0.00039108982,0.000081779835,0.000050186012],"genre_scores_gemma":[0.98872775,0.000005691218,0.009052785,0.00005822937,0.0003569614,0.0014943928,0.000007189809,0.000029086159,0.00026794043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99699974,0.00016967865,0.0012826356,0.0003366883,0.0008045221,0.0004067476],"domain_scores_gemma":[0.9971418,0.00024135331,0.0009400212,0.00078582246,0.00072304596,0.00016797884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001274338,0.00030291744,0.00067605026,0.00017678947,0.00016805189,0.0003795556,0.0018383177,0.000095424664,0.0000020374164],"category_scores_gemma":[0.00026005966,0.0001774673,0.000494413,0.00046724707,0.00019974135,0.00049143686,0.00014612456,0.00038691857,0.00001081455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028250513,0.0035622828,0.0045968024,0.008810668,0.0109459385,0.004205752,0.0031691866,0.671895,0.039819323,0.101374686,0.130083,0.018712256],"study_design_scores_gemma":[0.008828273,0.00094830873,0.00059831707,0.005986725,0.0004253822,0.0027552168,0.00014566985,0.63888717,0.00854384,0.00031263585,0.33190155,0.0006669181],"about_ca_topic_score_codex":0.000041937477,"about_ca_topic_score_gemma":0.000011817458,"teacher_disagreement_score":0.9788494,"about_ca_system_score_codex":0.0002100302,"about_ca_system_score_gemma":0.0007019716,"threshold_uncertainty_score":0.7236906},"labels":[],"label_agreement":null},{"id":"W4390812429","doi":"10.1007/s12204-024-2695-2","title":"Event-Triggered Fixed-Time Consensus of Second-Order Nonlinear Multi-Agent Systems with Delay and Switching Topologies","year":2024,"lang":"en","type":"article","venue":"Journal of Shanghai Jiaotong University (Science)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Backstepping; Control theory (sociology); Multi-agent system; Network topology; Consensus; Nonlinear system; Convergence (economics); Computer science; Lyapunov stability; Upper and lower bounds; Topology (electrical circuits); Control (management); Mathematics; Adaptive control; Computer network; Artificial intelligence","score_opus":0.011344719607375446,"score_gpt":0.23334757717388901,"score_spread":0.22200285756651356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390812429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8638008,0.0010869602,0.13226402,0.00057940924,0.0012664744,0.00042043705,0.000047918216,0.000105906925,0.00042806487],"genre_scores_gemma":[0.98497725,0.000031338473,0.014213491,0.000019952706,0.000059816663,3.3465506e-7,8.011055e-7,0.000009899498,0.0006871066],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974175,0.00010925829,0.0005366195,0.0004901702,0.0009639218,0.0004825227],"domain_scores_gemma":[0.99746716,0.00021639302,0.0005791043,0.00040937908,0.0010233505,0.00030462828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018935727,0.00023639451,0.00051114423,0.0010524042,0.00036751444,0.00048490174,0.0015762576,0.00008717253,0.000012883045],"category_scores_gemma":[0.00011881848,0.00018614462,0.000121609766,0.0019239329,0.0007030541,0.0015160519,0.000429829,0.00032585446,0.000010235827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011663318,0.0018013723,0.01644157,0.0023383307,0.0030160723,0.017126389,0.030346539,0.032802593,0.83267504,0.03200805,0.0042896825,0.025988022],"study_design_scores_gemma":[0.004640743,0.0012094423,0.005896069,0.0015889908,0.0002645229,0.0024103168,0.010146544,0.954008,0.011646348,0.0000661294,0.007260222,0.0008626579],"about_ca_topic_score_codex":0.00014975485,"about_ca_topic_score_gemma":0.000019138775,"teacher_disagreement_score":0.9212054,"about_ca_system_score_codex":0.00045261724,"about_ca_system_score_gemma":0.0014227305,"threshold_uncertainty_score":0.75907576},"labels":[],"label_agreement":null},{"id":"W4391019872","doi":"10.1109/cdc49753.2023.10383490","title":"Gradient Dynamics in Linear Quadratic Network Games with Time-Varying Connectivity and Population Fluctuation","year":2023,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Convergence (economics); Computer science; Population; Focus (optics); Game theory; Quadratic equation; Mathematical optimization; Best response; Mathematical economics; Mathematics","score_opus":0.011668493439784376,"score_gpt":0.231976180093143,"score_spread":0.22030768665335862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391019872","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5545337,0.000021465048,0.4440365,0.0004201519,0.00017030044,0.0003409082,0.0000023333828,0.00027788442,0.00019673006],"genre_scores_gemma":[0.9959181,0.000003418016,0.0037582905,0.000037384034,0.000039403756,0.000026299096,0.00006876998,0.000007877091,0.000140442],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988779,0.00011494813,0.00021951502,0.00032458795,0.00020622021,0.00025686002],"domain_scores_gemma":[0.9993855,0.00017855503,0.000088635476,0.00025390767,0.000039941762,0.000053484684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004910337,0.00011612443,0.00018044845,0.00011672918,0.00008487902,0.00011725575,0.00015400612,0.00004478881,0.0000023925843],"category_scores_gemma":[0.00005855988,0.000098615565,0.000017922748,0.0008194698,0.000014264927,0.00043330193,0.000074046664,0.000072082585,0.00003764263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005779096,0.00011882122,0.41221812,0.00009980776,0.00007997662,0.00006010029,0.0011883122,0.38469347,0.00033113846,0.14543179,0.00040183312,0.05531881],"study_design_scores_gemma":[0.00040534828,0.000039031725,0.158428,0.000037880374,0.0000036482336,0.000003467639,0.00002786051,0.84000194,0.0000061260344,0.00092660484,0.000011904353,0.00010820857],"about_ca_topic_score_codex":0.000613463,"about_ca_topic_score_gemma":0.0009620875,"teacher_disagreement_score":0.45530844,"about_ca_system_score_codex":0.00020727182,"about_ca_system_score_gemma":0.000022104805,"threshold_uncertainty_score":0.4021426},"labels":[],"label_agreement":null},{"id":"W4391512456","doi":"10.1142/s0218126624502220","title":"Distributed Event-Triggered Algorithm with Network Independent Step-Size for Constraint-Coupled Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Journal of Circuits Systems and Computers","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Smoothness; Algorithm; Convexity; Convergence (economics); Computer science; Mathematical optimization; Constraint (computer-aided design); Event (particle physics); Function (biology); Optimization problem; Mathematics","score_opus":0.010586130907171181,"score_gpt":0.21997216388648033,"score_spread":0.20938603297930916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391512456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00066908315,0.0039063627,0.9895967,0.0003384227,0.0040643616,0.0011879242,0.000079947284,0.00013372448,0.000023444913],"genre_scores_gemma":[0.97098243,0.00006177891,0.02772646,0.000064649736,0.00096864643,0.00006597826,0.000027769742,0.00003962866,0.00006266517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685603,0.00018551073,0.0012123814,0.00048666718,0.0007280698,0.00053134636],"domain_scores_gemma":[0.9973538,0.0005498316,0.00082006195,0.00032961686,0.0006324233,0.0003142962],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014251695,0.00034953924,0.0007543583,0.0001869637,0.0001811376,0.001539739,0.00068774674,0.00015082525,0.0000020114599],"category_scores_gemma":[0.00003579853,0.00026721356,0.00020918128,0.00059112586,0.00006075134,0.0008292073,0.00007487032,0.00027971313,0.0000017570516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032321823,0.000123711,0.00018828666,0.00065022724,0.0011637245,0.00028832947,0.00039308835,0.9279825,0.00013520544,0.009932534,0.004267175,0.054842908],"study_design_scores_gemma":[0.0025499014,0.00056732266,0.00018443634,0.0016667494,0.00010389385,0.0013134362,0.00012208248,0.98954695,0.0000043725813,0.00014004401,0.0034758155,0.00032499508],"about_ca_topic_score_codex":0.000026430176,"about_ca_topic_score_gemma":0.0000026408193,"teacher_disagreement_score":0.9703133,"about_ca_system_score_codex":0.0002063727,"about_ca_system_score_gemma":0.0003722963,"threshold_uncertainty_score":0.999978},"labels":[],"label_agreement":null},{"id":"W4391582469","doi":"10.1109/tcyb.2024.3356810","title":"Robust Adaptive Leader-Following Formation Control of Nonlinear Multiagents Using Three-Layer Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Nonlinear system; Artificial neural network; Lyapunov function; Computer science; Lyapunov stability; Adaptive control; Controller (irrigation); Tracking error; Affine transformation; Robust control; Mathematics; Control (management); Artificial intelligence","score_opus":0.06368939657480842,"score_gpt":0.26406899811918777,"score_spread":0.20037960154437934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391582469","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017230514,0.00035415922,0.9783513,0.00011644433,0.0029940698,0.0005633198,0.00007631671,0.00026576017,0.000048094607],"genre_scores_gemma":[0.9861458,0.00000855804,0.013545755,0.000068235204,0.00010850788,0.00002725657,0.00000505997,0.00003423289,0.000056584624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978955,0.00012496272,0.00061185885,0.0004362939,0.0005032582,0.00042817421],"domain_scores_gemma":[0.9988814,0.00024021092,0.00014037757,0.00048702495,0.00012765867,0.00012331203],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026983072,0.00028718475,0.00034518258,0.00022727097,0.00015780989,0.00022168069,0.00051379314,0.00017179342,0.0000094406005],"category_scores_gemma":[0.0000063003345,0.00028289043,0.00033810688,0.00058591476,0.00004891679,0.0007816891,0.0000047500025,0.00039843653,0.000029887547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024226194,0.00011103296,0.000015300446,0.000028671251,0.00018140471,0.000028990547,0.00031866648,0.9763067,0.0018683659,0.00015515307,0.000019385927,0.020942135],"study_design_scores_gemma":[0.0010454787,0.0001264739,0.000061326165,0.00017910652,0.00015187982,0.00002176501,0.000057093195,0.9954775,0.0025414254,0.000018096387,0.00007206781,0.00024776746],"about_ca_topic_score_codex":0.00013447115,"about_ca_topic_score_gemma":0.00011085776,"teacher_disagreement_score":0.9689153,"about_ca_system_score_codex":0.00017047348,"about_ca_system_score_gemma":0.000057869216,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W4391632175","doi":"10.1109/tie.2024.3363723","title":"Intelligent Collective Escape of Swarm Robots Based on a Novel Fish-Inspired Self-Adaptive Approach With Neurodynamic Models","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Swarm robotics; Robot; Robustness (evolution); Computer science; Flexibility (engineering); Ant robotics; Artificial neural network; Adaptive behavior; Collective behavior; Artificial intelligence; Simulation; Mobile robot; Robot control; Biology; Mathematics","score_opus":0.03848316073767467,"score_gpt":0.2280746071741315,"score_spread":0.18959144643645684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391632175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021220546,0.000045278368,0.993194,0.00038429847,0.0008586385,0.0015765796,0.00016625029,0.0005520638,0.0011008695],"genre_scores_gemma":[0.99459404,0.000011193765,0.0045696213,0.00012967068,0.00007667771,0.00032731952,0.000012542881,0.000059350423,0.00021956034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99652606,0.00023498098,0.0006143529,0.0010400385,0.0008608035,0.00072376314],"domain_scores_gemma":[0.9982018,0.000402535,0.00019948017,0.00079359126,0.00021983984,0.00018276152],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039860487,0.00049869734,0.00055577804,0.00060405495,0.00021753032,0.00023388257,0.0008576068,0.00034809046,0.0000055242203],"category_scores_gemma":[0.000009290008,0.00044975165,0.000283023,0.0023386136,0.000067108274,0.00045865212,0.00000474977,0.0013052499,0.000013484375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006462273,0.0012687547,2.7856083e-7,0.000026097649,0.00039883947,0.000011034107,0.00035749673,0.9862528,0.0006709727,0.0057627694,0.00013367667,0.004471082],"study_design_scores_gemma":[0.0025723805,0.002702574,0.0000014889351,0.00016235634,0.00016036285,0.00001992073,0.000041894178,0.9799517,0.013648728,0.00014713223,0.00018772784,0.00040373538],"about_ca_topic_score_codex":0.00007941064,"about_ca_topic_score_gemma":0.00005289067,"teacher_disagreement_score":0.992472,"about_ca_system_score_codex":0.0015077587,"about_ca_system_score_gemma":0.0022006119,"threshold_uncertainty_score":0.99979544},"labels":[],"label_agreement":null},{"id":"W4391690127","doi":"10.3389/fcomp.2023.1125124","title":"Secure dynamic event-triggering control for consensus under asynchronous denial of service","year":2024,"lang":"en","type":"article","venue":"Frontiers in Computer Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; Defence Research and Development Canada; Concordia University","funders":"Ministère de la Défense Nationale","keywords":"Denial-of-service attack; Asynchronous communication; Event (particle physics); Computer security; Computer science; Denial; Service (business); Computer network; Distributed computing; Business; Psychology; Operating system; The Internet","score_opus":0.007723627846498698,"score_gpt":0.24906510317307692,"score_spread":0.24134147532657824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391690127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011057733,0.0012725622,0.97476625,0.0021601734,0.009578835,0.00085124414,0.000055405668,0.00023054151,0.000027224487],"genre_scores_gemma":[0.81959975,0.0000033711356,0.17993632,0.000270626,0.00010879263,0.000049761125,0.0000032066719,0.0000152010525,0.00001296907],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677753,0.0000984122,0.00065905653,0.0010473843,0.00065429014,0.0007632973],"domain_scores_gemma":[0.99829787,0.00027565152,0.00017039906,0.0007755152,0.00030737018,0.00017318102],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013744624,0.00028231475,0.0004947677,0.00060489355,0.00016193073,0.0005110725,0.0024004448,0.00010811332,0.0000012520367],"category_scores_gemma":[0.000046073776,0.0002761493,0.0001487459,0.0021277447,0.00026343472,0.00065462885,0.00032949503,0.00020740877,0.000009881756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020713474,0.0005347147,0.0026181352,0.0016967726,0.0004969633,0.00034838813,0.0046967436,0.41171238,0.014604816,0.09943113,0.00999872,0.4536541],"study_design_scores_gemma":[0.0013150697,0.000104724015,0.0009210128,0.00023027693,0.000015302347,0.00004251912,0.0000313982,0.992063,0.00034104314,0.0041478793,0.0004969192,0.00029089165],"about_ca_topic_score_codex":0.000043595443,"about_ca_topic_score_gemma":0.00002850588,"teacher_disagreement_score":0.808542,"about_ca_system_score_codex":0.00047976506,"about_ca_system_score_gemma":0.0008155518,"threshold_uncertainty_score":0.99996907},"labels":[],"label_agreement":null},{"id":"W4391694563","doi":"10.1139/dsa-2023-0039","title":"Cloud-based mathematical models for self-organizing swarms of UAVs: design and analysis","year":2024,"lang":"en","type":"article","venue":"Drone Systems and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cloud computing; Computer science; Operating system","score_opus":0.024301684629948594,"score_gpt":0.2544571183239509,"score_spread":0.23015543369400232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391694563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069051713,0.0018744996,0.99546885,0.00020029763,0.00005019537,0.0013563652,0.00006950253,0.00021420752,0.00007557157],"genre_scores_gemma":[0.95704275,0.00000918985,0.041793384,0.0000094679235,0.00006171131,0.0010005007,0.000014612571,0.000012631595,0.0000557326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998821,0.00005236924,0.0003995728,0.0003967569,0.00016076337,0.00016953444],"domain_scores_gemma":[0.9989245,0.0003624529,0.00010119551,0.00042235845,0.00009498959,0.00009452296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054506015,0.00012856637,0.00033382198,0.00016225886,0.000107030064,0.00026378102,0.00024417447,0.000063929634,7.8229334e-7],"category_scores_gemma":[0.000008173841,0.000110945,0.00007683906,0.00067665835,0.000029969686,0.00016283043,0.000044670902,0.00004629901,0.0000054448615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030996603,0.00010541,0.00003557267,0.0010912695,0.00050315505,0.0000010325994,0.00055146764,0.021310305,0.001416307,0.97270954,0.00018192871,0.0020909137],"study_design_scores_gemma":[0.00021018629,0.000028096227,0.000011899954,0.000052738127,0.00026532135,0.0000053583476,0.00007179954,0.9924294,0.00023861513,0.005382242,0.0011886681,0.00011567786],"about_ca_topic_score_codex":0.0000223397,"about_ca_topic_score_gemma":6.5660106e-7,"teacher_disagreement_score":0.9711191,"about_ca_system_score_codex":0.00003072222,"about_ca_system_score_gemma":0.000052568994,"threshold_uncertainty_score":0.4524206},"labels":[],"label_agreement":null},{"id":"W4391893846","doi":"10.1177/00368504241227620","title":"Data-based bipartite formation control for multi-agent systems with communication constraints","year":2024,"lang":"en","type":"article","venue":"Science Progress","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Government of Jiangsu Province; National Natural Science Foundation of China; Higher Education Discipline Innovation Project; York University","keywords":"Bipartite graph; Computer science; Convergence (economics); Network topology; Multi-agent system; Topology (electrical circuits); Linearization; Scheme (mathematics); Telecommunications network; Distributed computing; Theoretical computer science; Mathematics; Nonlinear system; Artificial intelligence; Computer network","score_opus":0.07682104465750239,"score_gpt":0.33884171117725,"score_spread":0.2620206665197476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391893846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000985203,0.0019444796,0.991679,0.0012446216,0.00082116487,0.0022658675,0.00044451555,0.0005486294,0.00006650631],"genre_scores_gemma":[0.9549254,0.000003106173,0.04412135,0.00007141561,0.000038529513,0.0006747395,0.00012698503,0.000012650336,0.000025821779],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99724215,0.00013509291,0.0004554339,0.0007923934,0.000793326,0.0005815951],"domain_scores_gemma":[0.9970056,0.00018706462,0.000215438,0.0019274711,0.00047482472,0.0001896261],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0030836242,0.00020694108,0.00023647999,0.00026735704,0.0004737684,0.0026024343,0.0036327832,0.000053852284,0.000001795514],"category_scores_gemma":[0.00011447069,0.00015661513,0.000045228335,0.0010996908,0.00094693486,0.0035402505,0.00023954098,0.00012383098,0.000055004417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026855682,0.0014960986,0.006349967,0.003528004,0.00046553847,0.00013782212,0.004112645,0.027290806,0.008871934,0.43360403,0.0062430524,0.50763154],"study_design_scores_gemma":[0.0013319582,0.000094660194,0.0002423567,0.0003803,0.000025688014,0.000025900865,0.00009444952,0.9898389,0.0004724678,0.000028320144,0.0072489004,0.00021611575],"about_ca_topic_score_codex":0.000015604044,"about_ca_topic_score_gemma":0.000015984157,"teacher_disagreement_score":0.9625481,"about_ca_system_score_codex":0.00019295099,"about_ca_system_score_gemma":0.0006060319,"threshold_uncertainty_score":0.99843293},"labels":[],"label_agreement":null},{"id":"W4391916513","doi":"10.1016/j.automatica.2024.111564","title":"Distributed state estimation for jointly observable linear systems over time-varying networks","year":2024,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Social connectedness; Observable; State (computer science); Observer (physics); Control theory (sociology); Computer science; Network topology; Linear system; Telecommunications network; Markov process; Exponential stability; Topology (electrical circuits); Mathematics; Control (management); Algorithm; Artificial intelligence","score_opus":0.016126672266512192,"score_gpt":0.25872735605169034,"score_spread":0.24260068378517816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391916513","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017612097,0.0006815532,0.99193645,0.00049846934,0.0015559867,0.0011673046,0.00020933161,0.0020012988,0.0001883722],"genre_scores_gemma":[0.94859177,0.000007133664,0.048638295,0.00011269482,0.00022908366,0.0004866923,0.0005476131,0.00006431888,0.0013223877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975968,0.00012293906,0.0007086761,0.000565138,0.0004032726,0.0006031469],"domain_scores_gemma":[0.99813986,0.00066333596,0.00016970166,0.00073028327,0.00013564265,0.00016115076],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075967296,0.00028010964,0.00041556396,0.00011012392,0.00018547295,0.0012321508,0.0007003544,0.0001164034,0.000015958718],"category_scores_gemma":[0.00018460774,0.0002545453,0.00015908736,0.0006317069,0.000027821423,0.0009854481,0.00015033741,0.00015559369,0.00044951134],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022174127,0.00014403323,0.000081460385,0.0014858148,0.00051621435,0.00008158031,0.0005354105,0.88503534,0.0013935007,0.038192704,0.05336035,0.019151397],"study_design_scores_gemma":[0.00045161246,0.00005964954,0.00023975618,0.000465807,0.000041985975,0.000018129329,0.0000041389803,0.9900544,0.00006638171,0.00077694847,0.00753749,0.000283687],"about_ca_topic_score_codex":0.00005415999,"about_ca_topic_score_gemma":0.0000010072462,"teacher_disagreement_score":0.9468306,"about_ca_system_score_codex":0.00020365162,"about_ca_system_score_gemma":0.00012549214,"threshold_uncertainty_score":0.9999907},"labels":[],"label_agreement":null},{"id":"W4392084896","doi":"10.1109/tits.2024.3363716","title":"Sensor Allocation and Online-Learning-Based Path Planning for Maritime Situational Awareness Enhancement: A Multi-Agent Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Safran Electronics (Canada)","funders":"Australian Research Council","keywords":"Situation awareness; Computer science; Situational ethics; Motion planning; Path (computing); Human–computer interaction; Knowledge management; Operations research; Artificial intelligence; Engineering; Computer network; Psychology; Aerospace engineering","score_opus":0.04700338751656685,"score_gpt":0.29659048986650405,"score_spread":0.2495871023499372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392084896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007056708,0.00057522056,0.98733443,0.0001605056,0.0018917762,0.0018118934,0.000579851,0.0005768831,0.000012728805],"genre_scores_gemma":[0.98427796,0.000035987414,0.012761888,0.00005450765,0.00009115971,0.0012981065,0.00083086843,0.000048902286,0.0006006034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695957,0.0001722656,0.00092378043,0.0009319458,0.0006207064,0.00039175144],"domain_scores_gemma":[0.99859387,0.00038232538,0.00018372448,0.00033704078,0.00032273226,0.00018032896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005333805,0.00038955265,0.00037615755,0.00043295743,0.00036196242,0.000489028,0.00032266063,0.00018436555,0.000010870478],"category_scores_gemma":[0.000008382709,0.00039466153,0.00022199641,0.00049668166,0.0000453703,0.00047816825,7.4429136e-7,0.0002929523,0.00003238765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008063027,0.00062295375,0.00013632585,0.0010222966,0.0002662749,0.00001545532,0.0026672082,0.9813253,0.001997713,0.0019433078,0.00006373125,0.009858798],"study_design_scores_gemma":[0.0007326264,0.00018148431,0.00028037184,0.00051816483,0.000102304824,0.000009516,0.0007808217,0.9897618,0.0037300012,0.000011214673,0.0034896182,0.00040207146],"about_ca_topic_score_codex":0.00013053272,"about_ca_topic_score_gemma":0.00002405581,"teacher_disagreement_score":0.97722125,"about_ca_system_score_codex":0.00021270227,"about_ca_system_score_gemma":0.00018727273,"threshold_uncertainty_score":0.9998505},"labels":[],"label_agreement":null},{"id":"W4392514722","doi":"10.1016/j.ins.2024.120419","title":"Performance-oriented design and analysis for direct data-driven control of multi-agent systems","year":2024,"lang":"en","type":"article","venue":"Information Sciences","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Youth Innovation Team Project for Talent Introduction and Cultivation in Universities of Shandong Province; National Natural Science Foundation of China","keywords":"Computer science; Convergence (economics); Affine transformation; Linearization; Nonlinear system; Network topology; Protocol (science); Multi-agent system; Control theory (sociology); Topology (electrical circuits); Function (biology); Control (management); Mathematical optimization; Algorithm; Mathematics; Artificial intelligence; Computer network","score_opus":0.06691679664605192,"score_gpt":0.2992203712030256,"score_spread":0.23230357455697365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392514722","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034677507,0.00046006468,0.9937105,0.00011800127,0.0007480253,0.00083502923,0.00029769453,0.00015546576,0.0002074222],"genre_scores_gemma":[0.98277944,0.000026029717,0.016953165,0.000032874985,0.000020922847,0.00009272774,0.00006322478,0.0000024159403,0.000029199848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811774,0.00009664661,0.00066246255,0.00032570623,0.0005393992,0.0002580125],"domain_scores_gemma":[0.99847835,0.0004329073,0.00026900004,0.00050345133,0.00023360031,0.000082674924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025079735,0.00013744434,0.0003154803,0.00060549215,0.00020793878,0.00080790557,0.0011276957,0.000046641406,0.0000019217073],"category_scores_gemma":[0.00015419774,0.000103808045,0.00007080847,0.0017118315,0.00013151158,0.0052449657,0.00014826257,0.00004529316,0.00001918242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038144106,0.00006876854,0.013020112,0.0007212812,0.0011722264,0.000002008318,0.0042137625,0.89926684,0.0004194815,0.016976727,0.0014579719,0.062642656],"study_design_scores_gemma":[0.0004596577,0.000088769564,0.001978601,0.00005214483,0.000105179315,0.0000035047935,0.00015144348,0.9895292,0.00007595358,0.000003159828,0.00743099,0.00012141805],"about_ca_topic_score_codex":0.00006638867,"about_ca_topic_score_gemma":0.0000027876144,"teacher_disagreement_score":0.9793117,"about_ca_system_score_codex":0.000040694216,"about_ca_system_score_gemma":0.00015733993,"threshold_uncertainty_score":0.77906525},"labels":[],"label_agreement":null},{"id":"W4393128998","doi":"10.1016/j.compchemeng.2024.108654","title":"Solving least-squares problems in directed networks: A distributed approach","year":2024,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Convergence (economics); Focus (optics); Least-squares function approximation; Linear equation; Algebraic number; Algebraic equation; Mathematics; Mathematical optimization; Computer science; Linear system; Exponential function; System of linear equations; Applied mathematics; Nonlinear system; Mathematical analysis","score_opus":0.008137832950225474,"score_gpt":0.19095936300606522,"score_spread":0.18282153005583976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393128998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044249846,0.0020278918,0.9892223,0.00014006265,0.0011230466,0.00037101682,0.000011656341,0.00260431,0.00007473261],"genre_scores_gemma":[0.9710156,0.0000070490764,0.028413968,0.00002588643,0.00026949824,0.00011034804,0.00010674123,0.000041755968,0.000009203668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974546,0.000040573148,0.00054569653,0.0008435381,0.00032583834,0.0007897773],"domain_scores_gemma":[0.9988714,0.0002761382,0.00005099738,0.0005351865,0.000048009253,0.00021829526],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029282854,0.00038209412,0.00044036514,0.00023293233,0.000036429396,0.0006129662,0.0011502939,0.00016997677,0.0000017831069],"category_scores_gemma":[0.00007854355,0.00038858585,0.00015916102,0.0014457473,0.000027505248,0.0005110415,0.00042861662,0.0005378675,0.000014902891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032438008,0.00010028303,0.00013126254,0.00040137555,0.00009902189,0.000095556905,0.00037406228,0.9722894,0.012518012,0.003620507,0.0011813238,0.009185991],"study_design_scores_gemma":[0.0004076898,0.000012086854,0.00023234576,0.0005789455,0.000008660607,0.000043075466,0.000005106618,0.9964623,0.00042652417,0.000035980956,0.0013728181,0.00041446768],"about_ca_topic_score_codex":0.00002649437,"about_ca_topic_score_gemma":4.997949e-7,"teacher_disagreement_score":0.9665906,"about_ca_system_score_codex":0.00031841482,"about_ca_system_score_gemma":0.000044512122,"threshold_uncertainty_score":0.9998566},"labels":[],"label_agreement":null},{"id":"W4394862989","doi":"10.1109/tac.2024.3389075","title":"A Robust Distributed MPC Framework for Multiagent Consensus With Communication Delays","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Computer science; Distributed computing; Control theory (sociology); Consensus; Robustness (evolution); Robust control; Control (management); Control system; Artificial intelligence; Engineering","score_opus":0.026136324609289902,"score_gpt":0.2588690886498565,"score_spread":0.23273276404056661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394862989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011528418,0.00034180895,0.9882056,0.0045247125,0.0009011609,0.002290083,0.00076201424,0.0017701626,0.000051604955],"genre_scores_gemma":[0.910681,0.00000793479,0.08751947,0.0002385993,0.00003562148,0.0013646728,0.000026228778,0.000042577514,0.000083899096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745816,0.00025701043,0.00066279783,0.000635595,0.00045814159,0.00052829],"domain_scores_gemma":[0.99541855,0.002589483,0.00017259881,0.0013955559,0.0002185458,0.0002052394],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005388624,0.0003825777,0.0004900505,0.00023130649,0.0004018489,0.0006169802,0.00088780763,0.00018893662,0.000042323394],"category_scores_gemma":[0.000055101802,0.00032282082,0.00027557518,0.0006656815,0.00010118,0.00027335456,0.0000036979018,0.00034182976,0.00014295873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042262816,0.0016358012,0.0000160192,0.0008885647,0.0031895624,0.00016687809,0.0025463318,0.62915313,0.0016165626,0.079317406,0.0035719888,0.27747512],"study_design_scores_gemma":[0.0027382483,0.0002455483,0.00005915169,0.00060237636,0.00023694296,0.00006347089,0.000091655216,0.99298424,0.00039604912,0.0011557067,0.0010589008,0.00036771415],"about_ca_topic_score_codex":0.000055354423,"about_ca_topic_score_gemma":0.00006525334,"teacher_disagreement_score":0.90952814,"about_ca_system_score_codex":0.00029115865,"about_ca_system_score_gemma":0.00021667057,"threshold_uncertainty_score":0.9999224},"labels":[],"label_agreement":null},{"id":"W4395084133","doi":"10.1177/02783649241230993","title":"Decentralized state estimation: An approach using pseudomeasurements and preintegration","year":2024,"lang":"en","type":"article","venue":"The International Journal of Robotics Research","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Observability; Robot; Covariance; Odometry; Autoencoder; Computer science; State (computer science); Artificial intelligence; Position (finance); State space; Mathematical optimization; Algorithm; Mathematics; Mobile robot; Artificial neural network","score_opus":0.17529898150385473,"score_gpt":0.42598398030436807,"score_spread":0.2506849988005133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395084133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015538269,0.0006653605,0.980323,0.0023309158,0.00083739066,0.00016952638,0.00000450522,0.000021334065,0.00010966267],"genre_scores_gemma":[0.9345204,0.000085247986,0.06513918,0.000025341122,0.00013372957,0.0000027931028,0.0000038584035,0.000009143097,0.0000802616],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966875,0.0004814324,0.00041454323,0.00017536402,0.0020252357,0.00021593856],"domain_scores_gemma":[0.99790287,0.0002705574,0.00012517456,0.00021654986,0.0013723124,0.000112558555],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004861886,0.000090228554,0.00012381354,0.00033685283,0.00011927866,0.0016698714,0.0014719821,0.000031151198,0.000004314343],"category_scores_gemma":[0.00029952294,0.000059520076,0.00005320674,0.00032081097,0.00007723289,0.0010867015,0.00018081027,0.000388278,0.0000068167965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015827843,0.00029118653,0.0004036686,0.00006233465,0.0007467986,0.00021121772,0.0034358916,0.81404483,0.019606885,0.08448557,0.0009916092,0.07556172],"study_design_scores_gemma":[0.0003601613,0.000055365574,0.00020318899,0.00011920763,0.000009869261,0.00038325493,0.00008568151,0.9922221,0.0005033949,0.0057737273,0.00022754422,0.000056521443],"about_ca_topic_score_codex":0.00004311382,"about_ca_topic_score_gemma":0.0000037714553,"teacher_disagreement_score":0.91898215,"about_ca_system_score_codex":0.0003086025,"about_ca_system_score_gemma":0.00032457686,"threshold_uncertainty_score":0.99936646},"labels":[],"label_agreement":null},{"id":"W4399608194","doi":"10.1007/s10846-024-02097-0","title":"Restoring Connectivity in Robotic Swarms – A Probabilistic Approach","year":2024,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"","keywords":"Swarm behaviour; Robot; Probabilistic logic; Swarm robotics; Computer science; Context (archaeology); Artificial intelligence; Process (computing); Path (computing); A priori and a posteriori; Set (abstract data type); Motion planning; Geography","score_opus":0.037732287204824945,"score_gpt":0.27319783178328133,"score_spread":0.2354655445784564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399608194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061413613,0.011606478,0.9698978,0.00031583398,0.010297289,0.00085652556,0.0000017024855,0.00015277762,0.00073023926],"genre_scores_gemma":[0.99586505,0.000053362903,0.0029668913,0.000016751215,0.0006687373,0.00004731402,0.0000016078678,0.000038075952,0.00034221247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487925,0.00064153486,0.0019972336,0.00063690206,0.0011733378,0.000671736],"domain_scores_gemma":[0.9970171,0.0008352163,0.00064377725,0.00080932927,0.00038802664,0.0003065786],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003905441,0.00040403107,0.0010665378,0.0008425706,0.00007625073,0.000997658,0.001594994,0.00017843216,0.000004455549],"category_scores_gemma":[0.0007330572,0.0003225502,0.00037512602,0.0013443003,0.000058489437,0.0009773967,0.00018095446,0.0007393308,0.000091003756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023607343,0.00036980995,0.0012140649,0.0009779729,0.0002477573,0.00077169033,0.0015115379,0.9531927,0.0003676362,0.0375988,0.00060340966,0.0031209877],"study_design_scores_gemma":[0.0004372825,0.00025564284,0.00068305334,0.0024080584,0.000066100445,0.001989739,0.000558055,0.9916487,0.00008554077,0.00052932487,0.0009608251,0.00037771984],"about_ca_topic_score_codex":0.00022866795,"about_ca_topic_score_gemma":0.000013870807,"teacher_disagreement_score":0.9897237,"about_ca_system_score_codex":0.0012795388,"about_ca_system_score_gemma":0.00044255407,"threshold_uncertainty_score":0.99992263},"labels":[],"label_agreement":null},{"id":"W4399768055","doi":"10.1109/tsmc.2024.3405486","title":"Specified-Time Distributed Control for Multiagent Systems Over Undirected and Directed Graphs: A Linear Operator Theoretic Framework","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Undirected graph; Operator (biology); Multi-agent system; Directed graph; Computer science; Control (management); Mathematics; Mathematical optimization; Theoretical computer science; Graph; Algorithm; Artificial intelligence","score_opus":0.01136726093906531,"score_gpt":0.23483538777050192,"score_spread":0.2234681268314366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399768055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010845723,0.010922211,0.9598426,0.00014743311,0.008620009,0.0050566136,0.0026485038,0.001766695,0.00015019742],"genre_scores_gemma":[0.99541926,0.00027420057,0.00036984077,0.000039960905,0.00041239162,0.0015886356,0.00005872318,0.00013231105,0.0017046968],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941495,0.0009113768,0.001497628,0.0016142981,0.00085989543,0.0009673075],"domain_scores_gemma":[0.99581325,0.0016212111,0.0003295259,0.0012135572,0.00040632737,0.0006160981],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0011733198,0.0008926212,0.0013571521,0.0005533791,0.0005167737,0.0028201598,0.00074907474,0.0005930196,0.000009678055],"category_scores_gemma":[0.000051589246,0.000777851,0.0003198531,0.0009996761,0.00021252163,0.00042283614,0.000014802671,0.00057053345,0.00010758437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014497185,0.0023619873,0.00039505606,0.01748712,0.011258689,0.0008366472,0.00794406,0.17976849,0.018281128,0.7382111,0.014743282,0.0072627375],"study_design_scores_gemma":[0.0024319624,0.00038356092,0.00012037384,0.0023778616,0.0003404189,0.00023311336,0.000355162,0.9793421,0.00016425419,0.000120244746,0.013204208,0.0009267132],"about_ca_topic_score_codex":0.00057677634,"about_ca_topic_score_gemma":0.000014140466,"teacher_disagreement_score":0.98457354,"about_ca_system_score_codex":0.00030125352,"about_ca_system_score_gemma":0.00013267648,"threshold_uncertainty_score":0.99946725},"labels":[],"label_agreement":null},{"id":"W4399801347","doi":"10.1109/ichms59971.2024.10555809","title":"Hard Act to Follow: A Practical Leader-Follower System using Curvilinear Formation Motion Plans","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Defence Research and Development Canada","funders":"","keywords":"Curvilinear coordinates; Motion (physics); Computer science; Control theory (sociology); Artificial intelligence; Mathematics; Geometry; Control (management)","score_opus":0.07108702294206193,"score_gpt":0.31258154753960116,"score_spread":0.24149452459753923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399801347","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012984692,0.000045890683,0.9783931,0.0024262487,0.002274029,0.0006347271,0.00002594971,0.0011425129,0.002072844],"genre_scores_gemma":[0.96775115,6.370668e-7,0.031145632,0.00016627379,0.0002271458,0.00004044984,0.000020097694,0.000019235746,0.00062936207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781656,0.00015892915,0.00048725214,0.0005283327,0.0005838326,0.0004251051],"domain_scores_gemma":[0.9988963,0.0001499846,0.00007694291,0.00055752497,0.00011813014,0.00020111968],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00072997424,0.00021438577,0.0002540872,0.00023260718,0.00013172408,0.0010200209,0.0004365715,0.00012917076,0.00001178156],"category_scores_gemma":[0.00012742796,0.00018289023,0.00015140118,0.0006459355,0.000011485212,0.0023025733,0.00010189076,0.0001896885,0.0013042984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017757517,0.00058190286,0.0009428409,0.002701417,0.0008220323,0.0014204027,0.00891615,0.014261322,0.13419549,0.7386594,0.05358459,0.04373688],"study_design_scores_gemma":[0.00033272477,0.000054652235,0.0001360899,0.0002441477,0.000031741933,0.00021406758,0.00028231557,0.9865146,0.0018919709,0.00002140052,0.010045796,0.0002304637],"about_ca_topic_score_codex":0.000087364846,"about_ca_topic_score_gemma":0.000021588294,"teacher_disagreement_score":0.9722533,"about_ca_system_score_codex":0.00046113977,"about_ca_system_score_gemma":0.00012111247,"threshold_uncertainty_score":0.9994733},"labels":[],"label_agreement":null},{"id":"W4399828170","doi":"10.1007/978-3-031-54071-4_24","title":"Reinforcement Learning for Networked Control and Optimal Quantization","year":2024,"lang":"en","type":"book-chapter","venue":"Systems & control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Reinforcement learning; Reinforcement; Quantization (signal processing); Computer science; Control (management); Artificial intelligence; Psychology; Computer vision; Social psychology","score_opus":0.014203188714998672,"score_gpt":0.22863321878486217,"score_spread":0.2144300300698635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399828170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000035367134,0.011344026,0.93921214,0.00040908423,0.003936356,0.0050873775,0.00010527928,0.00067329314,0.03922891],"genre_scores_gemma":[0.75556034,0.00006803072,0.00017704716,0.0001316855,0.0013830278,0.00075598154,0.00015289125,0.0001372926,0.24163373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99567866,0.000127107,0.001415205,0.0012643142,0.00073003303,0.0007846586],"domain_scores_gemma":[0.99688303,0.00056836725,0.0009557589,0.00086238695,0.00045003838,0.00028042024],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00134268,0.00082419976,0.001476964,0.00033339972,0.00029361865,0.0012483845,0.0008297256,0.0006085093,0.000009374172],"category_scores_gemma":[0.00007174827,0.000776116,0.00041000423,0.00008639063,0.000072293165,0.00037771525,0.00014137827,0.0005528533,0.00020706096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012372751,0.0000092270275,0.000014210978,0.00064881745,0.0011209287,0.000045636905,0.00011981548,0.23170996,0.00012374646,0.7600333,0.0029624668,0.003088151],"study_design_scores_gemma":[0.0036641348,0.00023854435,0.0000027462956,0.0007392339,0.0002876952,0.000032858898,0.000014199752,0.69358736,7.5341336e-7,0.00044399095,0.30046207,0.000526417],"about_ca_topic_score_codex":0.00006973177,"about_ca_topic_score_gemma":0.000007721713,"teacher_disagreement_score":0.9390351,"about_ca_system_score_codex":0.00028326974,"about_ca_system_score_gemma":0.00017421703,"threshold_uncertainty_score":0.9997884},"labels":[],"label_agreement":null},{"id":"W4399849452","doi":"10.1109/lcsys.2024.3417856","title":"A Continuous-Time Gradient-Tracking Algorithm for Directed Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Tracking (education); Artificial intelligence; Psychology","score_opus":0.008879330642873355,"score_gpt":0.2195452148752291,"score_spread":0.21066588423235574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399849452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009662204,0.0036272851,0.9728765,0.0024246667,0.0141350655,0.002802386,0.00020056576,0.002873163,0.00009413563],"genre_scores_gemma":[0.99124795,0.0000062342556,0.0022822786,0.0012410139,0.0027994297,0.0013582135,0.000051947103,0.00011271878,0.0009001924],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954511,0.00043069705,0.0010291068,0.0012305815,0.00059443054,0.0012640944],"domain_scores_gemma":[0.9970822,0.0010923824,0.00030419423,0.0009677067,0.00025360586,0.00029991692],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013435917,0.0005682919,0.0009964551,0.00032788215,0.00025825624,0.002257121,0.0014010443,0.00022399255,0.0000038314474],"category_scores_gemma":[0.00007558635,0.00052935095,0.00050854875,0.000624889,0.000070129856,0.00090069877,0.00005395513,0.00033309427,0.00023272599],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013057305,0.00033823805,0.00031180182,0.00094691734,0.0049548494,0.0018933762,0.001308985,0.10778673,0.23774232,0.010198044,0.37778276,0.25660542],"study_design_scores_gemma":[0.0023579593,0.00006398948,0.00005575419,0.00044097315,0.00010407924,0.00011132051,0.000012616232,0.9535203,0.000078112615,0.000013472892,0.042675383,0.0005660411],"about_ca_topic_score_codex":0.00016387006,"about_ca_topic_score_gemma":0.0000055429614,"teacher_disagreement_score":0.99028176,"about_ca_system_score_codex":0.00034280078,"about_ca_system_score_gemma":0.00007675356,"threshold_uncertainty_score":0.9997158},"labels":[],"label_agreement":null},{"id":"W4400065376","doi":"10.1016/j.compchemeng.2024.108778","title":"A distributed algorithm for solving quadratic optimization problems","year":2024,"lang":"en","type":"article","venue":"Computers & Chemical Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Mitacs","keywords":"Mathematical optimization; Quadratic programming; Quadratic equation; Optimization algorithm; Computer science; Algorithm; Mathematics","score_opus":0.008622101290415338,"score_gpt":0.20664928507018754,"score_spread":0.1980271837797722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400065376","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013485677,0.0005747353,0.99534535,0.00031382884,0.0015583728,0.0005095742,0.00004246992,0.0015108584,0.000009932006],"genre_scores_gemma":[0.23425624,0.000004294995,0.76475513,0.000046952406,0.00040145882,0.00022897299,0.0002385829,0.000051067538,0.00001732793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982793,0.000009945083,0.00040584267,0.0005793637,0.00023466571,0.00049089396],"domain_scores_gemma":[0.99902415,0.00030459033,0.00004900793,0.00037207975,0.00008277498,0.00016737463],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002022968,0.00026881642,0.00028717512,0.00012337821,0.000053692194,0.0006380028,0.00072150084,0.000110230736,0.0000020675245],"category_scores_gemma":[0.00006915104,0.00027629442,0.00016288634,0.00054359075,0.000015192282,0.0005054091,0.00018728018,0.0001796934,0.000012068421],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010761071,0.000035919737,0.0000010636936,0.0003590668,0.00010819724,0.00001994199,0.00018075708,0.9359169,0.01602241,0.0041572265,0.0013296916,0.041867748],"study_design_scores_gemma":[0.00037721545,0.000022182721,0.0000016027044,0.00034836153,0.000017282659,0.000027231456,0.0000023746527,0.99340385,0.0030022333,0.000074464515,0.002413788,0.00030943862],"about_ca_topic_score_codex":0.000003748301,"about_ca_topic_score_gemma":4.7035133e-8,"teacher_disagreement_score":0.23412138,"about_ca_system_score_codex":0.000213079,"about_ca_system_score_gemma":0.000049012688,"threshold_uncertainty_score":0.99996895},"labels":[],"label_agreement":null},{"id":"W4400114830","doi":"10.1016/j.isatra.2024.06.021","title":"Connectivity preservation control for multiple unmanned aerial vehicles in the presence of bounded actuation","year":2024,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Controller (irrigation); Control theory (sociology); Actuator; Convergence (economics); Computer science; Position (finance); Range (aeronautics); Control engineering; Engineering; Control (management); Artificial intelligence; Mathematics; Aerospace engineering","score_opus":0.02912702866242292,"score_gpt":0.26976962313123365,"score_spread":0.24064259446881073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400114830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06518389,0.00008307887,0.92951494,0.0028239274,0.00076203694,0.0013046148,0.00016394607,0.00011929516,0.000044255314],"genre_scores_gemma":[0.9984115,0.000003556862,0.00087275764,0.000041304967,0.00007103114,0.00053848553,0.000014788641,0.000007533017,0.00003906703],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873036,0.00019340235,0.00031963308,0.00029118286,0.00026319554,0.00020220575],"domain_scores_gemma":[0.9974511,0.0019817508,0.00007168566,0.0003593549,0.00010815314,0.000027920418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072853983,0.00011103581,0.00016746683,0.000109586384,0.0001269151,0.00022162973,0.0004889531,0.00007376144,0.000005179339],"category_scores_gemma":[0.00019991538,0.000089935165,0.00011859138,0.0004441166,0.000044275977,0.001086603,0.000004909182,0.0001173872,0.0000050207536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014728205,0.0028160845,0.002568786,0.0014252372,0.0010248314,0.000027003456,0.042028505,0.1424396,0.3965677,0.24941093,0.0027535341,0.15746498],"study_design_scores_gemma":[0.001965278,0.0000900018,0.0052290433,0.00005995529,0.000035720637,0.0000036557497,0.00015665655,0.9811014,0.0046829353,0.0037523597,0.0028074584,0.00011556588],"about_ca_topic_score_codex":0.00041209918,"about_ca_topic_score_gemma":0.00087900955,"teacher_disagreement_score":0.9332276,"about_ca_system_score_codex":0.000062275765,"about_ca_system_score_gemma":0.00010717432,"threshold_uncertainty_score":0.36674497},"labels":[],"label_agreement":null},{"id":"W4400275273","doi":"10.1109/tase.2024.3420697","title":"Resilient Consensus Control of Heterogeneous Multi-UAV Systems With Leader of Unknown Input Against Byzantine Attacks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Applied Basic Research Foundation of Yunnan Province","keywords":"Byzantine fault tolerance; Computer science; Control (management); Byzantine architecture; Control system; Control theory (sociology); Distributed computing; Computer security; Engineering; Fault tolerance; Artificial intelligence","score_opus":0.014449544200991333,"score_gpt":0.23535234095753932,"score_spread":0.22090279675654798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400275273","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09392466,0.00026227886,0.9043295,0.00012124245,0.0007031985,0.00032979887,0.00003042772,0.00027434085,0.00002459334],"genre_scores_gemma":[0.99767894,0.000011108037,0.0022067784,0.000013733418,0.000011394122,0.000033399767,6.3860404e-7,0.000011321571,0.00003267855],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998266,0.00003125527,0.0004511835,0.0003847498,0.0006010721,0.0002657534],"domain_scores_gemma":[0.9990126,0.0001489812,0.00010396059,0.00034794057,0.0002787271,0.00010781376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005806504,0.00017106609,0.00027006114,0.0005079975,0.000097260185,0.00017749377,0.00032164817,0.000054443353,9.855298e-7],"category_scores_gemma":[0.000020623003,0.00014303434,0.00005106919,0.0010789145,0.00017588526,0.00038405252,0.0000032554053,0.000119071214,0.0000055000282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070899696,0.000044775727,0.0000073745014,0.00021039014,0.00004496075,0.0000099446315,0.00033594636,0.9139474,0.08084081,0.0004957568,0.0000053587205,0.0040501743],"study_design_scores_gemma":[0.00059957866,0.000089695684,0.0001540267,0.00037695086,0.000018304105,0.000049834616,0.000041033032,0.9645138,0.03384243,3.5930623e-7,0.00017487234,0.0001391374],"about_ca_topic_score_codex":0.000023696935,"about_ca_topic_score_gemma":0.0000035778203,"teacher_disagreement_score":0.9037543,"about_ca_system_score_codex":0.00006244378,"about_ca_system_score_gemma":0.0001541125,"threshold_uncertainty_score":0.5832771},"labels":[],"label_agreement":null},{"id":"W4400277820","doi":"10.1109/wcnc57260.2024.10570678","title":"Energy-Efficient UAV Swarm Assisted MEC With Dynamic Clustering and Scheduling","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Cluster analysis; Swarm behaviour; Scheduling (production processes); Mathematical optimization; Artificial intelligence; Mathematics","score_opus":0.009631836571445443,"score_gpt":0.22779490594526552,"score_spread":0.21816306937382007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400277820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024572443,0.00083280535,0.9702704,0.0006802609,0.0005293015,0.00013305407,0.0000043193745,0.00073596626,0.0022414604],"genre_scores_gemma":[0.97684765,0.0000058020755,0.022081388,0.00009843999,0.0000330219,0.000028321128,0.000004976999,0.000017592032,0.00088280893],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842036,0.000050932606,0.00024792197,0.00060635485,0.00032712155,0.00034729426],"domain_scores_gemma":[0.99924356,0.00009248473,0.000045039404,0.0004268472,0.00005498264,0.00013708373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002594749,0.00019921416,0.00019755324,0.00015445022,0.00011033728,0.0008150554,0.0004250177,0.00005778898,0.000006319402],"category_scores_gemma":[0.000009809834,0.00014873873,0.000047121623,0.00047943153,0.000034075714,0.00025900733,0.00025716316,0.00011253917,0.000029837862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006597257,0.00034311923,0.0003216902,0.0006641368,0.00079331745,0.0012115602,0.0018468972,0.21822223,0.027283395,0.29109442,0.000353429,0.45779982],"study_design_scores_gemma":[0.00035498585,0.000046150424,0.00032516578,0.00017398973,0.000015221089,0.00013077896,0.000063355146,0.99694884,0.00030742757,0.000046024095,0.0013719143,0.00021616566],"about_ca_topic_score_codex":0.00012393779,"about_ca_topic_score_gemma":0.0001377436,"teacher_disagreement_score":0.9522752,"about_ca_system_score_codex":0.00011497947,"about_ca_system_score_gemma":0.00007660534,"threshold_uncertainty_score":0.7859598},"labels":[],"label_agreement":null},{"id":"W4400310048","doi":"10.1139/dsa-2023-0107","title":"Swarm of drones for surveillance monitoring of a grounded target: an event-triggered approach","year":2024,"lang":"en","type":"article","venue":"Drone Systems and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Drone; Swarm behaviour; Event (particle physics); Computer science; Artificial intelligence; Computer security; Biology","score_opus":0.02239832944109631,"score_gpt":0.27999488836344516,"score_spread":0.25759655892234884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400310048","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014371816,0.0040165344,0.97937787,0.00004974356,0.00027470326,0.0014204349,0.00018903284,0.0001270312,0.00017283866],"genre_scores_gemma":[0.9926118,0.000019094157,0.005581035,0.0000011227705,0.00019957335,0.0014005387,0.000045422283,0.000014697212,0.00012671153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00006059658,0.0005095234,0.00042074049,0.0002007062,0.00019245419],"domain_scores_gemma":[0.9989609,0.00011877064,0.00014650101,0.00054619636,0.00014642597,0.00008120978],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051507633,0.00013669132,0.000338834,0.00010117927,0.00008892821,0.00013369392,0.00041408205,0.00006724631,2.7448837e-7],"category_scores_gemma":[0.000009113305,0.00012628785,0.000074686555,0.0003883779,0.000041379186,0.0002533547,0.00004942563,0.000052247884,0.0000020191246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017619634,0.0005523284,0.0036028835,0.004325849,0.0002923219,0.0000010813355,0.0014126227,0.0050950483,0.032405186,0.93704885,0.00020979483,0.015036384],"study_design_scores_gemma":[0.0011429435,0.00017853151,0.0045552943,0.00026063935,0.000045125988,0.000023019105,0.001219886,0.96847576,0.0041952645,0.0031427273,0.016264612,0.0004961899],"about_ca_topic_score_codex":0.0002518369,"about_ca_topic_score_gemma":0.0000023837963,"teacher_disagreement_score":0.97824,"about_ca_system_score_codex":0.00003423239,"about_ca_system_score_gemma":0.000056688023,"threshold_uncertainty_score":0.5149869},"labels":[],"label_agreement":null},{"id":"W4400521595","doi":"10.1139/dsa-2024-0007","title":"U-SMART: unified swarm management and resource tracking framework for unoccupied aerial vehicles","year":2024,"lang":"en","type":"article","venue":"Drone Systems and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Swarm behaviour; Computer science; Modular design; Robustness (evolution); Situation awareness; Distributed computing; Swarm intelligence; Collision avoidance; Real-time computing; Particle swarm optimization; Engineering; Artificial intelligence; Collision; Computer security; Machine learning","score_opus":0.020517444920866698,"score_gpt":0.2664149779487118,"score_spread":0.24589753302784506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400521595","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002820717,0.0035062737,0.9895478,0.0006816461,0.00032284184,0.0018668369,0.000077923956,0.00033907886,0.00083687186],"genre_scores_gemma":[0.99083984,0.000032559234,0.0061223023,0.000041913074,0.00038764582,0.0018647433,0.000032345422,0.00001995296,0.00065870787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99865913,0.00004228685,0.00032891156,0.0005506879,0.00016359992,0.00025535436],"domain_scores_gemma":[0.99908304,0.00021727089,0.000079434525,0.00047041845,0.000038691258,0.000111155925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036468703,0.00015985331,0.00021074997,0.000098689925,0.00026810696,0.0008705422,0.0003137853,0.00009195543,5.636761e-7],"category_scores_gemma":[0.000008735168,0.00015003259,0.00004568532,0.00030069772,0.000042139895,0.0001722763,0.00011193307,0.00009535122,0.000015726479],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004875135,0.000023817518,0.000030496594,0.00040529107,0.000065848064,0.000002815367,0.00023612156,0.000081847036,0.00030379154,0.9661039,0.00074220373,0.031998992],"study_design_scores_gemma":[0.00082592195,0.000051194085,0.00090534316,0.00040142407,0.000091995826,0.00003317614,0.0006403275,0.117741965,0.00016908716,0.014750799,0.86396617,0.00042262019],"about_ca_topic_score_codex":0.00004527372,"about_ca_topic_score_gemma":0.000002493513,"teacher_disagreement_score":0.9880191,"about_ca_system_score_codex":0.000038205788,"about_ca_system_score_gemma":0.000017746323,"threshold_uncertainty_score":0.83946586},"labels":[],"label_agreement":null},{"id":"W4400646604","doi":"10.3390/electronics13142759","title":"An Adjustable Parameter-Based Robust Distributed Fault Diagnosis for One-Sided Lipschitz Formation of Clustered Multi-Agent Systems","year":2024,"lang":"en","type":"article","venue":"Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Observer (physics); Control theory (sociology); Lipschitz continuity; Computer science; Robustness (evolution); Context (archaeology); Linear matrix inequality; Fault (geology); Mathematics; Mathematical optimization; Control (management); Artificial intelligence","score_opus":0.04282784811784333,"score_gpt":0.27517296288554677,"score_spread":0.23234511476770345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017867278,0.0071469424,0.97006357,0.00035237335,0.00095609017,0.002187522,0.0007806953,0.00063454185,0.000010999197],"genre_scores_gemma":[0.98352534,0.0001058818,0.013714755,0.000054553973,0.00011332339,0.0012897884,0.0010865178,0.000052053616,0.000057799323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99630576,0.00029300494,0.0010297688,0.00078501407,0.00058995443,0.0009964962],"domain_scores_gemma":[0.9971032,0.00073586305,0.00038501158,0.0011574632,0.00039083572,0.0002276161],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00089260016,0.0003991579,0.00061478204,0.00027211246,0.00018449586,0.00076154433,0.0012382504,0.00023452395,0.0000045765405],"category_scores_gemma":[0.00030666072,0.00039618803,0.0002850551,0.0008511995,0.000037736474,0.0013111217,0.000086331704,0.000289049,0.000023456945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027246072,0.002694146,0.00041592395,0.0039897608,0.000749586,0.00003544972,0.0011596235,0.89544135,0.018841047,0.03382567,0.0074291197,0.035145875],"study_design_scores_gemma":[0.0018405286,0.0006509774,0.000073433526,0.00040152826,0.00010975453,0.000008358923,0.00006814444,0.96924835,0.016356986,0.00011313729,0.010716555,0.0004122622],"about_ca_topic_score_codex":0.000085175416,"about_ca_topic_score_gemma":0.00014231465,"teacher_disagreement_score":0.96565807,"about_ca_system_score_codex":0.0007315244,"about_ca_system_score_gemma":0.00045272976,"threshold_uncertainty_score":0.999849},"labels":[],"label_agreement":null},{"id":"W4400729013","doi":"10.1109/ccdc62350.2024.10587676","title":"Hybrid impulsive flocking control for multi-agent systems with fault tolerance","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Flocking (texture); Fault tolerance; Computer science; Multi-agent system; Distributed computing; Control theory (sociology); Control (management); Control engineering; Engineering; Artificial intelligence; Materials science","score_opus":0.01967539686195947,"score_gpt":0.259725272897622,"score_spread":0.24004987603566252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400729013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024435332,0.0022123135,0.9879451,0.0005551387,0.002886525,0.0022853515,0.00018261494,0.0010804356,0.000409001],"genre_scores_gemma":[0.98413235,0.000005495207,0.012462277,0.00026907833,0.00033737315,0.00082464574,0.000020250445,0.000043417065,0.0019051111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997109,0.00010311053,0.0005611973,0.0009903106,0.000501403,0.0007350041],"domain_scores_gemma":[0.9982141,0.0003080053,0.00013796502,0.000794922,0.00032650837,0.0002185021],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050180964,0.0003852901,0.0005177834,0.00015590462,0.00018924473,0.0013160915,0.0010453814,0.000072336756,0.0000061891296],"category_scores_gemma":[0.00005102095,0.00028374986,0.00019336298,0.00031193023,0.000040183506,0.00073270657,0.00008960515,0.00017227947,0.0001683816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047947487,0.0009410984,0.0015321128,0.0038600015,0.00371245,0.0025421628,0.0033461577,0.33840716,0.018558657,0.48525244,0.052395947,0.08897235],"study_design_scores_gemma":[0.0026586403,0.00015240507,0.00008372168,0.00032374327,0.000042803607,0.00013632997,0.00007948472,0.9699026,0.000738176,0.000038453767,0.025430406,0.00041324488],"about_ca_topic_score_codex":0.00018214731,"about_ca_topic_score_gemma":0.000020120604,"teacher_disagreement_score":0.9816888,"about_ca_system_score_codex":0.00021095475,"about_ca_system_score_gemma":0.00016463816,"threshold_uncertainty_score":0.9999615},"labels":[],"label_agreement":null},{"id":"W4400911393","doi":"10.1109/fasta61401.2024.10595145","title":"Dynamic Event-triggered Model-free Adaptive Heading Consensus Tracking Control for Unmanned Surface Vehicles","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Heading (navigation); Computer science; Tracking (education); Vehicle dynamics; Unmanned surface vehicle; Control theory (sociology); Adaptive control; Event (particle physics); Control (management); Engineering; Artificial intelligence; Aerospace engineering; Physics; Psychology","score_opus":0.02749804317588463,"score_gpt":0.27820531992341946,"score_spread":0.25070727674753485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400911393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015818913,0.0014000086,0.974525,0.0039999075,0.00093646924,0.0014069047,0.00035016082,0.0011322771,0.00043038107],"genre_scores_gemma":[0.9665051,0.0000044327962,0.031712007,0.0002093782,0.000046490466,0.00009010979,0.000014360861,0.00004250075,0.001375628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970672,0.0001542384,0.00065085635,0.0009247988,0.00043843736,0.00076443184],"domain_scores_gemma":[0.9974343,0.0010978259,0.00013540713,0.0008824448,0.00025525267,0.00019476311],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009151798,0.00036523704,0.000512735,0.00015329945,0.00022278438,0.00070161134,0.001284968,0.00015407639,0.000005221174],"category_scores_gemma":[0.00017506111,0.00033300885,0.00031629225,0.0004352954,0.0000585564,0.00052251667,0.00015293491,0.00020937601,0.00006663815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030106358,0.00019195028,0.00007611318,0.00028245882,0.0008756824,0.00016359819,0.0011539612,0.52014273,0.05008366,0.39526704,0.012567061,0.018894697],"study_design_scores_gemma":[0.0026541834,0.000110493085,0.000034004726,0.00016964131,0.00005366818,0.000017405588,0.00012657951,0.98433524,0.00089170836,0.0108716125,0.00034090047,0.0003945822],"about_ca_topic_score_codex":0.000079465826,"about_ca_topic_score_gemma":0.000096393065,"teacher_disagreement_score":0.95068616,"about_ca_system_score_codex":0.00035002033,"about_ca_system_score_gemma":0.00028649822,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W4400947008","doi":"10.23919/ecc64448.2024.10590857","title":"Non-Convex Potential Games for Finding Global Solutions to Sensor Network Localization","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Regular polygon; Computer science; Wireless sensor network; Computer network; Mathematics; Geometry","score_opus":0.019551617066216817,"score_gpt":0.2701237576756278,"score_spread":0.25057214060941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400947008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002912747,0.00014527532,0.9913849,0.002395738,0.0034915807,0.0006663165,0.000052086816,0.0005309041,0.0010419132],"genre_scores_gemma":[0.9716266,0.0000017869636,0.025855018,0.0004928148,0.0006522275,0.00010957055,0.000033617194,0.000011525091,0.0012168784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845827,0.000031008814,0.0002793929,0.0004749201,0.00022958391,0.0005268559],"domain_scores_gemma":[0.99932367,0.00005901424,0.000035139397,0.00033089402,0.00010666384,0.00014462322],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030981665,0.00014756335,0.00016913768,0.000059489685,0.00021741836,0.0006544281,0.0004501103,0.00007628331,0.000018005787],"category_scores_gemma":[0.00003668859,0.0001376081,0.00012537469,0.00074055203,0.000014312142,0.00034570394,0.00016837165,0.000047137564,0.00029753536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001767272,0.000055196047,0.00063654303,0.000094967545,0.00017448212,0.000039621547,0.00023209608,0.2970946,0.0005957843,0.36330205,0.31256315,0.025193818],"study_design_scores_gemma":[0.00023224112,0.000040917734,0.0004930806,0.000065302105,0.00001877215,0.0000148532945,0.000023133614,0.9676159,0.00005630828,0.0012172753,0.03004992,0.00017227887],"about_ca_topic_score_codex":0.000056954836,"about_ca_topic_score_gemma":0.000029716404,"teacher_disagreement_score":0.9713353,"about_ca_system_score_codex":0.00017176292,"about_ca_system_score_gemma":0.00009353182,"threshold_uncertainty_score":0.6310665},"labels":[],"label_agreement":null},{"id":"W4400976108","doi":"10.1109/icca62789.2024.10591925","title":"Adaptive Distributed Lyapunov-Based Model Predictive Control for Multi-UAV Formation Tracking with Weighted Directed Graphs","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Model predictive control; Computer science; Lyapunov function; Tracking (education); Control theory (sociology); Adaptive control; Control (management); Artificial intelligence; Nonlinear system","score_opus":0.02935945588962933,"score_gpt":0.2510649803093719,"score_spread":0.2217055244197426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400976108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061806926,0.00019156777,0.9906104,0.00046836643,0.00032736536,0.0027235518,0.0018735506,0.003000502,0.00018658733],"genre_scores_gemma":[0.9286016,0.0000015492966,0.06967863,0.0001355101,0.000041292347,0.0009312372,0.0004776976,0.000040622075,0.00009187202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99710625,0.00014981873,0.0006282262,0.00086706155,0.0005622527,0.00068636175],"domain_scores_gemma":[0.99779755,0.0004715367,0.00021437477,0.00057345204,0.00072935584,0.00021375617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045584477,0.00045818932,0.0004944934,0.00033264488,0.00025600914,0.0006254523,0.00071969046,0.00017360484,0.000004766772],"category_scores_gemma":[0.000058957696,0.00034696425,0.0002476081,0.0010794007,0.00007281005,0.0019353648,0.000045737394,0.00022891938,0.000017408887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038085864,0.0019628268,0.0008205562,0.000942977,0.0032053422,0.00020160632,0.00347455,0.5614981,0.009752566,0.3646825,0.010363437,0.039286923],"study_design_scores_gemma":[0.005636613,0.0003511545,0.00034475877,0.00023784327,0.00012927775,0.000009843099,0.00007627671,0.98991275,0.0018800863,0.00074662286,0.00021784383,0.0004569406],"about_ca_topic_score_codex":0.000044638055,"about_ca_topic_score_gemma":0.00009841601,"teacher_disagreement_score":0.9279835,"about_ca_system_score_codex":0.00031673588,"about_ca_system_score_gemma":0.00029222417,"threshold_uncertainty_score":0.99989825},"labels":[],"label_agreement":null},{"id":"W4401075530","doi":"10.3390/drones8080350","title":"Decentralized UAV Swarm Control: A Multi-Layered Architecture for Integrated Flight Mode Management and Dynamic Target Interception","year":2024,"lang":"en","type":"article","venue":"Drones","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Swarm behaviour; Computer science; Scalability; Robustness (evolution); Distributed computing; Fault tolerance; Scheduling (production processes); Command and control; Situation awareness; Real-time computing; Engineering; Artificial intelligence","score_opus":0.010039400299382958,"score_gpt":0.26628346882445986,"score_spread":0.2562440685250769,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401075530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006919463,0.0016282926,0.9863543,0.0018428843,0.0010134352,0.0013865758,0.00021845278,0.00059435196,0.000042264288],"genre_scores_gemma":[0.9452328,0.000058901856,0.053474013,0.00013147062,0.000035587876,0.0003486221,0.00013963481,0.00002893623,0.00055002834],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816954,0.000111196154,0.0003759422,0.0006819714,0.00021125666,0.00045008195],"domain_scores_gemma":[0.9992304,0.00009978827,0.00007545184,0.00039842408,0.00006935768,0.00012658365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023844167,0.00029583112,0.00034137123,0.00022374574,0.000099779994,0.00048288066,0.0005264538,0.00010015913,0.0000066142306],"category_scores_gemma":[0.000025083054,0.00024233923,0.00014049314,0.00027017485,0.000043532673,0.00029005512,0.00011264502,0.00014502328,0.000038212955],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016842282,0.001415985,0.0009208041,0.004669676,0.0048578787,0.00065363955,0.014527504,0.048845705,0.081307694,0.16961102,0.01450878,0.6569971],"study_design_scores_gemma":[0.0028669403,0.000065344226,0.00035345988,0.00021368585,0.00005328346,0.000020349322,0.000106500665,0.97267246,0.0002578109,0.0022977332,0.020816796,0.00027564366],"about_ca_topic_score_codex":0.000056824014,"about_ca_topic_score_gemma":0.00010202332,"teacher_disagreement_score":0.93831336,"about_ca_system_score_codex":0.00014029036,"about_ca_system_score_gemma":0.000027887403,"threshold_uncertainty_score":0.98823065},"labels":[],"label_agreement":null},{"id":"W4401247288","doi":"10.1109/tie.2024.3429620","title":"Continuously Varying Formation for Heterogeneous Multi-Agent Systems With Novel Potential Field Avoidance","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Electronics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Computer science; Field (mathematics); Distributed computing; Multi-agent system; Potential field; Biological system; Physics; Artificial intelligence; Mathematics","score_opus":0.03366775553165789,"score_gpt":0.2505219702245514,"score_spread":0.2168542146928935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401247288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017669633,0.0005515833,0.99014074,0.00051613606,0.004435519,0.0017825271,0.00019684543,0.0005857,0.000023970917],"genre_scores_gemma":[0.9970893,0.00003093308,0.0013868483,0.0000907576,0.00032078932,0.0006018176,0.000018171851,0.000045181183,0.00041615908],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974497,0.000092347924,0.0005994574,0.00064881635,0.0004641683,0.0007455137],"domain_scores_gemma":[0.99873066,0.00027187963,0.00016642659,0.0005207498,0.00016435693,0.00014590674],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039610517,0.000353324,0.00036574824,0.00024270946,0.0003689425,0.0008030388,0.00060815184,0.00031888852,0.0000053297736],"category_scores_gemma":[0.000014433817,0.00032214393,0.000232627,0.0005159571,0.000026301444,0.0007798011,0.0000036730582,0.00067912985,0.000025448164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004910036,0.000434695,8.5203953e-7,0.00016253775,0.0005711817,0.00004895183,0.0003035977,0.9404906,0.014337988,0.0016433704,0.0009639928,0.040551227],"study_design_scores_gemma":[0.0034974923,0.001016069,2.2730742e-7,0.0002412616,0.00011426674,0.00022957296,0.000021626096,0.94804215,0.03688126,0.000013935649,0.0095531605,0.00038894464],"about_ca_topic_score_codex":0.00007755059,"about_ca_topic_score_gemma":0.000047516955,"teacher_disagreement_score":0.9953224,"about_ca_system_score_codex":0.00052842655,"about_ca_system_score_gemma":0.00039781968,"threshold_uncertainty_score":0.99992305},"labels":[],"label_agreement":null},{"id":"W4401379948","doi":"10.1109/tac.2024.3439655","title":"Fully Distributed Event-Triggered Control of Nonlinear Multiagent Systems Under Directed Graphs: A Model-Free DRL Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Shenzhen Fundamental Research Program; Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Computer science; Multi-agent system; Nonlinear system; Directed graph; Control (management); Event (particle physics); Distributed computing; Algorithm; Artificial intelligence; Physics","score_opus":0.0154175672167839,"score_gpt":0.238922128704464,"score_spread":0.2235045614876801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401379948","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021444873,0.00092172786,0.9846432,0.0006699544,0.0020810647,0.003181683,0.0034407878,0.0028278348,0.00008922461],"genre_scores_gemma":[0.9927892,0.000014026732,0.0055385544,0.000121176614,0.000054994944,0.0011343306,0.000050850074,0.000077679004,0.00021917977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9941537,0.00066911284,0.0018103693,0.0011549821,0.0013129236,0.000898926],"domain_scores_gemma":[0.9956596,0.0009188101,0.00044213308,0.002156534,0.0004265026,0.00039641073],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009935113,0.0007426611,0.0013591246,0.0007326014,0.00026758813,0.00057343417,0.0018359246,0.00034094072,0.000026874604],"category_scores_gemma":[0.00006270087,0.00065929367,0.00084306067,0.0015915353,0.00014038634,0.00064108515,0.0000106563175,0.00047609548,0.000088833476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012414301,0.0014035742,0.000004285128,0.0007028179,0.002025568,0.000045951834,0.00040482183,0.9735251,0.00589219,0.0047489298,0.00060658425,0.010516056],"study_design_scores_gemma":[0.008102355,0.00019313401,0.00004801064,0.00043883466,0.0005247696,0.000041274,0.00009522571,0.98906106,0.00047699484,0.0003409832,0.00009269314,0.0005846648],"about_ca_topic_score_codex":0.00017692176,"about_ca_topic_score_gemma":0.00002067158,"teacher_disagreement_score":0.9906447,"about_ca_system_score_codex":0.00041209307,"about_ca_system_score_gemma":0.00046315664,"threshold_uncertainty_score":0.9995858},"labels":[],"label_agreement":null},{"id":"W4401415268","doi":"10.1109/icra57147.2024.10610428","title":"AMSwarmX: Safe Swarm Coordination in CompleX Environments via Implicit Non-Convex Decomposition of the Obstacle-Free Space","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Swarm behaviour; Obstacle; Free space; Decomposition; Computer science; Regular polygon; Space (punctuation); Mathematics; Artificial intelligence; Physics; Chemistry; Geometry","score_opus":0.010085460311321966,"score_gpt":0.2470104190202645,"score_spread":0.23692495870894253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401415268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058449745,0.000093178096,0.9312387,0.0062119667,0.000636625,0.00074503175,0.000034057583,0.00010368659,0.002486972],"genre_scores_gemma":[0.99668664,0.0000024475778,0.0022681959,0.00019753033,0.00003645757,0.000041196858,0.000023226445,0.000014051272,0.0007302307],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981255,0.00013134064,0.00048482628,0.000467831,0.0004762213,0.0003142836],"domain_scores_gemma":[0.9986439,0.00014038611,0.00013549597,0.0009734842,0.000037395614,0.00006934353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003637411,0.00019710709,0.00026092597,0.00014999213,0.000073250565,0.00014899252,0.0013821864,0.000083738516,0.00003789725],"category_scores_gemma":[0.000028701696,0.00015445452,0.00012537203,0.00060101494,0.000056024037,0.00048664887,0.00046777783,0.00015657152,0.00013139372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043674252,0.00070068054,0.01117649,0.00029763623,0.00024710965,0.000058021735,0.0019510877,0.006881047,0.80564195,0.11113564,0.025015043,0.036851622],"study_design_scores_gemma":[0.0013677621,0.00006643116,0.1300082,0.00011808985,0.00001992987,0.000025410107,0.000064417334,0.8299382,0.029687747,0.0027019323,0.0057126144,0.00028927662],"about_ca_topic_score_codex":0.00043870276,"about_ca_topic_score_gemma":0.00009290482,"teacher_disagreement_score":0.9382369,"about_ca_system_score_codex":0.00028599496,"about_ca_system_score_gemma":0.000040183862,"threshold_uncertainty_score":0.6298473},"labels":[],"label_agreement":null},{"id":"W4401417240","doi":"10.1109/icra57147.2024.10610169","title":"A Novel Fish-inspired Self-adaptive Approach to Collective Escape of Swarm Robots Based on Neurodynamic Models","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Swarm behaviour; Swarm robotics; Robot; Computer science; Fish <Actinopterygii>; Artificial intelligence; Biology; Fishery","score_opus":0.02738894909055509,"score_gpt":0.2266835563224087,"score_spread":0.1992946072318536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401417240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014906044,0.0000164752,0.95194286,0.0007335273,0.0004315824,0.0012403,0.00008700692,0.00081845105,0.04323916],"genre_scores_gemma":[0.8934522,4.4617673e-7,0.10483734,0.00078615063,0.00003571424,0.00020040096,0.000010971134,0.000031239706,0.00064550206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971946,0.00012900907,0.00045938152,0.0010600425,0.00069206534,0.00046493902],"domain_scores_gemma":[0.9983287,0.00027657297,0.00009741259,0.0008616422,0.00022598452,0.00020971755],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035459906,0.00033889204,0.0004424128,0.0004417049,0.0000856956,0.00026104043,0.0011413672,0.00010965105,0.000003131729],"category_scores_gemma":[0.000040093655,0.00030031652,0.00019877988,0.0018596441,0.00002417545,0.0004559429,0.00018889118,0.00020145669,0.000047579164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008762384,0.0010828247,0.000005255705,0.000098890974,0.00017265687,0.000020587047,0.0014025521,0.8734496,0.0032736957,0.11680869,0.0026275152,0.00097010523],"study_design_scores_gemma":[0.00088986376,0.0003643345,0.00026796217,0.00008295067,0.000025654203,0.000007385613,0.000044484335,0.9969312,0.0006296025,0.00036278594,0.00009065075,0.00030310795],"about_ca_topic_score_codex":0.000165378,"about_ca_topic_score_gemma":0.000022323778,"teacher_disagreement_score":0.89196163,"about_ca_system_score_codex":0.00040589308,"about_ca_system_score_gemma":0.0004870527,"threshold_uncertainty_score":0.99994487},"labels":[],"label_agreement":null},{"id":"W4401580851","doi":"10.1080/00207721.2024.2390170","title":"Complex Laplacian approach for formation tracking without velocity measurements","year":2024,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convergence (economics); Control theory (sociology); Tracking (education); Laplace operator; Control (management); Process (computing); Computer science; Constant (computer programming); Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.1142022551642252,"score_gpt":0.33581918007094025,"score_spread":0.22161692490671503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401580851","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043827007,0.00030419088,0.98629904,0.00048739146,0.006961274,0.00034234388,0.000021011707,0.00006601713,0.0011360422],"genre_scores_gemma":[0.9857411,0.0000032533258,0.013501572,0.00005007815,0.00062108744,0.000018802994,0.000004940143,0.00000752038,0.000051641677],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964394,0.00007165046,0.00079246564,0.0002931636,0.0021219673,0.00028137],"domain_scores_gemma":[0.99698555,0.000084472034,0.0005082213,0.00020541975,0.0020781225,0.00013823155],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0038649112,0.00013799197,0.0002319011,0.00054061454,0.00016418716,0.002188103,0.0026305001,0.00004091367,0.0000012545403],"category_scores_gemma":[0.00025049315,0.00011257116,0.00013723478,0.00049453205,0.000097035496,0.003988576,0.000107712054,0.00013386745,0.000011074257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028739966,0.00091349974,0.008713069,0.0013633841,0.0015380493,0.00023027617,0.012018239,0.08362974,0.4788885,0.21560834,0.020751506,0.176058],"study_design_scores_gemma":[0.00070519757,0.000073196796,0.001413012,0.0004051855,0.000014427144,0.0007738509,0.0001680523,0.9856657,0.0018663129,0.00027115687,0.0084752245,0.00016871809],"about_ca_topic_score_codex":0.000021098444,"about_ca_topic_score_gemma":0.0000012291056,"teacher_disagreement_score":0.9813584,"about_ca_system_score_codex":0.0006558043,"about_ca_system_score_gemma":0.00037978272,"threshold_uncertainty_score":0.9988477},"labels":[],"label_agreement":null},{"id":"W4401880300","doi":"10.1109/icps59941.2024.10639943","title":"Vision-based Navigation for the Affine Formation Control of a Multi-Robot Team","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Robot; Computer science; Affine transformation; Robot control; Artificial intelligence; Control (management); Computer vision; Mobile robot; Human–computer interaction; Mathematics","score_opus":0.018359227209350782,"score_gpt":0.2829792975099719,"score_spread":0.2646200703006211,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401880300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018645018,0.00035058934,0.99395275,0.0033084098,0.000574427,0.0011906448,0.00005049103,0.0002581312,0.00012810733],"genre_scores_gemma":[0.9872197,0.0000010402446,0.012110559,0.0001597063,0.000058012152,0.00021143783,0.00003111445,0.000008068878,0.00020034864],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988982,0.000056365425,0.00038157313,0.00022183885,0.00026173276,0.00018025465],"domain_scores_gemma":[0.9984468,0.00081367383,0.00010699102,0.00040817808,0.00018595038,0.000038387567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006469285,0.00011459631,0.00015597121,0.00007668896,0.00008988653,0.0002332112,0.0005182766,0.00005098835,0.000008235959],"category_scores_gemma":[0.0000887086,0.000070935654,0.00013869775,0.0003012579,0.000024727682,0.0005472527,0.000029288152,0.00006328658,0.0000361419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016353263,0.0006370087,0.0001557686,0.0012001507,0.00037464654,0.0000075763683,0.0016748849,0.14390752,0.12069052,0.18675892,0.019995768,0.52443373],"study_design_scores_gemma":[0.0015354938,0.0000897064,0.00026757928,0.00010456332,0.000022426477,0.0000025671093,0.000030594503,0.98890793,0.0035079715,0.00010787177,0.005338281,0.000085012085],"about_ca_topic_score_codex":0.000047167207,"about_ca_topic_score_gemma":0.0000147982955,"teacher_disagreement_score":0.98703325,"about_ca_system_score_codex":0.000060570757,"about_ca_system_score_gemma":0.00007328933,"threshold_uncertainty_score":0.2892672},"labels":[],"label_agreement":null},{"id":"W4402014391","doi":"10.1016/j.cnsns.2024.108323","title":"Input-to-state hybrid impulsive formation stabilization for multi-agent systems with impulse delays","year":2024,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Impulse (physics); Control theory (sociology); State dependent; State (computer science); Computer science; Mathematics; Physics; Algorithm; Control (management); Classical mechanics; Artificial intelligence","score_opus":0.0477155453618745,"score_gpt":0.3423906991267028,"score_spread":0.2946751537648283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402014391","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020785524,0.00044851904,0.97588897,0.0008394128,0.00022172116,0.0015463853,0.00005749519,0.00017664046,0.000035363988],"genre_scores_gemma":[0.92077523,0.000034569843,0.078710854,0.00009746861,0.000025089104,0.00025139377,0.000073320676,0.00001351503,0.000018555318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979646,0.00012954773,0.00053604855,0.0005332693,0.00047381807,0.00036267826],"domain_scores_gemma":[0.99746823,0.00045686524,0.00013115439,0.0010884656,0.0006826353,0.00017264008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012806967,0.00017871996,0.00021070927,0.00047095088,0.00043682117,0.0008489618,0.0012335064,0.000039150662,5.765548e-7],"category_scores_gemma":[0.0004143593,0.00015237587,0.00003476451,0.0023091896,0.00017344338,0.0020581903,0.00039726877,0.00014742864,0.000019705709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004973311,0.00029559614,0.0008992845,0.00015486506,0.000021403024,0.0000048259594,0.0034538682,0.8222488,0.0018413144,0.00712047,0.000039222912,0.1638706],"study_design_scores_gemma":[0.00047947242,0.00013383587,0.0008784591,0.00012162871,0.000008505161,0.000009501141,0.000113414695,0.99271333,0.00017726468,0.00010391084,0.0050596995,0.00020100498],"about_ca_topic_score_codex":0.00007977472,"about_ca_topic_score_gemma":0.00002696233,"teacher_disagreement_score":0.8999897,"about_ca_system_score_codex":0.00042343346,"about_ca_system_score_gemma":0.00024166249,"threshold_uncertainty_score":0.81865585},"labels":[],"label_agreement":null},{"id":"W4402141889","doi":"10.1002/asjc.3480","title":"Cooperative learning‐based practical formation‐containment control with prescribed performance for heterogeneous clusters of UAV/USV","year":2024,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Control (management); Containment (computer programming); Computer science; Control theory (sociology); Aeronautics; Control engineering; Engineering; Artificial intelligence","score_opus":0.011557758934711261,"score_gpt":0.25144496357351226,"score_spread":0.239887204638801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402141889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0049738637,0.0005012729,0.9838107,0.008849356,0.00044534844,0.0011723739,0.000037583162,0.000057499972,0.00015199673],"genre_scores_gemma":[0.994412,0.0000048317493,0.0049390835,0.0003036056,0.0001510673,0.000087587825,0.0000048349366,0.000024745152,0.00007226286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972489,0.00038911297,0.00095590134,0.0002752317,0.00069437554,0.00043646825],"domain_scores_gemma":[0.9971806,0.0006123306,0.0008113099,0.0003097627,0.0008601227,0.00022591549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011960759,0.00028199356,0.0006909493,0.00024005753,0.00013076456,0.0003386893,0.0005750837,0.00008987551,0.00000933723],"category_scores_gemma":[0.0002513533,0.00020520305,0.00029066857,0.00023630538,0.000081399005,0.0014432443,0.000022449067,0.00038104554,0.000008886786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01658117,0.0013226928,0.0024607198,0.0018597865,0.0073669436,0.0014714915,0.008518715,0.84501636,0.012403389,0.013857604,0.0061460156,0.08299509],"study_design_scores_gemma":[0.012531959,0.003989679,0.00016759899,0.00043966805,0.0002571502,0.0005434963,0.00017998149,0.9714889,0.0022022068,0.000024772742,0.007936276,0.0002382945],"about_ca_topic_score_codex":0.0000018584257,"about_ca_topic_score_gemma":0.000003939984,"teacher_disagreement_score":0.9894381,"about_ca_system_score_codex":0.00019076659,"about_ca_system_score_gemma":0.00057891925,"threshold_uncertainty_score":0.8367938},"labels":[],"label_agreement":null},{"id":"W4402262704","doi":"10.23919/acc60939.2024.10644770","title":"A Twin-Delayed Deep Deterministic Policy Gradient Approach for UAV Formation Control","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Changjiang Scholar Program of Chinese Ministry of Education; Aeronautical Science Foundation of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Control (management); Control theory (sociology); Artificial intelligence","score_opus":0.016928468185060434,"score_gpt":0.2614897010424787,"score_spread":0.24456123285741826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402262704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023500466,0.00021065267,0.991847,0.0010149744,0.0005675015,0.0013193204,0.00006538069,0.00069734256,0.004042845],"genre_scores_gemma":[0.97804266,0.0000019542092,0.02005028,0.0004496744,0.00027581232,0.0005988233,0.00005705779,0.000018685962,0.0005050448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981427,0.000072642906,0.00047851563,0.00048708325,0.00030175835,0.00051728496],"domain_scores_gemma":[0.9988778,0.00022531241,0.00008452082,0.0005357303,0.00010948538,0.00016710926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004449233,0.0002230803,0.00026876258,0.00026862428,0.00012714468,0.00071000954,0.00075141835,0.000084855725,0.0000041992894],"category_scores_gemma":[0.00010846641,0.000183501,0.00020207027,0.0004640176,0.000024999976,0.0007450971,0.00007420318,0.00009110996,0.00010276194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050304912,0.00016667778,0.000012422173,0.00039542912,0.00022730419,0.000025932393,0.001537868,0.003267972,0.0012773963,0.90611,0.0048609287,0.082067765],"study_design_scores_gemma":[0.0011698918,0.00014176026,0.000039129864,0.000018180657,0.00003347682,0.00006255481,0.000049066464,0.988147,0.00010400053,0.001632066,0.008384736,0.00021810693],"about_ca_topic_score_codex":0.00006536484,"about_ca_topic_score_gemma":0.00001103647,"teacher_disagreement_score":0.9848791,"about_ca_system_score_codex":0.00022797936,"about_ca_system_score_gemma":0.00012783326,"threshold_uncertainty_score":0.74829537},"labels":[],"label_agreement":null},{"id":"W4402316927","doi":"10.3390/fractalfract8090523","title":"Consensus of T-S Fuzzy Fractional-Order, Singular Perturbation, Multi-Agent Systems","year":2024,"lang":"en","type":"article","venue":"Fractal and Fractional","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Order (exchange); Fuzzy logic; Mathematics; Perturbation (astronomy); Singular perturbation; Applied mathematics; Pure mathematics; Computer science; Mathematical analysis; Physics; Artificial intelligence; Economics; Finance; Quantum mechanics","score_opus":0.02065956784972962,"score_gpt":0.25262619157519833,"score_spread":0.23196662372546872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402316927","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012821403,0.00814205,0.96728575,0.0023228945,0.00600958,0.00045355712,0.00019337195,0.0003744741,0.002396888],"genre_scores_gemma":[0.9924739,0.00004972005,0.0045556943,0.00010218324,0.00040501723,0.00004939541,0.00007985449,0.000018739054,0.0022654908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978733,0.00010950057,0.00055002695,0.0005575677,0.0006365852,0.00027302466],"domain_scores_gemma":[0.99840945,0.00054027094,0.00020508103,0.0003078082,0.00037982114,0.00015758691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036734564,0.00023758493,0.00029582623,0.00021562386,0.00019890761,0.0003561687,0.00025920122,0.00015636359,0.000052943913],"category_scores_gemma":[0.0001829305,0.00021672797,0.00012114466,0.00042251803,0.00009655011,0.000611602,0.000092257775,0.00029540248,0.00015155053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020996084,0.0021989453,0.01134407,0.0015011311,0.0022561229,0.0006591504,0.0019405605,0.01662714,0.030785402,0.83233744,0.05097765,0.049162403],"study_design_scores_gemma":[0.00080007495,0.000080758415,0.010156406,0.00017618666,0.000044684213,0.00047486532,0.00016896214,0.8068273,0.00014986756,0.0017620942,0.17898373,0.00037504808],"about_ca_topic_score_codex":0.00022057482,"about_ca_topic_score_gemma":0.000004170742,"teacher_disagreement_score":0.9796525,"about_ca_system_score_codex":0.00011514126,"about_ca_system_score_gemma":0.00022561805,"threshold_uncertainty_score":0.883791},"labels":[],"label_agreement":null},{"id":"W4402323267","doi":"10.1007/978-3-031-71533-4_11","title":"Behavioural Contagion in Human and Artificial Multi-agent Systems: A Computational Modeling Approach","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Innovation Cluster (Canada)","funders":"","keywords":"Computer science; Artificial intelligence; Artificial life","score_opus":0.05682188397281785,"score_gpt":0.2752262199812551,"score_spread":0.21840433600843728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402323267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016562204,0.0013332032,0.9931731,0.00019648123,0.0019016069,0.0011158861,0.000033366214,0.00022630356,0.00036383152],"genre_scores_gemma":[0.93529224,0.0000060550406,0.06403759,0.00011623797,0.0002610904,0.000053225784,0.000049641163,0.00004403748,0.00013987595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9947043,0.00007987268,0.0011474191,0.0021221957,0.0011817064,0.00076447317],"domain_scores_gemma":[0.9982496,0.00017797647,0.00028789768,0.0008217934,0.00024109398,0.00022163273],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013013182,0.00068403117,0.0008250056,0.0012890128,0.00026221905,0.0016185535,0.0018643023,0.0004064015,0.0000017688141],"category_scores_gemma":[0.000030890962,0.0006605234,0.00014035,0.0005624364,0.00037219637,0.0006007242,0.0010637664,0.0010295792,0.000022229562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051660654,0.00008182732,0.0001817187,0.00013940428,0.000020235128,0.00018453615,0.00094949786,0.90300965,0.000101263024,0.08251004,0.0000041626668,0.012812506],"study_design_scores_gemma":[0.0005290559,0.000069121204,0.0000989368,0.00069360674,0.00001650832,0.00012443484,0.000002318292,0.97463465,0.000012157049,0.023154154,0.00002803763,0.0006370179],"about_ca_topic_score_codex":0.00042828725,"about_ca_topic_score_gemma":0.0001537034,"teacher_disagreement_score":0.933636,"about_ca_system_score_codex":0.0007219066,"about_ca_system_score_gemma":0.00031451718,"threshold_uncertainty_score":0.9995846},"labels":[],"label_agreement":null},{"id":"W4402423317","doi":"10.24908/iqurcp18033","title":"A Time and Place to Land","year":2024,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Geography; History","score_opus":0.067656671184623,"score_gpt":0.3511611634582541,"score_spread":0.2835044922736311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402423317","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24297747,0.0019035301,0.32558382,0.39651018,0.0016553818,0.005013979,0.00009131919,0.004194315,0.022069998],"genre_scores_gemma":[0.99268985,0.00009813484,0.0015863919,0.00013231814,0.00024196165,0.00019214832,0.0000060502293,0.000033733304,0.005019432],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99582183,0.00011780597,0.00039122681,0.0012241936,0.0013451902,0.0010997577],"domain_scores_gemma":[0.9975747,0.00042160746,0.00004636601,0.00037472884,0.0009403416,0.0006422566],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025010249,0.00030719323,0.00035358622,0.00075138896,0.00028089245,0.0036950733,0.0014404854,0.00014524383,0.000016770256],"category_scores_gemma":[0.00048516202,0.00027434007,0.000062470266,0.0017371393,0.00033979665,0.0014680071,0.001057498,0.0006513131,0.0015732904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010384047,0.00013818848,0.0007126677,0.00076979713,0.00030860046,0.00029296931,0.016375111,0.000034120425,0.019514676,0.8025704,0.113737226,0.0454424],"study_design_scores_gemma":[0.0013007433,0.0010189797,0.00069870835,0.0020559235,0.00003432177,0.0002487663,0.0010734731,0.8010708,0.0018839776,0.06235655,0.12685357,0.0014042064],"about_ca_topic_score_codex":0.0002573591,"about_ca_topic_score_gemma":0.000009922171,"teacher_disagreement_score":0.80103666,"about_ca_system_score_codex":0.00024276739,"about_ca_system_score_gemma":0.00048765325,"threshold_uncertainty_score":0.99997085},"labels":[],"label_agreement":null},{"id":"W4402543174","doi":"10.1007/978-3-031-70932-6_14","title":"Swarming Out of the Lab: Comparing Relative Localization Methods for Collective Behavior","year":2024,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; École de Technologie Supérieure","funders":"","keywords":"Swarming (honey bee); Computer science; Collective behavior; Artificial intelligence; Simulation; Ecology; Biology","score_opus":0.0445345771555564,"score_gpt":0.33026805337479515,"score_spread":0.2857334762192387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402543174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010409632,0.0007653418,0.98951674,0.00026779898,0.005437802,0.001708869,0.000026297217,0.00012550909,0.002141227],"genre_scores_gemma":[0.25817645,0.000008516876,0.7378923,0.00035902607,0.0004356959,0.00021503055,0.000012731999,0.00008778937,0.002812417],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965343,0.00012631131,0.00078701763,0.0013282142,0.0007148785,0.0005092677],"domain_scores_gemma":[0.9962754,0.0012705954,0.0005923053,0.0011841535,0.0005834647,0.00009406952],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016802994,0.00047821127,0.0007424946,0.0005414287,0.00033254322,0.00040451245,0.003075264,0.0003049554,0.000002467789],"category_scores_gemma":[0.000311064,0.00036979263,0.000291499,0.0009752096,0.0005577027,0.0004784575,0.0014221993,0.0006342814,0.000008817751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030925443,0.000119454286,0.0005100244,0.00041567706,0.00020281154,0.000027932221,0.0111369435,0.11352961,0.0014832069,0.2801386,0.0001053735,0.5922994],"study_design_scores_gemma":[0.00035128355,0.00008896866,0.00007893763,0.000803399,0.00006827911,0.000011986051,8.4502824e-7,0.88925195,0.0039680917,0.10309343,0.0018938424,0.00038899865],"about_ca_topic_score_codex":0.000025069588,"about_ca_topic_score_gemma":0.00006358015,"teacher_disagreement_score":0.7757223,"about_ca_system_score_codex":0.0008225709,"about_ca_system_score_gemma":0.000753448,"threshold_uncertainty_score":0.9998754},"labels":[],"label_agreement":null},{"id":"W4402568937","doi":"10.1109/taes.2024.3462370","title":"Adaptive Fractional-Order Fault-Tolerant Coordinated Tracking Control of Heterogeneous Multiagent Systems Against Multiple Faults Under Deception Attacks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Aerospace and Electronic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Aeronautical Science Foundation of China; National Natural Science Foundation of China","keywords":"Deception; Fault tolerance; Multi-agent system; Computer science; Tracking (education); Order (exchange); Control (management); Fault detection and isolation; Distributed computing; Control theory (sociology); Artificial intelligence; Actuator; Psychology; Business","score_opus":0.014869684181627743,"score_gpt":0.24111353875808425,"score_spread":0.22624385457645652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402568937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040753942,0.0075866524,0.9457839,0.00025093352,0.0031506903,0.0017386212,0.00019453517,0.00049591257,0.000044792854],"genre_scores_gemma":[0.9984295,0.00028682163,0.000083349965,0.00006168884,0.00012822234,0.00046311476,0.000016533066,0.00007121305,0.00045955693],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957163,0.0004717955,0.00097243005,0.0011008399,0.00076670403,0.00097192783],"domain_scores_gemma":[0.99765605,0.0006104697,0.00034546756,0.00068679,0.0004499927,0.0002512118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006578762,0.0005966968,0.0008237946,0.00039619097,0.00038630763,0.00048674046,0.0004778857,0.000359584,0.0000064389774],"category_scores_gemma":[0.000014154826,0.00055657316,0.0002986608,0.00084827194,0.00009523183,0.0006235436,0.0000056821473,0.0006775659,0.00007581705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018312685,0.00030971933,0.000027263037,0.00025726168,0.0010245871,0.00003554578,0.0005403866,0.9672273,0.02381895,0.0012815037,0.00013147626,0.0051629147],"study_design_scores_gemma":[0.0028387776,0.00045709952,0.00004826606,0.0006779118,0.00013535042,0.00019579867,0.00062625454,0.9898545,0.0031828221,0.0000095317755,0.0014334935,0.0005402033],"about_ca_topic_score_codex":0.0009222422,"about_ca_topic_score_gemma":0.0002688949,"teacher_disagreement_score":0.9576756,"about_ca_system_score_codex":0.00078145764,"about_ca_system_score_gemma":0.0003007248,"threshold_uncertainty_score":0.99968857},"labels":[],"label_agreement":null},{"id":"W4402592314","doi":"10.1109/tac.2024.3462254","title":"Master–Slave Safe Cooperative Tracking via Game and Learning-Based Shared Control","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Master/slave; Computer science; Tracking (education); Control (management); Feedback control; Control engineering; Artificial intelligence; Engineering; Operating system; Psychology","score_opus":0.015473018419684879,"score_gpt":0.23957613948750517,"score_spread":0.2241031210678203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402592314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018924028,0.00037060754,0.990913,0.0024169348,0.0011720419,0.0014237211,0.00014677053,0.0015117025,0.0001528626],"genre_scores_gemma":[0.9974142,0.0000034656848,0.0008433909,0.00066557,0.00006471673,0.0004462836,0.000005753438,0.000049857503,0.00050677574],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965382,0.0006662528,0.0007614636,0.0008584501,0.00056832953,0.0006072624],"domain_scores_gemma":[0.9972149,0.0015872212,0.00015987571,0.00059169263,0.00018092692,0.0002653697],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0007023433,0.0004913129,0.00070281746,0.00040430573,0.0003563946,0.0012060489,0.000538859,0.00017951234,0.00021654084],"category_scores_gemma":[0.000052328516,0.00044666877,0.00027786766,0.0005591789,0.00010003295,0.0007893418,0.0000027694075,0.00058553903,0.00039621274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021752114,0.000594912,0.000049856917,0.00051694666,0.001571748,0.0004318602,0.0036291722,0.41130483,0.018146263,0.0009871008,0.00026573948,0.56228405],"study_design_scores_gemma":[0.0056865504,0.00037526916,0.0002672895,0.00036704898,0.00018777409,0.000058504407,0.000053228814,0.9910467,0.0007206556,0.000059816513,0.00074180955,0.00043531944],"about_ca_topic_score_codex":0.00004096737,"about_ca_topic_score_gemma":0.000034553075,"teacher_disagreement_score":0.9955218,"about_ca_system_score_codex":0.00021166126,"about_ca_system_score_gemma":0.00021116916,"threshold_uncertainty_score":0.9998308},"labels":[],"label_agreement":null},{"id":"W4402658942","doi":"10.1016/j.isatra.2024.09.012","title":"Finite-time hybrid impulsive formation tracking control of multi-agent systems via aperiodic intermittent communication","year":2024,"lang":"en","type":"article","venue":"ISA Transactions","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Aperiodic graph; Intermittent control; Control theory (sociology); Multi-agent system; Tracking (education); Computer science; Control (management); Control engineering; Engineering; Mathematics; Psychology; Artificial intelligence","score_opus":0.0175239483702881,"score_gpt":0.2450968060438356,"score_spread":0.2275728576735475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402658942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017700151,0.002106759,0.9927628,0.0005458024,0.0011112681,0.0008981295,0.00025561926,0.00044547272,0.000104137456],"genre_scores_gemma":[0.9981368,0.00004836989,0.001234742,0.000045030007,0.000036767386,0.0002328358,0.000062890984,0.000022211392,0.00018034516],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781805,0.0003048327,0.0008326457,0.00036366438,0.00036551576,0.00031529617],"domain_scores_gemma":[0.9981908,0.000409746,0.00022710157,0.00082167715,0.00023578563,0.000114861665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045667466,0.0002400836,0.00037535967,0.00029151485,0.00023187058,0.0004593775,0.00080237264,0.00008515867,0.00003311684],"category_scores_gemma":[0.000027242248,0.00023480692,0.00028003237,0.00040825832,0.00007041716,0.0014416989,0.000020781301,0.00027541487,0.00027505006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010155826,0.0015516893,0.00008475523,0.0018995162,0.001859521,0.0001382784,0.01809029,0.29584384,0.16873379,0.0046880646,0.00096684,0.5060419],"study_design_scores_gemma":[0.0009422649,0.00006062597,0.0001841457,0.00036124384,0.00009793792,0.00010043024,0.00018019284,0.99318695,0.001925844,0.000030461386,0.0027141983,0.00021570754],"about_ca_topic_score_codex":0.00018471308,"about_ca_topic_score_gemma":0.000019008783,"teacher_disagreement_score":0.9963668,"about_ca_system_score_codex":0.00025018738,"about_ca_system_score_gemma":0.00007555577,"threshold_uncertainty_score":0.9575148},"labels":[],"label_agreement":null},{"id":"W4403390212","doi":"10.1109/tase.2024.3473972","title":"Event-Based Finite Time Stabilizability and Formation Control of Multi-Agent Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Taishan Scholar Project of Shandong Province; National Natural Science Foundation of China","keywords":"Multi-agent system; Control (management); Computer science; Control system; Event (particle physics); Control theory (sociology); Control engineering; Engineering; Distributed computing; Artificial intelligence; Physics","score_opus":0.013288056407025736,"score_gpt":0.23293072034018752,"score_spread":0.21964266393316179,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403390212","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023892516,0.0001623598,0.9744541,0.00012831994,0.000579616,0.00037959902,0.00003848264,0.00035915463,0.000005847102],"genre_scores_gemma":[0.99819815,0.0000053862573,0.0016985243,0.000013380933,0.0000072482962,0.000058426307,0.0000010338737,0.0000059710896,0.000011864915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986467,0.000039006565,0.00036137924,0.00031478752,0.0004416234,0.00019652437],"domain_scores_gemma":[0.9991367,0.00028343374,0.000058674996,0.0002595569,0.00015767514,0.00010398159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011100058,0.00012873487,0.00016622913,0.00039296114,0.00012961122,0.0003610085,0.0002054226,0.00004463183,0.000002670842],"category_scores_gemma":[0.00005413523,0.00011834434,0.000039797975,0.00075852923,0.00007441227,0.0013789682,0.0000025034851,0.0000871753,0.000013795073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026916957,0.000036538968,0.0000044865856,0.00025985137,0.000010956496,0.0000010920234,0.00033893407,0.9327615,0.05561148,0.00038817016,0.0000031085292,0.010581196],"study_design_scores_gemma":[0.00039241018,0.00004718569,0.00028031392,0.00015089515,0.00001149072,0.000005318374,0.00002479775,0.991124,0.0077570262,0.0000028402503,0.00009373345,0.00010998646],"about_ca_topic_score_codex":0.000014418794,"about_ca_topic_score_gemma":0.0000010097059,"teacher_disagreement_score":0.9743056,"about_ca_system_score_codex":0.00014025108,"about_ca_system_score_gemma":0.000104260034,"threshold_uncertainty_score":0.48259422},"labels":[],"label_agreement":null},{"id":"W4403450801","doi":"10.1016/j.automatica.2024.111985","title":"Time-extended consensus for multi-agent non-interactive collaboration","year":2024,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Multi-agent system; Distributed computing; Artificial intelligence","score_opus":0.018109268880266514,"score_gpt":0.3045253320873736,"score_spread":0.28641606320710705,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403450801","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045305016,0.00016257538,0.98577094,0.0033642203,0.001925619,0.0016648932,0.000147564,0.001253282,0.0011803837],"genre_scores_gemma":[0.91052014,0.0000015056455,0.086089075,0.00018423673,0.000113430935,0.00040671983,0.000046762478,0.000028809196,0.0026093342],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998322,0.00009584037,0.00043972282,0.0005144936,0.00027809985,0.0003498056],"domain_scores_gemma":[0.99845535,0.0005330092,0.00011487801,0.0005359545,0.00024177856,0.0001190216],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00037426187,0.00021156039,0.0002820653,0.00014090176,0.00012020032,0.00063127116,0.00049751444,0.00008408175,0.000024311503],"category_scores_gemma":[0.00024586316,0.00019164699,0.00012698477,0.0004696359,0.000045335022,0.00037011417,0.00009513486,0.00009571486,0.0015530849],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018158513,0.001915688,0.00005261964,0.0019630138,0.0028330584,0.0007367204,0.025610818,0.0021682698,0.095888264,0.16598764,0.525628,0.17703433],"study_design_scores_gemma":[0.00078517717,0.0000974017,0.00033211376,0.00013933916,0.000036045807,0.000020724794,0.00012620335,0.9854999,0.0016617655,0.00037566663,0.010708292,0.00021736645],"about_ca_topic_score_codex":0.0000097912125,"about_ca_topic_score_gemma":0.0000044528183,"teacher_disagreement_score":0.9833316,"about_ca_system_score_codex":0.00019911268,"about_ca_system_score_gemma":0.00024535073,"threshold_uncertainty_score":0.9992243},"labels":[],"label_agreement":null},{"id":"W4403536375","doi":"10.1007/s10586-024-04693-z","title":"A distributed algorithm with dynamic event-triggered mechanism for resource allocation problems","year":2024,"lang":"en","type":"article","venue":"Cluster Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Computer science; Distributed computing; Mechanism (biology); Resource allocation; Algorithm; Event (particle physics); Resource (disambiguation); Computer network","score_opus":0.010314172859187436,"score_gpt":0.24470259354462703,"score_spread":0.2343884206854396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403536375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012054244,0.00029448647,0.9926643,0.002244234,0.0007860922,0.0015696667,0.000090207635,0.0010792778,0.00006633889],"genre_scores_gemma":[0.91175425,0.000001402201,0.086944446,0.000258391,0.00020512052,0.00014557743,0.0003248167,0.00005350134,0.00031247802],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972793,0.00014138703,0.00057311886,0.0009319901,0.00042761696,0.00064662285],"domain_scores_gemma":[0.9983916,0.0003394759,0.00019890453,0.00066420174,0.00025879545,0.00014701813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075154094,0.0003332613,0.00034160784,0.00018069259,0.00028350996,0.0009042557,0.0009387831,0.00012194016,0.0000013224957],"category_scores_gemma":[0.000052663774,0.00028793997,0.00014887517,0.0007595229,0.000032706044,0.00042674897,0.0002957148,0.00021941146,0.000036867514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008751766,0.00045095925,0.00004960059,0.001972897,0.0010889729,0.00017563906,0.005683203,0.08597038,0.0047217365,0.1308351,0.007689914,0.7612741],"study_design_scores_gemma":[0.0011794525,0.00015646823,0.000032084674,0.00057666947,0.000040754112,0.000070786315,0.00007944812,0.9902081,0.00020579345,0.0023756614,0.004706357,0.0003684512],"about_ca_topic_score_codex":0.000020253077,"about_ca_topic_score_gemma":0.00001266176,"teacher_disagreement_score":0.91054887,"about_ca_system_score_codex":0.0003029663,"about_ca_system_score_gemma":0.0001391278,"threshold_uncertainty_score":0.99995726},"labels":[],"label_agreement":null},{"id":"W4403932459","doi":"10.1016/j.ifacol.2024.10.196","title":"Periodic Event-Triggered Consensus Using Relative-State Measurements: A Hybrid System Approach","year":2024,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"State (computer science); Consensus; Computer science; Event (particle physics); Control theory (sociology); Statistical physics; Artificial intelligence; Algorithm; Physics; Multi-agent system","score_opus":0.049905753222560426,"score_gpt":0.2746870296387805,"score_spread":0.2247812764162201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403932459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07629372,0.0060655866,0.9080744,0.0009526165,0.0026976203,0.0014335627,0.00043149883,0.0018327421,0.0022182744],"genre_scores_gemma":[0.82547957,0.0000070155734,0.1731294,0.00009798087,0.00025232995,0.00006289972,0.00006940972,0.000059748803,0.0008416799],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954773,0.0004734224,0.0009005893,0.0012398089,0.0010775436,0.00083131425],"domain_scores_gemma":[0.9980279,0.00016600794,0.00025073055,0.0009729975,0.00027092829,0.00031142813],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011940981,0.0005384299,0.0006628877,0.00030603926,0.00033096405,0.00078967836,0.0010082243,0.000118132746,0.0000130193],"category_scores_gemma":[0.00013936798,0.00048169037,0.00034500586,0.00090806093,0.00011357433,0.00060872384,0.0002196786,0.00042599696,0.00029055032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010121977,0.004670893,0.0059629106,0.01555707,0.016083037,0.01585205,0.03500163,0.10559019,0.5464828,0.08111284,0.002023956,0.17065045],"study_design_scores_gemma":[0.0013653947,0.00007252117,0.00009334989,0.00068110647,0.00011859017,0.00046122528,0.0003925921,0.9941946,0.00063652295,0.000055768374,0.0013363198,0.0005919844],"about_ca_topic_score_codex":0.0001811615,"about_ca_topic_score_gemma":0.000008994697,"teacher_disagreement_score":0.88860446,"about_ca_system_score_codex":0.00085838255,"about_ca_system_score_gemma":0.0004671432,"threshold_uncertainty_score":0.9997635},"labels":[],"label_agreement":null},{"id":"W4403936717","doi":"10.1109/tase.2024.3483932","title":"Distributed Cooperative Framework for Multiple UAVs Safety: A Capability-Triggered Mechanism","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; Beijing Nova Program; National Natural Science Foundation of China","keywords":"Mechanism (biology); Distributed computing; Computer science; Engineering","score_opus":0.014556229511589632,"score_gpt":0.2507068652639931,"score_spread":0.23615063575240347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403936717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004655933,0.000043889013,0.9910724,0.0006811339,0.0016187455,0.0006242061,0.00030221866,0.00099124,0.000010237843],"genre_scores_gemma":[0.9671611,0.000008837798,0.032503486,0.00003682979,0.000031761243,0.0002198475,0.000007090701,0.000012423017,0.000018629227],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825895,0.000024053323,0.0003229111,0.00057464046,0.00045430913,0.00036510828],"domain_scores_gemma":[0.9986398,0.00057089474,0.00003743991,0.00035449822,0.00023748974,0.00015982683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008408567,0.00019155977,0.00019400344,0.00034897577,0.00041492115,0.0007334581,0.0004160816,0.00008910248,0.0000050668777],"category_scores_gemma":[0.00018950841,0.00017959083,0.00007238686,0.001553276,0.00006984789,0.0012862579,0.0000047717026,0.0001891036,0.000021923819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032758126,0.00018810364,0.0000042487964,0.00043112197,0.00013724285,0.0000121675885,0.0037092343,0.5136817,0.09393752,0.318326,0.000080958605,0.069458924],"study_design_scores_gemma":[0.00026778755,0.00005969143,0.00007346694,0.00015663395,0.000011945809,0.0000102423155,0.00007153006,0.971318,0.026596038,0.0006470962,0.00059045694,0.00019708768],"about_ca_topic_score_codex":0.000012368522,"about_ca_topic_score_gemma":0.000004461502,"teacher_disagreement_score":0.96250516,"about_ca_system_score_codex":0.00028888503,"about_ca_system_score_gemma":0.00018261907,"threshold_uncertainty_score":0.7323502},"labels":[],"label_agreement":null},{"id":"W4404293692","doi":"10.1109/tase.2024.3494658","title":"Dynamic Event-Triggered Formation Control of Multi-Agent Systems With Non-Uniform Time-Varying Communication Delays","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Control (management); Multi-agent system; Control system; Control theory (sociology); Event (particle physics); Distributed computing; Control engineering; Engineering; Physics; Artificial intelligence","score_opus":0.009027400394064867,"score_gpt":0.22876960545164007,"score_spread":0.21974220505757522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404293692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013422789,0.00017951989,0.9849104,0.0001295135,0.00038370097,0.00051041524,0.000022045055,0.00040769405,0.000033866294],"genre_scores_gemma":[0.9907014,0.000026663785,0.00911065,0.000012920318,0.000004517512,0.00009820399,0.000003850033,0.000011413916,0.000030399453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984483,0.000030617586,0.00042493816,0.00028708667,0.00056076556,0.00024826455],"domain_scores_gemma":[0.9990123,0.0001150425,0.000114306844,0.0004279163,0.0002318288,0.00009859815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088251405,0.00016522204,0.00019852885,0.00058530254,0.00024790794,0.00045660746,0.0004492466,0.00005490343,0.000001819926],"category_scores_gemma":[0.0000113345095,0.00014478568,0.00004530609,0.0011836425,0.000063032065,0.0024619768,0.0000045288066,0.00014214471,0.000028303359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049481173,0.000035392808,8.4732056e-7,0.00016105623,0.00003083252,0.0000018022165,0.0007440971,0.9298207,0.058507558,0.00030573338,0.0000052917076,0.010381749],"study_design_scores_gemma":[0.0005827814,0.000058675414,0.000100428384,0.0004313221,0.000022803917,0.000031596097,0.00006150147,0.9942198,0.004295125,0.0000030189176,0.000039438455,0.00015350657],"about_ca_topic_score_codex":0.000029227203,"about_ca_topic_score_gemma":0.0000032944647,"teacher_disagreement_score":0.9772786,"about_ca_system_score_codex":0.00028749648,"about_ca_system_score_gemma":0.00012344311,"threshold_uncertainty_score":0.5904189},"labels":[],"label_agreement":null},{"id":"W4404327200","doi":"10.1177/17298806241278273","title":"Leader-follower formation control of nonholonomic mobile robots subject to robots failure","year":2024,"lang":"en","type":"article","venue":"International Journal of Advanced Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Robot; Mobile robot; Nonholonomic system; Subject (documents); Control (management); Control theory (sociology); Simulation; Artificial intelligence","score_opus":0.010053312409848119,"score_gpt":0.2657126335621065,"score_spread":0.25565932115225837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404327200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008660902,0.002479172,0.9740874,0.001299579,0.0125637045,0.0006778842,0.000033395194,0.00008889315,0.00010903847],"genre_scores_gemma":[0.990645,0.00002200926,0.008391758,0.00007896171,0.0005920842,0.00005348682,0.000008360064,0.000027450566,0.00018089746],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964427,0.00017415857,0.00158787,0.00034929055,0.0011011015,0.00034492588],"domain_scores_gemma":[0.9970901,0.00035949517,0.0008638696,0.0004000455,0.0010830596,0.00020345638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083181605,0.00027803108,0.0006657229,0.0007173573,0.00004613438,0.00045735526,0.0017887641,0.00010887355,0.000010038219],"category_scores_gemma":[0.00015029953,0.0002402368,0.00032564157,0.0003745505,0.000031740696,0.0020037922,0.00011013154,0.00026223625,0.00012302837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642483,0.00007736774,0.00012197989,0.00008536306,0.00040268365,0.00017600894,0.0006039222,0.9695235,0.019215275,0.002902284,0.0009467514,0.0058684493],"study_design_scores_gemma":[0.007111674,0.0014056091,0.001049738,0.0048254672,0.00015483364,0.003991481,0.0016368328,0.95175946,0.0054381206,0.0002671964,0.021405786,0.0009538027],"about_ca_topic_score_codex":0.00002701005,"about_ca_topic_score_gemma":0.000008867713,"teacher_disagreement_score":0.9819841,"about_ca_system_score_codex":0.00055792474,"about_ca_system_score_gemma":0.00022735081,"threshold_uncertainty_score":0.97965723},"labels":[],"label_agreement":null},{"id":"W4404332156","doi":"10.1016/b978-0-443-14081-5.00085-4","title":"Learning in Multi-Agent Games Over Networks","year":2024,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science","score_opus":0.01893613279638714,"score_gpt":0.24665809395063318,"score_spread":0.22772196115424603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404332156","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014556681,0.007621632,0.014691939,0.00011488146,0.0029728275,0.0010933828,0.000020388965,0.00072243746,0.972748],"genre_scores_gemma":[0.013731376,0.000120205754,0.00070844026,0.00024042516,0.0004073395,0.00011916353,0.000033279463,0.00013948008,0.9845003],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99610955,0.00009738851,0.0009917325,0.0013676279,0.0006538286,0.00077989354],"domain_scores_gemma":[0.997935,0.00014454262,0.0003879626,0.0012039957,0.00009225955,0.00023623258],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006808565,0.0007992356,0.0009480401,0.0004593916,0.00010156655,0.000553,0.0015236968,0.00061876565,0.00006794781],"category_scores_gemma":[0.000031171396,0.00077632285,0.00047506025,0.000073898365,0.0000874256,0.00016867883,0.00085960876,0.0017438387,0.0010020975],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005631789,0.000017381744,0.000050656214,0.00012125479,0.00018187909,0.0006041687,0.0004426785,0.0012707036,0.000010851081,0.03321594,0.00031304863,0.9637658],"study_design_scores_gemma":[0.00065127964,0.000052659878,0.00010475107,0.0013316144,0.000055402168,0.000024404679,0.000007284794,0.11722114,0.000002717129,0.0015970949,0.8781885,0.00076316274],"about_ca_topic_score_codex":0.000005105204,"about_ca_topic_score_gemma":0.00008283463,"teacher_disagreement_score":0.9630026,"about_ca_system_score_codex":0.0004226274,"about_ca_system_score_gemma":0.00016034671,"threshold_uncertainty_score":0.99977577},"labels":[],"label_agreement":null},{"id":"W4404346933","doi":"10.48550/arxiv.2410.23592","title":"Adaptive Distributed Observer-based Model Predictive Control for Multi-agent Formation with Resilience to Communication Link Faults","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Observer (physics); Link (geometry); Resilience (materials science); Computer science; Distributed computing; Model predictive control; Communication link; Multi-agent system; Control (management); Control theory (sociology); Computer network; Artificial intelligence; Materials science; Physics","score_opus":0.0977672477982594,"score_gpt":0.2216029472889081,"score_spread":0.12383569949064868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404346933","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010062761,0.000093314775,0.9808535,0.0006820537,0.00028492263,0.00412315,0.0031658295,0.00064723706,0.00008725314],"genre_scores_gemma":[0.97608393,0.000011653904,0.022668306,0.00016255018,0.000040187817,0.00015163652,0.00062034273,0.00003998295,0.00022139975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99665725,0.00032960108,0.0005330222,0.0015773805,0.00028811817,0.00061463076],"domain_scores_gemma":[0.99541247,0.00031706612,0.000589202,0.0022585823,0.0010602255,0.0003624842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058219157,0.00060120964,0.0006279132,0.00035277146,0.00032887317,0.00027405933,0.0029567587,0.00038947424,0.0000012244127],"category_scores_gemma":[0.00012823386,0.00061493693,0.00031110196,0.00087922206,0.00012052845,0.0006962076,0.0013078884,0.00070197764,0.00005494188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005933555,0.00014922068,0.00011568324,0.00017256678,0.00019371547,0.00003260614,0.00038548067,0.97132325,0.000048157297,0.026456673,0.00029410725,0.00023519246],"study_design_scores_gemma":[0.0034967978,0.00033574924,0.0005050081,0.00070919393,0.00026873854,0.0000017771732,0.00017724534,0.989453,0.00016645821,0.004162508,0.000085669075,0.00063783716],"about_ca_topic_score_codex":0.00015774027,"about_ca_topic_score_gemma":0.0003415732,"teacher_disagreement_score":0.9660212,"about_ca_system_score_codex":0.0013126926,"about_ca_system_score_gemma":0.00061838835,"threshold_uncertainty_score":0.9996302},"labels":[],"label_agreement":null},{"id":"W4404414057","doi":"10.1080/00207721.2024.2427848","title":"Distributed adaptive finite-time fault-tolerant cooperative control of heterogeneous multi-agent systems with saturation and disturbances","year":2024,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Aeronautical Science Foundation of China; National Natural Science Foundation of China","keywords":"Saturation (graph theory); Control theory (sociology); Fault tolerance; Multi-agent system; Distributed computing; Computer science; Control (management); Mathematics; Artificial intelligence","score_opus":0.013439694798850451,"score_gpt":0.24923975128792275,"score_spread":0.2358000564890723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404414057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03403773,0.006070541,0.95386493,0.00036964353,0.0046346667,0.00055425323,0.00037699394,0.000055867084,0.0000353948],"genre_scores_gemma":[0.9989598,0.00003518103,0.00060614484,0.00001937798,0.0002654063,0.00002468594,0.000007724739,0.000011441836,0.00007026038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960173,0.00022360153,0.0011015182,0.00049939944,0.0018429388,0.00031528887],"domain_scores_gemma":[0.9954825,0.000450571,0.000911263,0.00027690246,0.002664546,0.00021419516],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001411202,0.0002723194,0.00055493333,0.00044809494,0.0001424821,0.0014599992,0.0016031055,0.0000666369,0.0000017188229],"category_scores_gemma":[0.00021626477,0.00018501216,0.0001046906,0.0006754529,0.00044852513,0.0019441413,0.0001243483,0.00021701869,0.000011967693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005405708,0.00041027323,0.0014439533,0.00023851711,0.0017315886,0.0019065706,0.00350727,0.9172598,0.050794728,0.019211352,0.00037333078,0.0025820527],"study_design_scores_gemma":[0.0014160824,0.00045993918,0.0007363173,0.0013327204,0.000040413273,0.0015827214,0.0003221995,0.99207544,0.00094535376,0.000011897546,0.0008540575,0.00022284084],"about_ca_topic_score_codex":0.00013927945,"about_ca_topic_score_gemma":0.000005296399,"teacher_disagreement_score":0.9649221,"about_ca_system_score_codex":0.00039861724,"about_ca_system_score_gemma":0.0005329438,"threshold_uncertainty_score":0.99957657},"labels":[],"label_agreement":null},{"id":"W4404688515","doi":"10.1109/oceans55160.2024.10753760","title":"Low Bandwidth Control of Swarms in Constrained Environments","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bandwidth (computing); Computer science; Computer network","score_opus":0.006682134521636293,"score_gpt":0.21285516473757107,"score_spread":0.20617303021593478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404688515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007288498,0.00029761196,0.986607,0.00058862625,0.0004705785,0.00033876684,0.000029005507,0.00011940639,0.0042604744],"genre_scores_gemma":[0.9983662,0.000005908166,0.0008375303,0.00011091639,0.000022830853,0.000024600715,0.000003983279,0.000006730906,0.00062129647],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867785,0.000070765396,0.00038180832,0.00034067474,0.00027251884,0.00025639936],"domain_scores_gemma":[0.99934524,0.00015224877,0.000048397473,0.0003721555,0.000009569392,0.000072367104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034412867,0.00012847825,0.00024276075,0.00013057185,0.000013465597,0.000089337016,0.00051682064,0.000058044323,0.00006849688],"category_scores_gemma":[0.000023145318,0.000106404514,0.000078234516,0.00026021973,0.00005467577,0.0002860221,0.00006158347,0.00009232358,0.00017249834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007581995,0.001185006,0.015002919,0.00050168845,0.00061531644,0.00093404035,0.002029922,0.0052997647,0.23211229,0.5404814,0.0034472693,0.19831455],"study_design_scores_gemma":[0.004005312,0.00012588601,0.005504838,0.0002266772,0.000016326956,0.000022214193,0.000062770974,0.96559256,0.014550216,0.0009652979,0.008576047,0.0003518491],"about_ca_topic_score_codex":0.00004644573,"about_ca_topic_score_gemma":0.000008094223,"teacher_disagreement_score":0.9910777,"about_ca_system_score_codex":0.000060772207,"about_ca_system_score_gemma":0.00005781192,"threshold_uncertainty_score":0.43390504},"labels":[],"label_agreement":null},{"id":"W4404799659","doi":"10.1016/j.neucom.2024.129005","title":"Enhancing cooperative multi-agent reinforcement learning through the integration of R-STDP and federated learning","year":2024,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Telefonaktiebolaget LM Ericsson","keywords":"Reinforcement learning; Computer science; Reinforcement; Cooperative learning; Artificial intelligence; Machine learning; Mathematics education; Teaching method; Mathematics; Materials science","score_opus":0.029302611877492297,"score_gpt":0.2814269726272203,"score_spread":0.252124360749728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404799659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047707606,0.00046121495,0.9495873,0.00035451216,0.000533983,0.00045360078,4.904218e-7,0.00036928226,0.0005320063],"genre_scores_gemma":[0.9956983,0.000018751898,0.0035893077,0.000117280586,0.000092922455,0.000019996605,0.000007641487,0.000019882536,0.00043594895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977863,0.00043531673,0.0005806915,0.0005306278,0.00033073756,0.0003363423],"domain_scores_gemma":[0.9988228,0.0005357009,0.00021714819,0.00020145132,0.0001712579,0.000051621868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006714683,0.00023373603,0.00025963486,0.00007939977,0.0006017335,0.0007839387,0.00035237396,0.000058877307,0.0000040063405],"category_scores_gemma":[0.00031611088,0.00017246282,0.00007449533,0.00053605787,0.000050428676,0.0005055031,0.0003437383,0.00060576503,0.000019419022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014085767,0.000050468436,0.00029313244,0.00024689685,0.0001520196,0.00006508685,0.03051241,0.6218275,0.24040948,0.016761446,0.00010584589,0.08956168],"study_design_scores_gemma":[0.00033861754,0.00014188996,0.00025344314,0.00036596687,0.000013753171,0.00002684438,0.0010436844,0.98007613,0.015424859,0.000012763072,0.0021430724,0.0001589848],"about_ca_topic_score_codex":0.00015529095,"about_ca_topic_score_gemma":0.000016320277,"teacher_disagreement_score":0.94799066,"about_ca_system_score_codex":0.00006827734,"about_ca_system_score_gemma":0.000072120456,"threshold_uncertainty_score":0.7559539},"labels":[],"label_agreement":null},{"id":"W4404875905","doi":"10.1016/j.arcontrol.2024.100983","title":"Survey of distributed algorithms for resource allocation over multi-agent systems","year":2024,"lang":"en","type":"article","venue":"Annual Reviews in Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Distributed computing; Multi-agent system; Resource allocation; Resource (disambiguation); Algorithm; Artificial intelligence; Computer network","score_opus":0.060258695190355364,"score_gpt":0.33614106973959057,"score_spread":0.2758823745492352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404875905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000264871,0.063770026,0.9283016,0.00029766254,0.0012778187,0.0033786932,0.0025469526,0.00013443783,0.000027934711],"genre_scores_gemma":[0.99577266,0.000542501,0.0013774416,0.00015135924,0.00015108143,0.0011979224,0.00046055153,0.000034298067,0.0003121572],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9956684,0.001066473,0.001558616,0.00076345383,0.00042345494,0.0005195848],"domain_scores_gemma":[0.99685246,0.001297444,0.0003970433,0.0009191515,0.00039554914,0.00013834372],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005662984,0.00033196274,0.0010265523,0.00020193131,0.000056882862,0.00023417211,0.0010894007,0.00015832485,0.0000035525493],"category_scores_gemma":[0.0016115726,0.0002779142,0.0002662163,0.00095181924,0.000044477056,0.00052202685,0.00010070233,0.00019521634,0.000059365364],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003091637,0.0016759962,0.013115942,0.007371611,0.0011435375,0.00013386177,0.0029691,0.015066671,0.0021612775,0.049115233,0.14387436,0.76306325],"study_design_scores_gemma":[0.0017545738,0.00008786582,0.009525142,0.00076636515,0.000034148296,0.0000041668236,0.000024368795,0.70852596,0.000016042351,0.000014317857,0.27899623,0.00025082607],"about_ca_topic_score_codex":0.0008700394,"about_ca_topic_score_gemma":0.0001533834,"teacher_disagreement_score":0.99550784,"about_ca_system_score_codex":0.00022612486,"about_ca_system_score_gemma":0.0001468704,"threshold_uncertainty_score":0.9999673},"labels":[],"label_agreement":null},{"id":"W4404915039","doi":"10.1109/ismar-adjunct64951.2024.00141","title":"FlockGPT: Guiding UAV Flocking with Linguistic Orchestration","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"","keywords":"Flocking (texture); Orchestration; Computer science; Artificial intelligence; Art; Visual arts","score_opus":0.029656068403789145,"score_gpt":0.24935087803478306,"score_spread":0.21969480963099391,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404915039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019704925,0.0002902002,0.9691725,0.00045462383,0.000919685,0.0001994428,0.000002159279,0.001058321,0.025932623],"genre_scores_gemma":[0.97767174,0.000001998166,0.02079649,0.000073370116,0.00036975226,0.000024474833,0.00000699683,0.000014684043,0.0010405134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856704,0.00004684454,0.00026171375,0.00047341146,0.00034803554,0.00030297268],"domain_scores_gemma":[0.99918425,0.00013371602,0.000039418934,0.00044207217,0.00010840825,0.00009215349],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035744105,0.00016108948,0.00014516368,0.000118841665,0.00010853693,0.0009748801,0.0005193814,0.000051650637,0.000020096459],"category_scores_gemma":[0.000103243845,0.00012281178,0.000048922575,0.0005344797,0.000017043778,0.0004022158,0.00008158583,0.00009145634,0.00023526952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075589164,0.000044379118,0.00045579614,0.00015862226,0.00013246757,0.00046634578,0.0014827483,0.0018281204,0.0068919067,0.95917094,0.0024445157,0.026916595],"study_design_scores_gemma":[0.00025765103,0.00007615458,0.00023970888,0.00025856326,0.000020149577,0.00008012689,0.000037918162,0.97583044,0.0022786348,0.0016229305,0.01901717,0.00028057912],"about_ca_topic_score_codex":0.00006256023,"about_ca_topic_score_gemma":0.000022767068,"teacher_disagreement_score":0.9757012,"about_ca_system_score_codex":0.00009934788,"about_ca_system_score_gemma":0.00014385703,"threshold_uncertainty_score":0.94007915},"labels":[],"label_agreement":null},{"id":"W4404952278","doi":"10.1109/tase.2024.3506123","title":"Fault-Tolerant Leader-Follower Controller for Uncertain Nonlinear Multi-Agent Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Concordia University","funders":"","keywords":"Control theory (sociology); Nonlinear system; Fault tolerance; Multi-agent system; Computer science; Control engineering; Controller (irrigation); Control reconfiguration; Robustness (evolution); Engineering; Distributed computing; Control (management); Artificial intelligence; Embedded system","score_opus":0.02877613469041963,"score_gpt":0.27159840784208983,"score_spread":0.2428222731516702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404952278","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035174477,0.0002878699,0.99051183,0.0004561744,0.0034935132,0.00075801875,0.000049329145,0.00090498367,0.000020828962],"genre_scores_gemma":[0.9861331,0.000011770219,0.013119359,0.000062160965,0.000064872576,0.0003098092,0.0000018710999,0.000018814786,0.00027823725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979364,0.000022123473,0.000405071,0.00059867447,0.0005967243,0.00044097967],"domain_scores_gemma":[0.99905485,0.00019309272,0.000049150407,0.00030949837,0.00021600229,0.00017741047],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009955515,0.00022589727,0.0002477241,0.0005182416,0.00032069016,0.0010691691,0.00046583678,0.00007908015,0.0000022164782],"category_scores_gemma":[0.00003671482,0.00019979624,0.00010368532,0.0009910158,0.00006392929,0.0012074363,0.0000037972106,0.0001537704,0.000048921363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007109972,0.00007101559,8.7400736e-7,0.0002009117,0.000062357154,0.000009052529,0.0008661972,0.9321174,0.036296804,0.0021818755,0.00012270332,0.028063707],"study_design_scores_gemma":[0.0007283306,0.00005317182,0.000033879875,0.00017519404,0.000017878852,0.000023984028,0.00009216442,0.9912872,0.0023474728,0.0000033750716,0.0050099264,0.0002274557],"about_ca_topic_score_codex":0.000028542445,"about_ca_topic_score_gemma":0.0000024237377,"teacher_disagreement_score":0.98261565,"about_ca_system_score_codex":0.00024102394,"about_ca_system_score_gemma":0.00015734037,"threshold_uncertainty_score":0.9999678},"labels":[],"label_agreement":null},{"id":"W4405559446","doi":"10.1002/rnc.7768","title":"A Resilient Event‐Triggered Control Scheme for Nonlinear Multi‐Agent Systems Under Communication Delays and Denial‐Of‐Service Attacks","year":2024,"lang":"en","type":"article","venue":"International Journal of Robust and Nonlinear Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Chinese Aeronautical Establishment; National Natural Science Foundation of China","keywords":"Denial-of-service attack; Scheme (mathematics); Nonlinear system; Computer science; Distributed computing; Event (particle physics); Control (management); Control theory (sociology); Computer network; Computer security; Mathematics; Artificial intelligence; Physics","score_opus":0.027442880893010294,"score_gpt":0.2973932058790795,"score_spread":0.26995032498606925,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405559446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03793183,0.011413365,0.9421788,0.0057510785,0.0015798087,0.0006792151,0.00041384532,0.0000410552,0.0000110352385],"genre_scores_gemma":[0.9681721,0.00024187136,0.030602628,0.00037616398,0.00046363744,0.000031792682,0.000029615712,0.00002321644,0.000059025668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750036,0.00020534202,0.0011254111,0.00030527895,0.000620866,0.00024271542],"domain_scores_gemma":[0.9963993,0.00079175126,0.0006431657,0.00031272482,0.0016770092,0.000176043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012754366,0.00023443087,0.0005215989,0.0003171013,0.00009029755,0.0004667559,0.0009787387,0.00013131346,0.000003485916],"category_scores_gemma":[0.00019321611,0.00019870134,0.0002083814,0.00017220667,0.00006142686,0.0005915962,0.00012132499,0.00026294432,0.00000484192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013376048,0.0060663386,0.020790216,0.0038918208,0.03065526,0.0011260133,0.0070601143,0.5624935,0.12682493,0.10370505,0.010358566,0.11365213],"study_design_scores_gemma":[0.008170085,0.00016686131,0.00054506754,0.0005652843,0.0001298577,0.00021197107,0.00012904262,0.98477525,0.000113976064,0.000082429666,0.0049300194,0.00018018796],"about_ca_topic_score_codex":0.000082133825,"about_ca_topic_score_gemma":0.00003731161,"teacher_disagreement_score":0.9302402,"about_ca_system_score_codex":0.00013024843,"about_ca_system_score_gemma":0.00022222659,"threshold_uncertainty_score":0.8102805},"labels":[],"label_agreement":null},{"id":"W4406091674","doi":"10.1137/23m1576098","title":"An Input-Output Framework for Stability and Synchronization Analysis of Networks of Infinite-Dimensional Linear Systems","year":2025,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Synchronization (alternating current); Stability (learning theory); Control theory (sociology); Applied mathematics; Topology (electrical circuits); Computer science; Control (management); Combinatorics; Artificial intelligence","score_opus":0.01133297945079023,"score_gpt":0.25801603897433123,"score_spread":0.246683059523541,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406091674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009632819,0.00088141265,0.9883924,0.00020856004,0.00037298468,0.00042935845,0.000048268266,0.000021774265,0.000012385391],"genre_scores_gemma":[0.9737361,0.00006620321,0.02597191,0.00009911908,0.00006787452,0.000012938048,0.000035379515,0.0000059873064,0.0000044732624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982946,0.00028000836,0.00073050166,0.00027732976,0.00024876086,0.00016882924],"domain_scores_gemma":[0.9975163,0.0007030866,0.00061712833,0.0002877655,0.00077409885,0.000101657],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010147284,0.00014758605,0.00054164825,0.0004217064,0.0001486144,0.00014667444,0.00021393927,0.00015329232,0.0000025680663],"category_scores_gemma":[0.00034043603,0.00012660293,0.00010192473,0.0008281461,0.000052306186,0.00035461446,0.000028452243,0.00014229762,5.4483657e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015498562,0.000096313444,0.005052856,0.000048002035,0.0004552918,5.6419634e-7,0.0000669236,0.97507524,0.000057100555,0.016614657,0.000007194789,0.0023708919],"study_design_scores_gemma":[0.001599887,0.0002670397,0.0041224305,0.00014345071,0.00036436672,0.0000021318606,0.000029876317,0.99310964,0.000016675735,0.00023140677,0.0000175851,0.00009552596],"about_ca_topic_score_codex":0.0000110587935,"about_ca_topic_score_gemma":0.0000031033042,"teacher_disagreement_score":0.9641033,"about_ca_system_score_codex":0.0000476176,"about_ca_system_score_gemma":0.00009263094,"threshold_uncertainty_score":0.51627177},"labels":[],"label_agreement":null},{"id":"W4406110875","doi":"10.1109/tac.2025.3526002","title":"Securing Mobile Robotic Networks Against Replacement Attack","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Controllability; Robot; Leverage (statistics); Computer science; Mobile robot; Perspective (graphical); Topology (electrical circuits); Polygon (computer graphics); Network topology; Distributed computing; Computer network; Engineering; Artificial intelligence; Mathematics","score_opus":0.010859868550283177,"score_gpt":0.251145663702675,"score_spread":0.24028579515239182,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406110875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035303694,0.00017896951,0.9891777,0.0006596144,0.002752688,0.0016577638,0.000012551372,0.0010661356,0.0009641938],"genre_scores_gemma":[0.99554664,0.000012767733,0.0014041499,0.0009613962,0.000040585943,0.0009276952,0.000002652085,0.000020319632,0.0010837715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99727273,0.00025281514,0.00078945357,0.0006601791,0.00041772233,0.00060710195],"domain_scores_gemma":[0.9977371,0.00047960551,0.00019863804,0.001314699,0.00011018941,0.00015976987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005094936,0.00035561,0.0005520025,0.00030978475,0.0003483662,0.000331577,0.0009252964,0.00014244067,0.000051993655],"category_scores_gemma":[0.000014683977,0.0003503307,0.00028142743,0.00071095605,0.000043408134,0.00034346123,0.0000061039223,0.00027522122,0.00017383443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022765742,0.00028339747,0.000012179188,0.000058929607,0.00030175532,0.000013695412,0.00013000048,0.91067624,0.0002839784,0.00038934447,0.000695881,0.08713185],"study_design_scores_gemma":[0.0034588303,0.000121998404,0.00012708965,0.00025000775,0.000092708964,0.0000058206792,0.000041719693,0.99429643,0.0003520358,0.000029873907,0.00094177644,0.0002817322],"about_ca_topic_score_codex":0.000020055655,"about_ca_topic_score_gemma":0.000024845953,"teacher_disagreement_score":0.9920163,"about_ca_system_score_codex":0.00035455343,"about_ca_system_score_gemma":0.00013653496,"threshold_uncertainty_score":0.99989486},"labels":[],"label_agreement":null},{"id":"W4406118775","doi":"10.1109/tcns.2025.3526343","title":"A Modified Distributed Gradient Dynamics for Multiagent Optimization on Directed Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Lipschitz continuity; Subgradient method; Mathematical optimization; Convex function; Sublinear function; Convergence (economics); Convex optimization; Computer science; Distributed algorithm; Optimization problem; Rate of convergence; Mathematics; Regular polygon","score_opus":0.011444705177502602,"score_gpt":0.22979047611649558,"score_spread":0.218345770938993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406118775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020643475,0.0003082262,0.9866981,0.00038495383,0.007350507,0.0036359297,0.0006323379,0.00061572256,0.000167825],"genre_scores_gemma":[0.9960222,0.000024646342,0.0019662827,0.0001125878,0.00017442163,0.0013117918,0.000117212585,0.00003603609,0.00023478158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962406,0.00045719204,0.001254563,0.0008185293,0.00046201976,0.00076708064],"domain_scores_gemma":[0.99638337,0.0011995714,0.0005764304,0.0011213119,0.0005339079,0.00018541445],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007383982,0.0004854078,0.00095423555,0.0003155285,0.00040396085,0.00022456491,0.00092641177,0.00031083162,0.0000022424153],"category_scores_gemma":[0.000034319408,0.00047032442,0.00045277385,0.0012280005,0.00005982116,0.00022059427,0.0000049263217,0.0002985209,0.0000040156665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005080217,0.00039965892,0.000025083327,0.000078872785,0.0005659902,0.0000037809707,0.000024487645,0.9820338,0.000021032594,0.010278088,0.0010116934,0.005049472],"study_design_scores_gemma":[0.0061052684,0.00033309532,0.00006873719,0.00046580302,0.00018065452,0.0000033281417,0.000019739255,0.9919563,0.000037137506,0.000036167654,0.0004502106,0.00034354726],"about_ca_topic_score_codex":0.00012448973,"about_ca_topic_score_gemma":0.00010412512,"teacher_disagreement_score":0.9958158,"about_ca_system_score_codex":0.00058702496,"about_ca_system_score_gemma":0.0001160236,"threshold_uncertainty_score":0.9997749},"labels":[],"label_agreement":null},{"id":"W4406729011","doi":"10.1109/ton.2025.3530460","title":"Exploring Temporal Similarity for Joint Computation and Communication in Online Distributed Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Joint (building); Computer science; Computation; Similarity (geometry); Artificial intelligence; Distributed computing; Algorithm; Engineering","score_opus":0.10655535451767793,"score_gpt":0.2887770755511856,"score_spread":0.18222172103350764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406729011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036577147,0.000118005104,0.9935875,0.0010077785,0.0007630236,0.0006183673,0.00004620706,0.00017877445,0.000022620676],"genre_scores_gemma":[0.93823117,0.000108770306,0.06122704,0.00009081804,0.000029956786,0.00018321414,0.00011191838,0.000008693684,0.000008441068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987431,0.00014698724,0.00043092677,0.00032697874,0.00012517642,0.0002268298],"domain_scores_gemma":[0.9991432,0.0002788304,0.00012238573,0.00031835676,0.00009310144,0.00004417018],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039566422,0.00014770009,0.0002180459,0.00022914357,0.00028225774,0.00016324829,0.00024148115,0.00007101209,5.011765e-7],"category_scores_gemma":[0.000009770187,0.0001692303,0.00005905245,0.00067173765,0.000022172728,0.0005508654,0.0000051892534,0.00020262027,3.9866606e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023793511,0.0001286547,0.00015233169,0.000027635204,0.000022156562,6.914059e-7,0.00012750692,0.9496541,0.000039832445,0.00040888222,0.000030093544,0.04938432],"study_design_scores_gemma":[0.0011643133,0.00003060223,0.0007328254,0.0003035426,0.000015968082,0.000001219622,0.00007186242,0.9968026,0.00019356719,0.0003035888,0.00024572207,0.00013416592],"about_ca_topic_score_codex":0.000095991374,"about_ca_topic_score_gemma":0.00022620325,"teacher_disagreement_score":0.9345734,"about_ca_system_score_codex":0.00017713507,"about_ca_system_score_gemma":0.00003996996,"threshold_uncertainty_score":0.69010115},"labels":[],"label_agreement":null},{"id":"W4406755395","doi":"10.1109/tii.2024.3523576","title":"A Deep Reinforcement Learning Approach Using Asymmetric Self-Play for Robust Multirobot Flocking","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Flocking (texture); Reinforcement learning; Computer science; Artificial intelligence; Robustness (evolution); Materials science","score_opus":0.06397134551297427,"score_gpt":0.27199469144714894,"score_spread":0.20802334593417465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406755395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037121132,0.000014081387,0.99321425,0.000055614317,0.0024549651,0.001706723,0.000009116203,0.0004757128,0.0016983248],"genre_scores_gemma":[0.8222142,0.000007722354,0.17673773,0.00017252463,0.0001455963,0.00028823223,0.000021701377,0.000024871784,0.00038744582],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709624,0.00013585262,0.00129487,0.00030064993,0.0005221296,0.0006502305],"domain_scores_gemma":[0.9980095,0.00050954666,0.00046754844,0.0006107911,0.00024752456,0.0001550987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010243298,0.00037210048,0.00047911998,0.0010050774,0.0008127392,0.0005649594,0.00089155656,0.0003996418,0.0000042807724],"category_scores_gemma":[0.00010533469,0.00037718302,0.00026967414,0.0020241751,0.000032785643,0.0010731267,0.0000142737035,0.0007911449,0.000018320974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035067445,0.00013166388,0.000008288287,0.00007847268,0.00021673308,5.533994e-7,0.00097149616,0.9637166,0.00002194602,0.0006504342,0.00014534609,0.034023378],"study_design_scores_gemma":[0.0038204195,0.00013604289,0.0000015084083,0.00012439823,0.00013075343,0.00000831902,0.0005675602,0.99153817,0.0014246032,0.000008754128,0.001897955,0.00034152876],"about_ca_topic_score_codex":0.00006841282,"about_ca_topic_score_gemma":0.0000031491427,"teacher_disagreement_score":0.82184297,"about_ca_system_score_codex":0.000658713,"about_ca_system_score_gemma":0.00032582204,"threshold_uncertainty_score":0.99986804},"labels":[],"label_agreement":null},{"id":"W4406795689","doi":"10.1080/00207721.2025.2456028","title":"Static output feedback strategy for mean-field social control with nonlinear stochastic dynamics","year":2025,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Japan Society for the Promotion of Science","keywords":"Control theory (sociology); Nonlinear system; Dynamics (music); Control (management); Field (mathematics); Feedback control; Output feedback; Nonlinear control; Computer science; Mathematics; Control engineering; Engineering; Psychology; Physics; Artificial intelligence","score_opus":0.01629037776134769,"score_gpt":0.29390427925727114,"score_spread":0.27761390149592347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406795689","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008490861,0.00007419451,0.9822078,0.0037044047,0.004532021,0.00044067777,0.000070421294,0.000030024452,0.00044960572],"genre_scores_gemma":[0.9965257,0.0000012159595,0.0024732477,0.00028010996,0.0004070354,0.000021414495,0.0000024283233,0.000007268976,0.0002815546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996916,0.000067529065,0.0008395783,0.00032868003,0.001478411,0.00036980488],"domain_scores_gemma":[0.99521935,0.00047095673,0.00086349406,0.00023199293,0.003086525,0.00012768901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015967512,0.00018356992,0.0003824577,0.00051817484,0.00021081664,0.0010302516,0.0030412578,0.000060109844,0.0000011033858],"category_scores_gemma":[0.0003475252,0.0001429061,0.00012312188,0.0005494434,0.00017488714,0.0012003629,0.000100948026,0.00019455886,0.0000057483403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014094771,0.00082599814,0.0019296652,0.00027910594,0.0018453046,0.00027349382,0.0021631399,0.32490373,0.004414074,0.6062744,0.0074557243,0.048225842],"study_design_scores_gemma":[0.0036749118,0.00039375512,0.0006543532,0.00037926875,0.00004027162,0.00018615632,0.0007237945,0.992311,0.00010408174,0.00069347763,0.0006446213,0.0001943197],"about_ca_topic_score_codex":0.00008160735,"about_ca_topic_score_gemma":0.000026060872,"teacher_disagreement_score":0.98803484,"about_ca_system_score_codex":0.00059779204,"about_ca_system_score_gemma":0.0012774641,"threshold_uncertainty_score":0.993474},"labels":[],"label_agreement":null},{"id":"W4406995332","doi":"10.1007/s11768-024-00241-7","title":"Cooperative RISE learning-based circumnavigation of networked unmanned aerial vehicles with collision avoidance and connectivity preservation","year":2025,"lang":"en","type":"article","venue":"Control Theory and Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; College Ahuntsic","funders":"","keywords":"Collision avoidance; Computational intelligence; Computer science; Artificial intelligence; Collision; Real-time computing; Aeronautics; Engineering; Computer security","score_opus":0.003741293661886316,"score_gpt":0.21415269041440826,"score_spread":0.21041139675252196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406995332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4413631,0.00050491793,0.55655783,0.00090279017,0.00006634543,0.00042162364,0.0000065247295,0.00013372552,0.000043167685],"genre_scores_gemma":[0.9995351,0.000009241402,0.00021019198,0.000059175803,0.0000141482,0.00009894519,0.000005830638,0.0000052513037,0.00006210842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985313,0.0005779733,0.00023992146,0.00037068778,0.00009564892,0.00018446428],"domain_scores_gemma":[0.9983328,0.0008349604,0.00021627301,0.00030190102,0.00028314922,0.00003093991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008759173,0.00014633135,0.00033926417,0.00017011305,0.0002179858,0.00005960292,0.0002627324,0.0001794736,8.0290425e-7],"category_scores_gemma":[0.0005939798,0.00012422017,0.000018892566,0.00060664903,0.00035045028,0.0002869657,0.00007493778,0.00019592074,5.451514e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015049004,0.00011173017,0.018180437,0.00006552921,0.0001438041,0.0000069199755,0.00013947925,0.013753727,0.025687866,0.9203788,0.00002428508,0.020002495],"study_design_scores_gemma":[0.01491164,0.001093466,0.010982728,0.0003962731,0.00009830043,0.000007742563,0.00021511692,0.8869849,0.022653418,0.061234664,0.0010797944,0.00034195246],"about_ca_topic_score_codex":0.000011606598,"about_ca_topic_score_gemma":0.000010843932,"teacher_disagreement_score":0.8732312,"about_ca_system_score_codex":0.000025871304,"about_ca_system_score_gemma":0.00008457535,"threshold_uncertainty_score":0.50655514},"labels":[],"label_agreement":null},{"id":"W4407240373","doi":"10.1016/j.automatica.2025.112179","title":"Distributed fault-tolerant control of multi-UAV formation for dynamic leader tracking: A Lyapunov-based MPC framework","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of Guelph","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Fault tolerance; Lyapunov function; Computer science; Control (management); Model predictive control; Tracking (education); Control engineering; Fault detection and isolation; Lyapunov stability; Distributed computing; Engineering; Nonlinear system; Artificial intelligence; Actuator; Psychology","score_opus":0.018801980689333784,"score_gpt":0.2920917937293816,"score_spread":0.2732898130400478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407240373","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002750856,0.00018770793,0.9905486,0.0031577102,0.00050728675,0.0018483235,0.000380501,0.0005754769,0.00004352152],"genre_scores_gemma":[0.92731047,8.8497615e-7,0.071687706,0.000421422,0.000015940333,0.00037295083,0.00012944745,0.000017057153,0.00004410787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733156,0.00017553578,0.001073923,0.0004589091,0.00040260638,0.00055747747],"domain_scores_gemma":[0.99685436,0.0011496483,0.0004986711,0.0009819462,0.0004125461,0.000102831065],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005831637,0.0003161203,0.00066863274,0.000239732,0.00017866245,0.00021494085,0.0011064312,0.00024307401,0.00000721799],"category_scores_gemma":[0.0008203277,0.000292523,0.0002919813,0.0007290051,0.00008496316,0.0005190656,0.00006482668,0.00019079796,0.000027300914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008760673,0.0068353205,0.003121961,0.009823648,0.0027546058,0.000088410474,0.0071596904,0.12592404,0.04406012,0.5168618,0.008642642,0.27385172],"study_design_scores_gemma":[0.0044994527,0.000081214705,0.0031450316,0.00053794903,0.0000839891,0.0000032336857,0.00008240974,0.98720306,0.0015207938,0.0013734942,0.001207672,0.00026168325],"about_ca_topic_score_codex":0.0000139598105,"about_ca_topic_score_gemma":0.000009212747,"teacher_disagreement_score":0.92455965,"about_ca_system_score_codex":0.00019526166,"about_ca_system_score_gemma":0.00020347907,"threshold_uncertainty_score":0.9999527},"labels":[],"label_agreement":null},{"id":"W4407408401","doi":"10.3390/drones9020136","title":"Connectivity Preservation and Obstacle Avoidance Control for Multiple Quadrotor UAVs with Limited Communication Distance","year":2025,"lang":"en","type":"article","venue":"Drones","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Chinese Aeronautical Establishment; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Obstacle avoidance; Obstacle; Computer science; Control (management); Artificial intelligence; Geography; Mobile robot","score_opus":0.011370540390514442,"score_gpt":0.23390216537200492,"score_spread":0.22253162498149048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407408401","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07566734,0.00069992384,0.9191479,0.0025072417,0.00011441314,0.0014929258,0.000070438844,0.00017661731,0.00012322635],"genre_scores_gemma":[0.9917111,0.00001037289,0.0070306696,0.00016974013,0.00001592345,0.00075430825,0.000030726806,0.000008108888,0.00026906485],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988791,0.00015493948,0.00023475783,0.00036666673,0.00014441484,0.00022016522],"domain_scores_gemma":[0.99770683,0.0010742088,0.00017266753,0.0007652271,0.00023347541,0.000047580517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035591726,0.0001449239,0.0002396372,0.00005649992,0.00025952817,0.00019598217,0.00053381996,0.000058963993,5.5330054e-7],"category_scores_gemma":[0.00037365104,0.0001312765,0.00003368686,0.00026274292,0.0000690729,0.00079686486,0.0000784806,0.00008048337,0.0000020088628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014018496,0.0007984927,0.3178603,0.0008189617,0.0004581899,0.000004845357,0.001999317,0.0035822564,0.014558953,0.6196189,0.0027207714,0.03617719],"study_design_scores_gemma":[0.0054446473,0.00010554365,0.11160937,0.0001909545,0.000026190773,0.0000018509194,0.000089893874,0.8666961,0.0011950821,0.0024565042,0.01193832,0.00024550818],"about_ca_topic_score_codex":0.00018567145,"about_ca_topic_score_gemma":0.00065516087,"teacher_disagreement_score":0.91604376,"about_ca_system_score_codex":0.00006694997,"about_ca_system_score_gemma":0.000047736266,"threshold_uncertainty_score":0.53533},"labels":[],"label_agreement":null},{"id":"W4407420600","doi":"10.1142/s2737480725500153","title":"Group Formation Tracking Control for Air–Ground Multi-Agent Systems","year":2025,"lang":"en","type":"article","venue":"Guidance Navigation and Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"National Science Fund for Distinguished Young Scholars; National Natural Science Foundation of China","keywords":"Tracking (education); Group (periodic table); Control (management); Computer science; Artificial intelligence; Psychology; Physics","score_opus":0.018038379983572782,"score_gpt":0.2689683004300904,"score_spread":0.25092992044651763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407420600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060703624,0.002539237,0.98537666,0.0014243677,0.001455928,0.0026049698,0.000111663656,0.00031080891,0.0001060205],"genre_scores_gemma":[0.9954262,0.0000109314615,0.001936589,0.0010262912,0.00013639999,0.0011001016,0.000058376565,0.000013865361,0.00029125434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975542,0.0002363275,0.00085147243,0.00056123396,0.00032303963,0.00047375957],"domain_scores_gemma":[0.99815357,0.00035455992,0.00041987095,0.000504844,0.000440823,0.00012631308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011375896,0.00029002206,0.00048288223,0.00015190891,0.00040557983,0.0005958884,0.0005478273,0.00015849585,9.0171034e-7],"category_scores_gemma":[0.00015921092,0.0002806744,0.00015162071,0.00032874374,0.000046797653,0.001283545,0.00004070706,0.00013987155,0.000015353022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005836767,0.0006295061,0.0075704535,0.0017235565,0.000777977,0.000025465131,0.0014920809,0.011794777,0.077209875,0.70590377,0.004197468,0.1880914],"study_design_scores_gemma":[0.013862596,0.00008508075,0.0081157675,0.00036152566,0.00007471981,0.000013755625,0.00017873316,0.9605262,0.00024129527,0.0005970108,0.015629102,0.00031416488],"about_ca_topic_score_codex":0.00007864174,"about_ca_topic_score_gemma":0.000011110722,"teacher_disagreement_score":0.9893558,"about_ca_system_score_codex":0.0002079156,"about_ca_system_score_gemma":0.00006346104,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W4407898938","doi":"10.1002/asjc.3604","title":"Robust optimal distance‐based formation control of uncertain nonlinear agents over directed topologies","year":2025,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network topology; Control theory (sociology); Nonlinear system; Control (management); Computer science; Topology (electrical circuits); Mathematical optimization; Mathematics; Artificial intelligence; Computer network; Physics; Combinatorics","score_opus":0.019062169817274693,"score_gpt":0.2655799299723578,"score_spread":0.24651776015508312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407898938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044872602,0.0005073466,0.98861057,0.004209324,0.000858683,0.0004442619,0.00008350929,0.000074429394,0.0007245945],"genre_scores_gemma":[0.9898582,0.0000054410884,0.009528271,0.00041035417,0.000098152304,0.000013645693,0.0000061084716,0.000009169581,0.0000706615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99717736,0.0003852565,0.0012536659,0.00022310714,0.00056771934,0.00039289685],"domain_scores_gemma":[0.9971056,0.00032199002,0.0012530573,0.0004823191,0.00070687186,0.00013019188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008368629,0.0002475815,0.0007736292,0.00035154435,0.000099775905,0.00015660083,0.0011767745,0.00012090866,0.000020147158],"category_scores_gemma":[0.00049981894,0.00020596593,0.0003493842,0.00049813226,0.00009315848,0.0008712446,0.000039205315,0.0002579069,0.0000043266828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007476302,0.00284233,0.048434652,0.00092573697,0.0051164697,0.0010571408,0.0025767623,0.6685481,0.019478325,0.060767476,0.02484847,0.15792824],"study_design_scores_gemma":[0.01478237,0.00030906743,0.010843451,0.00030795735,0.00014539779,0.000021137917,0.00017540992,0.96829754,0.00084249774,0.00021842982,0.0038440505,0.0002127018],"about_ca_topic_score_codex":0.0000126187315,"about_ca_topic_score_gemma":0.0000089506775,"teacher_disagreement_score":0.98537093,"about_ca_system_score_codex":0.00018350843,"about_ca_system_score_gemma":0.0003324641,"threshold_uncertainty_score":0.83990467},"labels":[],"label_agreement":null},{"id":"W4407936979","doi":"10.1109/tase.2025.3545462","title":"Distributed Estimation and Motion Control in Multi-Agent Systems Under Multiple Attacks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Cave Science and Technology Research Fund; Basic and Applied Basic Research Foundation of Guangdong Province; Department of Education of Guangdong Province; National Natural Science Foundation of China","keywords":"Multi-agent system; Computer science; Motion control; Estimation; Control (management); Control system; Distributed computing; Control engineering; Control theory (sociology); Engineering; Robot; Artificial intelligence; Systems engineering","score_opus":0.015728056920926683,"score_gpt":0.2505167710819153,"score_spread":0.2347887141609886,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407936979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043589186,0.000059280992,0.95444536,0.0003271442,0.000783466,0.00046950334,0.000021666627,0.00029562064,0.000008766041],"genre_scores_gemma":[0.9966476,0.000008701614,0.0031549118,0.000051968527,0.0000046292653,0.00010764531,0.0000027684691,0.0000052302544,0.000016534243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985547,0.00004056445,0.00035863285,0.0004182332,0.0003477129,0.00028017545],"domain_scores_gemma":[0.99928105,0.00015242514,0.00006779796,0.00026526029,0.00013520678,0.00009827347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007394791,0.00016201875,0.00019020005,0.00062813907,0.00023097129,0.00043680772,0.00024675505,0.000072528324,5.503051e-7],"category_scores_gemma":[0.00006324632,0.00016459562,0.000025073545,0.0012313215,0.00006334999,0.0011616184,0.0000048258157,0.0001338439,0.0000057129305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028033478,0.00005052106,0.00012764198,0.000047387897,0.000010443202,0.0000012096226,0.000126036,0.97726697,0.008879099,0.0012442525,0.0000057656353,0.012237891],"study_design_scores_gemma":[0.001278126,0.000015764661,0.0228361,0.000119937096,0.000008608713,0.0000064677956,0.00006213811,0.97440517,0.0010829269,0.000010841638,0.000037079808,0.00013684861],"about_ca_topic_score_codex":0.00007224761,"about_ca_topic_score_gemma":0.000013889957,"teacher_disagreement_score":0.9530584,"about_ca_system_score_codex":0.00030486315,"about_ca_system_score_gemma":0.00007175649,"threshold_uncertainty_score":0.67120147},"labels":[],"label_agreement":null},{"id":"W4407951034","doi":"10.1109/cdc56724.2024.10886299","title":"Formation Control of Multi-agent Systems via Voronoi Tessellation and Kullback-Leibler Divergence","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Voronoi diagram; Divergence (linguistics); Kullback–Leibler divergence; Centroidal Voronoi tessellation; Computer science; Tessellation (computer graphics); Artificial intelligence; Mathematics; Computer graphics (images); Geometry","score_opus":0.017765869157408066,"score_gpt":0.23578752345145745,"score_spread":0.21802165429404938,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407951034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005799527,0.002903673,0.9883316,0.00022751615,0.0013187331,0.0006920499,0.000029463308,0.00029415524,0.0004032923],"genre_scores_gemma":[0.9975766,0.00004363274,0.0018212772,0.000027290855,0.0000556351,0.00004776887,0.000011653267,0.000009977386,0.00040617448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982882,0.000121930105,0.00057352806,0.00039000824,0.00036901876,0.0002572852],"domain_scores_gemma":[0.9990076,0.00015112308,0.00015639699,0.00040142916,0.00017790186,0.000105569634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053317036,0.0001832188,0.00026975188,0.00016369284,0.00007729164,0.00032301267,0.00038273388,0.00008546738,0.000015955527],"category_scores_gemma":[0.000030401961,0.00015213192,0.00007061218,0.00035482724,0.000033275966,0.0012387781,0.00010372067,0.00008156068,0.00013763724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009101102,0.0006873719,0.018430952,0.0054479875,0.0011045245,0.0001082295,0.006983938,0.07307939,0.26897135,0.43837473,0.0101997275,0.1765208],"study_design_scores_gemma":[0.0006730609,0.000044242188,0.0020947,0.000116025665,0.000024625793,0.000020438256,0.00005428574,0.9926497,0.001267927,0.000059948085,0.0028260406,0.00016902905],"about_ca_topic_score_codex":0.00023632622,"about_ca_topic_score_gemma":0.000012934947,"teacher_disagreement_score":0.99177706,"about_ca_system_score_codex":0.000084913154,"about_ca_system_score_gemma":0.00003680188,"threshold_uncertainty_score":0.62037593},"labels":[],"label_agreement":null},{"id":"W4407987951","doi":"10.1109/cdc56724.2024.10885931","title":"Passivity-based Gradient-Play Dynamics for Distributed GNE Seeking via Parallel Feedforward Compensation","year":2024,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Feed forward; Compensation (psychology); Computer science; Passivity; Dynamics (music); Control theory (sociology); Feedforward neural network; Control engineering; Control (management); Artificial neural network; Artificial intelligence; Engineering; Physics; Psychology","score_opus":0.01501601497364949,"score_gpt":0.24824286751060223,"score_spread":0.23322685253695274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407987951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014142772,0.000077130564,0.9899675,0.0039012085,0.0017003691,0.0010170065,0.00043308287,0.0012113893,0.00027798463],"genre_scores_gemma":[0.97173226,9.333474e-7,0.026009336,0.00020450004,0.00012301817,0.00023471433,0.0014109858,0.000029927152,0.00025433855],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99746156,0.00010988284,0.000551401,0.0007838094,0.00045951566,0.0006338623],"domain_scores_gemma":[0.99827594,0.00049565703,0.0001449673,0.000694081,0.00019628569,0.00019305488],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000598166,0.00032582093,0.00037404048,0.0001973697,0.00024277155,0.0008679323,0.00087174535,0.0001401936,0.000014660048],"category_scores_gemma":[0.00007251501,0.00029375064,0.00027361588,0.00069392344,0.000045319233,0.00063831505,0.00011807345,0.00017536938,0.000117720585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009553195,0.00046406672,0.0028586313,0.0007368587,0.0005087917,0.00012677684,0.00043519374,0.041401096,0.0040046587,0.870945,0.013377442,0.065046005],"study_design_scores_gemma":[0.0011122513,0.00009383065,0.0011492873,0.000083854684,0.000038052196,0.000012330124,0.000025043597,0.98533255,0.00018529294,0.0021594092,0.009443418,0.00036468144],"about_ca_topic_score_codex":0.000086419415,"about_ca_topic_score_gemma":0.00020216945,"teacher_disagreement_score":0.97031796,"about_ca_system_score_codex":0.0005172384,"about_ca_system_score_gemma":0.00014006735,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W4408071711","doi":"10.1016/j.automatica.2025.112221","title":"Emergent homeomorphic curves in swarms","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.004622300079402257,"score_gpt":0.24558523053105288,"score_spread":0.24096293045165063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408071711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040109664,0.004502948,0.89175737,0.03494479,0.0030326839,0.0016398935,0.000030429277,0.0015377678,0.022444485],"genre_scores_gemma":[0.9957239,0.000056155368,0.0023146102,0.00098371,0.000014861529,0.000108322085,0.000009315138,0.000005664649,0.000783429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855256,0.0001164841,0.00043657827,0.00031411633,0.00026069055,0.0003195607],"domain_scores_gemma":[0.99898,0.000115662006,0.000078736884,0.0007163665,0.0000462146,0.00006302298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004110563,0.0001361735,0.00026287686,0.0001868733,0.000046636193,0.00008168192,0.00097565836,0.000050321007,0.00005563703],"category_scores_gemma":[0.00016344797,0.00012559039,0.00006525148,0.00089666725,0.000025508949,0.00023134322,0.00020851046,0.000103803264,0.00023989339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013315109,0.0013253234,0.029145617,0.0022752187,0.00037726376,0.0003064758,0.0015759455,0.00070051476,0.0027339833,0.59806275,0.2757001,0.0877835],"study_design_scores_gemma":[0.0019103539,0.000056294197,0.12137259,0.0017957967,0.000029857936,0.000010817669,0.000061385086,0.8381348,0.0008832206,0.00951287,0.0257083,0.00052367506],"about_ca_topic_score_codex":0.00007663638,"about_ca_topic_score_gemma":0.000028744018,"teacher_disagreement_score":0.95561427,"about_ca_system_score_codex":0.00007327346,"about_ca_system_score_gemma":0.000098398516,"threshold_uncertainty_score":0.5121428},"labels":[],"label_agreement":null},{"id":"W4408079557","doi":"10.1007/978-981-96-2208-5_21","title":"Adaptive Fault-Tolerant Control for Multi-UAVs with Time-Varying Communication Delay","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Fault tolerance; Control (management); Control theory (sociology); Real-time computing; Distributed computing; Artificial intelligence","score_opus":0.01106152181914347,"score_gpt":0.2183559213027372,"score_spread":0.20729439948359374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408079557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000031537536,0.0035236513,0.99243253,0.00027300307,0.00015336,0.0016812672,0.00005682617,0.0004042207,0.0014719974],"genre_scores_gemma":[0.6593092,0.00009333476,0.33326992,0.0006936928,0.00030736878,0.0008671322,0.0002510626,0.00025477522,0.0049534813],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973681,0.000053396678,0.00065961626,0.000814713,0.00039080065,0.00071338564],"domain_scores_gemma":[0.9965328,0.0018314271,0.00026421848,0.0009931799,0.00025049516,0.00012787517],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003170223,0.00068538595,0.0009791107,0.00051815517,0.000115356735,0.0001568105,0.0013526211,0.00061039,0.00000493742],"category_scores_gemma":[0.00037750418,0.00062880124,0.00022822393,0.00035720356,0.000030685387,0.0001940117,0.00012292014,0.0011921778,0.000014253791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023182416,0.000093854025,0.000008153901,0.00016031152,0.00061078137,0.00007192397,0.00019981473,0.8661529,0.0008161488,0.057459768,0.00009058683,0.07410396],"study_design_scores_gemma":[0.0026266817,0.00018230481,0.000007606833,0.00065870053,0.00008334042,0.00002230855,1.6679216e-7,0.9912933,0.00020315174,0.00065264624,0.0036145006,0.0006552841],"about_ca_topic_score_codex":0.000033606957,"about_ca_topic_score_gemma":0.000024084164,"teacher_disagreement_score":0.65930605,"about_ca_system_score_codex":0.00060319895,"about_ca_system_score_gemma":0.00019613306,"threshold_uncertainty_score":0.9996163},"labels":[],"label_agreement":null},{"id":"W4408116359","doi":"10.1007/978-981-96-2244-3_36","title":"Null-Space-Based Connectivity Preservation Control for Spacecraft Formation Flying","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Spacecraft; Null (SQL); Aerospace engineering; Astrobiology; Computer science; Space (punctuation); Aeronautics; Engineering; Physics; Data mining; Operating system","score_opus":0.010137545407244599,"score_gpt":0.21373301053470004,"score_spread":0.20359546512745544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408116359","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013192814,0.0008708135,0.9936416,0.0014813006,0.0005152512,0.0019380352,0.00004700346,0.0004665478,0.0010262289],"genre_scores_gemma":[0.9715891,0.000016276681,0.025338707,0.00046264596,0.0004024012,0.0005808143,0.00017512332,0.00009791028,0.0013370153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975414,0.000044463934,0.00060952234,0.0007017658,0.00043597282,0.0006668551],"domain_scores_gemma":[0.9961212,0.0026284428,0.0002809448,0.00063490873,0.00022881056,0.000105683896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047146785,0.00056401326,0.0007741269,0.00069574587,0.000108811364,0.00020937793,0.00071903935,0.00067475764,0.000004267568],"category_scores_gemma":[0.0019115016,0.0005965,0.00028073599,0.0003915534,0.000012507555,0.0004633286,0.000062573505,0.0008101661,0.0000056753915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011090436,0.000055340694,0.00003545638,0.000680884,0.00016564339,0.000019932788,0.000084598636,0.740094,0.0038694963,0.19102149,0.00028713694,0.06357511],"study_design_scores_gemma":[0.0019088339,0.00010909059,0.000033616354,0.00038508966,0.000046935704,0.0000037447194,1.0151389e-7,0.9796728,0.0014087135,0.0048326766,0.011074046,0.00052433816],"about_ca_topic_score_codex":0.000027011909,"about_ca_topic_score_gemma":0.000039853407,"teacher_disagreement_score":0.9715759,"about_ca_system_score_codex":0.0008744099,"about_ca_system_score_gemma":0.0002068436,"threshold_uncertainty_score":0.99964863},"labels":[],"label_agreement":null},{"id":"W4408147886","doi":"10.1016/j.chaos.2025.116206","title":"Hybrid impulsive cooperative control of vehicle platoons with switching communication topology","year":2025,"lang":"en","type":"article","venue":"Chaos Solitons & Fractals","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Topology (electrical circuits); Control (management); Control theory (sociology); Computer science; Engineering; Electrical engineering; Artificial intelligence","score_opus":0.0068410060522596456,"score_gpt":0.2507895697555111,"score_spread":0.24394856370325144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408147886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22308894,0.0012131531,0.7675821,0.0035867796,0.0002973945,0.00086475123,0.00009376033,0.00016748242,0.0031056493],"genre_scores_gemma":[0.9976966,0.000013500366,0.0012619104,0.0006877212,0.000031809563,0.0001289061,0.000024717052,0.000012254205,0.00014258953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980254,0.0003331942,0.00055311737,0.00043375744,0.0002337913,0.0004207085],"domain_scores_gemma":[0.9970916,0.0007050838,0.0003820467,0.0013001128,0.0004192752,0.00010187575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040089374,0.00024222287,0.00057060114,0.00018012301,0.00028122426,0.0001206844,0.0012705617,0.00009553058,0.000012639612],"category_scores_gemma":[0.00019432679,0.0002107267,0.00009898344,0.0003741264,0.00016298678,0.0005366915,0.0002512859,0.00029840777,0.00002746412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005380578,0.0014938492,0.017876301,0.00023694192,0.0023225816,0.00014194318,0.008245695,0.0042314497,0.14580472,0.77062315,0.005170073,0.04331523],"study_design_scores_gemma":[0.022273233,0.0013042276,0.02849079,0.001510376,0.0004440281,0.00021010255,0.0036898733,0.66399497,0.24400826,0.014388221,0.017596377,0.0020895402],"about_ca_topic_score_codex":0.0003327194,"about_ca_topic_score_gemma":0.00005408886,"teacher_disagreement_score":0.77460766,"about_ca_system_score_codex":0.0001195884,"about_ca_system_score_gemma":0.00029191974,"threshold_uncertainty_score":0.85931855},"labels":[],"label_agreement":null},{"id":"W4408569729","doi":"10.1016/j.jai.2025.03.002","title":"Fault-tolerant control for swarm systems: A geometric-based PDE planning approach","year":2025,"lang":"en","type":"article","venue":"Journal of Automation and Intelligence","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Swarm behaviour; Computer science; Control (management); Fault tolerance; Distributed computing; Control theory (sociology); Artificial intelligence","score_opus":0.0242219072127163,"score_gpt":0.29109770494001624,"score_spread":0.26687579772729997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408569729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002595153,0.0018938013,0.9933447,0.00042430742,0.00083623047,0.0004744813,0.000009670107,0.00006522781,0.0003564324],"genre_scores_gemma":[0.98604316,0.000010766598,0.013505997,0.000256328,0.00006551064,0.000030680225,0.000002281359,0.000005139405,0.00008014688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998249,0.00011339145,0.00087135023,0.00020552038,0.00034221733,0.0002185424],"domain_scores_gemma":[0.9979561,0.00050374924,0.00066264585,0.00021772717,0.0005599962,0.000099770055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012564495,0.00014750952,0.00038971033,0.0006314853,0.00012512314,0.00040687158,0.000591801,0.00008240165,0.000001190879],"category_scores_gemma":[0.00042298375,0.000119836244,0.00012416068,0.000653045,0.000028190874,0.0004856118,0.000027119911,0.00014252495,0.0000028258753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002795824,0.0005310839,0.0016086518,0.0011764861,0.0005128823,0.0000324718,0.0012770633,0.74998933,0.0013661692,0.14548062,0.0060768644,0.09166882],"study_design_scores_gemma":[0.00093208975,0.00015329415,0.00078088907,0.00030863893,0.00003129411,0.000037229416,0.00021041317,0.9932028,0.0008437541,0.00024088715,0.0031448363,0.000113858776],"about_ca_topic_score_codex":0.000009418009,"about_ca_topic_score_gemma":1.5773485e-7,"teacher_disagreement_score":0.98344797,"about_ca_system_score_codex":0.00010146846,"about_ca_system_score_gemma":0.00017872511,"threshold_uncertainty_score":0.48867804},"labels":[],"label_agreement":null},{"id":"W4408608992","doi":"10.1109/tcsi.2025.3550509","title":"Bipartite Event-Triggered Output Tracking Consensus of Heterogeneous Linear Multi-Agent Systems Under Switching Directed Topologies","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Circuits and Systems I Regular Papers","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Aeronautical Science Foundation of China; National Natural Science Foundation of China","keywords":"Network topology; Topology (electrical circuits); Bipartite graph; Control theory (sociology); Computer science; Multi-agent system; Consensus; Engineering; Computer network; Control (management); Theoretical computer science; Electrical engineering; Artificial intelligence","score_opus":0.03565864807346039,"score_gpt":0.26904583459824133,"score_spread":0.23338718652478094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408608992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06359186,0.0034065752,0.92605466,0.00023113513,0.004540089,0.0013134199,0.000098835335,0.0005534174,0.00021002557],"genre_scores_gemma":[0.9983014,0.000093443734,0.00016169716,0.00006415518,0.000042918287,0.00013866388,0.0000040285377,0.00003053941,0.0011631448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961439,0.0006555035,0.0011979529,0.00086907594,0.0005421354,0.00059146516],"domain_scores_gemma":[0.99765027,0.0004153489,0.00043266494,0.0009902494,0.0002767053,0.00023477303],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073489547,0.0004626956,0.00090305903,0.0004702341,0.00045166962,0.00033692527,0.00060335535,0.00029450472,0.0000023407163],"category_scores_gemma":[0.000050048588,0.0004209907,0.00030125832,0.00064827054,0.00012481121,0.00017682194,0.000010330594,0.0002907754,0.00000920986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006474167,0.00070737506,0.0002712248,0.0013375861,0.0020860313,0.00013320938,0.0015851117,0.794205,0.15230373,0.004499989,0.00016689868,0.042639095],"study_design_scores_gemma":[0.0046520475,0.00028183326,0.0007257385,0.0020368807,0.00032373006,0.00023646362,0.002522754,0.9665826,0.0189773,0.0000332545,0.0025657844,0.0010616089],"about_ca_topic_score_codex":0.000576261,"about_ca_topic_score_gemma":0.00007158046,"teacher_disagreement_score":0.93470955,"about_ca_system_score_codex":0.0002214018,"about_ca_system_score_gemma":0.00019219698,"threshold_uncertainty_score":0.99982417},"labels":[],"label_agreement":null},{"id":"W4408913753","doi":"10.1016/b978-0-443-14081-5.00130-6","title":"Distributed Optimization With Compressed Communication","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science","score_opus":0.010798439566433171,"score_gpt":0.21709005796405953,"score_spread":0.20629161839762636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408913753","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0257093e-7,0.0005604864,0.3636278,0.0002447396,0.0001776895,0.00081866444,0.00017657208,0.00032976607,0.6340641],"genre_scores_gemma":[0.0021803488,0.00006399664,0.022415597,0.00027965708,0.00007022388,0.00015601868,0.0013603945,0.000058749745,0.973415],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99760103,0.00011970215,0.00065603957,0.00072258397,0.00055313454,0.00034748722],"domain_scores_gemma":[0.9959792,0.0001754732,0.0006265451,0.002610339,0.00046985003,0.00013862176],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027069912,0.00054558634,0.0006932372,0.00020741939,0.00025128035,0.00039246204,0.002235362,0.00035305915,0.000031300995],"category_scores_gemma":[0.000024049627,0.0005000159,0.00016682279,0.0000694726,0.00012783716,0.00020928682,0.00052856054,0.0004913753,0.00006148511],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039763494,0.000041083655,0.000007682067,0.0001821202,0.00047657124,0.000036884398,0.00014704654,0.0079134265,0.000008457851,0.17790063,0.0022654817,0.81098086],"study_design_scores_gemma":[0.0011830812,0.00006134957,0.000012182491,0.0013402657,0.00014772467,0.000014268787,0.000004042634,0.09396054,0.000022446298,0.001747653,0.9008175,0.0006889387],"about_ca_topic_score_codex":0.000002448267,"about_ca_topic_score_gemma":0.000017995872,"teacher_disagreement_score":0.898552,"about_ca_system_score_codex":0.00023274249,"about_ca_system_score_gemma":0.0002690152,"threshold_uncertainty_score":0.99974513},"labels":[],"label_agreement":null},{"id":"W4408923616","doi":"10.1007/978-981-96-2200-9_21","title":"A Consensus Sliding Mode Formation Control of Multiple Fixed-Wing UAVs for Autonomous Aerial Refueling","year":2025,"lang":"en","type":"book-chapter","venue":"Lecture notes in electrical engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Fixed wing; Wing; Mode (computer interface); Control (management); Computer science; Control theory (sociology); Sliding mode control; Aerospace engineering; Engineering; Artificial intelligence; Physics; Human–computer interaction; Nonlinear system","score_opus":0.009745338503690972,"score_gpt":0.2195641439924508,"score_spread":0.20981880548875984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408923616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009368389,0.0012389066,0.99542344,0.00015921704,0.00084939896,0.0013144902,0.00011449291,0.00031538596,0.00049101445],"genre_scores_gemma":[0.97063816,0.000015039741,0.028420312,0.00007602975,0.00029907998,0.00013303992,0.00006530812,0.00006473242,0.00028828016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99715286,0.000035273486,0.0011215805,0.00063703547,0.00035621543,0.00069703127],"domain_scores_gemma":[0.99597704,0.0027685205,0.0004098042,0.0005348765,0.00020957513,0.00010019832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038838823,0.00055133866,0.001053358,0.00070608343,0.000077559926,0.00010835656,0.00072374305,0.00065110467,0.000005859688],"category_scores_gemma":[0.0021638416,0.00058930716,0.00034373783,0.00028044308,0.000014464195,0.0001538719,0.00009487967,0.00071971875,0.000001555444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001347254,0.000030615414,0.00000875541,0.00064145384,0.00020543502,0.000024887991,0.00017795071,0.8717313,0.024726864,0.063450135,0.000034213062,0.038833655],"study_design_scores_gemma":[0.0022484965,0.00009351733,0.0000024211956,0.00051435473,0.000056059915,0.000016067492,3.994531e-7,0.98651963,0.005504834,0.0018023588,0.0027516768,0.00049020356],"about_ca_topic_score_codex":0.000035952125,"about_ca_topic_score_gemma":0.000018743474,"teacher_disagreement_score":0.9705445,"about_ca_system_score_codex":0.00066098635,"about_ca_system_score_gemma":0.00020436119,"threshold_uncertainty_score":0.99965584},"labels":[],"label_agreement":null},{"id":"W4409191337","doi":"10.1007/s11071-025-11100-8","title":"Secure containment control of time-delay complex-valued multi-agent systems against different attacks","year":2025,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Containment (computer programming); Computer science; Computer security; Control (management); Control theory (sociology); Distributed computing; Artificial intelligence","score_opus":0.012359011389631773,"score_gpt":0.25688111577444944,"score_spread":0.24452210438481767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409191337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033622675,0.00039566675,0.9602078,0.00051429,0.0015354323,0.0017764992,0.0008871511,0.00032417302,0.0007363074],"genre_scores_gemma":[0.99104834,0.000022339287,0.006533423,0.0003795744,0.00009585655,0.00010991527,0.00043523498,0.00003770058,0.0013376221],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99604446,0.0004302275,0.0012702325,0.00080482004,0.0007560308,0.0006942162],"domain_scores_gemma":[0.9970292,0.0002507446,0.0005778641,0.0014571797,0.0004586999,0.00022634258],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005937806,0.0005337877,0.0010996416,0.000258373,0.0001721431,0.00023407383,0.0017202107,0.00026429186,0.000009769773],"category_scores_gemma":[0.000098051954,0.00047919995,0.00033731948,0.00046782425,0.00011506004,0.00019092578,0.00039376316,0.0003420084,0.000088111396],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011041722,0.014525244,0.09837662,0.004219705,0.009701196,0.00071533356,0.002813564,0.42246264,0.04861554,0.3375766,0.010570145,0.049319245],"study_design_scores_gemma":[0.0051708603,0.00010840805,0.0022057714,0.00022800743,0.00008171341,0.000006555202,0.00010615749,0.9890594,0.000084144995,0.00002047898,0.0025421062,0.00038641554],"about_ca_topic_score_codex":0.000113266135,"about_ca_topic_score_gemma":0.00009083114,"teacher_disagreement_score":0.95742565,"about_ca_system_score_codex":0.0007895784,"about_ca_system_score_gemma":0.0001951228,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W4409289916","doi":"10.1016/j.automatica.2025.112286","title":"Compressed gradient tracking algorithms for distributed nonconvex optimization","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Key Research and Development Program of China; Australian Research Council; Science and Technology Commission of Shanghai Municipality; Knut och Alice Wallenbergs Stiftelse; National University's Basic Research Foundation of China; National Natural Science Foundation of China; Vetenskapsrådet; Japan Society for the Promotion of Science; Stiftelsen för Strategisk Forskning","keywords":"Algorithm; Tracking (education); Compressed sensing; Computer science; Mathematical optimization; Optimization algorithm; Mathematics","score_opus":0.021443967923992367,"score_gpt":0.2817025295125486,"score_spread":0.2602585615885562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409289916","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030830133,0.00008288317,0.99417734,0.0019734795,0.0009323352,0.001003269,0.0000957943,0.0007629064,0.0006636794],"genre_scores_gemma":[0.7922466,0.000002964002,0.20656416,0.00031300785,0.00005755157,0.00036414174,0.00023274666,0.000015715352,0.00020315737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982824,0.00008795896,0.0005281031,0.00044229807,0.00024952187,0.00040974157],"domain_scores_gemma":[0.9984225,0.0003862778,0.00018311683,0.0006809993,0.00023318337,0.00009391327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033858482,0.00020163393,0.00033659642,0.00013452725,0.00021853046,0.00037564058,0.00093536044,0.00009398302,0.000009242306],"category_scores_gemma":[0.0002183016,0.0001955959,0.0001304897,0.0005797891,0.000037785798,0.00039603835,0.00013281382,0.00008217507,0.000020636577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005874586,0.0013755636,0.00071953837,0.0010474634,0.0009725291,0.000044702352,0.0016508036,0.37023434,0.0026067705,0.41449165,0.04566138,0.16113651],"study_design_scores_gemma":[0.0014369057,0.000037769765,0.0013346681,0.00010927745,0.000033809825,0.000002810035,0.000028348008,0.9906871,0.00073358935,0.0011692564,0.004238369,0.00018811923],"about_ca_topic_score_codex":0.000015502621,"about_ca_topic_score_gemma":0.0000019176784,"teacher_disagreement_score":0.79193825,"about_ca_system_score_codex":0.00013397943,"about_ca_system_score_gemma":0.00009822684,"threshold_uncertainty_score":0.79761696},"labels":[],"label_agreement":null},{"id":"W4410204015","doi":"10.1109/jiot.2025.3567996","title":"Formation Control of Autonomous Underwater Vehicles With Unknown Absolute Position Using Rigid Graph-Based MPC","year":2025,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Shanghai Baoshan Science and Technology Commission; National Natural Science Foundation of China","keywords":"Position (finance); Underwater; Computer science; Remotely operated underwater vehicle; Control theory (sociology); Vehicle dynamics; Model predictive control; Graph; Unmanned underwater vehicle; Control (management); Mobile robot; Artificial intelligence; Engineering; Aerospace engineering; Robot; Theoretical computer science","score_opus":0.011796709282473866,"score_gpt":0.2371107814241822,"score_spread":0.22531407214170834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410204015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20820993,0.00007806956,0.7903256,0.00051030103,0.0005077909,0.00016592826,0.000005140204,0.000039572427,0.00015769673],"genre_scores_gemma":[0.9893637,0.0000016193172,0.010234224,0.00029426155,0.00003370721,0.000003655096,0.0000024973158,0.000008611487,0.00005773366],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821335,0.00014805433,0.0007760132,0.00019267754,0.00040516173,0.00026472975],"domain_scores_gemma":[0.99822396,0.00008727257,0.0008987635,0.00026683172,0.0004503548,0.00007283034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062118843,0.00017900474,0.00036035,0.00041852327,0.00007950279,0.0002450466,0.0007636925,0.00008568182,0.0000047204044],"category_scores_gemma":[0.000017742326,0.00014237466,0.00017342801,0.000249928,0.000077683915,0.0013188332,0.00003686644,0.0002466272,0.0000026868388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017038997,0.0010032159,0.0033037262,0.000881212,0.0020570038,0.0002084536,0.0053712516,0.16993223,0.7703742,0.02398045,0.0026036513,0.0185807],"study_design_scores_gemma":[0.0030314666,0.0002536715,0.00041107388,0.0010426901,0.00008653748,0.0001777531,0.000030304898,0.86728406,0.1259645,0.0014016966,0.00015876757,0.00015745188],"about_ca_topic_score_codex":0.00019806482,"about_ca_topic_score_gemma":0.0000090839485,"teacher_disagreement_score":0.78115374,"about_ca_system_score_codex":0.00021650262,"about_ca_system_score_gemma":0.00017298896,"threshold_uncertainty_score":0.580587},"labels":[],"label_agreement":null},{"id":"W4410321928","doi":"10.1002/asjc.3701","title":"Fixed‐time bipartite consensus control for nonlinear multiagent systems","year":2025,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Bipartite graph; Multi-agent system; Nonlinear system; Computer science; Consensus; Control (management); Distributed computing; Control theory (sociology); Theoretical computer science; Artificial intelligence; Physics","score_opus":0.00812554648518527,"score_gpt":0.24544548315995793,"score_spread":0.23731993667477266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410321928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012229278,0.0021945867,0.97901154,0.011406398,0.003388689,0.0016558032,0.00024056013,0.00010027205,0.0007792365],"genre_scores_gemma":[0.99272543,0.0000046734426,0.0049705557,0.0007380187,0.00053939834,0.00007991963,0.0000045391566,0.000023617516,0.00091387134],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99615127,0.0004886848,0.0016991132,0.00040431853,0.00056669215,0.0006899254],"domain_scores_gemma":[0.9955076,0.0009198211,0.0012490295,0.00073371286,0.001244415,0.0003454093],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019171368,0.00036802745,0.0011703373,0.00042644615,0.00019230046,0.00046264913,0.0015033808,0.00017423871,0.000009208396],"category_scores_gemma":[0.0008124839,0.00031335847,0.0005994043,0.0003939691,0.00008423461,0.00034111695,0.00004942396,0.0003098925,0.0000780596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009744417,0.0043521905,0.012801717,0.0017384558,0.023623269,0.0032570628,0.002961147,0.11483506,0.10891727,0.19540747,0.31572518,0.20663676],"study_design_scores_gemma":[0.028468091,0.0005571779,0.0007672404,0.00043982163,0.00037386085,0.00024015487,0.00013913203,0.86457187,0.0003347826,0.00030143678,0.103393346,0.00041309986],"about_ca_topic_score_codex":0.000009567506,"about_ca_topic_score_gemma":0.0000026192358,"teacher_disagreement_score":0.99150246,"about_ca_system_score_codex":0.00017501343,"about_ca_system_score_gemma":0.0005332208,"threshold_uncertainty_score":0.9999319},"labels":[],"label_agreement":null},{"id":"W4410884354","doi":"10.1007/s10957-025-02719-z","title":"A Consensus-based Algorithm for Non-convex Multiplayer Games","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz","keywords":"Theory of computation; Mathematics; Regular polygon; Algorithm; Mathematical optimization; Geometry","score_opus":0.007126461853934904,"score_gpt":0.26190901638560365,"score_spread":0.25478255453166876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410884354","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000041929412,0.00026498103,0.9976777,0.0010463713,0.0001285475,0.0005390335,0.000022162565,0.00002664407,0.0002526518],"genre_scores_gemma":[0.14664826,0.00003688235,0.8515101,0.0008236355,0.00012916728,0.00027748043,0.000014938186,0.000010714527,0.0005488433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999137,0.00008872229,0.0004086388,0.00015419332,0.000098566656,0.00011291566],"domain_scores_gemma":[0.9982151,0.0007019194,0.00034667042,0.00022249956,0.00044714834,0.00006670604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076793344,0.000094691895,0.0001918929,0.0001688077,0.00016421881,0.00012005212,0.00032455602,0.000056203793,0.000005028163],"category_scores_gemma":[0.00008736457,0.00008342004,0.00008321883,0.00028708056,0.00005154012,0.00014054892,0.00002646824,0.000074384305,0.0000014686145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001067819,0.0003667471,0.000110557936,0.00007616407,0.00022430492,0.0000027977362,0.00017397625,0.22830753,0.0006593084,0.36143178,0.00224788,0.4062922],"study_design_scores_gemma":[0.0016027251,0.00003687026,0.000053561907,0.00004207479,0.000041295363,0.000010909206,0.00007005426,0.9829765,0.0007850402,0.0055825463,0.008712728,0.00008571134],"about_ca_topic_score_codex":4.3913255e-7,"about_ca_topic_score_gemma":8.9320515e-8,"teacher_disagreement_score":0.75466895,"about_ca_system_score_codex":0.000026256705,"about_ca_system_score_gemma":0.00014086656,"threshold_uncertainty_score":0.34017706},"labels":[],"label_agreement":null},{"id":"W4410887634","doi":"10.1109/syscon64521.2025.11014655","title":"Scalable Swarm Control Using Deep Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Reinforcement learning; Computer science; Swarm behaviour; Scalability; Artificial intelligence; Control (management); Swarm robotics; Machine learning; Operating system","score_opus":0.013259267605373715,"score_gpt":0.2504761126271483,"score_spread":0.2372168450217746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410887634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014312186,0.00014617211,0.9646968,0.0004983158,0.00058515323,0.00034343914,2.8392486e-7,0.00035396835,0.03194463],"genre_scores_gemma":[0.98660374,0.000002148682,0.005380114,0.00067721686,0.000036939742,0.000023735194,0.0000025651368,0.00000615607,0.0072673704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983942,0.00010300753,0.00038559307,0.00038144446,0.00029038798,0.00044538826],"domain_scores_gemma":[0.9990335,0.000112858426,0.00011132279,0.00051439,0.00013714773,0.00009075303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044678798,0.00016475627,0.0002532292,0.00015022879,0.00023672944,0.00033207153,0.00075437356,0.00006772519,0.000042590596],"category_scores_gemma":[0.00010254748,0.00015112762,0.00009092264,0.0005011737,0.000022434577,0.00041957307,0.00020626055,0.00015156838,0.00013663634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017835908,0.000056801247,0.0037100909,0.00004271299,0.00017628877,0.000018358087,0.00014003654,0.8095518,0.005496947,0.1696209,0.0010815902,0.010086653],"study_design_scores_gemma":[0.001481013,0.000025559664,0.00021494701,0.000039856386,0.000016921695,0.0000031719205,0.000046086396,0.98679984,0.0013747967,0.00019035646,0.009654679,0.00015277279],"about_ca_topic_score_codex":0.00024472782,"about_ca_topic_score_gemma":0.000009686025,"teacher_disagreement_score":0.9851725,"about_ca_system_score_codex":0.00018380642,"about_ca_system_score_gemma":0.00010893118,"threshold_uncertainty_score":0.61628056},"labels":[],"label_agreement":null},{"id":"W4410956690","doi":"10.3390/s25113496","title":"Swarm Intelligence for Collaborative Play in Humanoid Soccer Teams","year":2025,"lang":"en","type":"article","venue":"Sensors","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Network packet; Swarm intelligence; Humanoid robot; Robustness (evolution); Distributed computing; Swarm behaviour; Artificial intelligence; Flocking (texture); Robot; Computer network; Simulation; Machine learning; Particle swarm optimization","score_opus":0.014529486042454742,"score_gpt":0.2857464296267059,"score_spread":0.27121694358425114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410956690","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.123306826,0.00037087986,0.8558089,0.0028158557,0.0020634194,0.0021863838,0.00009275647,0.00033581464,0.013019178],"genre_scores_gemma":[0.99240893,0.000007988842,0.0041343286,0.00030234858,0.00004522176,0.00013526273,0.000008235328,0.000008522054,0.0029491426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.00010667398,0.00038345956,0.00047669333,0.00017316146,0.00037379845],"domain_scores_gemma":[0.9988611,0.00031302808,0.000099190605,0.00047968142,0.00019200085,0.000055025565],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036960436,0.00017146327,0.0002628703,0.00020517671,0.00010337608,0.00015307547,0.00075754337,0.00009202753,0.0000045137313],"category_scores_gemma":[0.00016655476,0.00016542466,0.00007013986,0.00094214483,0.00005087994,0.00018354559,0.000119119824,0.00012241663,0.000065475615],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018582087,0.00060690753,0.0060635894,0.00023716473,0.00030796643,0.00009774649,0.013950597,0.055876005,0.0046841046,0.83481985,0.022809101,0.06036112],"study_design_scores_gemma":[0.004242951,0.0003443592,0.009015261,0.00051097,0.00004592656,0.000007883291,0.0061902497,0.7308972,0.08837485,0.026189098,0.1327107,0.0014705505],"about_ca_topic_score_codex":0.000087875305,"about_ca_topic_score_gemma":0.0001347162,"teacher_disagreement_score":0.8691021,"about_ca_system_score_codex":0.00018270209,"about_ca_system_score_gemma":0.00021000535,"threshold_uncertainty_score":0.6745821},"labels":[],"label_agreement":null},{"id":"W4411142794","doi":"10.1109/lcsys.2025.3578272","title":"Stability and Convergence Analysis of Multi-Agent Consensus With Communication Delays: A Lambert W Function Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Control Systems Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lambert W function; Convergence (economics); Mathematics; Function (biology); Stability (learning theory); Applied mathematics; Computer science; Control theory (sociology); Mathematical analysis; Artificial intelligence; Economics","score_opus":0.01797799192481092,"score_gpt":0.22522821654698255,"score_spread":0.20725022462217163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411142794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16677143,0.000960688,0.82942224,0.0008578913,0.00045021466,0.0012010108,0.000064979504,0.00013440316,0.00013717364],"genre_scores_gemma":[0.9979343,0.0000075606913,0.001240589,0.00045253595,0.000015268697,0.00027089496,0.000022733242,0.000010418002,0.00004572543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99663305,0.00096498465,0.00088875095,0.00071114925,0.00043504257,0.00036699398],"domain_scores_gemma":[0.9967833,0.00051607314,0.00058450806,0.0016130408,0.0003847909,0.000118291704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012965213,0.0003059468,0.0009269466,0.00041530444,0.00016455947,0.00018415779,0.00074224663,0.0001167376,0.0000016184268],"category_scores_gemma":[0.00006443642,0.000263937,0.00016993766,0.0014154561,0.00022305426,0.00023516893,0.00007472801,0.00018392844,0.0000033787144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013972752,0.0014813547,0.323998,0.0017416546,0.027081463,0.00004041567,0.00372627,0.35341647,0.25368246,0.027848797,0.0035705494,0.002015306],"study_design_scores_gemma":[0.0034866706,0.000054804616,0.021797383,0.00009416755,0.0010879635,0.0000072414437,0.00027764594,0.97250545,0.00015293945,0.0000037034931,0.00026711967,0.00026492294],"about_ca_topic_score_codex":0.0017248539,"about_ca_topic_score_gemma":0.00017037214,"teacher_disagreement_score":0.83116287,"about_ca_system_score_codex":0.00018656687,"about_ca_system_score_gemma":0.00008684773,"threshold_uncertainty_score":0.9999813},"labels":[],"label_agreement":null},{"id":"W4411614370","doi":"10.1007/s11071-025-11489-2","title":"Distributed consensus control of generalized one-sided Lipschitz multiagents under sector-based actuator saturation: application to UAVs","year":2025,"lang":"en","type":"article","venue":"Nonlinear Dynamics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Laurentian University","funders":"","keywords":"Actuator; Control theory (sociology); Lipschitz continuity; Saturation (graph theory); Computer science; Control (management); Mathematics; Artificial intelligence; Mathematical analysis","score_opus":0.012379674250691884,"score_gpt":0.2600011153308329,"score_spread":0.24762144108014103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411614370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09909083,0.000039780876,0.8942331,0.0033479074,0.00053951854,0.0013888918,0.0010404354,0.00025750304,0.0000620439],"genre_scores_gemma":[0.94118106,0.0000012016926,0.056675125,0.00084588677,0.000085907566,0.00013181985,0.0009610451,0.000021872058,0.00009608882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731636,0.00023138685,0.0008407339,0.0006779999,0.0005099552,0.00042357526],"domain_scores_gemma":[0.99715143,0.00042766173,0.000388984,0.0012240553,0.0006101946,0.00019769398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036595442,0.00032656596,0.00056956155,0.00024084446,0.00014063547,0.0001464313,0.0009639488,0.00022539376,0.0000068010177],"category_scores_gemma":[0.00033924097,0.00034039098,0.00018208225,0.0010185761,0.00006428275,0.000116558156,0.0001271372,0.00020319116,0.000041816664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014437276,0.0028716677,0.020814767,0.0004903985,0.0015638764,0.000024680186,0.00029901054,0.6505436,0.105374455,0.18564944,0.0015211857,0.0294032],"study_design_scores_gemma":[0.0043468564,0.000057374917,0.007969215,0.00007444464,0.00006404555,0.0000012141413,0.00002295903,0.98395663,0.0023019211,0.00021272701,0.0007078809,0.0002847134],"about_ca_topic_score_codex":0.00019311589,"about_ca_topic_score_gemma":0.00029922064,"teacher_disagreement_score":0.84209025,"about_ca_system_score_codex":0.00043647664,"about_ca_system_score_gemma":0.00042176349,"threshold_uncertainty_score":0.9999048},"labels":[],"label_agreement":null},{"id":"W4412446529","doi":"10.1109/med64031.2025.11073209","title":"Decentralized Control of Robotic Swarm Density via PDE-Constrained Optimization","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Control (management); Mathematical optimization; Swarm behaviour; Control theory (sociology); Control engineering; Mathematics; Engineering; Artificial intelligence","score_opus":0.006728006578400939,"score_gpt":0.2250136646384672,"score_spread":0.21828565806006625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412446529","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009991986,0.00009240704,0.99468,0.000961442,0.000615938,0.0005532904,0.0000046558566,0.00023724405,0.0018558524],"genre_scores_gemma":[0.9644395,0.000004715819,0.034842618,0.00035648287,0.0000110615165,0.000010289534,0.000009439426,0.000004937714,0.00032095882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998381,0.00015931344,0.0005226317,0.00036438898,0.0002533666,0.0003192622],"domain_scores_gemma":[0.9986535,0.00018386573,0.00018439526,0.0005973556,0.00028853817,0.00009236647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033160506,0.00016966218,0.00041132697,0.00014235443,0.00007191596,0.00009375114,0.00069940387,0.00009211533,0.000036454603],"category_scores_gemma":[0.00015126067,0.00015627242,0.00012608798,0.0005479996,0.00005987673,0.00027626732,0.00009069554,0.00007455938,0.000019569292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096874974,0.00040851717,0.0057729227,0.00010643785,0.00045305275,0.000021798018,0.0001663693,0.6789393,0.009383259,0.29438385,0.0010655209,0.0092021115],"study_design_scores_gemma":[0.0031401087,0.000024325178,0.0014163213,0.000033855726,0.000042780433,0.000004931593,0.000013558735,0.9904042,0.0042459774,0.0004601302,0.000077244455,0.00013660583],"about_ca_topic_score_codex":0.000118968106,"about_ca_topic_score_gemma":0.000017125245,"teacher_disagreement_score":0.9634403,"about_ca_system_score_codex":0.00007754891,"about_ca_system_score_gemma":0.00014335332,"threshold_uncertainty_score":0.63726044},"labels":[],"label_agreement":null},{"id":"W4412449283","doi":"10.1016/j.neucom.2025.130818","title":"Robust observer and neurodynamics based distributed formation control of multiple mobile robots","year":2025,"lang":"en","type":"article","venue":"Neurocomputing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; McMaster University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile robot; Observer (physics); Artificial intelligence; Control (management); Robot","score_opus":0.01613324056685601,"score_gpt":0.218710456918094,"score_spread":0.202577216351238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412449283","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13713598,0.00006991633,0.86119086,0.00022866986,0.00038178248,0.000675344,0.000043260265,0.00021355269,0.000060653492],"genre_scores_gemma":[0.9938998,0.0000015102579,0.0056707817,0.00031621114,0.000023497452,0.000033738936,0.000034764744,0.000010509832,0.000009155126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811256,0.00021082698,0.00060879445,0.00046461012,0.00025007068,0.00035314137],"domain_scores_gemma":[0.99822426,0.0006314174,0.00033114708,0.0005303188,0.00020191405,0.00008093271],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032480643,0.00021576959,0.00035862354,0.00015197354,0.00016711124,0.00016869622,0.00063300144,0.000079496465,7.3850924e-7],"category_scores_gemma":[0.00022773657,0.0002224117,0.00009776921,0.0005974778,0.000039815757,0.00041363863,0.00023122491,0.00017632227,0.000002594498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028936427,0.0001420806,0.020937549,0.00023953714,0.00002918587,0.000014715281,0.00006847996,0.9481264,0.00942535,0.002330341,0.00014657917,0.018510893],"study_design_scores_gemma":[0.0023005484,0.000057258996,0.0452532,0.00008568225,0.000017350729,0.0000051814013,0.000012011855,0.95111334,0.00062751974,0.000030449834,0.00035639343,0.000141065],"about_ca_topic_score_codex":0.000029197849,"about_ca_topic_score_gemma":0.000008399191,"teacher_disagreement_score":0.85676384,"about_ca_system_score_codex":0.000051998482,"about_ca_system_score_gemma":0.000059883692,"threshold_uncertainty_score":0.9069686},"labels":[],"label_agreement":null},{"id":"W4412692979","doi":"10.1016/j.amc.2025.129661","title":"Prescribed finite-time collision-avoidance control for high-order multi-agent systems with external disturbances","year":2025,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Collision avoidance; Collision; Applied mathematics; Order (exchange); Multi-agent system; Mathematics; Computer science; Control (management); Artificial intelligence","score_opus":0.010471478462466195,"score_gpt":0.23448554113895165,"score_spread":0.22401406267648546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412692979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066677732,0.00036914155,0.98998547,0.00016184349,0.00027038783,0.002156457,0.00004984806,0.00016573077,0.00017333658],"genre_scores_gemma":[0.73661846,0.0000053397252,0.2623742,0.000068387635,0.00003390061,0.0006353828,0.000022852213,0.000013960862,0.00022753759],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983799,0.00003047564,0.00051738025,0.00048337207,0.00030262984,0.0002862416],"domain_scores_gemma":[0.9982191,0.0007542732,0.0003474474,0.00033942447,0.00026403437,0.000075724696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036279863,0.00026059622,0.00046217095,0.00009902308,0.00023387246,0.00051365653,0.00040618278,0.00007691697,6.293211e-7],"category_scores_gemma":[0.00004630823,0.00020816222,0.000040508687,0.00030328595,0.000049133563,0.0001726256,0.000076096,0.00007937715,0.000011873821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018618633,0.00094628334,0.0001299479,0.0017270199,0.0004962963,0.000009841884,0.0019184963,0.35961223,0.008398208,0.60540915,0.0013288661,0.019837491],"study_design_scores_gemma":[0.0038055428,0.000077099525,0.00036008688,0.00027216622,0.000059921123,0.000003042354,0.00009483416,0.98900396,0.00028212077,0.005598724,0.00020722629,0.00023528394],"about_ca_topic_score_codex":0.000023558268,"about_ca_topic_score_gemma":0.0000036545043,"teacher_disagreement_score":0.72995067,"about_ca_system_score_codex":0.000054338365,"about_ca_system_score_gemma":0.00006830682,"threshold_uncertainty_score":0.84886086},"labels":[],"label_agreement":null},{"id":"W4412718938","doi":"10.1109/tase.2025.3592691","title":"Dynamic Event-Triggered Consensus Control of Multi-Agent Systems With Time-Varying Delays and Semi-Markovian Switching Topology","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automation Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Topology (electrical circuits); Control theory (sociology); Markov process; Computer science; Consensus; Network topology; Control (management); Distributed computing; Engineering; Mathematics; Computer network; Artificial intelligence","score_opus":0.006454329554934559,"score_gpt":0.22845437712604277,"score_spread":0.22200004757110822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412718938","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087267995,0.00015063796,0.91126525,0.00022371701,0.0004690086,0.00038412312,0.000012568648,0.00019799938,0.000028675713],"genre_scores_gemma":[0.99543124,0.000009214276,0.004424865,0.000037054353,0.0000033096708,0.000042912827,5.14498e-7,0.000006840229,0.000044028588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985469,0.0000479853,0.0003870597,0.00039863234,0.00032623956,0.00029316815],"domain_scores_gemma":[0.9990744,0.00021446207,0.00012317549,0.0002974393,0.0001832553,0.00010724274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006903038,0.00017489941,0.00028142138,0.0005573671,0.00027238642,0.00019106554,0.0002846302,0.00006511533,0.0000010436783],"category_scores_gemma":[0.000033818553,0.00015926511,0.000031509193,0.0008456557,0.0001016881,0.000409918,0.0000055834694,0.00013408938,0.0000027657823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018384007,0.000056872115,0.000046509376,0.00014678722,0.00008066935,0.00000694827,0.00044400076,0.8249152,0.1613904,0.00070268987,0.000003763301,0.012187807],"study_design_scores_gemma":[0.0011665996,0.000052146035,0.0006429442,0.00021040873,0.000026436912,0.000035459965,0.00007490947,0.9951169,0.0025073737,0.000004447938,0.00001722255,0.00014515607],"about_ca_topic_score_codex":0.00006164466,"about_ca_topic_score_gemma":0.000006435618,"teacher_disagreement_score":0.90816325,"about_ca_system_score_codex":0.00014765633,"about_ca_system_score_gemma":0.000153658,"threshold_uncertainty_score":0.64946425},"labels":[],"label_agreement":null},{"id":"W4412792106","doi":"10.1101/2025.07.25.666863","title":"Collective Behavior in Medaka Fish Depends on Discrete Kinematic States of Swimming Behavior","year":2025,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Institutes of Health","keywords":"Collective behavior; Fish <Actinopterygii>; Kinematics; Animal behavior; Group behavior; Biological system; Biology; Fishery; Physics; Zoology; Classical mechanics; Psychology; Social psychology; Sociology","score_opus":0.014738543585899272,"score_gpt":0.2439837887895294,"score_spread":0.22924524520363013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412792106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94116277,0.00042685764,0.045627177,0.00032785503,0.0034891553,0.005469029,0.0026418965,0.000773119,0.000082155064],"genre_scores_gemma":[0.99191755,0.000027546726,0.005351463,0.00010916295,0.00007962157,0.0024127187,0.0000022441666,0.0000665311,0.00003316553],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9945341,0.00044517458,0.0014838977,0.0016666854,0.0010082339,0.00086195895],"domain_scores_gemma":[0.9950561,0.00037044272,0.0010715214,0.002566986,0.0006694662,0.00026547987],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010781505,0.00085327105,0.0013956745,0.0010885479,0.00014248384,0.00043481708,0.0027971575,0.0005891688,0.000013309686],"category_scores_gemma":[0.00041303897,0.00092213287,0.00032124217,0.0016886067,0.00010875383,0.0003552657,0.0018181462,0.0010169053,0.0000193083],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000679828,0.012185348,0.48536342,0.010938553,0.0025879082,0.00436559,0.0021239382,0.012694205,0.44995102,0.017211102,0.001605007,0.00029407],"study_design_scores_gemma":[0.0037936447,0.00037596677,0.7980183,0.0050279824,0.00062983576,9.02513e-8,0.00003586051,0.02495287,0.164354,0.000015471654,0.0002930779,0.0025029536],"about_ca_topic_score_codex":0.00035955943,"about_ca_topic_score_gemma":0.00005067062,"teacher_disagreement_score":0.31265482,"about_ca_system_score_codex":0.0013243464,"about_ca_system_score_gemma":0.0018191786,"threshold_uncertainty_score":0.99932295},"labels":[],"label_agreement":null},{"id":"W4412836874","doi":"10.1109/tac.2025.3595002","title":"Distributed Finite-Time Bipartite Consensus Control for Constrained Nonlinear MASs: A Switched Function Approach Based on Prioritized Strategy","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Bipartite graph; Nonlinear system; Function (biology); Computer science; Consensus; Control theory (sociology); Control (management); Mathematical optimization; Mathematics; Multi-agent system; Theoretical computer science; Physics; Graph; Artificial intelligence","score_opus":0.013529366044927042,"score_gpt":0.24143111052176147,"score_spread":0.22790174447683442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412836874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006210962,0.000034530698,0.9851866,0.0030784395,0.0010875801,0.005209121,0.0027569074,0.0015951087,0.00043064795],"genre_scores_gemma":[0.9820104,8.9996854e-7,0.013619223,0.001613163,0.000065699845,0.0021131241,0.0001254478,0.000046511555,0.00040549738],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951458,0.00058492704,0.0014639584,0.0011511232,0.0006897079,0.0009644667],"domain_scores_gemma":[0.99326086,0.003934517,0.00048345295,0.0013795575,0.0006334828,0.0003081166],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011275065,0.0007392698,0.0013053901,0.00063847285,0.00052488333,0.0005093907,0.00084393454,0.00038454382,0.00006641511],"category_scores_gemma":[0.00031785484,0.00071073195,0.0006764509,0.0011118905,0.00017026483,0.00022530553,0.0000025113488,0.00039835408,0.00013961381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032250918,0.0029605932,0.000015195573,0.0005100011,0.0020314879,0.00003711224,0.000085223786,0.9041112,0.027700696,0.0033054862,0.0014561439,0.05456174],"study_design_scores_gemma":[0.03433435,0.0006816137,0.00009646952,0.00021158291,0.0005403473,0.000005688206,0.000054051372,0.96183574,0.00082135486,0.00031826107,0.0005356462,0.0005648873],"about_ca_topic_score_codex":0.000022243794,"about_ca_topic_score_gemma":0.0000069543535,"teacher_disagreement_score":0.98138934,"about_ca_system_score_codex":0.00035577235,"about_ca_system_score_gemma":0.00081777864,"threshold_uncertainty_score":0.99953437},"labels":[],"label_agreement":null},{"id":"W4412981803","doi":"10.1016/j.cja.2025.103748","title":"Nussbaum-based fractional-order sliding-mode fault-tolerant cooperative control of multiple UAVs with event-triggered mechanism","year":2025,"lang":"en","type":"article","venue":"Chinese Journal of Aeronautics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Aeronautical Science Foundation of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Mechanism (biology); Mode (computer interface); Control (management); Sliding mode control; Computer science; Order (exchange); Fault (geology); Physics; Artificial intelligence; Economics; Geology; Seismology; Nonlinear system; Operating system; Finance","score_opus":0.007093984963200205,"score_gpt":0.25915778781372106,"score_spread":0.2520638028505209,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412981803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095432095,0.00034807937,0.9005847,0.0021002926,0.0008898297,0.00043549124,0.000070970644,0.000041151903,0.00009738354],"genre_scores_gemma":[0.98723185,0.000011218791,0.0120535465,0.00042792028,0.00010777626,0.000014387362,0.000009900441,0.000020459327,0.0001229152],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968924,0.00028074067,0.001218381,0.00033244985,0.00090194185,0.0003740866],"domain_scores_gemma":[0.99525577,0.0007866672,0.0011791085,0.0005519461,0.0020416833,0.00018485593],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007220474,0.0003980639,0.00095443486,0.00036621667,0.00018504905,0.00013879195,0.0010690754,0.00015422257,0.000016079099],"category_scores_gemma":[0.00059738563,0.00026492175,0.00026027596,0.0009492399,0.000069675654,0.0005731635,0.00007723311,0.00049252575,0.000006671541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033135274,0.0037352075,0.02064462,0.00041548724,0.0038312525,0.0004602006,0.0019073386,0.7831083,0.10056925,0.07706569,0.0015969222,0.0033521885],"study_design_scores_gemma":[0.013852072,0.0006212718,0.0027051014,0.00046096678,0.00016352188,0.00006776678,0.00011976133,0.9723282,0.007106966,0.0016403071,0.000603602,0.00033047755],"about_ca_topic_score_codex":0.000027001543,"about_ca_topic_score_gemma":0.00003963475,"teacher_disagreement_score":0.8917998,"about_ca_system_score_codex":0.00022206409,"about_ca_system_score_gemma":0.0010085176,"threshold_uncertainty_score":0.9999803},"labels":[],"label_agreement":null},{"id":"W4413086105","doi":"10.1002/asjc.3774","title":"Adaptive mixing formation control of multiquadrotor unmanned aerial vehicle systems","year":2025,"lang":"en","type":"article","venue":"Asian Journal of Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Control theory (sociology); Parametric statistics; Robustness (evolution); Adaptive control; Computer science; Robust control; Tracking (education); Scheme (mathematics); Engineering; Control engineering; Control system; Control (management); Mathematics; Artificial intelligence","score_opus":0.008582332955954718,"score_gpt":0.22898621151538803,"score_spread":0.2204038785594333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413086105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061452338,0.0008531857,0.98702556,0.0018038184,0.0022755829,0.0010030555,0.000040545532,0.00004475152,0.0008082525],"genre_scores_gemma":[0.9985136,0.0000032216615,0.00096349214,0.00013371384,0.0002831238,0.000034724642,0.0000012236367,0.00001098987,0.000055958717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99659264,0.00061366096,0.0015870114,0.0002169311,0.0005905398,0.00039923444],"domain_scores_gemma":[0.99636734,0.0003286191,0.0017113799,0.0004498853,0.00097468746,0.00016808104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014031663,0.00024170103,0.00089722563,0.00040459124,0.00011115453,0.0002052626,0.0011501556,0.00013666229,0.0000037817392],"category_scores_gemma":[0.00033765903,0.00021079909,0.00034133176,0.00039569166,0.00005538646,0.0012894203,0.000043442735,0.00026645546,0.000011726518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01409837,0.0023754498,0.011418082,0.0013697152,0.009326764,0.00089404045,0.0095343515,0.092612036,0.2957658,0.38492942,0.011025156,0.16665085],"study_design_scores_gemma":[0.03257011,0.0008866322,0.00378669,0.00094521354,0.00024509683,0.00011539669,0.0009689967,0.9546938,0.0025813042,0.0006331023,0.0022287597,0.00034490632],"about_ca_topic_score_codex":0.00002180748,"about_ca_topic_score_gemma":0.000005039127,"teacher_disagreement_score":0.99236834,"about_ca_system_score_codex":0.0001843335,"about_ca_system_score_gemma":0.00028679502,"threshold_uncertainty_score":0.8596138},"labels":[],"label_agreement":null},{"id":"W4413393448","doi":"10.23919/acc63710.2025.11107445","title":"Input-Output Stability of Gradient Descent: A Discrete-Time Passivity-Based Approach","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"McGill University","keywords":"Passivity; Control theory (sociology); Stability (learning theory); Computer science; Gradient descent; Artificial intelligence; Artificial neural network; Engineering; Control (management); Machine learning","score_opus":0.016380453067571372,"score_gpt":0.23235263704779377,"score_spread":0.2159721839802224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413393448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017752184,0.000054845037,0.970216,0.0009143849,0.0002697946,0.0007351679,0.000039280054,0.00028448572,0.009733892],"genre_scores_gemma":[0.9834124,4.6555914e-7,0.01586645,0.00019747109,0.000014269505,0.00007763467,0.000024530198,0.000007326425,0.00039949125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744,0.00032828609,0.0006030603,0.00070718327,0.0004702728,0.00045121333],"domain_scores_gemma":[0.99776566,0.00021111486,0.0001932705,0.0014901449,0.00019592662,0.00014389129],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079621066,0.00024765334,0.0004813112,0.00018235255,0.000095089476,0.00013796189,0.001355542,0.00009839452,0.000017999717],"category_scores_gemma":[0.00015443643,0.00020457648,0.00022071238,0.00089176884,0.00011704451,0.0002755164,0.00033660737,0.00014580078,0.000032299824],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046897505,0.012063903,0.12409344,0.0036093239,0.0012472755,0.000050481558,0.0030024862,0.00908149,0.040750716,0.6899763,0.017987777,0.09766787],"study_design_scores_gemma":[0.002130423,0.00010119084,0.011903895,0.000098557226,0.00003800907,0.0000013521163,0.000046728906,0.96693915,0.014830096,0.0006733199,0.0028677713,0.00036950977],"about_ca_topic_score_codex":0.00016481298,"about_ca_topic_score_gemma":0.00001098232,"teacher_disagreement_score":0.96566015,"about_ca_system_score_codex":0.00018417154,"about_ca_system_score_gemma":0.0002560642,"threshold_uncertainty_score":0.8342387},"labels":[],"label_agreement":null},{"id":"W4413474661","doi":"10.1016/j.automatica.2025.112535","title":"Consensus control for two-time-scale multi-agent systems under DoS attacks: An asynchronous sampling framework","year":2025,"lang":"en","type":"article","venue":"Automatica","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Asynchronous communication; Scale (ratio); Computer science; Sampling (signal processing); Distributed computing; Multi-agent system; Control (management); Artificial intelligence; Computer network; Telecommunications; Geography","score_opus":0.027459158250430715,"score_gpt":0.3202344270724543,"score_spread":0.2927752688220236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413474661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006628364,0.0005295493,0.984601,0.0013275163,0.00214774,0.0029467582,0.00015676775,0.0013594762,0.00030279453],"genre_scores_gemma":[0.84970886,0.0000012045707,0.14835767,0.00070171134,0.00015571139,0.00064595137,0.000036824335,0.000038905226,0.00035318692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960681,0.00041718388,0.0011116856,0.0009823187,0.00046997186,0.0009507487],"domain_scores_gemma":[0.99507487,0.0020677694,0.0003918267,0.0018101139,0.00034489835,0.00031051485],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010778812,0.00047808932,0.0009007696,0.00022639387,0.00043902005,0.0008370412,0.0015576113,0.00028358318,0.00001493431],"category_scores_gemma":[0.00041996312,0.00045741702,0.00025598484,0.0005105963,0.000115400064,0.00029176648,0.00018496618,0.00026458275,0.00039323297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003288709,0.004605388,0.004074362,0.0025507302,0.0044814353,0.00013595213,0.0043241726,0.28349093,0.027930975,0.60139674,0.016037181,0.05064327],"study_design_scores_gemma":[0.004110936,0.0001228437,0.0015367216,0.0004522301,0.00012581573,0.00002010121,0.0001949285,0.9899632,0.0001575944,0.001493528,0.0013460943,0.00047601762],"about_ca_topic_score_codex":0.000099957135,"about_ca_topic_score_gemma":0.000015859856,"teacher_disagreement_score":0.84308046,"about_ca_system_score_codex":0.000368767,"about_ca_system_score_gemma":0.00033195323,"threshold_uncertainty_score":0.99978775},"labels":[],"label_agreement":null},{"id":"W4413847202","doi":"10.1109/tii.2025.3598512","title":"Empowering Multirobot Flocking in Complex Environments via Effective Communication: A Deep Reinforcement Learning Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"National Natural Science Foundation of China","keywords":"Flocking (texture); Reinforcement learning; Computer science; Artificial intelligence; Reinforcement; Human–computer interaction; Distributed computing; Engineering","score_opus":0.03551621687307693,"score_gpt":0.27626704829967663,"score_spread":0.2407508314265997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413847202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022802395,0.000013795455,0.9926982,0.00010681036,0.0004990159,0.0013619366,0.0000028789068,0.0001477482,0.0028893957],"genre_scores_gemma":[0.9917466,0.000012225104,0.0075030066,0.00015922762,0.000019982755,0.00034893796,0.00002661219,0.0000110612655,0.00017232739],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976118,0.00027535477,0.0010615038,0.00022323361,0.00041138826,0.0004167063],"domain_scores_gemma":[0.9984464,0.00030526397,0.00031800833,0.00078883825,0.000047858688,0.00009361095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069747644,0.00028890173,0.00038907296,0.00046837964,0.00043893643,0.00024224259,0.00096452335,0.00024621963,0.0000124806265],"category_scores_gemma":[0.000034271467,0.00031064532,0.00012302442,0.00082458823,0.00006641794,0.0008514864,0.000029673876,0.001013708,0.000047478137],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039183968,0.00014499198,0.00005502227,0.000027679276,0.000095361494,9.1103936e-7,0.0027512985,0.9471183,0.00014382793,0.00023473075,0.000037168564,0.049351558],"study_design_scores_gemma":[0.0034566063,0.00008946903,0.00011747782,0.00015734049,0.000024540266,0.0000042217575,0.0008496202,0.9918293,0.0014789621,0.000015172922,0.0017208842,0.0002564057],"about_ca_topic_score_codex":0.00012878807,"about_ca_topic_score_gemma":0.000013729586,"teacher_disagreement_score":0.98946637,"about_ca_system_score_codex":0.00065541716,"about_ca_system_score_gemma":0.00005903437,"threshold_uncertainty_score":0.99993455},"labels":[],"label_agreement":null},{"id":"W4414166076","doi":"10.1109/tvt.2025.3607963","title":"Distributed Observer-Based Formation-Fencing Control for Multi-Autonomous Aerial Vehicles","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Control theory (sociology); Trajectory; Parametric statistics; Fuzzy logic; Fuzzy control system; Observer (physics); Lyapunov function; Stability (learning theory); Adaptive control","score_opus":0.02038546218039392,"score_gpt":0.2557125089477604,"score_spread":0.23532704676736646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414166076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012473372,0.0001052347,0.9787309,0.003828128,0.0013632566,0.001574083,0.00041443834,0.0014983495,0.000012232764],"genre_scores_gemma":[0.98002595,0.0000031597813,0.018232672,0.00041127056,0.000022916818,0.001185927,0.00003714598,0.000020555253,0.000060426188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976665,0.00011509,0.0006856149,0.0006683781,0.00023640812,0.0006280188],"domain_scores_gemma":[0.9980642,0.0002456,0.00021658596,0.0010530608,0.00033279392,0.00008774722],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003387724,0.00035189747,0.0005090013,0.0007113264,0.00053040223,0.00016395586,0.0012435244,0.00050695083,0.0000044903545],"category_scores_gemma":[0.00006849546,0.0003645036,0.00032399356,0.0011945013,0.00012495376,0.00039666294,0.0000067798155,0.00038265862,0.00003828792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057768147,0.0028947117,0.00028148844,0.000509132,0.001291201,0.00010086419,0.00017066216,0.5994401,0.16039869,0.07303073,0.0011697413,0.16013502],"study_design_scores_gemma":[0.006985786,0.00017647744,0.000099538636,0.00009207957,0.00009367458,0.000009810782,0.000044814602,0.8562977,0.13158923,0.00050763227,0.0037838602,0.00031940464],"about_ca_topic_score_codex":0.00003883211,"about_ca_topic_score_gemma":0.00007037858,"teacher_disagreement_score":0.96755254,"about_ca_system_score_codex":0.00041066553,"about_ca_system_score_gemma":0.00025091338,"threshold_uncertainty_score":0.9998807},"labels":[],"label_agreement":null},{"id":"W4414446600","doi":"10.1016/j.cnsns.2025.109314","title":"Fault detection and adaptive event-triggered consensus for LPV multi-agent systems with fading channels","year":2025,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Fading; Fault detection and isolation; Control theory (sociology); Residual; Overhead (engineering); Observer (physics); Wireless; Lyapunov function","score_opus":0.05113601221783404,"score_gpt":0.3392496328002999,"score_spread":0.28811362058246587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414446600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022840656,0.0006303882,0.9743955,0.0006454861,0.00021465718,0.0011230777,0.000012272021,0.000075423326,0.00006250358],"genre_scores_gemma":[0.9657313,0.000024531977,0.033970285,0.0000596189,0.000015041062,0.00015300825,0.0000058857845,0.0000053578856,0.000034917783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00015175791,0.00038246808,0.00045617227,0.0002592599,0.00027221788],"domain_scores_gemma":[0.99772394,0.0007325585,0.00016924988,0.0007791765,0.00050432363,0.00009073928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009978134,0.00014431306,0.00022403932,0.0003205332,0.00064392405,0.00031400123,0.00075895805,0.00006726248,1.4280492e-7],"category_scores_gemma":[0.00048769408,0.00012735242,0.000024011344,0.0015540858,0.00033827304,0.00041780923,0.00032206572,0.00014067435,0.0000014834682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022421758,0.0006927389,0.0042975643,0.00012661063,0.0000821902,0.0000033009412,0.0023150826,0.7631219,0.0065563773,0.019888379,0.00001406925,0.20267756],"study_design_scores_gemma":[0.0011381397,0.00009266771,0.001914803,0.00009886606,0.0000111037325,0.0000027701733,0.00024441638,0.99516046,0.00016617514,0.00014958563,0.0008792395,0.0001417514],"about_ca_topic_score_codex":0.00014647756,"about_ca_topic_score_gemma":0.000032083895,"teacher_disagreement_score":0.9428907,"about_ca_system_score_codex":0.00020946964,"about_ca_system_score_gemma":0.00015828191,"threshold_uncertainty_score":0.5193281},"labels":[],"label_agreement":null},{"id":"W4414463390","doi":"10.1109/tcyb.2025.3610787","title":"Robust Consensus of Constrained AUVs With Non-Uniform Time-Varying Delays and Disturbances","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Kinematics; Nonholonomic system; Control theory (sociology); Backstepping; Stability (learning theory); Coordinate system; Graph; Representation (politics); Robustness (evolution); Linear matrix inequality","score_opus":0.012171013590751255,"score_gpt":0.2151312444636719,"score_spread":0.20296023087292064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414463390","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023344962,0.00006872867,0.9709394,0.0005102379,0.00031509463,0.0003735438,0.00008538441,0.00010714845,0.0042555123],"genre_scores_gemma":[0.97764945,0.000017466638,0.021360263,0.00006999528,0.000009392776,0.000025340238,0.000002546978,0.000010061961,0.0008554533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868625,0.000047341993,0.00037316215,0.00037300572,0.0002491169,0.00027113655],"domain_scores_gemma":[0.9988527,0.00029622542,0.00013793021,0.0004682948,0.00015148673,0.000093344286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000150492,0.00021609264,0.00032430975,0.00016148278,0.00015238272,0.00009492838,0.00036982307,0.00009457336,0.000009204012],"category_scores_gemma":[0.0000066165244,0.00019079122,0.000064526605,0.00046471506,0.00025747565,0.000105645144,0.0000045974048,0.00018669658,0.0000111407035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007716848,0.0018999905,0.0011532387,0.00078578043,0.002161832,0.0001867244,0.003216864,0.816843,0.03234687,0.020035226,0.0027863267,0.11781248],"study_design_scores_gemma":[0.0033884142,0.00039168872,0.00058676355,0.00042685965,0.00016863974,0.000060968323,0.00013491989,0.97140354,0.022365944,0.00017685525,0.00047128566,0.00042410634],"about_ca_topic_score_codex":0.00010172987,"about_ca_topic_score_gemma":0.00007309937,"teacher_disagreement_score":0.9543045,"about_ca_system_score_codex":0.000052770927,"about_ca_system_score_gemma":0.00014736719,"threshold_uncertainty_score":0.778024},"labels":[],"label_agreement":null},{"id":"W4414499320","doi":"10.1109/tac.2025.3614508","title":"Passivity-Based Gradient-Play Dynamics for Distributed Generalized Nash Equilibrium Seeking","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Convergence (economics); Monotonic function; Monotone polygon; Dynamics (music); Class (philosophy); Nonlinear system","score_opus":0.011228891107511546,"score_gpt":0.2487940302610512,"score_spread":0.23756513915353966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414499320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047428524,0.00003772601,0.9829338,0.004556429,0.0028164748,0.002267933,0.0012321755,0.0013275713,0.000085008236],"genre_scores_gemma":[0.99004406,7.101376e-7,0.007320707,0.0008083122,0.000038279835,0.0013281249,0.00008116561,0.000032920365,0.00034570228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99669343,0.0003258485,0.0009102442,0.00078585854,0.00047716082,0.0008074532],"domain_scores_gemma":[0.9967722,0.0012230973,0.00031218733,0.0012272982,0.000259441,0.00020574723],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060758885,0.00047393856,0.0007731955,0.0004361235,0.00042216873,0.00045989765,0.0011506187,0.00021022798,0.000021789678],"category_scores_gemma":[0.00007036104,0.0004706791,0.0005571492,0.0009261535,0.000076100056,0.0003825334,0.0000051652714,0.00022349306,0.000036284102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006205082,0.0034426807,0.00025593786,0.0012756992,0.002981733,0.000079259575,0.00041824696,0.63528454,0.031087363,0.042520214,0.005601959,0.27643183],"study_design_scores_gemma":[0.009964369,0.0001307469,0.0002202116,0.00018311331,0.00021438222,0.0000050333533,0.000015905058,0.98544425,0.001943923,0.0005339769,0.00093956216,0.00040454825],"about_ca_topic_score_codex":0.00005777762,"about_ca_topic_score_gemma":0.00015286985,"teacher_disagreement_score":0.9853012,"about_ca_system_score_codex":0.0006565639,"about_ca_system_score_gemma":0.0003538933,"threshold_uncertainty_score":0.9997745},"labels":[],"label_agreement":null},{"id":"W4414568591","doi":"10.1016/j.ifacol.2025.09.121","title":"Event-triggered Resilient Control Design for a Group of Connected AUVs in the Presence of DoS Attack","year":2025,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Controller (irrigation); Control theory (sociology); Denial-of-service attack; Stability (learning theory); Control (management); Control system","score_opus":0.02652379003105363,"score_gpt":0.29457874899395403,"score_spread":0.2680549589629004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414568591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04812911,0.0007410055,0.94400024,0.0031264196,0.00038276182,0.003183491,0.00025091926,0.00006550125,0.00012055889],"genre_scores_gemma":[0.9448396,0.000009999523,0.0543349,0.00029483935,0.000037197657,0.00028924004,0.000024491012,0.0000093330345,0.00016043111],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970798,0.0006309904,0.0008814488,0.0005093266,0.00046180584,0.00043665327],"domain_scores_gemma":[0.995772,0.0025259326,0.00040835637,0.000937883,0.00029759546,0.00005822618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001541525,0.00024058748,0.0006020651,0.00019922943,0.00007252248,0.00005287763,0.0017396463,0.00012415893,0.0000062957447],"category_scores_gemma":[0.0010658845,0.00017868413,0.00020110657,0.0009564029,0.00010475312,0.00020520846,0.00009766924,0.0001548098,0.0000035414514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006628502,0.008662854,0.013949701,0.0027543695,0.0021262285,0.00015313894,0.013693442,0.0860641,0.6222807,0.18460369,0.00402343,0.055059828],"study_design_scores_gemma":[0.012991804,0.00069068733,0.010807312,0.0005495047,0.00010425032,0.0000055400874,0.0006407938,0.96625787,0.0058813146,0.0007800521,0.00092996197,0.00036092053],"about_ca_topic_score_codex":0.000157577,"about_ca_topic_score_gemma":0.00012069125,"teacher_disagreement_score":0.89671046,"about_ca_system_score_codex":0.000074116084,"about_ca_system_score_gemma":0.00020006366,"threshold_uncertainty_score":0.7286528},"labels":[],"label_agreement":null},{"id":"W4414767420","doi":"10.1109/tii.2025.3609009","title":"Secure Dynamic Event-Triggered Formation Tracking Control for Multiagent Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Multi-agent system; Deception; Bounded function; Observer (physics); Bernoulli's principle; Protocol (science); Lyapunov function; Interval (graph theory); Symmetric matrix; Process (computing)","score_opus":0.03269927218993479,"score_gpt":0.27945786697132635,"score_spread":0.24675859478139156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414767420","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014857927,0.000045115263,0.98700154,0.00050697697,0.0066208057,0.0032773796,0.0004850019,0.0003842936,0.00019310156],"genre_scores_gemma":[0.99693424,0.000010408229,0.0014759977,0.00027932122,0.00008198596,0.0006914331,0.00003785022,0.000016080356,0.00047266757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99697095,0.00015007422,0.0016040199,0.00024109795,0.00048361983,0.00055026525],"domain_scores_gemma":[0.9977099,0.00051524723,0.00056587206,0.00070263504,0.0003597578,0.00014663773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00082962756,0.0003567991,0.0005221892,0.0005330238,0.0004993318,0.0007032628,0.0008530001,0.00043589386,0.000004742508],"category_scores_gemma":[0.000063500134,0.00034552618,0.00031256716,0.0007490158,0.000034123066,0.0018562943,0.0000043222967,0.0004988907,0.000050100603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038237427,0.00049235736,0.0000069100715,0.0005442128,0.0006914479,0.0000035747935,0.0024520967,0.82798016,0.0006282997,0.008537919,0.0063432953,0.15193732],"study_design_scores_gemma":[0.007799304,0.00015584604,0.0000041821045,0.00032385503,0.00011716255,0.0000075231414,0.0006908517,0.9827568,0.0022532186,0.00007045361,0.005511915,0.00030887878],"about_ca_topic_score_codex":0.000038554004,"about_ca_topic_score_gemma":0.00001862526,"teacher_disagreement_score":0.99544847,"about_ca_system_score_codex":0.00058954273,"about_ca_system_score_gemma":0.0002791462,"threshold_uncertainty_score":0.9998997},"labels":[],"label_agreement":null},{"id":"W4414896384","doi":"10.48550/arxiv.2506.01378","title":"AI-Driven Low-Altitude Economy: Spectrum, Mobility, and Validation","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Software deployment; Drone; Reinforcement learning; Scalability; Bridging (networking); Resource (disambiguation)","score_opus":0.03772500466845896,"score_gpt":0.19374186746942734,"score_spread":0.15601686280096838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414896384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10010234,0.00007226937,0.8899354,0.0007955818,0.0009833972,0.00093434466,0.000098545956,0.0004239148,0.0066542183],"genre_scores_gemma":[0.99786466,0.000055718723,0.00036234324,0.0001925333,0.00007804977,0.0000043437617,0.00005436469,0.000010064322,0.0013778897],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741703,0.00022326723,0.0003278895,0.001554985,0.00008231799,0.0003945019],"domain_scores_gemma":[0.9975938,0.00012817615,0.00030305542,0.0016265161,0.00015324556,0.00019520248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031711426,0.00038380583,0.00049830886,0.00033083395,0.00015860095,0.000388132,0.0018759309,0.00032254914,0.000025726264],"category_scores_gemma":[0.000033845143,0.00047806086,0.00019911224,0.0004172614,0.00010064722,0.0006375353,0.0027068316,0.0005092002,0.0000838125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042786207,0.00033864818,0.019807389,0.0006711561,0.00046229674,0.00025003188,0.00031505752,0.37025404,0.000039473816,0.60607904,0.0009946687,0.000745417],"study_design_scores_gemma":[0.0010381521,0.00003752425,0.0030840598,0.00020891205,0.00010284624,0.0000038429607,0.000026949183,0.94682723,0.00025080997,0.04628135,0.0015524058,0.0005859078],"about_ca_topic_score_codex":0.0003274985,"about_ca_topic_score_gemma":0.00008954694,"teacher_disagreement_score":0.89776236,"about_ca_system_score_codex":0.00049154,"about_ca_system_score_gemma":0.00037563246,"threshold_uncertainty_score":0.9997671},"labels":[],"label_agreement":null},{"id":"W4415179695","doi":"10.23919/ecc65951.2025.11187205","title":"Collision-Free Formation Control and Tracking for Multi-Agent Systems under Motion Constraints","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Mitacs","keywords":"Control theory (sociology); Trajectory; Tracking (education); Observer (physics); Convergence (economics); Collision avoidance; Stability (learning theory); Motion control; Collision","score_opus":0.03454375603512698,"score_gpt":0.27847198088097175,"score_spread":0.24392822484584475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415179695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017163715,0.00029536083,0.99264157,0.0011162478,0.0011698094,0.0020578098,0.000088075474,0.00025416602,0.0006606125],"genre_scores_gemma":[0.98930377,0.00000590357,0.00966392,0.00033133235,0.000035144934,0.00023877471,0.000018847395,0.000007474652,0.00039485382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983338,0.00012410826,0.0005533703,0.0004088197,0.000247879,0.0003320338],"domain_scores_gemma":[0.9985356,0.0003173678,0.00018913731,0.00054743496,0.00031319074,0.00009728382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007445937,0.00019223012,0.00030753686,0.0001792842,0.00023790277,0.00059968274,0.00056578737,0.00011989092,0.0000023815426],"category_scores_gemma":[0.00022325032,0.00017071475,0.000083252366,0.00023954098,0.000054940385,0.00085839385,0.00010444075,0.00007439591,0.000009879796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005676317,0.00028444335,0.0008768871,0.00054160156,0.0002746397,0.0000063758043,0.00044508372,0.010553941,0.0058670714,0.91195583,0.0068175155,0.062319823],"study_design_scores_gemma":[0.0065749264,0.000036039277,0.0029312945,0.00012521567,0.00003107025,0.000013229731,0.00036165214,0.98774606,0.00043490238,0.0005929557,0.0009741445,0.00017852758],"about_ca_topic_score_codex":0.000047789585,"about_ca_topic_score_gemma":0.00002378556,"teacher_disagreement_score":0.9875874,"about_ca_system_score_codex":0.0001685804,"about_ca_system_score_gemma":0.00006406804,"threshold_uncertainty_score":0.69615453},"labels":[],"label_agreement":null},{"id":"W4415180720","doi":"10.23919/ecc65951.2025.11187264","title":"Collision-Free Multi-Agent Coverage Control for Non-Cooperating Swarms: Preliminary Results","year":2025,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Cover (algebra); Swarm behaviour; Collision avoidance; Voronoi diagram; Monte Carlo method; Control (management)","score_opus":0.015201313041819233,"score_gpt":0.2670701122906716,"score_spread":0.2518687992488524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415180720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016989709,0.00018315598,0.9845378,0.0035691413,0.001760425,0.0030151077,0.0004211468,0.00043707818,0.0043772208],"genre_scores_gemma":[0.94058174,0.0000096568765,0.04691763,0.0018419477,0.00011619635,0.0006743882,0.00005749038,0.000021989124,0.00977895],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966188,0.00016044613,0.001043025,0.0010370142,0.00042856004,0.0007121519],"domain_scores_gemma":[0.99589974,0.0012367263,0.00026130694,0.0019222728,0.0004932582,0.00018672204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012075749,0.0003842037,0.000564113,0.00020116653,0.00044830024,0.0005701881,0.0024164133,0.00018277834,0.0000054975903],"category_scores_gemma":[0.0016859671,0.0003341302,0.00024402319,0.000586867,0.000042769858,0.0006139799,0.0005830993,0.0001844567,0.00007054566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0052008186,0.0036600803,0.0016864535,0.00089789054,0.0016867904,0.00030393945,0.003093104,0.10072141,0.024122331,0.13266695,0.6512273,0.07473293],"study_design_scores_gemma":[0.021116173,0.0004343331,0.001354831,0.000189123,0.000042349362,0.0000056269305,0.000086454806,0.95797503,0.003346115,0.00023605363,0.014802736,0.00041115144],"about_ca_topic_score_codex":0.0001414303,"about_ca_topic_score_gemma":0.000046240923,"teacher_disagreement_score":0.93888277,"about_ca_system_score_codex":0.00022057079,"about_ca_system_score_gemma":0.00031755163,"threshold_uncertainty_score":0.99991107},"labels":[],"label_agreement":null},{"id":"W4415596281","doi":"10.1101/2025.10.26.684656","title":"Transient dynamics and counterintuitive competitive performance in periodic environments","year":2025,"lang":"","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Guelph","funders":"","keywords":"Counterintuitive; Competition (biology); Niche; Climate change; Transient (computer programming); Nonlinear system; Pace; Biodiversity","score_opus":0.00786545157293996,"score_gpt":0.19689378613693007,"score_spread":0.1890283345639901,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415596281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8200619,0.0018825295,0.16605477,0.00051608315,0.004006011,0.004025125,0.0029936489,0.0002758041,0.00018408707],"genre_scores_gemma":[0.99537873,0.0020718675,0.0014453811,0.00022883942,0.0001307604,0.0006160273,0.0000018822532,0.000081530205,0.000044976034],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99170715,0.0006444745,0.0017884094,0.003208564,0.0010747585,0.0015766608],"domain_scores_gemma":[0.99564564,0.0002026634,0.0009067335,0.0023220363,0.00034675933,0.0005761356],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0014325886,0.0015313381,0.0017268785,0.0007794861,0.0004489837,0.000985794,0.0022410685,0.0008673313,0.000036448553],"category_scores_gemma":[0.00010913013,0.0018798019,0.00026345518,0.0011545961,0.0006964174,0.00087363494,0.0017127384,0.001673744,0.00010807596],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018597754,0.008814717,0.46784183,0.01646841,0.0051935283,0.002749172,0.0041802195,0.012992858,0.32603505,0.15292934,0.00012570464,0.0008093892],"study_design_scores_gemma":[0.0034236708,0.00024791498,0.5873677,0.004122834,0.00016441158,1.3612357e-7,0.00006110901,0.38906613,0.007996884,6.966474e-7,0.005594147,0.0019543434],"about_ca_topic_score_codex":0.00014276152,"about_ca_topic_score_gemma":0.00003914377,"teacher_disagreement_score":0.37607327,"about_ca_system_score_codex":0.002865922,"about_ca_system_score_gemma":0.0011108388,"threshold_uncertainty_score":0.9997435},"labels":[],"label_agreement":null},{"id":"W4415971003","doi":"10.1109/tcyb.2025.3623995","title":"Weighted Group Role Assignment Based on Three-Way Conflict Analysis With Interval-Valued Intuitionistic Fuzzy Numbers","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nipissing University","funders":"National Natural Science Foundation of China","keywords":"Categorization; Task (project management); Prioritization; Fuzzy logic; Conflict analysis; Group (periodic table)","score_opus":0.010701184123883198,"score_gpt":0.2346204668196319,"score_spread":0.22391928269574868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415971003","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021743826,0.000025861555,0.989664,0.00065534463,0.0006780137,0.000632004,0.00011526427,0.00035873504,0.005696405],"genre_scores_gemma":[0.99175346,0.0000052488913,0.0066102305,0.000567116,0.00002265728,0.00021913744,0.00003248042,0.000024574143,0.0007650872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970943,0.00024507393,0.0005791073,0.00082528207,0.00077455014,0.00048168373],"domain_scores_gemma":[0.99781543,0.00032794362,0.00019586066,0.0012796032,0.00018157919,0.00019956795],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031244956,0.0004189166,0.0005366898,0.0006634351,0.0003160506,0.00039197967,0.0008760001,0.00016711041,0.00008565315],"category_scores_gemma":[0.000007378593,0.00037585475,0.00034517766,0.0020865083,0.00012526845,0.00016866394,0.000005934251,0.00040786644,0.00011991324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008238545,0.0044328775,0.0011213286,0.00012667157,0.0066684284,0.00011697088,0.0008373483,0.8742592,0.0015031634,0.049454704,0.0010111062,0.059644353],"study_design_scores_gemma":[0.0024214757,0.00057825824,0.0018594476,0.00018765614,0.0010090595,0.0000028061436,0.000051502757,0.9888114,0.0027881002,0.00057669205,0.0012562651,0.00045734138],"about_ca_topic_score_codex":0.0004004797,"about_ca_topic_score_gemma":0.0009303863,"teacher_disagreement_score":0.9895791,"about_ca_system_score_codex":0.0004660574,"about_ca_system_score_gemma":0.00012106205,"threshold_uncertainty_score":0.99986935},"labels":[],"label_agreement":null},{"id":"W4416031711","doi":"10.1016/j.sysconle.2025.106280","title":"GMFG critical nodes for control affine systems with exponentiated costs","year":2025,"lang":"en","type":"article","venue":"Systems & Control Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; HEC Montréal; Carleton University; McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Affine transformation; Node (physics); Graph; Nash equilibrium; Limit (mathematics); State (computer science); Cardinality (data modeling); Inverse","score_opus":0.006804105785163883,"score_gpt":0.2368251382651115,"score_spread":0.23002103247994762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416031711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005556346,0.0020783981,0.9686199,0.0097631235,0.0058479956,0.006067447,0.00035014495,0.0009213562,0.0007952765],"genre_scores_gemma":[0.9928665,0.0000018455439,0.00043934843,0.002664153,0.000433991,0.002849112,0.00004456334,0.00006407265,0.0006363773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9939426,0.00083206757,0.0014049046,0.0014318129,0.0009154551,0.0014731645],"domain_scores_gemma":[0.9947734,0.0019353677,0.0004771169,0.0016983694,0.0007636018,0.0003521718],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014947888,0.00075792597,0.0016170066,0.0004886312,0.0003670687,0.001549818,0.0018432926,0.00027208478,0.000006424198],"category_scores_gemma":[0.00033272122,0.0006405064,0.00033990396,0.0006076048,0.00016958409,0.00081942865,0.00009446711,0.00033289005,0.0001121173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004512242,0.0011922106,0.024297044,0.0048542563,0.00774408,0.0007633815,0.00049011916,0.080296665,0.21513666,0.586201,0.07190598,0.0026063411],"study_design_scores_gemma":[0.030599223,0.0003549684,0.0018654153,0.0017658048,0.00044082646,0.00011062838,0.0002342701,0.93613225,0.0001730369,0.000026604752,0.027051369,0.0012455974],"about_ca_topic_score_codex":0.0008495462,"about_ca_topic_score_gemma":0.000029811623,"teacher_disagreement_score":0.9873102,"about_ca_system_score_codex":0.0006511942,"about_ca_system_score_gemma":0.00022708563,"threshold_uncertainty_score":0.99960464},"labels":[],"label_agreement":null},{"id":"W4416057730","doi":"10.48550/arxiv.2510.18766","title":"Sharing the Load: Autonomous Multi-Rover Cargo Transport","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Flexibility (engineering); Offset (computer science); Workspace; Computation; Path (computing); Controller (irrigation); Mobile robot; Robot; Track (disk drive)","score_opus":0.060220156642673404,"score_gpt":0.2807332643553729,"score_spread":0.22051310771269947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416057730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3337348,0.0046727834,0.61392134,0.005517463,0.023774281,0.0063466686,0.0009135074,0.0013725059,0.00974661],"genre_scores_gemma":[0.9667454,0.00018760287,0.0010318109,0.0010567042,0.0010254162,0.0006581842,0.00011080055,0.00009132747,0.029092759],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9881499,0.00050744467,0.0028603177,0.004519864,0.001707652,0.0022548547],"domain_scores_gemma":[0.98885787,0.0004821334,0.001420466,0.0076748044,0.0009769826,0.0005877232],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002788837,0.0018714466,0.0020144675,0.00031107705,0.0011276057,0.0009075524,0.012401297,0.0011864421,0.00020382066],"category_scores_gemma":[0.00032309975,0.0016207353,0.0015950392,0.0012249255,0.00043096486,0.0008397527,0.004366062,0.0031141255,0.0015538731],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014696558,0.0010588338,0.9127945,0.0013877968,0.0028633059,0.00070631685,0.0149767315,0.037169848,0.0010815321,0.005098201,0.0011544601,0.021561548],"study_design_scores_gemma":[0.003994279,0.00008617664,0.56449103,0.0015448176,0.0006951554,0.000044571276,0.0002831236,0.34580407,0.0007958073,0.00012958603,0.07981679,0.0023145908],"about_ca_topic_score_codex":0.0054217973,"about_ca_topic_score_gemma":0.001001314,"teacher_disagreement_score":0.63301057,"about_ca_system_score_codex":0.001841526,"about_ca_system_score_gemma":0.0031454484,"threshold_uncertainty_score":0.999403},"labels":[],"label_agreement":null},{"id":"W4416366450","doi":"10.1109/lra.2025.3634882","title":"Decentralized Swarm Control Via SO(3) Embeddings for 3D Trajectories","year":2025,"lang":"","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Exploit; Position (finance); Stability (learning theory); Simple (philosophy); Adaptability; Controller (irrigation); Control theory (sociology); Range (aeronautics); Class (philosophy); Trajectory","score_opus":0.009679145705331389,"score_gpt":0.25095134876824954,"score_spread":0.24127220306291816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416366450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076133865,0.00071930984,0.9561935,0.026122648,0.006904573,0.0019848587,0.000115791154,0.00031999793,0.000025910875],"genre_scores_gemma":[0.9567818,0.00006341126,0.0360879,0.0063714487,0.00027859106,0.00016945602,0.000035827234,0.00003525118,0.00017633733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962133,0.00022924082,0.0012102023,0.0009271886,0.0004813933,0.0009386524],"domain_scores_gemma":[0.99760383,0.0006111109,0.0006038363,0.0006214482,0.00033089504,0.00022889876],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00070488575,0.0005749241,0.00086229655,0.0003214891,0.0007593773,0.0017814173,0.0007108281,0.0002540433,0.0000067190085],"category_scores_gemma":[0.000149053,0.00061070087,0.0002958434,0.0006128347,0.00023698261,0.0007808191,0.00006631592,0.00022422432,0.000018815508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042009473,0.0007131611,0.001984571,0.0024046106,0.0026177643,0.000049418824,0.0047451067,0.6552967,0.092173174,0.06276868,0.03704823,0.13977851],"study_design_scores_gemma":[0.0066884253,0.00008087564,0.0013240398,0.0003132368,0.00032791065,0.000008658912,0.000031729476,0.98135036,0.0012873429,0.00034930534,0.0076813423,0.00055676827],"about_ca_topic_score_codex":0.00006351875,"about_ca_topic_score_gemma":0.000010376691,"teacher_disagreement_score":0.9491684,"about_ca_system_score_codex":0.00025540259,"about_ca_system_score_gemma":0.00021826402,"threshold_uncertainty_score":0.99963444},"labels":[],"label_agreement":null},{"id":"W4416513071","doi":"10.1109/tcyb.2025.3631026","title":"Multirate-Sampled Fuzzy Consensus Control for Nonlinear Markov-Switched MASs With Time-Varying Delays: An Ellipsoidal Attraction-Region-Constrained Method","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Cybernetics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Nonlinear system; Aperiodic graph; Integral sliding mode; Lyapunov function; Ellipsoid; Sampling (signal processing); Network topology; Flexibility (engineering)","score_opus":0.022610864440553616,"score_gpt":0.27716405955003903,"score_spread":0.25455319510948543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416513071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003547603,0.00003221085,0.99049973,0.0013260458,0.0010614077,0.0020857856,0.00043083768,0.0005876102,0.0004287724],"genre_scores_gemma":[0.7015823,0.000004806029,0.2964104,0.0003987702,0.00008434336,0.00034784092,0.000032619206,0.00005008277,0.0010887844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99631506,0.0004249083,0.000899556,0.0010983809,0.00047435862,0.0007877362],"domain_scores_gemma":[0.99539465,0.0021502627,0.00034788143,0.0011596922,0.00063738663,0.0003101204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058302935,0.0005924311,0.00074329064,0.000396813,0.00051674957,0.00029239876,0.000872655,0.00033925445,0.00001768479],"category_scores_gemma":[0.000052756935,0.00056773523,0.00031357305,0.00076187286,0.00015763148,0.00033206804,0.000003869394,0.00051920576,0.00005125938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027592075,0.0019020634,0.00013438596,0.00020139283,0.0021095807,0.0001346171,0.00062783307,0.81980187,0.06792564,0.002341577,0.0005018691,0.10155995],"study_design_scores_gemma":[0.008918952,0.00050793675,0.000046870646,0.00011362649,0.00033644866,0.000067356494,0.00010838267,0.97787,0.010067966,0.00025976,0.001094519,0.0006081706],"about_ca_topic_score_codex":0.00022210195,"about_ca_topic_score_gemma":0.00017900072,"teacher_disagreement_score":0.69803476,"about_ca_system_score_codex":0.00024276633,"about_ca_system_score_gemma":0.00047252228,"threshold_uncertainty_score":0.9996774},"labels":[],"label_agreement":null},{"id":"W4416621756","doi":"10.1109/mrs66243.2025.11357273","title":"Safe Decentralized Density Control of Multi-Robot Systems using PDE-Constrained Optimization with State Constraints","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decentralised system; Controller (irrigation); Control theory (sociology); State (computer science); Set (abstract data type); Noise (video); Software deployment; Robot","score_opus":0.020206629957076453,"score_gpt":0.2572000118298884,"score_spread":0.23699338187281194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416621756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0097462665,0.0008098365,0.9804669,0.00017489181,0.002958877,0.004564247,0.00035895596,0.00025115302,0.0006688878],"genre_scores_gemma":[0.89690226,0.000032935965,0.10232214,0.00018101571,0.00003326585,0.000029460458,0.000031126852,0.000040259794,0.00042750867],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9912813,0.0012017359,0.003029978,0.0016249184,0.0012018627,0.0016602115],"domain_scores_gemma":[0.99260896,0.0007231314,0.0019297649,0.0015914113,0.0025859727,0.00056076405],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0023601968,0.0010398893,0.0022085293,0.0007405794,0.00044541995,0.0008561512,0.0014809062,0.00044571795,0.00010520172],"category_scores_gemma":[0.00038521527,0.00095826533,0.00036030792,0.0021168187,0.0013703357,0.0009573857,0.00026924783,0.0004433126,0.000018947228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008581979,0.00071554957,0.008858443,0.0006361223,0.0018530877,0.00016900226,0.0003096642,0.9608975,0.007958497,0.011364384,0.000031271673,0.0063483026],"study_design_scores_gemma":[0.02373978,0.00017232029,0.0016045982,0.0016161988,0.00053842005,0.00013218759,0.000378751,0.9685606,0.0023784356,0.000009027851,0.000047002537,0.00082268193],"about_ca_topic_score_codex":0.0019292624,"about_ca_topic_score_gemma":0.00019016812,"teacher_disagreement_score":0.887156,"about_ca_system_score_codex":0.00065321545,"about_ca_system_score_gemma":0.00216319,"threshold_uncertainty_score":0.9992868},"labels":[],"label_agreement":null},{"id":"W4416763532","doi":"10.48550/arxiv.2511.05900","title":"Disentangled Control of Multi-Agent Systems","year":2025,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generality; Convergence (economics); Control (management); Robotics; Range (aeronautics); Graph; Topology (electrical circuits)","score_opus":0.07064332156070371,"score_gpt":0.1978375586745082,"score_spread":0.12719423711380448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416763532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018829292,0.0015856092,0.96222943,0.000110227746,0.008744644,0.0039610476,0.0018827948,0.000363932,0.0022930168],"genre_scores_gemma":[0.9827104,0.00038844257,0.00024419188,0.00006893813,0.0001850004,0.000018388593,0.0000821891,0.000045705867,0.016256727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99050105,0.0018421927,0.0019955845,0.0036409067,0.00054660294,0.0014736896],"domain_scores_gemma":[0.9895181,0.0007627908,0.0026496865,0.004794939,0.0014807525,0.0007937287],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0013110536,0.0014601451,0.0027206477,0.0009918811,0.0004279183,0.0004415353,0.0067235753,0.0010646902,0.000069142385],"category_scores_gemma":[0.00024247446,0.0017457764,0.0015455486,0.0022523361,0.00051658886,0.0007373165,0.003105388,0.0011655528,0.00033318254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039221023,0.0015551816,0.014771462,0.0017955635,0.0026054492,0.00089422986,0.0004898996,0.8152664,0.0004232328,0.16075994,0.00047033458,0.00057612616],"study_design_scores_gemma":[0.009672177,0.00014998505,0.0019309643,0.0016578982,0.001147946,0.000011003645,0.00052438595,0.98075324,0.000118581425,0.00029497154,0.00243044,0.0013084331],"about_ca_topic_score_codex":0.0021649194,"about_ca_topic_score_gemma":0.00009865565,"teacher_disagreement_score":0.96388113,"about_ca_system_score_codex":0.0014237227,"about_ca_system_score_gemma":0.0012524027,"threshold_uncertainty_score":0.9998148},"labels":[],"label_agreement":null},{"id":"W4416790241","doi":"10.1016/j.ifacol.2025.11.275","title":"Spacecraft formation flying with connectivity maintenance under directed spanning tree","year":2025,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Backstepping; Convergence (economics); Control theory (sociology); Scalability; Collision avoidance; Position (finance); Spacecraft; Limit (mathematics); Adaptive control","score_opus":0.01176359826596636,"score_gpt":0.24046130917615013,"score_spread":0.22869771091018376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416790241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071034685,0.00017137779,0.91669816,0.0063515548,0.00043991845,0.0004991716,0.000021603244,0.0008223777,0.0039611803],"genre_scores_gemma":[0.8710042,0.0000074029144,0.12663123,0.00061495777,0.000070717535,0.000054453845,0.000037230304,0.000015970518,0.0015638283],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979918,0.00014478285,0.0003496748,0.00058093335,0.00037662,0.000556214],"domain_scores_gemma":[0.9985156,0.0002419972,0.00022122831,0.00067733764,0.00023145307,0.000112385984],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038552456,0.00030152174,0.0003921429,0.00019013729,0.00031319752,0.00026053752,0.00065455434,0.00010668963,0.000008663869],"category_scores_gemma":[0.00017106492,0.00024961232,0.000095441654,0.0009398046,0.000057136844,0.0009977882,0.00015620943,0.00024731355,0.000038721817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001114906,0.0020939219,0.05318692,0.0011833316,0.002205467,0.00067931454,0.010832676,0.028642926,0.19825104,0.19641581,0.0017168602,0.50367683],"study_design_scores_gemma":[0.0034441566,0.000113995404,0.03971345,0.0005752641,0.000053593394,0.000046286594,0.00068053225,0.95051116,0.0020897721,0.00032546226,0.0018959839,0.0005503729],"about_ca_topic_score_codex":0.00017941844,"about_ca_topic_score_gemma":0.00066023576,"teacher_disagreement_score":0.9218682,"about_ca_system_score_codex":0.00028258562,"about_ca_system_score_gemma":0.00013516864,"threshold_uncertainty_score":0.9999956},"labels":[],"label_agreement":null},{"id":"W4417201663","doi":"10.1109/access.2025.3642325","title":"LLM-Guided Distributed Model Predictive Control for Decentralized UAV Formations","year":2025,"lang":"","type":"article","venue":"IEEE Access","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nexen (Canada)","funders":"","keywords":"Scalability; Swarm behaviour; Drone; Controller (irrigation); Adaptability; Model predictive control; Testbed; Decentralised system","score_opus":0.04401638933537942,"score_gpt":0.3384931688707413,"score_spread":0.2944767795353619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417201663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024244518,0.00069630577,0.9659806,0.0042066635,0.0063257758,0.0074253352,0.01142443,0.0005398507,0.000976595],"genre_scores_gemma":[0.99305904,0.00008604903,0.0018554055,0.0012226013,0.00022491188,0.0024122978,0.00048477636,0.000047439516,0.0006074741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928175,0.00042550833,0.002390902,0.0015468738,0.0009091676,0.0019100159],"domain_scores_gemma":[0.99317163,0.0009973057,0.0011106767,0.0020722807,0.0021106913,0.00053743256],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011378528,0.0009249213,0.0014395413,0.00050579774,0.0011254249,0.002970412,0.0055997814,0.00054267806,0.0000254537],"category_scores_gemma":[0.00086376787,0.00096569845,0.00077433954,0.0020210615,0.00023490362,0.004597925,0.00049120333,0.0004606922,0.00005132444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011319454,0.0016525679,0.0018793844,0.0007759325,0.0023545264,0.000016430633,0.000863666,0.77807015,0.0010847866,0.063063964,0.14100759,0.00809907],"study_design_scores_gemma":[0.017177586,0.00013538178,0.0011131939,0.0004224343,0.0006747727,0.000006216462,0.000054647226,0.96427864,0.0020358223,0.009156111,0.004175252,0.0007699512],"about_ca_topic_score_codex":0.00015721825,"about_ca_topic_score_gemma":0.000052802832,"teacher_disagreement_score":0.9906346,"about_ca_system_score_codex":0.0009316464,"about_ca_system_score_gemma":0.0015892892,"threshold_uncertainty_score":0.9997804},"labels":[],"label_agreement":null},{"id":"W4417246397","doi":"10.1016/j.robot.2025.105296","title":"A survey on theories and applications for multi-robot cooperative hunting","year":2025,"lang":"en","type":"article","venue":"Robotics and Autonomous Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Jiangsu Provincial Key Research and Development Program; National Natural Science Foundation of China","keywords":"Key (lock); Field (mathematics); Task (project management); Perception; Robot","score_opus":0.02982456158216191,"score_gpt":0.28386646843519475,"score_spread":0.25404190685303285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417246397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032450934,0.001075193,0.99572444,0.00024955973,0.00046040158,0.0015749655,0.00011371725,0.00012236446,0.00035485567],"genre_scores_gemma":[0.9926229,0.000014101953,0.0052973707,0.00009518537,0.000064107706,0.00042077864,0.000034349097,0.000011928466,0.0014392772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861234,0.00014854845,0.00037690043,0.0004897613,0.00009576692,0.0002766507],"domain_scores_gemma":[0.9986007,0.0005638643,0.00014697138,0.00039149416,0.00022018638,0.00007674969],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007126332,0.00019610768,0.00036049026,0.000099521145,0.00041202625,0.0006782757,0.00031938902,0.00008511393,1.5084898e-7],"category_scores_gemma":[0.00011203218,0.00017341667,0.00003659267,0.00023864329,0.00006146263,0.00013091826,0.00012940972,0.00008639964,0.0000044877474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007400571,0.000088100816,0.0033575844,0.0001592553,0.00009888278,0.0000010003589,0.00023956786,0.028912468,0.00017243324,0.9613437,0.00012513975,0.005494432],"study_design_scores_gemma":[0.0010778044,0.00007856347,0.010441515,0.00013432198,0.000020619122,0.0000034301913,0.00014933181,0.9841525,0.00006241056,0.00030520034,0.0033186565,0.00025565925],"about_ca_topic_score_codex":0.00029747328,"about_ca_topic_score_gemma":0.000103576946,"teacher_disagreement_score":0.99229836,"about_ca_system_score_codex":0.00005569726,"about_ca_system_score_gemma":0.00009781772,"threshold_uncertainty_score":0.7071727},"labels":[],"label_agreement":null},{"id":"W4417251982","doi":"10.1109/jiot.2025.3642912","title":"Observer-Based Adaptive Resilient Fault-Tolerant Cooperative Control for Multiple Fixed-Wing UAVs Subject to Cyberattacks and Actuator Faults","year":2025,"lang":"","type":"article","venue":"IEEE Internet of Things Journal","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fundamental Research Funds for the Central Universities; Aeronautical Science Foundation of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Actuator; Control theory (sociology); Trajectory; Scheme (mathematics); Spoofing attack; Resilience (materials science); Convergence (economics); Adaptive control; Stability (learning theory)","score_opus":0.022979957383813625,"score_gpt":0.2779697153965427,"score_spread":0.25498975801272905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417251982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31397033,0.0006808882,0.67564297,0.0020377,0.0048394226,0.0023811383,0.00031126625,0.000059053382,0.00007724606],"genre_scores_gemma":[0.9830407,0.000015718006,0.012505991,0.0024225998,0.0003295001,0.00015981402,0.000007793532,0.00005868471,0.001459226],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99224305,0.000965365,0.0027635274,0.0014813243,0.0011680282,0.0013787149],"domain_scores_gemma":[0.9911452,0.0026390555,0.0017371373,0.00086603436,0.0028106724,0.0008019296],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0029455216,0.0010381219,0.0019402831,0.0007780083,0.0006208962,0.0014747588,0.0025519927,0.00044267028,0.00002795409],"category_scores_gemma":[0.0021491172,0.0009546896,0.0008025547,0.00070972485,0.00027753648,0.0016319755,0.00033429387,0.0012706656,0.000019929399],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.052286126,0.0058044493,0.0138886515,0.0026746478,0.015203383,0.0012931628,0.085294075,0.2598142,0.36059186,0.006742737,0.06349888,0.13290781],"study_design_scores_gemma":[0.017489105,0.0025959874,0.0012363589,0.004852379,0.00029923534,0.00008927343,0.00082528987,0.90193754,0.06701309,0.0000881619,0.002715741,0.00085784955],"about_ca_topic_score_codex":0.0006253805,"about_ca_topic_score_gemma":0.00015703177,"teacher_disagreement_score":0.66907036,"about_ca_system_score_codex":0.000890349,"about_ca_system_score_gemma":0.0011549814,"threshold_uncertainty_score":0.9995618},"labels":[],"label_agreement":null},{"id":"W4417291496","doi":"10.48550/arxiv.2512.09495","title":"On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds","year":2025,"lang":"","type":"preprint","venue":"ArXiv.org","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"McGill University","keywords":"Observability; Guard (computer science); Wireless ad hoc network; Observable; Scheme (mathematics); Planner; Constellation; Crowdsensing; Mobile ad hoc network","score_opus":0.04309631915761608,"score_gpt":0.27928448979561254,"score_spread":0.23618817063799646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417291496","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13348714,0.009181955,0.8346244,0.0005748687,0.012421659,0.0069106687,0.00095147145,0.0003030995,0.0015447035],"genre_scores_gemma":[0.98120856,0.0019239183,0.001408235,0.00069609896,0.0007204593,0.002722554,0.00033370013,0.00007770275,0.010908771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99103373,0.0006114299,0.0027041733,0.0028871035,0.0009770057,0.0017865367],"domain_scores_gemma":[0.9898987,0.001937853,0.0020590925,0.004598124,0.0010412581,0.00046498855],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0019013241,0.0013171806,0.00235107,0.00032751713,0.000441493,0.00048423567,0.005003103,0.0010708628,0.00012580678],"category_scores_gemma":[0.00047218348,0.0014269328,0.0013446774,0.0011610913,0.00020588445,0.00050903024,0.0025352885,0.0013113501,0.00017566477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000929597,0.0011612354,0.03372592,0.0014765323,0.0012898812,0.00004875791,0.0006316458,0.857932,0.00033477534,0.0054338616,0.0057125245,0.09132332],"study_design_scores_gemma":[0.006033131,0.001520823,0.027678786,0.004011746,0.00048501708,0.000003842827,0.000055003817,0.7912739,0.0013704165,0.0011638958,0.16446173,0.0019416985],"about_ca_topic_score_codex":0.000085710824,"about_ca_topic_score_gemma":0.00014233458,"teacher_disagreement_score":0.8477214,"about_ca_system_score_codex":0.0005245745,"about_ca_system_score_gemma":0.0012325954,"threshold_uncertainty_score":0.999958},"labels":[],"label_agreement":null},{"id":"W622964856","doi":"10.1007/s10846-015-0236-9","title":"Cooperative Tracking a Moving Target Using Multiple Fixed-wing UAVs","year":2015,"lang":"en","type":"article","venue":"Journal of Intelligent & Robotic Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Tracking (education); Range (aeronautics); Track (disk drive); Wing; Control theory (sociology); Computer science; Fixed wing; Scheme (mathematics); Separation (statistics); Algorithm; Artificial intelligence; Engineering; Aerospace engineering; Mathematics; Control (management)","score_opus":0.08292814693169615,"score_gpt":0.29223445241566504,"score_spread":0.2093063054839689,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W622964856","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021550842,0.0035334418,0.96623135,0.00014812281,0.0077301534,0.0005179656,0.000004859641,0.000082908125,0.00020033619],"genre_scores_gemma":[0.9775822,0.0000113763535,0.02116725,0.00006142242,0.00091125554,0.000007673955,0.000002103317,0.000038139726,0.00021857372],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9948703,0.0006770992,0.002051819,0.00043493902,0.0012949542,0.0006709101],"domain_scores_gemma":[0.9947651,0.0005026449,0.0016687858,0.00060310663,0.001882929,0.000577432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030079652,0.00041221926,0.001041326,0.00044806942,0.000197933,0.000997987,0.0015789259,0.00016128976,0.0000069268403],"category_scores_gemma":[0.0013799028,0.0003411601,0.0003383636,0.0006836838,0.000051092455,0.0016420681,0.00021539092,0.00047962676,0.00006134383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033139688,0.00015804992,0.0045372765,0.00007905673,0.00028913075,0.0003327041,0.0029689975,0.9846828,0.0038065615,0.0013025166,0.0006594182,0.0011503538],"study_design_scores_gemma":[0.0010616785,0.00025081885,0.00010311328,0.0010480011,0.00005017882,0.0014247596,0.0036458173,0.9881596,0.0020948786,0.000048926544,0.0017245959,0.00038762647],"about_ca_topic_score_codex":0.00026516095,"about_ca_topic_score_gemma":0.00000821175,"teacher_disagreement_score":0.9560314,"about_ca_system_score_codex":0.0009570412,"about_ca_system_score_gemma":0.00058468257,"threshold_uncertainty_score":0.99990404},"labels":[],"label_agreement":null},{"id":"W625474612","doi":"10.1007/978-3-662-44468-9_26","title":"Distributed Formation Control of Heterogeneous Robots with Limited Information","year":2014,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Robot; Computer science; Merge (version control); Distributed computing; Scalability; Perfect information; Population; Perception; Artificial intelligence; Human–computer interaction; Information retrieval","score_opus":0.009152987039263177,"score_gpt":0.20223845465622428,"score_spread":0.1930854676169611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W625474612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009987827,0.000103180355,0.997145,0.0003885248,0.0006742076,0.00091818423,0.00009617411,0.0001960024,0.00037884183],"genre_scores_gemma":[0.9549308,0.0000072443736,0.044189878,0.00055665034,0.000117137606,0.000024329256,0.00013922987,0.000020419508,0.000014333304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961156,0.00007369553,0.0010849794,0.000738052,0.0013513399,0.00063630345],"domain_scores_gemma":[0.9959178,0.00038854807,0.001195548,0.0014773075,0.00083204376,0.0001887491],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008141481,0.00057499215,0.00082001113,0.0008462433,0.00016556395,0.0005289406,0.0025876565,0.0003361859,0.000005288648],"category_scores_gemma":[0.00012908649,0.00047918817,0.00014758362,0.00067859894,0.00038258103,0.0016601904,0.00038244948,0.0004489261,0.000042256914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005298727,0.000030563475,0.000090900176,0.00015946671,0.000050790448,0.000024152536,0.0003974133,0.68125623,0.00017786228,0.010746581,0.00002785647,0.3069852],"study_design_scores_gemma":[0.0015074043,0.00038983338,0.0001463955,0.00049815007,0.000024308618,0.00013013052,1.7750092e-7,0.9906251,0.0014518654,0.0030969384,0.001561446,0.00056824164],"about_ca_topic_score_codex":0.00002437695,"about_ca_topic_score_gemma":0.0000307772,"teacher_disagreement_score":0.9548309,"about_ca_system_score_codex":0.00037148467,"about_ca_system_score_gemma":0.00030947063,"threshold_uncertainty_score":0.999766},"labels":[],"label_agreement":null},{"id":"W63976120","doi":"","title":"Distributed Gradient Optimization with Embodied Approximation","year":2008,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Gradient descent; Mathematical optimization; Optimization problem; Parameterized complexity; Computation; Configuration space; Embodied cognition; Robot; Robotics; Process (computing); Domain (mathematical analysis); Distributed computing; Artificial intelligence; Algorithm; Artificial neural network; Mathematics","score_opus":0.016685677614552554,"score_gpt":0.20276412773144317,"score_spread":0.18607845011689061,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W63976120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003258598,0.000013992138,0.9896269,0.00044962484,0.00014542276,0.0003989078,0.000012354409,0.00052871916,0.00556548],"genre_scores_gemma":[0.905111,0.0000041862017,0.094305925,0.00006790927,0.00002931195,0.00005987567,0.00016051541,0.000008698337,0.00025253487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865025,0.00006105525,0.00026109006,0.00037319388,0.00037312863,0.00028127027],"domain_scores_gemma":[0.99900514,0.00003180549,0.00013342261,0.0005351841,0.00017973175,0.00011468882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001293648,0.00015813894,0.00017711408,0.00008032689,0.00019323196,0.000104728024,0.00048490253,0.000050117862,0.00001647221],"category_scores_gemma":[0.000028381122,0.000120949415,0.000041611627,0.0005198915,0.000040767747,0.0006461809,0.00006507061,0.000064554835,0.000056999896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068548965,0.00057718577,0.0047805207,0.000041156047,0.00015494302,0.0001313117,0.0011180129,0.7447005,0.00027942707,0.23663086,0.0071208356,0.0043966863],"study_design_scores_gemma":[0.0010669982,0.00007351188,0.0015615438,0.000010607415,0.0000062288627,0.00008170348,0.000022501794,0.9958033,0.00034451584,0.00006264617,0.0007714884,0.00019495597],"about_ca_topic_score_codex":0.000038149392,"about_ca_topic_score_gemma":0.0000060399184,"teacher_disagreement_score":0.9018524,"about_ca_system_score_codex":0.00009669781,"about_ca_system_score_gemma":0.000055615328,"threshold_uncertainty_score":0.49321738},"labels":[],"label_agreement":null},{"id":"W66990465","doi":"10.1007/978-3-642-21538-4_9","title":"Autonomous Manipulation Combining Task Space Control with Recursive Field Estimation","year":2011,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Scalar (mathematics); Radial basis function; Field (mathematics); Scalar field; Control theory (sociology); Task (project management); Tracking (education); Artificial intelligence; Computer vision; Algorithm; Control (management); Artificial neural network; Mathematics","score_opus":0.015442113953158152,"score_gpt":0.22468885795134622,"score_spread":0.20924674399818807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66990465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004844391,0.00017036863,0.9922479,0.0010607974,0.0015487743,0.00096780766,0.000009566837,0.00028758775,0.0036587887],"genre_scores_gemma":[0.80450577,0.000005360633,0.19410634,0.0008564806,0.00020330012,0.00003095031,0.000018556777,0.00003982365,0.00023343087],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960827,0.00007109262,0.00063016935,0.0015416072,0.00096563046,0.00070879055],"domain_scores_gemma":[0.9965793,0.0006441595,0.0007216601,0.0014645956,0.00038887345,0.00020143384],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075681414,0.0006282963,0.00069403165,0.0006530343,0.00028187913,0.000627083,0.00243648,0.00038951944,0.000017600933],"category_scores_gemma":[0.0001364352,0.0005618819,0.000115025956,0.0004675052,0.00029396132,0.0010014316,0.00039098912,0.00073734473,0.00007963999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080766265,0.00007923615,0.00032665234,0.0000825537,0.00009050259,0.00027930315,0.0021608986,0.29009798,0.00012760652,0.2016511,0.00009715391,0.5049262],"study_design_scores_gemma":[0.0012344966,0.00058053044,0.00025925835,0.00068636227,0.000033727534,0.00011798711,3.282635e-7,0.91703737,0.0004973458,0.07816336,0.00056650565,0.0008227522],"about_ca_topic_score_codex":0.0001258836,"about_ca_topic_score_gemma":0.00007330902,"teacher_disagreement_score":0.8044573,"about_ca_system_score_codex":0.00045711943,"about_ca_system_score_gemma":0.00049101445,"threshold_uncertainty_score":0.99968326},"labels":[],"label_agreement":null},{"id":"W6887641311","doi":"10.17182/hepdata.50548.v1/t27","title":"\"Table 27\" of \"Electroproduction of Eta Mesons in the S11(1535) Resonance Region at High Momentum Transfer\"","year":2008,"lang":"en","type":"dataset","venue":"HEPData","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Meson; Resonance (particle physics); Momentum (technical analysis); Cross section (physics); Differential (mechanical device); Scattering cross-section","score_opus":0.023951257697761266,"score_gpt":0.22896763304585385,"score_spread":0.20501637534809258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6887641311","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00085698406,0.003595987,0.007997376,0.0015798482,0.0011202458,0.0011803947,0.9835812,0.000047529054,0.000040460014],"genre_scores_gemma":[0.020120833,0.0046510124,0.00021308952,0.00011419582,0.0002340307,0.0001210954,0.97406864,0.000026240737,0.0004508584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.996137,0.0004724498,0.0009202542,0.0009715906,0.00095995766,0.0005387393],"domain_scores_gemma":[0.9951511,0.00013844369,0.00041901442,0.004087417,0.00014400037,0.000060044687],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078756874,0.00037988857,0.00076662726,0.0002681297,0.00010722341,0.000052193245,0.00403715,0.00026672703,0.000016591523],"category_scores_gemma":[0.00011851362,0.00030816448,0.00013204275,0.0011812535,0.00013762631,0.00046637296,0.00034762197,0.00045996698,0.000039890274],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049816892,0.00022194698,0.00003448274,0.00017257777,0.0000383045,0.00005326085,0.00010046516,0.000026847485,0.00043879778,0.0008108376,0.9977421,0.00031053898],"study_design_scores_gemma":[0.00083074905,0.000156301,0.00049286743,0.00021939214,0.00004719564,0.0001286672,0.000015732514,0.00043014513,0.0013489651,0.000065345186,0.99597615,0.00028848785],"about_ca_topic_score_codex":0.0030448388,"about_ca_topic_score_gemma":0.00088793685,"teacher_disagreement_score":0.019263849,"about_ca_system_score_codex":0.00016037423,"about_ca_system_score_gemma":0.00022692862,"threshold_uncertainty_score":0.99993706},"labels":[],"label_agreement":null},{"id":"W6892701188","doi":"10.5281/zenodo.11858596","title":"analyser une offre demploi pdf","year":2024,"lang":"fr","type":"other","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Filter (signal processing); Point (geometry); Limiting","score_opus":0.042104665741001725,"score_gpt":0.2554075945562181,"score_spread":0.21330292881521637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6892701188","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006505142,0.0017552068,0.109228626,0.004318179,0.001456595,0.0010201171,0.00075173355,0.0018097878,0.8795947],"genre_scores_gemma":[0.029724678,0.00016250266,0.0007293123,0.0003361615,0.0011933398,1.9597137e-7,0.0023600038,0.008408652,0.95708513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9944128,0.0010492624,0.00078256446,0.001629917,0.0010750344,0.001050441],"domain_scores_gemma":[0.9961635,0.000047474237,0.00039383137,0.0018316016,0.0010075052,0.0005561179],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011788987,0.0006094121,0.0006288855,0.00076248526,0.0014644971,0.005391812,0.0046981056,0.0003902429,0.19901621],"category_scores_gemma":[0.00071731524,0.00065075484,0.00030834708,0.0026779086,0.0003601238,0.0005046128,0.0037290845,0.000921283,0.659634],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018413186,0.00018746038,0.0000019162221,0.0004267972,0.00050726417,0.00024455177,0.0010834018,0.00011615423,0.000739972,0.047998264,0.8441278,0.10454802],"study_design_scores_gemma":[0.00063870155,0.00020106799,0.0001739543,0.00049187837,0.00015107337,0.00025785313,0.00014169607,0.010705066,0.000043944372,0.00052059395,0.98605955,0.00061461044],"about_ca_topic_score_codex":0.00027321256,"about_ca_topic_score_gemma":0.000008274139,"teacher_disagreement_score":0.4606178,"about_ca_system_score_codex":0.00059058657,"about_ca_system_score_gemma":0.000023455188,"threshold_uncertainty_score":0.99983543},"labels":[],"label_agreement":null},{"id":"W6893731724","doi":"10.5281/zenodo.4602448","title":"Renefouqueosis Aalbu & Smith & Kanda & Bouchard 2017, gen. nov.","year":2017,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agriculture and Agri-Food Canada","funders":"","keywords":"Scutellum; Keel; Dorsum; Seta; Genus; Head (geology)","score_opus":0.05133954769204199,"score_gpt":0.26233389475650704,"score_spread":0.21099434706446504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893731724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0154641345,0.0005747616,0.50575423,0.010557051,0.0018337274,0.0018578123,0.0007665618,0.004529714,0.458662],"genre_scores_gemma":[0.99397653,0.00009946483,0.0013525762,0.00018180789,0.00032100972,1.7167142e-7,0.00030540224,0.0007746542,0.0029883753],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99727327,0.00031705233,0.00036125872,0.00076668937,0.0006497815,0.0006319397],"domain_scores_gemma":[0.99614537,0.000023911176,0.00034942952,0.002427343,0.0007209853,0.00033295614],"candidate_categories":["sts","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0010394915,0.00023046228,0.00025813177,0.00018883555,0.0052933483,0.0053799273,0.006042084,0.000094427356,0.0014051673],"category_scores_gemma":[0.0008930575,0.00023528057,0.000108836866,0.00027636328,0.00018095312,0.0011697528,0.0032689353,0.0002785189,0.015858162],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006679956,0.00028942394,0.00007421675,0.00011185219,0.0001971807,0.00014100116,0.0013523698,0.00008190063,0.008121207,0.037395585,0.6684704,0.28369808],"study_design_scores_gemma":[0.0009385605,0.0001373181,0.004156977,0.000057383164,0.000013718031,0.00010687202,0.00004399389,0.0051813093,0.000580154,0.00021820147,0.9882695,0.00029601096],"about_ca_topic_score_codex":0.00009323441,"about_ca_topic_score_gemma":0.0000010841652,"teacher_disagreement_score":0.9785124,"about_ca_system_score_codex":0.00019913589,"about_ca_system_score_gemma":0.000012229151,"threshold_uncertainty_score":0.99950767},"labels":[],"label_agreement":null},{"id":"W6907423383","doi":"10.22002/d1.1881","title":"ginput v1.0.9: GGG2020 prior profile software","year":2021,"lang":"en","type":"other","venue":"CaltechDATA","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Python (programming language); Software; Data file; Code (set theory); Software tool; Source code","score_opus":0.02302764979465543,"score_gpt":0.2567793854780338,"score_spread":0.23375173568337837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6907423383","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000014731421,0.0074147307,0.8557161,0.000651725,0.0034496046,0.0013140107,0.0023653992,0.0023513965,0.12673552],"genre_scores_gemma":[0.000225542,0.000120145756,0.07822702,0.0005942742,0.0013965196,0.00034108877,0.0040939287,0.0006321068,0.91436934],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9964532,0.00015750945,0.00047502056,0.0015025184,0.0007184887,0.0006932204],"domain_scores_gemma":[0.9950015,0.0000891263,0.0004143405,0.004091794,0.00010701414,0.00029624702],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00025757865,0.0005565983,0.00076116814,0.00024982286,0.0000945648,0.00042590636,0.0042047445,0.00056670833,0.0026995405],"category_scores_gemma":[0.00038912141,0.0005495893,0.00019861697,0.0006657225,0.0000570573,0.00018494652,0.0016384511,0.00051235297,0.0018650673],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014800971,0.000061749655,0.000034612196,0.00028108433,0.00011927799,0.00025972814,0.000021629836,0.0000011121556,0.00008004826,0.001509132,0.9705755,0.027054617],"study_design_scores_gemma":[0.00056939793,0.00002430245,0.000033279004,0.0006401469,0.000031221258,0.000039068167,0.0000066688867,0.0018780567,0.0001701331,0.000044514527,0.99595594,0.0006072439],"about_ca_topic_score_codex":0.00017194597,"about_ca_topic_score_gemma":0.000080745616,"teacher_disagreement_score":0.78763384,"about_ca_system_score_codex":0.00014398905,"about_ca_system_score_gemma":0.00046990614,"threshold_uncertainty_score":0.99969554},"labels":[],"label_agreement":null},{"id":"W6944836579","doi":"10.18910/84868","title":"Chaotic Neural Oscillator for Navigation and Exploration of Autonomous Drones","year":2021,"lang":"en","type":"article","venue":"OUKA (Osaka University Knowledge Archive) (Osaka University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Diafiltration; Dysgeusia; Liquation; Triacetin; Emperipolesis; Durvalumab","score_opus":0.02066035643278686,"score_gpt":0.2144469748222225,"score_spread":0.19378661838943564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6944836579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11689796,0.00017324723,0.8701066,0.00094912417,0.00069096684,0.00080879923,0.0003448277,0.00029749871,0.009730972],"genre_scores_gemma":[0.9836377,0.000058456237,0.00825702,0.000016966782,0.00007125937,8.8260396e-7,0.00021299078,0.000018405912,0.0077263354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792945,0.00036021206,0.00025421844,0.0008016144,0.00022300042,0.0004315004],"domain_scores_gemma":[0.9979987,0.00036542676,0.00027376838,0.0006273152,0.00046978006,0.00026500408],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020452254,0.00028620492,0.00044737488,0.000536297,0.0004804936,0.00008580973,0.00086137163,0.00012621934,0.000008998572],"category_scores_gemma":[0.00007107595,0.00037175763,0.00022036958,0.0009748191,0.0002034776,0.0018512198,0.0006420391,0.0001705538,0.00002363845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048203664,0.0009901432,0.003986915,0.00081141735,0.000575091,0.0008057885,0.01564047,0.0018768044,0.022456247,0.9171914,0.0028666956,0.03231703],"study_design_scores_gemma":[0.014207064,0.0007877869,0.008742515,0.000484174,0.00057843584,0.00012869766,0.012388748,0.5208156,0.007270757,0.0047923937,0.42774785,0.0020559987],"about_ca_topic_score_codex":0.000063604944,"about_ca_topic_score_gemma":0.00020506044,"teacher_disagreement_score":0.912399,"about_ca_system_score_codex":0.00025979415,"about_ca_system_score_gemma":0.00039951756,"threshold_uncertainty_score":0.99987346},"labels":[],"label_agreement":null},{"id":"W6986943911","doi":"","title":"Resilient Cooperative Control of Networked Multi-Agent Systems","year":2012,"lang":"en","type":"dissertation","venue":"Discover Archive (Vanderbilt University)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Waterloo; Vanderbilt University; National Science Foundation","keywords":"Control (management); Control system; Key (lock); Stability (learning theory); Action (physics)","score_opus":0.014289863366645682,"score_gpt":0.22216542951629742,"score_spread":0.20787556614965175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6986943911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075517306,0.0016460968,0.96399885,0.00003834845,0.0038665668,0.0023331924,0.00090838625,0.00022064103,0.019436194],"genre_scores_gemma":[0.9745626,0.000100673285,0.00045249308,0.00002424773,0.00016293708,0.000019119232,0.0011421336,0.00005190294,0.023483925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9957456,0.0008316656,0.0007438575,0.0010434515,0.00078262365,0.0008527788],"domain_scores_gemma":[0.99654126,0.00038015685,0.0010183246,0.0012701219,0.00041219866,0.0003779617],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034248843,0.0007143553,0.0011883919,0.00068679574,0.0003002412,0.0001874711,0.002158693,0.00031885828,0.00002051152],"category_scores_gemma":[0.00006641144,0.0007061963,0.00049548235,0.00074738247,0.00013797326,0.0009142481,0.00025436637,0.0005369315,0.00007979565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005280424,0.00619696,0.0145878615,0.004169008,0.010872788,0.0013179262,0.037022542,0.17000657,0.02795659,0.6960123,0.019276578,0.007300446],"study_design_scores_gemma":[0.046313494,0.0015918104,0.08122512,0.0056153,0.0033489736,0.00006300333,0.02443378,0.63179004,0.002707155,0.00039217735,0.19442588,0.008093271],"about_ca_topic_score_codex":0.00070309197,"about_ca_topic_score_gemma":0.0006900891,"teacher_disagreement_score":0.96701086,"about_ca_system_score_codex":0.00035822962,"about_ca_system_score_gemma":0.0005667095,"threshold_uncertainty_score":0.9995389},"labels":[],"label_agreement":null},{"id":"W6987051597","doi":"","title":"Security by Design: Reducing Information Exchange in Multi-Agent Search Tasks","year":2021,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Task (project management); Information exchange; Exploit; Dependency (UML); Information system; Adversarial system; Task analysis; Multi-agent system; Information structure","score_opus":0.014716761121164297,"score_gpt":0.2176003330505834,"score_spread":0.2028835719294191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6987051597","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053179253,0.0012550965,0.86383116,0.04082896,0.006182725,0.007990228,0.0016002207,0.0031230839,0.022009294],"genre_scores_gemma":[0.6879584,0.0019073727,0.034382347,0.00057781494,0.00023986373,0.000057952457,0.02344659,0.0002005861,0.25122905],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9963605,0.0008124504,0.00046302908,0.0008626306,0.00076029234,0.00074113655],"domain_scores_gemma":[0.9978967,0.00015507526,0.00043537622,0.0009833416,0.00020258623,0.0003269763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027491996,0.0005344775,0.00062431936,0.0009073994,0.00025657564,0.00066867657,0.0018764017,0.0006089235,0.00013175685],"category_scores_gemma":[0.000065693064,0.0006787336,0.00021837893,0.0016434398,0.00003656507,0.007050716,0.00051591767,0.00087187573,0.0001441097],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005172447,0.0011489255,0.0025189621,0.0026169005,0.0005432357,0.0016390717,0.050608937,0.0037634107,0.00026065065,0.0044136564,0.9200569,0.011912101],"study_design_scores_gemma":[0.019256746,0.00083456264,0.026056487,0.005887662,0.00040440954,0.0000103486855,0.054520085,0.097952075,0.046236895,0.0002947397,0.7391126,0.009433405],"about_ca_topic_score_codex":0.009761289,"about_ca_topic_score_gemma":0.00015987117,"teacher_disagreement_score":0.82944876,"about_ca_system_score_codex":0.00055326615,"about_ca_system_score_gemma":0.0007910909,"threshold_uncertainty_score":0.9995664},"labels":[],"label_agreement":null},{"id":"W6993024865","doi":"","title":"Multi-agent rendezvous","year":2017,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"Rendezvous; Resource (disambiguation); Robot; Resource management (computing); Range (aeronautics); Shared resource; Knowledge sharing","score_opus":0.0292572824923719,"score_gpt":0.2669260929144182,"score_spread":0.23766881042204632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6993024865","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2925207,0.00513318,0.0007140836,0.00029688707,0.06509508,0.010220687,0.011273557,0.008195771,0.60655004],"genre_scores_gemma":[0.91623557,0.00019224819,0.0060805716,0.0002476296,0.00018072703,0.000566223,0.0016674619,0.00031641542,0.07451318],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9907695,0.0006953702,0.0017468957,0.003005792,0.0020226357,0.0017598203],"domain_scores_gemma":[0.9903181,0.00024878333,0.0022859876,0.0053229723,0.00091414846,0.0009099593],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.001712609,0.001614995,0.0016461255,0.00066584157,0.002888106,0.0012115737,0.007710377,0.0015102318,0.00013083068],"category_scores_gemma":[0.0015975003,0.0017266464,0.000973336,0.0005575836,0.000087154316,0.0024950432,0.00061537337,0.0022567045,0.00306441],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001801931,0.0011493983,0.00005309659,0.0008347913,0.0012349461,0.0014955086,0.000050786115,0.00010809642,0.068152934,0.1442366,0.00022801824,0.7822756],"study_design_scores_gemma":[0.00873028,0.0004887461,0.0077954386,0.0023606725,0.0006918533,0.00027068096,0.00027469112,0.005791628,0.062442515,0.010086429,0.8938743,0.0071927668],"about_ca_topic_score_codex":0.0008043922,"about_ca_topic_score_gemma":0.0018429885,"teacher_disagreement_score":0.8936463,"about_ca_system_score_codex":0.0014205411,"about_ca_system_score_gemma":0.00021792362,"threshold_uncertainty_score":0.99982524},"labels":[],"label_agreement":null},{"id":"W6999303125","doi":"","title":"1951 Chap. 0206. An Act Increasing The Amount Of Money Which The Town Of Holliston May Borrow For School Purposes.","year":2012,"lang":"en","type":"other","venue":"State Library's electronic repository (State Library of Massachusetts)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Payment; Quarter (Canadian coin)","score_opus":0.00907276621371681,"score_gpt":0.21973840852729914,"score_spread":0.21066564231358234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6999303125","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08804019,0.10936888,0.04146004,0.021012543,0.011349948,0.037723437,0.012291071,0.0070534507,0.6717004],"genre_scores_gemma":[0.70171577,0.0018450061,0.0044223606,0.0004397542,0.0011813265,0.0006100335,0.0011635899,0.0015244012,0.28709775],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99122804,0.0018715484,0.0022585033,0.0014110162,0.0013327036,0.001898156],"domain_scores_gemma":[0.99046904,0.00079963583,0.0040471167,0.004074255,0.00013988081,0.00047004758],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012001586,0.0012087807,0.0018228589,0.00063134334,0.00032457663,0.0006376144,0.006658667,0.0005074035,0.00023799994],"category_scores_gemma":[0.00008559955,0.0008461914,0.0006832872,0.0013650656,0.0005297538,0.005363032,0.00091939897,0.0011505217,0.0000117226045],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036076035,0.0023404995,0.02651936,0.004141277,0.0060182028,0.00009313403,0.0045373384,0.001124953,0.022448612,0.034021538,0.8783407,0.016806759],"study_design_scores_gemma":[0.0031034218,0.0014461081,0.005185132,0.0010540372,0.00045568863,0.00012757866,0.00012437398,0.005037936,0.052272297,0.0031387173,0.9262695,0.0017852332],"about_ca_topic_score_codex":0.0006741146,"about_ca_topic_score_gemma":0.000025015179,"teacher_disagreement_score":0.6136756,"about_ca_system_score_codex":0.00012687994,"about_ca_system_score_gemma":0.0021446645,"threshold_uncertainty_score":0.9993989},"labels":[],"label_agreement":null},{"id":"W7010373940","doi":"","title":"Independent activity and local opportunity for dynamic robot team management in dangerous domains","year":2019,"lang":"en","type":"dissertation","venue":"Mspace (University of Manitoba)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Work (physics); Robot; Control (management); Human–robot interaction","score_opus":0.014328368844650878,"score_gpt":0.22416473683876464,"score_spread":0.20983636799411376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7010373940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38525137,0.00009727192,0.6086061,0.00028854454,0.00074779,0.0018935759,0.000098778444,0.00009080806,0.0029257624],"genre_scores_gemma":[0.99440205,0.000081908205,0.0029913469,0.0000128727725,0.000009156254,0.0000055969267,0.0002196289,0.000020033513,0.0022573823],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9981811,0.00013293493,0.00016127584,0.000700171,0.00045440104,0.00037010587],"domain_scores_gemma":[0.99856454,0.00008551521,0.00042815058,0.00066141505,0.00011331588,0.00014706698],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040256797,0.0003017722,0.0005481148,0.00041937397,0.00014569603,0.00006614265,0.001050913,0.0003090485,0.0000013462932],"category_scores_gemma":[0.00001229392,0.00040568472,0.00014467828,0.0002470451,0.00005395943,0.0004610108,0.00030493576,0.00029112713,0.0000145724025],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0035516124,0.003905749,0.0332176,0.012575933,0.0034379836,0.001686498,0.009033652,0.0051263734,0.0066805333,0.029122986,0.0061740703,0.885487],"study_design_scores_gemma":[0.0068339244,0.0003825706,0.76193196,0.00058057054,0.00024886112,0.000013522646,0.045181327,0.17994241,0.000100303776,0.0003772243,0.0032513503,0.0011559718],"about_ca_topic_score_codex":0.0029077483,"about_ca_topic_score_gemma":0.30788004,"teacher_disagreement_score":0.88433105,"about_ca_system_score_codex":0.00054518273,"about_ca_system_score_gemma":0.00014069726,"threshold_uncertainty_score":0.9998395},"labels":[],"label_agreement":null},{"id":"W7023796233","doi":"","title":"Peer relations of children with learning disabilities, an ethnographic approach","year":2000,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ethnography; Peer group; Qualitative research; Reflexivity; Relation (database); Social relation","score_opus":0.004252333431949194,"score_gpt":0.14622000730352755,"score_spread":0.14196767387157835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7023796233","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015245687,0.00041735856,0.0050997273,0.0005557507,0.000082382365,0.00040580818,0.0006300074,0.00006256146,0.99122185],"genre_scores_gemma":[0.59311014,0.000042625383,0.0050467304,0.000097004864,0.00006857504,0.000021873846,0.0001615052,0.000116131705,0.40133542],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9967314,0.00015256177,0.00030504682,0.00042292528,0.002104614,0.00028345516],"domain_scores_gemma":[0.998822,0.0001127511,0.00032292216,0.0005174553,8.1180485e-7,0.00022408686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000017177865,0.00027221555,0.0003979639,0.00006605401,0.00010583653,0.000039484235,0.00066998496,0.000065648885,0.000053205284],"category_scores_gemma":[0.0000033007814,0.00024164187,0.000037976326,0.00017991604,0.00014250433,0.00034467518,0.00010545796,0.00024890955,3.62804e-9],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045639323,0.00060534594,0.5105848,0.0011162683,0.0025730142,0.00005621055,0.00219361,0.00614513,0.0005560117,0.34957656,0.09202337,0.03411332],"study_design_scores_gemma":[0.0045967274,0.001035442,0.19419481,0.0017620767,0.00035438655,0.00008309169,0.00941782,0.061495125,0.0015371314,0.0008450336,0.7211096,0.003568751],"about_ca_topic_score_codex":0.01221162,"about_ca_topic_score_gemma":0.0243145,"teacher_disagreement_score":0.62908626,"about_ca_system_score_codex":0.0000049664523,"about_ca_system_score_gemma":0.0010811453,"threshold_uncertainty_score":0.99436617},"labels":[],"label_agreement":null},{"id":"W7024955698","doi":"","title":"Synthesis and characterization of two azobenzene-containing ferroelectric liquid crystals and of their corresponding polysiloxanes","year":2001,"lang":"en","type":"other","venue":"Library and Archives Canada (Government of Canada)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Ferroelectricity; Liquid crystal; X-ray crystallography; Polymer","score_opus":0.004549112351090581,"score_gpt":0.15568342469991006,"score_spread":0.15113431234881947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024955698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6778713,0.006144855,0.02768563,0.0018482645,0.0008829069,0.0017816215,0.003703865,0.00012487009,0.2799567],"genre_scores_gemma":[0.9860429,0.0004286898,0.0003540752,0.00008816569,0.000042934233,0.000010033975,0.000011606252,0.000059265687,0.012962294],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99800646,0.00013764664,0.00042348867,0.00034635703,0.0008252417,0.00026077655],"domain_scores_gemma":[0.9984721,0.00036923503,0.00070983235,0.00028687133,0.0000013895087,0.00016057033],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000031050877,0.00027270484,0.00060866016,0.00013767979,0.0000633701,0.00003436226,0.0003638016,0.000051837284,0.000020776224],"category_scores_gemma":[0.000008285133,0.00025707253,0.000030304771,0.00017161483,0.00006060243,0.00027335787,0.0001951218,0.00008441886,7.6955914e-10],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007225136,0.000062574974,0.019024843,0.0011662517,0.0006161231,0.00009891982,0.0003710719,0.00001554833,0.88987994,0.04668686,0.000598555,0.04075682],"study_design_scores_gemma":[0.0027720137,0.00086277246,0.042427655,0.0048549618,0.0002798297,0.0001081408,0.0019194102,0.032031365,0.8681477,0.00034980822,0.044298474,0.0019478722],"about_ca_topic_score_codex":0.0055083362,"about_ca_topic_score_gemma":0.0054935403,"teacher_disagreement_score":0.30817163,"about_ca_system_score_codex":0.0000073696306,"about_ca_system_score_gemma":0.00056207087,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W7065550086","doi":"","title":"Efficient collaboration with trust-seeking robots","year":2017,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University","keywords":"","score_opus":0.01361831504038245,"score_gpt":0.24379843188991443,"score_spread":0.230180116849532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7065550086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7546046,0.00082488655,0.00078709284,0.00015182153,0.011730771,0.0050642574,0.0020696307,0.0022122804,0.22255468],"genre_scores_gemma":[0.98454255,0.00002222169,0.0026048836,0.00010277918,0.00011219432,0.00039865225,0.0009298721,0.00018712218,0.011099725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9928808,0.00050210726,0.0011980017,0.0022060615,0.0020080248,0.0012049858],"domain_scores_gemma":[0.99263203,0.000200415,0.0021246935,0.0030970369,0.0014214736,0.00052433624],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013438084,0.001190686,0.001211315,0.0005922919,0.0027823788,0.0015232272,0.0036887352,0.00092625595,0.00004213714],"category_scores_gemma":[0.0007614893,0.0011534701,0.0003325207,0.0010043979,0.00007283302,0.0014142034,0.00023302004,0.0013331419,0.00051998097],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008557228,0.0013233596,0.00017797144,0.0012854709,0.0014492953,0.0011688973,0.0001686971,0.026110375,0.08000697,0.48288682,0.000066240675,0.40450016],"study_design_scores_gemma":[0.036574557,0.0036616349,0.023135617,0.015186543,0.002974988,0.00075470126,0.0032025264,0.29885754,0.17832191,0.017247472,0.3957758,0.024306726],"about_ca_topic_score_codex":0.00032401047,"about_ca_topic_score_gemma":0.0016716395,"teacher_disagreement_score":0.46563935,"about_ca_system_score_codex":0.0012918084,"about_ca_system_score_gemma":0.00031979257,"threshold_uncertainty_score":0.99951327},"labels":[],"label_agreement":null},{"id":"W7084099726","doi":"10.6084/m9.figshare.c.8038759","title":"The association between H. pylori infection and cognitive deterioration: a systematic review and meta-analysis","year":2025,"lang":"en","type":"other","venue":"Figshare","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dementia; Cognition; Cognitive decline; Odds ratio; Helicobacter pylori; Association (psychology); Disease","score_opus":0.04746105538212012,"score_gpt":0.2893770061440752,"score_spread":0.24191595076195507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084099726","genre_codex":"dataset","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.17247815e-7,0.44488665,0.012385868,0.001650896,0.00017570725,0.009955641,0.48885122,0.00070721906,0.041386686],"genre_scores_gemma":[0.00612079,0.00267253,0.00017245873,0.0018132844,0.000405578,0.012625941,0.10554624,0.00023798118,0.8704052],"study_design_codex":"not_applicable","study_design_gemma":"meta_analysis","domain_scores_codex":[0.9982016,0.0005072788,0.00041590972,0.00040302964,0.00031483974,0.00015733331],"domain_scores_gemma":[0.99746704,0.0007910462,0.0010143315,0.00042407322,0.00025200876,0.000051512445],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038733284,0.00024383423,0.0014161256,0.00016082324,0.00013622594,0.0005503749,0.00027726268,0.00018486429,0.0024147732],"category_scores_gemma":[0.002117159,0.00016158744,0.00033605762,0.00064023986,0.0000041036064,0.00014073322,0.00016879707,0.00013099474,0.00019245723],"study_design_candidate":"meta_analysis","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.078999e-7,0.0000105844565,0.00009631029,0.16951014,0.25174835,0.0000039383217,0.00004907826,2.9678702e-7,7.603902e-8,0.00011972928,0.5781513,0.0003097123],"study_design_scores_gemma":[0.00028188256,0.000031500585,0.0010825774,0.03729611,0.8738279,0.0000026358107,0.0000069311063,0.000497012,0.0000013278388,0.000031260566,0.08637901,0.0005618945],"about_ca_topic_score_codex":0.000055068605,"about_ca_topic_score_gemma":0.00019272939,"teacher_disagreement_score":0.82901853,"about_ca_system_score_codex":0.000068349524,"about_ca_system_score_gemma":0.000049950795,"threshold_uncertainty_score":0.9984971},"labels":[],"label_agreement":null},{"id":"W7084127741","doi":"10.64628/aam.mmvx6dupr","title":"Escaping the vicious circle of going paycheque to paycheque","year":2019,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Virtuous circle and vicious circle; Perspective (graphical); Government (linguistics); Action (physics); Argument (complex analysis)","score_opus":0.005697511983400177,"score_gpt":0.20907395612413057,"score_spread":0.2033764441407304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084127741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11499697,0.00010031877,0.8581903,0.002790877,0.000842427,0.0008542279,0.0000054616817,0.00023239286,0.021987038],"genre_scores_gemma":[0.99483675,0.0000017440267,0.0033145766,0.000982868,0.000052325737,0.000027678554,0.0000013386441,0.000011136374,0.0007715879],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831825,0.00012802522,0.0003969846,0.000406759,0.00036835964,0.00038159534],"domain_scores_gemma":[0.9981935,0.00024169174,0.00014098098,0.0011957933,0.00012585802,0.00010217897],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007105832,0.0001444894,0.00026230814,0.0000772534,0.00006643118,0.00014358785,0.0015650418,0.00005990893,0.00004346745],"category_scores_gemma":[0.000089691835,0.00010554387,0.000105989544,0.0004889288,0.000019049241,0.00029432488,0.00034392375,0.000120124234,0.0011853094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048145783,0.00042258564,0.02431594,0.00036524612,0.00040733346,0.000040908577,0.011973449,0.010252294,0.3998855,0.3306911,0.010055397,0.21154208],"study_design_scores_gemma":[0.006444085,0.0009703578,0.10552729,0.0009791806,0.000069352245,0.00013735308,0.0027815257,0.6695926,0.14186534,0.005441613,0.06345876,0.0027325451],"about_ca_topic_score_codex":0.00024043926,"about_ca_topic_score_gemma":0.00004444666,"teacher_disagreement_score":0.8798398,"about_ca_system_score_codex":0.0000678535,"about_ca_system_score_gemma":0.000070329435,"threshold_uncertainty_score":0.99959236},"labels":[],"label_agreement":null},{"id":"W7084153849","doi":"10.6084/m9.figshare.29900790.v2","title":"Vegetation changes in Jasper National Park assessed from resampling of ecological land classification plots established in the 1970s","year":2025,"lang":"en","type":"dataset","venue":"Figshare","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Vegetation (pathology); Ecosystem; Climate change; Plant community; Land cover; National park; Species diversity; Biodiversity; Detrended correspondence analysis","score_opus":0.08178616423025564,"score_gpt":0.3124561454178179,"score_spread":0.23066998118756227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084153849","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009512835,0.00016479123,0.00007732847,0.00040162294,0.00017152475,0.0006198062,0.9983216,0.000027159329,0.00012107102],"genre_scores_gemma":[0.03211675,0.000007287395,0.000111763475,0.0001950358,0.00010947918,0.0007280157,0.96672255,0.000003607614,0.0000055166206],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977129,0.00041596647,0.000482609,0.00052493653,0.00064248766,0.00022107121],"domain_scores_gemma":[0.99688745,0.0018069098,0.00043565506,0.0005933858,0.00024868792,0.000027898459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043262,0.00020514808,0.00034604163,0.00032793533,0.000044712444,0.00025954965,0.0016516703,0.0003439851,0.00083488895],"category_scores_gemma":[0.0034040934,0.00016437189,0.0000538364,0.0007323701,0.000007276327,0.00026635916,0.00019273821,0.00038269095,0.000049282316],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067040933,0.00014113747,0.0001368899,0.00017954838,0.000014930953,0.000012270943,0.00006750133,0.0002585201,0.000017418386,0.000048705384,0.99889606,0.00022032198],"study_design_scores_gemma":[0.001315322,0.000046190715,0.26063687,0.0040529333,0.000016769864,0.0000014821551,0.00005332754,0.041576676,0.000020415471,0.0002713693,0.691627,0.00038163012],"about_ca_topic_score_codex":0.00028575928,"about_ca_topic_score_gemma":0.004308379,"teacher_disagreement_score":0.30726904,"about_ca_system_score_codex":0.0001796988,"about_ca_system_score_gemma":0.00031223893,"threshold_uncertainty_score":0.9141449},"labels":[],"label_agreement":null},{"id":"W7094398232","doi":"","title":"Search for light long-lived neutral particles that decay to collimated pairs of leptons or light hadrons in pp collisions at √s = 13 TeV with the ATLAS detector","year":2023,"lang":"en","type":"article","venue":"RepositóriUM (Universidade do Minho)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Social Fund; Fundação para a Ciência e a Tecnologia; Institut National de Physique Nucléaire et de Physique des Particules; Agencia Nacional de Promoción Científica y Tecnológica; Science and Technology Facilities Council; Natural Sciences and Engineering Research Council of Canada; Narodowa Agencja Wymiany Akademickiej; Centre National pour la Recherche Scientifique et Technique; Centre National de la Recherche Scientifique; Israel Science Foundation; Japan Society for the Promotion of Science; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Generalitat Valenciana; Austrian Science Fund; European Regional Development Fund; Bundesministerium für Bildung und Forschung; Ministerstvo Školství, Mládeže a Tělovýchovy; U.S. Department of Energy; National Natural Science Foundation of China; Fundação de Amparo à Pesquisa do Estado de São Paulo; H2020 Marie Skłodowska-Curie Actions; Javna Agencija za Raziskovalno Dejavnost RS; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Ministry of Education, Culture, Sports, Science and Technology; Agence Nationale de la Recherche; National Science Foundation; Alexander von Humboldt-Stiftung; TRIUMF; Compute Canada; Max-Planck-Gesellschaft; Royal Society; Danmarks Grundforskningsfond; British Columbia Knowledge Development Fund; Türkiye Enerji, Nükleer ve Maden Araştırma Kurumu; Agencia Nacional de Investigación y Desarrollo; Generalitat de Catalunya; Canarie; Deutsche Forschungsgemeinschaft; Centres de Recerca de Catalunya; CERN; Leverhulme Trust; Ministerio de Ciencia e Innovación; European Commission","keywords":"Branching fraction; Higgs boson; Lepton; Muon; Standard Model (mathematical formulation); Boson; Photon; Fermion; Atlas (anatomy)","score_opus":0.028795384555333692,"score_gpt":0.252084553944487,"score_spread":0.22328916938915327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7094398232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97305435,0.00008275809,0.01397785,0.009794192,0.00019867103,0.0022204914,0.00010431288,0.00028489274,0.00028249572],"genre_scores_gemma":[0.99680054,0.0000115265075,0.000818153,0.000037751608,0.000030272198,0.00016772634,0.000023288696,0.000039701175,0.0020710665],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9968734,0.00029269647,0.0004208845,0.0008251172,0.0006087842,0.0009791458],"domain_scores_gemma":[0.99716693,0.00078449503,0.000240383,0.0011400017,0.00030333063,0.00036485688],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005749359,0.00034908846,0.0005330441,0.00044978256,0.0005637461,0.00027841452,0.001493542,0.00016406851,0.000017766326],"category_scores_gemma":[0.000049791845,0.00025173475,0.00021054586,0.003374878,0.00011322077,0.00046444198,0.0005922355,0.00018992992,0.000094389514],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002430524,0.00072619296,0.05506521,0.00033062673,0.00081059785,0.0019753664,0.025771981,0.02223376,0.8614394,0.004469968,0.023836115,0.00091025286],"study_design_scores_gemma":[0.0054928805,0.0011972927,0.06761659,0.0004920678,0.00019689038,0.00018602169,0.009047193,0.06909371,0.83893335,0.000010028836,0.006827268,0.000906686],"about_ca_topic_score_codex":0.0003688897,"about_ca_topic_score_gemma":0.0025091444,"teacher_disagreement_score":0.046859954,"about_ca_system_score_codex":0.00043641578,"about_ca_system_score_gemma":0.00030234057,"threshold_uncertainty_score":0.9999935},"labels":[],"label_agreement":null},{"id":"W7099423605","doi":"","title":"For presentation in ACC 2012, Montreal, Canada Distributed Decision Propagation in Mobile Agent Networks","year":2016,"lang":"en","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Moment (physics); Convergence (economics); Mobile agent; Control (management); Presentation (obstetrics); Multi-agent system; RADIUS; Decision support system","score_opus":0.01122624322916306,"score_gpt":0.24476212473650255,"score_spread":0.2335358815073395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099423605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03493971,0.00013379508,0.9618304,0.00058670226,0.0005203443,0.0017737449,0.00006762599,0.000060171667,0.00008755718],"genre_scores_gemma":[0.9972323,0.00001873649,0.0014538616,0.00005527468,0.00005039306,0.0007784652,0.0000929652,0.000009207237,0.00030879313],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981244,0.000102882186,0.0005465072,0.00046005932,0.00033565762,0.00043047202],"domain_scores_gemma":[0.9987109,0.0004653851,0.00015382716,0.00043889106,0.00012703885,0.00010401316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041877676,0.0001589846,0.00021786887,0.00010843541,0.000046117588,0.00009654812,0.000541997,0.00008186316,0.000013487618],"category_scores_gemma":[0.00014576282,0.00011226387,0.00004114899,0.00043906027,0.000011408445,0.0007961325,0.00009716217,0.00005623022,0.0000063736293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023848513,0.00040704096,0.033650123,0.000036570164,0.00003451622,0.000056183442,0.00016206624,0.0837583,0.001378695,0.0038229367,0.08315142,0.79330367],"study_design_scores_gemma":[0.0044107586,0.000084419196,0.13586089,0.00013691814,0.0000045530874,0.000002801216,0.00005263269,0.8512304,0.00051775353,0.00069270824,0.006708291,0.0002979169],"about_ca_topic_score_codex":0.180248,"about_ca_topic_score_gemma":0.81556517,"teacher_disagreement_score":0.9622926,"about_ca_system_score_codex":0.0006932588,"about_ca_system_score_gemma":0.00024304411,"threshold_uncertainty_score":0.8252108},"labels":[],"label_agreement":null},{"id":"W7104562205","doi":"10.1109/lra.2025.3630870","title":"Decentralized and Fully Onboard: Range-Aided Cooperative Localization and Navigation on Micro Aerial Vehicles","year":2025,"lang":"","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Odometry; Robot; Scalability; Block (permutation group theory); Computation; Decentralised system; Mobile robot; State (computer science); Control (management)","score_opus":0.010155790497617527,"score_gpt":0.24134783019429762,"score_spread":0.2311920396966801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7104562205","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3535956,0.00049620564,0.6317797,0.011523161,0.0015787008,0.0008686601,0.000038772654,0.000104676954,0.000014514378],"genre_scores_gemma":[0.9922407,0.0003011176,0.0038777778,0.003271455,0.00013450196,0.000029955389,0.00007212651,0.00002026062,0.00005206126],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972175,0.0004444157,0.0007675356,0.00078364223,0.00036765673,0.00041930182],"domain_scores_gemma":[0.9986675,0.00024230487,0.00037150807,0.00032438236,0.00022551573,0.00016882653],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00043693915,0.0004231138,0.00051447394,0.00024259674,0.00056500407,0.0014253644,0.00021416273,0.00021159247,0.0000030268668],"category_scores_gemma":[0.00008566871,0.0004381907,0.00005866275,0.00048714512,0.00025592634,0.00066016335,0.00008896415,0.00019506268,0.000008220823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000652516,0.00048549852,0.0056183035,0.0014298372,0.00085498375,0.00007867798,0.007157774,0.51426154,0.33918852,0.044176314,0.010337935,0.0757581],"study_design_scores_gemma":[0.005206422,0.00012346261,0.006782263,0.00085834047,0.00014072152,0.000014034766,0.00007740045,0.97915184,0.00649593,0.00015411316,0.0005500883,0.0004454067],"about_ca_topic_score_codex":0.000060810526,"about_ca_topic_score_gemma":0.000008504948,"teacher_disagreement_score":0.6386451,"about_ca_system_score_codex":0.00014805427,"about_ca_system_score_gemma":0.000096330805,"threshold_uncertainty_score":0.999807},"labels":[],"label_agreement":null},{"id":"W7114933089","doi":"","title":"Resilient Neural-Variable-Structure Consensus Control for Nonlinear MASs with Singular Input Gain Under DoS Attacks","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Nonlinear system; Robustness (evolution); Lipschitz continuity; Robust control; Adaptive control; Platoon; Controller (irrigation)","score_opus":0.019426505295298647,"score_gpt":0.262286083031089,"score_spread":0.24285957773579037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7114933089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17726952,0.0014118884,0.8001594,0.010724843,0.004092409,0.004511958,0.00116668,0.00033356473,0.00032973618],"genre_scores_gemma":[0.9788527,0.000009241156,0.013379427,0.004165352,0.00070635596,0.00020301758,0.00017066725,0.000104538536,0.0024086903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99161613,0.00083417573,0.0018766676,0.0025652084,0.0009863796,0.0021214609],"domain_scores_gemma":[0.9925871,0.0014268585,0.0010017687,0.0029916072,0.0014279474,0.00056474505],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011057094,0.0012997995,0.0016953354,0.00041394145,0.0009244129,0.00088312,0.0023210836,0.0007490043,0.000053300115],"category_scores_gemma":[0.00072480476,0.0011685763,0.00043663263,0.0018394232,0.0005715451,0.00042086822,0.00037463199,0.0009754925,0.0000830803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0072225556,0.0014938893,0.33611903,0.0028325056,0.007480445,0.0011247237,0.0012152449,0.42766953,0.123229675,0.063018255,0.016390573,0.012203595],"study_design_scores_gemma":[0.020734739,0.000778126,0.010960263,0.000933081,0.00085774035,0.00007885609,0.0002920996,0.92764974,0.003497175,0.00086041295,0.031774726,0.001583022],"about_ca_topic_score_codex":0.00014912237,"about_ca_topic_score_gemma":0.00007433555,"teacher_disagreement_score":0.8015832,"about_ca_system_score_codex":0.0005936404,"about_ca_system_score_gemma":0.001489592,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W7117456152","doi":"10.1109/tcns.2025.3649116","title":"Adaptive NN-Based Event-Triggered Consensus for Linear Multiagent Systems With Uncertainties","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Science Foundation of Anhui Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Nonlinear system; Adaptive control; Artificial neural network; Scheme (mathematics); Boundary (topology); Adaptive system; Function (biology); Linear system","score_opus":0.021568983583606524,"score_gpt":0.25377716297169056,"score_spread":0.23220817938808402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117456152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040690476,0.009696569,0.94836867,0.0007584696,0.02346311,0.01420837,0.0025265266,0.00039331996,0.0001780864],"genre_scores_gemma":[0.99112654,0.000047392386,0.0014953746,0.00022053598,0.0007553619,0.0036310472,0.000023782728,0.00013146833,0.002568511],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98790663,0.0023041929,0.0039314,0.0021474252,0.0016156372,0.0020947075],"domain_scores_gemma":[0.9861237,0.0052748704,0.0025409232,0.0025360207,0.0029726522,0.0005518689],"candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0027050336,0.0016089563,0.003587563,0.00088388374,0.001140484,0.0006559939,0.001867936,0.0008538066,0.000010366246],"category_scores_gemma":[0.0000655102,0.0014685187,0.0013012137,0.002279673,0.0005802663,0.00031361866,0.00000837552,0.0008622846,0.000037020258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006982208,0.0010651327,0.000060409784,0.0017228712,0.004775268,0.0000492502,0.00020372678,0.9763404,0.00025124295,0.0025379902,0.002533768,0.003477746],"study_design_scores_gemma":[0.024437128,0.0028076994,0.000025142364,0.0074461075,0.0017622175,0.000020750842,0.0008086795,0.9569476,0.0003661816,0.000018081473,0.004203014,0.0011573714],"about_ca_topic_score_codex":0.0016405343,"about_ca_topic_score_gemma":0.0002996342,"teacher_disagreement_score":0.9907196,"about_ca_system_score_codex":0.0010513341,"about_ca_system_score_gemma":0.0023839884,"threshold_uncertainty_score":0.9996658},"labels":[],"label_agreement":null},{"id":"W7117697886","doi":"10.1109/jsyst.2025.3644447","title":"Edge-Based Event-Triggered Tracking Formation of Multiagent Systems With Bearing Measurements","year":2025,"lang":"","type":"article","venue":"IEEE Systems Journal","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Fundo para o Desenvolvimento das Ciências e da Tecnologia; Universidade de Macau; National Natural Science Foundation of China","keywords":"Robustness (evolution); Control theory (sociology); Bounded function; Multi-agent system; Bearing (navigation); Range (aeronautics); Tracking (education); Lyapunov function","score_opus":0.054562548368367214,"score_gpt":0.27891910774776335,"score_spread":0.22435655937939614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117697886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026128925,0.010233375,0.9368118,0.00017165895,0.022748202,0.0031472617,0.00006955797,0.00012412579,0.0005650722],"genre_scores_gemma":[0.99801815,0.00003989232,0.00045502966,0.00003797973,0.00075188064,0.0001406161,0.000009952876,0.00006265733,0.00048384134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9869754,0.0023540668,0.0047350987,0.0009803842,0.0034721019,0.001482951],"domain_scores_gemma":[0.98896956,0.00030153408,0.0050116354,0.0015149858,0.0036101933,0.0005921114],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.006836599,0.0009726138,0.0019164131,0.0014498024,0.0010315373,0.0029772075,0.0024025938,0.00045679035,0.0000074155455],"category_scores_gemma":[0.00024674114,0.0008561821,0.0006049928,0.0018872123,0.00013813828,0.0024304856,0.00012170849,0.0010592304,0.000044609773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003856833,0.0007420566,0.005320377,0.00474397,0.0014838697,0.00017649436,0.0013472266,0.9524861,0.023924649,0.00022778564,0.0019450138,0.0072167777],"study_design_scores_gemma":[0.0103756245,0.00047028073,0.00096700335,0.023019902,0.000511007,0.00048940483,0.0007720178,0.949741,0.011530893,0.000008048572,0.0012729109,0.0008419251],"about_ca_topic_score_codex":0.00054617255,"about_ca_topic_score_gemma":0.000036481742,"teacher_disagreement_score":0.9718892,"about_ca_system_score_codex":0.0021025755,"about_ca_system_score_gemma":0.001932998,"threshold_uncertainty_score":0.9993889},"labels":[],"label_agreement":null},{"id":"W7123344105","doi":"10.1109/cdc57313.2025.11312459","title":"Attitude Synchronization for Multi-Agent Systems on SO(3) Using Vector Measurements","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec en Outaouais; Lakehead University","funders":"","keywords":"Synchronization (alternating current); Control theory (sociology); Kinematics; Inertial frame of reference; Stability (learning theory); Scheme (mathematics); Exponential stability; Graph","score_opus":0.13245731327704838,"score_gpt":0.3412552682766127,"score_spread":0.2087979549995643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123344105","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001437029,0.002518838,0.97090286,0.00043577678,0.017384533,0.006181316,0.0001384367,0.00034791138,0.00065331405],"genre_scores_gemma":[0.9821835,0.000018941033,0.012291914,0.00045472884,0.00041342658,0.00040550178,0.000050231072,0.00006222394,0.004119515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9930306,0.0006140923,0.0017925405,0.0018769288,0.0013329058,0.0013529309],"domain_scores_gemma":[0.9954668,0.00024943732,0.0007471698,0.0017928916,0.001406552,0.00033714282],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018380518,0.0008680109,0.0010378838,0.0005644388,0.0011448101,0.002500214,0.0019013954,0.00042204102,0.000031282514],"category_scores_gemma":[0.00054438977,0.00087248825,0.00043123693,0.001337686,0.00011178654,0.0007446309,0.00040201642,0.0002622805,0.00020704904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006577916,0.007991846,0.015787764,0.008068948,0.0068835528,0.000058327416,0.001823626,0.6797666,0.04072398,0.1604586,0.016889973,0.060888983],"study_design_scores_gemma":[0.005692465,0.00023318571,0.0012168507,0.001851126,0.00028239592,0.0000045001216,0.000088240784,0.9820281,0.0016987167,0.000011523326,0.0061570853,0.00073579897],"about_ca_topic_score_codex":0.00065252715,"about_ca_topic_score_gemma":0.00008145091,"teacher_disagreement_score":0.9807465,"about_ca_system_score_codex":0.0027839905,"about_ca_system_score_gemma":0.0012607209,"threshold_uncertainty_score":0.9993726},"labels":[],"label_agreement":null},{"id":"W7123353663","doi":"10.1109/cdc57313.2025.11312395","title":"A fully distributed algorithm for the nonconvex constrained optimization problem","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Bounded function; Constrained optimization; Robustness (evolution); Convergence (economics); Optimization problem; Convex function; Convex optimization; Lyapunov function","score_opus":0.011876541899528456,"score_gpt":0.25095339616136186,"score_spread":0.2390768542618334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123353663","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000022359982,0.0008972105,0.96604145,0.017379042,0.0033240204,0.006742584,0.0014379872,0.00041186353,0.0037636284],"genre_scores_gemma":[0.20825477,0.00017570185,0.7640482,0.003237639,0.0007632285,0.0034957798,0.0010479153,0.000088840694,0.018887892],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99487305,0.00032274588,0.0015944594,0.0013592448,0.0006273074,0.0012231662],"domain_scores_gemma":[0.9945433,0.0015356147,0.0006110869,0.0016322519,0.0014342476,0.00024346414],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016402248,0.0006945895,0.00079176086,0.000215708,0.0010792654,0.0019071964,0.002763451,0.0003807402,0.00017402033],"category_scores_gemma":[0.0003344236,0.0005244508,0.00050657184,0.0021132308,0.00040459484,0.0007127078,0.00055258354,0.00034929934,0.000054183194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008177245,0.0005345204,0.00005848004,0.0002503841,0.0013140198,0.00001432338,0.0003300268,0.14841387,0.0000926279,0.11487677,0.027863692,0.70616955],"study_design_scores_gemma":[0.0052061686,0.00018330925,0.00006497108,0.00021702502,0.0002978369,0.00001496069,0.00033305964,0.9625804,0.00018837066,0.00062046025,0.02977292,0.0005205365],"about_ca_topic_score_codex":0.00016446214,"about_ca_topic_score_gemma":0.000026161793,"teacher_disagreement_score":0.81416655,"about_ca_system_score_codex":0.00037288808,"about_ca_system_score_gemma":0.0014425558,"threshold_uncertainty_score":0.9997207},"labels":[],"label_agreement":null},{"id":"W7123355193","doi":"10.1109/cdc57313.2025.11312128","title":"Large-Population Risk Sensitive Linear-Quadratic Optimal Control: Decentralized Feedback","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Unobservable; Decentralised system; Limit (mathematics); Optimal control; Control (management); Control theory (sociology); Class (philosophy); Limiting","score_opus":0.008418547348810595,"score_gpt":0.2599104188975467,"score_spread":0.2514918715487361,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7123355193","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030626053,0.0010684604,0.95505995,0.0023880142,0.004446344,0.002820299,0.00051909476,0.0005413097,0.0025305003],"genre_scores_gemma":[0.9853275,0.00019766939,0.0092730895,0.0012396943,0.00025664136,0.000072047624,0.00014985791,0.000043235596,0.0034402576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9906805,0.0022401307,0.0022037795,0.0019274956,0.0010008888,0.0019472106],"domain_scores_gemma":[0.99456125,0.0009801326,0.001065317,0.0018573884,0.0010089244,0.00052698667],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022367947,0.0009908663,0.0016009068,0.00043453113,0.00092036143,0.001217743,0.001401626,0.00057949114,0.00020614816],"category_scores_gemma":[0.001119995,0.0009795831,0.00069929217,0.0019392095,0.00014420085,0.0012835313,0.0004911331,0.0007831163,0.00091265247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004617908,0.006226249,0.15720691,0.0011205719,0.010864065,0.0008230977,0.0075428146,0.23781407,0.0025671015,0.418965,0.02309932,0.1291529],"study_design_scores_gemma":[0.014722808,0.00014906825,0.04533734,0.00033087863,0.0005758149,0.000009413285,0.00039982263,0.9328656,0.00047184498,0.0003225074,0.003986919,0.000827982],"about_ca_topic_score_codex":0.001391843,"about_ca_topic_score_gemma":0.00034885205,"teacher_disagreement_score":0.9547014,"about_ca_system_score_codex":0.000592472,"about_ca_system_score_gemma":0.00052041106,"threshold_uncertainty_score":0.99986523},"labels":[],"label_agreement":null},{"id":"W7124145472","doi":"10.65109/fnlo1442","title":"Optimized algorithms for multi-agent routing","year":2008,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Bidding; Routing (electronic design automation); Computation; Domain (mathematical analysis); Robot","score_opus":0.11024992633693528,"score_gpt":0.30752738348700975,"score_spread":0.19727745715007447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124145472","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051902904,0.0008874521,0.98555773,0.0012969538,0.005938681,0.003695099,0.0001671035,0.00063826615,0.0012997037],"genre_scores_gemma":[0.34584433,0.00011168964,0.6354145,0.0007494042,0.0007028078,0.00044418042,0.00004623001,0.00008345184,0.016603438],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9925745,0.00036526617,0.0019667447,0.0020196552,0.0010185824,0.002055228],"domain_scores_gemma":[0.995235,0.00048576223,0.0007915714,0.0018788658,0.0008423368,0.0007664409],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015485022,0.00091738626,0.001301533,0.00025387603,0.0013662531,0.0006330545,0.0027088367,0.00040830192,0.00016893838],"category_scores_gemma":[0.00055847585,0.0008953592,0.00095270015,0.0008324342,0.0002281606,0.0011029865,0.00074162835,0.00037990636,0.00072162534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001461483,0.014358655,0.0037475165,0.0012541515,0.0065122247,0.002523149,0.03369692,0.12646982,0.0073727667,0.08477052,0.12731168,0.5905211],"study_design_scores_gemma":[0.014291747,0.00024498533,0.0005045188,0.00010489679,0.00008312705,0.00017339947,0.00019168302,0.96962106,0.0011801885,0.000018083989,0.012542741,0.0010435785],"about_ca_topic_score_codex":0.000446152,"about_ca_topic_score_gemma":0.000010770967,"teacher_disagreement_score":0.8431512,"about_ca_system_score_codex":0.00044243492,"about_ca_system_score_gemma":0.00057758694,"threshold_uncertainty_score":0.99993384},"labels":[],"label_agreement":null},{"id":"W7124146305","doi":"10.65109/rubf5180","title":"Merging Globally Rigid Formations of Mobile Autonomous Agents","year":2004,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Merge (version control); Network topology; Graph; Multi-agent system; Rigidity (electromagnetism); Autonomous agent","score_opus":0.01594179573447182,"score_gpt":0.26032249347619296,"score_spread":0.24438069774172114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124146305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02239971,0.00056387257,0.92544854,0.0007825532,0.0018180171,0.0014433933,0.00016730813,0.0002949313,0.04708165],"genre_scores_gemma":[0.98688585,0.000033342603,0.011817338,0.0002150483,0.00007276751,0.00009617834,0.000024250896,0.000020152986,0.00083505374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953822,0.00012652534,0.0017681635,0.00072879856,0.0010480097,0.0009463314],"domain_scores_gemma":[0.99675316,0.00006751484,0.00084203883,0.0014938185,0.00046184871,0.00038163955],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069945544,0.00046677468,0.0007063117,0.00025371168,0.0003419215,0.0005065584,0.0025251866,0.00019700547,0.0002781476],"category_scores_gemma":[0.00007098449,0.00047482114,0.00040028818,0.0011825671,0.00014151368,0.0018391678,0.0006413592,0.00020564382,0.00091503013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033539513,0.0022663872,0.0007163609,0.00042121063,0.00081269356,0.000089050016,0.0072597526,0.32329658,0.0041223736,0.59992313,0.0021400426,0.058918864],"study_design_scores_gemma":[0.011272939,0.0010165258,0.004478823,0.0008345876,0.000271516,0.00015618245,0.0013075381,0.90158194,0.016396554,0.0049350965,0.05585224,0.0018960518],"about_ca_topic_score_codex":0.0010586003,"about_ca_topic_score_gemma":0.000068014364,"teacher_disagreement_score":0.9644862,"about_ca_system_score_codex":0.0006713643,"about_ca_system_score_gemma":0.00084383204,"threshold_uncertainty_score":0.99986285},"labels":[],"label_agreement":null},{"id":"W7127358404","doi":"10.1109/ccece64018.2025.11364358","title":"A Multi-Agent Control Approach for Coverage Maximization in Mobile Sensor Networks in the Presence of Obstacles","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Wireless sensor network; Maximization; Convergence (economics); Stability (learning theory); Control (management); Term (time); Control theory (sociology); Utility maximization","score_opus":0.01977037827236438,"score_gpt":0.2586086278069194,"score_spread":0.238838249534555,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127358404","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004034765,0.0028121541,0.9810223,0.00034674333,0.00075970485,0.010329121,0.00013614759,0.000048039292,0.0005110014],"genre_scores_gemma":[0.9811723,0.00016703669,0.015264589,0.00042848111,0.00005340795,0.0022119412,0.00004658504,0.000018872583,0.0006367628],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9942048,0.0013357612,0.0018159105,0.0011361283,0.00056516763,0.00094223814],"domain_scores_gemma":[0.9956688,0.0019034102,0.00056990574,0.0014175992,0.00035359056,0.00008665013],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0027608348,0.0004911017,0.0009578848,0.00040701884,0.0001491444,0.00041459053,0.0022256896,0.00033113043,0.00000954345],"category_scores_gemma":[0.00055066,0.00039305806,0.0002895084,0.0020477262,0.00015907724,0.00052497035,0.00025620408,0.00038805796,0.0000025954646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024181922,0.0017277887,0.010917343,0.00034318425,0.00009972169,0.000010988004,0.0017435666,0.9651506,0.00039241705,0.0047643534,0.0003424594,0.014265778],"study_design_scores_gemma":[0.0100755,0.00014391879,0.011527653,0.00023883305,0.000050432292,0.0000029650007,0.00112375,0.9757708,0.000096539,0.00006156399,0.0005868417,0.00032124628],"about_ca_topic_score_codex":0.00051090645,"about_ca_topic_score_gemma":0.00021787998,"teacher_disagreement_score":0.97713757,"about_ca_system_score_codex":0.00024917905,"about_ca_system_score_gemma":0.00027679792,"threshold_uncertainty_score":0.9998521},"labels":[],"label_agreement":null},{"id":"W7127970258","doi":"10.1109/iccma67641.2025.11369613","title":"GHOST and 3GEA: Task-driven Coalition and Planning Algorithms for Smart Airborne Vehicles","year":2025,"lang":"","type":"article","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"sort; Cluster analysis; Evolutionary algorithm; Task (project management); Convergence (economics); Artificial neural network; Motion planning","score_opus":0.025979615721112757,"score_gpt":0.2846753108584547,"score_spread":0.258695695137342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7127970258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01623982,0.0036196092,0.9704715,0.0047467193,0.00174935,0.0016601053,0.00027554928,0.00019579762,0.0010415717],"genre_scores_gemma":[0.98310024,0.000089731526,0.013641282,0.00074233307,0.00021596144,0.00016836928,0.0000628619,0.0000203171,0.0019588831],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968503,0.00018093044,0.00076336553,0.0011706431,0.00031453153,0.00072024413],"domain_scores_gemma":[0.99798197,0.0006165588,0.0002457964,0.0005712968,0.00032449714,0.00025989758],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00075005746,0.00043809446,0.0006266541,0.00025370903,0.00056790415,0.0010533431,0.0005304861,0.00025617797,0.000007337598],"category_scores_gemma":[0.00018845488,0.0004414511,0.00010949648,0.00045112314,0.00020336383,0.0007604293,0.0005028146,0.00020355552,0.000010936147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044421986,0.00073354994,0.04321921,0.0024223854,0.0015927373,0.00013188426,0.0049151233,0.00091699266,0.006830006,0.1841413,0.04879311,0.7058595],"study_design_scores_gemma":[0.0041443217,0.00023762533,0.028128138,0.00066221075,0.00013855005,0.000019687452,0.000662352,0.94313914,0.0006130056,0.001126098,0.020632738,0.00049612107],"about_ca_topic_score_codex":0.00025741392,"about_ca_topic_score_gemma":0.000028727964,"teacher_disagreement_score":0.9668604,"about_ca_system_score_codex":0.00010382516,"about_ca_system_score_gemma":0.00016995569,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W7132862027","doi":"","title":"Hoberman&apos;s Twiddlestix as a paradigm for multi-vehicle formation control","year":2005,"lang":"","type":"dissertation","venue":"TSpace","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Library and Archives Canada","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Nonlinear system; Graph theory; Nonlinear control; Nonholonomic system; Rigidity (electromagnetism); Graph","score_opus":0.06278451192509052,"score_gpt":0.37675276942284736,"score_spread":0.3139682574977568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132862027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039352648,0.003205767,0.9381017,0.0026777817,0.004197893,0.0094148135,0.00034898252,0.000662834,0.0020375506],"genre_scores_gemma":[0.9588597,0.00012688494,0.010317964,0.0008668278,0.0011273103,0.002276186,0.0019113175,0.00019234826,0.024321474],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9920596,0.0005011451,0.0021024966,0.0019474553,0.001396431,0.001992905],"domain_scores_gemma":[0.99312216,0.0006548061,0.0024618285,0.0019752085,0.0010136077,0.00077241677],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0012645496,0.001511874,0.0017412754,0.00054849277,0.0009349377,0.0014634685,0.0026540062,0.0011368869,0.00012202947],"category_scores_gemma":[0.00056440564,0.001674473,0.00096554443,0.0008338287,0.00011162625,0.0022337574,0.00012211877,0.0008074419,0.0023217713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008285353,0.008244118,0.00090636534,0.009362067,0.0048487526,0.0003968603,0.31685007,0.03299007,0.052277807,0.20957199,0.026857018,0.3294095],"study_design_scores_gemma":[0.015951864,0.00057005364,0.001636296,0.00079741335,0.00051292294,0.00006828489,0.004098523,0.9351483,0.0028377715,0.00020828524,0.036362153,0.0018081563],"about_ca_topic_score_codex":0.00079374213,"about_ca_topic_score_gemma":0.0010450766,"teacher_disagreement_score":0.9277838,"about_ca_system_score_codex":0.00083276315,"about_ca_system_score_gemma":0.0008293185,"threshold_uncertainty_score":0.999763},"labels":[],"label_agreement":null},{"id":"W7133297058","doi":"10.65521/ijmer.v13i1.98","title":"Robotic Swarm Intelligence: Coordination and Collaboration in Multi-Robot Systems","year":2025,"lang":"","type":"article","venue":"International Journal on Mechanical Engineering and Robotics","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Greenfield Research (Canada)","funders":"","keywords":"Swarm robotics; Swarm behaviour; Adaptability; Task (project management); Swarm intelligence; Field (mathematics); Key (lock); Robotics","score_opus":0.017866123872044008,"score_gpt":0.28775389575911015,"score_spread":0.26988777188706614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7133297058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020411073,0.0019504506,0.9756219,0.006310923,0.013556456,0.000422625,0.000011826981,0.000060596514,0.00002416386],"genre_scores_gemma":[0.98544097,0.0010379802,0.012671489,0.0001556136,0.00027867197,0.000016118074,0.000007930691,0.000023401093,0.00036784358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99666077,0.00020667572,0.0013053555,0.00059654476,0.0007765309,0.00045411717],"domain_scores_gemma":[0.99788755,0.00044270288,0.00037145213,0.00025753654,0.000757644,0.00028311939],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012386157,0.00041940843,0.0005676773,0.0009337538,0.00015929148,0.0017999844,0.0008128751,0.00033753304,0.0000025865745],"category_scores_gemma":[0.0009722643,0.0004206978,0.00009114,0.00072895456,0.0000430979,0.00057676877,0.0002863834,0.00095113507,0.000009642297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040468618,0.00020680243,0.000074548756,0.00007292607,0.00018064365,0.00012088907,0.0001202686,0.8260034,0.00078357576,0.16561,0.00003446236,0.0067520645],"study_design_scores_gemma":[0.001610095,0.00018433278,0.0005900892,0.0018641119,0.000049764436,0.00019576968,0.00017104087,0.9939802,0.00023537663,0.00038578527,0.0003898203,0.00034359333],"about_ca_topic_score_codex":0.00003319265,"about_ca_topic_score_gemma":0.000010872284,"teacher_disagreement_score":0.98339987,"about_ca_system_score_codex":0.0006825714,"about_ca_system_score_gemma":0.00021455184,"threshold_uncertainty_score":0.99982446},"labels":[],"label_agreement":null},{"id":"W7161272216","doi":"10.70675/22a4d0afz5be5z4918z94bbz283fb378892a","title":"Computation with partial information and network dynamics : distributed coordination, forbidden structures, and online routing","year":2025,"lang":"","type":"dissertation","venue":"","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Routing algorithm; Routing (electronic design automation); Network routing; Network partition","score_opus":0.007715046010289469,"score_gpt":0.23957283439158428,"score_spread":0.2318577883812948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161272216","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046939705,0.0003069339,0.9469947,0.00073251914,0.0012972116,0.00199988,0.0012012098,0.00024337677,0.0002844457],"genre_scores_gemma":[0.9383008,0.000056644094,0.010359088,0.00013368434,0.00020188157,0.00006247255,0.050577838,0.000025347492,0.0002822624],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99535257,0.00027697688,0.0017673259,0.00096258364,0.0008373402,0.0008032156],"domain_scores_gemma":[0.99571055,0.00039511474,0.0017078052,0.00048113917,0.0014182271,0.00028715294],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000621926,0.0008715187,0.000985045,0.00034168098,0.0009499188,0.0022424627,0.0005674288,0.0005982814,0.0000075359944],"category_scores_gemma":[0.00024281965,0.00081971136,0.000088871435,0.0013328751,0.00010482696,0.0025813924,0.00027805613,0.0005938506,0.0000029380105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009412954,0.00024017265,0.026506618,0.0024078574,0.0014271688,0.000025145648,0.0038575192,0.17234105,0.000015891448,0.29470977,0.0021967222,0.4953308],"study_design_scores_gemma":[0.0029197335,0.00021395452,0.043195516,0.0007813636,0.00028068977,0.000032308777,0.0017757292,0.94818956,0.0000083990735,0.001147708,0.0006755419,0.0007795111],"about_ca_topic_score_codex":0.00096606737,"about_ca_topic_score_gemma":0.0032472373,"teacher_disagreement_score":0.9366356,"about_ca_system_score_codex":0.00038479324,"about_ca_system_score_gemma":0.000613483,"threshold_uncertainty_score":0.99942535},"labels":[],"label_agreement":null},{"id":"W7161524478","doi":"","title":"Calcul avec informations partielles et dynamique de réseau : coordination distribuée, structures interdites et routage en ligne","year":2025,"lang":"en","type":"article","venue":"theses.fr (ABES)","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Rail transportation; Video recording; Agrégation","score_opus":0.006559568636204145,"score_gpt":0.2794026559045102,"score_spread":0.27284308726830603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7161524478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027487453,0.0001064636,0.9424815,0.0068774545,0.00049840275,0.00059244654,0.00024492346,0.00048350592,0.021227844],"genre_scores_gemma":[0.9966155,0.00001979584,0.0019386105,0.0007726048,0.000048399008,0.00013550214,0.00020991643,0.000014962734,0.0002446615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997656,0.0005136233,0.00059634546,0.0003812897,0.00035293444,0.00049983175],"domain_scores_gemma":[0.99790585,0.0007221086,0.00023727209,0.000805663,0.00018940344,0.0001397189],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009902446,0.00030884278,0.0003614672,0.00025003427,0.00019214427,0.00065268733,0.0013054216,0.00017815705,0.00002962584],"category_scores_gemma":[0.00070681196,0.00027796396,0.00015051325,0.0006071331,0.00007182997,0.0011828839,0.00051794515,0.00033220559,0.000068144975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012949391,0.00009813622,0.0018022443,0.000077096374,0.00013270853,0.000012417396,0.00871604,0.0031273535,0.0012899225,0.9732159,0.0017827286,0.00973254],"study_design_scores_gemma":[0.00261398,0.00016637628,0.055727776,0.0005681075,0.00012036192,0.000054934106,0.004281703,0.79188967,0.009779064,0.043775585,0.08988314,0.0011393117],"about_ca_topic_score_codex":0.0009810751,"about_ca_topic_score_gemma":0.0006431403,"teacher_disagreement_score":0.9691281,"about_ca_system_score_codex":0.00036138744,"about_ca_system_score_gemma":0.00026666585,"threshold_uncertainty_score":0.9999673},"labels":[],"label_agreement":null}]}