{"meta":{"query_hash":"4a138ea53e52","filters":{"venue":"IEEE Transactions on Network Science and Engineering"},"cohort_total":147,"direct_labels_cover":2,"predictions_cover":147,"exported":147,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/4a138ea53e52","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Network+Science+and+Engineering"},"results":[{"id":"W1651715594","doi":"10.1109/tnse.2015.2500162","title":"The Strategic Formation of Multi-Layer Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Enhanced Data Rates for GSM Evolution; Layer (electronics); Nash equilibrium; Computer science; Network layer; Network formation; Mathematical optimization; Game theory; Set (abstract data type); Network topology; Strategy; Topology (electrical circuits); Mathematics; Computer network; Artificial intelligence; Mathematical economics; Combinatorics","score_opus":0.135086230070719,"score_gpt":0.33015150198233567,"score_spread":0.19506527191161668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1651715594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09259576,0.00012390959,0.906069,0.00013040545,0.0004737423,0.000108813925,0.0000013994937,0.00003190748,0.00046505727],"genre_scores_gemma":[0.9986687,0.000044324355,0.0010849441,0.000027195447,0.000044938184,0.000018397888,1.01636054e-7,0.000004260045,0.00010714847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986667,0.00002811854,0.00028888858,0.00018378063,0.00058119575,0.00025134202],"domain_scores_gemma":[0.998805,0.000413594,0.000071559334,0.000308534,0.0002629546,0.0001383635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003516975,0.00008250912,0.000099441735,0.0001000827,0.00045183225,0.00018317899,0.00042234213,0.00003387222,0.00000397196],"category_scores_gemma":[0.00004389074,0.000052868156,0.00003228113,0.0014836778,0.00024516974,0.00042045218,0.0000033578083,0.00013770268,0.000013795011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007253056,0.000010845359,0.0000023698678,6.712004e-7,0.0000016289795,1.18763325e-7,0.00011822581,0.9824079,0.00057580543,0.00400863,0.00008130089,0.012785195],"study_design_scores_gemma":[0.00013148687,0.000038522117,0.000110644505,0.000010502022,0.000005370072,0.000006245316,0.00062832,0.9946948,0.0012805216,0.0020805318,0.00094045926,0.000072593604],"about_ca_topic_score_codex":0.0000037693962,"about_ca_topic_score_gemma":0.000013971093,"teacher_disagreement_score":0.9060729,"about_ca_system_score_codex":0.000026417292,"about_ca_system_score_gemma":0.000068812915,"threshold_uncertainty_score":0.3475174},"labels":[],"label_agreement":null},{"id":"W2792728919","doi":"10.1109/tnse.2018.2816951","title":"Mitigating Bottlenecks in Wide Area Data Analytics via Machine Learning","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Huawei Technologies","keywords":"Bottleneck; Computer science; Scheduling (production processes); Locality; Petabyte; Distributed database; Distributed computing; SPARK (programming language); Exponential growth; Execution time; Analytics; Database; Data mining; Big data; Mathematical optimization; Embedded system","score_opus":0.020292865601223162,"score_gpt":0.22155257365931452,"score_spread":0.20125970805809135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792728919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09026311,0.000064256725,0.90851194,0.00018758411,0.0004752419,0.000059835293,5.155334e-7,0.00015149613,0.00028602057],"genre_scores_gemma":[0.9805461,0.000016795348,0.019165542,0.00011941676,0.00008819504,0.0000024810422,3.2949436e-7,0.00000783251,0.00005329006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.000016276337,0.00018821441,0.00049535895,0.00032651692,0.00044564888],"domain_scores_gemma":[0.9991633,0.000123777,0.000036537447,0.0005247117,0.000044684024,0.00010696318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010657758,0.0001310972,0.00012324726,0.00023365114,0.00045677443,0.00019403077,0.0009118265,0.000032522166,0.0000026854696],"category_scores_gemma":[0.000026047588,0.00012615263,0.000018446228,0.0016594558,0.00012380691,0.00014854358,0.00004783591,0.000300717,0.000005118722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011383747,0.000012581364,0.00024970993,0.000006246103,0.000005626951,0.000005038474,0.000196541,0.9584479,0.0002570681,0.000056323315,0.000026327196,0.040735517],"study_design_scores_gemma":[0.00011013881,0.00005343021,0.0005845701,0.00009378907,0.000005104058,0.000008976924,0.000016171183,0.99767643,0.00033428235,0.000027181393,0.0009408392,0.00014907491],"about_ca_topic_score_codex":0.00004981036,"about_ca_topic_score_gemma":0.00004574216,"teacher_disagreement_score":0.890283,"about_ca_system_score_codex":0.000054125438,"about_ca_system_score_gemma":0.000036717487,"threshold_uncertainty_score":0.51443547},"labels":[],"label_agreement":null},{"id":"W2796567768","doi":"10.1109/tnse.2018.2825144","title":"Channel Selective Activity Recognition with WiFi: A Deep Learning Approach Exploring Wideband Information","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":67,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Computer science; Activity recognition; Channel (broadcasting); Spectrogram; Feature extraction; Hidden Markov model; Wideband; Context (archaeology); Deep learning; Bandwidth (computing); Artificial intelligence; Speech recognition; Computer network; Engineering; Electronic engineering","score_opus":0.015866780461194246,"score_gpt":0.18254906034636872,"score_spread":0.16668227988517448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2796567768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12791292,0.000021129574,0.8700607,0.000005781044,0.0003104494,0.0001288069,0.0000011072002,0.0007133193,0.0008458247],"genre_scores_gemma":[0.9973466,0.0001606898,0.0022875017,0.000012783401,0.00007837255,0.00009091623,0.0000012141561,0.000017036784,0.000004934782],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991231,0.000006225482,0.00011551161,0.00016875002,0.0002237132,0.00036267593],"domain_scores_gemma":[0.99964315,0.000026821264,0.000022165494,0.00010070595,0.00014000859,0.00006715454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022432956,0.00015859777,0.00011697153,0.00037071644,0.00046121713,0.000086194064,0.000094044226,0.00006588508,0.000002639891],"category_scores_gemma":[0.00001173731,0.0001489126,0.000017554405,0.0016107733,0.00014843447,0.0016358846,0.0000018132796,0.00029253995,0.000008397898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016552303,0.0000059352515,0.0000048433058,0.00002600605,0.000012630894,2.4707396e-7,0.00086975924,0.9426568,0.0007747991,0.000012682118,0.000008034804,0.05561169],"study_design_scores_gemma":[0.0002049855,0.00015813223,0.000180566,0.00006285517,0.000014046711,0.000016191532,0.0002881536,0.94167763,0.05692378,0.000015232456,0.00021807101,0.00024035256],"about_ca_topic_score_codex":0.0000060430184,"about_ca_topic_score_gemma":0.0000060772904,"teacher_disagreement_score":0.86943364,"about_ca_system_score_codex":0.000104370025,"about_ca_system_score_gemma":0.000020631594,"threshold_uncertainty_score":0.60724795},"labels":[],"label_agreement":null},{"id":"W2885808274","doi":"10.1109/tnse.2018.2862919","title":"Neuronal Spatial Arrangement Shapes Effective Connectivity Traits of <i>in vitro</i> Cortical Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Neural dynamics and brain function","field":"Neuroscience","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"H2020 Future and Emerging Technologies; Generalitat de Catalunya; European Commission","keywords":"Metric (unit); Computer science; Artificial intelligence; Homogeneous; Algorithm; Combinatorics; Mathematics","score_opus":0.010156824623070649,"score_gpt":0.2147091838829748,"score_spread":0.20455235925990414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2885808274","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6242964,0.00000556847,0.37459302,0.00004191029,0.0007335477,0.00019775594,0.0000040969976,0.000035570112,0.000092106624],"genre_scores_gemma":[0.9994588,0.00002126443,0.00013283905,0.0001885327,0.0001555886,0.00002600095,1.1293721e-7,0.000010611086,0.0000062357553],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866486,0.000042190855,0.00017971249,0.00040974864,0.000311386,0.00039210508],"domain_scores_gemma":[0.9993695,0.00036445336,0.000036547375,0.00008527423,0.000045612695,0.000098606775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004084212,0.00013959009,0.00016721325,0.00013783037,0.00025007193,0.00004072435,0.00013282827,0.00004429859,0.000007859165],"category_scores_gemma":[0.000047640242,0.00013088358,0.00003988237,0.00086354744,0.00036817024,0.00022422307,0.0000040764244,0.00026576378,0.0000017143414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011442303,0.000052234267,0.000011120819,0.0000070919323,0.0000020110376,0.0000023768162,0.000041711406,0.3519873,0.6192394,0.00012657237,0.000004830607,0.028410915],"study_design_scores_gemma":[0.00026291987,0.0003050786,0.0077303536,0.00003280877,0.0000073882366,0.000008277959,0.0000038704084,0.7965131,0.194958,0.000019440015,0.00003994036,0.00011883823],"about_ca_topic_score_codex":0.000018785495,"about_ca_topic_score_gemma":0.000029666518,"teacher_disagreement_score":0.44452578,"about_ca_system_score_codex":0.000049466755,"about_ca_system_score_gemma":0.0000301195,"threshold_uncertainty_score":0.53372777},"labels":[],"label_agreement":null},{"id":"W2897411018","doi":"10.1109/tnse.2018.2877441","title":"Learning-Theoretic Multi-Channel Spectrum Sensing and Access in Full-Duplex Cognitive Radio Networks with Unknown Primary User Activities","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Optimization problem; Convex optimization; Wireless; Throughput; Channel (broadcasting); Computer network; Robust optimization; Mathematical optimization; Regular polygon; Algorithm; Mathematics; Telecommunications","score_opus":0.008808122102316235,"score_gpt":0.2136440833952946,"score_spread":0.20483596129297835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897411018","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29300368,0.000118080025,0.70606685,0.00007960637,0.0003604147,0.00017095165,4.5406873e-7,0.00012911575,0.00007085589],"genre_scores_gemma":[0.9945389,0.00034819735,0.0046757767,0.0001278038,0.00024038291,0.0000063833822,4.4028727e-7,0.000027448987,0.000034657405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978369,0.000053367596,0.00021386996,0.00072521425,0.000333757,0.00083691446],"domain_scores_gemma":[0.99911004,0.00032960367,0.00006545204,0.00019564257,0.00009746531,0.00020180747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064132235,0.0003088967,0.00029958962,0.00037690465,0.0007432827,0.0006364788,0.0002663822,0.00008327574,0.000002621084],"category_scores_gemma":[0.000012495551,0.00028596038,0.000033210905,0.0018233587,0.00070223946,0.001216585,0.000023906194,0.0005701006,9.5129417e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000728633,0.000031100637,0.00007552664,0.00001687592,0.00002335243,0.000038596783,0.0010477653,0.965539,0.0002795451,0.00018099832,0.0000041914977,0.0326902],"study_design_scores_gemma":[0.0006329423,0.00036152682,0.0029682757,0.0004360743,0.000019757248,0.00019673163,0.0000902998,0.9940752,0.00077275553,0.000025646123,0.000027423483,0.00039337826],"about_ca_topic_score_codex":0.00003892714,"about_ca_topic_score_gemma":0.0002925437,"teacher_disagreement_score":0.7015352,"about_ca_system_score_codex":0.0001267584,"about_ca_system_score_gemma":0.00010768666,"threshold_uncertainty_score":0.99995923},"labels":[],"label_agreement":null},{"id":"W2909294622","doi":"10.1109/tnse.2019.2929155","title":"HO-OTSVD: A Novel Tensor Decomposition and Its Incremental Decomposition for Cyber–Physical–Social Networks (CPSN)","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Fundamental Research Funds for the Central Universities","keywords":"Singular value decomposition; Orthogonalization; Tensor (intrinsic definition); Lanczos resampling; Computer science; Tensor decomposition; Tucker decomposition; Decomposition; Adjacency matrix; Theoretical computer science; Matrix decomposition; Distributed computing; Mathematics; Algorithm; Eigenvalues and eigenvectors","score_opus":0.019971534297515935,"score_gpt":0.2905657392360518,"score_spread":0.27059420493853586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909294622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54743344,0.000017884484,0.4514786,0.00018158929,0.00021052458,0.00047916063,0.000021329612,0.000107935775,0.00006954714],"genre_scores_gemma":[0.9888181,0.000019418296,0.010614405,0.0001263572,0.00021311056,0.00013943543,0.000005484662,0.000026216274,0.000037462174],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988038,0.000009121366,0.00020952662,0.00036938133,0.00023306755,0.00037510195],"domain_scores_gemma":[0.9993488,0.00022183954,0.00006156541,0.0001298234,0.00010867659,0.00012928093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026577665,0.00018846893,0.0002148675,0.00012577372,0.00061372045,0.00012033744,0.0001217571,0.00007144571,0.000011214358],"category_scores_gemma":[0.000004248023,0.00019398773,0.00006954327,0.0004238457,0.000064502485,0.0003340516,0.0000045077163,0.00017767289,0.000009115483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021009773,0.00082405534,0.00003888216,0.00024058607,0.00013713365,0.0000014249256,0.0010571359,0.41370627,0.5138874,0.05969592,0.00071651937,0.009484585],"study_design_scores_gemma":[0.000981597,0.00016527508,0.0008849655,0.00009949135,0.00008077476,0.000033500324,0.000065265245,0.98950106,0.006764735,0.0007532144,0.0003066238,0.00036351566],"about_ca_topic_score_codex":0.0000028800603,"about_ca_topic_score_gemma":0.0000029928237,"teacher_disagreement_score":0.57579476,"about_ca_system_score_codex":0.00008746706,"about_ca_system_score_gemma":0.000021883248,"threshold_uncertainty_score":0.79105896},"labels":[],"label_agreement":null},{"id":"W2914576459","doi":"10.1109/tnse.2018.2865183","title":"Trust-Based Social Networks with Computing, Caching and Communications: A Deep Reinforcement Learning Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministerio de Economía y Competitividad","keywords":"Computer science; Reinforcement learning; Exploit; Leverage (statistics); Mobile edge computing; Distributed computing; Computation; Mobile device; Social network (sociolinguistics); Scheme (mathematics); Mobile social network; Artificial intelligence; Mobile computing; Computer network; Enhanced Data Rates for GSM Evolution; Social media; Computer security; World Wide Web","score_opus":0.01240932805343792,"score_gpt":0.20963964084445558,"score_spread":0.19723031279101766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914576459","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016838208,0.000117243944,0.98218733,0.00011535765,0.00017193562,0.00010478575,8.220908e-8,0.00019211392,0.00027292626],"genre_scores_gemma":[0.97924626,0.000031797183,0.020408006,0.00017955374,0.0000986425,0.000011260411,4.559852e-7,0.000009165524,0.000014875414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988311,0.00002924407,0.00014868131,0.0003338867,0.0002755664,0.00038153815],"domain_scores_gemma":[0.9993628,0.00007984293,0.000048947524,0.0003112766,0.000092158705,0.00010493726],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00067761476,0.00014646447,0.00013088311,0.0001452312,0.0017183049,0.00031924,0.00048503123,0.000042341195,6.020961e-7],"category_scores_gemma":[0.000004609938,0.00013431396,0.000024816167,0.0007825785,0.0003169565,0.00037343957,0.000018206723,0.00036314613,7.516596e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000074012564,0.00001292385,0.000033042605,0.000006327881,0.000009030685,5.8338514e-7,0.00045354431,0.9798267,0.00008173906,0.0006993492,0.0000059864483,0.018863391],"study_design_scores_gemma":[0.00024668494,0.00014616307,0.00018066225,0.00005332125,0.000011178778,0.000015157493,0.00005282612,0.99894,0.000034313674,0.000002898977,0.00014430696,0.00017247448],"about_ca_topic_score_codex":0.000035603247,"about_ca_topic_score_gemma":0.000009692556,"teacher_disagreement_score":0.96240807,"about_ca_system_score_codex":0.000055771317,"about_ca_system_score_gemma":0.000062822175,"threshold_uncertainty_score":0.99958134},"labels":[],"label_agreement":null},{"id":"W2949219685","doi":"10.1109/tnse.2019.2959230","title":"B-Ride: Ride Sharing With Privacy-Preservation, Trust and Fair Payment Atop Public Blockchain","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Qatar National Research Fund; National Science Foundation","keywords":"Computer security; Payment; Sybil attack; Anonymity; Service (business); Pseudonym; Service provider; Proof-of-work system; Trusted third party; Computer science; Protocol (science); Blockchain; Smart contract; Internet privacy; Single point of failure; Business; Denial-of-service attack; Computer network; Law; Finance; The Internet","score_opus":0.014004002960859381,"score_gpt":0.21221517907373705,"score_spread":0.19821117611287767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949219685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23368749,0.00022986431,0.76293343,0.001851382,0.00039484096,0.00044275913,0.000004288858,0.0003960612,0.000059856586],"genre_scores_gemma":[0.97455657,0.00023364555,0.0247158,0.00012888895,0.00006304881,0.00022121116,0.0000010903229,0.000021228532,0.000058520745],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973498,0.000013120157,0.00031601853,0.001197293,0.0004891023,0.0006346896],"domain_scores_gemma":[0.99799275,0.00008348567,0.00011601844,0.0014117764,0.00018618497,0.00020978264],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009279644,0.00035090002,0.00031749957,0.00042779587,0.00061549485,0.0005524003,0.0016688678,0.00024314917,0.0000032453252],"category_scores_gemma":[0.000015132817,0.00032613738,0.00004512342,0.0013975465,0.0002667088,0.00042375643,0.0001890658,0.0009128085,0.0000031203533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046766095,0.00007174775,0.0008819609,0.0001315137,0.000060643742,0.0000049374444,0.0005709459,0.9618507,0.00023453012,0.02034368,0.000089862435,0.015754784],"study_design_scores_gemma":[0.00023080506,0.00006577119,0.001550685,0.00017172848,0.000018779177,0.000029826842,0.000025050495,0.9937229,0.00067720545,0.0017176371,0.0013621639,0.00042742136],"about_ca_topic_score_codex":0.000051899326,"about_ca_topic_score_gemma":0.000025895084,"teacher_disagreement_score":0.74086905,"about_ca_system_score_codex":0.00014645065,"about_ca_system_score_gemma":0.0002502274,"threshold_uncertainty_score":0.99991906},"labels":[],"label_agreement":null},{"id":"W2956944814","doi":"10.1109/tnse.2019.2928716","title":"Modeling of Bitcoin's Blockchain Delivery Network","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Poisson distribution; Node (physics); Computer network; Partition (number theory); Queue; Distributed computing; Mathematics; Engineering; Statistics","score_opus":0.006569415816294864,"score_gpt":0.1876898200914418,"score_spread":0.18112040427514695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2956944814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27508333,0.0001349443,0.7239586,0.00009757674,0.0003497539,0.00011601482,6.0307895e-7,0.00014822916,0.00011096143],"genre_scores_gemma":[0.9718717,0.00006909375,0.02791645,0.00006653927,0.000036674766,0.000017900962,6.795289e-8,0.0000069718885,0.000014623686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987489,0.00000754037,0.00019907347,0.0003840991,0.00025686587,0.00040353154],"domain_scores_gemma":[0.9992276,0.000059645623,0.000032572807,0.00050044426,0.000097604825,0.00008213636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006053376,0.00012556645,0.00016340885,0.00018032671,0.0002346671,0.00004302691,0.00059583504,0.00008306301,0.00000388285],"category_scores_gemma":[0.0000029116402,0.00012588414,0.000040651452,0.0016496157,0.00009366236,0.0001792638,0.000012792587,0.0002376909,0.0000071646045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017240422,0.000015177163,0.000016929098,0.000008461538,0.0000060845173,4.651019e-7,0.00005803331,0.980726,0.0010137171,0.011791589,0.000011570422,0.006350254],"study_design_scores_gemma":[0.00010337423,0.000048113758,0.000037340764,0.000043374053,0.0000045365896,0.000008791157,0.000011035351,0.99779344,0.0011425063,0.0005583454,0.000116544536,0.0001325916],"about_ca_topic_score_codex":0.000021987751,"about_ca_topic_score_gemma":0.000006686732,"teacher_disagreement_score":0.6967884,"about_ca_system_score_codex":0.00003462286,"about_ca_system_score_gemma":0.00007928384,"threshold_uncertainty_score":0.51334065},"labels":[],"label_agreement":null},{"id":"W2964421893","doi":"10.1109/tnse.2019.2932727","title":"Repairable Fountain Coded Storage Systems for Multi-Tier Mobile Edge Caching Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Cloud computing; Exploit; Upload; Locality; Enhanced Data Rates for GSM Evolution; Base station; Mobile edge computing; Distributed computing; Server; Operating system; Computer security; Telecommunications","score_opus":0.014328571936968699,"score_gpt":0.21765231862568615,"score_spread":0.20332374668871744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964421893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046943147,0.00061437,0.94784373,0.000016480448,0.0037429086,0.00050262315,0.0000028006234,0.0002927889,0.00004113938],"genre_scores_gemma":[0.9938147,0.00008387022,0.0053360523,0.000080896076,0.00012698365,0.00013143031,5.3004067e-7,0.000017361846,0.00040818276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836063,0.000020585412,0.00021495743,0.00053262553,0.00028667966,0.0005845424],"domain_scores_gemma":[0.9991073,0.00014783765,0.00004746033,0.00044468133,0.00010246408,0.00015026417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245668,0.0001849806,0.0002110566,0.00016991673,0.0005139826,0.00037790413,0.0004840724,0.000070837705,0.000001377489],"category_scores_gemma":[0.0000063736425,0.00018053412,0.000077631,0.0006972648,0.000045390178,0.0007936811,0.000008454826,0.00026258748,0.0000065221643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006793418,0.00002092624,0.000016146292,0.000024025656,0.0000110124165,0.000001616628,0.000102230406,0.99555624,0.0010637786,0.0004535657,0.00009269734,0.0026509704],"study_design_scores_gemma":[0.00033923742,0.00012352802,0.000032348224,0.000107333035,0.000008941555,0.000015655427,0.000045482604,0.9976956,0.000083840416,0.000002847017,0.0013158605,0.00022930921],"about_ca_topic_score_codex":0.00007696108,"about_ca_topic_score_gemma":0.000006415895,"teacher_disagreement_score":0.9468715,"about_ca_system_score_codex":0.0001301559,"about_ca_system_score_gemma":0.000086230575,"threshold_uncertainty_score":0.73619676},"labels":[],"label_agreement":null},{"id":"W2976075487","doi":"10.1109/tnse.2019.2943816","title":"Informative Path Planning for Location Fingerprint Collection","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Greedy algorithm; Fingerprint (computing); Motion planning; Data mining; Constraint (computer-aided design); Artificial intelligence; Algorithm; Mathematical optimization; Mathematics; Robot","score_opus":0.006846594532282774,"score_gpt":0.20008909247636741,"score_spread":0.19324249794408463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2976075487","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07389861,0.000054252636,0.92409086,0.000012627485,0.0009158067,0.00024057327,0.0000016688365,0.00045432372,0.0003312908],"genre_scores_gemma":[0.9970107,0.000043517466,0.0027910431,0.000024088722,0.00002880046,0.000057984595,7.640121e-7,0.000012578157,0.000030533756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993589,0.000001613701,0.00013051178,0.00012338888,0.000134936,0.00025065802],"domain_scores_gemma":[0.9997128,0.000050592873,0.000015041158,0.00010280745,0.00008067415,0.00003803318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020446416,0.000102975086,0.00009228808,0.00019498059,0.00019528644,0.000059193204,0.00008788048,0.00005888069,0.000004111361],"category_scores_gemma":[0.00000855397,0.000104897874,0.000019493527,0.0008353278,0.000036238856,0.00034068056,0.0000011223934,0.000121281504,0.0000069897874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004599426,0.0000024586245,0.000019421539,0.000046050194,0.00000581119,7.994014e-8,0.00030621,0.9939265,0.0009987536,0.00024232638,0.000107849075,0.0043399325],"study_design_scores_gemma":[0.00016107758,0.00005669779,0.0002827009,0.00008313038,0.0000050631847,0.0000028319657,0.00016326064,0.9827938,0.015354699,0.00003232593,0.0009269192,0.00013751384],"about_ca_topic_score_codex":0.0000017914708,"about_ca_topic_score_gemma":7.1444896e-7,"teacher_disagreement_score":0.9231121,"about_ca_system_score_codex":0.00010756885,"about_ca_system_score_gemma":0.000031208714,"threshold_uncertainty_score":0.4277611},"labels":[],"label_agreement":null},{"id":"W3000275637","doi":"10.1109/tnse.2020.2966504","title":"Data Collection Versus Data Estimation: A Fundamental Trade-Off in Dynamic Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University","keywords":"Computer science; Mathematical optimization; Markov decision process; Data collection; Convergence (economics); Data quality; Markov process; Mathematics; Statistics","score_opus":0.03471512441312536,"score_gpt":0.255216889700903,"score_spread":0.22050176528777765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000275637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015538769,0.0002128454,0.9948628,0.00093346875,0.0019605253,0.00016796794,0.000028192257,0.00023885096,0.00004148873],"genre_scores_gemma":[0.9744269,0.00028638163,0.02492906,0.00019544658,0.00011499423,0.0000069376165,0.000023428514,0.000011809808,0.0000050308063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806356,0.000021027063,0.00025614037,0.0008167679,0.00039212126,0.00045039525],"domain_scores_gemma":[0.99875814,0.00011575834,0.00004438477,0.00082915305,0.000023370374,0.00022922234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052122393,0.0001762909,0.00016546478,0.00013464122,0.00038622326,0.00038812307,0.0014052937,0.000067615816,0.000005706083],"category_scores_gemma":[0.000020194928,0.00019037121,0.000019296596,0.0031753953,0.00008961309,0.0017884185,0.00005209555,0.00036710588,0.000004651165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002399371,0.000019666057,0.000001963244,0.0000042551274,0.000008337449,0.0000063236107,0.000058108846,0.9030198,0.000026415628,0.000042009022,0.00042340936,0.09636575],"study_design_scores_gemma":[0.000518139,0.00011847007,0.0002142742,0.000028194007,0.000009691088,0.000017536913,0.000028635472,0.9968823,0.000015232183,0.000004733002,0.0019648557,0.00019790078],"about_ca_topic_score_codex":0.000010577349,"about_ca_topic_score_gemma":0.00004795043,"teacher_disagreement_score":0.97287303,"about_ca_system_score_codex":0.00011651865,"about_ca_system_score_gemma":0.00010925503,"threshold_uncertainty_score":0.7763112},"labels":[],"label_agreement":null},{"id":"W3007170127","doi":"10.1109/tnse.2020.2974739","title":"Impact of Node Churn in the Bitcoin Network","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Churning; Node (physics); Computer science; Computer network; Synchronization (alternating current); Markov process; Markov chain; Block (permutation group theory); Distributed computing; Real-time computing; Channel (broadcasting); Engineering","score_opus":0.01123995421984287,"score_gpt":0.22304997067837606,"score_spread":0.2118100164585332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007170127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14557695,0.00009027283,0.8529513,0.001036957,0.00008518664,0.00010834052,8.542211e-7,0.000077593235,0.000072547315],"genre_scores_gemma":[0.99244106,0.00005234384,0.0072382255,0.00020379266,0.00004050943,0.00001994014,5.852912e-8,0.0000033627487,6.934417e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911845,0.00001146854,0.00014645858,0.00024227446,0.00018519732,0.00029614166],"domain_scores_gemma":[0.99950093,0.000080043224,0.000028154367,0.0002963791,0.000031788986,0.00006271505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049568975,0.000091225644,0.00011193695,0.00008003769,0.0001726962,0.000046687514,0.000720991,0.000046814686,0.000001947264],"category_scores_gemma":[0.000006622462,0.000067761204,0.0000407781,0.0027279742,0.00012040009,0.00017910384,0.000006369372,0.000259253,0.0000018658046],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002307222,0.000022120457,0.0001916112,0.0000045792203,0.000004861271,0.0000014617566,0.00046040554,0.9842619,0.00056809926,0.0046734675,0.000116561285,0.009692649],"study_design_scores_gemma":[0.000106765256,0.0000961929,0.0075869556,0.000018059653,0.0000032213331,0.000009534,0.000014412916,0.9912983,0.00029562975,0.00028753385,0.00018671439,0.00009664806],"about_ca_topic_score_codex":0.000024605039,"about_ca_topic_score_gemma":0.000007784039,"teacher_disagreement_score":0.8468641,"about_ca_system_score_codex":0.000025133002,"about_ca_system_score_gemma":0.00006824821,"threshold_uncertainty_score":0.2763222},"labels":[],"label_agreement":null},{"id":"W3010301175","doi":"10.1109/tnse.2020.2978856","title":"Deep Reinforcement Learning Based Resource Management for Multi-Access Edge Computing in Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":213,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Resource allocation; Quality of service; Exploit; Resource management (computing); Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Vehicular ad hoc network; Edge device; Computer network; Artificial intelligence; Wireless","score_opus":0.016956029941592118,"score_gpt":0.2267990846195311,"score_spread":0.20984305467793898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010301175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00821273,0.00028734503,0.98996216,0.000057297442,0.00040524048,0.0005627483,3.829855e-7,0.00041020807,0.00010191355],"genre_scores_gemma":[0.9886407,0.00009507292,0.010679637,0.00026061988,0.00017556848,0.000078895064,0.0000036661602,0.000057952395,0.000007859305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801856,0.000016639156,0.00034565662,0.00044411956,0.00031136165,0.0008636669],"domain_scores_gemma":[0.9993834,0.000091782196,0.000034039786,0.0001839876,0.000039763247,0.00026702107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061796414,0.00028514877,0.0002603539,0.00020432755,0.00032453486,0.00018545464,0.00035643097,0.00009112441,0.000005322208],"category_scores_gemma":[0.000008467564,0.00032516645,0.00007299726,0.001410712,0.00006303772,0.0002907446,0.000010518587,0.0005081538,0.000002300035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015782258,0.000010079553,0.000024668847,0.00012391875,0.000023621722,0.000011279211,0.00011615072,0.991746,0.00009943124,0.000022465696,0.000056788067,0.007749779],"study_design_scores_gemma":[0.0007501624,0.00006000907,0.00020114983,0.00019248844,0.00002532303,0.0000024904607,0.0000426456,0.99601096,0.00024795922,5.7656564e-7,0.0021215826,0.000344647],"about_ca_topic_score_codex":0.0000033494557,"about_ca_topic_score_gemma":0.000008306653,"teacher_disagreement_score":0.980428,"about_ca_system_score_codex":0.00017492428,"about_ca_system_score_gemma":0.000020270885,"threshold_uncertainty_score":0.99992},"labels":[],"label_agreement":null},{"id":"W3012496643","doi":"10.1109/tnse.2020.2981449","title":"Minimizing Financial Cost of DDoS Attack Defense in Clouds With Fine-Grained Resource Management","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Shenzhen Fundamental Research Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Denial-of-service attack; Computer science; Cloud computing; Computer security; Application layer DDoS attack; Resource (disambiguation); Popularity; Competition (biology); Computer network; The Internet","score_opus":0.013864758102319668,"score_gpt":0.20253527631564225,"score_spread":0.1886705182133226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3012496643","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07189034,0.000048403108,0.92684674,0.0004476195,0.00022847531,0.00020821302,7.3819143e-7,0.000085616404,0.000243828],"genre_scores_gemma":[0.98606443,0.000053199827,0.01354538,0.00023831405,0.00006298284,0.000020085825,1.4426593e-7,0.000007152322,0.00000831741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987514,0.000015480557,0.00020678839,0.00036024893,0.00032761905,0.00033846885],"domain_scores_gemma":[0.9995378,0.000054548185,0.000042673277,0.00019539356,0.000040358056,0.00012922157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003507777,0.00013110359,0.00015592371,0.0001597817,0.00017900426,0.00006616875,0.0003383193,0.000042110718,0.000002948383],"category_scores_gemma":[0.0000072393727,0.0001247002,0.000029452867,0.0022940673,0.000090005735,0.000331732,0.000010825984,0.00021735203,0.00000193285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047143767,0.00001989503,0.000010234727,0.000029767454,0.00000456433,0.000012410507,0.00054214994,0.9681758,0.00034581663,0.0007998415,0.0001259328,0.029886426],"study_design_scores_gemma":[0.0005230557,0.0002606629,0.00043533818,0.00017090418,0.000008271988,0.0000117929885,0.0000357912,0.9929181,0.0022590677,0.000021644173,0.0031557996,0.00019957944],"about_ca_topic_score_codex":0.0000051321726,"about_ca_topic_score_gemma":0.000019076006,"teacher_disagreement_score":0.9141741,"about_ca_system_score_codex":0.00004104801,"about_ca_system_score_gemma":0.000044644894,"threshold_uncertainty_score":0.5085127},"labels":[],"label_agreement":null},{"id":"W3037958117","doi":"10.1109/tnse.2020.3004312","title":"AESMOTE: Adversarial Reinforcement Learning With SMOTE for Anomaly Detection","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":135,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Intrusion detection system; Anomaly detection; Exploit; Artificial intelligence; Machine learning; Adversarial system; Class (philosophy); Data mining; Computer security","score_opus":0.009213995596423915,"score_gpt":0.18755873854833655,"score_spread":0.17834474295191263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037958117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01581922,0.00002093522,0.98262435,0.00028662928,0.00071715337,0.00022052314,2.648881e-7,0.00025076448,0.00006013947],"genre_scores_gemma":[0.9889428,0.000038683847,0.010489802,0.00023550543,0.00023789832,0.000028828747,1.9590435e-7,0.00000979661,0.000016481934],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987549,0.00001042826,0.00015333826,0.00039633826,0.0003155524,0.0003694207],"domain_scores_gemma":[0.99948984,0.000056397577,0.000044871515,0.00014005658,0.00009166734,0.00017715886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003440364,0.0001413925,0.00012036589,0.00010624135,0.0007068428,0.00018649688,0.0002517875,0.000052266576,0.0000036921338],"category_scores_gemma":[0.000012180712,0.00013220338,0.000038534978,0.0011626357,0.00006371762,0.0007995758,0.000005667925,0.00026251152,0.0000033538538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053289496,0.0000047926997,0.0000010956519,0.000011048603,0.000007840489,9.630988e-7,0.00024215071,0.9514531,0.003734801,0.0002301783,0.0000134845595,0.044247266],"study_design_scores_gemma":[0.0003760349,0.0007882889,0.000027413373,0.000028767177,0.0000106032885,0.0000104209,0.000013884332,0.97710764,0.016991805,0.0000143251,0.00445964,0.00017116715],"about_ca_topic_score_codex":0.000011517553,"about_ca_topic_score_gemma":0.0000066133557,"teacher_disagreement_score":0.9731236,"about_ca_system_score_codex":0.00005933831,"about_ca_system_score_gemma":0.00006366075,"threshold_uncertainty_score":0.5436535},"labels":[],"label_agreement":null},{"id":"W3046373281","doi":"10.1109/tnse.2020.3013064","title":"Toward Efficient Data Trading in AI Enabled Reconfigurable Wireless Sensor Network Using Contract and Game Theories","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Zhejiang University; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Raw data; Nash equilibrium; Incentive; Wireless sensor network; Data collection; Control reconfiguration; Operator (biology); Wireless network; Game theory; Wireless; Distributed computing; Computer network; Mathematical optimization; Embedded system; Telecommunications","score_opus":0.028207885017472487,"score_gpt":0.23135098312679844,"score_spread":0.20314309810932596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3046373281","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05774404,0.00024207386,0.94014895,0.0005258321,0.0009062486,0.00018602972,0.000009207673,0.00017704577,0.00006056869],"genre_scores_gemma":[0.9923808,0.00014398695,0.0068520266,0.0003954317,0.00020296666,0.000006073336,9.066752e-7,0.000014118062,0.0000036895924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978883,0.000036176967,0.0003073218,0.00073739095,0.00033261682,0.0006981816],"domain_scores_gemma":[0.9990237,0.00017632142,0.0000568346,0.0003786938,0.00006611465,0.00029835815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084774045,0.00022533418,0.00028813115,0.000118425574,0.00037585042,0.0005441203,0.00055805675,0.00007742891,0.0000061503893],"category_scores_gemma":[0.000019146746,0.00022200755,0.000029281842,0.002024296,0.00014001409,0.00082443934,0.000016597536,0.0004179156,0.0000015119876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015968804,0.000014216027,0.000010184944,0.00001549764,0.000010044712,0.000017130313,0.00031679167,0.98260015,0.001062275,0.000720516,0.00002764957,0.015189552],"study_design_scores_gemma":[0.00032432209,0.000057338046,0.0000859293,0.00009927271,0.000011160986,0.00005140296,0.00005602592,0.99787086,0.0007032669,0.000060421018,0.0004210971,0.00025892074],"about_ca_topic_score_codex":0.000034013745,"about_ca_topic_score_gemma":0.000006601262,"teacher_disagreement_score":0.9346368,"about_ca_system_score_codex":0.00006678718,"about_ca_system_score_gemma":0.000102582635,"threshold_uncertainty_score":0.9053205},"labels":[],"label_agreement":null},{"id":"W3048295601","doi":"10.1109/tnse.2020.3014385","title":"Learning in the Air: Secure Federated Learning for UAV-Assisted Crowdsensing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":305,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Federated learning; Crowdsensing; Differential privacy; Reinforcement learning; Data sharing; Information privacy; Artificial intelligence; Vulnerability (computing); Computer security; Distributed computing; Machine learning; Data mining","score_opus":0.023622329326258167,"score_gpt":0.23522581122288852,"score_spread":0.21160348189663036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3048295601","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028355364,0.000057324694,0.9597041,0.0107270405,0.00027467048,0.0001840624,6.2752764e-7,0.00065091986,0.00004590759],"genre_scores_gemma":[0.939739,0.000033854227,0.059780344,0.00036305722,0.000047611207,0.000021119371,5.310913e-7,0.000010447751,0.0000040244754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985183,0.000038469294,0.00018025683,0.00046435202,0.00031026287,0.00048839126],"domain_scores_gemma":[0.99888444,0.00032119208,0.00004097943,0.00061584887,0.00006422637,0.000073319236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009803134,0.00014956265,0.00013987355,0.00013684314,0.0008097249,0.00037363835,0.0034430195,0.00007147471,7.3128984e-7],"category_scores_gemma":[0.0012015807,0.00012881574,0.00003503881,0.0022766513,0.00009930319,0.0006681473,0.00019568685,0.000698712,0.0000019744161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000066646,0.000009967192,0.00002053949,0.000019907693,0.0000061245896,0.00000790845,0.0005311338,0.9513765,0.00369651,0.0001154143,0.0007299139,0.04347943],"study_design_scores_gemma":[0.00017298985,0.00011667475,0.00026181233,0.000058460984,0.0000042639263,0.000017116354,0.00016445403,0.99605656,0.0015134496,0.0001671891,0.0013098646,0.00015718551],"about_ca_topic_score_codex":0.000007048408,"about_ca_topic_score_gemma":0.0000073792216,"teacher_disagreement_score":0.9113836,"about_ca_system_score_codex":0.000057112054,"about_ca_system_score_gemma":0.000077303754,"threshold_uncertainty_score":0.6398044},"labels":[],"label_agreement":null},{"id":"W3056202775","doi":"10.1109/tnse.2020.3017389","title":"Transaction Throughput Provisioning Technique for Blockchain-Based Industrial IoT Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Blockchain; Computer science; Transaction processing; Database transaction; Cryptocurrency; Throughput; Distributed transaction; Provisioning; Transaction processing system; Computer network; Distributed computing; Computer security; Database; Telecommunications","score_opus":0.018734682442018733,"score_gpt":0.22069272554295116,"score_spread":0.20195804310093243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3056202775","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005555348,0.00005150519,0.99036247,0.002418065,0.0003121522,0.0007604027,0.000002292199,0.00052303635,0.0000147392175],"genre_scores_gemma":[0.9328023,0.0000067776805,0.06613681,0.0004945913,0.00015103449,0.00039145318,2.5412032e-7,0.000014198816,0.0000025900122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984189,0.000012613326,0.00023627181,0.00060359464,0.00024911374,0.00047950435],"domain_scores_gemma":[0.9991965,0.00014409941,0.00005414007,0.00032232748,0.00010228101,0.000180638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006188572,0.00019207041,0.00018538741,0.00015592878,0.0007064752,0.00011588179,0.00059319584,0.00019980705,0.0000021825165],"category_scores_gemma":[0.000016068068,0.00019435624,0.000065462744,0.0018914513,0.0001472612,0.0000784193,0.0000045986526,0.00047727398,0.0000010273055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012573942,0.000024947529,0.0000022599934,0.000010600887,0.0000064407914,7.381956e-7,0.00007957154,0.9641397,0.0034356564,0.0020629277,0.000053422704,0.03017114],"study_design_scores_gemma":[0.00034318212,0.00020587347,0.000006895975,0.000038111288,0.000010769667,0.0000056851754,0.000009057239,0.97511953,0.022697484,0.00011352096,0.001240709,0.00020916133],"about_ca_topic_score_codex":0.0000062408208,"about_ca_topic_score_gemma":0.0000025078523,"teacher_disagreement_score":0.9272469,"about_ca_system_score_codex":0.00006671955,"about_ca_system_score_gemma":0.00016280403,"threshold_uncertainty_score":0.79256177},"labels":[],"label_agreement":null},{"id":"W3084688615","doi":"10.1109/tnse.2020.3022869","title":"FAST-ODT: A Lightweight Outlier Detection Scheme for Categorical Data Sets","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Categorical variable; Anomaly detection; Computer science; Outlier; Data mining; Data set; Tree (set theory); Pattern recognition (psychology); Artificial intelligence; Intrusion detection system; Local outlier factor; Machine learning; Mathematics","score_opus":0.029524753623604766,"score_gpt":0.24527070003992052,"score_spread":0.21574594641631575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3084688615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011815855,0.00003938035,0.99668956,0.0010425106,0.00029643485,0.00025140814,0.000006786366,0.0004377788,0.00005453725],"genre_scores_gemma":[0.90904516,0.000040481584,0.09035582,0.00029336032,0.00013402452,0.00009995325,8.9071733e-7,0.000010926765,0.000019394241],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987155,0.000005351836,0.00016606234,0.0005682158,0.00022654244,0.00031831936],"domain_scores_gemma":[0.9991769,0.000049582683,0.0000332433,0.00045752717,0.00007764404,0.0002050998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002771315,0.00012982967,0.000115476214,0.0000926308,0.00050603173,0.00018618713,0.0007546309,0.000056264922,0.0000026156263],"category_scores_gemma":[0.000010169626,0.00012530352,0.000034142373,0.0012922059,0.000057304962,0.00074710674,0.0000180124,0.00017978258,0.00000823275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035648685,0.00012182473,0.000008622275,0.00007960427,0.00004825805,0.0000046900514,0.00065885205,0.21518984,0.06290886,0.010914146,0.00214639,0.70788324],"study_design_scores_gemma":[0.00010411731,0.00010520886,0.000030033396,0.000006440326,0.0000073882798,0.000011096387,0.000007380953,0.9693084,0.015407624,0.00010429634,0.014749842,0.00015819994],"about_ca_topic_score_codex":0.000005196127,"about_ca_topic_score_gemma":0.000003069109,"teacher_disagreement_score":0.90786356,"about_ca_system_score_codex":0.000042796863,"about_ca_system_score_gemma":0.00006236388,"threshold_uncertainty_score":0.51097286},"labels":[],"label_agreement":null},{"id":"W3088246894","doi":"10.1109/tnse.2020.3026637","title":"COVID-19 Networking Demand: An Auction-Based Mechanism for Automated Selection of Edge Computing Services","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Service provider; Cloud computing; Edge computing; Quality of service; Software deployment; Robustness (evolution); Computer security; Enhanced Data Rates for GSM Evolution; Computer network; Service (business); Business; Telecommunications","score_opus":0.013805257993598153,"score_gpt":0.2408957815937302,"score_spread":0.22709052360013204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088246894","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024557995,0.000023945722,0.9730499,0.0007014604,0.00030996065,0.0002460359,0.0000021755357,0.001104995,0.000003570521],"genre_scores_gemma":[0.92853814,0.000009829036,0.07061773,0.0007043923,0.00008732454,0.000033178425,7.447047e-7,0.000008226011,4.3511275e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988416,0.000014470523,0.0002121801,0.00043399777,0.00018395769,0.0003137944],"domain_scores_gemma":[0.9992277,0.00010875366,0.00007751225,0.00019700416,0.00013835955,0.00025066093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051746843,0.00012965593,0.00015352032,0.00015760872,0.00068813155,0.00008105613,0.0004552312,0.00008973119,0.0000012434386],"category_scores_gemma":[0.000010176767,0.0001388127,0.000035946072,0.0017063761,0.000077874414,0.0002848515,0.000005928909,0.00015611814,4.3952616e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005689827,0.000022511824,0.000011087241,0.00006628446,0.000007127745,2.3774271e-7,0.0002741586,0.9859868,0.0033877138,0.0061141695,0.000014693138,0.0041094716],"study_design_scores_gemma":[0.00021275858,0.00014377148,0.0000325595,0.00002364638,0.000010583692,0.0000054329676,0.000025112286,0.99146765,0.00740059,0.000355633,0.00018659366,0.00013564194],"about_ca_topic_score_codex":0.000023862358,"about_ca_topic_score_gemma":0.000017491951,"teacher_disagreement_score":0.90398014,"about_ca_system_score_codex":0.000064083695,"about_ca_system_score_gemma":0.00018917547,"threshold_uncertainty_score":0.5660618},"labels":[],"label_agreement":null},{"id":"W3091288926","doi":"10.1109/tnse.2020.3027796","title":"Blockchain-Based Smart Advertising Network With Privacy-Preserving Accountability","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Cryptography; Argument (complex analysis); World Wide Web; Computer security","score_opus":0.010024441408319724,"score_gpt":0.20512874316594257,"score_spread":0.19510430175762283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3091288926","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1251945,0.00008842053,0.8717454,0.002040018,0.00015427273,0.00019986804,9.787806e-7,0.0005088444,0.000067700836],"genre_scores_gemma":[0.9410809,0.000008616727,0.058104202,0.0006735572,0.00007277073,0.000046102185,1.2571306e-7,0.000011421833,0.0000022551696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818623,0.000014957918,0.00019956687,0.0006518783,0.00037369173,0.00057364476],"domain_scores_gemma":[0.9988488,0.00012350606,0.0000458202,0.00064629695,0.00010963828,0.00022595256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005610708,0.00019412975,0.0001834545,0.000092289985,0.0007238011,0.00015843153,0.0010355926,0.0000840222,0.0000056425306],"category_scores_gemma":[0.000016093683,0.00017916967,0.000035913676,0.002580102,0.00021209235,0.00019983022,0.000024271372,0.00039888936,0.0000036367285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000090275435,0.000022144111,0.00017137974,0.000018504086,0.000007837984,0.0000020295229,0.0002014627,0.98939663,0.0004918127,0.0009813652,0.000057819136,0.008639967],"study_design_scores_gemma":[0.00019439029,0.00009872668,0.00071689946,0.0000561801,0.000008874142,0.000007726791,0.000012297789,0.99555045,0.0019493968,0.00014230654,0.0010391264,0.00022361243],"about_ca_topic_score_codex":0.000021238326,"about_ca_topic_score_gemma":0.000018235267,"teacher_disagreement_score":0.81588644,"about_ca_system_score_codex":0.00006668714,"about_ca_system_score_gemma":0.00016005438,"threshold_uncertainty_score":0.7306327},"labels":[],"label_agreement":null},{"id":"W3093556640","doi":"10.1109/tnse.2020.3032415","title":"Deep Learning-Enabled Threat Intelligence Scheme in the Internet of Things Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Internet of Things; Computer science; Scheme (mathematics); Computer security; Identification (biology); Deep learning; Artificial intelligence; Extractor; Constant false alarm rate; The Internet; Engineering; World Wide Web","score_opus":0.011742546499975314,"score_gpt":0.20272399418746645,"score_spread":0.19098144768749115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093556640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01426516,0.0002373888,0.98433375,0.00038334978,0.00039650273,0.00012622586,4.0456722e-8,0.00009454908,0.00016303416],"genre_scores_gemma":[0.99225134,0.00033596274,0.006818609,0.0004978437,0.00007001134,0.000013181919,1.0074127e-7,0.0000064169526,0.000006533364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986279,0.000039301565,0.0002521663,0.00035433457,0.00036358493,0.0003627126],"domain_scores_gemma":[0.9994139,0.00016162463,0.00005521205,0.00020612638,0.00006385651,0.00009925239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008801775,0.0001405524,0.00015641112,0.000120301134,0.00020520775,0.00015723765,0.0008092885,0.000062847954,0.000008851108],"category_scores_gemma":[0.000024194542,0.00011313071,0.000044188706,0.00242292,0.00013027685,0.0008397667,0.000014993658,0.0005970291,0.000003838841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010362404,0.00001487998,0.0000204395,0.0000106338175,0.000004095462,0.0000029287905,0.0022505801,0.9494088,0.00025563184,0.0024000737,0.000016956055,0.045604575],"study_design_scores_gemma":[0.00007218133,0.0001767114,0.00010390977,0.00005879654,0.0000034941252,0.000011296085,0.000068380155,0.99763304,0.0013071328,0.00010309739,0.00034191186,0.000120055665],"about_ca_topic_score_codex":0.000029694373,"about_ca_topic_score_gemma":0.0000064615533,"teacher_disagreement_score":0.97798616,"about_ca_system_score_codex":0.00003077959,"about_ca_system_score_gemma":0.000029760815,"threshold_uncertainty_score":0.46133363},"labels":[],"label_agreement":null},{"id":"W3097637184","doi":"10.1109/tnse.2020.3035964","title":"A Graph-Theoretic Equilibrium Analysis of Attacker-Defender Game on Consensus Dynamics Under $\\mathcal {H}_2$ Performance Metric","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Notation; Network topology; Norm (philosophy); Metric (unit); Discrete mathematics; Game theory; Graph; Computer science; Theoretical computer science; Graph theory; Mathematics; Combinatorics; Mathematical economics; Computer network; Engineering; Arithmetic","score_opus":0.017663726207209733,"score_gpt":0.21923280397010578,"score_spread":0.20156907776289604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3097637184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22384003,0.000058014877,0.77501565,0.00031247028,0.00040559866,0.00013357376,0.000014621191,0.0001383647,0.00008166755],"genre_scores_gemma":[0.9981845,0.000027905018,0.0015577596,0.000161747,0.00003231439,0.000014001421,0.0000013587094,0.000012003914,0.000008385559],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784505,0.000033006676,0.00036744095,0.0005628702,0.0006682851,0.0005233341],"domain_scores_gemma":[0.9988339,0.00022872393,0.00009470134,0.0004394536,0.00013409117,0.0002691249],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327612,0.00022647528,0.0003813544,0.0007133517,0.0001402904,0.00014544796,0.0006467962,0.00007070309,0.00000469254],"category_scores_gemma":[0.000022450504,0.0002158874,0.00014633329,0.008574026,0.00020984093,0.0002855924,0.000010685375,0.00024845378,0.0000075152952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014151244,0.00002813121,0.0000743117,0.000027370465,0.00014195403,0.0000031259679,0.00013292024,0.9926276,0.00071484287,0.004129578,0.00001102448,0.0020949761],"study_design_scores_gemma":[0.0002781076,0.00015786439,0.0016356565,0.000037667767,0.000145557,0.0000048251727,0.000030657306,0.99694484,0.00050916494,0.000020928303,0.000019715852,0.00021502149],"about_ca_topic_score_codex":0.000009057151,"about_ca_topic_score_gemma":0.0000036714862,"teacher_disagreement_score":0.7743445,"about_ca_system_score_codex":0.00011642183,"about_ca_system_score_gemma":0.00009076827,"threshold_uncertainty_score":0.8803633},"labels":[],"label_agreement":null},{"id":"W3112674834","doi":"10.1109/tnse.2020.3045263","title":"Global Visual and Semantic Observations for Outdoor Robot Localization","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Robotics and Sensor-Based Localization","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer vision; Computer science; Simultaneous localization and mapping; Robot; Gaussian process; Orb (optics); Landmark; Process (computing); Gaussian; Mobile robot; Image (mathematics)","score_opus":0.0200176156381834,"score_gpt":0.2208409600972479,"score_spread":0.2008233444590645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112674834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018002987,0.00008354298,0.9809429,0.00018533903,0.00037608258,0.00017791985,0.0000075999346,0.00020705305,0.000016563261],"genre_scores_gemma":[0.9938959,0.00010299195,0.0056643444,0.00019761453,0.00009934347,0.00001649738,0.0000029888486,0.000017118533,0.000003207705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924856,0.0000033741617,0.00014919665,0.00019907743,0.00015089363,0.00024890256],"domain_scores_gemma":[0.9996739,0.00003484813,0.000011712884,0.000062569015,0.000064501946,0.00015248424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010482912,0.00012347668,0.00011300085,0.000048700316,0.00021224843,0.00009813744,0.00006179811,0.0000481586,0.0000014573169],"category_scores_gemma":[0.000012497559,0.0001330481,0.000021829113,0.00078381266,0.000052107494,0.00022475925,0.0000012007364,0.000060982722,9.12606e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040610203,0.0000052461883,0.00006959262,0.00005393735,0.00000795469,3.6349238e-7,0.000065662876,0.99502695,0.0011609859,0.0003064155,0.00008261825,0.0032161947],"study_design_scores_gemma":[0.00017690704,0.00005525488,0.0005375454,0.000029728568,0.00002120222,0.000002257486,0.000021442565,0.9980477,0.0005548181,0.000021808819,0.00038519446,0.00014613991],"about_ca_topic_score_codex":0.0000037846169,"about_ca_topic_score_gemma":0.000007646096,"teacher_disagreement_score":0.9758929,"about_ca_system_score_codex":0.000046103774,"about_ca_system_score_gemma":0.000024304994,"threshold_uncertainty_score":0.5425544},"labels":[],"label_agreement":null},{"id":"W3115157362","doi":"10.1109/tnse.2020.3047232","title":"Distributed Prescribed-Time Interval Bipartite Consensus of Multi-Agent Systems on Directed Graphs: Theory and Experiment","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":90,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Qatar National Research Fund; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Bipartite graph; Multi-agent system; Spanning tree; Laplacian matrix; Interval (graph theory); Protocol (science); Computer science; Consensus; Directed graph; Strongly connected component; Mathematics; Mathematical optimization; Topology (electrical circuits); Theoretical computer science; Discrete mathematics; Algorithm; Combinatorics; Graph; Artificial intelligence","score_opus":0.01787272224156212,"score_gpt":0.22009656368736633,"score_spread":0.20222384144580421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115157362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0617058,0.00048709993,0.9360559,0.00014955954,0.00079197047,0.00040325103,0.00005268277,0.00033578742,0.000017933582],"genre_scores_gemma":[0.9980617,0.000028525285,0.0017434098,0.00005423099,0.000033225937,0.00005309502,0.0000014768526,0.000012001237,0.000012297285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981292,0.0000952872,0.00037523056,0.0005405458,0.00042656856,0.00043315525],"domain_scores_gemma":[0.99891555,0.00022989968,0.00009248833,0.00033133174,0.000114164344,0.00031656775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006962715,0.00023400644,0.00032105358,0.00014260113,0.00020394786,0.00019177423,0.000428111,0.000057220175,0.0000021486178],"category_scores_gemma":[0.00004455985,0.00021395068,0.000061063634,0.0010266745,0.00017794207,0.00023070005,0.000014336367,0.00017063633,0.000006279897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000934299,0.00011868035,0.000023471326,0.00008179597,0.0001046088,0.000014925722,0.0010751721,0.9184364,0.07352862,0.0032485416,0.00023030749,0.0030440218],"study_design_scores_gemma":[0.0006001278,0.0002116266,0.00024820102,0.00018837317,0.000020710857,0.00001042962,0.00006612184,0.9884174,0.009743829,0.000005936972,0.00026257694,0.00022466537],"about_ca_topic_score_codex":0.000018548182,"about_ca_topic_score_gemma":8.5833983e-7,"teacher_disagreement_score":0.93635595,"about_ca_system_score_codex":0.00006347115,"about_ca_system_score_gemma":0.000051108815,"threshold_uncertainty_score":0.8724656},"labels":[],"label_agreement":null},{"id":"W3118420191","doi":"10.1109/tnse.2021.3050034","title":"The Impact of Selfish Mining on Bitcoin Network Performance","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Block (permutation group theory); Node (physics); Hash function; Computer network; Revenue; Network security; Computer security; Economics; Engineering; Mathematics","score_opus":0.007139335113003661,"score_gpt":0.21216965326307125,"score_spread":0.2050303181500676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118420191","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40410718,0.00018283115,0.59465355,0.0002535354,0.00034929393,0.00007439673,8.2053964e-7,0.00011945027,0.00025896105],"genre_scores_gemma":[0.99270105,0.0002940143,0.0068738773,0.000038292208,0.000045065077,0.000020340984,8.640425e-8,0.0000051078423,0.000022159871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989439,0.000010855123,0.0001590918,0.00028601175,0.00021322032,0.00038691345],"domain_scores_gemma":[0.9991225,0.00017565538,0.000038634076,0.00048973353,0.00010339623,0.00007010279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005838689,0.000109651686,0.00011318413,0.000070890186,0.0007367247,0.000094471434,0.0004963647,0.000054362976,0.0000017459572],"category_scores_gemma":[0.000009143955,0.00008304858,0.000049866736,0.0019907153,0.00015889358,0.00018188957,0.000009760816,0.00022395808,0.0000018286167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002642925,0.000022080443,0.00006956436,0.0000035557687,0.000012192023,0.0000012232583,0.0000847311,0.9390156,0.00044080213,0.0035498822,0.00019402188,0.056603663],"study_design_scores_gemma":[0.000084477564,0.00009568572,0.0025811333,0.000048182483,0.0000037436605,0.000023927249,0.000012055301,0.99216723,0.0042740866,0.00015147984,0.00044721106,0.00011076389],"about_ca_topic_score_codex":0.000005631152,"about_ca_topic_score_gemma":0.000006683419,"teacher_disagreement_score":0.5885939,"about_ca_system_score_codex":0.00005046735,"about_ca_system_score_gemma":0.00015146018,"threshold_uncertainty_score":0.5666365},"labels":[],"label_agreement":null},{"id":"W3118947506","doi":"10.1109/tnse.2021.3050213","title":"Dynamical Control Domain Division for Software-Defined Satellite-Ground Integrated Vehicular Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Key Research and Development Program of China; Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Rounding; Heuristic; Computer science; Domain (mathematical analysis); Controller (irrigation); Software; Ground segment; Satellite; Algorithm; Mathematical optimization; Mathematics; Artificial intelligence; Engineering","score_opus":0.007033073639941094,"score_gpt":0.20228532265323612,"score_spread":0.19525224901329502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118947506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0117621105,0.00091192906,0.98439,0.00029165187,0.0018990746,0.0002785656,0.000006839751,0.0004445295,0.000015262043],"genre_scores_gemma":[0.8761265,0.0002524709,0.122685544,0.0006169847,0.00016473272,0.00008498898,0.000005057374,0.00003099811,0.00003267679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99742454,0.000040518164,0.0003568397,0.00081334094,0.0004681365,0.0008966079],"domain_scores_gemma":[0.9981204,0.0006912658,0.00005847397,0.0005388099,0.00029107332,0.0002999464],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092370406,0.0003142909,0.00034742028,0.00016780627,0.00070240704,0.00052355026,0.0005580628,0.00016302512,0.000004261373],"category_scores_gemma":[0.00005156828,0.00029313765,0.00014026997,0.0021247086,0.0001500355,0.00060820003,0.000013777012,0.00040222285,0.000004070049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023758374,0.00004754282,0.000032981116,0.000013201785,0.000028097644,0.000016842987,0.00004535159,0.92766505,0.00055723183,0.0023679577,0.000076138895,0.069125846],"study_design_scores_gemma":[0.0007659176,0.00013654908,0.0008259475,0.00012094644,0.000022748303,0.00003328852,0.000012611118,0.9940902,0.00021717555,0.0005475618,0.0028548546,0.00037221797],"about_ca_topic_score_codex":0.000006839531,"about_ca_topic_score_gemma":0.000011290427,"teacher_disagreement_score":0.86436445,"about_ca_system_score_codex":0.00013975923,"about_ca_system_score_gemma":0.00020207775,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W3118968349","doi":"10.1109/tnse.2021.3049262","title":"Deep Learning-Embedded Social Internet of Things for Ambiguity-Aware Social Recommendations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Japan Society for the Promotion of Science; National Natural Science Foundation of China","keywords":"Ambiguity; Computer science; Robustness (evolution); Machine learning; Benchmark (surveying); Artificial intelligence; The Internet; Deep learning; World Wide Web","score_opus":0.018236233437646285,"score_gpt":0.2534697726517217,"score_spread":0.23523353921407542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118968349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013458375,0.000029588819,0.99674505,0.00069871865,0.0007157917,0.00010448154,0.0000012583661,0.00016698519,0.0001922672],"genre_scores_gemma":[0.9611917,0.000028702052,0.038417693,0.00010616504,0.000094044946,0.000045173092,0.0000011982265,0.000009424236,0.00010585837],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998962,0.000024188816,0.00022151036,0.00029742758,0.00020652976,0.00028833724],"domain_scores_gemma":[0.99947447,0.00008724729,0.00006615257,0.00012065552,0.00019598246,0.00005551785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005540434,0.00011176425,0.0001744796,0.000116854,0.0005103077,0.00016515685,0.0003166775,0.00006308629,0.0000060539587],"category_scores_gemma":[0.000009775934,0.000118508666,0.0000767229,0.000758843,0.000059221864,0.00056274777,0.000010792148,0.00019843782,6.4960045e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020464833,0.00024362942,0.000030709212,0.00027285048,0.00014221352,0.0000070309898,0.018763224,0.0563806,0.009978697,0.03985619,0.005228565,0.86907583],"study_design_scores_gemma":[0.00026305387,0.000105980136,0.00011455782,0.00007666908,0.000014719118,0.000016438482,0.0002254198,0.9756274,0.015872575,0.0004473731,0.006981767,0.00025400572],"about_ca_topic_score_codex":0.000015047823,"about_ca_topic_score_gemma":0.000007777288,"teacher_disagreement_score":0.9598459,"about_ca_system_score_codex":0.000056005778,"about_ca_system_score_gemma":0.000075430085,"threshold_uncertainty_score":0.48326433},"labels":[],"label_agreement":null},{"id":"W3127026882","doi":"10.1109/tnse.2021.3070476","title":"Actor-Critic Learning Based QoS-Aware Scheduler for Reconfigurable Wireless Networks","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); Acceleware (Canada); University of Ottawa","funders":"","keywords":"Computer science; Quality of service; Control reconfiguration; Computer network; Distributed computing; Wireless; Wireless network; Flexibility (engineering); Latency (audio); Telecommunications; Embedded system","score_opus":0.011791753941475537,"score_gpt":0.21747056186987193,"score_spread":0.2056788079283964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3127026882","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061891773,0.000612328,0.9862462,0.000020274087,0.00558093,0.0005454289,0.000011792163,0.0007177009,0.000076157885],"genre_scores_gemma":[0.9851511,0.00046724867,0.01332675,0.000028257236,0.0004572585,0.00037426007,0.000022967386,0.00012725718,0.00004486609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784404,0.000021044558,0.00040272955,0.0006641557,0.00027433675,0.0007936779],"domain_scores_gemma":[0.99882376,0.00022095951,0.00006114747,0.00039552216,0.0002785304,0.00022006531],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053884764,0.00045181846,0.00046330818,0.00028351316,0.0004505442,0.00036396206,0.0002856319,0.0003437368,0.000015682112],"category_scores_gemma":[0.000021964213,0.0005421597,0.00012594367,0.0007924744,0.0000868854,0.0004254091,0.0000051049815,0.0011019659,0.000001472494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005945886,0.000010084941,0.0000025581805,0.00042121936,0.000033140543,0.0000024805752,0.000055028595,0.9938282,0.0012364539,0.000007135675,0.000038559534,0.0043592304],"study_design_scores_gemma":[0.00024249879,0.000030386751,0.000009874388,0.0011158668,0.00004909434,0.000006306638,0.00007827459,0.99434215,0.0033241287,0.0000033523913,0.0002563523,0.000541745],"about_ca_topic_score_codex":0.0000079245165,"about_ca_topic_score_gemma":0.000015542624,"teacher_disagreement_score":0.97896194,"about_ca_system_score_codex":0.00033801078,"about_ca_system_score_gemma":0.0001798561,"threshold_uncertainty_score":0.999703},"labels":[],"label_agreement":null},{"id":"W3128646026","doi":"10.1109/tnse.2021.3056655","title":"FLAS: Computation and Communication Efficient Federated Learning via Adaptive Sampling","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Computer science; Correctness; Federated learning; Overhead (engineering); Usability; Convergence (economics); Computation; Distributed computing; Filter (signal processing); Distributed learning; Adaptive sampling; Statistic; Artificial intelligence; Machine learning; Data mining; Human–computer interaction; Algorithm","score_opus":0.023874051280443655,"score_gpt":0.24522081742662136,"score_spread":0.2213467661461777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128646026","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036318596,0.0002866424,0.96187687,0.00077563064,0.00021722299,0.000072829185,7.530693e-7,0.00040536627,0.000046067635],"genre_scores_gemma":[0.7450736,0.00013761951,0.2547341,0.000029150611,0.000008805292,0.000007736754,7.220002e-7,0.000005426099,0.0000028388988],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988723,0.000031384712,0.00014958381,0.00039730672,0.00025748392,0.00029193758],"domain_scores_gemma":[0.9988528,0.00022332351,0.00003962548,0.0006715223,0.00014115724,0.000071582486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005702165,0.00011594311,0.0001102461,0.00013653882,0.0008252206,0.00035341992,0.0014480067,0.00005382239,9.756089e-7],"category_scores_gemma":[0.00029275237,0.00012603152,0.0000150596425,0.0013402438,0.00013410077,0.00048615885,0.00041484844,0.0003445401,0.0000021526157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017427582,0.000012206947,0.000004683125,0.000005974304,0.0000062071445,0.0000019974718,0.000087976725,0.93896985,0.0042520645,0.00020518052,0.000044528693,0.056407582],"study_design_scores_gemma":[0.00010571502,0.00003324392,0.00024899692,0.00008374877,0.0000044375342,0.000030209658,0.000050113205,0.99443775,0.004093814,0.00071871484,0.00005904266,0.00013421001],"about_ca_topic_score_codex":0.000009852319,"about_ca_topic_score_gemma":0.000005771419,"teacher_disagreement_score":0.708755,"about_ca_system_score_codex":0.00008063898,"about_ca_system_score_gemma":0.00006932464,"threshold_uncertainty_score":0.6347013},"labels":[],"label_agreement":null},{"id":"W3130972810","doi":"10.1109/tnse.2021.3061537","title":"Delay Optimal Concurrent Transmissions With Raptor Codes in Dual Connectivity Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Raptor code; Network packet; Retransmission; Jitter; User equipment; Computer network; Real-time computing; Algorithm; Decoding methods; Block code; Linear code; Base station; Telecommunications","score_opus":0.01733029739127841,"score_gpt":0.2379729130105195,"score_spread":0.2206426156192411,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130972810","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049546257,0.00066359295,0.9486645,0.00038202447,0.00042388926,0.00011122356,0.0000010621069,0.00010825736,0.00009920244],"genre_scores_gemma":[0.9874115,0.0010261538,0.011332424,0.00012395701,0.00004057187,0.000031472835,5.3631845e-7,0.000008674578,0.000024703397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860185,0.000056697052,0.00018783828,0.00043837435,0.00027267684,0.0004425416],"domain_scores_gemma":[0.9990459,0.00022583603,0.000027085658,0.00036311903,0.00015112557,0.00018695406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005643886,0.00016949099,0.00018957802,0.0001353625,0.00048801844,0.00021464097,0.000288016,0.000047705777,0.000011587906],"category_scores_gemma":[0.000010095988,0.00015372076,0.000033236985,0.0020806068,0.00014355924,0.0005666019,0.00001226492,0.00039870842,0.0000012577792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005335827,0.00005076663,0.00002550752,0.0000038153053,0.000008514972,0.000021988506,0.0002722364,0.960295,0.0008808883,0.0024692197,0.000026365922,0.035940327],"study_design_scores_gemma":[0.00037971424,0.000073309006,0.00080538756,0.00014640823,0.0000061260043,0.00007882992,0.000029149769,0.9955954,0.001651666,0.0000047608,0.0010062652,0.00022300011],"about_ca_topic_score_codex":0.0000032589182,"about_ca_topic_score_gemma":0.000090633774,"teacher_disagreement_score":0.93786526,"about_ca_system_score_codex":0.00008797949,"about_ca_system_score_gemma":0.00024377453,"threshold_uncertainty_score":0.6268551},"labels":[],"label_agreement":null},{"id":"W3161646632","doi":"10.1109/tnse.2021.3076795","title":"Cooperative Computation Offloading for Multi-Access Edge Computing in 6G Mobile Networks via Soft Actor Critic","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":96,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Computation offloading; Computer science; Mobile edge computing; Cloud computing; Server; Edge computing; Distributed computing; Computer network; Computation; Markov decision process; Latency (audio); Edge device; Mobile cloud computing; Mobile computing; Markov process; Algorithm; Telecommunications","score_opus":0.025537983122623842,"score_gpt":0.28470538893436637,"score_spread":0.2591674058117425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161646632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033600178,0.00021972191,0.9587513,0.000050215927,0.006904187,0.00028854897,4.298035e-7,0.00016946593,0.000015927008],"genre_scores_gemma":[0.94777393,0.000021961996,0.051467437,0.00015241961,0.0005179782,0.00003610457,0.0000013344802,0.000017337325,0.000011506135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980773,0.00003170725,0.00032707464,0.0006132493,0.00024011103,0.0007105674],"domain_scores_gemma":[0.99894094,0.00038366907,0.000050442108,0.00019846529,0.00027527843,0.00015120789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007050855,0.00021703674,0.0002526849,0.00023058607,0.00072191586,0.0006061662,0.0004492826,0.00007572278,7.911663e-7],"category_scores_gemma":[0.000026261087,0.00023888292,0.000057057223,0.0020497045,0.00008516222,0.0010586159,0.000026001806,0.00031056037,0.000001558209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030240492,0.000041565698,0.000032651555,0.000027380182,0.000007003491,0.0000070497967,0.00041460726,0.95303893,0.0012216303,0.000045658282,0.0000505617,0.045109935],"study_design_scores_gemma":[0.00038607264,0.000057259935,0.00046260344,0.00017922743,0.000006521674,0.000022839118,0.000025673897,0.99616975,0.002251878,0.000015282272,0.00015097903,0.00027189835],"about_ca_topic_score_codex":0.000010711679,"about_ca_topic_score_gemma":0.000010099202,"teacher_disagreement_score":0.9141737,"about_ca_system_score_codex":0.00014525624,"about_ca_system_score_gemma":0.00017403276,"threshold_uncertainty_score":0.9741363},"labels":[],"label_agreement":null},{"id":"W3163105316","doi":"10.1109/tnse.2022.3146399","title":"Node Selection Toward Faster Convergence for Federated Learning on Non-IID Data","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":182,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Node (physics); Artificial intelligence; Algorithm; Engineering","score_opus":0.034664096157556876,"score_gpt":0.2534197640990523,"score_spread":0.21875566794149542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3163105316","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010890842,0.000021371787,0.9853125,0.001579101,0.0014218932,0.00020196033,0.000015966532,0.00051458116,0.000041788942],"genre_scores_gemma":[0.93010855,0.000036531856,0.06951017,0.00016147332,0.000044824068,0.00008889676,0.0000043874343,0.00001314578,0.000031999833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981535,0.000019395471,0.0001673204,0.00072997034,0.00043488434,0.0004949162],"domain_scores_gemma":[0.99810517,0.0001476942,0.000046054127,0.001562684,0.00006326822,0.00007515414],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009915755,0.00015275046,0.00012764796,0.00022736056,0.0013512278,0.000261254,0.0069379536,0.00004202129,0.000010529192],"category_scores_gemma":[0.00025377437,0.00016436122,0.000022558092,0.0016696552,0.00007270469,0.0009729192,0.0009652594,0.0005030705,0.0000048950355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013963785,0.000025969133,0.000014322454,0.000013832766,0.000010935893,0.0000018995445,0.000059085727,0.975633,0.0039194413,0.000104341074,0.0051042335,0.015098957],"study_design_scores_gemma":[0.00015978755,0.00019265272,0.00005857339,0.000022205066,0.0000052381984,0.000016137987,0.000036086672,0.9925786,0.0039805183,0.00016061055,0.0026008792,0.00018869634],"about_ca_topic_score_codex":0.000013729709,"about_ca_topic_score_gemma":0.0000032563842,"teacher_disagreement_score":0.9192177,"about_ca_system_score_codex":0.00014607704,"about_ca_system_score_gemma":0.000115639275,"threshold_uncertainty_score":0.99994886},"labels":[],"label_agreement":null},{"id":"W3171918319","doi":"10.1109/tnse.2021.3089435","title":"PPSF: A Privacy-Preserving and Secure Framework Using Blockchain-Based Machine-Learning for IoT-Driven Smart Cities","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":355,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Smart city; Cloud computing; Blockchain; Scalability; Information privacy; Computer security; Computer network; Internet of Things; Database","score_opus":0.01276890009020294,"score_gpt":0.2268771330773635,"score_spread":0.21410823298716058,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171918319","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2047531,0.00038178297,0.79363394,0.00064265623,0.00021626397,0.00014245498,0.0000027337237,0.00021724624,0.000009826935],"genre_scores_gemma":[0.76815325,0.000032257543,0.23158601,0.00012280906,0.000040229155,0.000044733184,2.8066765e-7,0.000011095076,0.000009336277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986008,0.000018361738,0.00017561972,0.00053246936,0.00021974003,0.0004530115],"domain_scores_gemma":[0.99896467,0.0002891726,0.000044676828,0.00043643525,0.00014087028,0.00012420096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041813098,0.00017328656,0.00017959434,0.00019164472,0.0010116632,0.00020545039,0.00048135058,0.00013421185,0.000003103097],"category_scores_gemma":[0.00005616873,0.00018570854,0.000046567933,0.0012752066,0.00015958813,0.00009295907,0.000030371537,0.00044227616,3.7207644e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032911466,0.000022955743,0.00018819691,0.000044141634,0.000013955535,0.0000037863151,0.00040481274,0.98433197,0.0022670554,0.0077286866,0.000007771597,0.004983351],"study_design_scores_gemma":[0.00015964359,0.000041129846,0.00008668133,0.00011699409,0.000013343849,0.000026763351,0.000044850214,0.9933143,0.0038602478,0.0014027096,0.0007307885,0.00020254949],"about_ca_topic_score_codex":0.000017483599,"about_ca_topic_score_gemma":0.000017573524,"teacher_disagreement_score":0.56340015,"about_ca_system_score_codex":0.00005384315,"about_ca_system_score_gemma":0.00017861977,"threshold_uncertainty_score":0.7780998},"labels":[],"label_agreement":null},{"id":"W3187896966","doi":"10.1109/tnse.2021.3103558","title":"On Selfholding Attack Impact on Imperfect PoW Blockchain Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Imperfect; Proof-of-work system; Computer security; Block (permutation group theory)","score_opus":0.007977942728337874,"score_gpt":0.22991450871265692,"score_spread":0.22193656598431905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187896966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2776857,0.000112915404,0.7206738,0.00035998705,0.0005152088,0.00011229316,0.0000018580239,0.00033142156,0.00020679223],"genre_scores_gemma":[0.99560004,0.000100730074,0.0038160675,0.00031807844,0.00008347409,0.000038053233,3.2497928e-7,0.000014230893,0.000028994104],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998119,0.000022368544,0.00019022619,0.0006852215,0.0003401965,0.0006429915],"domain_scores_gemma":[0.9987082,0.00024127388,0.00003861203,0.0007230422,0.000095729265,0.00019318056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006419019,0.00024250701,0.00020313924,0.00025057135,0.00070534204,0.00020298304,0.00056994386,0.00013797362,0.000012071592],"category_scores_gemma":[0.000014823337,0.00021993139,0.0000880472,0.0024778894,0.00011743964,0.0001587537,0.000012987599,0.000584815,0.000012170977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004527632,0.000057581725,0.000008228556,0.0000035526004,0.000014240643,0.000011221797,0.000059589634,0.9762337,0.00071953115,0.008361861,0.00019043162,0.014335503],"study_design_scores_gemma":[0.00017380062,0.00018601272,0.0003470883,0.00006778668,0.0000064960245,0.00005534169,0.0000086465925,0.9937131,0.0046919878,0.0002295595,0.0002697218,0.00025048968],"about_ca_topic_score_codex":0.0000059004246,"about_ca_topic_score_gemma":0.0000044296135,"teacher_disagreement_score":0.71791434,"about_ca_system_score_codex":0.00015151531,"about_ca_system_score_gemma":0.00012233158,"threshold_uncertainty_score":0.89685416},"labels":[],"label_agreement":null},{"id":"W3189033711","doi":"10.1109/tnse.2021.3103873","title":"Adaptive $ D$-Hop Connected Dominating Set in Highly Dynamic Flying Ad-Hoc Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; China University of Mining and Technology; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Notation; Computer science; Wireless ad hoc network; Graph; Algorithm; Hop (telecommunications); Set (abstract data type); Mathematics; Theoretical computer science; Computer network; Programming language","score_opus":0.006737166744006764,"score_gpt":0.19914415305880123,"score_spread":0.19240698631479447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3189033711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09584557,0.0010363576,0.9019958,0.000033862205,0.0005305562,0.00014568763,0.0000045574216,0.00025729218,0.00015033245],"genre_scores_gemma":[0.9854412,0.0012241122,0.013142958,0.00002861392,0.00003902415,0.00006643072,0.000004070421,0.000031710224,0.000021846672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998794,0.000011207714,0.00024233425,0.0003150689,0.00018672887,0.000450642],"domain_scores_gemma":[0.9994695,0.000113063856,0.000021634822,0.00019702244,0.000092912545,0.00010585448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002865842,0.00017950298,0.00017270425,0.00020165481,0.00029450768,0.00010278987,0.00012340111,0.00008609033,0.000012346933],"category_scores_gemma":[0.000008393628,0.00020727445,0.0000315398,0.0021253016,0.00005742896,0.00033862726,0.0000033284382,0.00031975677,0.0000033651634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003869429,0.000009537356,0.0000044764315,0.0000119802535,0.000008727838,0.0000049917116,0.00017997625,0.9682054,0.002685245,0.000066365,0.000012407443,0.028807016],"study_design_scores_gemma":[0.00024268542,0.000019313353,0.00034678113,0.00011481998,0.00001153227,0.000013289225,0.0001540439,0.99786127,0.0008170916,0.00001317825,0.00018017837,0.00022579383],"about_ca_topic_score_codex":0.0000039950805,"about_ca_topic_score_gemma":0.00008765973,"teacher_disagreement_score":0.8895957,"about_ca_system_score_codex":0.00018786378,"about_ca_system_score_gemma":0.000050551193,"threshold_uncertainty_score":0.8452407},"labels":[],"label_agreement":null},{"id":"W3193468109","doi":"10.1109/tnse.2021.3104499","title":"Fault-Resilience for Bandwidth Management in Industrial Software-Defined Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Testbed; Software-defined networking; Bandwidth (computing); Computer network; Dynamic bandwidth allocation; Distributed computing; Resilience (materials science); Network management; Software; Operating system","score_opus":0.015508538854030949,"score_gpt":0.21975617233296918,"score_spread":0.20424763347893823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193468109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047098757,0.00032849,0.99220043,0.00020154852,0.0019220305,0.00029826528,0.0000020576576,0.0002345197,0.00010280431],"genre_scores_gemma":[0.8902566,0.00042912326,0.10835029,0.00039778292,0.00022960511,0.00017439683,0.0000013354377,0.000024383822,0.00013647758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767625,0.000020016205,0.0003127843,0.00074525835,0.00041202022,0.00083367166],"domain_scores_gemma":[0.9988432,0.0003413259,0.000044450375,0.00047211972,0.00010347356,0.00019541362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007766921,0.00023430435,0.00024227645,0.00024158301,0.0004075774,0.0003157646,0.00060318573,0.00011499844,0.0000051821057],"category_scores_gemma":[0.00003474363,0.00024076334,0.000070575705,0.002890014,0.000093774404,0.00059756683,0.000021046493,0.00032573505,0.0000025264155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011926457,0.00003544141,0.000054024193,0.0000100482475,0.000010666713,0.000018698269,0.000037961585,0.8786824,0.000034549375,0.0019456217,0.00026692275,0.118891746],"study_design_scores_gemma":[0.0009809872,0.00009457796,0.0007384342,0.00016262443,0.000015949347,0.000024957148,0.000018610335,0.9934782,0.0004330282,0.00030063643,0.003368111,0.0003839185],"about_ca_topic_score_codex":0.000008248459,"about_ca_topic_score_gemma":0.000021630809,"teacher_disagreement_score":0.88554674,"about_ca_system_score_codex":0.00011093001,"about_ca_system_score_gemma":0.00014926291,"threshold_uncertainty_score":0.98180443},"labels":[],"label_agreement":null},{"id":"W3194685451","doi":"10.1109/tnse.2023.3255819","title":"Partisan Confidence Model for Group Polarization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Opinion Dynamics and Social Influence","field":"Physics and Astronomy","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Air Force Office of Scientific Research","keywords":"Polarization (electrochemistry); Computer science; Group (periodic table); Physics; Quantum mechanics","score_opus":0.015609007403768744,"score_gpt":0.2500729105123763,"score_spread":0.23446390310860754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3194685451","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058629617,0.0000043660434,0.9407073,0.00006395861,0.000345365,0.00010967546,0.000015883536,0.00006546246,0.000058347574],"genre_scores_gemma":[0.99842405,0.000010329938,0.001281785,0.000031311876,0.00008266075,0.00004673967,0.0000026459074,0.000007829503,0.00011266788],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993665,0.0000022626896,0.000091640075,0.00016352141,0.00012152304,0.00025451905],"domain_scores_gemma":[0.9997488,0.00004084992,0.000016868737,0.00007747692,0.000046114375,0.000069886664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023424735,0.00006964048,0.00006755346,0.00006293114,0.00037847672,0.00007472783,0.000085157975,0.000019252047,0.000003792715],"category_scores_gemma":[0.0000016490847,0.00007374256,0.000027476088,0.00056899124,0.000059387898,0.00022072914,0.0000012865255,0.00006924357,0.0000035198946],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018144284,0.000005527099,0.00005595891,0.00000384775,0.000003697461,4.342123e-8,0.00011396648,0.96576136,0.0017655934,0.02829882,0.000030927808,0.00395842],"study_design_scores_gemma":[0.00007875897,0.00001778423,0.00021989645,0.000017526732,0.000004373709,9.316914e-8,0.00003470628,0.9978774,0.00016213184,0.0013815861,0.00011808461,0.00008762459],"about_ca_topic_score_codex":0.000016420878,"about_ca_topic_score_gemma":0.0000024465344,"teacher_disagreement_score":0.9397944,"about_ca_system_score_codex":0.000013828299,"about_ca_system_score_gemma":0.000041080824,"threshold_uncertainty_score":0.30071345},"labels":[],"label_agreement":null},{"id":"W3203176266","doi":"10.1109/tnse.2022.3232397","title":"Algebraic Connectivity: Local and Global Maximizer Graphs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Algebraic connectivity; Conjecture; Bipartite graph; Mathematics; Combinatorics; Eigenvalues and eigenvectors; Algebraic number; Laplacian matrix; Laplace operator; Discrete mathematics; Vertex (graph theory); Algebraic graph theory; Graph theory; Graph","score_opus":0.019640821576302554,"score_gpt":0.254019951444218,"score_spread":0.23437912986791545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203176266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50991815,0.000026193202,0.48915386,0.00014639995,0.00020654236,0.00011227455,0.0000061867963,0.000247284,0.00018308767],"genre_scores_gemma":[0.99848616,0.00006165745,0.0013202105,0.000043281187,0.000017561448,0.000037407557,2.1615993e-7,0.000008237125,0.000025279905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920464,0.000008728703,0.00009990238,0.00023175307,0.00016309036,0.00029186657],"domain_scores_gemma":[0.9995029,0.00018891279,0.000015098661,0.00015255959,0.000027626174,0.000112918795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000492806,0.00010397047,0.00010823484,0.00010343775,0.00038555206,0.00005235162,0.000092834045,0.000039738443,0.0000061941955],"category_scores_gemma":[0.000012027089,0.00009952205,0.000028287624,0.0015928942,0.00024026449,0.00015309289,0.0000029008772,0.000110593086,0.000007894998],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019733938,0.00006264836,0.000074887386,0.00006881072,0.00004257381,0.0000069960106,0.0002896401,0.16595659,0.0017342964,0.7877893,0.0006146211,0.043339916],"study_design_scores_gemma":[0.0006735978,0.00012138169,0.0033414068,0.00014412482,0.000091577946,0.00009602428,0.00034608625,0.33101287,0.0022788807,0.6601032,0.0011773738,0.0006134536],"about_ca_topic_score_codex":0.000004069504,"about_ca_topic_score_gemma":0.000009087479,"teacher_disagreement_score":0.48856798,"about_ca_system_score_codex":0.000021773194,"about_ca_system_score_gemma":0.000022450537,"threshold_uncertainty_score":0.40583912},"labels":[],"label_agreement":null},{"id":"W3203858545","doi":"10.1109/tnse.2021.3115054","title":"Deadline-Aware Task Offloading With Partially-Observable Deep Reinforcement Learning for Multi-Access Edge Computing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Markov decision process; Computation offloading; Partially observable Markov decision process; Mobile edge computing; Mobile device; Distributed computing; Server; Energy consumption; Edge computing; Task (project management); Computation; Enhanced Data Rates for GSM Evolution; Markov process; Real-time computing; Artificial intelligence; Markov chain; Computer network; Markov model; Machine learning; Algorithm","score_opus":0.02970066944453142,"score_gpt":0.25394588690802894,"score_spread":0.22424521746349751,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203858545","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01692476,0.00009770612,0.9791281,0.000085535445,0.0032762396,0.00018612178,8.557914e-8,0.00025997622,0.000041433395],"genre_scores_gemma":[0.9163135,0.000025759524,0.0829062,0.00014315487,0.00049893843,0.000021702353,0.0000012031531,0.000020420952,0.00006910425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997946,0.00001733347,0.00027894808,0.00059475354,0.00035308124,0.00080988934],"domain_scores_gemma":[0.9990173,0.00015872085,0.000072348856,0.00028266927,0.0002737604,0.00019521064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066737435,0.0002252971,0.0002240292,0.00014533346,0.0012810371,0.0006954385,0.0005442106,0.000054286444,0.0000012234734],"category_scores_gemma":[0.000020262103,0.0002194655,0.000056945588,0.0014946929,0.00006554785,0.0009818563,0.000030849296,0.00029786717,0.0000023870473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000053151234,0.000017103388,0.00008362321,0.00004330722,0.000015486714,0.000008811592,0.00035012537,0.9801132,0.0010729289,0.00007875667,0.00003354521,0.018177783],"study_design_scores_gemma":[0.0003983743,0.00009002568,0.00019877795,0.00020161274,0.000014641578,0.00002999366,0.000029464669,0.9904741,0.006689911,0.0000051112133,0.0015729545,0.00029504864],"about_ca_topic_score_codex":0.0000127440335,"about_ca_topic_score_gemma":0.000011262261,"teacher_disagreement_score":0.89938873,"about_ca_system_score_codex":0.000102963415,"about_ca_system_score_gemma":0.00022540032,"threshold_uncertainty_score":0.98528314},"labels":[],"label_agreement":null},{"id":"W3207498650","doi":"10.1109/tnse.2021.3119324","title":"Tensor Train-Based Multiple Clusterings for Big Data in Cyber-Physical-Social Systems and Its Efficient Implementations","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Tensor decomposition and applications","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Big data; Tensor (intrinsic definition); Overhead (engineering); Implementation; Parallel computing; Data mining; Theoretical computer science; Artificial intelligence; Mathematics","score_opus":0.08272881589556075,"score_gpt":0.3230384472093226,"score_spread":0.24030963131376187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207498650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43028867,0.000026230777,0.56842935,0.00038081818,0.00027349996,0.00036929492,0.00015486736,0.0000613447,0.000015924405],"genre_scores_gemma":[0.99558276,0.00000574762,0.0040519475,0.000052051393,0.0001163355,0.00015123677,0.0000080517775,0.000013391685,0.000018464458],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906576,0.000010905027,0.00018320541,0.00031329313,0.00016911227,0.00025769975],"domain_scores_gemma":[0.99925256,0.00036552953,0.00003137508,0.00018737544,0.00008674056,0.00007641642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002910411,0.00010370245,0.00014503961,0.00010134905,0.00038458212,0.000095307034,0.00012532632,0.000027905518,0.0000014140498],"category_scores_gemma":[0.000026213871,0.000107635955,0.000024535646,0.00059105223,0.0000450803,0.000085144165,0.00000485414,0.00009337564,7.3844484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001819457,0.00031454774,0.000015735637,0.0002004796,0.00002445608,0.0000029911366,0.0010139409,0.9449914,0.042195328,0.004928711,0.00024662865,0.006047565],"study_design_scores_gemma":[0.0005598118,0.000018333416,0.00033811753,0.000050990522,0.000025331468,0.0000065844947,0.00022171657,0.99607176,0.0017672299,0.000058344405,0.0007450046,0.00013679598],"about_ca_topic_score_codex":0.0000069547414,"about_ca_topic_score_gemma":0.000036632693,"teacher_disagreement_score":0.5652941,"about_ca_system_score_codex":0.00004592094,"about_ca_system_score_gemma":0.00006169348,"threshold_uncertainty_score":0.43892667},"labels":[],"label_agreement":null},{"id":"W3210013687","doi":"10.1109/tnse.2021.3123280","title":"Deadline-Aware Deep-Recurrent-Q-Network Governor for Smart Energy Saving","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Green IT and Sustainability","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Overhead (engineering); Governor; Embedded system; Energy consumption; Distributed computing; Real-time computing; Operating system; Engineering","score_opus":0.007161934768661161,"score_gpt":0.19760476471129382,"score_spread":0.19044282994263265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210013687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034200557,0.00082437706,0.96204877,0.00006553923,0.0022550898,0.0001261564,0.000009549261,0.00029859293,0.0001713485],"genre_scores_gemma":[0.9950415,0.00021056067,0.0041201147,0.00006212238,0.0003332155,0.00007974818,0.0000030153692,0.000036944988,0.000112810034],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837,0.000009419423,0.00023555127,0.00036313143,0.00026719744,0.0007546802],"domain_scores_gemma":[0.9991912,0.00015412013,0.00001721817,0.00026022037,0.00017430334,0.00020288577],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036852076,0.00022477383,0.0002182242,0.00007669877,0.00041108477,0.000119821256,0.0001692798,0.00008774774,0.0000148078525],"category_scores_gemma":[0.000018093722,0.00024619384,0.00009059544,0.0010024387,0.00007301231,0.00028867656,0.000004139619,0.00020818882,0.0000018273172],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007827088,0.000014215212,0.000048210823,0.00008146857,0.000020310119,0.0000058951878,0.000052321513,0.9643407,0.00052603835,0.00024932582,0.00033626668,0.034317404],"study_design_scores_gemma":[0.00024533973,0.000046869325,0.00045584052,0.000084948864,0.000031966214,0.00001942864,0.00007497497,0.98017883,0.0017194662,0.00014779203,0.016648525,0.00034600424],"about_ca_topic_score_codex":0.000011921077,"about_ca_topic_score_gemma":0.00021339381,"teacher_disagreement_score":0.9608409,"about_ca_system_score_codex":0.00020231403,"about_ca_system_score_gemma":0.00010365768,"threshold_uncertainty_score":0.99999905},"labels":[],"label_agreement":null},{"id":"W3215007906","doi":"10.1109/tnse.2021.3131246","title":"Federated Learning and Proactive Computation Reuse at the Edge of Smart Homes","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Edge device; Edge computing; Computation; Enhanced Data Rates for GSM Evolution; Inference; Distributed computing; Information privacy; Server; Computer network; Artificial intelligence; Machine learning; Computer security; Algorithm","score_opus":0.0158659023581913,"score_gpt":0.23457836346439637,"score_spread":0.21871246110620507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215007906","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11360725,0.00025198716,0.8837843,0.0017738341,0.00028171146,0.0000754833,0.000001317892,0.00016657871,0.000057514062],"genre_scores_gemma":[0.96394485,0.0002530059,0.03572799,0.000023030427,0.000010402942,0.000009073231,4.2916434e-7,0.0000049732366,0.000026237456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991058,0.00002333905,0.000117079166,0.00030777685,0.00022560828,0.00022041005],"domain_scores_gemma":[0.99894845,0.00020050937,0.000036653113,0.00066730037,0.00010557404,0.000041537816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043618944,0.0000887423,0.00009899554,0.00008217495,0.0005292636,0.00015720009,0.0014114016,0.000038502607,0.0000015263947],"category_scores_gemma":[0.000518171,0.000073565374,0.000014966728,0.0011710924,0.00019534508,0.00046718222,0.000580588,0.00021804191,8.885126e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024002658,0.000075756325,0.0003123409,0.00008245871,0.000088607856,0.000020906917,0.00092535705,0.667966,0.04582012,0.00039991463,0.003329509,0.28095505],"study_design_scores_gemma":[0.00010528367,0.00005079783,0.0007048928,0.000048814156,0.0000063066605,0.00003304669,0.000056276447,0.9508632,0.04730143,0.0004716531,0.00025662503,0.000101679296],"about_ca_topic_score_codex":0.000006248443,"about_ca_topic_score_gemma":0.000009785784,"teacher_disagreement_score":0.8503376,"about_ca_system_score_codex":0.000052920765,"about_ca_system_score_gemma":0.00007215363,"threshold_uncertainty_score":0.4070721},"labels":[],"label_agreement":null},{"id":"W3215475368","doi":"10.1109/tnse.2021.3130948","title":"Efficient Allocation of Resource-Intensive Mobile Cyber–Physical Social System Applications on a Heterogeneous Mobile Ad Hoc Cloud","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; Hankuk University of Foreign Studies","keywords":"Computer science; Resource allocation; Distributed computing; Cloud computing; Computer network; Wireless ad hoc network; Resource management (computing); Key (lock); Mobile computing; Latency (audio); Wireless; Computer security; Telecommunications","score_opus":0.008915757605798961,"score_gpt":0.21762097491286891,"score_spread":0.20870521730706995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3215475368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07805127,0.00027190705,0.9205201,0.000039085313,0.00048721727,0.0002998259,0.000007633495,0.00014345597,0.00017950352],"genre_scores_gemma":[0.99766076,0.000041074563,0.001765087,0.000083190615,0.00019228431,0.00021647646,0.000001580582,0.0000124770095,0.00002708726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983585,0.000027429402,0.00025218382,0.00050339283,0.00047447014,0.00038400947],"domain_scores_gemma":[0.9989099,0.00014374398,0.000072878625,0.00039222205,0.00032583406,0.00015540338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028698336,0.00017204705,0.00024027613,0.00011332459,0.00046991353,0.000096985095,0.00032601616,0.000066955814,0.0000016369918],"category_scores_gemma":[0.00000145996,0.0001724614,0.00008893296,0.0011972556,0.00014859742,0.00007764971,0.000012018848,0.00021031323,0.00000727019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008863911,0.00008233661,2.0026681e-7,0.000024679652,0.000013294374,0.000008842385,0.00057575834,0.9308384,0.0010665032,0.001185786,0.000040551182,0.06615481],"study_design_scores_gemma":[0.0001520686,0.00015887212,0.0000061492774,0.00008578127,0.000020092195,0.000051616877,0.00026140752,0.99553686,0.0020877384,0.000012252022,0.0014550647,0.00017208133],"about_ca_topic_score_codex":0.0000016526288,"about_ca_topic_score_gemma":9.7967e-7,"teacher_disagreement_score":0.9196095,"about_ca_system_score_codex":0.000114706236,"about_ca_system_score_gemma":0.00015436162,"threshold_uncertainty_score":0.7032772},"labels":[],"label_agreement":null},{"id":"W4205668919","doi":"10.1109/tnse.2021.3137829","title":"High-Capacity Steganography Using Object Addition-Based Cover Enhancement for Secure Communication in Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Steganography and Watermarking Techniques","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; Priority Academic Program Development of Jiangsu Higher Education Institutions; National Natural Science Foundation of China","keywords":"Steganography; Cover (algebra); Embedding; Computer science; Object (grammar); Image (mathematics); Theoretical computer science; Artificial intelligence; Steganography tools; Computer vision; Pattern recognition (psychology); Data mining; Engineering","score_opus":0.013791164339552029,"score_gpt":0.22453069436329043,"score_spread":0.2107395300237384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205668919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025601117,0.00014658949,0.9734372,0.00006455163,0.00039550225,0.0001995181,0.000005593244,0.00013555013,0.000014365264],"genre_scores_gemma":[0.7722761,0.000100949714,0.2273919,0.00013135423,0.000024907835,0.000063639796,0.0000023426478,0.0000069035914,0.0000019136025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987919,0.000030678242,0.00020558985,0.00036301636,0.0002227246,0.00038613426],"domain_scores_gemma":[0.99916726,0.0001674479,0.000049701324,0.00040702074,0.00013623066,0.00007235427],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005167171,0.00014987748,0.00015275102,0.00025360862,0.00045363186,0.00016520696,0.00034758888,0.00006664949,0.0000027585972],"category_scores_gemma":[0.0000060645093,0.0001598305,0.00006417849,0.001911474,0.00010728609,0.0006736049,0.000006746742,0.00022312386,1.7880937e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007244401,0.00003899357,0.000017320952,0.000016027105,0.0000064310784,0.0000013582882,0.0000689002,0.992539,0.0018850138,0.001474717,0.000020033402,0.0039249607],"study_design_scores_gemma":[0.00025569077,0.00005626862,0.00012779456,0.00022723613,0.0000075179837,0.000004180865,0.000005798928,0.96628684,0.03187543,0.00064800336,0.00030331078,0.00020190608],"about_ca_topic_score_codex":0.000009615738,"about_ca_topic_score_gemma":0.000013701352,"teacher_disagreement_score":0.74667495,"about_ca_system_score_codex":0.00008225476,"about_ca_system_score_gemma":0.0000895739,"threshold_uncertainty_score":0.6517698},"labels":[],"label_agreement":null},{"id":"W4206275890","doi":"10.1109/tnse.2021.3132556","title":"Ensuring Profit and QoS When Dynamically Embedding Delay-Constrained ICN and IP Slices for Content Delivery","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Concordia University; Agence Nationale de la Recherche","keywords":"Computer science; Quality of service; Computer network; Profit maximization; The Internet; Embedding; Integer programming; Profit (economics); Content delivery; Distributed computing; Algorithm","score_opus":0.018528268708078836,"score_gpt":0.2103121408699017,"score_spread":0.19178387216182285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206275890","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3965555,0.0003597514,0.60224026,0.00021050837,0.000423431,0.00010674746,0.0000029660312,0.00008383149,0.000016974453],"genre_scores_gemma":[0.9748846,0.00019849991,0.024604997,0.00015094603,0.00006621862,0.000029696866,3.7910218e-7,0.000008938705,0.000055666093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870026,0.000012695563,0.00018171544,0.00049277797,0.00021636405,0.00039617225],"domain_scores_gemma":[0.99928695,0.00018972476,0.000031535845,0.00018474562,0.00013781688,0.00016923918],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045237236,0.00015716755,0.00017007651,0.00012233267,0.0004963161,0.00040389303,0.00019303219,0.000048897928,9.459928e-7],"category_scores_gemma":[0.00001695657,0.00015673462,0.000041467458,0.00030655102,0.00011322547,0.0006391197,0.000014504366,0.00016383738,3.8506252e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058859685,0.000057642465,0.00030824592,0.000244277,0.00014759069,0.000079584104,0.0019929123,0.50871044,0.14933617,0.007288085,0.00006317797,0.33171302],"study_design_scores_gemma":[0.00034500612,0.00006593247,0.0004237901,0.00015294875,0.000020563602,0.00013042864,0.00010725927,0.99662334,0.0017705385,0.000058985006,0.00008524598,0.00021598741],"about_ca_topic_score_codex":0.000022780081,"about_ca_topic_score_gemma":0.000021294236,"teacher_disagreement_score":0.57832915,"about_ca_system_score_codex":0.000039995448,"about_ca_system_score_gemma":0.00009184809,"threshold_uncertainty_score":0.6391452},"labels":[],"label_agreement":null},{"id":"W4213024557","doi":"10.1109/tnse.2022.3150755","title":"Workload Balancing in Mobile Edge Computing for Internet of Things: A Population Game Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Mobile edge computing; Cloud computing; Computation offloading; Edge computing; Distributed computing; Workload; Computer network; Latency (audio); Population; Cloudlet; Server; Operating system","score_opus":0.009444402188863206,"score_gpt":0.21158430441296583,"score_spread":0.20213990222410264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213024557","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18614869,0.00012558818,0.8108256,0.000009521093,0.002572113,0.00019551662,1.4187431e-7,0.00007408026,0.00004876803],"genre_scores_gemma":[0.9602751,0.000004820258,0.039481968,0.00004315411,0.00013503748,0.000041321404,4.6782287e-7,0.00000813476,0.000009986453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987095,0.000018358207,0.00025705405,0.00034802,0.0002786613,0.00038839507],"domain_scores_gemma":[0.9995504,0.00012712262,0.00006408051,0.00016455619,0.000038919763,0.00005492456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011836904,0.000113057606,0.00016721488,0.0003001718,0.00027612317,0.00008393874,0.0004430179,0.000025589796,6.024165e-7],"category_scores_gemma":[0.0000071225695,0.00012486466,0.000043119708,0.0014695948,0.00003200791,0.00043303263,0.000024588307,0.00023984577,2.0265564e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004766066,0.000029226852,0.00017357072,0.000026590058,0.0000032381445,5.3739035e-7,0.0016441302,0.94843495,0.00033592657,0.00017090184,0.000023609393,0.04915255],"study_design_scores_gemma":[0.00018079304,0.00008453133,0.00080170477,0.00007684493,0.0000028600657,0.00001122323,0.00004740118,0.99815446,0.00031993858,0.000047512076,0.00014221575,0.00013053595],"about_ca_topic_score_codex":0.000037052403,"about_ca_topic_score_gemma":4.6595673e-7,"teacher_disagreement_score":0.7741264,"about_ca_system_score_codex":0.00013572401,"about_ca_system_score_gemma":0.000048460577,"threshold_uncertainty_score":0.5091833},"labels":[],"label_agreement":null},{"id":"W4225926344","doi":"10.1109/tnse.2022.3169117","title":"Federated Learning Meets Multi-Objective Optimization","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":146,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hyperparameter; Robustness (evolution); Artificial intelligence; Convergence (economics); Pareto principle; Machine learning; Information retrieval; Mathematics; Mathematical optimization","score_opus":0.015864241134683606,"score_gpt":0.22645905966344693,"score_spread":0.21059481852876333,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225926344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002735296,0.000063128275,0.9944207,0.0009969512,0.00079692906,0.00011619072,0.0000020505256,0.00080860517,0.000060168473],"genre_scores_gemma":[0.775703,0.000047186222,0.22410627,0.000053637486,0.000013259445,0.000048777496,6.016427e-7,0.000008716892,0.000018539264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985842,0.00003053543,0.00013097866,0.00046278065,0.000401035,0.00039047943],"domain_scores_gemma":[0.9989828,0.00008330617,0.00003838782,0.00076227094,0.000064584456,0.000068635745],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00070792134,0.0001229823,0.000100968246,0.0002603062,0.0015754092,0.00023478236,0.0034231364,0.00003342089,0.000010470637],"category_scores_gemma":[0.00032182873,0.00013617749,0.000020963143,0.002278404,0.00008368343,0.00080739416,0.0006611847,0.0004823679,0.0000019951144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021095836,0.00001752963,0.000004644362,0.0000022938837,0.000005404945,0.0000035917017,0.000059478723,0.988259,0.0007840548,0.000053231586,0.0002622255,0.010546424],"study_design_scores_gemma":[0.00013987558,0.0000750876,0.000043642503,0.000011498391,0.000002945153,0.000021225569,0.000047863257,0.99757487,0.0015294803,0.000063366344,0.00033554633,0.00015460416],"about_ca_topic_score_codex":0.000013082423,"about_ca_topic_score_gemma":0.0000024918997,"teacher_disagreement_score":0.7729677,"about_ca_system_score_codex":0.00018822232,"about_ca_system_score_gemma":0.00008984821,"threshold_uncertainty_score":0.9997244},"labels":[],"label_agreement":null},{"id":"W4226248369","doi":"10.1109/tnse.2022.3157730","title":"ASTREAM: Data-Stream-Driven Scalable Anomaly Detection With Accuracy Guarantee in IIoT Environment","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":99,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Natural Science Foundation of Shandong Province; National Natural Science Foundation of China","keywords":"Anomaly detection; Computer science; Scalability; Data mining; Data modeling; Database","score_opus":0.011404615246309943,"score_gpt":0.20474007062846655,"score_spread":0.1933354553821566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226248369","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07418999,0.000037014546,0.92510676,0.00009694437,0.00012403952,0.00020838132,0.000007747351,0.00017208187,0.00005702496],"genre_scores_gemma":[0.97923064,0.00007369689,0.02038501,0.000049328144,0.000024110692,0.00019082076,0.0000010514402,0.000009666387,0.00003566375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985472,0.00001615413,0.00016906681,0.0005592791,0.000365404,0.00034292237],"domain_scores_gemma":[0.9991663,0.000051064988,0.0000468289,0.00064781244,0.000017956205,0.000070056776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040212693,0.00013472154,0.000111799396,0.00024116726,0.000718433,0.00011817238,0.0007620281,0.0000250061,0.000015064397],"category_scores_gemma":[0.00000214383,0.00013368191,0.000018326367,0.0015092718,0.00007894394,0.00077738287,0.000037556212,0.00028951038,0.0000039383726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008879922,0.00005411087,0.00004294804,0.0000028158413,0.000004448285,0.0000036371475,0.00005993985,0.93985355,0.0036206567,0.00015426362,0.000018128128,0.056176636],"study_design_scores_gemma":[0.00019321602,0.0002266517,0.0011223063,0.000014090479,0.0000069524312,0.00006556151,0.000040767136,0.9878819,0.0060378197,0.000029262808,0.0041797645,0.00020167978],"about_ca_topic_score_codex":0.00008249953,"about_ca_topic_score_gemma":0.00003804262,"teacher_disagreement_score":0.9050407,"about_ca_system_score_codex":0.00017184335,"about_ca_system_score_gemma":0.00007807903,"threshold_uncertainty_score":0.55256784},"labels":[],"label_agreement":null},{"id":"W4226445422","doi":"10.1109/tnse.2022.3163927","title":"Joint VNF Placement and Scheduling for Latency-Sensitive Services","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Scalability; Distributed computing; Scheduling (production processes); Provisioning; Computer network; Integer programming; Heuristics; Network Functions Virtualization; Virtual network; Cloud computing; Mathematical optimization","score_opus":0.011451707460705382,"score_gpt":0.20033188947330544,"score_spread":0.18888018201260004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226445422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056695603,0.00020929832,0.9415575,0.00022994616,0.00093316636,0.00019419551,0.000004185207,0.00015113696,0.000024938823],"genre_scores_gemma":[0.9552256,0.00008416002,0.04419743,0.00030418296,0.00007117181,0.0000869152,4.4518367e-7,0.000009736657,0.000020396166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873435,0.00001059425,0.00014589641,0.00040784245,0.00029631268,0.0004049953],"domain_scores_gemma":[0.9994956,0.00011266179,0.000033461143,0.00018372988,0.00005569631,0.00011880906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006601487,0.0001308091,0.00012944722,0.00014317036,0.0010549139,0.00016892557,0.00023885767,0.00002311675,0.000002899852],"category_scores_gemma":[0.0000028833324,0.0001326864,0.000031813026,0.0007667017,0.00004986499,0.00036044884,0.000020379477,0.00018196825,7.0562425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071372015,0.000013077968,0.000006068875,0.000016115444,0.000008389724,0.000002125622,0.00044097521,0.9882712,0.00065736775,0.00083758775,0.000020257452,0.009719697],"study_design_scores_gemma":[0.00023274447,0.00015603442,0.00016446538,0.000038094615,0.000008870239,0.000027317163,0.0001263801,0.99758154,0.00072565395,0.00011038878,0.00065257534,0.00017594788],"about_ca_topic_score_codex":0.000009965404,"about_ca_topic_score_gemma":0.0000035803894,"teacher_disagreement_score":0.89852995,"about_ca_system_score_codex":0.00006417009,"about_ca_system_score_gemma":0.00005721956,"threshold_uncertainty_score":0.81136507},"labels":[],"label_agreement":null},{"id":"W4285121953","doi":"10.1109/tnse.2022.3185717","title":"Temporal-Spatial Analysis of the Essentiality of Hub Proteins in Protein-Protein Interaction Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Bioinformatics and Genomic Networks","field":"Biochemistry, Genetics and Molecular Biology","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Training Program for Excellent Young Innovators of Changsha; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Centrality; Leverage (statistics); Computer science; Construct (python library); Network analysis; Identification (biology); Data mining; Biological network; Computational biology; Artificial intelligence; Biology; Computer network; Mathematics","score_opus":0.005785514114959971,"score_gpt":0.20763668368423308,"score_spread":0.2018511695692731,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285121953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63951635,0.000048206948,0.35986498,0.000028577044,0.00020910797,0.00029074238,0.000008340564,0.0000039871707,0.000029743826],"genre_scores_gemma":[0.99942106,0.000010029593,0.00041117493,0.000017515138,0.00003438917,0.00007294925,0.0000033674185,0.0000060094776,0.000023518816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991056,0.00003053065,0.00027801163,0.00017892684,0.00021499222,0.00019193973],"domain_scores_gemma":[0.9995476,0.0000072217426,0.00011590543,0.00025057292,0.00004448128,0.000034206107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061385,0.00009158811,0.00014903338,0.00014020987,0.00017661936,0.000013787553,0.00021182829,0.00004385323,0.000010233285],"category_scores_gemma":[0.000005117242,0.000080543134,0.0000852408,0.0013000068,0.00010500353,0.000011764021,0.0000183816,0.00020146953,4.5544972e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035135887,0.00003321021,0.00010895071,0.000011949886,0.000049605085,1.3309823e-7,0.000047938247,0.9247815,0.072336785,0.000034921355,0.00000532943,0.0025545135],"study_design_scores_gemma":[0.0002395417,0.00017282697,0.0021022114,0.000045599176,0.00006727996,0.0000021105825,0.00008695664,0.9454768,0.051295776,0.00001718431,0.0003397382,0.00015398138],"about_ca_topic_score_codex":0.00018044566,"about_ca_topic_score_gemma":0.00021840997,"teacher_disagreement_score":0.3599047,"about_ca_system_score_codex":0.000034548975,"about_ca_system_score_gemma":0.000076652555,"threshold_uncertainty_score":0.32844537},"labels":[],"label_agreement":null},{"id":"W4285126844","doi":"10.1109/tnse.2022.3176924","title":"Hybrid NOMA-FDMA Assisted Dual Computation Offloading: A Latency Minimization Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Noma; Computer science; Minification; Dual (grammatical number); Computation; Computer network; Latency (audio); Telecommunications link; Algorithm; Telecommunications","score_opus":0.014845897807780808,"score_gpt":0.20292691059290763,"score_spread":0.18808101278512682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285126844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05168875,0.000047530913,0.94191486,0.00009508547,0.0055038626,0.00013587165,5.4971406e-7,0.00027615827,0.00033735685],"genre_scores_gemma":[0.9590762,0.0000063128937,0.04046349,0.000091187365,0.00028190395,0.000029480376,0.0000020583896,0.000012103398,0.000037224214],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982918,0.000031850606,0.00022373411,0.00047529343,0.0005233147,0.000453991],"domain_scores_gemma":[0.9994645,0.000073487005,0.000058149424,0.00020333324,0.00007768863,0.00012283528],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006635308,0.00015532404,0.00014048777,0.00031420204,0.0013212678,0.00025717999,0.00038751677,0.00002351441,0.000001979505],"category_scores_gemma":[0.000006356347,0.0001722312,0.000043539214,0.0017467481,0.000058351477,0.00060642586,0.000022372675,0.000278811,0.0000028829795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003491645,0.00004531991,0.000008170757,0.000009178204,0.0000069098123,0.0000057486573,0.000355458,0.96698475,0.00058779056,0.00016173722,0.0005036615,0.031327788],"study_design_scores_gemma":[0.00019004964,0.0000827412,0.0004743148,0.000013252331,0.000007372795,0.00013053989,0.000017768003,0.99771434,0.00031803394,0.000048622955,0.0007985652,0.00020438097],"about_ca_topic_score_codex":0.000008294633,"about_ca_topic_score_gemma":1.6054697e-7,"teacher_disagreement_score":0.9073875,"about_ca_system_score_codex":0.00014767578,"about_ca_system_score_gemma":0.00012473912,"threshold_uncertainty_score":0.9999789},"labels":[],"label_agreement":null},{"id":"W4285202992","doi":"10.1109/tnse.2022.3171600","title":"Trajectory Design and Resource Allocation for Multi-UAV Networks: Deep Reinforcement Learning Approaches","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":124,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; Government of Jiangsu Province; China Institute of Communications","keywords":"Reinforcement learning; Computer science; Resource allocation; Flexibility (engineering); Trajectory; Distributed computing; Base station; A priori and a posteriori; Resource management (computing); Artificial intelligence; Curse of dimensionality; Resource (disambiguation); Computer network","score_opus":0.027946062520504966,"score_gpt":0.20143507782797115,"score_spread":0.1734890153074662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285202992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001745522,0.000333349,0.9970683,0.000018542272,0.00016770841,0.00042514264,5.615332e-7,0.00020447704,0.000036407564],"genre_scores_gemma":[0.9522623,0.00016772456,0.046850268,0.000022581513,0.00004975306,0.00057107524,0.0000042758447,0.000027640583,0.000044392047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991616,0.000012819211,0.00015295554,0.0002256995,0.00015949101,0.00028743962],"domain_scores_gemma":[0.9996876,0.00007671788,0.000021212587,0.00011101245,0.000023994658,0.00007946123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005861982,0.00012606008,0.0000960704,0.00013851319,0.00081215857,0.000066368186,0.00010163069,0.000032803986,0.0000053031467],"category_scores_gemma":[0.0000036175309,0.00014520812,0.00002136758,0.00057722535,0.00004839091,0.00017064215,0.000003149651,0.00020590721,2.8503868e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007827344,0.000008769345,0.000001870233,0.000015213557,0.000009695069,9.530548e-8,0.00023862276,0.98607415,0.00028932205,0.00010565405,0.000030937626,0.0132178655],"study_design_scores_gemma":[0.0002157137,0.00006865654,0.00003678241,0.000009298058,0.000017215256,0.00000477127,0.00014945697,0.9975542,0.0002404185,0.000002446352,0.0015407852,0.00016028748],"about_ca_topic_score_codex":0.000002210207,"about_ca_topic_score_gemma":0.0000016148688,"teacher_disagreement_score":0.95051676,"about_ca_system_score_codex":0.000115262956,"about_ca_system_score_gemma":0.000018870427,"threshold_uncertainty_score":0.62465495},"labels":[],"label_agreement":null},{"id":"W4285268932","doi":"10.1109/tnse.2022.3188921","title":"6G-Empowered Offloading for Realtime Applications in Multi-Access Edge Computing","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mobile edge computing; Server; Edge computing; Computation offloading; Mobile device; Markov decision process; Distributed computing; Mobile computing; Wireless; Edge device; Reinforcement learning; Enhanced Data Rates for GSM Evolution; Computer network; Artificial intelligence; Markov process; Cloud computing; Operating system","score_opus":0.02650655660859465,"score_gpt":0.2725154155000941,"score_spread":0.24600885889149945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285268932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018514954,0.000076218574,0.9770139,0.0000979215,0.0036343765,0.0003895247,9.728652e-7,0.00019840598,0.000073754796],"genre_scores_gemma":[0.95625806,0.000008331395,0.04321691,0.00010069921,0.00024303875,0.00013343433,8.7730433e-7,0.000014280035,0.000024373556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983664,0.000017459615,0.0002531701,0.00050256634,0.000273447,0.00058693014],"domain_scores_gemma":[0.9992867,0.00021051464,0.000054023338,0.00028060976,0.00005295453,0.00011519561],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0010365995,0.00014971792,0.00016291591,0.0003702608,0.0014113534,0.00025390953,0.0008977445,0.000028230883,0.0000010491646],"category_scores_gemma":[0.0000078070025,0.00016984128,0.000045949666,0.0022946866,0.000052257015,0.000477912,0.00004165936,0.00028955625,0.000001092821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029949051,0.000045536908,0.00006763346,0.000018006675,0.000004257765,0.0000012718617,0.00055800285,0.9707325,0.00091262814,0.00034102914,0.00011654788,0.027199555],"study_design_scores_gemma":[0.00026076255,0.000041992305,0.00067938067,0.000027648779,0.0000033668634,0.000009456357,0.000029042376,0.9946476,0.0004955554,0.00004024453,0.0035639661,0.0002009732],"about_ca_topic_score_codex":0.00002571105,"about_ca_topic_score_gemma":0.0000031158681,"teacher_disagreement_score":0.9377431,"about_ca_system_score_codex":0.00018385398,"about_ca_system_score_gemma":0.00012472951,"threshold_uncertainty_score":0.99988866},"labels":[],"label_agreement":null},{"id":"W4285307446","doi":"10.1109/tnse.2022.3185253","title":"Pareto: Fair Congestion Control With Online Reinforcement Learning","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Huawei Technologies (Canada); University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Pareto principle; Heuristics; Network congestion; Variety (cybernetics); Artificial intelligence; Flow control (data); Machine learning; Distributed computing; Memetics; Mathematical optimization; Computer network; Network packet","score_opus":0.005640305181627298,"score_gpt":0.18160569013900518,"score_spread":0.17596538495737787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285307446","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016843092,0.000091940754,0.98130727,0.00048383753,0.00065971626,0.00019571767,0.0000014481702,0.00031803784,0.00009894171],"genre_scores_gemma":[0.99696934,0.00003597696,0.0023330324,0.00034464605,0.000081969825,0.00009828484,8.6786815e-7,0.000010286854,0.00012561388],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983459,0.000033074622,0.00017591545,0.00039798513,0.0005932351,0.00045387706],"domain_scores_gemma":[0.99935895,0.000113024966,0.000053518757,0.00023089319,0.00008875836,0.0001548438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060498907,0.00015963479,0.00015180135,0.00015470624,0.0010843229,0.00014468166,0.00040979745,0.0000247877,0.000016542079],"category_scores_gemma":[0.0000050665803,0.0001495859,0.000030556097,0.0011348511,0.00008774506,0.0004362753,0.000008061694,0.0004760162,0.0000026165114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022247184,0.00002083569,0.000020890744,0.0000027691467,0.000013231445,0.0000066066204,0.00008741149,0.9323068,0.00012563601,0.0014532515,0.000036920614,0.06590337],"study_design_scores_gemma":[0.00064131117,0.00038338362,0.00022703016,0.000023230965,0.000014676081,0.000044024782,0.000053196403,0.9953162,0.000035715835,0.000009396614,0.003054247,0.00019755754],"about_ca_topic_score_codex":0.000007831379,"about_ca_topic_score_gemma":0.000007010898,"teacher_disagreement_score":0.9801262,"about_ca_system_score_codex":0.0001229052,"about_ca_system_score_gemma":0.00014906576,"threshold_uncertainty_score":0.83398443},"labels":[],"label_agreement":null},{"id":"W4285818425","doi":"10.1109/tnse.2022.3191601","title":"Retracted: Blockchain and Deep Learning for Secure Communication in Digital Twin Empowered Industrial IoT Network","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":109,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Computer science; Autoencoder; Server; Cloud computing; Distributed computing; Deep learning; Data integrity; Scheme (mathematics); Artificial intelligence; Computer network; Data mining; Computer security","score_opus":0.013514646000085208,"score_gpt":0.20711389684196718,"score_spread":0.19359925084188198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285818425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7974962,0.00059038465,0.19723769,0.0001226195,0.0017333331,0.00077473087,0.000038542184,0.00056544266,0.0014410693],"genre_scores_gemma":[0.99893653,0.000056041954,0.00069107057,0.000018581255,0.00010136723,0.00013265146,0.0000058149626,0.000028836648,0.000029128727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988097,0.000011560498,0.00027299667,0.00020130456,0.0002736028,0.0004308561],"domain_scores_gemma":[0.99950016,0.0001881729,0.000027207452,0.0001466822,0.00003239635,0.000105407744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006406649,0.00016177495,0.00015465624,0.00020843255,0.0004978002,0.00019694633,0.00019250235,0.000107555534,0.000011346392],"category_scores_gemma":[0.000017027261,0.00019813635,0.000029930314,0.0011762554,0.00007814181,0.00038103524,0.000006269634,0.0009785,6.591017e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014950204,0.000011285508,0.00007471901,0.000015138568,0.000009268028,7.5977454e-7,0.0003238965,0.9756013,0.000068003625,0.00009431835,0.00008352566,0.023702841],"study_design_scores_gemma":[0.0005818974,0.00009563613,0.00020692847,0.000082312195,0.000008856953,0.000021223008,0.00040267812,0.9901578,0.00009603983,0.00007885927,0.007990642,0.00027712793],"about_ca_topic_score_codex":0.0000035369,"about_ca_topic_score_gemma":0.000007189715,"teacher_disagreement_score":0.2014403,"about_ca_system_score_codex":0.00015464418,"about_ca_system_score_gemma":0.000033466273,"threshold_uncertainty_score":0.80797654},"labels":[],"label_agreement":null},{"id":"W4293198140","doi":"10.1109/tnse.2022.3161479","title":"Detection and Prediction of FDI Attacks in IoT Systems via Hidden Markov Model","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Hidden Markov model; Benchmark (surveying); Internet of Things; Reputation; Process (computing); Latency (audio); Computer security; Markov process; Artificial intelligence; Machine learning; Distributed computing; Telecommunications","score_opus":0.008920826916470097,"score_gpt":0.19005981706105146,"score_spread":0.18113899014458137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293198140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24605054,0.00014552356,0.7524987,0.000027591423,0.0010266032,0.00013867777,0.0000026639623,0.000075758566,0.000033936536],"genre_scores_gemma":[0.99750125,0.00008273794,0.0022711107,0.000022001193,0.000043730186,0.00005667576,1.2044909e-7,0.0000067958113,0.00001554683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987402,0.00003152072,0.00023081661,0.00033659817,0.00039292173,0.0002679271],"domain_scores_gemma":[0.99958545,0.000046957935,0.000050510695,0.00019521361,0.00004416651,0.000077685014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008548017,0.000108061315,0.00013257055,0.00035353415,0.00046734518,0.00006705244,0.00022371345,0.00004302144,0.0000024744697],"category_scores_gemma":[0.0000032839841,0.00011954675,0.000023082546,0.0014877,0.000065497945,0.00033317474,0.000015708118,0.00030306142,3.1571233e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011245242,0.000018707591,0.000010975708,0.000015344014,0.0000031112056,8.8842216e-7,0.00022475522,0.94208694,0.0073112575,0.00011133254,0.000007611358,0.05019782],"study_design_scores_gemma":[0.00016755961,0.00015740747,0.0003402029,0.000030028292,0.000004530355,0.00004570529,0.000027514032,0.9976869,0.0012860318,0.000071503935,0.000083924,0.00009869476],"about_ca_topic_score_codex":0.000056820947,"about_ca_topic_score_gemma":0.000017540044,"teacher_disagreement_score":0.7514508,"about_ca_system_score_codex":0.00012769249,"about_ca_system_score_gemma":0.000045434044,"threshold_uncertainty_score":0.48749748},"labels":[],"label_agreement":null},{"id":"W4295037719","doi":"10.1109/tnse.2022.3195370","title":"Guest Editorial Introduction to the Special Section on Collaborative Machine Learning for Next-Generation Intelligent Applications","year":2022,"lang":"en","type":"editorial","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Software deployment; Special section; Computer science; Collaborative learning; Open research; Focus (optics); Artificial intelligence; Data science; Engineering management; Knowledge management; Engineering; Software engineering; World Wide Web","score_opus":0.011828871351036507,"score_gpt":0.2295967274689162,"score_spread":0.21776785611787972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295037719","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008514586,0.00002804013,0.47131777,0.00028510424,0.527769,0.00047812998,0.0000039576116,0.00009261461,0.000016831977],"genre_scores_gemma":[0.00031138465,0.00011015684,0.0019527363,0.000034132532,0.99678415,0.00060986896,0.00003385006,0.000028114617,0.00013563449],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99724233,0.000057392845,0.00031908177,0.0008686348,0.0010315266,0.0004810513],"domain_scores_gemma":[0.9984032,0.00047107818,0.0001209047,0.00040060602,0.00047424829,0.00012994173],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016494811,0.00029739944,0.00022685337,0.0003759498,0.0026710588,0.0007886606,0.00070763275,0.00018583648,0.0000029414066],"category_scores_gemma":[0.00012675388,0.00027224846,0.000071952636,0.0023703717,0.000057048568,0.00046645416,0.000023528983,0.0011800436,0.000008295281],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015246117,0.000015551213,2.842038e-8,0.0000067631363,0.0000085328775,1.151254e-7,0.00023296349,0.46679953,0.00017290127,0.000043390195,0.52510095,0.0076040714],"study_design_scores_gemma":[0.00010010437,0.0003272062,2.3174096e-7,0.000016946147,0.000016469232,0.0000012268187,0.000016714575,0.2165314,0.00036465083,0.000006766984,0.78239906,0.000219237],"about_ca_topic_score_codex":0.00001677483,"about_ca_topic_score_gemma":0.000021007567,"teacher_disagreement_score":0.46936503,"about_ca_system_score_codex":0.0005585108,"about_ca_system_score_gemma":0.0003908788,"threshold_uncertainty_score":0.999973},"labels":[],"label_agreement":null},{"id":"W4312361566","doi":"10.1109/tnse.2022.3217460","title":"Flocks, Mobs, and Figure Eights: Swarming as a Lemniscatic Arch","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Royal Military College of Canada","funders":"","keywords":"Swarm behaviour; Arch; Swarming (honey bee); Computer science; Mathematics; Artificial intelligence; Geometry; Mathematical optimization; Algorithm; Structural engineering; Engineering","score_opus":0.007847835142662553,"score_gpt":0.20089226501244603,"score_spread":0.19304442986978348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312361566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05764116,0.00043195533,0.9397105,0.0003490118,0.0012078632,0.0002460992,0.0000062603076,0.00021384015,0.00019330104],"genre_scores_gemma":[0.99693066,0.00002931074,0.0026009767,0.00012326326,0.000057296864,0.00011052725,4.2045323e-7,0.000009811435,0.00013770835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824107,0.000029363857,0.00020054553,0.00048154438,0.00055469,0.00049281615],"domain_scores_gemma":[0.9992976,0.00009098926,0.000039888724,0.00034255692,0.000043575856,0.00018534342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069719146,0.00015952263,0.00015986325,0.00021161289,0.0010227127,0.00020061743,0.00058755546,0.0000269492,0.000008844011],"category_scores_gemma":[0.000008696151,0.00016203792,0.000034259854,0.001315718,0.00007574648,0.000521347,0.000020905869,0.00029771472,0.0000057911366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000038487046,0.000030936957,0.000024916968,0.000020095516,0.000016697066,0.000016573937,0.0005561705,0.9805641,0.002616009,0.001884527,0.00013463016,0.014131484],"study_design_scores_gemma":[0.0002857502,0.000106766216,0.00023978823,0.00004235792,0.000011203242,0.00011040888,0.000095053816,0.99389297,0.0004030635,0.00006756239,0.004511634,0.00023342014],"about_ca_topic_score_codex":0.00005052499,"about_ca_topic_score_gemma":0.000004285408,"teacher_disagreement_score":0.9392895,"about_ca_system_score_codex":0.00011861998,"about_ca_system_score_gemma":0.00012441134,"threshold_uncertainty_score":0.78659827},"labels":[],"label_agreement":null},{"id":"W4312595421","doi":"10.1109/tnse.2022.3211192","title":"When Collaborative Federated Learning Meets Blockchain to Preserve Privacy in Healthcare","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":69,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Notation; Health care; Service provider; Artificial intelligence; Service (business); Machine learning; Mathematics","score_opus":0.01625646702471899,"score_gpt":0.2454283165302232,"score_spread":0.2291718495055042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312595421","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.121007584,0.00025537892,0.8368761,0.039344694,0.0009874164,0.0005792209,0.00001285765,0.00087771274,0.000059014586],"genre_scores_gemma":[0.9376442,0.000028803204,0.061867513,0.00022979842,0.000017041837,0.00017334998,5.5973015e-7,0.0000118523185,0.000026902297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785393,0.0000769982,0.0002235576,0.00064285274,0.000573188,0.00062945986],"domain_scores_gemma":[0.9982875,0.00014444508,0.00004229477,0.0012776698,0.000097332326,0.00015075128],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.0012671109,0.00016502367,0.0001733586,0.00048110544,0.0010153481,0.00024708995,0.0058128294,0.000044965247,0.0000063823313],"category_scores_gemma":[0.0005808207,0.00018548695,0.000018392568,0.00457504,0.00006409593,0.0004557786,0.0013897088,0.00068967807,0.0000024836145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000943373,0.000024919947,0.00005219381,0.000009322288,0.000005279969,0.000014676935,0.00066332787,0.9863969,0.0011560088,0.0003163348,0.0015441809,0.009807404],"study_design_scores_gemma":[0.00018587644,0.00023109169,0.00023748758,0.000048604314,0.0000016712632,0.000013187741,0.00013586211,0.9932959,0.0015881867,0.0010138252,0.0030075843,0.00024069719],"about_ca_topic_score_codex":0.000116320676,"about_ca_topic_score_gemma":0.000068176814,"teacher_disagreement_score":0.8166366,"about_ca_system_score_codex":0.00034418437,"about_ca_system_score_gemma":0.0002356616,"threshold_uncertainty_score":0.9995662},"labels":[],"label_agreement":null},{"id":"W4312737157","doi":"10.1109/tnse.2022.3227317","title":"Blockchain-Powered Tensor Meta-Learning-Driven Intelligent Healthcare System With IoT Assistance","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Big data; Upload; Blockchain; Edge computing; Data modeling; Node (physics); Differential privacy; Health care; Artificial intelligence; Distributed computing; Computer security; Internet of Things; Data science; Database; Data mining; World Wide Web; Engineering","score_opus":0.024160977404488682,"score_gpt":0.22889867870826594,"score_spread":0.20473770130377725,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312737157","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076440186,0.0004559237,0.9866601,0.0030111931,0.00080818933,0.00024042733,0.000011335711,0.0011231147,0.00004568613],"genre_scores_gemma":[0.92329013,0.000040733263,0.076343305,0.000083553125,0.000024422865,0.0001635225,3.953226e-7,0.000017167245,0.000036782756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99752927,0.00005519424,0.00023999767,0.0007322254,0.0008001819,0.0006431229],"domain_scores_gemma":[0.99737513,0.00013134873,0.00008466454,0.0021474834,0.000104881925,0.00015647948],"candidate_categories":["open_science"],"consensus_categories":[],"category_scores_codex":[0.00094225723,0.00022642357,0.00028220823,0.00029917914,0.0012465086,0.0001815666,0.006349193,0.00004522206,0.000008187161],"category_scores_gemma":[0.00011190337,0.00019886483,0.00005935144,0.0025259566,0.0001502893,0.00021005569,0.00064054155,0.0007388585,0.0000031514005],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009489854,0.000020710751,0.000014998772,0.00003516729,0.000070176946,0.00002419679,0.00010315167,0.99310213,0.00023125253,0.0010698149,0.00028972718,0.00502921],"study_design_scores_gemma":[0.00011171309,0.00026742104,0.00007546633,0.00005599648,0.00003891717,0.000104128056,0.00017582325,0.996145,0.0006760765,0.00007096713,0.0020137585,0.00026470653],"about_ca_topic_score_codex":0.000047483776,"about_ca_topic_score_gemma":0.000016899156,"teacher_disagreement_score":0.9156461,"about_ca_system_score_codex":0.0003920131,"about_ca_system_score_gemma":0.00014938807,"threshold_uncertainty_score":0.99902695},"labels":[],"label_agreement":null},{"id":"W4312864044","doi":"10.1109/tnse.2022.3218313","title":"Retracted: A DQN-Based Frame Aggregation and Task Offloading Approach for Edge-Enabled IoMT","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":58,"is_retracted":true,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Fundamental Research Funds for the Central Universities; Zhejiang University; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Quality of service; Energy consumption; Computer network; Frame (networking); Node (physics); Throughput; Body area network; Wearable computer; Enhanced Data Rates for GSM Evolution; Distributed computing; Edge computing; Wireless; Wireless sensor network; Embedded system; Telecommunications","score_opus":0.010305534303243317,"score_gpt":0.1992648163560464,"score_spread":0.18895928205280307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312864044","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03140225,0.000121725694,0.9644637,0.000118729295,0.0033655462,0.00024505457,8.7644383e-7,0.00019614931,0.00008595408],"genre_scores_gemma":[0.92811584,0.000008298689,0.071236946,0.00015412898,0.00035773817,0.00008727072,0.0000011366127,0.000013071223,0.000025544545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000019204159,0.00018039177,0.0004873362,0.0003730841,0.0004931303],"domain_scores_gemma":[0.99935085,0.00016623859,0.000049900045,0.00023371913,0.000070018476,0.00012929329],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011184826,0.00015171505,0.0001467685,0.0002955275,0.0014521504,0.00028178122,0.00038399402,0.000049850718,9.850572e-7],"category_scores_gemma":[0.000015485746,0.00016343397,0.000041771455,0.0015685349,0.00006703817,0.00048763544,0.000013328251,0.00036092475,4.4186763e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009439189,0.000030573457,0.0000107321375,0.000032010896,0.0000070523215,0.0000013235389,0.00042706943,0.9624083,0.0027174742,0.00016430623,0.00028387565,0.033907834],"study_design_scores_gemma":[0.00026413766,0.00011044194,0.00008451818,0.000027632475,0.000008930454,0.000017866341,0.000022359165,0.99578106,0.0012838383,0.0000519602,0.0021470618,0.00020017587],"about_ca_topic_score_codex":0.000008735388,"about_ca_topic_score_gemma":2.7067796e-7,"teacher_disagreement_score":0.8967136,"about_ca_system_score_codex":0.00011374547,"about_ca_system_score_gemma":0.00012242561,"threshold_uncertainty_score":0.9998478},"labels":[],"label_agreement":null},{"id":"W4313643885","doi":"10.1109/tnse.2023.3234720","title":"Connectivity Preservation and Collision Avoidance in Multi-Agent Systems Using Model Predictive Control","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Space Agency; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Model predictive control; Collision avoidance; Computer science; Position (finance); Control theory (sociology); Distributed computing; Controller (irrigation); Multi-agent system; Field (mathematics); Scheme (mathematics); Topology (electrical circuits); Control (management); Collision; Artificial intelligence; Engineering; Mathematics; Computer security","score_opus":0.03265230708582384,"score_gpt":0.244379077081941,"score_spread":0.21172676999611717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313643885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19317234,0.0001007279,0.80529636,0.000050526523,0.00070260756,0.00045804586,0.000014989776,0.00019857298,0.0000057979137],"genre_scores_gemma":[0.9973006,0.000052286843,0.0024750417,0.00001969472,0.000029407025,0.00009541694,4.4940364e-7,0.000010156927,0.000016916492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982507,0.00004743732,0.00026405277,0.0005244072,0.00042830655,0.00048510052],"domain_scores_gemma":[0.9992075,0.00019259045,0.00006281261,0.00027552075,0.00011843161,0.00014317005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013432363,0.0001712438,0.00022448931,0.0003144527,0.0003451939,0.00026818036,0.00030714058,0.000069810085,1.1031163e-7],"category_scores_gemma":[0.00003735251,0.00017387961,0.000024957837,0.0018296625,0.00007369796,0.0014149742,0.000010259699,0.00018977356,0.0000019039198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009506947,0.000021139103,0.00015025333,0.000024669924,0.000008161878,0.0000041101234,0.0002316637,0.9930293,0.0057485597,0.00031722942,0.0000075131575,0.0004478789],"study_design_scores_gemma":[0.0007808828,0.000038216986,0.0028322372,0.00016674427,0.000007519815,0.0000069594357,0.00003979313,0.99571204,0.00022235507,0.000014524891,0.000013704009,0.00016500332],"about_ca_topic_score_codex":0.00008947479,"about_ca_topic_score_gemma":0.000019193076,"teacher_disagreement_score":0.8041283,"about_ca_system_score_codex":0.0002111974,"about_ca_system_score_gemma":0.00010890158,"threshold_uncertainty_score":0.7090605},"labels":[],"label_agreement":null},{"id":"W4316660683","doi":"10.1109/tnse.2023.3237367","title":"MiTFed: A Privacy Preserving Collaborative Network Attack Mitigation Framework Based on Federated Learning Using SDN and Blockchain","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":121,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Intrusion detection system; Denial-of-service attack; Computer security; Field (mathematics); Artificial intelligence; Machine learning; The Internet; World Wide Web","score_opus":0.01519421414649342,"score_gpt":0.2447492574588251,"score_spread":0.22955504331233167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4316660683","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25602624,0.00007869256,0.7419134,0.0003062746,0.0009390331,0.00023734054,0.0000010247154,0.0004444235,0.000053560987],"genre_scores_gemma":[0.9784616,0.00010485083,0.020886816,0.00020942383,0.00025677175,0.000031150914,7.273497e-7,0.000021445205,0.000027207303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777466,0.000091217014,0.00026402334,0.0006430761,0.00054314063,0.0006838997],"domain_scores_gemma":[0.9987936,0.00046473186,0.000084218744,0.00027801207,0.0001680934,0.0002113343],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011746812,0.00024969643,0.00021360257,0.00035038294,0.0019340266,0.00063657085,0.00031898683,0.00014107983,0.0000067651918],"category_scores_gemma":[0.00007607673,0.00026155153,0.000039402425,0.005676769,0.00012344883,0.00056829216,0.000022497623,0.00061239465,0.000006433341],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017632008,0.000013076429,0.000028829912,0.000017760787,0.000009227193,0.0000053294884,0.0003976175,0.9907168,0.0008638263,0.0002762648,0.000111320645,0.0075423033],"study_design_scores_gemma":[0.00021244053,0.00019105723,0.00031793214,0.0004260327,0.000009719948,0.0000074095274,0.00004372411,0.99655545,0.0010757693,0.00019849678,0.00068424316,0.00027770916],"about_ca_topic_score_codex":0.0000123762775,"about_ca_topic_score_gemma":0.000009101468,"teacher_disagreement_score":0.72243536,"about_ca_system_score_codex":0.00010773273,"about_ca_system_score_gemma":0.00014100118,"threshold_uncertainty_score":0.99998367},"labels":[],"label_agreement":null},{"id":"W4321609790","doi":"10.1109/tnse.2022.3226422","title":"Intelligent Task Allocation for Mobile Crowdsensing With Graph Attention Network and Deep Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Heuristics; Reinforcement learning; Task (project management); Solver; Task analysis; Artificial intelligence; Distributed computing; Machine learning; Engineering","score_opus":0.008987983892442675,"score_gpt":0.2096274687898367,"score_spread":0.20063948489739403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321609790","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08088332,0.00010191698,0.9178041,0.00006226727,0.00050002034,0.0002985248,1.3415216e-7,0.00032414118,0.000025543419],"genre_scores_gemma":[0.98728716,0.00021155168,0.012196751,0.00004703189,0.00010519468,0.000071360235,0.0000013169632,0.00001678196,0.00006281975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984397,0.000014827508,0.00020315227,0.00046582974,0.00030792074,0.0005685678],"domain_scores_gemma":[0.9993135,0.00014161736,0.000055254535,0.00022556257,0.00012424226,0.0001398696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009590869,0.00017342827,0.00014653527,0.00023605958,0.0010273298,0.00035582573,0.00016039818,0.000050237362,5.7268295e-7],"category_scores_gemma":[0.000009438984,0.00016357633,0.000036711248,0.0017000522,0.000110797824,0.00046089457,0.00000877969,0.00018951352,0.0000025979352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075970797,0.000004682154,0.000020021964,0.000023357317,0.000011549065,0.0000016850481,0.00033879356,0.9476224,0.0024628965,0.0003358651,0.000023180153,0.049147945],"study_design_scores_gemma":[0.00016876141,0.00020228466,0.00025266391,0.00016852378,0.000016521482,0.00002426163,0.000115870746,0.99703074,0.0011985188,0.000054060183,0.0005582997,0.00020948604],"about_ca_topic_score_codex":0.000009557178,"about_ca_topic_score_gemma":0.000009787668,"teacher_disagreement_score":0.9064039,"about_ca_system_score_codex":0.000057161134,"about_ca_system_score_gemma":0.000045252065,"threshold_uncertainty_score":0.79014945},"labels":[],"label_agreement":null},{"id":"W4352977279","doi":"10.1109/tnse.2023.3257034","title":"Multipath Congestion Control: Measurement, Analysis, and Optimization From the Energy Perspective","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Multipath TCP; Computer science; Network congestion; Energy consumption; Multipath propagation; Efficient energy use; Computer network; Throughput; Energy (signal processing); Distributed computing; Exploit; The Internet; Wireless; Engineering; Channel (broadcasting); Telecommunications; Network packet","score_opus":0.010976283743876167,"score_gpt":0.19715817908179847,"score_spread":0.18618189533792232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4352977279","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022915981,0.00031641548,0.9956461,0.0008808024,0.00047491802,0.00009556641,0.0000036170497,0.00026937397,0.000021612252],"genre_scores_gemma":[0.99603754,0.00036672907,0.003218256,0.00022125038,0.00010225361,0.00003566432,6.2819e-7,0.0000061719797,0.00001148113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867815,0.00003791849,0.00013683655,0.00040713084,0.0004402569,0.00029969597],"domain_scores_gemma":[0.9991517,0.00024044709,0.00003792817,0.0002430071,0.00021741023,0.00010947309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007875447,0.00013179296,0.00014417944,0.00019367937,0.0005266738,0.0002508508,0.00027644372,0.000041632877,0.0000024577787],"category_scores_gemma":[0.000022572794,0.00010537534,0.00004287224,0.0026975337,0.00011270589,0.00039415777,0.000004708903,0.00012698295,0.0000018881996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005809432,0.0000063475613,0.00002780033,5.5428825e-7,0.000074256466,0.0000012030602,0.00015659371,0.9675761,0.00017549547,0.0023485622,0.000039025093,0.029588291],"study_design_scores_gemma":[0.00030122127,0.000027372675,0.002060607,0.000016809514,0.00009313075,0.0000015802791,0.000048506867,0.9970914,0.000057197147,0.000056725436,0.00012436054,0.00012105585],"about_ca_topic_score_codex":0.00012070179,"about_ca_topic_score_gemma":0.000093672366,"teacher_disagreement_score":0.993746,"about_ca_system_score_codex":0.000072347815,"about_ca_system_score_gemma":0.00006753341,"threshold_uncertainty_score":0.42970815},"labels":[],"label_agreement":null},{"id":"W4376607524","doi":"10.1109/tnse.2023.3275971","title":"Remote State Estimation in Networked Systems: Data Pre-Processing or Not?","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Fault Detection and Control Systems","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Estimation; State (computer science); Algorithm; Engineering; Systems engineering","score_opus":0.022600852696794942,"score_gpt":0.25157812811378133,"score_spread":0.2289772754169864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063240446,0.00019885272,0.93308145,0.000026561313,0.0021115781,0.00026962193,0.000010013532,0.0009915838,0.00006992164],"genre_scores_gemma":[0.9988381,0.00022704105,0.0006531995,0.000014517842,0.0000787865,0.000024133024,0.0000023088028,0.000029948302,0.00013192174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985647,0.000013679007,0.00029494017,0.0003223756,0.00031635424,0.00048794854],"domain_scores_gemma":[0.99942416,0.00007890384,0.000023823342,0.00033221574,0.00003017585,0.000110744324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009285891,0.00016538826,0.00018765368,0.00034436554,0.00020424042,0.00021024332,0.0002743823,0.000058184003,0.0000022238034],"category_scores_gemma":[0.00001450143,0.00015443559,0.000015324495,0.0024434358,0.00004252799,0.00066432665,0.000004214281,0.00022970302,0.000015527934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002000965,0.0000022830136,9.550125e-7,0.00007846964,0.0000062437366,0.000005738286,0.000115775,0.924337,0.0008199139,0.0000015061819,0.000086728265,0.07452536],"study_design_scores_gemma":[0.00023146713,0.000020622012,0.00022502172,0.0002948222,0.0000070281285,0.00001610476,0.000049050333,0.99808466,0.0001256977,0.0000029388798,0.0007606704,0.00018190981],"about_ca_topic_score_codex":0.00006560427,"about_ca_topic_score_gemma":0.000085765954,"teacher_disagreement_score":0.9355977,"about_ca_system_score_codex":0.00010723563,"about_ca_system_score_gemma":0.000053264816,"threshold_uncertainty_score":0.62977004},"labels":[],"label_agreement":null},{"id":"W4376607588","doi":"10.1109/tnse.2023.3276166","title":"Patient-centric fine-grained access control for electronic medical record sharing with security via dual-blockchain","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Blockchain; Computer science; Access control; Dual (grammatical number); Computer security; Computer network","score_opus":0.00644647725320229,"score_gpt":0.2186550930677321,"score_spread":0.2122086158145298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376607588","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12813747,0.000057958765,0.8694379,0.001083544,0.00026946003,0.00040687612,0.00000313828,0.0005910854,0.000012560855],"genre_scores_gemma":[0.99761564,0.00006844187,0.001741825,0.0001563291,0.000056114786,0.00033909924,6.55067e-7,0.000013505439,0.00000838132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787796,0.000010440624,0.00022593248,0.00062406005,0.00043561446,0.00082599814],"domain_scores_gemma":[0.99900347,0.00019771037,0.00005247519,0.00043663793,0.00011422057,0.00019548678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090302445,0.00018095621,0.00019321675,0.00037195982,0.0005794254,0.00012940714,0.0007800479,0.000117446085,0.000004532478],"category_scores_gemma":[0.00002383559,0.00016323688,0.000044144832,0.003448723,0.00013845484,0.00025153885,0.000020476064,0.00038312594,0.0000035997484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000680449,0.00018353507,0.00020693055,0.000079525285,0.000091073925,0.000026242973,0.00054484437,0.66816276,0.00059981475,0.034249686,0.0004091124,0.29537845],"study_design_scores_gemma":[0.0005051663,0.00018380533,0.00013423878,0.000036494046,0.000010295503,0.000028765275,0.0000075996218,0.9955863,0.0005457536,0.0020422288,0.0007158999,0.00020350245],"about_ca_topic_score_codex":0.00002456551,"about_ca_topic_score_gemma":0.000107227424,"teacher_disagreement_score":0.86947817,"about_ca_system_score_codex":0.00008895892,"about_ca_system_score_gemma":0.00018184815,"threshold_uncertainty_score":0.6656607},"labels":[],"label_agreement":null},{"id":"W4379382325","doi":"10.1109/tnse.2023.3282870","title":"Quasi-Optimization of Resource Allocation and Positioning for Solar-Powered UAVs","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University; École de Technologie Supérieure","funders":"","keywords":"Computer science; Software deployment; Benchmark (surveying); Coordinate descent; Resource allocation; Throughput; Real-time computing; Optimization problem; Distributed computing; Communications system; Wireless; Computer network; Algorithm; Telecommunications","score_opus":0.007299010370804264,"score_gpt":0.199898038563292,"score_spread":0.19259902819248773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379382325","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017980034,0.000064319756,0.9812229,0.00005819988,0.00014252256,0.00020013466,0.000006715127,0.0002399041,0.00008524584],"genre_scores_gemma":[0.9730412,0.00034876209,0.026435744,0.00001214814,0.00003948502,0.00007599927,0.000008827409,0.000020862202,0.000017012615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999365,0.0000033846616,0.00015304837,0.0001579407,0.00012454315,0.00019613375],"domain_scores_gemma":[0.9996755,0.000069496615,0.000020172201,0.00010710384,0.0000710375,0.00005670214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030372874,0.00008858138,0.00009048008,0.00020870342,0.00023167803,0.000047578927,0.000061154366,0.00004638721,0.0000022469424],"category_scores_gemma":[0.000006843224,0.00010026785,0.00001749611,0.0010139887,0.000051798183,0.00022465276,0.000001254921,0.00006195615,8.092837e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036738982,0.0000069685357,0.0000029116006,0.00003564775,0.000006295493,4.9550533e-8,0.000123999,0.9912075,0.0027693182,0.0002807486,0.000049996208,0.0055128937],"study_design_scores_gemma":[0.00013588966,0.000046469413,0.00011756577,0.00004441119,0.000013688106,0.0000019474803,0.000045508248,0.9965021,0.0026965358,0.000024849314,0.00027072037,0.00010034241],"about_ca_topic_score_codex":0.0000024995386,"about_ca_topic_score_gemma":0.0000018056129,"teacher_disagreement_score":0.95506114,"about_ca_system_score_codex":0.000032260352,"about_ca_system_score_gemma":0.000015721795,"threshold_uncertainty_score":0.4088804},"labels":[],"label_agreement":null},{"id":"W4383340492","doi":"10.1109/tnse.2023.3293053","title":"Software Defined Networking Assisted Electric Vehicle Charging: Towards Smart Charge Scheduling and Management","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Electric Vehicles and Infrastructure","field":"Engineering","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"","keywords":"Scheduling (production processes); Computer science; Software; Electric vehicle; Electrical engineering; Embedded system; Engineering; Power (physics); Operating system; Physics","score_opus":0.010383504853184235,"score_gpt":0.19918456884344046,"score_spread":0.18880106399025623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383340492","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6596293,0.0014573584,0.33381525,0.0001339778,0.0019780323,0.0003851701,0.0000047591648,0.0021439635,0.00045219305],"genre_scores_gemma":[0.9941025,0.0023774023,0.0031462498,0.00006262566,0.00017785707,0.000039858198,0.0000015392009,0.000044924822,0.000047044232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983409,0.0000066111866,0.00020202658,0.00034541628,0.00031608363,0.0007889591],"domain_scores_gemma":[0.9995476,0.000046753197,0.00001976041,0.00017175758,0.000036316556,0.00017782817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040989602,0.00023433377,0.00019176125,0.00040239454,0.00046852874,0.00015216002,0.00016439937,0.00008394366,0.0000070230635],"category_scores_gemma":[0.000004521862,0.00024206011,0.000039636656,0.0030685514,0.00004221156,0.00027151298,0.0000060885486,0.00033810132,0.000010270998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046916784,0.000004877296,0.000067412875,0.00009348176,0.000037210393,0.00000956948,0.000059263693,0.8544727,0.0063304044,0.0000973014,0.00017481332,0.13864826],"study_design_scores_gemma":[0.00023466817,0.000039418832,0.0058344565,0.00011957219,0.000027476128,0.000021598316,0.000012911022,0.9899885,0.001803319,0.000029377867,0.0015956202,0.00029309277],"about_ca_topic_score_codex":0.000004515527,"about_ca_topic_score_gemma":0.000002079868,"teacher_disagreement_score":0.3344732,"about_ca_system_score_codex":0.000102672304,"about_ca_system_score_gemma":0.00002488285,"threshold_uncertainty_score":0.9870925},"labels":[],"label_agreement":null},{"id":"W4384789936","doi":"10.1109/tnse.2023.3296511","title":"Delay-Optimized Multi-User VR Streaming via End-Edge Collaborative Neural Frame Interpolation","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Windsor; Memorial University of Newfoundland; University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Interpolation (computer graphics); Frame (networking); Frame rate; Enhanced Data Rates for GSM Evolution; Motion interpolation; Queueing theory; Real-time computing; Virtual reality; Computer vision; Artificial intelligence; Computer network; Video processing; Video tracking","score_opus":0.017820136289594817,"score_gpt":0.27167293791619335,"score_spread":0.2538528016265985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384789936","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014179995,0.000032424592,0.9837571,0.00030468896,0.0011363361,0.00017181026,0.0000036260528,0.00036576545,0.000048284986],"genre_scores_gemma":[0.92128533,0.00004036466,0.07826099,0.00015422283,0.00006567829,0.000037989306,0.0000012382072,0.000011412721,0.00014278642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983866,0.000033726254,0.00022489933,0.00042018303,0.00045051458,0.00048408215],"domain_scores_gemma":[0.9991849,0.00016701675,0.00004626045,0.0002825636,0.0001803856,0.00013885277],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007506377,0.00017118819,0.00015851353,0.000290992,0.0004811492,0.00036067946,0.0003939547,0.000054847133,0.000006125738],"category_scores_gemma":[0.0000164479,0.00016806148,0.00004202108,0.0026697721,0.0000928343,0.0013491431,0.000013560983,0.0002469416,0.000017806802],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007566844,0.000030485882,0.000009957904,0.000010975756,0.000015457692,0.000010878054,0.0014831905,0.9535798,0.006997985,0.0005229122,0.000102101534,0.037228703],"study_design_scores_gemma":[0.00027912352,0.00006419952,0.00043423075,0.000038710208,0.000007292439,0.0000072975718,0.0001090216,0.99623525,0.0021850173,0.000024941746,0.00042379054,0.00019114604],"about_ca_topic_score_codex":0.000025872961,"about_ca_topic_score_gemma":0.000013466002,"teacher_disagreement_score":0.9071053,"about_ca_system_score_codex":0.00008028369,"about_ca_system_score_gemma":0.000105951265,"threshold_uncertainty_score":0.68533486},"labels":[],"label_agreement":null},{"id":"W4385327002","doi":"10.1109/tnse.2023.3299462","title":"Game Theoretical Incentive for USV Fleet-Assisted Data Sharing in Maritime Communication Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Bidding; Computer science; Data sharing; Incentive; Computer network; Network packet; Game theory; Data modeling; Operations research; Database; Engineering; Business; Economics","score_opus":0.022124644202420548,"score_gpt":0.24924678555034502,"score_spread":0.22712214134792447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385327002","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013720926,0.00009321172,0.98498416,0.00006459923,0.00021574399,0.0003061673,0.000017425928,0.00036847006,0.0002292749],"genre_scores_gemma":[0.9916499,0.0006987092,0.0073738853,0.000019970017,0.000047076985,0.00013423248,0.00003851226,0.000027079052,0.000010636987],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895734,0.000006408801,0.00020487752,0.00031412736,0.00013908654,0.00037817075],"domain_scores_gemma":[0.99924886,0.00015009799,0.0000149669295,0.00046327154,0.000046522964,0.00007628411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572063,0.00012311328,0.00012246247,0.00021429922,0.00020440291,0.00011604386,0.0004888588,0.00006998221,0.000008046977],"category_scores_gemma":[0.000009956307,0.00013625222,0.000018649122,0.0017286211,0.00012535759,0.00039635296,0.000015108759,0.00019887355,0.000004178104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046884234,0.000009632397,0.000022320703,0.000016451051,0.000006573441,3.0361483e-7,0.000052773332,0.98689806,0.00018663745,0.0028088577,0.00009338817,0.009900331],"study_design_scores_gemma":[0.00018722814,0.000009622599,0.0012656974,0.000086411805,0.000010918971,0.0000016614514,0.000027741642,0.9976868,0.00008613841,0.00020767585,0.0002834876,0.00014658875],"about_ca_topic_score_codex":0.0000066491766,"about_ca_topic_score_gemma":0.000026906499,"teacher_disagreement_score":0.977929,"about_ca_system_score_codex":0.00007364763,"about_ca_system_score_gemma":0.000018758077,"threshold_uncertainty_score":0.55562043},"labels":[],"label_agreement":null},{"id":"W4385486134","doi":"10.1109/tnse.2023.3301402","title":"A Quantum-Inspired Sensor Consolidation Measurement Approach for Cyber-Physical Systems","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brandon University","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Computer science; Scalability; Node (physics); Distributed computing; Real-time computing; Computer network; Engineering","score_opus":0.0330769608544508,"score_gpt":0.2292855689021431,"score_spread":0.1962086080476923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385486134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01988789,0.00016206583,0.9780337,0.000024476518,0.0006521317,0.00038685836,0.000005149579,0.0006164595,0.0002312713],"genre_scores_gemma":[0.99751997,0.00015767633,0.0019334167,0.000013138498,0.00010729575,0.00022074125,0.0000037006148,0.000028036227,0.000016040563],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988936,0.000012575807,0.00016204338,0.00020704666,0.00034994155,0.00037474907],"domain_scores_gemma":[0.99944806,0.00006256955,0.000016644874,0.00025745187,0.00010141676,0.000113883674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064534316,0.00014321458,0.0001521474,0.00018011026,0.00027574803,0.0000964466,0.00015956258,0.000051593637,6.318439e-7],"category_scores_gemma":[0.000009151647,0.00014740303,0.000047615955,0.0010748762,0.00005607974,0.00013345867,0.0000020147806,0.00014631014,0.000006773476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042552124,0.000012207885,6.147847e-7,0.00004732928,0.000018167853,3.5453425e-7,0.00008857952,0.9845817,0.012154533,0.0003690855,0.00025194773,0.002471195],"study_design_scores_gemma":[0.0001932243,0.000028203225,0.000035261794,0.000047630576,0.000016975344,0.0000041590133,0.000045072993,0.9962252,0.0016707581,0.000006194763,0.0015613695,0.00016594262],"about_ca_topic_score_codex":0.000003458821,"about_ca_topic_score_gemma":9.600166e-7,"teacher_disagreement_score":0.97763205,"about_ca_system_score_codex":0.000094660325,"about_ca_system_score_gemma":0.000032379958,"threshold_uncertainty_score":0.6010921},"labels":[],"label_agreement":null},{"id":"W4386025640","doi":"10.1109/tnse.2023.3306202","title":"To Compute or Not to Compute? Adaptive Smart Sensing in Resource-Constrained Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Agencia Estatal de Investigación; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Dipartimenti di Eccellenza","keywords":"Computer science; Wireless sensor network; Computation; Edge computing; Signal processing; Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Algorithm; Computer hardware; Computer network; Digital signal processing","score_opus":0.018368153339251715,"score_gpt":0.2298125842803477,"score_spread":0.211444430941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386025640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022480816,0.0000018966782,0.97513527,0.00071426696,0.00073514105,0.0003018868,0.0000016602938,0.00047036758,0.0001586921],"genre_scores_gemma":[0.74832445,0.0000029185271,0.25071144,0.00084704644,0.00006665398,0.0000039062406,5.5438994e-7,0.000010993178,0.000032036747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981492,0.00002171727,0.00033735414,0.0004348001,0.00044823962,0.0006086738],"domain_scores_gemma":[0.99904275,0.00024366731,0.0000432942,0.00027966683,0.00012135537,0.00026929486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010678902,0.00018639679,0.00019557094,0.0008753686,0.00044297863,0.00031025845,0.00047081345,0.000050385403,0.000001569028],"category_scores_gemma":[0.000027576578,0.00018873767,0.000029427662,0.005820341,0.000060109578,0.00070682494,0.000033155804,0.00021184162,0.000043998512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013231527,0.0000056027015,0.0000015681873,0.000005973486,0.0000033103959,0.000010149002,0.0015979768,0.9357502,0.00018225584,0.00025205748,0.0002634533,0.061914224],"study_design_scores_gemma":[0.00019624781,0.00010167784,0.0006893117,0.00017622676,0.0000019067771,0.000023264924,0.000108004424,0.9974397,0.00053844,0.0000046955756,0.00048905326,0.00023146166],"about_ca_topic_score_codex":0.000011911973,"about_ca_topic_score_gemma":0.000015604644,"teacher_disagreement_score":0.72584367,"about_ca_system_score_codex":0.00015256043,"about_ca_system_score_gemma":0.00012873508,"threshold_uncertainty_score":0.7696499},"labels":[],"label_agreement":null},{"id":"W4386321977","doi":"10.1109/tnse.2023.3310811","title":"Block and Transaction Delivery in Ethereum Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Peer-to-Peer Network Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Block (permutation group theory); Node (physics); Database transaction; Computer network; Eclipse; Hash function; Computer security; Database; Engineering; Mathematics","score_opus":0.012077493174440347,"score_gpt":0.21203694930377123,"score_spread":0.1999594561293309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386321977","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3027054,0.00016457643,0.6935577,0.0011114492,0.0011441068,0.00021405154,0.0000011418792,0.0010252999,0.00007626922],"genre_scores_gemma":[0.98645437,0.00041660768,0.012762962,0.00018117258,0.00007508147,0.000048337803,1.1199706e-7,0.000014324969,0.000047010664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804294,0.000016073958,0.00021030166,0.00056709547,0.00037330875,0.0007902556],"domain_scores_gemma":[0.99925065,0.0001534103,0.000023425091,0.00036109803,0.000047711044,0.00016367844],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009590766,0.00019540793,0.00018665523,0.00052939396,0.00033900028,0.00019344993,0.0005456629,0.000102097,0.0000011654467],"category_scores_gemma":[0.000010055122,0.0002034083,0.000028849738,0.005347388,0.00011572827,0.0006189717,0.000015657157,0.0003519382,0.000015561029],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045445777,0.0000076675,0.000037177993,0.00000648774,0.000004890991,0.000012143663,0.0001748273,0.93538296,0.0008407554,0.00031964068,0.00026471808,0.06294421],"study_design_scores_gemma":[0.00020125159,0.000111121204,0.0035442656,0.0001297483,0.0000058182527,0.000034272813,0.000033416556,0.9925077,0.0009638592,0.00032484418,0.0018219199,0.00032178726],"about_ca_topic_score_codex":0.000024376961,"about_ca_topic_score_gemma":0.00007164214,"teacher_disagreement_score":0.68374896,"about_ca_system_score_codex":0.00008545185,"about_ca_system_score_gemma":0.000060191196,"threshold_uncertainty_score":0.829475},"labels":[],"label_agreement":null},{"id":"W4386473147","doi":"10.1109/tnse.2023.3312369","title":"Intelligent Content Caching and User Association in Mobile Edge Computing Networks for Smart Cities","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Western University","funders":"Chongqing Research Program of Basic Research and Frontier Technology","keywords":"Computer science; Latency (audio); Computer network; Association (psychology); Enhanced Data Rates for GSM Evolution; Handover; Frame (networking); Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.0219091136189821,"score_gpt":0.22182303068734469,"score_spread":0.1999139170683626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386473147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28105867,0.0001599014,0.7173869,0.00008294052,0.0009996118,0.00015689209,9.603862e-7,0.0001447256,0.000009355644],"genre_scores_gemma":[0.9984881,0.00024398424,0.00096073345,0.00009556922,0.00007488038,0.00004044834,4.771368e-7,0.000007865598,0.00008789903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883485,0.000015278385,0.00018607025,0.00031258355,0.00020916726,0.00044206585],"domain_scores_gemma":[0.9993425,0.00035027604,0.00003662284,0.00012688334,0.000063191255,0.00008053342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012860039,0.0001151264,0.00014055625,0.00024194615,0.00037594425,0.00024779685,0.00019641187,0.000047969315,2.7588334e-7],"category_scores_gemma":[0.000018030334,0.00011800882,0.00003586137,0.00086539896,0.00003296482,0.00039470627,0.000011016015,0.00019831806,0.0000011480038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000317091,0.0000074281343,0.000419842,0.00001007412,0.0000068764657,0.0000013124425,0.0003328383,0.9754905,0.00030938615,0.0003081477,0.00006409324,0.02304632],"study_design_scores_gemma":[0.00019128971,0.000052205767,0.0018093882,0.00009349024,0.000004722425,0.0000033904557,0.00011569174,0.9970932,0.00015762898,0.000016967086,0.00032721183,0.00013483074],"about_ca_topic_score_codex":0.00005161445,"about_ca_topic_score_gemma":0.000035532772,"teacher_disagreement_score":0.71742946,"about_ca_system_score_codex":0.00013800549,"about_ca_system_score_gemma":0.00003495862,"threshold_uncertainty_score":0.48122603},"labels":[],"label_agreement":null},{"id":"W4386885153","doi":"10.1109/tnse.2023.3293694","title":"Guest Editorial Introduction to the Special Section on AI-Driven Cybersecurity for Healthcare Cyber Physical Systems","year":2023,"lang":"en","type":"editorial","venue":"IEEE Transactions on Network Science and Engineering","topic":"Artificial Intelligence in Healthcare and Education","field":"Medicine","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Health care; Cyber-physical system; Wearable computer; Internet of Things; Computer science; Special section; Healthcare service; Healthcare industry; Computer security; Wearable technology; Healthcare system; System integration; Embedded system; Engineering","score_opus":0.033010978026091674,"score_gpt":0.3422426832102449,"score_spread":0.30923170518415327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386885153","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011540813,0.000019578678,0.009641019,0.004457417,0.9833038,0.0011911351,0.00006543234,0.00015815118,0.000009394877],"genre_scores_gemma":[0.018282147,0.00014073428,0.000036329595,0.0000738914,0.98081845,0.00042439223,0.000036934107,0.000052268886,0.00013486597],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99714035,0.000033444772,0.00037333,0.0007004485,0.0011336154,0.0006188241],"domain_scores_gemma":[0.9976232,0.0007668925,0.00008105214,0.00038219953,0.00084604346,0.00030059568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010913785,0.00028460872,0.0003690731,0.0003066373,0.0008913736,0.000173426,0.00017498202,0.00042226168,0.0000019641204],"category_scores_gemma":[0.0003936357,0.00023536934,0.000109219225,0.0012042472,0.00010582091,0.00017498445,0.0000033807082,0.0013310296,0.00004456668],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001840433,0.00004396778,4.675953e-7,0.00014129149,0.000017809049,6.0252495e-7,0.000629809,0.1597942,0.000052415693,0.000032453092,0.8370693,0.002033651],"study_design_scores_gemma":[0.0000748398,0.0008991728,0.0000058740998,0.00037428536,0.00008013104,0.000002858583,0.00023820021,0.017094487,0.0002549513,0.0000112093585,0.9807364,0.0002276278],"about_ca_topic_score_codex":0.0006405214,"about_ca_topic_score_gemma":0.00031580796,"teacher_disagreement_score":0.14366707,"about_ca_system_score_codex":0.00075653807,"about_ca_system_score_gemma":0.00073688437,"threshold_uncertainty_score":0.95980835},"labels":[],"label_agreement":null},{"id":"W4387319234","doi":"10.1109/tnse.2023.3321764","title":"Age of Information Minimization for UAV-Assisted Internet of Things Networks: A Safe Actor-Critic With Policy Distillation Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leverage (statistics); Computer science; Markov decision process; Lyapunov optimization; Network packet; Real-time computing; Mathematical optimization; Markov process; Computer network; Artificial intelligence","score_opus":0.009114273383029723,"score_gpt":0.20600705112653353,"score_spread":0.1968927777435038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029638903,0.000005172523,0.9961703,0.000056944245,0.00017763888,0.00027931642,0.0000022653805,0.00013048704,0.0002139904],"genre_scores_gemma":[0.8677169,0.000024329753,0.13212901,0.000038324484,0.000021012414,0.00003138887,0.000017032226,0.0000061048963,0.000015909913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989427,0.000008750398,0.00034054014,0.00014462789,0.00032972323,0.00023365978],"domain_scores_gemma":[0.9992432,0.00010098851,0.00014655101,0.00018195085,0.0002645687,0.000062758096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043534316,0.000112939604,0.00014310668,0.0005598251,0.00013191505,0.00011500543,0.00026258687,0.000051930358,7.277768e-7],"category_scores_gemma":[0.00003790271,0.000103808954,0.000030270381,0.002760011,0.00009482003,0.0028751574,0.0000061388987,0.00007222326,6.532276e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014075494,0.000009009089,0.000005536508,0.000072488605,0.0000075315206,8.313107e-8,0.0013636047,0.97848445,0.00008915138,0.0027858797,0.000026512793,0.017141704],"study_design_scores_gemma":[0.00024809875,0.000095800126,0.0007983383,0.000092642724,0.000007962727,0.000004435638,0.00006154839,0.99804926,0.00044194187,0.00002523184,0.00007016617,0.00010459466],"about_ca_topic_score_codex":0.000014365624,"about_ca_topic_score_gemma":7.8322614e-7,"teacher_disagreement_score":0.864753,"about_ca_system_score_codex":0.00006768517,"about_ca_system_score_gemma":0.00010481232,"threshold_uncertainty_score":0.42332062},"labels":[],"label_agreement":null},{"id":"W4387448582","doi":"10.1109/tnse.2023.3322495","title":"Locational Marginal Carbon Emission of Power Grids Approach: Optimal Scheduling of Recycling Electricity/Heat Rural Supply System Based on Waste Feedstock","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Integrated Energy Systems Optimization","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Renewable energy; Waste heat; Electricity generation; Energy supply; Environmental science; Waste management; Electricity; Process engineering; Environmental engineering; Heat exchanger; Engineering; Power (physics); Energy (signal processing); Electrical engineering","score_opus":0.005863149553416595,"score_gpt":0.18328133068721333,"score_spread":0.17741818113379673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387448582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4476672,0.00004405951,0.55078775,0.000008034506,0.00065445725,0.00014353552,0.0000050477233,0.00026364118,0.00042629451],"genre_scores_gemma":[0.99448293,0.000024808292,0.0053236554,0.00000301952,0.00007343295,0.00003341529,0.000005884532,0.00003780624,0.000015063354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984416,0.000018068065,0.00038316494,0.0002356162,0.0005088323,0.0004127296],"domain_scores_gemma":[0.99940854,0.00008813316,0.000042864882,0.0002011405,0.00015555261,0.00010373921],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059531967,0.0002139201,0.00025612803,0.00066737586,0.00014482278,0.0000311311,0.00017149764,0.00011560253,0.0000018264859],"category_scores_gemma":[0.0000113161595,0.00021273157,0.000057907084,0.002472891,0.00006209704,0.00017250687,0.0000019276945,0.00026731292,8.415801e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026775559,0.000013589874,0.000027074117,0.0001634886,0.000015401174,8.2392825e-7,0.00007882985,0.9583305,0.04101779,0.000073575044,0.000008611458,0.00024352121],"study_design_scores_gemma":[0.00021464338,0.00008975984,0.00008589762,0.0006725046,0.000016515987,0.0000075803064,0.00021906753,0.94772935,0.050785214,4.3780798e-7,0.0000041318062,0.00017489097],"about_ca_topic_score_codex":0.000029021334,"about_ca_topic_score_gemma":8.356083e-7,"teacher_disagreement_score":0.5468157,"about_ca_system_score_codex":0.00021750272,"about_ca_system_score_gemma":0.00009114626,"threshold_uncertainty_score":0.86749417},"labels":[],"label_agreement":null},{"id":"W4387546305","doi":"10.1109/tnse.2023.3321833","title":"Controlling Networks of Imitative Agents","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Evolutionary Game Theory and Cooperation","field":"Social Sciences","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"European Research Council","keywords":"Stochastic game; Incentive; Computer science; Convergence (economics); Imitation; Mathematical optimization; Asynchronous communication; Range (aeronautics); Mathematical economics; Mathematics; Economics; Microeconomics; Engineering","score_opus":0.0193124270948694,"score_gpt":0.26670468567532846,"score_spread":0.24739225858045905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387546305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689472,0.00010924606,0.76894647,0.00024551593,0.0013275327,0.00022279909,0.000002996669,0.00021628039,0.0020344162],"genre_scores_gemma":[0.9990646,0.00034675162,0.00023543357,0.000035990397,0.000108190616,0.0000136783565,3.4759748e-7,0.000004641831,0.00019032866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991693,0.000032723798,0.00011377255,0.00013730199,0.00026546943,0.00028143023],"domain_scores_gemma":[0.99955046,0.00018488413,0.000023508914,0.000065707696,0.00009655253,0.00007887501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00127984,0.00006014283,0.0000850069,0.000121527184,0.00069515186,0.000032740318,0.000109417146,0.000037025922,0.000015704209],"category_scores_gemma":[0.0000273152,0.00006160808,0.000024529478,0.0015418519,0.00027546563,0.00029517943,0.0000010950683,0.000095344265,0.000006440926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009250427,0.0000064559126,0.000011777805,0.0000022837476,0.000005625226,5.891159e-7,0.001284812,0.9866728,0.0004860758,0.0073020738,0.00005255588,0.004165695],"study_design_scores_gemma":[0.00018881743,0.00005742223,0.001110802,0.00006194775,0.000013510832,6.382969e-7,0.0010356919,0.9956739,0.0002831413,0.0003755038,0.001067131,0.00013151635],"about_ca_topic_score_codex":0.000029831823,"about_ca_topic_score_gemma":0.000032845768,"teacher_disagreement_score":0.77216995,"about_ca_system_score_codex":0.000041988034,"about_ca_system_score_gemma":0.00008580205,"threshold_uncertainty_score":0.53466165},"labels":[],"label_agreement":null},{"id":"W4387623823","doi":"10.1109/tnse.2023.3321644","title":"Online Service Deployment on Mega-LEO Satellite Constellations for End-to-End Delay Optimization","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Key Research and Development Program of China","keywords":"End-to-end principle; Constellation; Software deployment; Satellite; Computer science; Computer network; Mega-; Satellite constellation; Service (business); Telecommunications; Engineering; Aerospace engineering; Business; Physics","score_opus":0.0312483785605829,"score_gpt":0.25290611280023406,"score_spread":0.22165773423965116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387623823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02628884,0.0003180323,0.9690301,0.00043244095,0.0015054726,0.0007398035,0.000056338075,0.00120425,0.00042475495],"genre_scores_gemma":[0.98311293,0.0013129278,0.0149145,0.00023995899,0.00012977379,0.00015309163,0.000020630005,0.000061666564,0.000054535874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861795,0.000013282747,0.0003047244,0.0002921344,0.00032149183,0.00045039234],"domain_scores_gemma":[0.9989041,0.00032651398,0.00002461601,0.00040633354,0.00014462741,0.00019378492],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050535944,0.00020139929,0.00017233372,0.0004543814,0.0003452967,0.000112782436,0.00026721208,0.00006893151,0.000013562469],"category_scores_gemma":[0.000011348277,0.00021905114,0.000041515905,0.0026428087,0.00004093422,0.00023107362,0.0000041948256,0.00016489488,0.000032873624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061459104,0.000014261533,0.000004251403,0.000035828714,0.000018542962,4.458951e-7,0.00024265649,0.9787891,0.0012874312,0.00008515096,0.000065926564,0.019450257],"study_design_scores_gemma":[0.00018819753,0.00004230892,0.00014192439,0.0001274329,0.00001590712,0.0000056857066,0.00008759539,0.97705656,0.0017713573,0.0000050692715,0.020325515,0.00023244903],"about_ca_topic_score_codex":0.000008688494,"about_ca_topic_score_gemma":0.000032678778,"teacher_disagreement_score":0.95682406,"about_ca_system_score_codex":0.00015001302,"about_ca_system_score_gemma":0.000042672338,"threshold_uncertainty_score":0.89326465},"labels":[],"label_agreement":null},{"id":"W4388430426","doi":"10.1109/tnse.2023.3330437","title":"Event-Triggered Stochastic Model Predictive Control for Constrained Queueing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Layered queueing network; Mathematical optimization; Model predictive control; Queue; Scheduling (production processes); Markov chain; Discrete event simulation; Network packet; Network topology; Mathematics; Computer network; Control (management); Simulation","score_opus":0.007123635811867821,"score_gpt":0.2074047608708064,"score_spread":0.20028112505893858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388430426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015751724,0.00010807098,0.99558634,0.000026029646,0.0010338954,0.00064589217,0.00002627171,0.0009595514,0.00003876237],"genre_scores_gemma":[0.9965268,0.000049945167,0.002827649,0.000026250074,0.0001567735,0.00033554406,0.0000022728054,0.00004729021,0.000027519933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859315,0.000006702631,0.0002612394,0.00029203424,0.00022710141,0.00061975344],"domain_scores_gemma":[0.9993228,0.0002264172,0.000029586157,0.00016060297,0.000105774125,0.0001548306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004549637,0.00021018561,0.00023239163,0.00024645374,0.0003217728,0.00007021559,0.00013644369,0.00008610723,0.0000011645228],"category_scores_gemma":[0.000021983718,0.00022773865,0.000055927183,0.0010495213,0.00008298616,0.00039057407,0.0000012438221,0.00018598614,0.0000022824368],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022207574,0.0000037771738,4.602271e-7,0.00002198978,0.000030825493,7.0399193e-7,0.000062356434,0.99544066,0.0016337059,0.00016355501,0.000048565056,0.0025711653],"study_design_scores_gemma":[0.0007503377,0.00004745186,0.00000995518,0.00009522511,0.000032898897,0.0000032616315,0.000028877343,0.99862844,0.00008709046,0.000087439745,0.000011643197,0.00021737895],"about_ca_topic_score_codex":0.0000013183802,"about_ca_topic_score_gemma":0.0000029063865,"teacher_disagreement_score":0.9949516,"about_ca_system_score_codex":0.00013484388,"about_ca_system_score_gemma":0.00005651672,"threshold_uncertainty_score":0.92869127},"labels":[],"label_agreement":null},{"id":"W4388692222","doi":"10.1109/tnse.2023.3332949","title":"Computation Offloading for Edge Intelligence in Two-Tier Heterogeneous Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Beijing Municipality; Natural Science Foundation of Jiangxi Province; National Natural Science Foundation of China","keywords":"Computer science; Computation offloading; Computation; Enhanced Data Rates for GSM Evolution; Heterogeneous network; Edge computing; Distributed computing; Computer network; Artificial intelligence; Wireless network; Wireless; Algorithm; Telecommunications","score_opus":0.018310496507113787,"score_gpt":0.26056536094053606,"score_spread":0.24225486443342228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388692222","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025162805,0.000071889575,0.9666913,0.00006886835,0.007471578,0.00019643354,1.7536475e-7,0.0003000144,0.000036936945],"genre_scores_gemma":[0.98230666,0.00004012457,0.017040158,0.0000748943,0.00047602653,0.00003337888,5.3464237e-7,0.000013439687,0.000014793646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984022,0.000012331896,0.00023991981,0.00044592214,0.00022889678,0.0006707466],"domain_scores_gemma":[0.9993457,0.00025211793,0.000033785913,0.00018114083,0.00007141864,0.00011581911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009384971,0.00015558314,0.00015183061,0.000422849,0.00041951073,0.00022838006,0.0004085411,0.00004049182,3.056461e-7],"category_scores_gemma":[0.00001125506,0.00016623986,0.000045491895,0.00282336,0.0000625417,0.0004688046,0.0000123430655,0.00018907,0.0000070758756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027217177,0.000007231948,0.000009347722,0.000009209436,0.0000031135605,0.0000037484808,0.00028667643,0.89440024,0.00017830938,0.000120665594,0.00008142285,0.1048973],"study_design_scores_gemma":[0.00011859596,0.00004572736,0.0001202509,0.000077847086,0.0000028733853,0.000011569663,0.000008419868,0.9982088,0.0007852781,0.00017582589,0.00025908652,0.00018572572],"about_ca_topic_score_codex":0.00000926849,"about_ca_topic_score_gemma":0.000004811933,"teacher_disagreement_score":0.95714384,"about_ca_system_score_codex":0.00008990659,"about_ca_system_score_gemma":0.00005696253,"threshold_uncertainty_score":0.67790645},"labels":[],"label_agreement":null},{"id":"W4390075422","doi":"10.1109/tnse.2023.3344158","title":"Delay Impact on Stubborn Mining Attack Severity in Imperfect Bitcoin Network","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Imperfect; Computer science; Computer security; Revenue; Throughput; Block (permutation group theory); Blockchain; Proof-of-work system; Business; Telecommunications; Mathematics","score_opus":0.01214556537060496,"score_gpt":0.24766181966256426,"score_spread":0.2355162542919593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390075422","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63724494,0.000059451573,0.36123386,0.00029915103,0.00042040905,0.00016197591,0.000002033746,0.0004902732,0.00008791179],"genre_scores_gemma":[0.994922,0.000118389435,0.0046927873,0.00011086697,0.00006602393,0.00006496102,3.3662116e-7,0.0000114388195,0.000013227107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981791,0.000020228958,0.00020994757,0.0005516626,0.0002895894,0.00074947893],"domain_scores_gemma":[0.99906385,0.00020552946,0.000033029355,0.0005099487,0.00005282008,0.00013484024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011974311,0.00019913902,0.00019528088,0.00041515613,0.00047301274,0.00011930827,0.0006264152,0.0001134593,0.000003920401],"category_scores_gemma":[0.000012393319,0.00018320503,0.00005511927,0.0054623913,0.00012240003,0.0003209781,0.000016199707,0.00041141233,0.000021437025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045761426,0.00002457365,0.00020326755,0.0000046731207,0.000007370304,0.00001050221,0.00017376497,0.9756438,0.00015162116,0.0007203565,0.00053805136,0.0225174],"study_design_scores_gemma":[0.00016031544,0.00011893572,0.008727128,0.00005859885,0.00000350751,0.000020570138,0.000020914142,0.98979825,0.00030871926,0.00017132696,0.00039219751,0.00021953038],"about_ca_topic_score_codex":0.000027708498,"about_ca_topic_score_gemma":0.00004385998,"teacher_disagreement_score":0.357677,"about_ca_system_score_codex":0.00011032019,"about_ca_system_score_gemma":0.000102608625,"threshold_uncertainty_score":0.74708843},"labels":[],"label_agreement":null},{"id":"W4390284921","doi":"10.1109/tnse.2023.3347512","title":"HCAAC: Hybrid Channel Access by Admission and Contention in Wi-Fi Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Jiangsu Provincial Key Research and Development Program; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Retransmission; Network packet; Computer science; Computer network; Latency (audio); Channel (broadcasting); Low latency (capital markets); Telecommunications","score_opus":0.017311819245880874,"score_gpt":0.24900422363901903,"score_spread":0.23169240439313815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390284921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032299742,0.00018516937,0.9653972,0.00031520615,0.0007585975,0.00076126313,0.0000019434895,0.00024473493,0.00003614572],"genre_scores_gemma":[0.9983817,0.0005556606,0.0004264438,0.0001262166,0.0000856217,0.0003564827,0.0000010514818,0.000011960337,0.000054876775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.000019932853,0.00020592824,0.0004769083,0.0002865981,0.00057005126],"domain_scores_gemma":[0.9993881,0.00009660829,0.00003736829,0.00022510292,0.000043232667,0.00020956175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081592315,0.00016656054,0.00016689053,0.00024849284,0.0003545469,0.00042499215,0.0004627712,0.00005956099,0.0000023324228],"category_scores_gemma":[0.000006079454,0.00015977692,0.00002716174,0.0020888099,0.00007751626,0.0011433946,0.000020636606,0.00026331353,0.000002518144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007979934,0.000014668351,0.000033167347,0.0000152021885,0.000003405697,0.000008211908,0.00006315636,0.9366615,0.00035436917,0.00013618093,0.000985614,0.061716534],"study_design_scores_gemma":[0.00026560368,0.000060878247,0.0010379194,0.00018367203,0.0000024601243,0.000011504447,0.000006980701,0.99639976,0.0005716789,0.00010189097,0.0011659625,0.00019170591],"about_ca_topic_score_codex":0.000027123466,"about_ca_topic_score_gemma":0.00001094431,"teacher_disagreement_score":0.9660819,"about_ca_system_score_codex":0.000041401236,"about_ca_system_score_gemma":0.00004297142,"threshold_uncertainty_score":0.65155137},"labels":[],"label_agreement":null},{"id":"W4391020482","doi":"10.1109/tnse.2024.3354792","title":"Distributed Learning of Unknown Games for HetNet Selection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Selection (genetic algorithm); Heterogeneous network; Computer science; A priori and a posteriori; Artificial intelligence; Wireless network; Wireless","score_opus":0.007659775598852182,"score_gpt":0.21711672986158737,"score_spread":0.2094569542627352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391020482","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014223258,0.0002921229,0.984208,0.00011554531,0.000783376,0.000104518236,0.0000020339564,0.00022086088,0.00005028907],"genre_scores_gemma":[0.9904814,0.000110225184,0.009230397,0.000013546308,0.00011231573,0.000010138608,5.136706e-7,0.000008542926,0.000032960557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902976,0.000008745627,0.00013974599,0.00031203177,0.000189709,0.0003200363],"domain_scores_gemma":[0.9995425,0.00019285035,0.000018829358,0.000085978776,0.000087977816,0.00007187933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004396642,0.000105968,0.00011827745,0.00017747712,0.00027342164,0.00020609947,0.00013746631,0.000034399483,0.0000014742842],"category_scores_gemma":[0.0000108929835,0.0001018658,0.000049623395,0.0015749971,0.000066638946,0.0004149242,0.0000025946679,0.00018000798,6.990456e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035751,0.000007345147,0.000004004809,0.000027880216,0.00001277714,0.0000012226384,0.00011471132,0.9033439,0.0036964994,0.0056711533,0.000059065525,0.087057844],"study_design_scores_gemma":[0.000071799645,0.00011498448,0.000076522425,0.00014106122,0.000010743562,0.00002223229,0.000006732828,0.99075586,0.0053244466,0.00015606027,0.0032051413,0.00011443365],"about_ca_topic_score_codex":0.0000046971754,"about_ca_topic_score_gemma":0.0000035318003,"teacher_disagreement_score":0.9762581,"about_ca_system_score_codex":0.00005838142,"about_ca_system_score_gemma":0.000079690566,"threshold_uncertainty_score":0.4153967},"labels":[],"label_agreement":null},{"id":"W4392979805","doi":"10.1109/tnse.2024.3379552","title":"Packet Routing and Energy Cooperation for RTU Satellite-Terrestrial Multi-Hop Network in Remote Cyber-Physical Power System","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Network packet; Relay; Routing protocol; Communications satellite; Throughput; Real-time computing; Wireless; Satellite; Telecommunications; Engineering; Power (physics)","score_opus":0.01859291573768701,"score_gpt":0.24176938848879168,"score_spread":0.22317647275110467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392979805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055065755,0.003852257,0.9369643,0.000033475164,0.0029979325,0.00027820285,0.00000661806,0.0006083085,0.00019320416],"genre_scores_gemma":[0.99577653,0.0007744244,0.0029739712,0.000010950641,0.00035038937,0.000044201846,0.000002245941,0.000042456162,0.000024847637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987175,0.000025635001,0.00030885826,0.00032395837,0.00018040695,0.00044362794],"domain_scores_gemma":[0.9992803,0.00030558198,0.00001733916,0.0002457887,0.000037424437,0.00011356719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067774666,0.00020525669,0.00022581317,0.00018582636,0.00020300197,0.0002812741,0.00015327272,0.000087393244,7.266187e-7],"category_scores_gemma":[0.000009562976,0.00020852983,0.00004391855,0.0010103459,0.00006216034,0.0003710871,0.0000040568343,0.00022311005,0.0000025958193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010047326,0.0000063303437,0.000005419284,0.00007920902,0.000017741248,0.000002873732,0.00049518124,0.95508486,0.0034302105,0.00084051286,0.00001860169,0.040009],"study_design_scores_gemma":[0.00023579341,0.00003074869,0.00006364044,0.00054679805,0.000012366609,0.00001731872,0.00007483694,0.9932012,0.00065204134,0.000006498137,0.004943506,0.00021527168],"about_ca_topic_score_codex":0.000028497338,"about_ca_topic_score_gemma":0.000042986165,"teacher_disagreement_score":0.9407108,"about_ca_system_score_codex":0.00017646671,"about_ca_system_score_gemma":0.00003850729,"threshold_uncertainty_score":0.85036},"labels":[],"label_agreement":null},{"id":"W4394804896","doi":"10.1109/tnse.2024.3386623","title":"Privacy-Preserving Heterogeneous Personalized Federated Learning With Knowledge","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Federated learning; Privacy protection; Internet privacy; Artificial intelligence","score_opus":0.01640289378817495,"score_gpt":0.24022134325714758,"score_spread":0.22381844946897264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394804896","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02339499,0.0010747203,0.9711837,0.0012069641,0.00074395176,0.00013467373,0.0000014890294,0.002023269,0.00023620525],"genre_scores_gemma":[0.9373433,0.00019806587,0.062225882,0.000030850722,0.00005373366,0.00003428597,4.4259022e-7,0.000023681721,0.00008976158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980425,0.00002337722,0.00016795936,0.0007308583,0.00040688005,0.00062839757],"domain_scores_gemma":[0.99813765,0.0001956232,0.000022252234,0.0014177157,0.00008797561,0.00013878012],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00065448036,0.0002276478,0.00016772248,0.00034118767,0.00068577466,0.0010377887,0.005359921,0.000077046425,0.000009726196],"category_scores_gemma":[0.0002861097,0.0001968629,0.00003764029,0.0025985856,0.00021076616,0.0012234107,0.0006587167,0.0005670756,0.0000170915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020774592,0.00005688482,0.000022399165,0.0001935238,0.00010882116,0.00015297692,0.00079225824,0.849525,0.009707211,0.0011073595,0.003676503,0.13463633],"study_design_scores_gemma":[0.00011746901,0.00010848828,0.000017137498,0.000298157,0.000009631177,0.00012606951,0.00001600016,0.98991454,0.0046055606,0.00033973274,0.004188913,0.0002583186],"about_ca_topic_score_codex":0.0000092526225,"about_ca_topic_score_gemma":0.0000065097543,"teacher_disagreement_score":0.9139483,"about_ca_system_score_codex":0.0001402594,"about_ca_system_score_gemma":0.00019017553,"threshold_uncertainty_score":0.9999992},"labels":[],"label_agreement":null},{"id":"W4399995120","doi":"10.1109/tnse.2024.3418781","title":"Towards Easy-to-Monitor Networks: Network Design and Measurement Path Construction","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Path (computing); Computer network; Real-time computing","score_opus":0.01769644000317526,"score_gpt":0.2107308984929977,"score_spread":0.19303445848982242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399995120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095795793,0.0022900722,0.9903648,0.000260455,0.0051321965,0.00031557854,9.161729e-7,0.00063393987,0.00004406704],"genre_scores_gemma":[0.8105017,0.0006653095,0.18781865,0.0002138888,0.00068320095,0.00007732056,1.6351466e-7,0.000026335381,0.000013464389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974558,0.000036848527,0.00026802564,0.00074886234,0.0006912553,0.000799206],"domain_scores_gemma":[0.9989382,0.00016643047,0.000027394062,0.00034468697,0.00013821201,0.00038508014],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017951541,0.00028506716,0.00022386225,0.00022903607,0.0006067403,0.0008377634,0.0004012812,0.000094842246,0.0000034321918],"category_scores_gemma":[0.000014505681,0.00026475984,0.000052872663,0.002579057,0.00013817665,0.0007228616,0.000016934147,0.0003482553,0.000007816513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068109307,0.0000072006765,0.0000049780765,0.000014179373,0.000017850693,0.000008158545,0.00007606154,0.8076293,0.00009020034,0.0015083847,0.00050211186,0.19013478],"study_design_scores_gemma":[0.00011679067,0.00016228235,0.00026599556,0.00038682323,0.00002300825,0.00007317646,0.000008013748,0.99585414,0.00017833116,0.0002979812,0.0023057056,0.00032773273],"about_ca_topic_score_codex":0.000011834643,"about_ca_topic_score_gemma":0.0000029590021,"teacher_disagreement_score":0.8095437,"about_ca_system_score_codex":0.00016318983,"about_ca_system_score_gemma":0.00016187713,"threshold_uncertainty_score":0.99998045},"labels":[],"label_agreement":null},{"id":"W4400646754","doi":"10.1109/tnse.2024.3427672","title":"Deep Reinforcement Learning-Assisted Federated Learning for Robust Short-Term Load Forecasting in Electricity Wholesale Markets","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Energy Load and Power Forecasting","field":"Engineering","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Term (time); Electricity; Computer science; Artificial intelligence; Q-learning; Machine learning; Engineering; Electrical engineering","score_opus":0.017290220078683437,"score_gpt":0.21258778726764177,"score_spread":0.19529756718895833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400646754","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14648822,0.0005592771,0.8506161,0.000009566194,0.000903351,0.00017702012,4.339233e-7,0.000571427,0.00067460013],"genre_scores_gemma":[0.99799156,0.0002115457,0.0013981833,0.000007562928,0.00013259338,0.00007578278,0.0000031977654,0.000052948893,0.00012664922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827975,0.000012554575,0.00031064547,0.00036379584,0.00029252007,0.0007407597],"domain_scores_gemma":[0.99949205,0.0002101954,0.000015635307,0.00008391569,0.00006589706,0.0001322855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00077998836,0.00025380697,0.00020495667,0.00033582904,0.00046082248,0.00031709851,0.00012081897,0.000097364056,0.00000806079],"category_scores_gemma":[0.000029863824,0.0002698222,0.00006292086,0.0014994633,0.000045244953,0.00041382565,0.0000032136097,0.0006342762,0.000001794358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013059919,0.00000582793,0.000051745603,0.00012893291,0.000018774384,0.000010860976,0.0001814994,0.93424636,0.0042056395,0.00001325342,0.000014365558,0.061109684],"study_design_scores_gemma":[0.00017018299,0.00008285732,0.0002331251,0.00049885735,0.00001796846,0.000032632808,0.000029414774,0.99574,0.0022473168,0.0000019902825,0.00064784253,0.00029781464],"about_ca_topic_score_codex":0.000008313143,"about_ca_topic_score_gemma":0.00005393421,"teacher_disagreement_score":0.8515033,"about_ca_system_score_codex":0.00034573968,"about_ca_system_score_gemma":0.00007881154,"threshold_uncertainty_score":0.9999754},"labels":[],"label_agreement":null},{"id":"W4400905299","doi":"10.1109/tnse.2024.3432746","title":"Enhanced Emergency Communication Services for Post–Disaster Rescue: Multi-IRS Assisted Air-Ground Integrated Data Collection","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Satellite Communication Systems","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Emergency rescue; Computer science; Data collection; Ground station; Emergency management; Telecommunications; Engineering; Aerospace engineering; Medical emergency; Medicine","score_opus":0.03920028446327126,"score_gpt":0.2803340776113997,"score_spread":0.24113379314812847,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400905299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0321028,0.00379527,0.9601007,0.00009213415,0.002385367,0.00047413725,0.000051145515,0.00084545877,0.00015300485],"genre_scores_gemma":[0.9883472,0.0022199447,0.008944805,0.000018472883,0.000060752198,0.00014499933,0.00005056971,0.000047706108,0.00016555088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987234,0.000026381798,0.00035188106,0.00035488064,0.0002180585,0.0003253939],"domain_scores_gemma":[0.9986253,0.00015326281,0.000022162641,0.0009216023,0.00018220964,0.00009548436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007200161,0.00020054624,0.0001632289,0.0002835491,0.000404724,0.00019529196,0.00068115495,0.00009052979,0.000015877047],"category_scores_gemma":[0.000010839953,0.00020228312,0.00004048636,0.0016962634,0.00006383115,0.0009842601,0.000010510262,0.00027289314,0.000013629296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027026732,0.000043302625,0.0000037713885,0.00059528,0.00012401058,5.4125627e-7,0.0022885248,0.8380594,0.10405901,0.00007706238,0.000394725,0.05432729],"study_design_scores_gemma":[0.00015963924,0.000028151386,0.00032627475,0.0003602518,0.00003063096,0.000008937918,0.0003553946,0.98660463,0.00271904,0.0000046338037,0.009174971,0.00022746809],"about_ca_topic_score_codex":0.000076024844,"about_ca_topic_score_gemma":0.00034338192,"teacher_disagreement_score":0.9562444,"about_ca_system_score_codex":0.00019266672,"about_ca_system_score_gemma":0.000060076687,"threshold_uncertainty_score":0.8248866},"labels":[],"label_agreement":null},{"id":"W4400905308","doi":"10.1109/tnse.2024.3432836","title":"LURK-T: Limited Use of Remote Keys With Added Trust in TLS 1.3","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Security and Verification in Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Concordia University","funders":"","keywords":"Computer science; Computer security","score_opus":0.02142975175309364,"score_gpt":0.2212832210649008,"score_spread":0.19985346931180717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400905308","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08045271,0.00009784849,0.91850305,0.00013180703,0.0005319753,0.00007901228,8.0474166e-7,0.00015352736,0.000049293347],"genre_scores_gemma":[0.9385703,0.00006927324,0.061259314,0.000042322557,0.000032278895,0.0000032443882,1.09498366e-7,0.0000064867927,0.000016623426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989663,0.000010500025,0.00017448385,0.00032782022,0.00026023292,0.00026070693],"domain_scores_gemma":[0.999439,0.0001633436,0.000020598667,0.0002519645,0.00005484335,0.00007025028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004160586,0.000100419646,0.0001070963,0.00032400084,0.00012066514,0.00023412041,0.00028031997,0.00003652361,0.0000027037865],"category_scores_gemma":[0.000009051467,0.000090645044,0.000022149896,0.0027205579,0.000087506174,0.0007734815,0.0000040557866,0.00020183595,0.0000018721918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000051514276,0.000014801819,0.000014231151,0.00003427951,0.0000068986,0.00000816465,0.0006627056,0.93551034,0.0011982721,0.0027983652,0.000025065483,0.059721705],"study_design_scores_gemma":[0.00007868083,0.0000515478,0.00045543213,0.00028609883,0.0000036999704,0.000017944809,0.000011975094,0.9950979,0.0027820892,0.00003704403,0.0010661838,0.00011144561],"about_ca_topic_score_codex":0.00003289281,"about_ca_topic_score_gemma":0.000010713527,"teacher_disagreement_score":0.85811764,"about_ca_system_score_codex":0.000044813387,"about_ca_system_score_gemma":0.00009886067,"threshold_uncertainty_score":0.36963978},"labels":[],"label_agreement":null},{"id":"W4401114094","doi":"10.1109/tnse.2024.3435839","title":"GAXG: A Global and Self-Adaptive Optimal Graph Topology Generation Framework for Explaining Graph Neural Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Topology (electrical circuits); Graph; Topological graph theory; Artificial neural network; Mathematics; Theoretical computer science; Voltage graph; Artificial intelligence; Line graph; Combinatorics","score_opus":0.014399628574331453,"score_gpt":0.2477316796725518,"score_spread":0.23333205109822036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401114094","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012324087,0.001595467,0.9817496,0.00024136298,0.003247706,0.00028374617,0.000003888689,0.0005438224,0.000010340623],"genre_scores_gemma":[0.76512176,0.00032979465,0.23395516,0.00017117972,0.00032432922,0.00008041126,5.1975815e-7,0.000014506789,0.0000023521566],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979381,0.000022333317,0.00023735699,0.00079845684,0.00025923026,0.0007445046],"domain_scores_gemma":[0.9990941,0.00030602713,0.000036054105,0.0002638429,0.000075969794,0.00022398225],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004223403,0.0002751615,0.00020982254,0.0002165858,0.00068280776,0.00044990832,0.000360419,0.00013924392,9.568107e-7],"category_scores_gemma":[0.000008983098,0.0002692334,0.00008184688,0.0022788872,0.00019734794,0.0011529753,0.000014217189,0.0004028546,4.7242162e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000091243965,0.000011088056,0.000004443103,0.000008851177,0.000021352584,0.0000092556575,0.00016296901,0.9135336,0.00007392685,0.039911233,0.00004428273,0.04620984],"study_design_scores_gemma":[0.00012475287,0.00025807676,0.00006134886,0.00006994312,0.000022346012,0.000096090276,0.00001901795,0.9962385,0.00013389072,0.002594272,0.000102711165,0.0002790253],"about_ca_topic_score_codex":0.0000037718312,"about_ca_topic_score_gemma":0.0000070922342,"teacher_disagreement_score":0.75279766,"about_ca_system_score_codex":0.00007367016,"about_ca_system_score_gemma":0.000051151197,"threshold_uncertainty_score":0.999976},"labels":[],"label_agreement":null},{"id":"W4402450494","doi":"10.1109/tnse.2024.3456103","title":"Hide and Recognize Your Privacy Image","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Digital and Cyber Forensics","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Information privacy; Computer vision; Image (mathematics); Artificial intelligence; Internet privacy","score_opus":0.010717953762778567,"score_gpt":0.21071068406132415,"score_spread":0.19999273029854558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402450494","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030529363,0.00033104228,0.9662166,0.00034456624,0.0012327613,0.000059474612,0.0000018048809,0.00031111395,0.0009732267],"genre_scores_gemma":[0.98066384,0.00015993735,0.018815817,0.00008973529,0.00007381449,0.0000075990315,1.013714e-7,0.000008254195,0.00018091351],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999062,0.0000028523357,0.00009853421,0.0003346485,0.00020682056,0.00029516718],"domain_scores_gemma":[0.99961156,0.00004822767,0.0000073041397,0.0001685855,0.00003230729,0.00013204548],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024188013,0.00010731572,0.000078860605,0.00011894281,0.00017278774,0.00074730214,0.00024073057,0.000024464181,0.000002026683],"category_scores_gemma":[0.0000046638793,0.00009427061,0.000024028599,0.0009580485,0.000113756774,0.0013605476,0.000008629534,0.00014157743,0.000014074025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031377083,0.000023320958,0.0000062144873,0.000064729255,0.00002099318,0.000046688907,0.000831411,0.033931397,0.0041977176,0.0122248735,0.0007459734,0.9479035],"study_design_scores_gemma":[0.0000998441,0.0000819993,0.00025721695,0.0001814759,0.000011078761,0.00012931383,0.000015803353,0.9832297,0.0033665246,0.001995363,0.010329678,0.00030197966],"about_ca_topic_score_codex":0.0000039465754,"about_ca_topic_score_gemma":9.900252e-7,"teacher_disagreement_score":0.95013446,"about_ca_system_score_codex":0.000024387537,"about_ca_system_score_gemma":0.000058328602,"threshold_uncertainty_score":0.72062516},"labels":[],"label_agreement":null},{"id":"W4402508517","doi":"10.1109/tnse.2024.3460479","title":"Augmenting Backpressure Scheduling and Routing for Wireless Computing Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo; Queen's University","funders":"","keywords":"Computer science; Computer network; Scheduling (production processes); Wireless; Distributed computing; Wireless network; Dynamic Source Routing; Routing (electronic design automation); Wireless Routing Protocol; Routing protocol; Telecommunications; Mathematical optimization; Mathematics","score_opus":0.006654377918144828,"score_gpt":0.2111918904406165,"score_spread":0.20453751252247168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402508517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0419091,0.0016781796,0.9536287,0.000018336254,0.0017131069,0.00023298549,0.000002556284,0.00076906953,0.00004796469],"genre_scores_gemma":[0.9639754,0.00039751094,0.035104968,0.000018760466,0.00040132873,0.000026579177,0.0000013258135,0.00006317572,0.000010929026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851257,0.000005823304,0.00028031145,0.0003950133,0.00018821348,0.00061805797],"domain_scores_gemma":[0.99942005,0.00025043348,0.000020409752,0.00012460815,0.000053549305,0.00013097907],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006065841,0.00023261858,0.00019435315,0.0001723788,0.00050552894,0.0003268819,0.00011433032,0.00008925822,0.0000017760723],"category_scores_gemma":[0.0000071137815,0.00025467592,0.00003914395,0.00092682085,0.00008420369,0.00052212656,0.0000048621073,0.00034327168,7.1420703e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026994967,0.0000024442138,0.000010989443,0.00013120285,0.000020544978,0.0000015781953,0.00010494726,0.9263025,0.0010274508,0.0003373132,0.0000140928205,0.07204422],"study_design_scores_gemma":[0.00012599416,0.000019070649,0.000025516725,0.0004990593,0.000031110936,0.000013875066,0.00003971036,0.99812895,0.0006226093,0.000013724507,0.00021099043,0.00026935936],"about_ca_topic_score_codex":0.0000013482494,"about_ca_topic_score_gemma":0.0000020052196,"teacher_disagreement_score":0.92206633,"about_ca_system_score_codex":0.00008466821,"about_ca_system_score_gemma":0.000021827507,"threshold_uncertainty_score":0.9999905},"labels":[],"label_agreement":null},{"id":"W4404469503","doi":"10.1109/tnse.2024.3498864","title":"An Enhanced Multi-Factor Device Authentication Protocol in IoLT Healthcare Environment","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University Canada West","funders":"","keywords":"Authentication protocol; Protocol (science); Computer science; Health care; Authentication (law); Computer network; Computer security; Medicine","score_opus":0.02039185876002711,"score_gpt":0.30136591102540045,"score_spread":0.2809740522653733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404469503","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002698346,0.000018082195,0.97821856,0.00018336113,0.00025914225,0.018365407,0.0000020671343,0.0002493387,0.0000056820963],"genre_scores_gemma":[0.9103948,0.000008347187,0.041435093,0.00005018101,0.00003095783,0.048057746,2.2133477e-7,0.000011403702,0.000011247341],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841636,0.000026249321,0.0002410637,0.00059131155,0.00033745918,0.0003875507],"domain_scores_gemma":[0.9993042,0.000049864255,0.000028786038,0.00041443977,0.0000374532,0.00016527303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043315138,0.00015096909,0.000106792526,0.0002267861,0.00019754555,0.00023778754,0.00044199868,0.000049978236,0.000008190786],"category_scores_gemma":[0.0000050609297,0.00014813448,0.000023154114,0.0010490177,0.00007573273,0.0013171969,0.0000059157696,0.00025103855,0.000019664843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011266974,0.00020577769,0.000021371052,0.00024913484,0.000007554893,0.0000061731494,0.003179132,0.7124589,0.067435645,0.013169579,0.0000015792557,0.20325387],"study_design_scores_gemma":[0.00017078413,0.00008391468,0.0009281928,0.00016224585,0.0000016775897,0.0000036532435,0.00001226016,0.9795632,0.01799505,0.00044677604,0.00045129034,0.00018100043],"about_ca_topic_score_codex":0.000007429076,"about_ca_topic_score_gemma":0.000011017257,"teacher_disagreement_score":0.9367835,"about_ca_system_score_codex":0.00020927652,"about_ca_system_score_gemma":0.00012199475,"threshold_uncertainty_score":0.6040749},"labels":[],"label_agreement":null},{"id":"W4404787921","doi":"10.1109/tnse.2024.3507545","title":"QPoS: Decentralized Stake-Based Leader and Voter Selection in a PBFT System With Mobile Voters","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Selection (genetic algorithm); Voter model; Computer science; Artificial intelligence; Mathematics; Statistics","score_opus":0.006583386807191674,"score_gpt":0.1948719971657569,"score_spread":0.18828861035856523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404787921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.352013,0.00013816833,0.64680976,0.00003980957,0.00031747724,0.00020351353,0.0000052203354,0.00044158282,0.000031473694],"genre_scores_gemma":[0.9979809,0.000042218446,0.0018042714,0.000022354663,0.000017125278,0.00010240646,0.0000010766389,0.000020267624,0.00000938111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991492,0.0000045209854,0.00016546034,0.00022566157,0.00016930816,0.00028583594],"domain_scores_gemma":[0.9997768,0.00003666995,0.000006312356,0.000068339556,0.00003361881,0.000078278215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019689757,0.00013555503,0.000109086584,0.00031501008,0.00010104954,0.00011571838,0.000045855435,0.000046950514,0.000004795813],"category_scores_gemma":[7.3483426e-7,0.0001262813,0.000016428623,0.0014411728,0.00007108913,0.00029564355,2.259829e-7,0.00020184657,0.0000016354961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008310177,0.000007768096,0.00006920637,0.00015858132,0.000012039695,0.0000032357927,0.0002647035,0.9922471,0.0034159264,0.0001972208,0.000011107205,0.0036047706],"study_design_scores_gemma":[0.00027083023,0.000053856944,0.0014486047,0.00032338625,0.000018733193,0.000015930385,0.00014074534,0.9950769,0.0017339163,0.0000011565506,0.0007426628,0.00017326522],"about_ca_topic_score_codex":0.000022907641,"about_ca_topic_score_gemma":0.0001660123,"teacher_disagreement_score":0.6459679,"about_ca_system_score_codex":0.00013106738,"about_ca_system_score_gemma":0.00005879123,"threshold_uncertainty_score":0.5149602},"labels":[],"label_agreement":null},{"id":"W4405778888","doi":"10.1109/tnse.2024.3520967","title":"Self-Liking Group in Networks With Multi-Class Nodes","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Class (philosophy); Group (periodic table); Computer science; Mathematics; Theoretical computer science; Artificial intelligence; Physics","score_opus":0.0070051974199761375,"score_gpt":0.21998365669412767,"score_spread":0.21297845927415154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405778888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028478751,0.00022176649,0.97032684,0.000025845347,0.000228812,0.000121806785,0.0000011082103,0.00029855059,0.00029653785],"genre_scores_gemma":[0.9851002,0.0000451959,0.014565984,0.000016087999,0.00017982197,0.000049853264,7.834331e-7,0.000021691718,0.000020397873],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988304,0.000009977761,0.00016200634,0.00036749925,0.00019449698,0.00043564758],"domain_scores_gemma":[0.9996249,0.00007963223,0.000016526352,0.00016519777,0.000027250353,0.00008649951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038583533,0.00017340487,0.0001600572,0.00025314352,0.00019796926,0.00022451452,0.0001552538,0.000029610683,0.0000148397285],"category_scores_gemma":[3.571234e-7,0.00015248517,0.000045558754,0.001831698,0.000072853305,0.00033256097,0.0000034864777,0.00033908946,0.0000020770647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033002386,0.000033644894,0.0003261647,0.000012188444,0.000030928233,0.0000043543114,0.00010180626,0.9785548,0.00015446692,0.0012442741,0.000019631572,0.019514455],"study_design_scores_gemma":[0.000107910084,0.000028715183,0.0003323389,0.00021190048,0.00002762835,0.0000028079207,0.0000309887,0.9978425,0.00015649835,0.000032861313,0.001034815,0.00019107436],"about_ca_topic_score_codex":0.000050875722,"about_ca_topic_score_gemma":0.000043908207,"teacher_disagreement_score":0.9566214,"about_ca_system_score_codex":0.00007146301,"about_ca_system_score_gemma":0.00004297176,"threshold_uncertainty_score":0.62181646},"labels":[],"label_agreement":null},{"id":"W4406258621","doi":"10.1109/tnse.2025.3528190","title":"AI-Based E2E Resilient and Proactive Resource Management in Slice-Enabled 6G Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Bundesministerium für Bildung und Forschung","keywords":"Proactivity; Computer science; Provisioning; Flexibility (engineering); Quality of service; Distributed computing; Resilience (materials science); Robustness (evolution); Network packet; Slicing; Computer network","score_opus":0.005126238672153439,"score_gpt":0.2052570043845928,"score_spread":0.20013076571243935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406258621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056200027,0.00032682158,0.991567,0.0006545887,0.00052798,0.0003376468,4.5543882e-7,0.00018640043,0.00077906076],"genre_scores_gemma":[0.9862497,0.00015520446,0.012302985,0.0010160315,0.000042822176,0.000098882534,2.8737202e-7,0.000010805245,0.00012331866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982003,0.000026162661,0.00023045464,0.0006332629,0.00029967946,0.0006101234],"domain_scores_gemma":[0.99922335,0.00017014606,0.000029020377,0.0003956342,0.000048270107,0.00013356896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000736345,0.00020584285,0.00019011581,0.0004648446,0.00039541046,0.0002704743,0.0004352478,0.0000758576,0.0000014426807],"category_scores_gemma":[0.000005521068,0.00020128179,0.000033219432,0.0029638454,0.00011921824,0.00040772476,0.000019191744,0.00038696334,9.279136e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017940201,0.0000336874,0.00007380524,0.000019286765,0.0000139720405,0.00000898318,0.00006794598,0.9489387,0.000016122132,0.0034264356,0.00027582672,0.047107294],"study_design_scores_gemma":[0.00047827399,0.000057243276,0.0027477264,0.00020706803,0.000014352934,0.000003399429,0.000025191599,0.9931878,0.00019984768,0.00017227263,0.0026935465,0.00021332083],"about_ca_topic_score_codex":0.000016003767,"about_ca_topic_score_gemma":0.000017942126,"teacher_disagreement_score":0.9806297,"about_ca_system_score_codex":0.00012532918,"about_ca_system_score_gemma":0.000080250386,"threshold_uncertainty_score":0.8208033},"labels":[],"label_agreement":null},{"id":"W4408323756","doi":"10.1109/tnse.2025.3550290","title":"Self-Tallying E-Voting Using Homomorphic Time-Lock Puzzles and ZK-SNARKs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Internet Traffic Analysis and Secure E-voting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Homomorphic encryption; Lock (firearm); Scalability; Computer science; Voting; Mathematics; Discrete mathematics; Encryption; Computer security; Engineering; Operating system","score_opus":0.007183898816568459,"score_gpt":0.20625542438882014,"score_spread":0.1990715255722517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408323756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0991309,0.0002570577,0.89950836,0.00009706714,0.00049879466,0.00009235679,3.5041603e-7,0.0002948376,0.00012025927],"genre_scores_gemma":[0.96234524,0.00003917322,0.03737823,0.000103285194,0.00006112874,0.0000056306344,8.9265015e-8,0.000011269904,0.000055925146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839234,0.000019379835,0.0002620388,0.0005178486,0.0002954629,0.00051292765],"domain_scores_gemma":[0.9994411,0.00012692036,0.000049508642,0.00016727642,0.000095227275,0.000119991346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079690403,0.00020066414,0.00022055514,0.00035034408,0.00078272884,0.00057044614,0.0004253578,0.00006939782,0.0000027351057],"category_scores_gemma":[0.000011598572,0.00019784493,0.000058433063,0.0015485677,0.00009796866,0.00061354635,0.000019541227,0.00028958597,0.0000033815018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017413489,0.000018951157,0.000010904813,0.000031581643,0.00003593248,0.0000056674253,0.0003407519,0.9813387,0.0012448371,0.008389427,0.000022878065,0.008558625],"study_design_scores_gemma":[0.000117661766,0.00002226888,0.00003830137,0.00018839957,0.00003226235,0.000028506984,0.00003407729,0.9987442,0.00038174738,0.00000840507,0.00020824076,0.00019593892],"about_ca_topic_score_codex":0.000007548377,"about_ca_topic_score_gemma":0.0000057798843,"teacher_disagreement_score":0.8632144,"about_ca_system_score_codex":0.000080894235,"about_ca_system_score_gemma":0.00012235665,"threshold_uncertainty_score":0.8067882},"labels":[],"label_agreement":null},{"id":"W4409049973","doi":"10.1109/tnse.2025.3556390","title":"An Adaptive Service Function Chains Mapping With Multi-Task Deep Reinforcement Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Reinforcement learning; Computer science; Task (project management); Function (biology); Service (business); Reinforcement; Artificial intelligence; Engineering; Systems engineering","score_opus":0.007758406686522491,"score_gpt":0.19829007016169672,"score_spread":0.19053166347517422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409049973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015480477,0.00008254705,0.9830133,0.00017293023,0.0005550481,0.00017298586,1.9371024e-7,0.00030688843,0.00021563991],"genre_scores_gemma":[0.97751766,0.00003152823,0.021309769,0.001005218,0.000051899926,0.00003683485,6.817647e-7,0.000008994591,0.00003739631],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985093,0.000020181244,0.0001682463,0.0005064262,0.00033173338,0.00046414486],"domain_scores_gemma":[0.99924916,0.00005503385,0.00004363605,0.00033950398,0.00016948931,0.00014319223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030929144,0.00019811174,0.00013956726,0.00036616722,0.0007850611,0.00022357488,0.00050518883,0.00005185493,0.000002190873],"category_scores_gemma":[0.000001072892,0.00017454298,0.000023734257,0.0029628384,0.00004394755,0.0009239716,0.000010256454,0.00033359264,0.0000036417966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002050779,0.000020761001,0.000017583747,0.000024188912,0.000021812662,0.0000016859796,0.0013187625,0.9729988,0.002491471,0.0012598359,8.8061086e-7,0.021823687],"study_design_scores_gemma":[0.0003003495,0.00022942925,0.0009624665,0.00016003686,0.000015869551,0.0000060142543,0.00038500017,0.99618953,0.0009167705,0.00001565299,0.00061806844,0.0002008183],"about_ca_topic_score_codex":0.000091658076,"about_ca_topic_score_gemma":0.00023524839,"teacher_disagreement_score":0.9620372,"about_ca_system_score_codex":0.00006846349,"about_ca_system_score_gemma":0.00010633364,"threshold_uncertainty_score":0.7117656},"labels":[],"label_agreement":null},{"id":"W4409129190","doi":"10.1109/tnse.2025.3557385","title":"Priority-Aware Task Scheduling in Computing Power Network-Enabled Edge Computing Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Distributed computing; Scheduling (production processes); Edge device; Computer network; Processor scheduling; Embedded system; Internet of Things; Cloud computing; Operating system; Mathematical optimization","score_opus":0.007025028438510143,"score_gpt":0.21828794205450106,"score_spread":0.21126291361599092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409129190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08347972,0.00048204404,0.8973202,0.00012572532,0.017544124,0.0002610089,1.5064052e-7,0.00038303857,0.0004039883],"genre_scores_gemma":[0.9810645,0.000023620873,0.01795731,0.00017990368,0.0007191766,0.000005887575,2.6873016e-7,0.000016257196,0.00003310025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969087,0.00005431595,0.0005397184,0.00079911714,0.0004418375,0.0012562808],"domain_scores_gemma":[0.99874824,0.00036184795,0.00008921153,0.00045787348,0.00016407059,0.00017873386],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002276973,0.0003180962,0.00039197638,0.0005416358,0.0011347012,0.0007395731,0.0008954835,0.0001235551,3.9938197e-7],"category_scores_gemma":[0.000022482294,0.0003396346,0.000069292284,0.004438573,0.00010892875,0.0007040011,0.000055072625,0.0006993651,0.0000053739695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003337315,0.0000231939,0.0002294928,0.000052664487,0.000012563833,0.000013063278,0.00039292208,0.9857141,0.00020667507,0.0009723011,0.00016246113,0.012217232],"study_design_scores_gemma":[0.00032050413,0.000035328296,0.0010836573,0.000909977,0.000007786946,0.000020853087,0.000042829524,0.9961848,0.000108310305,0.000048729944,0.00090568233,0.0003314981],"about_ca_topic_score_codex":0.000046253794,"about_ca_topic_score_gemma":0.000003985088,"teacher_disagreement_score":0.89758474,"about_ca_system_score_codex":0.00027836175,"about_ca_system_score_gemma":0.00029392063,"threshold_uncertainty_score":0.9999056},"labels":[],"label_agreement":null},{"id":"W4409723334","doi":"10.1109/tnse.2025.3563901","title":"A Probabilistic Model for Information Diffusion in Social Networks: Insights From Twitter Data","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Probabilistic logic; Social media; Computer science; Diffusion; Microblogging; Data science; World Wide Web; Artificial intelligence","score_opus":0.018758181238722624,"score_gpt":0.2567785706425606,"score_spread":0.23802038940383796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409723334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042232636,0.000018909148,0.9571149,0.000050802515,0.00013682642,0.00023539193,0.00001163778,0.000049603223,0.00014929193],"genre_scores_gemma":[0.99580765,0.000006458181,0.0038566797,0.000072441864,0.00012694004,0.00008377558,0.000024852288,0.0000050612207,0.000016144657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991906,0.000006527896,0.0002123573,0.00023425394,0.00012445728,0.00023176226],"domain_scores_gemma":[0.9995698,0.00007886322,0.000032519365,0.0002334142,0.000051517334,0.00003393947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019522141,0.000113874834,0.00014405308,0.00019521148,0.0002998621,0.0001135836,0.00026893665,0.00003326754,0.0000030657873],"category_scores_gemma":[0.0000024349945,0.000111183836,0.000030653,0.00085778226,0.00005189917,0.00055425277,0.000011756322,0.0001451653,4.1243985e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010119859,0.000021925862,0.00004226156,0.0000056687395,0.000011188726,3.193463e-8,0.00019225372,0.98072743,0.00006929535,0.0016539712,0.00037655115,0.016889293],"study_design_scores_gemma":[0.00018900195,0.0000066340303,0.0003151208,0.000058266804,0.000025917061,2.7153934e-8,0.000030802752,0.99576086,0.000027564663,0.003024795,0.00045407092,0.000106945095],"about_ca_topic_score_codex":0.000054753826,"about_ca_topic_score_gemma":0.000028313812,"teacher_disagreement_score":0.953575,"about_ca_system_score_codex":0.000049747985,"about_ca_system_score_gemma":0.000064328466,"threshold_uncertainty_score":0.45339453},"labels":[],"label_agreement":null},{"id":"W4410118203","doi":"10.1109/tnse.2025.3567348","title":"On the Design of Resilient Distributed Single Time-Scale Estimators: A Graph-Theoretic Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Complex Network Analysis Techniques","field":"Physics and Astronomy","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Estimator; Graph; Distributed computing; Mathematics; Theoretical computer science; Statistics","score_opus":0.00786012365765941,"score_gpt":0.20845579276119727,"score_spread":0.20059566910353788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410118203","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018648397,0.000020534633,0.9802945,0.000046169676,0.00005939345,0.00018671124,0.0000054117036,0.00005841171,0.00068044703],"genre_scores_gemma":[0.9931431,0.000003455985,0.006734019,0.000016466078,0.000020660902,0.00004575147,0.0000012243091,0.000006641592,0.000028689832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991504,0.000025932031,0.00016569893,0.00022458652,0.00018854748,0.00024481988],"domain_scores_gemma":[0.9993538,0.0002447393,0.000035391393,0.00026773557,0.000053027536,0.00004529109],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048258566,0.00012543371,0.00015299872,0.00014458693,0.0002730914,0.00005448625,0.00022329325,0.000020836114,0.000021144448],"category_scores_gemma":[0.000003748009,0.000095208656,0.000062192186,0.001544385,0.00022029075,0.00006332373,0.000003843135,0.00014707941,0.0000012503606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010109013,0.000080100755,0.000014318231,0.000005485398,0.00002487022,6.872184e-8,0.000035826342,0.98518354,0.0019091729,0.010165414,0.00040219037,0.0021689339],"study_design_scores_gemma":[0.00008261497,0.00006187927,0.00005546035,0.00011695799,0.00005012611,3.2990343e-7,0.000031198968,0.98413044,0.011299716,0.0040003425,0.000056362293,0.00011459553],"about_ca_topic_score_codex":0.000008346604,"about_ca_topic_score_gemma":2.3161132e-7,"teacher_disagreement_score":0.9744947,"about_ca_system_score_codex":0.00003185619,"about_ca_system_score_gemma":0.00003958037,"threshold_uncertainty_score":0.38824964},"labels":[],"label_agreement":null},{"id":"W4410226734","doi":"10.1109/tnse.2025.3568824","title":"Concealing Radio Frequency Fingerprints via Active Adversarial Perturbation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Signal Modulation Classification","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Adversarial system; Radio frequency; Perturbation (astronomy); Computer science; Physics; Control theory (sociology); Telecommunications; Artificial intelligence","score_opus":0.008827533102215441,"score_gpt":0.21463368715724815,"score_spread":0.20580615405503272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410226734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010441333,0.00003151877,0.9866529,0.00047923857,0.0016997928,0.0001460293,8.0365163e-7,0.00017977682,0.00036862376],"genre_scores_gemma":[0.98375595,0.00001914871,0.01595751,0.00010630412,0.00007327129,0.000025838555,3.5603065e-7,0.000005119597,0.000056501598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880743,0.000021665075,0.00018343642,0.0004040352,0.0003038788,0.0002795822],"domain_scores_gemma":[0.99932414,0.00014598863,0.000044942182,0.00026664903,0.00013744115,0.0000808166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004418607,0.00012325481,0.000110497895,0.0002668995,0.0004480997,0.00015679291,0.00036860956,0.000059223017,0.0000039757556],"category_scores_gemma":[0.000020285786,0.00013075529,0.00003096403,0.001497077,0.00009145573,0.0009525124,0.0000047462618,0.00018616786,0.0000050309554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004901587,0.000016668764,0.000012015656,0.000009034425,0.000011829646,8.269709e-7,0.00027193842,0.8778368,0.023362715,0.014846606,0.000016482527,0.08361013],"study_design_scores_gemma":[0.0001771967,0.000022401902,0.002132633,0.000064238775,0.000007463971,0.0000029408934,0.00001046207,0.9854793,0.010927358,0.00092947984,0.00011095492,0.00013555851],"about_ca_topic_score_codex":0.000013023276,"about_ca_topic_score_gemma":0.0000026858402,"teacher_disagreement_score":0.97331464,"about_ca_system_score_codex":0.00022171451,"about_ca_system_score_gemma":0.00017703921,"threshold_uncertainty_score":0.53320456},"labels":[],"label_agreement":null},{"id":"W4410294627","doi":"10.1109/tnse.2025.3569515","title":"Multiplayer Pursuit-Evasion Games With Distributed Nash Equilibrium Solution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Guidance and Control Systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lakehead University","funders":"National Natural Science Foundation of China","keywords":"Nash equilibrium; Pursuit-evasion; Computer science; Epsilon-equilibrium; Mathematical economics; Best response; Game theory; Mathematical optimization; Equilibrium selection; Mathematics; Repeated game","score_opus":0.005739051510369887,"score_gpt":0.1890418780414379,"score_spread":0.18330282653106802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410294627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13685018,0.00035764987,0.86064255,0.00008362795,0.0011390591,0.00018920169,0.0000067332803,0.00040826557,0.00032275417],"genre_scores_gemma":[0.99918723,0.000059587554,0.00050807727,0.000029983572,0.000071296694,0.000057464786,0.0000011338193,0.000015031335,0.00007020433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887174,0.0000058164833,0.00016623744,0.00024118512,0.0002641121,0.00045089456],"domain_scores_gemma":[0.99959123,0.00004432415,0.000013646188,0.00019533047,0.0000628922,0.000092553055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000263327,0.0001733427,0.00016441471,0.00016357806,0.00019635103,0.00012079829,0.00016545932,0.00006291746,0.0000031198033],"category_scores_gemma":[0.0000042367615,0.00015455381,0.00003212027,0.0010315635,0.00007560661,0.00035449816,0.0000020935893,0.00018219056,0.0000051409256],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012475652,0.000008346653,0.000028140963,0.00003797311,0.000021310818,0.0000016260972,0.00003115459,0.9496474,0.043184932,0.000046130976,0.00027822095,0.006702234],"study_design_scores_gemma":[0.00042270005,0.000047963113,0.0014146338,0.00027286226,0.000026916272,0.000008641522,0.000030946157,0.98731583,0.0077983793,0.000007606677,0.0024378991,0.0002156035],"about_ca_topic_score_codex":0.0000119035,"about_ca_topic_score_gemma":0.000019001302,"teacher_disagreement_score":0.86233705,"about_ca_system_score_codex":0.00011339074,"about_ca_system_score_gemma":0.000047757458,"threshold_uncertainty_score":0.6302521},"labels":[],"label_agreement":null},{"id":"W4411086466","doi":"10.1109/tnse.2025.3577910","title":"Straggler-resilient Federated Learning: Tackling Computation Heterogeneity with Layer-wise Partial Model Training in Mobile Edge Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Layer (electronics); Enhanced Data Rates for GSM Evolution; Computation; Training (meteorology); Computer network; Distributed computing; Artificial intelligence; Edge device; Algorithm","score_opus":0.02328220899817998,"score_gpt":0.2607421179768852,"score_spread":0.2374599089787052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411086466","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20268762,0.00011220569,0.7958394,0.0002626543,0.0003963907,0.00020580391,0.0000011867895,0.0004414991,0.000053186355],"genre_scores_gemma":[0.9147552,0.00006215308,0.085018896,0.00004991958,0.000027681797,0.00006781719,9.90294e-7,0.000010348527,0.0000069472453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797714,0.00003161601,0.00027823262,0.00066340266,0.00034790966,0.0007017167],"domain_scores_gemma":[0.9988348,0.00013804533,0.000054280204,0.0007960359,0.000079987454,0.00009686007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082536537,0.0002168364,0.00021975179,0.0002897997,0.00061478687,0.00035107366,0.0022488025,0.00009463565,6.414974e-7],"category_scores_gemma":[0.00011558832,0.00021469154,0.000029141358,0.0025692254,0.00014853856,0.00077657,0.00025375595,0.0005418494,0.0000010729634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010991239,0.000022200053,0.00005536309,0.000012232967,0.000009646495,0.0000050974354,0.00011964559,0.9635918,0.0006160923,0.00011820335,0.00012997446,0.035308726],"study_design_scores_gemma":[0.00027086094,0.00009300859,0.00013266302,0.00019631434,0.000006696937,0.000006131802,0.000043388653,0.9957816,0.002581892,0.00060472585,0.00006984517,0.000212849],"about_ca_topic_score_codex":0.000011900749,"about_ca_topic_score_gemma":0.000051248764,"teacher_disagreement_score":0.7120676,"about_ca_system_score_codex":0.00015298382,"about_ca_system_score_gemma":0.00027966246,"threshold_uncertainty_score":0.8754867},"labels":[],"label_agreement":null},{"id":"W4411406701","doi":"10.1109/tnse.2025.3580705","title":"Quantum Deep Deterministic Policy Gradient for Digital Twin-Enabled Semantic IoV Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Research Foundation of Korea","keywords":"Computer science; Theoretical computer science; Algorithm","score_opus":0.008278547988853852,"score_gpt":0.22789446833811122,"score_spread":0.21961592034925737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411406701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06409104,0.0001928752,0.9335049,0.000029447221,0.0014965134,0.00021848863,0.0000026177818,0.0003282819,0.00013586621],"genre_scores_gemma":[0.9987813,0.000085467575,0.000758529,0.00006931448,0.00019237693,0.000039765357,6.6324975e-7,0.000023406938,0.00004913794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987386,0.000003442011,0.00021749387,0.00028526472,0.00012657871,0.00062864716],"domain_scores_gemma":[0.99942654,0.0002038302,0.000016748689,0.00017990395,0.000043493703,0.00012950283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017907246,0.00020679549,0.00019252606,0.00026356537,0.00043811888,0.00014944808,0.00017983375,0.000054440523,9.471146e-7],"category_scores_gemma":[0.000022021188,0.00021237721,0.00006174889,0.0011580788,0.000104766106,0.00032601526,0.0000036906024,0.00021688553,0.0000013977428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008821087,0.000007860344,0.0000027114818,0.00006556766,0.000012966601,0.0000024871476,0.00003534094,0.9747063,0.0011384869,0.0005761645,0.000019518126,0.023423776],"study_design_scores_gemma":[0.00021129851,0.000053326214,0.00005580571,0.00014941147,0.000019760677,0.000012593413,0.000017990302,0.99679863,0.001667432,0.00023762062,0.0005647347,0.00021137099],"about_ca_topic_score_codex":9.953847e-7,"about_ca_topic_score_gemma":0.0000021420474,"teacher_disagreement_score":0.9346903,"about_ca_system_score_codex":0.00010832149,"about_ca_system_score_gemma":0.000043542906,"threshold_uncertainty_score":0.8660491},"labels":[],"label_agreement":null},{"id":"W4411550952","doi":"10.1109/tnse.2025.3582063","title":"Retraction Notice: A DQN-Based Frame Aggregation and Task Offloading Approach for Edge-Enabled IoMT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; Notice; Task (project management); Enhanced Data Rates for GSM Evolution; Edge computing; Frame (networking); Distributed computing; Computer network; Theoretical computer science; Artificial intelligence; Engineering","score_opus":0.008431222463482737,"score_gpt":0.21757578811341205,"score_spread":0.2091445656499293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411550952","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013531026,0.00012300897,0.97983575,0.00018937947,0.0056598606,0.00025713976,2.7686835e-7,0.0001960648,0.0002074851],"genre_scores_gemma":[0.89873385,0.000018077413,0.10060389,0.00016327537,0.0003769495,0.00004101965,6.162379e-7,0.000008809254,0.000053486776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865574,0.000012865556,0.00019261337,0.00047537955,0.00023028463,0.00043309326],"domain_scores_gemma":[0.99929035,0.00021968594,0.000044489796,0.00022878149,0.000118706725,0.00009801805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088418275,0.00015675275,0.0001514404,0.0003625718,0.0008032699,0.00038061396,0.0002680777,0.00010828359,2.361332e-7],"category_scores_gemma":[0.00003097351,0.0001612259,0.00004021222,0.0016318203,0.000077247474,0.0006573347,0.0000060845127,0.00027838483,6.5450746e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000149334965,0.000035577457,0.000018063074,0.00011130681,0.00001390584,6.96839e-7,0.00026392666,0.9121638,0.004476959,0.00054768636,0.0004460057,0.08190712],"study_design_scores_gemma":[0.0002815854,0.000050395356,0.00017866318,0.00012954992,0.000016536485,0.0000044005947,0.000012263754,0.9936261,0.0041498365,0.00009172488,0.0012910274,0.0001678819],"about_ca_topic_score_codex":0.000009002434,"about_ca_topic_score_gemma":6.0780286e-7,"teacher_disagreement_score":0.8852028,"about_ca_system_score_codex":0.00010008707,"about_ca_system_score_gemma":0.00013481046,"threshold_uncertainty_score":0.6574601},"labels":[{"model":"gemma","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"medium"},{"model":"gpt","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4411725464","doi":"10.1109/tnse.2025.3583800","title":"Retraction Notice: Blockchain and Deep Learning for Secure Communication in Digital Twin Empowered Industrial IoT Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Communications Research Centre Canada","funders":"","keywords":"Blockchain; Notice; Internet of Things; Computer science; Computer security; Computer network; Law","score_opus":0.020133467447602638,"score_gpt":0.24597134204376261,"score_spread":0.22583787459615998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411725464","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6090561,0.00015177118,0.38657114,0.00075032335,0.0020890303,0.00068608805,0.000003519146,0.00023048227,0.00046154184],"genre_scores_gemma":[0.9991557,0.000086037515,0.00034164693,0.000109530985,0.000094881,0.000060068254,6.346039e-7,0.000010639129,0.00014083365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887973,0.0000321559,0.00022239595,0.00036205852,0.00018615722,0.0003174991],"domain_scores_gemma":[0.999205,0.0004590663,0.000055912227,0.00016273405,0.000046055495,0.00007125785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006869777,0.00012686163,0.00012479394,0.00023056926,0.00065293105,0.00022404538,0.00014167723,0.00013530327,0.0000029876865],"category_scores_gemma":[0.0002099634,0.00013913614,0.000026698819,0.0015686174,0.00014526003,0.00025550544,0.000004403175,0.0005944985,9.449027e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074362644,0.00003113821,0.000096762225,0.000015709087,0.0000033143122,5.5909896e-7,0.00020176878,0.92988765,0.010573342,0.0007399622,0.000051792496,0.058323607],"study_design_scores_gemma":[0.000695343,0.00009034325,0.0011853959,0.00015656425,0.000012417164,0.000010910413,0.00018363699,0.98836213,0.005346556,0.00022655542,0.0035341412,0.00019597706],"about_ca_topic_score_codex":0.0000058403516,"about_ca_topic_score_gemma":0.000022427237,"teacher_disagreement_score":0.3900996,"about_ca_system_score_codex":0.00010650793,"about_ca_system_score_gemma":0.00005362105,"threshold_uncertainty_score":0.5673807},"labels":[{"model":"gemma","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":["research_integrity"],"domain":null,"study_design":"not_applicable","genre":"editorial","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W4412081721","doi":"10.1109/tnse.2025.3586602","title":"Non-Cooperative Multi-Agent Reinforcement Learning Exploiting Population Dynamics","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mathematical and Theoretical Epidemiology and Ecology Models","field":"Medicine","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Reinforcement learning; Computer science; Population; Multi-agent system; Dynamics (music); Artificial intelligence; Physics","score_opus":0.016871480215006132,"score_gpt":0.27110635325018856,"score_spread":0.25423487303518244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412081721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10733624,0.000014285575,0.8911486,0.0002448711,0.00022554025,0.00013476126,1.5586667e-7,0.00004659756,0.00084892305],"genre_scores_gemma":[0.9967902,0.000044133547,0.0024396249,0.00026761205,0.000022262797,0.000027386752,0.0000011866705,0.0000042001493,0.0004034123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928,0.000009005368,0.00018444887,0.00018234143,0.00008662692,0.00025758703],"domain_scores_gemma":[0.999649,0.000123301,0.000017916529,0.000076766075,0.00004786209,0.000085164495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005634357,0.00009118827,0.00017573978,0.000094351126,0.00037059194,0.000013211445,0.00004008189,0.000064553045,0.00002161717],"category_scores_gemma":[0.000060687064,0.00007446679,0.000031143456,0.00032675863,0.00011681703,0.0000857384,0.0000025140225,0.0002661519,0.0000045359634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018278182,0.000024214487,0.00018600984,0.000039422463,0.000016647718,0.00000147835,0.000073929594,0.97299206,0.00020240643,0.023428146,0.000004398953,0.003012992],"study_design_scores_gemma":[0.00024445105,0.00008302446,0.0012661805,0.00019179439,0.00003004205,0.000004748462,0.000057261565,0.9975412,0.00031690844,0.0001844667,0.000013435676,0.00006649661],"about_ca_topic_score_codex":0.0000070366964,"about_ca_topic_score_gemma":0.0000032029598,"teacher_disagreement_score":0.88945395,"about_ca_system_score_codex":0.00008937266,"about_ca_system_score_gemma":0.00003069077,"threshold_uncertainty_score":0.30366677},"labels":[],"label_agreement":null},{"id":"W4412444461","doi":"10.1109/tnse.2025.3589296","title":"Controlled Quantum Semantic Communication for Industrial CPS Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea","keywords":"Computer science; Quantum; Computer network; Theoretical computer science; Physics; Quantum mechanics","score_opus":0.010727406985459894,"score_gpt":0.2244002337364654,"score_spread":0.2136728267510055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412444461","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010554334,0.00024439447,0.9861483,0.00076912815,0.0016827805,0.00036372957,7.694285e-7,0.00019150128,0.000045072473],"genre_scores_gemma":[0.9840477,0.00006227193,0.01546188,0.0002154496,0.00010845664,0.000058946065,3.125261e-7,0.0000066495722,0.000038319744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881256,0.000024531635,0.00022715346,0.00033409073,0.0001893992,0.00041227043],"domain_scores_gemma":[0.99898624,0.00042478731,0.000038146078,0.00037344647,0.00009397323,0.0000834221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001005248,0.00014785705,0.00022235895,0.0002211925,0.0007633284,0.00028430097,0.0006353268,0.00007385087,5.6205573e-7],"category_scores_gemma":[0.000026486716,0.00013278559,0.00006782657,0.0012771995,0.000098922195,0.00023391444,0.000011386752,0.000304026,5.6169455e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000185027,0.000016225027,0.0000019798115,0.0000062881613,0.00001464035,3.3444198e-7,0.00004524474,0.9517671,0.00010824318,0.0063015074,0.000131734,0.041588187],"study_design_scores_gemma":[0.0011232037,0.00006290792,0.000040176477,0.00013110654,0.000014767861,0.0000038598164,0.000006266075,0.99724007,0.00015264268,0.00038596283,0.000705339,0.00013371487],"about_ca_topic_score_codex":0.000010663328,"about_ca_topic_score_gemma":0.0000055179685,"teacher_disagreement_score":0.9734934,"about_ca_system_score_codex":0.00004207039,"about_ca_system_score_gemma":0.00012700417,"threshold_uncertainty_score":0.5870982},"labels":[],"label_agreement":null},{"id":"W4412623196","doi":"10.1109/tnse.2025.3592574","title":"EMForecaster: A Deep Learning Framework for Time Series Forecasting in Wireless Networks With Distribution-Free Uncertainty Quantification","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Anomaly Detection Techniques and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Series (stratigraphy); Time series; Wireless; Artificial intelligence; Wireless network; Distribution (mathematics); Deep learning; Machine learning; Telecommunications; Mathematics; Geology","score_opus":0.008104629607450278,"score_gpt":0.21361182121287559,"score_spread":0.2055071916054253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412623196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074582687,0.000032961394,0.99146056,0.00028676577,0.000150264,0.00032360412,0.000002746814,0.00024995572,0.00003484198],"genre_scores_gemma":[0.9178141,0.00003949184,0.08172393,0.000036131933,0.000032774078,0.00028665742,0.0000023730252,0.000008280413,0.000056305926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988336,0.000011863128,0.00021060824,0.00040984107,0.00015561543,0.00037847072],"domain_scores_gemma":[0.9992263,0.00020677887,0.00005707211,0.0003260914,0.00011999391,0.00006378255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050748856,0.0001446508,0.0001449862,0.00016364499,0.0006603766,0.00022381858,0.00042442378,0.000078596284,0.0000015094824],"category_scores_gemma":[0.000023189737,0.00013794046,0.00003258417,0.002212757,0.000109854656,0.00046644657,0.00000988487,0.0002816431,6.4406925e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016342023,0.000014747351,0.000034716337,0.000013468844,0.0000054677707,3.9686307e-7,0.000051413608,0.92816323,0.00012957332,0.025010787,0.00001383733,0.046546042],"study_design_scores_gemma":[0.00013248164,0.000093677016,0.00019230596,0.00017381065,0.000007094676,0.000007878454,0.00002314205,0.99693435,0.0008828245,0.0010622246,0.00033849225,0.00015174226],"about_ca_topic_score_codex":0.0000114342465,"about_ca_topic_score_gemma":0.000025948255,"teacher_disagreement_score":0.9103558,"about_ca_system_score_codex":0.00011385009,"about_ca_system_score_gemma":0.00006669098,"threshold_uncertainty_score":0.5625049},"labels":[],"label_agreement":null},{"id":"W4412719086","doi":"10.1109/tnse.2025.3592859","title":"Networked Physical Computing: A New Paradigm for Effective Task Completion via Hypergraph Aided Trusted Task-Resource Matching","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Task (project management); Computer science; Matching (statistics); Resource (disambiguation); Human–computer interaction; Distributed computing; Theoretical computer science; Computer network; Mathematics; Engineering","score_opus":0.005885943865195673,"score_gpt":0.21646663738476263,"score_spread":0.21058069351956696,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412719086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08401959,0.00008249141,0.9132327,0.0006386058,0.00093893096,0.0005414115,8.327705e-7,0.0004051367,0.00014030702],"genre_scores_gemma":[0.9902885,0.0000035608025,0.008959342,0.00034994254,0.000273336,0.00003465272,6.859112e-7,0.00001456685,0.00007539548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797803,0.000040353472,0.000250828,0.00069506076,0.0003615053,0.0006742422],"domain_scores_gemma":[0.9988094,0.0004858779,0.000065821754,0.00039997854,0.000053662887,0.00018526816],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00069487205,0.00027178647,0.00031087192,0.00033305972,0.0009548358,0.00031584007,0.00066420337,0.000058661164,3.4552315e-7],"category_scores_gemma":[0.000008880076,0.00026179163,0.00012928066,0.0022155351,0.0001112432,0.00009703431,0.000022856033,0.00029344938,0.0000021733747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015594902,0.000042925876,0.0000026774294,0.000028389473,0.000036646146,0.000001296038,0.00041513346,0.87018913,0.0008437905,0.002854048,0.00034100472,0.12522937],"study_design_scores_gemma":[0.00059269724,0.00012789122,0.00045560303,0.00021092227,0.00003619296,0.0000073451406,0.00002068647,0.9935019,0.00031799724,0.001091745,0.003372089,0.00026495347],"about_ca_topic_score_codex":0.000043974193,"about_ca_topic_score_gemma":0.000004483833,"teacher_disagreement_score":0.90626895,"about_ca_system_score_codex":0.000117391435,"about_ca_system_score_gemma":0.000067479865,"threshold_uncertainty_score":0.99998343},"labels":[],"label_agreement":null},{"id":"W4412722190","doi":"10.1109/tnse.2025.3593299","title":"Hierarchical Forwarding Resource Allocation With Proactive Frame Dropping for VR Video Streaming","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; University of British Columbia","funders":"","keywords":"Computer science; Computer network; Video streaming; Frame (networking); Resource allocation; Real-time computing","score_opus":0.010914537677143014,"score_gpt":0.252467645770228,"score_spread":0.241553108093085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412722190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052118944,0.000031737134,0.9929642,0.000766626,0.0002374774,0.00030320295,9.171292e-7,0.00013769245,0.00034622673],"genre_scores_gemma":[0.91269994,0.0000083661525,0.086763255,0.00028964184,0.000051050152,0.00010306333,3.6627608e-7,0.0000073085366,0.00007701453],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986737,0.000016442356,0.00016680307,0.00043821166,0.0002903516,0.000414529],"domain_scores_gemma":[0.99925905,0.00025588833,0.000032425807,0.00026262944,0.0001038187,0.000086164284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068450684,0.00013833217,0.00013947692,0.00024010257,0.00064104097,0.0003046023,0.00033289244,0.000043831387,3.515355e-7],"category_scores_gemma":[0.000016250295,0.00012563595,0.000035741392,0.0012107947,0.00009203309,0.00080790115,0.000007742417,0.00021711175,4.5507758e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029702804,0.00004731057,0.0000091230395,0.000068356065,0.000051892017,0.0000017934312,0.00086343096,0.7879,0.0037749913,0.016306633,0.000064059845,0.19088271],"study_design_scores_gemma":[0.00027650857,0.00013578233,0.0001959052,0.00025702745,0.000021544849,0.000005920986,0.00014195999,0.98619604,0.010044336,0.00029369988,0.0022353148,0.00019597956],"about_ca_topic_score_codex":0.000008660764,"about_ca_topic_score_gemma":0.000005460729,"teacher_disagreement_score":0.90748805,"about_ca_system_score_codex":0.00013154866,"about_ca_system_score_gemma":0.00019538587,"threshold_uncertainty_score":0.51232857},"labels":[],"label_agreement":null},{"id":"W4412984921","doi":"10.1109/tnse.2025.3596028","title":"Harnessing the Power of LLMs, Informers and Decision Transformers for Intent-Driven RAN Management in 6G","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ran; Transformer; Power (physics); Computer science; Electrical engineering; Telecommunications; Business; Engineering; Computer network; Physics","score_opus":0.008094078721917669,"score_gpt":0.22717910677845043,"score_spread":0.21908502805653277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412984921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035549507,0.0001851695,0.9630306,0.00019366921,0.00062193704,0.00025542598,7.3924014e-7,0.00003525725,0.00012770334],"genre_scores_gemma":[0.97514045,0.000348368,0.024318313,0.0001341681,0.0000074687987,0.000035420308,9.663955e-8,0.0000043037576,0.000011411038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990659,0.000004454892,0.00020662729,0.00023746213,0.00018514758,0.00030046038],"domain_scores_gemma":[0.9995048,0.00023165352,0.000024551331,0.0001478616,0.00004133394,0.00004978705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005325247,0.000108805325,0.00012845837,0.00027074234,0.00024941345,0.00010765617,0.00028859085,0.00003581387,7.295959e-7],"category_scores_gemma":[0.000006387986,0.00008349248,0.00003697184,0.0013339692,0.000120083314,0.00041910986,0.000007195941,0.00012062228,1.6173668e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023010682,0.000013153192,0.000039696086,0.000029516686,0.000014156497,6.1470223e-7,0.00039589315,0.4804231,0.00010581295,0.0020897167,0.00004922179,0.5168161],"study_design_scores_gemma":[0.0006552336,0.000069954134,0.0023741417,0.00037654676,0.000016629112,0.0000033723727,0.00023144887,0.9942688,0.00034547335,0.00044368173,0.0010697645,0.00014499764],"about_ca_topic_score_codex":0.0000072477496,"about_ca_topic_score_gemma":0.000012381912,"teacher_disagreement_score":0.93959093,"about_ca_system_score_codex":0.000038505717,"about_ca_system_score_gemma":0.0000404201,"threshold_uncertainty_score":0.34047243},"labels":[],"label_agreement":null},{"id":"W4412985034","doi":"10.1109/tnse.2025.3595949","title":"Multi-Authorized, Privacy-Protected, and Traceable Driverless Taxi Data Sharing in Internet of Vehicles","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"National Natural Science Foundation of China","keywords":"Information privacy; The Internet; Computer security; Computer science; Internet of Things; Internet privacy; Privacy software; Business; World Wide Web","score_opus":0.02178830265999545,"score_gpt":0.24950608956094747,"score_spread":0.227717786900952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412985034","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19407491,0.00019937065,0.80513483,0.00023507109,0.00012278653,0.00013575268,0.000001469291,0.00008110518,0.000014712788],"genre_scores_gemma":[0.9129948,0.00012470815,0.086811975,0.000016435524,0.000004524458,0.000024835392,2.0121328e-7,0.0000031604561,0.00001934478],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989444,0.000007078931,0.00018344513,0.00051150727,0.00011322401,0.0002403289],"domain_scores_gemma":[0.99913657,0.000054947424,0.000030170702,0.00069603,0.00003821928,0.000044063614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006389458,0.00009709695,0.00013812158,0.00030005164,0.00013668954,0.000074723124,0.0013012858,0.00007122107,6.522911e-7],"category_scores_gemma":[0.000015833968,0.00009948835,0.000010845767,0.0015336495,0.00016543278,0.00038493745,0.00008047417,0.00025634922,3.5497678e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003389407,0.00047338792,0.0024233565,0.0003226234,0.00007596163,0.000012651318,0.002210206,0.26031372,0.06314821,0.073364094,0.00012920158,0.5974927],"study_design_scores_gemma":[0.00023156544,0.000015762334,0.0021800662,0.000111619775,0.000004266746,0.000004183878,0.000017329368,0.99207234,0.004667785,0.00040700735,0.00019737401,0.00009071057],"about_ca_topic_score_codex":0.00008122977,"about_ca_topic_score_gemma":0.000038530714,"teacher_disagreement_score":0.7317586,"about_ca_system_score_codex":0.00003075217,"about_ca_system_score_gemma":0.00005312734,"threshold_uncertainty_score":0.40570173},"labels":[],"label_agreement":null},{"id":"W4413074920","doi":"10.1109/tnse.2025.3589594","title":"Intent-Driven Cognitive xDFC Bridge in Endogenous Intelligent IIoT: A Systematic Review and S$^{2}$Croft Architecture With Bayesian-CRO-Fuzzy Synergy","year":2025,"lang":"en","type":"review","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Memory and Neural Computing","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Bridge (graph theory); Bayesian probability; Fuzzy logic; Computer science; Cognitive architecture; Architecture; Fuzzy cognitive map; Fuzzy control system; Artificial intelligence; Cognition; Neuroscience; Neuro-fuzzy; Biology; Geography","score_opus":0.021383090031484427,"score_gpt":0.2507659565607459,"score_spread":0.2293828665292615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413074920","genre_codex":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012700212,0.6969289,0.30148417,0.000004398686,0.00024413307,0.0011099424,0.000011678761,0.00014487152,0.00005920458],"genre_scores_gemma":[0.011778536,0.9873528,0.0004184978,0.00005838063,0.000043387623,0.00026692473,0.0000022383201,0.000052095387,0.000027122964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"systematic_review","domain_scores_codex":[0.99795747,0.000050027887,0.00059093913,0.0005539337,0.0002386018,0.0006090503],"domain_scores_gemma":[0.99891573,0.00049746374,0.00008449827,0.00026253986,0.000063105974,0.00017663259],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036964315,0.0005685127,0.0015855471,0.0004830817,0.00020606414,0.000078964746,0.00027148702,0.0001234779,0.0000023013952],"category_scores_gemma":[0.000043149743,0.0004561783,0.00012018038,0.0018378019,0.00012506952,0.00016519241,0.000010140344,0.0009019994,0.0000016732034],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035924697,0.0000129205755,8.0592166e-8,0.42252284,0.00010993948,0.00005429063,0.00011161495,0.447856,0.000008574037,0.000012518939,0.000003300058,0.12930433],"study_design_scores_gemma":[0.0001869343,0.00012564124,7.0852775e-7,0.97802895,0.0017131697,0.0008294269,0.00003032944,0.016760815,0.00007821235,0.0000069423986,0.0013163507,0.00092249556],"about_ca_topic_score_codex":0.0000033613705,"about_ca_topic_score_gemma":0.000014137572,"teacher_disagreement_score":0.55550617,"about_ca_system_score_codex":0.00016855974,"about_ca_system_score_gemma":0.00010823046,"threshold_uncertainty_score":0.999789},"labels":[],"label_agreement":null},{"id":"W4413212194","doi":"10.1109/tnse.2025.3597541","title":"A Two-Level Dirichlet Framework for Heterogeneous Federated Network","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Graph theory and applications","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Distributed computing","score_opus":0.03232322381614552,"score_gpt":0.2968801529724322,"score_spread":0.2645569291562867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212194","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025845122,0.00008875825,0.9725154,0.00017708841,0.00061931653,0.00035861897,0.000010179718,0.00017352194,0.00021197386],"genre_scores_gemma":[0.89644116,0.000030530977,0.1028139,0.00022663503,0.00011543011,0.00022685828,5.5703083e-7,0.000016249733,0.00012867882],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988775,0.000011494833,0.00020247724,0.00030759277,0.00014326924,0.00045764784],"domain_scores_gemma":[0.9988933,0.00065554795,0.000033055137,0.00023351908,0.00009034228,0.00009422684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056081754,0.00016077037,0.00017416725,0.00011490659,0.0009467088,0.000122004334,0.00018714207,0.00007133529,0.0000073354204],"category_scores_gemma":[0.00003950209,0.00015707294,0.000065045184,0.0013806572,0.00011137689,0.00010300212,0.0000029098137,0.00020091335,0.0000021388485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022964816,0.000046807356,0.0000042257507,0.00003978805,0.000039538558,6.434605e-7,0.00005840732,0.61306536,0.0006316692,0.3803935,0.00037582047,0.00532125],"study_design_scores_gemma":[0.00061489246,0.00010295171,0.000064644926,0.000508778,0.00014027744,0.000016939026,0.000057448247,0.38139766,0.0066077965,0.60689944,0.0030543944,0.00053480023],"about_ca_topic_score_codex":0.0000021196868,"about_ca_topic_score_gemma":0.000009183385,"teacher_disagreement_score":0.87059605,"about_ca_system_score_codex":0.000040237155,"about_ca_system_score_gemma":0.000063484425,"threshold_uncertainty_score":0.7281414},"labels":[],"label_agreement":null},{"id":"W4413344225","doi":"10.1109/tnse.2025.3600480","title":"Cost Minimization Resource Allocation with Service Instance Caching and Task Migration for UAV Mobile Edge Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Resource allocation; Task (project management); Minification; Edge computing; Distributed computing; Enhanced Data Rates for GSM Evolution; Service (business); Resource management (computing); Mobile computing; Computer network; Resource (disambiguation); Mobile telephony; Server; Mobile radio; Telecommunications; Engineering; Business; World Wide Web","score_opus":0.008862454812937463,"score_gpt":0.2191240592672707,"score_spread":0.21026160445433323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413344225","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06709451,0.0001054504,0.93073475,0.00032780212,0.0011881213,0.000350255,3.098935e-7,0.00014008372,0.00005868858],"genre_scores_gemma":[0.957297,0.000022005517,0.042116553,0.00030557739,0.00018495863,0.000041470976,0.0000014117818,0.0000087198105,0.000022261767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99891853,0.000013025919,0.00017367202,0.00039785643,0.00017707345,0.00031985494],"domain_scores_gemma":[0.99937445,0.00016898106,0.00004851824,0.00018597544,0.000152666,0.00006943484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005026115,0.00013723955,0.00011925613,0.000199404,0.00082410796,0.0002970217,0.00023418608,0.000043657943,6.59264e-8],"category_scores_gemma":[0.0000085128495,0.00013476927,0.000014611994,0.0015396426,0.00004916683,0.00059805915,0.000008436056,0.00013329276,3.1770702e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008304387,0.000011280551,0.000029164707,0.00004753864,0.0000059347585,2.6329036e-7,0.00090725825,0.93563044,0.0008842994,0.0002499881,0.000106364045,0.06211915],"study_design_scores_gemma":[0.00024437794,0.000055020053,0.00032305825,0.00022799784,0.0000104263545,0.0000059957497,0.00005080659,0.9934574,0.0011476506,0.000017472452,0.0043111597,0.00014865462],"about_ca_topic_score_codex":0.000017958331,"about_ca_topic_score_gemma":0.000024131203,"teacher_disagreement_score":0.8902025,"about_ca_system_score_codex":0.00007666359,"about_ca_system_score_gemma":0.00010244167,"threshold_uncertainty_score":0.63384557},"labels":[],"label_agreement":null},{"id":"W4413887263","doi":"10.1109/tnse.2025.3604633","title":"TOAST: Task-Oriented Adaptive Semantic Transmission Over Dynamic Wireless Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IPv6, Mobility, Handover, Networks, Security","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Task (project management); Wireless transmission; Wireless; Transmission (telecommunications); Distributed computing; Computer network; Telecommunications; Engineering; Systems engineering","score_opus":0.003366876116025351,"score_gpt":0.19159172180419165,"score_spread":0.1882248456881663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413887263","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20302933,0.0005318574,0.7940425,0.000021115122,0.001660965,0.00027642664,0.0000073127576,0.0002602397,0.00017023759],"genre_scores_gemma":[0.99823344,0.0005273548,0.0009513305,0.000045727393,0.000049181333,0.000048789905,0.0000015487842,0.000032476157,0.00011013019],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981495,0.00001682088,0.00028671438,0.0004707859,0.0003998406,0.00067633874],"domain_scores_gemma":[0.99937737,0.00008039534,0.00002143575,0.00031777058,0.00002455682,0.00017847559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003660157,0.00031148482,0.00026329365,0.00025143672,0.00035041245,0.00006792735,0.00023556958,0.00013144911,0.000018605699],"category_scores_gemma":[0.0000022664765,0.00032970458,0.00007382268,0.0012545265,0.00018045782,0.00041021468,0.0000053250606,0.0004609189,0.0000063403745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025624237,0.000042646137,0.000014964902,0.000063338775,0.000043230375,0.0000034411823,0.00020161214,0.9584917,0.008920598,0.00009140315,0.000049203965,0.03205225],"study_design_scores_gemma":[0.00045005308,0.000052823805,0.0017704632,0.00025857612,0.00006214111,0.0000042644388,0.000034289096,0.9924081,0.0025032477,0.0000392787,0.0021063215,0.00031043522],"about_ca_topic_score_codex":0.0000126782725,"about_ca_topic_score_gemma":0.000018772429,"teacher_disagreement_score":0.7952041,"about_ca_system_score_codex":0.00032428457,"about_ca_system_score_gemma":0.0000459577,"threshold_uncertainty_score":0.9999155},"labels":[],"label_agreement":null},{"id":"W4413966964","doi":"10.1109/tnse.2025.3605822","title":"Joint Deterministic and Probabilistic Edge Caching Minimized Service Time for Cooperative Video Transmission in VANETs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"National Foundation for Science and Technology Development","keywords":"Computer science; Probabilistic logic; Computer network; Joint (building); Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Service (business); Real-time computing; Distributed computing; Telecommunications; Engineering; Artificial intelligence","score_opus":0.011236819168433821,"score_gpt":0.21549381182947838,"score_spread":0.20425699266104455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413966964","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079780646,0.00014532091,0.9189122,0.00037614148,0.00034358958,0.00030818558,0.0000018737015,0.00008144516,0.000050602208],"genre_scores_gemma":[0.99482584,0.000033721215,0.004747066,0.0002473482,0.000017299526,0.000057862257,2.9712533e-7,0.000005698773,0.000064839944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989381,0.000020559404,0.00019746266,0.00040215344,0.00013674387,0.00030497878],"domain_scores_gemma":[0.9993822,0.00026812084,0.000019808867,0.00016374254,0.000075639575,0.00009050524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005570865,0.00014077894,0.00018408483,0.00022129247,0.00034346088,0.00018115315,0.00021579716,0.000042788197,7.803742e-7],"category_scores_gemma":[0.000022330963,0.0001318257,0.000026612977,0.0008126997,0.00005243214,0.00035148155,0.000005856891,0.00016033303,8.87557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002476287,0.000025964026,0.0000013025232,0.00007321159,0.000006961105,0.0000029962791,0.00046064344,0.9540482,0.014014902,0.00034894975,0.000020486461,0.030971596],"study_design_scores_gemma":[0.00048623746,0.00006652192,0.00011753328,0.00033708982,0.000013714517,0.000008930261,0.00001431418,0.99811125,0.00049583835,0.00009414962,0.000112063666,0.00014233857],"about_ca_topic_score_codex":0.000022917124,"about_ca_topic_score_gemma":0.00001670418,"teacher_disagreement_score":0.9150452,"about_ca_system_score_codex":0.00006068037,"about_ca_system_score_gemma":0.00014102802,"threshold_uncertainty_score":0.5375696},"labels":[],"label_agreement":null},{"id":"W4414153664","doi":"10.1109/tnse.2025.3609198","title":"Quantum Deep Reinforcement Learning for Digital Twin-Enabled 6G Networks and Semantic Communications: Considerations for Adoption and Security","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Molecular Communication and Nanonetworks","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Engineering and Physical Sciences Research Council; National Research Foundation of Korea; Royal Academy of Engineering","keywords":"Reinforcement learning; Wireless network; Leverage (statistics); Wireless; Context (archaeology); Deep learning","score_opus":0.012453191073503794,"score_gpt":0.22750337126005823,"score_spread":0.21505018018655445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414153664","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047022607,0.0019295025,0.99209464,0.00016512796,0.000259927,0.0005394061,0.0000016244418,0.00016480248,0.00014271859],"genre_scores_gemma":[0.99307007,0.0025852784,0.003984284,0.00007496809,0.000027448452,0.0002113873,0.0000063101147,0.000016612368,0.000023656614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916214,0.000011535607,0.00023784368,0.00019995289,0.00008973422,0.00029879823],"domain_scores_gemma":[0.9990227,0.00046307157,0.00002657127,0.0003003465,0.00009908508,0.00008818546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040491778,0.00015249815,0.00016022402,0.0001634265,0.0008155272,0.00026892265,0.000126619,0.00007796612,0.0000013754933],"category_scores_gemma":[0.000037873473,0.00017022298,0.000034735112,0.00039874413,0.00017069033,0.00031016732,0.000010456441,0.00023535229,2.1305543e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008260254,0.0000083106015,0.000011274774,0.00006560355,0.000027693046,9.638682e-8,0.00011100035,0.99004215,0.00021306406,0.0043971045,0.000070786155,0.0050446526],"study_design_scores_gemma":[0.00038838814,0.000046897807,0.00005035073,0.00012930552,0.000039005758,0.0000051109455,0.00007123414,0.99671483,0.0001089737,0.00047076543,0.0018111708,0.00016397687],"about_ca_topic_score_codex":0.0000023533476,"about_ca_topic_score_gemma":0.000014068643,"teacher_disagreement_score":0.9883678,"about_ca_system_score_codex":0.000049639984,"about_ca_system_score_gemma":0.000030301657,"threshold_uncertainty_score":0.6941492},"labels":[],"label_agreement":null},{"id":"W4414270564","doi":"10.1109/tnse.2025.3611109","title":"Teleportation Links: Mitigating Catastrophic Forgetting in Decentralized Federated Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Memorial University of Newfoundland; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalability; Forgetting; Reliability (semiconductor); Resilience (materials science); Key (lock); Stability (learning theory); Convergence (economics); Dependency (UML); Focus (optics)","score_opus":0.009706725128198496,"score_gpt":0.23684827012355947,"score_spread":0.22714154499536096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414270564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14620331,0.00009975072,0.85145694,0.0011781007,0.00045873362,0.000112542235,5.59335e-7,0.0004383201,0.00005174008],"genre_scores_gemma":[0.8776013,0.000085249834,0.1222014,0.00006428034,0.000011072184,0.000023115144,7.802822e-7,0.000005753935,0.0000070074316],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985134,0.000020149726,0.00026700943,0.00044205537,0.0002480805,0.0005092811],"domain_scores_gemma":[0.9989353,0.00016162438,0.000051280902,0.0007302846,0.00006524963,0.000056250214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085828645,0.00013513565,0.00013718514,0.0003911625,0.00050330866,0.00031384878,0.0023712486,0.00010152391,0.000001001303],"category_scores_gemma":[0.0010861438,0.00014609455,0.000020532338,0.0026898587,0.000084338404,0.0008547199,0.00019699715,0.000690302,0.0000012344104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033557476,0.000016406468,0.0006258232,0.000028020864,0.0000087109875,0.000010247816,0.00007621711,0.90031743,0.0073853363,0.0003831211,0.00018688096,0.090958446],"study_design_scores_gemma":[0.00018468413,0.000018521214,0.0012068645,0.00024149864,0.000003320247,0.000005545147,0.0000354894,0.9898254,0.00740102,0.00083326007,0.000110801804,0.00013359539],"about_ca_topic_score_codex":0.000033646942,"about_ca_topic_score_gemma":0.000028699193,"teacher_disagreement_score":0.73139805,"about_ca_system_score_codex":0.00013417585,"about_ca_system_score_gemma":0.00013687593,"threshold_uncertainty_score":0.5957563},"labels":[],"label_agreement":null},{"id":"W4414270633","doi":"10.1109/tnse.2025.3611273","title":"Channel Estimation for Reconfigurable Intelligent Surface-Aided 6G NOMA Systems: A Quantum Machine Learning Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu; Canada Excellence Research Chairs, Government of Canada","keywords":"Mean squared error; Convolutional neural network; Channel (broadcasting); Artificial neural network; Quantum; Feature (linguistics); Recurrent neural network; Wireless; Deep learning","score_opus":0.017434516589577304,"score_gpt":0.2295099038537741,"score_spread":0.21207538726419678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414270633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008013288,0.0014412883,0.98830926,0.000044365657,0.0006483784,0.0003715339,0.0000045830325,0.00095415337,0.00021316335],"genre_scores_gemma":[0.9844656,0.0009266877,0.01431228,0.000007321262,0.000012164214,0.00017397749,0.0000029500973,0.00002251364,0.0000765162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990259,0.000008751658,0.00024398485,0.00023610497,0.0001292198,0.00035606543],"domain_scores_gemma":[0.99941164,0.00015313161,0.000029613102,0.0002792193,0.00007600534,0.00005040802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041664147,0.00017368105,0.00019353945,0.0002550897,0.00039787882,0.00009913707,0.00027616488,0.00008235315,0.0000010196148],"category_scores_gemma":[0.000028816481,0.00018375192,0.000034049717,0.001011132,0.00008290136,0.0003042487,0.0000031548643,0.000315569,0.0000018341063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050444723,0.000009970016,0.0000011457955,0.00013199916,0.000016805754,1.0430584e-7,0.00006260198,0.9860291,0.0017588624,0.0009457576,0.000025965048,0.011012665],"study_design_scores_gemma":[0.0001277083,0.00003021515,0.0000065654117,0.00016020103,0.0000098702485,0.0000033191889,0.00014388232,0.9889493,0.009594635,0.000104830695,0.000700617,0.00016888582],"about_ca_topic_score_codex":0.000011512393,"about_ca_topic_score_gemma":0.0000024129915,"teacher_disagreement_score":0.9764523,"about_ca_system_score_codex":0.0001594983,"about_ca_system_score_gemma":0.000030079167,"threshold_uncertainty_score":0.7493186},"labels":[],"label_agreement":null},{"id":"W4414322240","doi":"10.1109/tnse.2025.3611954","title":"Blockchain Meets Adaptive Honeypots: A Trust-Aware Approach to Next-Gen IoT Security","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Algoma University","funders":"","keywords":"Intrusion detection system; Anomaly detection; Provisioning; Authentication (law); Bandwidth (computing); Network security; Server; Quality of service; Denial-of-service attack","score_opus":0.00991212933407285,"score_gpt":0.2097880754535438,"score_spread":0.19987594611947096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414322240","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026167605,0.00017465914,0.9707551,0.0010897963,0.00039261137,0.00036019264,0.0000037087257,0.00044892795,0.00060741836],"genre_scores_gemma":[0.95946044,0.000027603019,0.03987281,0.00035794222,0.000033401804,0.00019119919,1.4984846e-7,0.0000077295845,0.000048735652],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982098,0.000016356447,0.00021117485,0.00072496454,0.0002880805,0.0005496621],"domain_scores_gemma":[0.99895763,0.00007302117,0.000029556968,0.0006387485,0.000117955635,0.00018311122],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006263086,0.00021106868,0.00020678202,0.00046640515,0.0006812501,0.00015189186,0.0009942066,0.00013434839,0.0000014937509],"category_scores_gemma":[0.0000101208225,0.00021413594,0.000049699265,0.00382687,0.00017486534,0.00016650648,0.000027924438,0.0003876277,0.0000057472935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012061888,0.00018723837,0.000010480658,0.00002813106,0.00004076153,0.0000029170017,0.001067992,0.8570091,0.001158203,0.08975364,0.0005490311,0.0501804],"study_design_scores_gemma":[0.00015487114,0.00005763914,0.0001401031,0.000046837507,0.000011160288,0.000010781364,0.00008632464,0.99381405,0.0023919933,0.0011167913,0.0019333678,0.00023608029],"about_ca_topic_score_codex":0.000033678407,"about_ca_topic_score_gemma":0.000012537975,"teacher_disagreement_score":0.9332928,"about_ca_system_score_codex":0.00011920604,"about_ca_system_score_gemma":0.00015029994,"threshold_uncertainty_score":0.87322104},"labels":[],"label_agreement":null},{"id":"W4414798846","doi":"10.1109/tnse.2025.3617381","title":"Energy-Efficient Multi-User Adaptive 360$^{\\circ }$ Video Streaming: A Two-Step Approach With Device Video Super-Resolution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Particle swarm optimization; Benchmark (surveying); Video quality; Bandwidth (computing); Scheme (mathematics); Energy (signal processing); Quality of experience; Video tracking","score_opus":0.01743302987910434,"score_gpt":0.24567343955417914,"score_spread":0.2282404096750748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414798846","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041218637,0.00020065875,0.9939999,0.00018971252,0.0004979324,0.00021814552,0.0000024756462,0.00019943631,0.000569892],"genre_scores_gemma":[0.86246955,0.0000254299,0.13680692,0.00030199354,0.000043820313,0.00009024113,6.1386845e-7,0.000011934047,0.00024950798],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976232,0.000049601455,0.00028209825,0.00078328076,0.0005687444,0.0006930994],"domain_scores_gemma":[0.998899,0.00013960853,0.000050611758,0.0005298755,0.00020094986,0.00017999204],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007378649,0.00028295966,0.00023900322,0.0003748619,0.00080180046,0.00036381563,0.00062107167,0.00006605061,0.0000022422648],"category_scores_gemma":[0.000006416254,0.00025254278,0.000059580336,0.0025673686,0.00018269241,0.00079393317,0.000020593352,0.0002861501,0.0000032489922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016566815,0.00015170267,0.000007997092,0.00002320573,0.000030299376,0.000004159653,0.00028893896,0.9708388,0.0010991427,0.009837031,0.00005741947,0.017644748],"study_design_scores_gemma":[0.0005802255,0.000110533605,0.0002063038,0.00015275039,0.000029552943,0.000015151723,0.00016422536,0.99374104,0.0033140793,0.000010142031,0.0013765468,0.00029945569],"about_ca_topic_score_codex":0.00020266979,"about_ca_topic_score_gemma":0.00008722731,"teacher_disagreement_score":0.85834765,"about_ca_system_score_codex":0.00023889253,"about_ca_system_score_gemma":0.0002778103,"threshold_uncertainty_score":0.99999267},"labels":[],"label_agreement":null},{"id":"W4414798884","doi":"10.1109/tnse.2025.3617881","title":"Semantic Edge–Cloud Communication for Real-Time Urban Traffic Surveillance With ViT and LLMs Over Mobile Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Inference; Enhanced Data Rates for GSM Evolution; Transmission (telecommunications); Process (computing); Intelligent transportation system; Wireless; Edge computing; Smart city; Software deployment; Mobile device","score_opus":0.004150613597961992,"score_gpt":0.20146961355246193,"score_spread":0.19731899995449995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414798884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1485278,0.00032584456,0.8487938,0.000085329906,0.0017056499,0.00026953782,2.9503585e-7,0.00019236612,0.00009935915],"genre_scores_gemma":[0.98996496,0.0002356641,0.009338349,0.000060552476,0.0002385183,0.000050473114,6.6773094e-7,0.0000111909185,0.000099617435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988018,0.000018547638,0.00017645648,0.00039678006,0.00016552788,0.00044084885],"domain_scores_gemma":[0.9990869,0.0002959216,0.00003963528,0.00039861957,0.00008598632,0.00009294483],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007017005,0.00016578626,0.00018493045,0.00015437948,0.0006673712,0.00027781146,0.00041898814,0.000056386896,4.369843e-7],"category_scores_gemma":[0.0000044863023,0.00015358953,0.000029904975,0.0012334866,0.00013961442,0.0003882923,0.000012498665,0.00017182447,7.513256e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010369386,0.000018319854,0.00005572533,0.00002632257,0.000013089988,5.745162e-7,0.00019725955,0.97554964,0.0002622077,0.00015988102,0.00076685165,0.02293975],"study_design_scores_gemma":[0.00025935017,0.00009080964,0.0008787306,0.00014860724,0.00000960229,0.000006787375,0.00000754782,0.9970723,0.000107044514,0.000016100892,0.0012201014,0.00018303047],"about_ca_topic_score_codex":0.000012874385,"about_ca_topic_score_gemma":0.000007768083,"teacher_disagreement_score":0.84143716,"about_ca_system_score_codex":0.000052919728,"about_ca_system_score_gemma":0.000077398,"threshold_uncertainty_score":0.62631994},"labels":[],"label_agreement":null},{"id":"W4414871454","doi":"10.1109/tnse.2025.3617102","title":"RadioMamba: Breaking the Accuracy-Efficiency Trade-Off in Radio Map Construction via a Hybrid Mamba-UNet","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"3D Modeling in Geospatial Applications","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Block (permutation group theory); Context (archaeology); Channel (broadcasting); Wireless; Architecture; Feature (linguistics); Global optimization","score_opus":0.004994350136934099,"score_gpt":0.2012223092473511,"score_spread":0.196227959110417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871454","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06666941,0.00055145624,0.9301488,0.00033774727,0.0014824036,0.0003259092,0.000005349263,0.00031094206,0.00016799905],"genre_scores_gemma":[0.9946514,0.0002468721,0.0048377537,0.000062015395,0.00008245772,0.00008919931,9.437976e-7,0.000020097163,0.000009294007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986129,0.000012348407,0.0003064901,0.0003251118,0.00024924532,0.00049391197],"domain_scores_gemma":[0.9993444,0.00019455953,0.000024535655,0.0003288828,0.000029286231,0.00007834529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004870673,0.00020663535,0.0001729145,0.00032212803,0.00042638765,0.00011393847,0.00032741902,0.000059015372,0.0000053465496],"category_scores_gemma":[0.000011199078,0.0001922488,0.000045998302,0.001687136,0.00020945541,0.00028048852,0.0000038116445,0.0004127852,0.0000043755467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028225472,0.000013195874,0.000010574993,0.000024170873,0.000010074811,0.0000015195315,0.00011565186,0.93209916,0.002255848,0.00029213823,0.00010294512,0.0650719],"study_design_scores_gemma":[0.00019577131,0.00001308743,0.00043740286,0.00011521899,0.000020356285,0.00004024289,0.000036714853,0.9946252,0.002555813,0.00012802535,0.0016398638,0.00019228268],"about_ca_topic_score_codex":0.000033614862,"about_ca_topic_score_gemma":0.00002956854,"teacher_disagreement_score":0.927982,"about_ca_system_score_codex":0.00020014524,"about_ca_system_score_gemma":0.00007655515,"threshold_uncertainty_score":0.78396785},"labels":[],"label_agreement":null},{"id":"W4414871532","doi":"10.1109/tnse.2025.3617848","title":"Location-Aware Anti-Jamming Game: An Intelligent Approach for Reliable Wireless Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Stochastic game; Wireless; Jamming; Residual; Transmitter; Key (lock); Interference (communication); Game theory","score_opus":0.01659383210616466,"score_gpt":0.24820799494981027,"score_spread":0.2316141628436456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871532","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001972593,0.0002451026,0.9961304,0.00017825424,0.00068602327,0.0004055114,0.0000011273561,0.00023548781,0.00014552005],"genre_scores_gemma":[0.89928806,0.00022988455,0.099972375,0.00014848652,0.000048484417,0.00022602544,0.000001656415,0.000010927426,0.000074111646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853176,0.000016682368,0.00025088261,0.00050320354,0.00023107286,0.000466401],"domain_scores_gemma":[0.99832386,0.00015938109,0.000041814154,0.0011015927,0.00023736194,0.0001359831],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000785029,0.00016487965,0.00017030774,0.00022901918,0.0007384097,0.00031556247,0.0013896583,0.00007030703,7.8983675e-7],"category_scores_gemma":[0.0000072151474,0.00017389536,0.000038711732,0.0024341857,0.00017013532,0.0008316711,0.000021231504,0.0002512099,0.0000013410689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002158971,0.000055559423,0.000008101806,0.000036797544,0.0000091423535,1.6292991e-7,0.00016823944,0.93666106,0.00023332094,0.010366979,0.00008133473,0.052377123],"study_design_scores_gemma":[0.000114247014,0.00005050922,0.000055527267,0.00011594637,0.00001188415,0.0000037647972,0.000059728354,0.9964474,0.0013137966,0.00011504993,0.0015385047,0.0001736842],"about_ca_topic_score_codex":0.000018072044,"about_ca_topic_score_gemma":0.000009515108,"teacher_disagreement_score":0.89731544,"about_ca_system_score_codex":0.000115310606,"about_ca_system_score_gemma":0.0002128971,"threshold_uncertainty_score":0.7091247},"labels":[],"label_agreement":null},{"id":"W4415003132","doi":"10.1109/tnse.2025.3620231","title":"A Generative Model-Guided Distributed DRL Framework for Scalable and Efficient SFC Orchestration in Future Network Architectures","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Embedded Systems Design Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ciena (Canada); Terry Fox Research Institute; University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Provisioning; Scalability; Orchestration; Generative grammar; Virtual network; Generative model; Workload; Reinforcement learning","score_opus":0.013380991079037188,"score_gpt":0.2548339935950841,"score_spread":0.2414530025160469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415003132","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01355442,0.000272983,0.98445475,0.0004218819,0.00052328943,0.0005256728,0.0000045557626,0.00020887492,0.00003357308],"genre_scores_gemma":[0.7102975,0.000026343661,0.2893205,0.0001003572,0.00009111385,0.00014717503,4.9388484e-7,0.0000064152387,0.000010080001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984957,0.000029529296,0.00026166206,0.00050369493,0.00022642202,0.00048296884],"domain_scores_gemma":[0.99926615,0.00021301617,0.00004143687,0.00029225653,0.00009289314,0.000094260955],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089434895,0.00018909073,0.00020562505,0.00024033863,0.00039839538,0.00024784528,0.00033794256,0.00012090067,2.71956e-7],"category_scores_gemma":[0.000021624437,0.00017848599,0.000034113815,0.0018677593,0.00009376573,0.00018676004,0.000009047539,0.00029000855,1.6083239e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072291414,0.000014795733,0.000008096807,0.000027272863,0.000006119328,7.740975e-7,0.0002654006,0.96304625,0.001048382,0.031339236,0.00013815869,0.004098277],"study_design_scores_gemma":[0.00014321932,0.000050045226,0.000110849935,0.00023356848,0.0000065170498,0.00000532001,0.00001505979,0.9864239,0.004787198,0.007987101,0.00006955493,0.0001676476],"about_ca_topic_score_codex":0.000007791579,"about_ca_topic_score_gemma":0.000014996091,"teacher_disagreement_score":0.69674313,"about_ca_system_score_codex":0.0001208118,"about_ca_system_score_gemma":0.00016375714,"threshold_uncertainty_score":0.7278447},"labels":[],"label_agreement":null},{"id":"W4415178829","doi":"10.1109/tnse.2025.3621342","title":"RobGenX: Uncertainty-Aware Inference in eXtreme Computing Power Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada; Qatar University","keywords":"Inference; Integer programming; Enhanced Data Rates for GSM Evolution; Edge computing; Probabilistic logic; Linear programming; Approximate inference; Task (project management); Cloud computing; Stochastic programming","score_opus":0.011463482233228198,"score_gpt":0.21315950802231107,"score_spread":0.20169602578908286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415178829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13340716,0.00046034905,0.8631132,0.000037052607,0.0021089546,0.00013174693,0.000001169584,0.00025740053,0.0004829222],"genre_scores_gemma":[0.9991204,0.00027471242,0.00042772247,0.000078204415,0.000056930414,0.000011456763,3.270058e-7,0.000011941537,0.000018303399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867064,0.000009601493,0.00023368347,0.00029842672,0.00020681157,0.00058084074],"domain_scores_gemma":[0.99943805,0.00020107903,0.000012598869,0.0001975585,0.000046862202,0.000103848404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040357249,0.00019216034,0.00018371228,0.00032672007,0.0002590238,0.00009913876,0.0002566779,0.00009428742,0.00000871363],"category_scores_gemma":[0.0000132903215,0.00019797779,0.000034340468,0.0020312648,0.0001357053,0.00026196777,0.0000051690704,0.00045970632,0.0000027894826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003608415,0.000010842388,0.00010448432,0.0000233502,0.00000661244,0.0000049258247,0.00015001037,0.9929501,0.00032546296,0.00020786715,0.00005244118,0.0061602998],"study_design_scores_gemma":[0.00015437476,0.00001735628,0.0016180765,0.00028454248,0.0000053050453,0.000003230565,0.000057805995,0.99688774,0.00031030137,0.000020153808,0.0004393897,0.0002017215],"about_ca_topic_score_codex":0.000019779049,"about_ca_topic_score_gemma":0.00007204692,"teacher_disagreement_score":0.86571324,"about_ca_system_score_codex":0.00013154167,"about_ca_system_score_gemma":0.00006394489,"threshold_uncertainty_score":0.80732995},"labels":[],"label_agreement":null},{"id":"W4415178863","doi":"10.1109/tnse.2025.3620950","title":"Resilience and Failure Analysis in Next-Generation Communication Networks: A Contemporary Survey","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Resilience (materials science); Adaptability; Relevance (law); Telecommunications network; Key (lock); Cascading failure; Network science; Network topology; Standardization","score_opus":0.018761729947281043,"score_gpt":0.22304379815637435,"score_spread":0.2042820682090933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415178863","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48547068,0.0021945187,0.51151234,0.000066045715,0.00037297164,0.00014546624,0.0000028080005,0.00011009532,0.00012507901],"genre_scores_gemma":[0.9980751,0.0012224116,0.0005954091,0.00004246989,0.00002267301,0.000021691583,0.0000027529206,0.0000061854307,0.000011257242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991077,0.00003410976,0.00020679613,0.0002449812,0.0001491767,0.0002572191],"domain_scores_gemma":[0.9994714,0.00016154222,0.000014784097,0.00023461718,0.000046222056,0.00007142098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085735094,0.00012947351,0.00017319524,0.00046319852,0.0002594548,0.00014303763,0.00017806416,0.00007449,0.0000018056129],"category_scores_gemma":[0.000015324524,0.00013480028,0.000024038642,0.0035904048,0.00015827027,0.0004994706,0.00000407239,0.00026380873,4.300286e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040451064,0.000007702391,0.0017690641,0.000011598163,0.000021082558,6.611473e-7,0.00010885609,0.9955125,0.0009277305,0.00007307038,0.00011814784,0.0014455832],"study_design_scores_gemma":[0.00010927306,0.000010594318,0.030806059,0.00006476404,0.000018470877,0.0000011267181,0.000044159613,0.9683322,0.00036808845,0.000006068966,0.0001122623,0.00012696107],"about_ca_topic_score_codex":0.00010371336,"about_ca_topic_score_gemma":0.0015223927,"teacher_disagreement_score":0.5126045,"about_ca_system_score_codex":0.000059564227,"about_ca_system_score_gemma":0.00004576418,"threshold_uncertainty_score":0.5496996},"labels":[],"label_agreement":null},{"id":"W4415624250","doi":"10.1109/tnse.2025.3626216","title":"Joint Uplink-Downlink Transmission Design and Full-Loop Control for Latency-Critical Cyber-Physical Systems","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Telecommunications link; Transmission (telecommunications); Multicast; Wireless; Resource allocation; Integer programming; Scheme (mathematics); Wireless network","score_opus":0.014349464122757255,"score_gpt":0.23373383428335168,"score_spread":0.21938437016059442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010641646,0.004868623,0.9780265,0.0006090636,0.0038230838,0.0016963676,0.00002293184,0.00024948642,0.00006231833],"genre_scores_gemma":[0.9947275,0.0005291662,0.0038018348,0.00006245347,0.00036826252,0.00039594457,5.507338e-7,0.00004735766,0.00006696705],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99653524,0.0000735711,0.0007737817,0.0009090256,0.00048563824,0.0012227566],"domain_scores_gemma":[0.9970738,0.0016975164,0.000047320875,0.00040528504,0.00028684989,0.0004891925],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019260263,0.00058789196,0.0008947846,0.0003868766,0.000990226,0.0004956335,0.00029758926,0.00030589607,0.00000443946],"category_scores_gemma":[0.000069418034,0.0005805349,0.00020436979,0.0011347892,0.00046625847,0.0005242298,0.0000037369111,0.0006561546,0.0000032565906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019925642,0.00007996161,0.0000018932114,0.00085077505,0.000120049845,0.0000036491072,0.00028611388,0.9464561,0.023388594,0.0022648433,0.00004815138,0.026300613],"study_design_scores_gemma":[0.0016234269,0.00042765582,0.000053516887,0.001393069,0.00032407898,0.000023592293,0.00011735136,0.99377555,0.00085950986,0.00020431117,0.00065534527,0.0005425909],"about_ca_topic_score_codex":0.000023617067,"about_ca_topic_score_gemma":0.0000018626267,"teacher_disagreement_score":0.9840858,"about_ca_system_score_codex":0.0002632328,"about_ca_system_score_gemma":0.00028768738,"threshold_uncertainty_score":0.9996646},"labels":[],"label_agreement":null},{"id":"W4415624267","doi":"10.1109/tnse.2025.3626049","title":"Model Predictive Congestion Control for Data Center Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cloud Computing and Resource Management","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Model predictive control; Network congestion; Data center; Flow control (data); Ranging; Queueing theory; Control (management); Flow (mathematics); Online algorithm","score_opus":0.017283859195113105,"score_gpt":0.23165786906578817,"score_spread":0.21437400987067506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415624267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014483737,0.0005120759,0.99127936,0.0009218513,0.0045789513,0.000800789,0.000033789947,0.00020153004,0.00022327401],"genre_scores_gemma":[0.9895928,0.00015769644,0.009059519,0.0005485969,0.00025869513,0.000060776143,0.0000017195065,0.000016708396,0.00030347324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99690604,0.000030380907,0.00041867155,0.0012350242,0.00045138705,0.0009585164],"domain_scores_gemma":[0.9980358,0.0003149969,0.00008435518,0.0011221693,0.00022898494,0.00021372923],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0018521406,0.00034518543,0.0003249355,0.00034227173,0.0012628905,0.00060423685,0.0016288917,0.00013210918,0.0000010635946],"category_scores_gemma":[0.000026587577,0.00035096097,0.00008070066,0.001655154,0.00029183764,0.00025533675,0.00005801661,0.00043552235,0.0000012452651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048986993,0.00007451095,0.000007149421,0.000050392166,0.000079702906,0.0000010842701,0.00009203993,0.9064336,0.000022285247,0.001304804,0.0007824929,0.09110298],"study_design_scores_gemma":[0.0010641317,0.00014711176,0.00009125365,0.0005186941,0.00012348102,0.0000039422193,0.00001631951,0.9965469,0.000017589839,0.0000840842,0.0010865054,0.0002999877],"about_ca_topic_score_codex":0.000009369109,"about_ca_topic_score_gemma":0.0000060035354,"teacher_disagreement_score":0.98814446,"about_ca_system_score_codex":0.0001710311,"about_ca_system_score_gemma":0.00026139306,"threshold_uncertainty_score":0.99989426},"labels":[],"label_agreement":null},{"id":"W4415821109","doi":"10.1109/tnse.2025.3628214","title":"Metaverse Hierarchical T/Key-Based Lightweight Authentication Protocol","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Advanced Authentication Protocols Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Protocol (science); Password; Authentication (law); Otway–Rees protocol; Cryptographic protocol; Authentication protocol; Anonymity; Universal composability; Hash function","score_opus":0.010704943069454968,"score_gpt":0.26749460772937916,"score_spread":0.2567896646599242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415821109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022063742,0.000019008878,0.94314516,0.0011000939,0.0012232352,0.053678814,0.0000048393517,0.000275099,0.000333138],"genre_scores_gemma":[0.81402284,0.000010521378,0.06340609,0.00049105193,0.000108361055,0.121592715,5.2456716e-7,0.000027980306,0.0003399219],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99595445,0.00008672679,0.00069338083,0.0012720622,0.0009797801,0.001013606],"domain_scores_gemma":[0.99765736,0.0002702983,0.00015193007,0.001130767,0.00039905432,0.00039061115],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0015358068,0.00046110456,0.00036992496,0.0007884982,0.0013726903,0.0006954286,0.001276756,0.00017758027,0.000049074744],"category_scores_gemma":[0.000056721437,0.00046885747,0.00013744911,0.0051865964,0.0007329614,0.0013561745,0.000023853067,0.0007617949,0.000043337677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009812928,0.00051923643,0.000012200633,0.00040155966,0.000057860223,0.0000067142664,0.0007306636,0.81037086,0.0042943275,0.109010875,0.00006685573,0.07443071],"study_design_scores_gemma":[0.0008733623,0.00014965083,0.00023142899,0.0005310107,0.00005250722,0.0000043983173,0.000008508866,0.9619206,0.023589505,0.0031380297,0.009068555,0.00043244765],"about_ca_topic_score_codex":0.0000037387913,"about_ca_topic_score_gemma":0.0000025391294,"teacher_disagreement_score":0.87973905,"about_ca_system_score_codex":0.0003332309,"about_ca_system_score_gemma":0.0011278519,"threshold_uncertainty_score":0.9999274},"labels":[],"label_agreement":null},{"id":"W4415821121","doi":"10.1109/tnse.2025.3628244","title":"Adaptive Resilient Control Against False Data Injection Attacks for a Multi-Energy Microgrid Integrating Power and Hydrogen Energy Systems Using Deep Reinforcement Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Smart Grid Security and Resilience","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"Japan Science and Technology Agency; Natural Sciences and Engineering Research Council of Canada","keywords":"Microgrid; Reinforcement learning; Resilience (materials science); Electric power system; Electricity; Automatic frequency control; Energy (signal processing); Power (physics)","score_opus":0.01691439725399992,"score_gpt":0.2408900165718036,"score_spread":0.22397561931780366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415821121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024795722,0.008433629,0.96289814,0.000016839565,0.0031343652,0.00049620273,0.000021032352,0.0001591991,0.000044867513],"genre_scores_gemma":[0.99432695,0.0022992874,0.0028712947,0.00007351667,0.00022079657,0.00009585874,0.000006515625,0.00004867425,0.000057116522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667865,0.000063931715,0.0007341653,0.001031006,0.00042726478,0.001064998],"domain_scores_gemma":[0.9985043,0.00031670355,0.00013235802,0.00052630436,0.00023359808,0.00028677873],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011391337,0.00055484206,0.0005401032,0.0006292696,0.0016369075,0.00045713596,0.0004924003,0.00027084988,0.0000016760566],"category_scores_gemma":[0.000059337024,0.0005873884,0.00009631048,0.0015389567,0.0003234132,0.0009269363,0.000032654378,0.0006233418,4.1792813e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009066726,0.00003729114,0.000016675005,0.00015118682,0.00018180323,0.0000040690766,0.00047798923,0.9808541,0.0078077503,0.000342199,0.000020004216,0.010016278],"study_design_scores_gemma":[0.0010415986,0.00022789082,0.00001627526,0.0012769615,0.00016287781,0.00002764037,0.0010242398,0.99227774,0.0017597805,0.0000028398044,0.0016398084,0.0005423341],"about_ca_topic_score_codex":0.00034716434,"about_ca_topic_score_gemma":0.00018317209,"teacher_disagreement_score":0.96953124,"about_ca_system_score_codex":0.000446978,"about_ca_system_score_gemma":0.00023013749,"threshold_uncertainty_score":0.9996628},"labels":[],"label_agreement":null},{"id":"W4416582895","doi":"10.1109/tnse.2025.3636073","title":"To Trust or Not to Trust: On Calibration in ML-Based Resource Allocation for Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Calibration; Resource allocation; Channel (broadcasting); Reliability (semiconductor); Rayleigh fading; Key (lock); Function (biology); Monotonic function; Fading","score_opus":0.013879365993826989,"score_gpt":0.25560358837288655,"score_spread":0.24172422237905955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06664368,0.000017749833,0.93123436,0.0006555059,0.00028779812,0.00063101016,0.00000512338,0.00042572382,0.00009906509],"genre_scores_gemma":[0.98951936,0.00003481435,0.009183191,0.0007317178,0.000046992212,0.00041039105,0.0000025460342,0.000027968848,0.00004302243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988407,0.000014732736,0.00027228476,0.00029605994,0.00020081206,0.00037542844],"domain_scores_gemma":[0.9991883,0.00022336692,0.000015868594,0.00039117786,0.00005773739,0.00012357149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005469717,0.00018070842,0.00017957638,0.00058580836,0.00020644374,0.00011217956,0.0003287082,0.00009990055,0.000002872864],"category_scores_gemma":[0.000022061964,0.00019216981,0.00003076364,0.0021316886,0.000036206882,0.00019555612,0.0000039018328,0.00023914444,0.0000012188183],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008213869,0.00001989989,0.0000056652484,0.000031162952,0.0000042517777,2.9325534e-7,0.00013928875,0.97306436,0.0025317962,0.0005003102,0.00037019353,0.023250628],"study_design_scores_gemma":[0.00021167264,0.00009002757,0.00028234438,0.00029677714,0.0000063775624,4.112678e-7,0.000026841924,0.9725337,0.023387585,0.00000863024,0.0029584933,0.00019713408],"about_ca_topic_score_codex":0.000012455617,"about_ca_topic_score_gemma":0.000090199006,"teacher_disagreement_score":0.9228757,"about_ca_system_score_codex":0.00024926141,"about_ca_system_score_gemma":0.00006258697,"threshold_uncertainty_score":0.78364575},"labels":[],"label_agreement":null},{"id":"W4416649891","doi":"10.1109/tnse.2025.3637123","title":"Intelligent Edge Caching Strategies for Optimized Content Delivery","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Cache; Enhanced Data Rates for GSM Evolution; Wireless; Content delivery; Volume (thermodynamics); Edge computing; Mobile device; Wireless network; Edge device; Graph","score_opus":0.02930854887855782,"score_gpt":0.23578528440124447,"score_spread":0.20647673552268664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416649891","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021594238,0.0020100626,0.9674444,0.00045742534,0.00747362,0.000583007,0.000009926145,0.00020381674,0.00022350937],"genre_scores_gemma":[0.98995084,0.0012043829,0.0077323206,0.00045665284,0.00015219519,0.000100031415,4.8790054e-7,0.000018166062,0.0003849569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695444,0.000036644524,0.00054679875,0.0009653113,0.00047731024,0.0010194947],"domain_scores_gemma":[0.9982919,0.00042595298,0.000082602804,0.00054690975,0.00039189227,0.00026071383],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001511555,0.0004274506,0.0004347507,0.00058638764,0.0015451817,0.0014484341,0.00092740904,0.00013271811,0.0000042314036],"category_scores_gemma":[0.000025505353,0.00043983586,0.00022427436,0.001669191,0.0003002127,0.0013978875,0.000021696313,0.00054436567,0.000004250851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007198345,0.00006317287,0.0000015512455,0.00008161002,0.000073772564,0.000003887372,0.00035702388,0.904466,0.0039684894,0.0056529795,0.00014208896,0.08511747],"study_design_scores_gemma":[0.00066675426,0.0001954705,0.000025375033,0.00069584383,0.00009288253,0.000011271881,0.0004061435,0.99446154,0.0019747487,0.00012805106,0.00091402093,0.00042789208],"about_ca_topic_score_codex":0.00014763582,"about_ca_topic_score_gemma":0.000022161792,"teacher_disagreement_score":0.96835655,"about_ca_system_score_codex":0.0002881523,"about_ca_system_score_gemma":0.00096084335,"threshold_uncertainty_score":0.99980533},"labels":[],"label_agreement":null},{"id":"W4416922232","doi":"10.1109/tnse.2025.3639401","title":"Integration of Generative AI and Mobile Networking: A Comprehensive Survey","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Calgary; University of Waterloo","funders":"Alberta Innovates; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Orchestration; Transformative learning; Resource (disambiguation); Cellular network; Generative grammar; Mobile computing; Data-driven","score_opus":0.019967101787092986,"score_gpt":0.2532521960462328,"score_spread":0.2332850942591398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416922232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054173805,0.0037871068,0.9375672,0.0001345085,0.0037865364,0.00041239927,0.000010250441,0.000083191815,0.000045048007],"genre_scores_gemma":[0.990452,0.0028025315,0.006043799,0.0004136379,0.00015323555,0.00005170195,0.0000012616779,0.000015283495,0.000066539054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997361,0.000098977405,0.00053891464,0.00084928446,0.00045405334,0.0006977576],"domain_scores_gemma":[0.9980102,0.00062954176,0.000119309414,0.00046745158,0.0005647103,0.00020875003],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011234639,0.00038965172,0.00049573753,0.00045655086,0.00077207707,0.0004343952,0.00047455254,0.00016527328,0.000004445174],"category_scores_gemma":[0.000019871728,0.00038873637,0.00007377548,0.004402341,0.00059329526,0.00071835314,0.000025978856,0.00055314036,0.000001174634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032575044,0.00004986114,0.00013291677,0.000043130545,0.000047635334,0.0000018756018,0.00060954026,0.83342737,0.0014406095,0.0005585125,0.0002856676,0.16337031],"study_design_scores_gemma":[0.0003665428,0.00030061053,0.0059702895,0.0006039857,0.000042655076,0.000009204865,0.00003824271,0.9894224,0.0019836593,0.00010269319,0.0008262971,0.00033342498],"about_ca_topic_score_codex":0.0001291364,"about_ca_topic_score_gemma":0.00006993096,"teacher_disagreement_score":0.9362782,"about_ca_system_score_codex":0.00010103466,"about_ca_system_score_gemma":0.00035609945,"threshold_uncertainty_score":0.9998565},"labels":[],"label_agreement":null},{"id":"W4417469950","doi":"10.1109/tnse.2025.3645564","title":"TinyML-Enabled Resource-Efficient Framework for Real-Time Network Securiy in Electric Vehicle Charging Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Intrusion detection system; Inference; Reduction (mathematics); Boosting (machine learning); Dimensionality reduction; Pruning; Feature selection; Malware; Memory footprint","score_opus":0.004954531876031727,"score_gpt":0.211009996634062,"score_spread":0.20605546475803027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417469950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07431998,0.0048679635,0.9130157,0.00025480156,0.0039137118,0.0019733408,0.000012253554,0.00073812355,0.0009040762],"genre_scores_gemma":[0.9871299,0.0027328914,0.0077526816,0.00023939498,0.0013412249,0.00035044138,0.000006822126,0.00022341238,0.00022318866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918146,0.000111740854,0.0013218605,0.0016785342,0.0008417472,0.004231489],"domain_scores_gemma":[0.99641037,0.0014701725,0.00017312885,0.0010961348,0.00021416637,0.0006360065],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003871244,0.0011022167,0.0011849634,0.0012274669,0.0016126361,0.0006573838,0.0010245339,0.0008043083,0.000048194506],"category_scores_gemma":[0.000092956056,0.0013193291,0.00032482686,0.011292171,0.00027042124,0.0004548295,0.000032121403,0.0023114493,0.00001964783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015607,0.00011017752,0.000018923443,0.00022845149,0.00014870723,0.000020499858,0.00023589138,0.9831179,0.0013601906,0.0023123808,0.0009102012,0.01138064],"study_design_scores_gemma":[0.0010637665,0.00017693677,0.0003147375,0.0027353636,0.00019355351,0.000016961738,0.000049717375,0.9905886,0.00048594968,0.00031121573,0.0029296372,0.0011335674],"about_ca_topic_score_codex":0.00003760042,"about_ca_topic_score_gemma":0.000021045054,"teacher_disagreement_score":0.91280997,"about_ca_system_score_codex":0.0013154183,"about_ca_system_score_gemma":0.00039330087,"threshold_uncertainty_score":0.9999903},"labels":[],"label_agreement":null},{"id":"W4417469957","doi":"10.1109/tnse.2025.3645991","title":"Subversion-Resistant Autonomous Path Proxy Re-Encryption With Secure Deduplication for IoMT","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Cryptography and Data Security","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Data deduplication; Plaintext; Server; Cryptography; Cloud computing; Encryption; Delegate; The Internet; Homomorphic encryption; Information sensitivity","score_opus":0.005978692494523218,"score_gpt":0.20994368591357399,"score_spread":0.20396499341905078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417469957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016709253,0.000090477864,0.9818557,0.00038799664,0.00036806986,0.00032007095,0.000007971008,0.00017772889,0.00008275752],"genre_scores_gemma":[0.93680745,0.000049258644,0.0628884,0.00011778363,0.000029453886,0.00009396553,0.0000017389038,0.0000047554813,0.0000071958284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989028,0.0000069865487,0.00013634961,0.00042527626,0.00021474068,0.00031382655],"domain_scores_gemma":[0.999327,0.00006668473,0.000032712484,0.00034752843,0.00013857984,0.00008750815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043933446,0.00012600487,0.00010327962,0.00023424497,0.0005731243,0.0002006468,0.00036690428,0.00004830093,0.0000011831609],"category_scores_gemma":[0.000006712422,0.00011182502,0.000032238728,0.0021082764,0.00008728178,0.0007048081,0.000005266547,0.00012780813,8.358588e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019495057,0.00023213634,0.00008866998,0.0002580208,0.00006242654,0.000004667702,0.0012264311,0.6663046,0.021030053,0.24297343,0.0013052558,0.06631937],"study_design_scores_gemma":[0.0004283851,0.00023591392,0.000968665,0.00019005884,0.000026039343,0.000005107632,0.00005729534,0.9866644,0.0049798214,0.0014478179,0.0047242544,0.00027223813],"about_ca_topic_score_codex":0.00001150375,"about_ca_topic_score_gemma":0.000016067697,"teacher_disagreement_score":0.9200982,"about_ca_system_score_codex":0.00006870601,"about_ca_system_score_gemma":0.00017740786,"threshold_uncertainty_score":0.4560092},"labels":[],"label_agreement":null},{"id":"W4417537637","doi":"10.1109/tnse.2025.3622688","title":"Split Federated Learning-Driven Resource-Efficient MEC Framework for UAV-Based Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Context (archaeology); Distributed learning; Power consumption; Resource management (computing); Deep learning; Resource (disambiguation); Resource allocation; Data modeling; Context model","score_opus":0.00564680664529088,"score_gpt":0.2099827501966357,"score_spread":0.20433594355134482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417537637","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071171033,0.00014558158,0.99103886,0.00009388694,0.0004988817,0.00033854562,0.0000030028646,0.0004685024,0.00029561855],"genre_scores_gemma":[0.9631613,0.000057459754,0.036329564,0.000086599684,0.00008007187,0.00018938596,0.0000037840507,0.000028430313,0.00006340596],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998917,0.0000071356867,0.00020069048,0.00029073888,0.00015781692,0.00042665144],"domain_scores_gemma":[0.9994247,0.00019081627,0.000020017984,0.00017724252,0.00008833448,0.000098901524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029232944,0.00017661875,0.00015117209,0.00022290512,0.00065330486,0.00016845395,0.00014857891,0.00011720348,0.0000075111348],"category_scores_gemma":[0.000014217526,0.00018925102,0.00004817728,0.0015869833,0.00007364766,0.000077556106,0.0000018245526,0.00031580686,0.0000020471227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009303265,0.0000151359,0.000005356703,0.000026727153,0.000013359445,1.8714196e-7,0.000024627006,0.9889046,0.00021058288,0.0015166772,0.00013974294,0.009133716],"study_design_scores_gemma":[0.00018185258,0.00003068503,0.00008161205,0.0001256711,0.000024071307,6.387649e-7,0.000018798142,0.9933705,0.0007728247,0.000029020739,0.0051831347,0.00018122833],"about_ca_topic_score_codex":0.000002746345,"about_ca_topic_score_gemma":0.0000032304733,"teacher_disagreement_score":0.9560442,"about_ca_system_score_codex":0.000121088175,"about_ca_system_score_gemma":0.00005269248,"threshold_uncertainty_score":0.7717433},"labels":[],"label_agreement":null},{"id":"W6921858860","doi":"10.1109/tnse.2025.3590545","title":"RadioDiff-3D: A 3D× 3D Radio Map Dataset and Generative Diffusion Based Benchmark for 6G Environment-Aware Communication","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Benchmark (surveying); Generalization; Focus (optics); Transmitter; Key (lock); Wireless; Shadow mapping; Channel (broadcasting)","score_opus":0.011313643130390618,"score_gpt":0.21095707815003426,"score_spread":0.19964343501964363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921858860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011050489,0.0007122074,0.9872194,0.00012422222,0.00033696025,0.0003110525,0.00012298411,0.000096501135,0.000026209515],"genre_scores_gemma":[0.9399944,0.0010297658,0.058503825,0.00015247657,0.00004424933,0.00012792388,0.00009612668,0.000020606409,0.000030620435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990806,0.000017999693,0.0001848233,0.00027505468,0.00015245916,0.00028906466],"domain_scores_gemma":[0.9994411,0.00012996665,0.000020224954,0.00028573352,0.000024542896,0.00009847302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042758224,0.0001794996,0.00015556984,0.00019734135,0.00049594615,0.000096565374,0.0001474069,0.00006588999,0.000014130446],"category_scores_gemma":[0.000005367356,0.00018577173,0.000025485226,0.00026454162,0.00009520635,0.00024832383,0.0000051878133,0.00018006499,0.0000014822615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010736019,0.00001295191,0.000003733905,0.000063304215,0.000015446503,2.7965172e-7,0.00009038617,0.9708927,0.015529461,0.000010425425,0.0004460218,0.012924506],"study_design_scores_gemma":[0.0004034408,0.000029667252,0.000046645837,0.00010445971,0.000034721335,0.0000017895148,0.000020251437,0.98821354,0.0056829136,0.000009333835,0.005270104,0.00018312148],"about_ca_topic_score_codex":0.0000057573166,"about_ca_topic_score_gemma":0.0000065541,"teacher_disagreement_score":0.92894393,"about_ca_system_score_codex":0.000101217236,"about_ca_system_score_gemma":0.0000285153,"threshold_uncertainty_score":0.7575551},"labels":[],"label_agreement":null},{"id":"W7117101366","doi":"10.1109/tnse.2025.3647916","title":"GenAI-Enabled Residual Motion Estimation for Energy-Efficient Semantic Video Communication","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Residual; Bandwidth (computing); Convolutional neural network; Motion estimation; Semantic similarity; Video tracking; Semantics (computer science); Channel (broadcasting)","score_opus":0.012200723959078364,"score_gpt":0.23249171466389676,"score_spread":0.2202909907048184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117101366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008070788,0.0013351426,0.98613834,0.0015674925,0.0019257878,0.00038033503,0.000003606546,0.000491518,0.00008700393],"genre_scores_gemma":[0.9666349,0.00075403467,0.03201113,0.00012809022,0.000043832533,0.00017262655,0.0000010148551,0.000013672507,0.00024067418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748063,0.00004863053,0.0004878257,0.00077652594,0.0005015162,0.00070487766],"domain_scores_gemma":[0.99807185,0.0003806368,0.00012430354,0.0009722924,0.00033496204,0.00011597762],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0014026768,0.00031116485,0.00029136523,0.0007556321,0.00209934,0.0007009045,0.001126437,0.00018352464,0.0000026376254],"category_scores_gemma":[0.000081399194,0.00032143807,0.00008539704,0.0029848153,0.00032889188,0.00064343534,0.00003743861,0.0003497679,0.000002696025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014136285,0.000055137,0.0000010866431,0.00007766023,0.00001614662,4.0194988e-7,0.00012359252,0.7741928,0.0011424748,0.009850492,0.00034547067,0.2141806],"study_design_scores_gemma":[0.00038319908,0.000109739405,0.000091138,0.0009281381,0.00005204634,0.000005496544,0.000046714908,0.97460675,0.021766348,0.0011810684,0.0005422567,0.00028711944],"about_ca_topic_score_codex":0.00003321782,"about_ca_topic_score_gemma":0.0000081179,"teacher_disagreement_score":0.95856416,"about_ca_system_score_codex":0.00023747612,"about_ca_system_score_gemma":0.0002835434,"threshold_uncertainty_score":0.99992377},"labels":[],"label_agreement":null},{"id":"W7117455090","doi":"10.1109/tnse.2025.3649013","title":"Revisiting Scalability of Distributed Wireless Networks: A Multi-Hop Communication Perspective","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Scalability; Wireless network; Network topology; Software deployment; Wireless; Heterogeneous network; Perspective (graphical); Topology (electrical circuits)","score_opus":0.010211272528814881,"score_gpt":0.24424795693739076,"score_spread":0.2340366844085759,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117455090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01143164,0.0031346944,0.98245096,0.0004728923,0.001503511,0.0006651892,0.0000141301525,0.00017631249,0.00015068827],"genre_scores_gemma":[0.9843513,0.0018649201,0.01345815,0.00008573473,0.000109188455,0.000071159455,0.0000012732831,0.000020489235,0.00003780008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99608296,0.0001780077,0.00089818146,0.0011509222,0.0006331516,0.0010567675],"domain_scores_gemma":[0.9960479,0.00076533854,0.0002600006,0.001579545,0.0010662512,0.0002809642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0030389074,0.00046766878,0.0006412974,0.00036916306,0.0012705723,0.0004398202,0.0016365064,0.00023429803,0.000008714395],"category_scores_gemma":[0.000091318994,0.0005214913,0.00017088534,0.007374417,0.001114054,0.0011389581,0.00006740639,0.0010531386,0.0000021866406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025715697,0.0001232615,0.000076847005,0.000097363736,0.000058027832,0.0000015878353,0.0004355391,0.92229134,0.00029907902,0.006652651,0.00003436871,0.069904245],"study_design_scores_gemma":[0.0005061511,0.00007329702,0.001979014,0.0017489544,0.00007916388,0.0000068568916,0.00020827724,0.9941055,0.0007060812,0.00010863288,0.00008765827,0.0003904189],"about_ca_topic_score_codex":0.00011001845,"about_ca_topic_score_gemma":0.000032361433,"teacher_disagreement_score":0.97291964,"about_ca_system_score_codex":0.0007086407,"about_ca_system_score_gemma":0.000526923,"threshold_uncertainty_score":0.9997237},"labels":[],"label_agreement":null}]}