{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":347,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":347,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"629616848fa9","filters":{"venue":"IEEE Transactions on Automatic Control"}},"results":[{"id":"W2054091988","doi":"10.1109/tac.2009.2019800","title":"Cubature Kalman Filters","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":3320,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Nonlinear system; Kalman filter; Mathematics; Moment (physics); Filter (signal processing); Algorithm; State vector; Dimension (graph theory); Applied mathematics; Computer science; Statistics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.008948602436733833,"gpt":0.2293294026373995,"spread":0.2203808002006657,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001717734,0.0002100685,0.0002481492,0.0001639967,0.0002624995,0.0001790935,0.000678474,0.0001182487,0.0001841263],"category_scores_gemma":[0.000006850715,0.0001846623,0.0001598953,0.000360793,0.00002884894,0.0003301523,9.271926e-7,0.0002692897,0.000246812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003874015,"about_ca_system_score_gemma":0.00003350031,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005788248,"about_ca_topic_score_gemma":0.000004196485,"domain_scores_codex":[0.9985207,0.0000916194,0.0003096809,0.0003833729,0.0003388534,0.0003557784],"domain_scores_gemma":[0.9986558,0.0002261434,0.0000812958,0.0008408217,0.00004550343,0.0001504439],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002074098,0.0003382849,0.000002778457,0.000009950234,0.00005231341,0.00004196285,0.0004103282,0.02790864,0.001173225,0.002290284,0.009346646,0.9584048],"study_design_scores_gemma":[0.001520223,0.0002805935,0.0007230513,0.00007131273,0.00003616547,0.00005241902,0.00001421695,0.9908077,0.001212202,0.001183797,0.003769378,0.0003289391],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002136628,0.00004446617,0.9907846,0.00352873,0.00119585,0.0002409255,0.00001855971,0.001067918,0.0009823359],"genre_scores_gemma":[0.9804423,0.00001110052,0.01567578,0.003389806,0.00006305944,0.00001813464,0.000001668066,0.000009992561,0.0003881058],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9783058,"threshold_uncertainty_score":0.753031,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Digraph; Control theory (sociology); Directed graph; Graph; Control (management); Computer science; Point (geometry); Key (lock); Strongly connected component; Mathematics; Theoretical computer science; Discrete mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01122485334909713,"gpt":0.2459037759734588,"spread":0.2346789226243617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003752739,0.000223545,0.0004524523,0.0003162271,0.0002464482,0.0001067899,0.0003983351,0.0001128743,0.00001745701],"category_scores_gemma":[0.00002757023,0.000209461,0.0002195761,0.0002933493,0.0001032541,0.0006367463,0.000001704078,0.0001120106,0.00001624549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007536608,"about_ca_system_score_gemma":0.0000571587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535991,"about_ca_topic_score_gemma":0.00003686065,"domain_scores_codex":[0.9981113,0.0001549552,0.0007337983,0.0003209572,0.0003426533,0.0003363022],"domain_scores_gemma":[0.9980181,0.0008831425,0.0002800404,0.0004884541,0.000181619,0.0001485898],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005188778,0.005315901,0.0001445095,0.001044714,0.001815008,0.00001377652,0.00409132,0.2972961,0.1083948,0.1053831,0.001443904,0.474538],"study_design_scores_gemma":[0.006785071,0.0002201954,0.0007740923,0.0000644853,0.0001305819,0.00002246528,0.00007148068,0.988173,0.002917636,0.0003641142,0.0002812823,0.0001956053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03032381,0.00009001706,0.9637592,0.003246486,0.000285296,0.001476212,0.0004781619,0.0002941291,0.00004673466],"genre_scores_gemma":[0.9965372,0.000007274411,0.002520462,0.0003787587,0.00003119042,0.0004768083,0.000008126442,0.00001385787,0.00002631988],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9662134,"threshold_uncertainty_score":0.854157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983491872","doi":"10.1109/tac.2005.852550","title":"A new method for stabilization of networked control systems with random delays","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":859,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Linear matrix inequality; Networked control system; Actuator; Controller (irrigation); Linear system; Full state feedback; State (computer science); Control system; Markov chain; Computer science; Markov process; Control (management); Mathematics; Mathematical optimization; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.008763859143975197,"gpt":0.2322011570665786,"spread":0.2234372979226034,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006262713,0.0002974719,0.0008404501,0.0001551527,0.00009443945,0.0000495774,0.0001646879,0.0001441116,0.00007686124],"category_scores_gemma":[0.00002738284,0.0002489847,0.0002362645,0.0002371808,0.00002892672,0.0001766148,1.96169e-7,0.0001151932,0.000009198493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001557436,"about_ca_system_score_gemma":0.00009888084,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101881,"about_ca_topic_score_gemma":0.0002475128,"domain_scores_codex":[0.998117,0.0001775114,0.0007983027,0.0002470223,0.0003044097,0.0003557818],"domain_scores_gemma":[0.9974432,0.001618507,0.0001523375,0.0003970701,0.000242572,0.0001463198],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007558074,0.00006552519,0.000005277517,0.0002366642,0.0005036819,3.274534e-7,0.0002518951,0.9292269,0.001070865,0.00008025538,0.0001923032,0.06761046],"study_design_scores_gemma":[0.0220433,0.000302576,0.00001532937,0.0001654385,0.0004623049,0.000007097124,0.0001265309,0.9748253,0.0005787676,0.00002879721,0.001198934,0.0002456128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001924228,0.0004416345,0.9930342,0.000162444,0.0006755486,0.003001368,0.0001010012,0.0005042826,0.0001553261],"genre_scores_gemma":[0.9866009,0.000006329696,0.01208577,0.00006412833,0.000217052,0.0008499095,0.000002450582,0.00005914531,0.00011429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9846767,"threshold_uncertainty_score":0.9999962,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2114871659","doi":"10.1109/tac.2004.825639","title":"Local Control Strategies for Groups of Mobile Autonomous Agents","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":859,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Convergence (economics); Focus (optics); Control (management); Computer science; Mathematical optimization; Mobile robot; Point (geometry); Autonomous agent; Control theory (sociology); Distributed computing; Mathematics; Artificial intelligence; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01522188186033223,"gpt":0.2627341175685133,"spread":0.2475122357081811,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000297628,0.000186647,0.0003628509,0.0001947562,0.0001714272,0.0001272071,0.0004788639,0.00008846878,0.0000869534],"category_scores_gemma":[0.000005949319,0.0001721925,0.0002057532,0.0002585241,0.0001043985,0.0004656477,0.000001298494,0.0001084062,0.00003832674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001108628,"about_ca_system_score_gemma":0.0003619025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003698292,"about_ca_topic_score_gemma":0.00002917006,"domain_scores_codex":[0.9984767,0.00007546978,0.0005035077,0.0003017498,0.0003062007,0.0003363653],"domain_scores_gemma":[0.9988751,0.00025758,0.0001433453,0.000436611,0.0001585797,0.0001287562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002674744,0.0004116693,5.52843e-7,0.00006308474,0.00009969186,0.000002562321,0.0007287445,0.9369456,0.0005214568,0.009512327,0.00002903053,0.05165857],"study_design_scores_gemma":[0.007054112,0.0006960113,0.00003124178,0.0000435248,0.00003922472,0.000007301207,0.0001664399,0.9862342,0.001408959,0.004036135,0.000112418,0.0001703923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002146554,0.00002252074,0.9948457,0.0005343193,0.0003435865,0.001520586,0.0000495681,0.0003523422,0.0001847738],"genre_scores_gemma":[0.9789946,0.000004899899,0.01982262,0.0004224174,0.00001125906,0.0006491823,0.000001242161,0.00001635852,0.00007743846],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.976848,"threshold_uncertainty_score":0.7021806,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164642931","doi":"10.1109/tac.2013.2278132","title":"Distributed Continuous-Time Convex Optimization on Weight-Balanced Digraphs","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":831,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Digraph; Lipschitz continuity; Directed graph; Mathematics; Convex optimization; Convex function; Strongly connected component; Regular polygon; Mathematical optimization; Discrete mathematics; Computer science; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.005451101247933281,"gpt":0.20317861172143,"spread":0.1977275104734967,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005713417,0.0005051672,0.0008469462,0.0003299791,0.0003618677,0.0003702375,0.001030218,0.0002142169,0.000214433],"category_scores_gemma":[0.00007112822,0.0004658659,0.0003512891,0.0006475498,0.0000859503,0.000463917,0.000003217466,0.0002664182,0.0009061027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001833604,"about_ca_system_score_gemma":0.00007665135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002518528,"about_ca_topic_score_gemma":0.000005130911,"domain_scores_codex":[0.9964275,0.0005133633,0.0008569338,0.0007845024,0.0007403471,0.0006773723],"domain_scores_gemma":[0.9968189,0.0009297953,0.0003952665,0.00133909,0.0002179105,0.0002990642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002253133,0.001742376,0.00006653147,0.0001015598,0.0008476524,0.00003144494,0.0003381153,0.8625755,0.00567699,0.006887669,0.0025342,0.1189727],"study_design_scores_gemma":[0.006345206,0.0004001902,0.000307202,0.0001269171,0.00009633435,0.00001320971,0.000009069341,0.9897393,0.001522132,0.0001422375,0.0008251177,0.0004730806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001731746,0.00001454011,0.9913881,0.001608382,0.00130916,0.001212858,0.0002439019,0.001720615,0.0007706553],"genre_scores_gemma":[0.994702,0.000003622169,0.003644902,0.0008243907,0.00007132551,0.0003496151,0.00003598589,0.00004113686,0.0003270549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9929702,"threshold_uncertainty_score":0.9998718,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111638077","doi":"10.1109/tac.2004.837589","title":"Formations of Vehicles in Cyclic Pursuit","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":669,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Nonholonomic system; Constraint (computer-aided design); Focus (optics); Modulo; Controller (irrigation); Stability (learning theory); Simple (philosophy); Control theory (sociology); Computer science; Constant (computer programming); Principal (computer security); Mathematics; Mathematical optimization; Control (management); Mobile robot; Artificial intelligence; Robot; Geometry; Discrete mathematics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01299818626875267,"gpt":0.2427849811382025,"spread":0.2297867948694498,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002770109,0.0001351685,0.0002611135,0.0003539599,0.00008323038,0.00004865111,0.0005391008,0.00006664175,0.00001158643],"category_scores_gemma":[0.00001445535,0.0001312658,0.00009576637,0.000526845,0.00004403073,0.0003998791,0.000001429167,0.0001404529,0.00008513692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001063361,"about_ca_system_score_gemma":0.00011382,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007307859,"about_ca_topic_score_gemma":0.00001559419,"domain_scores_codex":[0.9986934,0.00006053808,0.0004642911,0.000195627,0.0003310608,0.0002550551],"domain_scores_gemma":[0.9990771,0.0002310213,0.000120364,0.0004610427,0.0000399876,0.00007045694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008903337,0.0006741046,0.00003398216,0.00007197534,0.00007022699,0.00002588687,0.002666913,0.8975125,0.00603464,0.002491022,0.00002172406,0.09038811],"study_design_scores_gemma":[0.003302717,0.0001656317,0.004100817,0.000201216,0.0000232139,0.00003270702,0.00005309568,0.9802883,0.009031806,0.002597811,0.00001336532,0.0001893143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02735239,0.00001917939,0.9702256,0.001218186,0.0003864679,0.0003220428,0.000009897282,0.0002457305,0.0002204705],"genre_scores_gemma":[0.9445278,0.0000025729,0.05521159,0.0001332912,0.000005334744,0.00007074891,3.610217e-7,0.000007800276,0.00004047693],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9171754,"threshold_uncertainty_score":0.5352864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2132917374","doi":"10.1109/tac.2009.2020638","title":"Output Feedback Stabilization of Networked Control Systems With Random Delays Modeled by Markov Chains","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":585,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Control theory (sociology); Controller (irrigation); Markov chain; Networked control system; Linear matrix inequality; Linear system; Computer science; Markov process; Stability (learning theory); Actuator; Discrete time and continuous time; Output feedback; Mathematics; Control (management); Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.006103999717985769,"gpt":0.186611110176376,"spread":0.1805071104583902,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004826792,0.0004270465,0.001054427,0.0001725644,0.0001295769,0.00007235276,0.0002263212,0.0002020255,0.00004833279],"category_scores_gemma":[0.00001846946,0.0003631737,0.0002277951,0.0003385893,0.00006833793,0.0002112559,2.558248e-7,0.0002049374,0.00001260708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001973328,"about_ca_system_score_gemma":0.00005943136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005733771,"about_ca_topic_score_gemma":0.0000498286,"domain_scores_codex":[0.9974813,0.0002490632,0.0009608785,0.0003263841,0.0004993473,0.0004830112],"domain_scores_gemma":[0.9982388,0.0005761992,0.0001915962,0.0005503502,0.0002738458,0.0001692017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008422252,0.0002075854,0.00001254506,0.0001668484,0.0004196872,0.000001924566,0.0002371087,0.9791026,0.001622231,0.00003243983,0.0003084813,0.01704634],"study_design_scores_gemma":[0.01851605,0.0004702201,0.00006659666,0.0002221693,0.0003213113,0.000007089665,0.0001644442,0.9795194,0.000233154,0.00001852764,0.0001118014,0.0003492154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04384131,0.0005922223,0.9512727,0.0001511203,0.0006106648,0.002232374,0.0002046547,0.0006802725,0.0004147329],"genre_scores_gemma":[0.9991006,0.00002406239,0.0001359032,0.0001046745,0.00007560304,0.000336522,0.000008361437,0.00005414605,0.0001601591],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9552593,"threshold_uncertainty_score":0.999882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2138844572","doi":"10.1109/tac.2005.852558","title":"Gradient based iterative algorithms for solving a class of matrix equations","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":497,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Iterative method; Sylvester matrix; Matrix (chemical analysis); Mathematics; Algorithm; Convergence (economics); Rate of convergence; Matrix-free methods; Matrix splitting; Convergent matrix; Mathematical optimization; Applied mathematics; Local convergence; Computer science; Sparse matrix; State-transition matrix; Symmetric matrix; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01600660647456744,"gpt":0.2689512016773292,"spread":0.2529445952027617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985145,0.0001996098,0.0003292884,0.0002782435,0.00026568,0.00009038937,0.0004316737,0.00007005017,0.0001146914],"category_scores_gemma":[0.000028324,0.0001834939,0.0002537943,0.0003367196,0.00005490965,0.0003617307,0.00000137915,0.0001086859,0.00003427598],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008722179,"about_ca_system_score_gemma":0.0001233877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005255331,"about_ca_topic_score_gemma":0.00001254588,"domain_scores_codex":[0.9984812,0.0001053146,0.0005184205,0.0003145563,0.0002765841,0.0003038946],"domain_scores_gemma":[0.997688,0.001392524,0.0001925991,0.0004742065,0.00015089,0.0001017785],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007280122,0.001300607,0.000001060528,0.0001692738,0.0002705819,0.000004170677,0.002397968,0.2919021,0.005367031,0.04484842,0.0001561519,0.6535099],"study_design_scores_gemma":[0.002385236,0.0002594252,0.000006291434,0.0000626293,0.00006260855,0.000003967612,0.0000295335,0.981966,0.01339529,0.001342477,0.0003039755,0.0001825803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001054756,0.00003021209,0.9951734,0.001992032,0.0004144044,0.0008734322,0.00009674218,0.000267713,0.00009733752],"genre_scores_gemma":[0.8454934,0.000001027653,0.1535838,0.0002863035,0.00004919372,0.0003108063,0.000001446285,0.00001307,0.000260949],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8444387,"threshold_uncertainty_score":0.7482666,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2140902856","doi":"10.1109/tac.2008.2007867","title":"Analysis and Synthesis of Markov Jump Linear Systems With Time-Varying Delays and Partially Known Transition Probabilities","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":489,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Stochastic matrix; Mathematics; Markov process; Applied mathematics; Discrete time and continuous time; Monotonic function; Linear matrix inequality; Stability (learning theory); Markov model; Controller (irrigation); Matrix (chemical analysis); Discrete mathematics; Computer science; Mathematical optimization; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.007018494360462979,"gpt":0.1839381549875477,"spread":0.1769196606270848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002674084,0.0002257833,0.0006970923,0.0002648264,0.0001433299,0.00003181021,0.00006304543,0.00009907183,0.00003886389],"category_scores_gemma":[0.00001019931,0.0001935344,0.0001318863,0.0003165083,0.0001471613,0.0001570751,3.269737e-7,0.00009528943,0.000003752406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004969916,"about_ca_system_score_gemma":0.00003259986,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001500175,"about_ca_topic_score_gemma":0.00008541226,"domain_scores_codex":[0.9986814,0.0001356899,0.0005043749,0.0002285708,0.0002378585,0.0002121548],"domain_scores_gemma":[0.9987958,0.0007052378,0.0000709804,0.0002548976,0.00007909927,0.00009397855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003006637,0.0002001117,0.0003769616,0.001277071,0.003370897,0.00001220581,0.002930739,0.9698519,0.003294394,0.000009792851,0.000005527129,0.01836973],"study_design_scores_gemma":[0.001286117,0.0001528289,0.00072327,0.000170165,0.001302959,0.0000422046,0.0001981839,0.9950595,0.0008495922,0.000004302526,0.000007633155,0.0002031961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4457318,0.0002613993,0.5529054,0.00006000949,0.00005793242,0.0005673949,0.00007320558,0.0002287167,0.0001141347],"genre_scores_gemma":[0.9990696,0.00003984537,0.0005228232,0.00001052357,0.0000204303,0.0002808674,0.000001195838,0.00002424409,0.00003044004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5533378,"threshold_uncertainty_score":0.7892105,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113837300","doi":"10.1109/tac.2007.900839","title":"Design of Networked Control Systems With Packet Dropouts","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":484,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Network packet; Actuator; Markov chain; Stability (learning theory); Networked control system; Controller (irrigation); Computer science; Markov process; Control system; Packet loss; Control (management); Mathematics; Engineering; Computer network; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01037198795385123,"gpt":0.2055038603036029,"spread":0.1951318723497517,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001002097,0.0003290079,0.0007579462,0.0002006187,0.00009783149,0.00004394527,0.0002034327,0.000163466,0.00006752666],"category_scores_gemma":[0.000008323187,0.0002721346,0.0001454457,0.0003082585,0.00009366399,0.0001243424,2.134651e-7,0.0001949287,0.00003528746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001509439,"about_ca_system_score_gemma":0.0000542362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005815893,"about_ca_topic_score_gemma":0.00005019836,"domain_scores_codex":[0.9978471,0.0001707557,0.0008030524,0.0002352497,0.0004376485,0.0005061328],"domain_scores_gemma":[0.9977388,0.001340267,0.0001396454,0.0004905773,0.0001288388,0.000161847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004089951,0.0001065773,0.00002844271,0.0001856689,0.0005514678,0.00001384219,0.0002633272,0.9822685,0.002841231,0.00003317368,0.00005307051,0.01324568],"study_design_scores_gemma":[0.006118098,0.0003952659,0.0001413481,0.0002312962,0.0002495098,0.00002736011,0.0002844756,0.9914818,0.000687333,0.00001558028,0.00007784562,0.0002900732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01509483,0.0003000446,0.9809625,0.00004358621,0.0008886966,0.001640677,0.00003522157,0.0006694281,0.0003650485],"genre_scores_gemma":[0.9990538,0.000006145503,0.0004804032,0.00005201999,0.00007833174,0.0002017333,7.26339e-7,0.00005776438,0.00006905675],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.983959,"threshold_uncertainty_score":0.9999731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1506185406","doi":"10.1109/tac.2002.805670","title":"Robust H∞ control for uncertain stochastic systems with state delay","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":435,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Control theory (sociology); Robust control; Mathematics; Linear matrix inequality; State (computer science); Norm (philosophy); Full state feedback; Exponential stability; Stability theory; Robustness (evolution); Bounded function; Controller (irrigation); Mathematical optimization; Control system; Computer science; Control (management); Engineering; Nonlinear system; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01890106536171499,"gpt":0.2019924924407062,"spread":0.1830914270789912,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004682899,0.0004365687,0.000745771,0.0002416336,0.0002194338,0.0001278925,0.0002275923,0.0001466293,0.000128303],"category_scores_gemma":[0.00001693793,0.0003699756,0.0002208339,0.0002591739,0.00008062975,0.0001779999,2.426172e-7,0.0002212667,0.00008985593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000276938,"about_ca_system_score_gemma":0.00003002566,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006598241,"about_ca_topic_score_gemma":0.0001555029,"domain_scores_codex":[0.9977227,0.00009658892,0.0007235582,0.0003586513,0.0004212776,0.0006772644],"domain_scores_gemma":[0.9975629,0.001442163,0.000110362,0.0005015542,0.000161922,0.0002210424],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001798812,0.0001149622,0.000002838416,0.0002539021,0.0005546628,0.000009861932,0.0003406501,0.9816859,0.0002290632,0.00003382832,0.0001602349,0.01643416],"study_design_scores_gemma":[0.008919845,0.0004395301,0.00001620312,0.0001823083,0.0002913458,0.0000453948,0.0002037279,0.9891601,0.00004068774,0.00002281435,0.0002518127,0.0004261927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006819784,0.0004334001,0.9870143,0.0001527567,0.001066298,0.002951411,0.0003017025,0.001051994,0.0002083619],"genre_scores_gemma":[0.9972365,0.000004475337,0.0004196346,0.0001271937,0.00009088196,0.001652111,0.000001798019,0.0000943006,0.0003730559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9904168,"threshold_uncertainty_score":0.9998752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142185403","doi":"10.1109/tac.2008.930190","title":"Stabilization of Networked Control Systems With a New Delay Characterization","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":367,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Inverted pendulum; Control theory (sociology); Networked control system; Control system; Stability (learning theory); Computer science; Controller (irrigation); Control engineering; Exponential stability; Control (management); Engineering; Nonlinear system; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009897777472994041,"gpt":0.1874785561127315,"spread":0.1775807786397375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000185659,0.0002761749,0.0006182905,0.0001674992,0.0001210494,0.00003003908,0.0001413138,0.0001337305,0.00008550699],"category_scores_gemma":[0.000007975074,0.0002403762,0.0001250017,0.0003493804,0.0000666524,0.0002274869,2.121437e-7,0.000126521,0.00001765839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001247499,"about_ca_system_score_gemma":0.0001012275,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009536218,"about_ca_topic_score_gemma":0.00005311301,"domain_scores_codex":[0.998301,0.0001125553,0.0006934088,0.0002198223,0.0003773502,0.0002958305],"domain_scores_gemma":[0.9988722,0.0002955312,0.0001580988,0.0003930318,0.0001409733,0.0001401371],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000196887,0.0000946234,0.0001817396,0.0001619355,0.0003121816,0.00000465186,0.0005262436,0.9838829,0.007033829,0.00002399761,0.00002581411,0.007555188],"study_design_scores_gemma":[0.005185089,0.0002514572,0.00106313,0.0001506484,0.0001594594,0.00004833225,0.00006281769,0.9922535,0.0004498069,0.000004631873,0.0001311605,0.0002399395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1897285,0.00009929912,0.8078293,0.00005129618,0.0005517505,0.001101962,0.00005959345,0.000484866,0.000093397],"genre_scores_gemma":[0.9993441,0.00001966544,0.00009882257,0.00004556887,0.00009157633,0.0002228842,0.000007531151,0.00005139801,0.0001184243],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8096156,"threshold_uncertainty_score":0.9802256,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2057794519","doi":"10.1109/tac.2007.904451","title":"On the Hybrid Optimal Control Problem: Theory and Algorithms","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":345,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Controllability; Optimal control; Bounded function; Hamiltonian (control theory); Mathematical optimization; Convergence (economics); Hamiltonian system; Maximum principle; Variational principle; Control theory (sociology); Computer science; Applied mathematics; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.006890618028156842,"gpt":0.2236150882270187,"spread":0.2167244701988618,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742219,0.0001832574,0.0002337984,0.0002010964,0.000391352,0.00017958,0.0003508071,0.00004616543,0.0002659308],"category_scores_gemma":[0.00003640351,0.0001236911,0.0001359331,0.0003175506,0.00006630919,0.0002072121,0.000001521106,0.0001608128,0.00008836105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004615068,"about_ca_system_score_gemma":0.0000495225,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009343193,"about_ca_topic_score_gemma":0.000005890211,"domain_scores_codex":[0.998417,0.0002701796,0.0003602685,0.0003099673,0.0003790198,0.0002636156],"domain_scores_gemma":[0.9966677,0.002608704,0.0001225638,0.0003889392,0.00009968311,0.0001124192],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002106877,0.0007659719,0.000007991212,0.00002349986,0.0008547765,0.00002684234,0.0009304974,0.3199708,0.0003818848,0.3803567,0.000449288,0.2960211],"study_design_scores_gemma":[0.001628824,0.0001295028,0.0001987013,0.00001699155,0.0000893892,0.0000184786,0.00002778047,0.9921173,0.0003826057,0.005147069,0.00009036675,0.0001529595],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001591188,0.00001729983,0.9919713,0.004953875,0.0001795872,0.0004674484,0.00001749192,0.000233175,0.0005686927],"genre_scores_gemma":[0.9819999,0.000005067064,0.01397804,0.00346606,0.00002636847,0.00006689169,6.575763e-7,0.000011118,0.0004459076],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9804087,"threshold_uncertainty_score":0.5043977,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2097020018","doi":"10.1109/tac.2008.927789","title":"Unit Quaternion-Based Output Feedback for the Attitude Tracking Problem","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":326,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University","funders":"","keywords":"Quaternion; Control theory (sociology); Angular velocity; Attitude control; Bounded function; Tracking error; Tracking (education); Mathematics; Rigid body; Computer science; Control (management); Control engineering; Mathematical analysis; Artificial intelligence; Physics; Engineering; Classical mechanics","retraction":null,"screen_n_in":null,"score":{"opus":0.03470810766400451,"gpt":0.245384415023302,"spread":0.2106763073592975,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002805012,0.0003026076,0.0003999653,0.0001382925,0.0003650319,0.00005357315,0.0002783803,0.0001110865,0.00006771964],"category_scores_gemma":[0.00001420912,0.0002328149,0.0002868563,0.0001650823,0.00007655518,0.0001254321,3.602954e-7,0.0002132985,0.000132026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001166037,"about_ca_system_score_gemma":0.00007428439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003067154,"about_ca_topic_score_gemma":0.0001020146,"domain_scores_codex":[0.9985161,0.00007168146,0.000503401,0.0002199847,0.0002998029,0.0003890637],"domain_scores_gemma":[0.9980381,0.00125479,0.00008273082,0.0004045573,0.000124161,0.00009570719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006446894,0.0001219484,0.00003964625,0.0001515958,0.0004357513,0.000009964272,0.0003296855,0.9434549,0.001026191,0.00001533493,0.0003376027,0.05401298],"study_design_scores_gemma":[0.003809674,0.0001178086,0.0009304536,0.0001035175,0.0001541,0.00002349419,0.00004766858,0.9908264,0.0007835028,0.00000967889,0.00293438,0.0002593136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01137778,0.0001879525,0.9841161,0.0005673011,0.0007723999,0.001818192,0.0001192424,0.0009057894,0.0001352442],"genre_scores_gemma":[0.9962944,0.000009160683,0.002039535,0.0001863207,0.0001427257,0.0007599408,0.00000269291,0.00008922011,0.0004760055],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9849166,"threshold_uncertainty_score":0.9493915,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2611964096","doi":"10.1109/tac.2018.2833140","title":"A Passivity-Based Approach to Nash Equilibrium Seeking Over Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":313,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Nash equilibrium; Monotonic function; Property (philosophy); Best response; Exploit; Game theory; Complete information; Dynamics (music); Equilibrium selection","retraction":null,"screen_n_in":null,"score":{"opus":0.01449515289141766,"gpt":0.2396485008260965,"spread":0.2251533479346789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006507309,0.0004090089,0.0005683146,0.0003403097,0.00031028,0.0004821761,0.001164813,0.0001774503,0.00006478932],"category_scores_gemma":[0.00002649762,0.0003904972,0.0002933205,0.0009641192,0.00008578361,0.000438937,0.000006179851,0.0002488453,0.0003400678],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002321575,"about_ca_system_score_gemma":0.0001586684,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005686747,"about_ca_topic_score_gemma":0.00002866062,"domain_scores_codex":[0.9967302,0.0003431151,0.0006430148,0.0007995789,0.0006777518,0.0008063249],"domain_scores_gemma":[0.9974212,0.0004425502,0.0002059215,0.001377547,0.0001806069,0.0003721572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001990492,0.002246753,0.00008092213,0.0001665386,0.0007138778,0.00003655774,0.001097967,0.7902448,0.01382815,0.001742066,0.003949217,0.1856942],"study_design_scores_gemma":[0.003207617,0.0002484139,0.0004183644,0.00009895881,0.00006659349,0.0000115448,0.00001195161,0.9940962,0.0006175801,0.00002942829,0.0007864607,0.0004069234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00332062,0.0000137547,0.9902861,0.0008660582,0.00185884,0.001368863,0.00003831042,0.00125811,0.0009894182],"genre_scores_gemma":[0.9865296,1.675536e-7,0.01031292,0.00220052,0.0002176977,0.0005093645,0.000002573759,0.0000406484,0.000186521],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.983209,"threshold_uncertainty_score":0.9998547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112893311","doi":"10.1109/9.975476","title":"Robust H/sub ∞/ control of discrete-time Markovian jump linear systems with mode-dependent time-delays","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":295,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Control theory (sociology); Linear matrix inequality; Linear system; Discrete time and continuous time; Mathematics; Markov process; Norm (philosophy); Stability (learning theory); Jump; Mode (computer interface); Robust control; Jump process; Bounded function; Control system; Applied mathematics; Control (management); Computer science; Mathematical optimization; Mathematical analysis; Engineering; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.007577295173411012,"gpt":0.1924437411269229,"spread":0.1848664459535119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004721845,0.0005200915,0.001157234,0.0002840803,0.0001536876,0.00007622384,0.0003427849,0.0002376057,0.0003379402],"category_scores_gemma":[0.00001230388,0.0004422583,0.000316685,0.0003327038,0.0001086372,0.000257884,9.177453e-7,0.0003049837,0.0003397996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002398385,"about_ca_system_score_gemma":0.00007889587,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000155543,"about_ca_topic_score_gemma":0.00007638794,"domain_scores_codex":[0.9970562,0.0002305026,0.001018645,0.0004164511,0.0006759214,0.0006023176],"domain_scores_gemma":[0.9980002,0.0005988597,0.0001906439,0.0007929674,0.0001724689,0.0002448776],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004193431,0.0001893679,0.00003693717,0.0002305078,0.0009020933,0.00002507784,0.000184317,0.9807433,0.01212091,0.00001032331,0.00006061127,0.005077254],"study_design_scores_gemma":[0.00676507,0.0003817929,0.00006775987,0.0002966301,0.0004782498,0.00007914579,0.000117644,0.9904954,0.0007435703,0.000008169906,0.0001079022,0.000458679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04537273,0.0002496047,0.9492744,0.0001616183,0.0005122002,0.001847794,0.000321082,0.0009746768,0.001285956],"genre_scores_gemma":[0.9984484,0.00001691691,0.0002084,0.00005045564,0.0001059988,0.0004539057,0.000005089923,0.0001108336,0.0005999859],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9530757,"threshold_uncertainty_score":0.9998029,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165082107","doi":"10.1109/9.975511","title":"Sliding mode observer for nonlinear uncertain systems","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":290,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Control theory (sociology); Observer (physics); State observer; Nonlinear system; Sliding mode control; Mode (computer interface); Computer science; Alpha beta filter; Mathematics; Control engineering; Control (management); Engineering; Artificial intelligence; Physics; Kalman filter","retraction":null,"screen_n_in":null,"score":{"opus":0.02711489995759509,"gpt":0.2580895356876377,"spread":0.2309746357300426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002768049,0.0003502548,0.000601358,0.0001950279,0.0001660179,0.00009141307,0.0002285973,0.0001649915,0.00005585306],"category_scores_gemma":[0.00001894473,0.000340947,0.0002780034,0.0002177228,0.00002203274,0.0002047587,4.526908e-7,0.000176775,0.0001483407],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002682878,"about_ca_system_score_gemma":0.00004339787,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005382978,"about_ca_topic_score_gemma":0.0000617507,"domain_scores_codex":[0.9982292,0.00007334036,0.0006257889,0.0002829927,0.000288743,0.0004999012],"domain_scores_gemma":[0.9986429,0.0005768078,0.00008249842,0.0004169902,0.0001228983,0.0001579596],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007257597,0.00008575455,0.000007308855,0.0001851084,0.0003628644,0.00001445203,0.000105646,0.9817569,0.003661134,0.00008490663,0.0003207457,0.01334259],"study_design_scores_gemma":[0.003115344,0.0001348192,0.00002224132,0.0001577451,0.0001445034,0.00003456959,0.000108641,0.990045,0.0003397024,0.00001502484,0.005541885,0.0003405688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0186347,0.0002480041,0.9754988,0.0001563978,0.002026853,0.001624893,0.0002625884,0.001231844,0.0003159043],"genre_scores_gemma":[0.9948299,0.00001910915,0.003107292,0.00008224017,0.0003150028,0.0007255279,0.000006788042,0.0001142912,0.0007998548],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9761952,"threshold_uncertainty_score":0.9999043,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2104306292","doi":"10.1109/tac.2002.805689","title":"Stabilizing a linear system by switching control with dwell time","year":2002,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":258,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Dwell time; Actuator; Control theory (sociology); Linear system; Computer science; Control system; Controller (irrigation); Control engineering; State space; Control (management); Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006457525177235164,"gpt":0.1772527320239166,"spread":0.1707952068466814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003573355,0.0004476882,0.0007796343,0.0001643376,0.0002428276,0.0001031225,0.0002483062,0.0001673052,0.0004773126],"category_scores_gemma":[0.000009101511,0.0003853727,0.0002211771,0.0002676296,0.00004664019,0.0002451558,3.994181e-7,0.0003287937,0.0006574903],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003399256,"about_ca_system_score_gemma":0.00001979853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004670729,"about_ca_topic_score_gemma":0.00002633669,"domain_scores_codex":[0.9977051,0.0001686072,0.0006992432,0.0003767367,0.0004754598,0.0005748695],"domain_scores_gemma":[0.9983366,0.0006861839,0.0001034842,0.0005816236,0.00007724974,0.0002148442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003196509,0.0006237398,0.0000519861,0.001393859,0.002037971,0.00006302088,0.002303606,0.8582051,0.05784285,0.00004817173,0.001380069,0.07572993],"study_design_scores_gemma":[0.005902167,0.000232345,0.00000968616,0.0002851578,0.0002483229,0.00004298055,0.0002796882,0.9910998,0.0008444811,0.000002853257,0.0006291534,0.0004234078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04972818,0.0004320626,0.9434383,0.0002638965,0.0004713057,0.001380978,0.000132707,0.002400122,0.00175245],"genre_scores_gemma":[0.9987873,0.000005233033,0.0002674398,0.0001515647,0.00008079159,0.000379799,0.000001193397,0.00009514498,0.0002315731],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9490591,"threshold_uncertainty_score":0.9998598,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321366661","doi":"10.1109/tac.2023.3246429","title":"Probabilistic Event-Triggered Policy for Extended Dissipative Finite-Time Control of MJSs under Cyber-Attacks and Actuator Failures","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":257,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Dissipative system; Actuator; Control theory (sociology); Probabilistic logic; Computer science; Controller (irrigation); Bernoulli distribution; Lemma (botany); Control (management); Random variable; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01154877678976875,"gpt":0.2553606096321473,"spread":0.2438118328423786,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004096117,0.0003586131,0.0008216979,0.0003807856,0.0001577579,0.00005579062,0.0001813099,0.0001778513,0.00009590838],"category_scores_gemma":[0.0001872152,0.0003256517,0.0002953098,0.0004408954,0.0001348332,0.0001502573,0.000001047131,0.0001466592,0.00004589382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001607589,"about_ca_system_score_gemma":0.000129344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005825707,"about_ca_topic_score_gemma":0.00006494811,"domain_scores_codex":[0.9979916,0.0001501801,0.000751244,0.0003308337,0.0002999324,0.0004761596],"domain_scores_gemma":[0.9957199,0.003433722,0.0001358748,0.0004050405,0.0001364844,0.0001690525],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008658989,0.0005676787,0.00001616661,0.00176603,0.002570398,0.00000681888,0.003038345,0.854528,0.02788838,0.001440097,0.0004238128,0.1068885],"study_design_scores_gemma":[0.007092664,0.0003380507,0.0007452704,0.000159087,0.0003013884,0.000002711875,0.0003300894,0.9872522,0.0008330551,0.002487467,0.0001273404,0.0003306435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06679419,0.0001111331,0.9261051,0.001409042,0.0003694425,0.003188312,0.00100277,0.0009278336,0.00009211393],"genre_scores_gemma":[0.9980504,0.000009684967,0.0001511606,0.00009296503,0.00007139707,0.001353212,0.000007502843,0.00006169524,0.0002019676],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9312562,"threshold_uncertainty_score":0.9999195,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2134372665","doi":"10.1109/9.887620","title":"Stability guaranteed teleoperation: an adaptive motion/force control approach","year":2000,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Teleoperation and Haptic Systems","field":"Engineering","cited_by":226,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Teleoperation; Control theory (sociology); Master/slave; Adaptive control; Position (finance); Impedance control; Motion control; Controller (irrigation); Acceleration; Tracking (education); Contact force; Engineering; Robot; Computer science; Nonlinear system; Physics; Control (management); Classical mechanics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01425223187759524,"gpt":0.2080368398005417,"spread":0.1937846079229464,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003471167,0.0003450641,0.0004921275,0.0001274251,0.0002804151,0.0001414425,0.0001923339,0.0001653835,0.004060382],"category_scores_gemma":[0.000005040473,0.0003250065,0.0001693606,0.0002389007,0.00006860377,0.0003995034,1.672154e-7,0.0002319767,0.0004031231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001579446,"about_ca_system_score_gemma":0.00004544842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004109901,"about_ca_topic_score_gemma":0.0000731511,"domain_scores_codex":[0.9980243,0.000226016,0.0006632614,0.0003647543,0.0003590869,0.0003625956],"domain_scores_gemma":[0.998992,0.0001349965,0.00004075933,0.0005548841,0.00008861211,0.0001887999],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001434167,0.0004808061,0.00001366294,0.000071389,0.0002742726,0.000003441169,0.001695913,0.8776398,0.003071205,0.0002154097,0.00007286231,0.1163178],"study_design_scores_gemma":[0.003655047,0.0002204911,0.0003449041,0.00002285068,0.00009707517,0.00003446868,0.0003694969,0.9937307,0.001000346,0.00001784075,0.0001712562,0.0003355427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09234057,0.00004164192,0.898843,0.00007571421,0.0004170072,0.001294299,0.0001277779,0.001467059,0.005392914],"genre_scores_gemma":[0.9976376,0.000005399575,0.000991753,0.0003070697,0.0001126367,0.0004691661,0.00000744255,0.00005438394,0.0004145387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.905297,"threshold_uncertainty_score":0.9999202,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998173386","doi":"10.1109/tac.2008.919568","title":"Finite-Time Parameter Estimation in Adaptive Control of Nonlinear Systems","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Iterative Learning Control Systems","field":"Engineering","cited_by":219,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Control theory (sociology); Robustness (evolution); Estimation theory; Nonlinear system; Computation; Bounded function; Perturbation (astronomy); Identifier; Convergence (economics); Adaptive control; Mathematics; Robust control; Computer science; Applied mathematics; Mathematical optimization; Algorithm; Control (management); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0103961289365995,"gpt":0.2127032628072736,"spread":0.2023071338706741,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003152015,0.0003071211,0.0007923745,0.0004317408,0.00008192922,0.00002776533,0.0001507253,0.0001642852,0.00008400621],"category_scores_gemma":[0.00005687544,0.0003013659,0.0001722067,0.000324376,0.00007531527,0.0002132769,3.480433e-7,0.0002879888,0.0002552439],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001758425,"about_ca_system_score_gemma":0.00004715767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006412969,"about_ca_topic_score_gemma":0.00001084261,"domain_scores_codex":[0.9979348,0.0002941193,0.0008604635,0.0002308878,0.0003409265,0.0003388648],"domain_scores_gemma":[0.9977937,0.00153638,0.0001532974,0.0003341396,0.0001012814,0.00008120846],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008783635,0.0001076999,0.00004124859,0.00008862402,0.0002129609,0.00001827258,0.0005763052,0.9924866,0.002663078,0.00001186128,0.00002142903,0.003684068],"study_design_scores_gemma":[0.004642744,0.0002652141,0.0004183651,0.0002486447,0.00007285524,0.00002712634,0.00003451658,0.9934304,0.000572798,0.000007052017,0.00003115635,0.0002490711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07700243,0.0001286699,0.9204646,0.00003431593,0.0004744137,0.001175893,0.0001038609,0.0004264307,0.000189325],"genre_scores_gemma":[0.9977608,0.000004195023,0.001596229,0.00003505292,0.00003353825,0.0003360846,0.000003135201,0.00005697329,0.0001739806],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9207584,"threshold_uncertainty_score":0.9999439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2115425820","doi":"10.1109/tac.2006.875030","title":"Nonblocking Supervisory Control of State Tree Structures","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Supervisory control; Computer science; State (computer science); Tree (set theory); State space; Tree structure; Control (management); Theoretical computer science; Control system; Adaptation (eye); Control theory (sociology); Algorithm; Mathematics; Engineering; Binary tree; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01462028552831373,"gpt":0.2257360555745237,"spread":0.2111157700462099,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004245675,0.0002873382,0.0005677199,0.0003952542,0.0001774532,0.0001137545,0.0007971553,0.00009689615,0.00004572318],"category_scores_gemma":[0.00001008027,0.0002642824,0.0002436391,0.0004489688,0.00006783157,0.0003459282,0.000002222378,0.0001789526,0.0000261246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009798553,"about_ca_system_score_gemma":0.0001165359,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001860887,"about_ca_topic_score_gemma":0.0001176648,"domain_scores_codex":[0.9974608,0.0002176315,0.0008549769,0.0004260606,0.0006116106,0.0004289213],"domain_scores_gemma":[0.9980639,0.0005939231,0.0002612677,0.0008470717,0.0001471469,0.00008664586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005060739,0.0003089991,0.00008469724,0.0001434266,0.0002458876,0.00002674279,0.0006577959,0.6767803,0.02842094,0.001760462,0.00008420591,0.2914359],"study_design_scores_gemma":[0.003292376,0.0001049021,0.0007546301,0.0000936506,0.00005945648,0.00002896687,0.00001771627,0.9839262,0.009470046,0.001950494,0.00004586383,0.0002557207],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05626664,0.0001603148,0.9412529,0.0002193281,0.0007215172,0.0004912039,0.00004487656,0.0004555098,0.0003877376],"genre_scores_gemma":[0.989802,0.00000307771,0.009751909,0.0001796026,0.00004474222,0.00006703392,4.795784e-7,0.00002524258,0.0001259383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9335353,"threshold_uncertainty_score":0.9999809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154140920","doi":"10.1109/9.975513","title":"Boundary control of an unstable heat equation via measurement of domain-averaged temperature","year":2001,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":207,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Heat equation; Boundary (topology); Backstepping; Heat kernel; Mathematics; Control theory (sociology); Mathematical analysis; Boundary value problem; Lyapunov function; Robin boundary condition; Dirichlet boundary condition; Neumann boundary condition; Nonlinear system; Physics; Adaptive control; Computer science; Control (management)","retraction":null,"screen_n_in":null,"score":{"opus":0.01413053156105839,"gpt":0.2288472718009814,"spread":0.214716740239923,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006756472,0.0002214061,0.0004851426,0.0001934348,0.0001257447,0.00004380376,0.000397555,0.00009620802,0.00003509327],"category_scores_gemma":[0.00002934466,0.0002047265,0.0001395643,0.0003503071,0.00005313099,0.0004944084,0.000001449803,0.0001802409,0.000006938063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001499613,"about_ca_system_score_gemma":0.00009864139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001351612,"about_ca_topic_score_gemma":0.000008161192,"domain_scores_codex":[0.9979054,0.0001239043,0.0006637,0.0002888819,0.00073243,0.0002856436],"domain_scores_gemma":[0.9985198,0.0002651181,0.0001322165,0.0006951914,0.0002717715,0.0001158761],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000423196,0.000411423,9.804035e-7,0.0001127347,0.00009908009,0.000004436276,0.0003346477,0.7731782,0.207797,0.0006895055,0.000002023996,0.01732769],"study_design_scores_gemma":[0.002511889,0.0002666385,0.00003335807,0.0001589357,0.00005312134,0.0000197243,0.00001828424,0.9723658,0.02019526,0.004190661,0.00001179016,0.0001745233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02837428,0.00007159318,0.9701254,0.0001891674,0.0002970348,0.000600847,0.000009492472,0.0002752047,0.00005693985],"genre_scores_gemma":[0.925337,0.000004460012,0.07444983,0.00008627644,0.00001577813,0.00007406071,4.758641e-7,0.00002001639,0.0000121266],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8969627,"threshold_uncertainty_score":0.8348505,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2107723135","doi":"10.1109/tac.2010.2072570","title":"A Class of Bounded Distributed Control Strategies for Connectivity Preservation in Multi-Agent Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":205,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Computer science; Graph; Containment (computer programming); Convergence (economics); Property (philosophy); Class (philosophy); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Graph theory; Multi-agent system; Distributed computing; Mathematics; Theoretical computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02511481354304722,"gpt":0.2684260492816498,"spread":0.2433112357386025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001244837,0.0004061986,0.0009336909,0.0003583705,0.0001963252,0.0003948359,0.0009129887,0.0002802745,0.00001491985],"category_scores_gemma":[0.0001512091,0.0003910456,0.0003140761,0.0005618287,0.0001087212,0.001117081,0.000003297888,0.0003569169,0.00001574482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002087824,"about_ca_system_score_gemma":0.0003985174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005557791,"about_ca_topic_score_gemma":0.001268779,"domain_scores_codex":[0.9965624,0.000406439,0.001231531,0.0006419087,0.0005467011,0.0006110269],"domain_scores_gemma":[0.9961279,0.001602648,0.0005890387,0.001075593,0.0004307048,0.0001740974],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001150919,0.007387191,0.00111332,0.001789387,0.001856324,0.00004345976,0.002040709,0.6449581,0.2341154,0.0807323,0.0003826298,0.02443027],"study_design_scores_gemma":[0.01480887,0.00028654,0.003227071,0.0001136446,0.00009409348,0.00001042514,0.0001647421,0.9792723,0.001074074,0.0003817598,0.0002274486,0.0003390036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07904457,0.00002916702,0.9129283,0.0004961282,0.00203259,0.00406465,0.0009559805,0.0004193104,0.00002928859],"genre_scores_gemma":[0.9954929,0.000001129584,0.002224878,0.00007056857,0.00003471901,0.002088993,0.00001555335,0.00002874351,0.00004248231],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9164484,"threshold_uncertainty_score":0.9998541,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2920924004","doi":"10.1109/tac.2019.2905271","title":"Exponential Stability of Nonlinear Systems With <i>Delayed Impulses</i> and Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":204,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Control theory (sociology); Impulse (physics); Nonlinear system; Exponential stability; Mathematics; Synchronization (alternating current); Chaotic; Dwell time; Lyapunov stability; Lyapunov function; Artificial neural network; Computer science; Control (management); Topology (electrical circuits); Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.006442730492049145,"gpt":0.2039106460678506,"spread":0.1974679155758015,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002252501,0.0001384032,0.0002793624,0.00006687729,0.0001020531,0.00006862023,0.0002274747,0.00005847827,0.00003793638],"category_scores_gemma":[0.000001859346,0.0001139243,0.00005440185,0.0003053296,0.0000691129,0.0002835229,0.00000187685,0.0001009702,0.00001541135],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003679477,"about_ca_system_score_gemma":0.00006688691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004378599,"about_ca_topic_score_gemma":0.00002762989,"domain_scores_codex":[0.998759,0.000120511,0.0003632182,0.0003273117,0.0002585747,0.0001714208],"domain_scores_gemma":[0.9987813,0.0003026168,0.0001339313,0.0005965774,0.0001129448,0.00007258584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007047032,0.003747261,0.001802407,0.002254762,0.000852749,0.00000765832,0.00291815,0.5279417,0.04568132,0.007646289,0.00004314474,0.4063998],"study_design_scores_gemma":[0.001270618,0.0003260889,0.0001798115,0.00003483966,0.00003730804,0.00001241334,0.00004354679,0.9958382,0.002021225,0.00004728769,0.00005970845,0.0001289657],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1245868,0.00003663832,0.8736571,0.0001226504,0.0001848185,0.001172416,0.00003279939,0.0001452013,0.00006155724],"genre_scores_gemma":[0.9970617,0.000006364307,0.002694052,0.00004477772,0.00001980064,0.0001430066,0.000001724673,0.00000897282,0.00001957748],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8724749,"threshold_uncertainty_score":0.4645696,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160604664","doi":"10.1109/tac.2008.2009675","title":"Actuator Fault Detection and Isolation for a Network of Unmanned Vehicles","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":196,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Actuator; Fault detection and isolation; Residual; Fault (geology); Engineering; Control engineering; Isolation (microbiology); Computer science; Control theory (sociology); Real-time computing; Control (management); Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00592831055316189,"gpt":0.2098330052056036,"spread":0.2039046946524417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000145661,0.0001500285,0.0002727406,0.00009049846,0.0001096742,0.00002741192,0.00004658782,0.000106133,0.00001461082],"category_scores_gemma":[0.000008165366,0.0001482135,0.000110428,0.0001492232,0.00001510974,0.0001071614,9.530558e-8,0.00007703171,0.000006457116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005190008,"about_ca_system_score_gemma":0.000009312297,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007224272,"about_ca_topic_score_gemma":0.0000303746,"domain_scores_codex":[0.9992019,0.00003364596,0.0003476091,0.000130714,0.00009982966,0.0001863032],"domain_scores_gemma":[0.9995227,0.0001739866,0.00006412184,0.0001411585,0.00004754596,0.00005047175],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001672269,0.00005939294,0.000002346479,0.0001221561,0.0001705618,3.072188e-7,0.0002302059,0.2384702,0.1850706,0.00003028281,0.00006660225,0.5756102],"study_design_scores_gemma":[0.002526787,0.0003277373,0.000470399,0.00005162261,0.00009106736,0.000006434174,0.0000390077,0.9790971,0.01685502,0.00018703,0.0002113413,0.0001365063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.165272,0.00009419738,0.8328758,0.00009075927,0.0004929732,0.0006845486,0.00001434023,0.0004198051,0.00005554297],"genre_scores_gemma":[0.9993321,0.000009577721,0.0003424262,0.00005507961,0.00005472441,0.0001408644,5.588168e-7,0.00001910807,0.00004550802],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8340601,"threshold_uncertainty_score":0.6043972,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2153784889","doi":"10.1109/tac.2011.2163864","title":"The Wireless Control Network: A New Approach for Control Over Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":171,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"University of Pennsylvania","keywords":"Computer science; Wireless network; Computer network; Distributed computing; Node (physics); Network topology; Network packet; Network architecture; Overhead (engineering); Key distribution in wireless sensor networks; Heterogeneous network; Wireless WAN; Wireless; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01676998916770605,"gpt":0.2088615936146666,"spread":0.1920916044469606,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009496677,0.0005002093,0.0008393909,0.00008111139,0.0005563209,0.0001472655,0.0005146828,0.0002868832,0.0001939562],"category_scores_gemma":[0.0000196916,0.0003853026,0.0005731429,0.0002464295,0.0001222807,0.0001795002,7.247563e-7,0.0003624236,0.00003435086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001613091,"about_ca_system_score_gemma":0.00009135507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001097928,"about_ca_topic_score_gemma":0.0001652383,"domain_scores_codex":[0.9971402,0.0002172434,0.0008911676,0.0004167907,0.0003377168,0.000996845],"domain_scores_gemma":[0.9967311,0.001917646,0.0001539066,0.0008071202,0.0001016996,0.0002885293],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007929506,0.0001490756,0.00003952835,0.00008082303,0.001328588,0.000002271622,0.0003420844,0.8938735,0.00008749995,0.0006038464,0.003342788,0.09935711],"study_design_scores_gemma":[0.01219107,0.0001652927,0.0003022341,0.00004828267,0.0004805417,0.000009308001,0.00009243985,0.9844071,0.00002324874,0.0003006914,0.001571986,0.0004078271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007038594,0.0005928137,0.9909051,0.0001516021,0.001871519,0.003342428,0.00006922197,0.0009005344,0.001462938],"genre_scores_gemma":[0.9957328,0.00002566172,0.0007200534,0.0005121499,0.0005078124,0.001946165,0.000002223564,0.0001015641,0.0004515788],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9950289,"threshold_uncertainty_score":0.9998599,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Bounded function; Mathematics; Network topology; Lyapunov function; Discrete mathematics; Algebraic number; Topology (electrical circuits); Algebra over a field; Computer science; Combinatorics; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01154278150944019,"gpt":0.2317348626800201,"spread":0.22019208117058,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002178723,0.001344982,0.002368526,0.0007849268,0.0008855597,0.0005601866,0.001402642,0.0005927661,0.00002201424],"category_scores_gemma":[0.0001801643,0.001151753,0.0005233372,0.001096494,0.0003079069,0.0006487924,0.00003884657,0.0006902157,0.0000943788],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000529764,"about_ca_system_score_gemma":0.0003660805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003405714,"about_ca_topic_score_gemma":0.0009462371,"domain_scores_codex":[0.991062,0.00110157,0.003011168,0.001633441,0.001563118,0.001628684],"domain_scores_gemma":[0.9923383,0.002143264,0.001754061,0.002173652,0.0008850833,0.0007056132],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008174286,0.004200754,0.0003407557,0.001611343,0.004541307,0.0002094828,0.004577908,0.7857079,0.04862086,0.03365507,0.0004032859,0.1153139],"study_design_scores_gemma":[0.01341826,0.0008843759,0.002040959,0.0007330252,0.0006390167,0.0002208125,0.0001078335,0.9787085,0.0004043927,0.00004661678,0.001700604,0.001095607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1664199,0.0005622735,0.8245426,0.0009748837,0.002292643,0.003525426,0.0002353992,0.001329792,0.0001170487],"genre_scores_gemma":[0.9864821,0.0000536728,0.01149563,0.0003696396,0.0002074001,0.0008123213,0.00005543341,0.0001371594,0.0003866607],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8200622,"threshold_uncertainty_score":0.9999301,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2161219984","doi":"10.1109/tac.2004.829615","title":"Analysis of Second-Order Sliding-Mode Algorithms in the Frequency Domain","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Adaptive Control of Nonlinear Systems","field":"Engineering","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"SNC-Lavalin (Canada)","funders":"","keywords":"Frequency domain; Control theory (sociology); Actuator; Sliding mode control; Mode (computer interface); Time domain; Process (computing); Domain (mathematical analysis); Periodic function; Algorithm; Computer science; Function (biology); Mathematics; Mathematical analysis; Physics; Artificial intelligence; Nonlinear system; Control (management); Computer vision","retraction":null,"screen_n_in":null,"score":{"opus":0.01037557763894218,"gpt":0.2404784605836926,"spread":0.2301028829447504,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000398434,0.0002326539,0.0005984276,0.0005979321,0.0000603032,0.00002757978,0.0002825735,0.0001079906,0.000196798],"category_scores_gemma":[0.00001027828,0.0001858523,0.0002927185,0.001243103,0.00003925152,0.0001266032,3.529787e-7,0.0002289604,0.00003361599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001832991,"about_ca_system_score_gemma":0.00005024137,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001727621,"about_ca_topic_score_gemma":0.002424038,"domain_scores_codex":[0.9984356,0.0001192663,0.0006378682,0.00019346,0.0003283148,0.0002854452],"domain_scores_gemma":[0.9989977,0.0003505613,0.00008827047,0.0004460482,0.00006418566,0.00005316956],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001421355,0.0002412719,0.00005551085,0.00006764875,0.002072482,0.00002481436,0.002865332,0.980079,0.008283778,0.000411755,0.000009455288,0.00587476],"study_design_scores_gemma":[0.003624327,0.0001045956,0.003551051,0.00007378797,0.0007961229,0.0000103423,0.0005909891,0.9899908,0.0004607361,0.0004765369,0.00004598183,0.0002747756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1632617,0.0001040034,0.8347301,0.0001856213,0.0002594511,0.0005104259,0.000124457,0.0001795779,0.0006447157],"genre_scores_gemma":[0.9955127,0.000004809128,0.004130381,0.0001102444,0.00003183597,0.0001564247,0.000002860145,0.000030867,0.00001991996],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.832251,"threshold_uncertainty_score":0.7578835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386902756","doi":"10.1109/tac.2023.3317505","title":"Event-Based Average Consensus of Disturbed MASs via Fully Distributed Sliding Mode Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":156,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Control theory (sociology); Reachability; Double integrator; Consensus; Computer science; Lyapunov function; Sliding mode control; Convergence (economics); Multi-agent system; Integrator; Lyapunov stability; Event (particle physics); Topology (electrical circuits); Mathematics; Control (management); Nonlinear system; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01269888516936288,"gpt":0.2469724852578422,"spread":0.2342736000884793,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008895393,0.000556161,0.00109001,0.0005339055,0.000349259,0.0001918916,0.001123217,0.0002246877,0.0000650704],"category_scores_gemma":[0.00009483723,0.0005416382,0.0006099531,0.00142011,0.000102071,0.0002429672,0.000004177109,0.0003097281,0.0003114228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002991504,"about_ca_system_score_gemma":0.000283169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001124286,"about_ca_topic_score_gemma":0.00003712427,"domain_scores_codex":[0.9952562,0.0006371252,0.00140427,0.0007831072,0.001008964,0.0009102776],"domain_scores_gemma":[0.9955567,0.001800614,0.0006011534,0.001409459,0.0003028829,0.0003291838],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002158072,0.0005194427,0.00006914889,0.0002096268,0.0007186148,0.0001468708,0.0002132631,0.9141722,0.06676655,0.0006102588,0.0004877457,0.01587053],"study_design_scores_gemma":[0.01133441,0.0002156643,0.0005826871,0.0001640675,0.0001889192,0.00001486839,0.00003884864,0.9798017,0.006874064,0.00022197,0.00008908275,0.0004737584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01187542,0.00002648813,0.9793202,0.002012673,0.001441954,0.001750107,0.0017582,0.001769001,0.00004600855],"genre_scores_gemma":[0.9978728,0.000001598509,0.00115264,0.0002464612,0.00003949874,0.0004847929,0.00004218613,0.00004939193,0.0001106866],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9859973,"threshold_uncertainty_score":0.9997035,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1996592945","doi":"10.1109/tac.2012.2200381","title":"Optimal Sampling and Performance Comparison of Periodic and Event Based Impulse Control","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":152,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Lunds Universitet","keywords":"Impulse control; Impulse (physics); Control theory (sociology); Mathematics; Sampling (signal processing); Computer science; Sampling interval; Sampling design; Statistics; Mathematical optimization; Control (management); Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01460222529300738,"gpt":0.2462766573200811,"spread":0.2316744320270737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003509458,0.0002089737,0.0005246995,0.0001159777,0.0001227095,0.00003018433,0.0000694757,0.00009045695,0.00005975702],"category_scores_gemma":[0.000008951902,0.0001962958,0.00009094072,0.00008325046,0.00008480516,0.0001681536,4.370553e-7,0.0001459729,0.000005751686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005628886,"about_ca_system_score_gemma":0.00002123703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001929327,"about_ca_topic_score_gemma":0.000008045937,"domain_scores_codex":[0.9987973,0.00006680594,0.0004929563,0.0001389145,0.0001934804,0.0003105435],"domain_scores_gemma":[0.99908,0.0004553208,0.00007323464,0.0002076823,0.00003575013,0.0001479891],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002317834,0.000253916,0.008894671,0.0007458277,0.0002670425,3.721958e-7,0.001775197,0.822488,0.006067435,0.00001193209,0.000006068966,0.1592578],"study_design_scores_gemma":[0.003625919,0.0002053896,0.015213,0.0001085285,0.0001603366,0.000006852367,0.0002402751,0.979105,0.001096147,0.000001231534,0.00005638287,0.0001809601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5222186,0.0005693376,0.4765069,0.00003925138,0.0002001005,0.0003166564,0.00002374393,0.0001070923,0.00001831156],"genre_scores_gemma":[0.9991008,0.00001046987,0.0006620024,0.00004360917,0.00003522932,0.0001194824,6.283472e-7,0.00002252181,0.000005264688],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4768821,"threshold_uncertainty_score":0.8004709,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2951873227","doi":"10.1109/tac.2019.2922953","title":"Distributed GNE Seeking Under Partial-Decision Information Over Networks via a Doubly-Augmented Operator Splitting Approach","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Adaptive Dynamic Programming Control","field":"Computer Science","cited_by":148,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Convergence (economics); Nash equilibrium; Operator (biology); Computation; Strongly monotone; Distributed algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006590390268237936,"gpt":0.2214699010147289,"spread":0.214879510746491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007298517,0.000396166,0.0005265113,0.0002654455,0.0003335553,0.0006574792,0.000735161,0.0001995608,0.00007274446],"category_scores_gemma":[0.00002189299,0.0003602442,0.0002440562,0.0007566151,0.00004939054,0.002138428,0.00001106261,0.0003877014,0.0002003602],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003466259,"about_ca_system_score_gemma":0.0001008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004170291,"about_ca_topic_score_gemma":0.000006181112,"domain_scores_codex":[0.9970745,0.0001962003,0.0008771374,0.0005215736,0.0006753388,0.0006552417],"domain_scores_gemma":[0.9978063,0.0005248147,0.0003441877,0.0009463464,0.0001857126,0.0001926506],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001111865,0.0003011156,0.00004862812,0.00003600491,0.000243741,0.000002963665,0.000329844,0.6588897,0.0006953157,0.001041559,0.0000321241,0.3382678],"study_design_scores_gemma":[0.005417902,0.0001610652,0.0006896498,0.00009407811,0.00007181546,0.00001791645,0.00006664491,0.9927353,0.00008741263,0.0001171309,0.000167281,0.0003738023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01532939,0.00002240425,0.9807597,0.0002625393,0.0009669216,0.001698386,0.00002427834,0.0008619356,0.00007442544],"genre_scores_gemma":[0.9790278,0.000001712119,0.01985493,0.000738323,0.00003996473,0.0002579949,0.00002006262,0.00002521078,0.00003399032],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9636984,"threshold_uncertainty_score":0.999885,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4213457394","doi":"10.1109/tac.2022.3154347","title":"Enhanced P-Type Control: Indirect Adaptive Learning From Set-Point Updates","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Iterative Learning Control Systems","field":"Engineering","cited_by":129,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Iterative learning control; Control theory (sociology); Linearization; Nonlinear system; Computer science; Controller (irrigation); Linear system; Adaptive control; Convergence (economics); Scheme (mathematics); Feedback linearization; Mathematics; Control (management); Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.009918417540330644,"gpt":0.2095492412555,"spread":0.1996308237151694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004407825,0.0004277608,0.0007615886,0.000311981,0.0006012222,0.0001044106,0.0002886873,0.0001048205,0.002379974],"category_scores_gemma":[0.00003333964,0.0004575683,0.0002356132,0.000432685,0.00004519496,0.0002061029,0.000002161136,0.0009808214,0.0003899635],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004472735,"about_ca_system_score_gemma":0.00006095318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009367369,"about_ca_topic_score_gemma":0.00004052147,"domain_scores_codex":[0.997122,0.0007956917,0.0006219074,0.0004236998,0.0005125936,0.0005240708],"domain_scores_gemma":[0.99821,0.001025933,0.000163316,0.0003816433,0.00008837453,0.000130694],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001966555,0.00006712405,0.00002305422,0.00001821237,0.0007864999,0.00001828254,0.00230991,0.951759,0.03206968,0.00001337235,0.0001983607,0.01253985],"study_design_scores_gemma":[0.004823091,0.0005130006,0.0003135165,0.00005578743,0.0001992685,0.00001099005,0.0006613124,0.9867624,0.005000588,0.00004042523,0.001152346,0.0004672836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.133207,0.0003048071,0.8605315,0.0001327808,0.001965574,0.001011816,0.0001645436,0.002002007,0.000680001],"genre_scores_gemma":[0.9979705,0.000005243248,0.0002316503,0.000239344,0.000104427,0.0007193762,0.00001824698,0.0001195639,0.0005916663],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8647635,"threshold_uncertainty_score":0.9997876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100969324","doi":"10.1109/tac.2003.812780","title":"Minimal communication in a distributed discrete-event system","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Automaton; Computer science; Event (particle physics); Distributed computing; Finite-state machine; Multi-agent system; State (computer science); Theoretical computer science; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01382798760733907,"gpt":0.249565564335675,"spread":0.2357375767283359,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000857181,0.0002065604,0.0003627517,0.000256476,0.0001861475,0.0001348928,0.0007256789,0.00009667748,0.00001678677],"category_scores_gemma":[0.00002575003,0.0001985759,0.0001316335,0.0006651186,0.00003345292,0.0003272842,0.000002317784,0.0001975124,0.00007599217],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004254548,"about_ca_system_score_gemma":0.0001089064,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004266914,"about_ca_topic_score_gemma":0.00005906885,"domain_scores_codex":[0.9976235,0.0006185591,0.0006870308,0.000348842,0.000377665,0.0003443899],"domain_scores_gemma":[0.9980828,0.0004510913,0.0001706631,0.001131013,0.00006219505,0.0001022636],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009523424,0.001713012,0.0002626129,0.0006827458,0.0004126432,0.0001229191,0.005027012,0.8386136,0.002550507,0.05452358,0.0002613443,0.0957348],"study_design_scores_gemma":[0.001853134,0.00005676009,0.0001888299,0.0003132592,0.00002179662,0.00005228392,0.0001866235,0.9963212,0.0005893461,0.0001126449,0.0001030656,0.0002010389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01608424,0.00009463725,0.9815279,0.0003373126,0.000418031,0.0005866687,0.0000266947,0.0004618294,0.000462727],"genre_scores_gemma":[0.9881158,0.000003682719,0.01148002,0.00006198884,0.000005876969,0.0002773773,0.000001462315,0.00001446173,0.00003926713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9720317,"threshold_uncertainty_score":0.8097688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119106833","doi":"10.1109/tac.2009.2039237","title":"Supervisor Localization: A Top-Down Approach to Distributed Control of Discrete-Event Systems","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Petri Nets in System Modeling","field":"Computer Science","cited_by":125,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Supervisor; Modular design; Supervisory control; Event (particle physics); Supervisory control theory; Control (management); Computer science; Controller (irrigation); Control theory (sociology); Decomposition; Scale (ratio); Distributed computing; Control engineering; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01184339030742768,"gpt":0.235719830213922,"spread":0.2238764399064943,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007517335,0.000327299,0.0007047263,0.0003323462,0.000221787,0.0002079258,0.001091373,0.0001754136,0.00002494828],"category_scores_gemma":[0.00004831315,0.000288826,0.0002364717,0.0009027058,0.00006274623,0.0003283135,0.000005144157,0.0002686872,0.00005354835],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00010228,"about_ca_system_score_gemma":0.0001509016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009598795,"about_ca_topic_score_gemma":0.000019847,"domain_scores_codex":[0.9969535,0.0002508367,0.001005613,0.0005826557,0.0007445756,0.0004627705],"domain_scores_gemma":[0.9974808,0.0003910504,0.0002388306,0.001321916,0.0002794751,0.0002879442],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004364532,0.0005163484,0.00003279167,0.0002036331,0.000189527,0.000004393126,0.0007086235,0.9804808,0.003731738,0.003972522,0.0001274337,0.009988578],"study_design_scores_gemma":[0.002339444,0.0001656024,0.00005187255,0.0001116103,0.00007530383,0.0000470676,0.00009023237,0.9954174,0.001033018,0.00004612436,0.0003306039,0.0002916755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005504193,0.00004302535,0.9896123,0.0005178588,0.001820051,0.001627738,0.0002134274,0.0004688552,0.0001925157],"genre_scores_gemma":[0.9911011,0.000001225747,0.007985352,0.0002097004,0.00006695681,0.0005372578,0.00000457669,0.00002732763,0.00006646077],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.985597,"threshold_uncertainty_score":0.9999564,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2615536673","doi":"10.1109/tac.2017.2704442","title":"Variational Bayesian Adaptive Cubature Information Filter Based on Wishart Distribution","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Wishart distribution; Inverse-Wishart distribution; Mathematics; Recursive Bayesian estimation; Posterior probability; Bayesian probability; Noise (video); Algorithm; Computer science; Artificial intelligence; Statistics; Multivariate statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.00969140815505092,"gpt":0.2236731113282009,"spread":0.21398170317315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002959118,0.0002210822,0.0002172106,0.0001239492,0.001021804,0.0006901031,0.000751428,0.0001600206,0.0002455355],"category_scores_gemma":[0.0000493576,0.0001989327,0.0001449718,0.0001236241,0.00005551148,0.00149797,0.000003123829,0.0002971168,0.0002675791],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024758,"about_ca_system_score_gemma":0.00009517914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002235173,"about_ca_topic_score_gemma":0.000009400587,"domain_scores_codex":[0.9984146,0.0001076856,0.0003682798,0.0002905712,0.0005350673,0.0002837387],"domain_scores_gemma":[0.9979356,0.0003574634,0.0002938902,0.001144034,0.0001438053,0.0001251855],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002744015,0.0006492183,0.00005297018,0.00004432237,0.000148404,0.00001789773,0.000445482,0.4283727,0.00006616598,0.0137786,0.01607707,0.5400728],"study_design_scores_gemma":[0.001717951,0.0001637101,0.004442501,0.00009187141,0.00002800174,0.00000554215,0.000006215424,0.9909456,0.0001710671,0.0004197253,0.001795545,0.0002122572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001843756,0.000002226534,0.9933084,0.002929066,0.001442158,0.0003685233,0.000555098,0.0003863464,0.0008238609],"genre_scores_gemma":[0.986556,0.000001403912,0.01184695,0.001284785,0.00007799755,0.00008676433,0.00007052485,0.000008876347,0.00006671991],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9863716,"threshold_uncertainty_score":0.8112238,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2026694617","doi":"10.1109/tac.2013.2270053","title":"Synchronization of Lagrangian Systems With Irregular Communication Delays","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Lakehead University; Western University","funders":"","keywords":"Synchronization (alternating current); Convergence (economics); Position (finance); Computer science; Graph; Control theory (sociology); Scheme (mathematics); Directed graph; Spanning tree; Telecommunications network; Information flow; Mathematics; Topology (electrical circuits); Theoretical computer science; Control (management); Algorithm; Artificial intelligence; Computer network; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007080359854198285,"gpt":0.2009796336716085,"spread":0.1938992738174102,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003140053,0.0002318308,0.0004232539,0.0002229719,0.0001820195,0.0002232965,0.0008174303,0.0001050344,0.00005584921],"category_scores_gemma":[0.000009251495,0.000194537,0.0001067079,0.0005277457,0.00007415663,0.0007118794,0.000002209651,0.0001208682,0.000185606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001358294,"about_ca_system_score_gemma":0.0000918544,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004919435,"about_ca_topic_score_gemma":0.00004200984,"domain_scores_codex":[0.9979761,0.000324722,0.0006139022,0.0003016616,0.0004905248,0.0002931132],"domain_scores_gemma":[0.9975622,0.0003017792,0.0003612491,0.001289164,0.0003651717,0.000120407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006676304,0.001692448,0.0002448694,0.0007359965,0.00156197,0.00001336687,0.002391742,0.7026432,0.01084921,0.01097733,0.000875582,0.2679476],"study_design_scores_gemma":[0.002338671,0.0001629446,0.0006160465,0.0002353816,0.00008219248,0.00002404527,0.0001030279,0.9955426,0.0005856097,0.00005157258,0.00005583144,0.0002020862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007492337,0.0001470373,0.9891241,0.0005963176,0.0002892582,0.001637891,0.00002748123,0.0004368233,0.0002487429],"genre_scores_gemma":[0.9955782,0.000005666557,0.003651032,0.00006608503,0.00001194472,0.0005306285,0.000005851753,0.00002181335,0.0001287503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9880859,"threshold_uncertainty_score":0.7932987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3128732602","doi":"10.1109/tac.2021.3056343","title":"An Adaptive Kalman Filter With Inaccurate Noise Covariances in the Presence of Outliers","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":119,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Outlier; Kalman filter; Noise (video); Extended Kalman filter; Computer science; Ensemble Kalman filter; Algorithm; Gaussian; Noise measurement; Probability density function; Gaussian noise; Gaussian process; Mathematics; Control theory (sociology); Artificial intelligence; Statistics; Noise reduction","retraction":null,"screen_n_in":null,"score":{"opus":0.01673102254433105,"gpt":0.245087297664296,"spread":0.228356275119965,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003457277,0.0001514309,0.0002444698,0.0000935175,0.00013218,0.0001181218,0.0006988459,0.00005533676,0.00005177749],"category_scores_gemma":[0.00001223586,0.0001013805,0.00005978603,0.0005818219,0.00009204545,0.0004606128,0.000001817548,0.0002099944,0.00001096174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000197264,"about_ca_system_score_gemma":0.0001096778,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006057764,"about_ca_topic_score_gemma":0.0002606184,"domain_scores_codex":[0.9983388,0.0004036315,0.0003182541,0.0003386936,0.0003687216,0.0002318622],"domain_scores_gemma":[0.9981352,0.0007171803,0.0001201539,0.0008637083,0.0001052471,0.00005849405],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003951845,0.002100746,0.0002232512,0.00008686463,0.000235315,0.00041749,0.01303769,0.7095461,0.002928477,0.007603168,0.0006110716,0.2628146],"study_design_scores_gemma":[0.001404207,0.0003767981,0.002467048,0.0001353848,0.00003335736,0.00004650631,0.0006393787,0.9925421,0.001822086,0.0002584651,0.000106739,0.0001679088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02533676,0.00003595941,0.9727558,0.0009081328,0.0002897721,0.0002781654,0.00003037086,0.0001029342,0.0002621205],"genre_scores_gemma":[0.9841679,0.000009986153,0.01523399,0.0004609063,0.00001628428,0.00006597931,0.000001509266,0.000007850813,0.00003561491],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9588311,"threshold_uncertainty_score":0.4134176,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2529970964","doi":"10.1109/tac.2016.2616644","title":"Stability Analysis of Discrete-Time Infinite-Horizon Optimal Control With Discounted Cost","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Adaptive Dynamic Programming Control","field":"Computer Science","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; Agence Universitaire de la Francophonie; Agence Nationale de la Recherche","keywords":"Controllability; Robustness (evolution); Discounting; Control theory (sociology); Stability (learning theory); Mathematics; Lyapunov function; Mathematical optimization; Discrete time and continuous time; Optimal control; Sequence (biology); Bellman equation; Nonlinear system; Computer science; Applied mathematics; Control (management); Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.008061752130508127,"gpt":0.2324828822992374,"spread":0.2244211301687292,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007264479,0.000444009,0.001145964,0.000601619,0.0001827985,0.0001131783,0.0009341275,0.0001277859,0.000260821],"category_scores_gemma":[0.00006414254,0.000281864,0.0004973133,0.001544965,0.000380693,0.0006906688,0.000004625329,0.0001810152,0.00006083838],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002672852,"about_ca_system_score_gemma":0.0002115796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006619543,"about_ca_topic_score_gemma":0.0001480299,"domain_scores_codex":[0.996577,0.0004019541,0.0008608961,0.0007561859,0.0007824229,0.0006215675],"domain_scores_gemma":[0.995425,0.002066581,0.0004625143,0.001461752,0.0003468878,0.0002373074],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.002215993,0.002611919,0.001272265,0.0000969093,0.01804241,0.00005742908,0.001267952,0.08772583,0.0454606,0.00356512,0.00002618149,0.8376574],"study_design_scores_gemma":[0.007058157,0.001078409,0.002144423,0.00008371926,0.001820734,0.000004994794,0.00003085266,0.9861073,0.001192033,0.00005134521,0.00003242839,0.0003956028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04178369,0.00001268658,0.9545543,0.001131252,0.0001392628,0.001376465,0.0004251974,0.0005036169,0.0000734916],"genre_scores_gemma":[0.9912183,0.000001869534,0.008146562,0.0001050594,0.00001374132,0.0003797693,0.000002982018,0.00002897641,0.0001027062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9494346,"threshold_uncertainty_score":0.9999633,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1966106940","doi":"10.1109/tac.2014.2298732","title":"Robust Adaptive Inverse Control of a Class of Nonlinear Systems With Prandtl-Ishlinskii Hysteresis Model","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Piezoelectric Actuators and Control","field":"Engineering","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Control theory (sociology); Inverse; Compensation (psychology); Hysteresis; Nonlinear system; Controller (irrigation); Actuator; Adaptive control; Stability (learning theory); Inverse problem; Mathematics; Computer science; Control (management); Physics; Mathematical analysis; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.00984816744626779,"gpt":0.1799268869294539,"spread":0.1700787194831861,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002838003,0.0003374974,0.0009451014,0.0002642368,0.0000650571,0.00002197925,0.0002164209,0.0001646211,0.00002372818],"category_scores_gemma":[0.00001482527,0.0002793322,0.000211,0.00027743,0.00008394281,0.0001540026,4.925283e-7,0.000219326,0.00001125041],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009202395,"about_ca_system_score_gemma":0.0000969074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006031491,"about_ca_topic_score_gemma":0.0000740474,"domain_scores_codex":[0.998157,0.0001177462,0.0007206175,0.0002390076,0.0004059711,0.0003596203],"domain_scores_gemma":[0.9985181,0.000478823,0.0002248754,0.0004535724,0.0001846977,0.0001399222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003040141,0.0001715582,0.00000673956,0.000226041,0.000651958,0.000001689773,0.0001754298,0.9724756,0.001761289,0.0001011773,0.00003735624,0.02408708],"study_design_scores_gemma":[0.008243237,0.0005657947,0.00001141084,0.0002118422,0.0005381181,0.000007917572,0.00007998461,0.9891389,0.0008934909,0.00001765752,0.00002781949,0.0002638394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03548058,0.00007856827,0.9623351,0.00004151324,0.0001781245,0.0009307922,0.00018463,0.0002738401,0.0004968597],"genre_scores_gemma":[0.9977236,0.000009567461,0.001824004,0.00006141385,0.00003605706,0.0002109032,0.000001226685,0.00006280472,0.00007043346],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.962243,"threshold_uncertainty_score":0.9999659,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963064967","doi":"10.1109/tac.2019.2930239","title":"Input-to-State Stability of Time-Delay Systems With Delay-Dependent Impulses","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Neural Networks Stability and Synchronization","field":"Computer Science","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Impulse (physics); Nonlinear system; Stability (learning theory); Computer science; Discrete time and continuous time; Upper and lower bounds; Mathematics; Physics; Control (management); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.007349248109483612,"gpt":0.2078567740151325,"spread":0.2005075259056489,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004901196,0.000233227,0.0004731179,0.0001510323,0.0001090682,0.0001133164,0.0004923568,0.00006849693,0.000162562],"category_scores_gemma":[0.000007828677,0.0001868566,0.0001024758,0.0005195502,0.00005073566,0.0004194713,0.000003974391,0.0001528985,0.0002419228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001440623,"about_ca_system_score_gemma":0.0001385962,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009972337,"about_ca_topic_score_gemma":0.00008258328,"domain_scores_codex":[0.9977826,0.0002767953,0.0005810482,0.0004843171,0.0005402073,0.000334987],"domain_scores_gemma":[0.9980419,0.000474249,0.000183587,0.0009442425,0.0002095577,0.0001464647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001619099,0.0005336623,0.0003400467,0.0002602423,0.0001676635,0.00001008719,0.001130774,0.9525241,0.005842635,0.0001250105,0.00002571848,0.03887819],"study_design_scores_gemma":[0.001333284,0.0007385874,0.0002687006,0.0001077089,0.00003488407,0.00002674802,0.00002828957,0.9930787,0.004086757,0.00005431444,0.00001874008,0.0002232521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2953922,0.00001603854,0.7025922,0.0001953762,0.0003639941,0.001103935,0.00002814666,0.0002218629,0.00008624008],"genre_scores_gemma":[0.9980891,0.000002853653,0.001485287,0.0001268363,0.00001145964,0.00008750321,9.018442e-7,0.00001783922,0.000178248],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7026969,"threshold_uncertainty_score":0.7619789,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2000850397","doi":"10.1109/tac.2013.2292137","title":"Online Markov Decision Processes Under Bandit Feedback","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Hindsight bias; Markov decision process; Markov chain; State (computer science); Computer science; Markov process; Function (biology); Mathematical economics; Discrete mathematics; Combinatorics; Mathematical optimization; Mathematics; Artificial intelligence; Algorithm; Machine learning; Statistics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.04329478899436651,"gpt":0.3667983632348631,"spread":0.3235035742404966,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001955609,0.0003416131,0.0006459312,0.0007254864,0.0004606249,0.000362731,0.001024378,0.0001666199,0.003551582],"category_scores_gemma":[0.001704011,0.000246867,0.0002333298,0.001585769,0.0002050399,0.0005424485,0.000004497582,0.0003690331,0.002009625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001445872,"about_ca_system_score_gemma":0.0002410928,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001469122,"about_ca_topic_score_gemma":0.0002879927,"domain_scores_codex":[0.9944181,0.0003872005,0.001049556,0.0007937693,0.002746422,0.0006049403],"domain_scores_gemma":[0.9868866,0.01071249,0.0002498053,0.001115936,0.000718261,0.0003169322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001525382,0.0006083559,0.00001379932,0.00002407791,0.00005636388,0.000005917247,0.00009847568,0.06946191,0.000200153,0.00001207472,0.001134561,0.9282318],"study_design_scores_gemma":[0.005014583,0.0004719015,0.002837587,0.0001356546,0.00006299834,0.00003723185,0.0003188898,0.9653881,0.001554249,0.01853693,0.005186111,0.0004558167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02148839,0.00005010255,0.9747925,0.001530899,0.0007774307,0.0006319428,0.0001131907,0.0002832024,0.0003323022],"genre_scores_gemma":[0.9846848,0.00002141201,0.01143914,0.0006468864,0.0001372448,0.0001011012,0.000002857466,0.00004529736,0.002921241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9633534,"threshold_uncertainty_score":0.9999983,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2278351347","doi":"10.1109/tac.2015.2444191","title":"On the Smallest Eigenvalue of Grounded Laplacian Matrices","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":101,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Combinatorics; Laplacian matrix; Laplace operator; Mathematics; Upper and lower bounds; Row; Discrete mathematics; Graph theory; Algebraic connectivity; Matrix (chemical analysis); Asymptotically optimal algorithm; Random graph; Graph; Computer science; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.018987807938073,"gpt":0.2566111332188227,"spread":0.2376233252807497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002352999,0.0001307481,0.0002097402,0.00005721677,0.0001510183,0.00004443739,0.0001849779,0.00003821321,0.0003916574],"category_scores_gemma":[0.00000458241,0.00009472281,0.000143934,0.0001537849,0.00006943248,0.00004952942,6.506519e-7,0.0001238635,0.00009611141],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003306256,"about_ca_system_score_gemma":0.0000923836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003593983,"about_ca_topic_score_gemma":0.00002926657,"domain_scores_codex":[0.9991208,0.00009051567,0.000267382,0.0001283843,0.0002322518,0.0001606337],"domain_scores_gemma":[0.9991091,0.0003519057,0.0001313381,0.0002537415,0.00007523991,0.00007869061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003322933,0.002723224,0.001395673,0.00009176692,0.001502241,0.000005308758,0.007562522,0.1188873,0.000887828,0.7168976,0.001970058,0.1477442],"study_design_scores_gemma":[0.008223707,0.001054968,0.003206555,0.0002935465,0.0003992327,0.000002505097,0.00542449,0.8852717,0.002135403,0.09224448,0.0008044057,0.0009389616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5784022,0.00001568999,0.4090345,0.001140465,0.0006446021,0.0006098013,0.0001558893,0.00007377296,0.009923047],"genre_scores_gemma":[0.9993533,0.000001178094,0.0001009876,0.0001809618,0.00004395823,0.00006648414,0.000001444513,0.0000120486,0.0002396328],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7663845,"threshold_uncertainty_score":0.4288374,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136776938","doi":"10.1109/tac.2012.2215399","title":"Nash, Social and Centralized Solutions to Consensus Problems via Mean Field Control Theory","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":97,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University; Polytechnique Montréal; McGill University; Group for Research in Decision Analysis","funders":"","keywords":"Nash equilibrium; Population; Mathematical optimization; Mean field theory; Mathematics; Mathematical economics; Field (mathematics); Social choice theory; Applied mathematics; Computer science; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01394526567013215,"gpt":0.2605162270609899,"spread":0.2465709613908578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003624347,0.0002106322,0.0003414186,0.00007995636,0.0005890285,0.00006420882,0.0001020837,0.00008156212,0.0005479103],"category_scores_gemma":[0.0000055677,0.0002039086,0.0001737212,0.0001309766,0.00008554101,0.00009261551,0.000001504746,0.0001820464,0.00006863305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004202393,"about_ca_system_score_gemma":0.00004632234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002135407,"about_ca_topic_score_gemma":0.00002759517,"domain_scores_codex":[0.9985614,0.0001938682,0.0003452889,0.0001941073,0.0001724626,0.0005328427],"domain_scores_gemma":[0.998959,0.0004750344,0.0000975642,0.0001670773,0.00006501502,0.0002362745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007679597,0.004166798,0.005007112,0.0002306701,0.003903265,0.000004117507,0.03620667,0.01186011,0.01692591,0.2843328,0.002318075,0.6342765],"study_design_scores_gemma":[0.04840012,0.001513469,0.01971313,0.00050032,0.002946487,0.00003106497,0.007777453,0.8482627,0.003248596,0.05497476,0.007853813,0.004778075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0935311,0.00003084558,0.9017375,0.002215305,0.0005774843,0.0008720048,0.0002054007,0.0001196339,0.0007107076],"genre_scores_gemma":[0.9983166,0.00000125158,0.0002555698,0.0008405197,0.000169026,0.0002039587,0.000002182523,0.00002157938,0.0001893403],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9047855,"threshold_uncertainty_score":0.831515,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0097763694579725,"gpt":0.2154873863358222,"spread":0.2057110168778497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004097825,0.0004703887,0.0006822612,0.0003440058,0.0003798676,0.0002960882,0.0008030455,0.0001527053,0.000107963],"category_scores_gemma":[0.00005428781,0.0003861148,0.000225988,0.000476799,0.0001492893,0.0002492436,0.000003014379,0.0003399701,0.0003921207],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001156216,"about_ca_system_score_gemma":0.0001194024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006449038,"about_ca_topic_score_gemma":0.00002507907,"domain_scores_codex":[0.996935,0.0005009337,0.0006036053,0.0007052477,0.0006050116,0.0006501883],"domain_scores_gemma":[0.9962927,0.001903212,0.000275442,0.001181191,0.000129658,0.0002178193],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001315028,0.003190557,0.0001965975,0.0003400701,0.003314718,0.000446485,0.002188022,0.7108705,0.01871847,0.0227902,0.001916749,0.2347126],"study_design_scores_gemma":[0.006280919,0.0008763009,0.0005592693,0.0001738507,0.00008385401,0.00005975245,0.00003314086,0.9888789,0.002137303,0.0002230898,0.0002166573,0.0004769482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04403234,0.00001813952,0.948878,0.001552446,0.0006191891,0.001004241,0.00009301777,0.001768617,0.00203393],"genre_scores_gemma":[0.9953104,0.000001193193,0.003495648,0.0006324753,0.00003969302,0.0002079561,0.000005334144,0.0000341726,0.0002730892],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9512781,"threshold_uncertainty_score":0.9998591,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01369906658502756,"gpt":0.2376282370940558,"spread":0.2239291705090282,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002933954,0.0003501344,0.0006940201,0.0002006591,0.0001457095,0.000159925,0.0008217467,0.0001341408,0.00004244205],"category_scores_gemma":[0.00002877845,0.0003331822,0.0003487901,0.0004873678,0.00003842408,0.0005045523,0.000004819434,0.0001744228,0.000205897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001892956,"about_ca_system_score_gemma":0.0001006703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003947882,"about_ca_topic_score_gemma":0.00001234848,"domain_scores_codex":[0.9969696,0.0002831114,0.001177989,0.0004728002,0.0006676829,0.0004287739],"domain_scores_gemma":[0.9980951,0.0002427898,0.0004990406,0.000700943,0.0001958529,0.0002663062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009695556,0.0004266007,0.000001249597,0.0003064168,0.0002723829,0.00003270265,0.0007472833,0.9378403,0.01894472,0.00004651854,0.00006178592,0.04122306],"study_design_scores_gemma":[0.004221532,0.0004243327,0.0000144566,0.0001115979,0.0001049632,0.00003533331,0.00006816932,0.9881157,0.006457088,0.000002614778,0.0001707795,0.0002734801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02129237,0.0001470408,0.9741069,0.00101257,0.0008684088,0.001653804,0.0002807791,0.0006170757,0.00002106542],"genre_scores_gemma":[0.9951505,0.000008223675,0.004276647,0.0002054716,0.00004103368,0.000230745,0.0000114915,0.00002852329,0.00004736183],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9738581,"threshold_uncertainty_score":0.999912,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01449910370951858,"gpt":0.2477948621059974,"spread":0.2332957583964788,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000501747,0.0002687005,0.0003594132,0.0002110898,0.0003074453,0.0001845364,0.0005135091,0.0001295475,0.00002615171],"category_scores_gemma":[0.0000465322,0.0002618757,0.0002394051,0.0004313804,0.00003204796,0.001481547,0.000001871095,0.00009998049,0.0001008431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003857867,"about_ca_system_score_gemma":0.00006257247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022592,"about_ca_topic_score_gemma":0.00001426983,"domain_scores_codex":[0.9978812,0.0002003217,0.0006323745,0.0003039874,0.0003981261,0.0005840392],"domain_scores_gemma":[0.998198,0.0004405212,0.0002590153,0.0007269791,0.0001768544,0.0001986117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002060941,0.004132571,0.0001843235,0.001369377,0.001322503,0.000007497859,0.004718295,0.250377,0.06274807,0.01742312,0.001036326,0.6564748],"study_design_scores_gemma":[0.002995955,0.00008100089,0.0008008048,0.00004952235,0.0001037796,0.00001563319,0.00007514172,0.9930007,0.001648466,0.0002353973,0.000719833,0.0002737451],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007402302,0.00008974486,0.987569,0.0007580864,0.001122619,0.001832689,0.0003939562,0.0008062397,0.00002533165],"genre_scores_gemma":[0.9952873,0.000004050096,0.00365678,0.0001505037,0.00003408588,0.0007483241,0.00006195882,0.00002469015,0.0000323074],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.987885,"threshold_uncertainty_score":0.9999834,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2029382655","doi":"10.1109/tac.2007.900823","title":"Optimal LQ-Feedback Regulation of a Nonisothermal Plug Flow Reactor Model by Spectral Factorization","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"KU Leuven","keywords":"Mathematics; Control theory (sociology); Nonlinear system; Applied mathematics; Optimal control; Constant (computer programming); Riccati equation; Differential equation; Mathematical analysis; Mathematical optimization; Computer science; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.008229269518747034,"gpt":0.2084054457974,"spread":0.200176176278653,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002695262,0.0002481198,0.0003816097,0.0001658482,0.00009582831,0.00003452981,0.0001363197,0.0001743275,0.0004722111],"category_scores_gemma":[0.00001749395,0.0002632239,0.000210113,0.0002214496,0.00007322133,0.0002398192,4.727291e-7,0.0001659827,0.00002430082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001962439,"about_ca_system_score_gemma":0.00004808828,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001818066,"about_ca_topic_score_gemma":0.00009541104,"domain_scores_codex":[0.9983753,0.00004484873,0.0006609655,0.0002276537,0.0003605972,0.0003306099],"domain_scores_gemma":[0.9990563,0.0002975428,0.00009257083,0.0003451401,0.0000923032,0.0001161335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001168427,0.0002597001,0.00001533228,0.0000725668,0.0001393832,2.034576e-7,0.0007623128,0.8499102,0.1233166,0.00007071786,0.00003001748,0.02530617],"study_design_scores_gemma":[0.002106196,0.00009965705,0.001355357,0.00002911802,0.0001216909,0.00000114598,0.00006664997,0.9589554,0.03680424,0.0002330951,0.00001198203,0.0002154746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3109283,0.00001563787,0.6875952,0.00007454434,0.0002474201,0.0004524191,0.000163753,0.0003218202,0.0002008893],"genre_scores_gemma":[0.995939,0.000003815967,0.003814631,0.0000237338,0.00003937505,0.00004123067,0.00001666688,0.00004049344,0.00008101036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6850108,"threshold_uncertainty_score":0.999982,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3211862199","doi":"10.1109/tac.2021.3125430","title":"Worst-Case Stealthy Innovation-Based Linear Attacks on Remote State Estimation Under Kullback–Leibler Divergence","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":87,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Divergence (linguistics); Semidefinite programming; Constraint (computer-aided design); Covariance; Kullback–Leibler divergence; Linear programming; State (computer science); Mathematical optimization; Computer science; Linear system; Optimization problem; Mathematics; Algorithm; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01603823068393164,"gpt":0.2563491629851453,"spread":0.2403109323012136,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000228007,0.0002645235,0.000286456,0.000311311,0.0002889038,0.00006283611,0.0001208368,0.0001259542,0.0003889949],"category_scores_gemma":[0.00003434498,0.0002672843,0.0001040233,0.001044321,0.00005550089,0.0001634751,8.308314e-7,0.0003510647,0.000304243],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000165323,"about_ca_system_score_gemma":0.0001464414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002857999,"about_ca_topic_score_gemma":0.0001466695,"domain_scores_codex":[0.9983423,0.00009184523,0.000548102,0.0003071699,0.0003694592,0.0003411048],"domain_scores_gemma":[0.9987102,0.0004700107,0.00007916701,0.0004525959,0.0001778517,0.0001101384],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003111276,0.0001233285,0.000002863771,0.0001287267,0.00007301244,0.0001429465,0.0002167547,0.9645689,0.0009871083,0.00006218293,0.000114049,0.03354901],"study_design_scores_gemma":[0.00144284,0.00008936113,0.0001468817,0.0001706462,0.00005434151,0.00006195754,0.00006786422,0.9858831,0.0114418,0.0002647397,0.0001047495,0.0002717722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.204805,0.00003225304,0.7925069,0.0005096032,0.001121531,0.0003295414,0.00006571586,0.0005125836,0.0001167954],"genre_scores_gemma":[0.9943411,0.00001880087,0.004523977,0.000796003,0.00003845498,0.00003663691,0.00001068741,0.00004065635,0.000193701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7895361,"threshold_uncertainty_score":0.9999779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01381129278837573,"gpt":0.2464970328151204,"spread":0.2326857400267447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008816994,0.0004594332,0.001121271,0.0007391181,0.0002543649,0.0004169116,0.001356647,0.0001870257,0.0001075075],"category_scores_gemma":[0.00006517093,0.0004260038,0.0009163964,0.001268536,0.00004503317,0.0002567505,0.000005680905,0.0001695088,0.0006033427],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002901336,"about_ca_system_score_gemma":0.0001712467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001874916,"about_ca_topic_score_gemma":0.00008812096,"domain_scores_codex":[0.9960548,0.0003985081,0.001185383,0.0008775614,0.0007351509,0.0007485796],"domain_scores_gemma":[0.9952168,0.001314674,0.0004957903,0.002363859,0.0003155271,0.0002933172],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002486332,0.001316167,0.0001678543,0.0005286374,0.009742204,0.00003966348,0.0008401146,0.9460477,0.008474168,0.002597795,0.002293724,0.02770332],"study_design_scores_gemma":[0.009075025,0.0002328061,0.0002722065,0.00009417328,0.001101895,0.00001118744,0.00008911276,0.9871443,0.0005286504,0.0000622433,0.0009469788,0.0004414601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01609735,0.0001731121,0.9746221,0.001022499,0.002401936,0.004036317,0.0006785312,0.0008722733,0.00009585681],"genre_scores_gemma":[0.9941503,0.000002815891,0.003081406,0.0002465537,0.00004530618,0.001163322,0.000009606676,0.00003717579,0.001263533],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9780529,"threshold_uncertainty_score":0.9998192,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}