{"meta":{"query_hash":"20acd20d0682","filters":{"venue":"IEEE Transactions on Mobile Computing"},"cohort_total":317,"direct_labels_cover":0,"predictions_cover":317,"exported":317,"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/20acd20d0682","api":"https://metacan.xera.ac/api/v1/cohort?venue=IEEE+Transactions+on+Mobile+Computing"},"results":[{"id":"W1609070905","doi":"10.1109/tmc.2015.2393856","title":"Decentralized and Parallel Constructionsfor Optimally Rigid Graphs in","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ministero dell’Istruzione, dell’Università e della Ricerca; Canadian Pain Society; National Science Foundation","keywords":"Computer science; Bidding; Cardinality (data modeling); Mathematical optimization; Rigidity (electromagnetism); Enhanced Data Rates for GSM Evolution; Greedy algorithm; Constant (computer programming); Graph; Theoretical computer science; Distributed computing; Algorithm; Mathematics","score_opus":0.022193717385069273,"score_gpt":0.2601645338487912,"score_spread":0.2379708164637219,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1609070905","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12024641,0.00018969228,0.8772943,0.00013402966,0.0010528812,0.0005857562,0.000012196311,0.00028055586,0.00020420422],"genre_scores_gemma":[0.9576393,0.00002581303,0.042106654,0.00008869149,0.000018314498,0.00007430017,0.0000020367324,0.00001430885,0.000030601066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980158,0.00017564205,0.0005062073,0.00054283056,0.00029911572,0.00046039588],"domain_scores_gemma":[0.9988788,0.000189558,0.00012517768,0.000426118,0.00011651286,0.00026387797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044650034,0.00023584413,0.00032450334,0.0002953531,0.00018755345,0.00021542919,0.00044909146,0.00009974581,0.00000533239],"category_scores_gemma":[0.000011414027,0.0002449943,0.000096387055,0.0006153075,0.00009225009,0.00039320905,0.0000076164138,0.00028246167,0.00003158979],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000918513,0.00047958386,0.0015373976,0.000036838683,0.00010475805,0.00006638949,0.0016771851,0.83820677,0.0005645241,0.0068371613,0.00018792195,0.15020962],"study_design_scores_gemma":[0.0054856217,0.0002464639,0.00071276433,0.00012016963,0.00002238105,0.00021543373,0.00043658444,0.98925894,0.00082688866,0.0009975395,0.0011828599,0.0004943229],"about_ca_topic_score_codex":0.00012029265,"about_ca_topic_score_gemma":0.000043478663,"teacher_disagreement_score":0.83739287,"about_ca_system_score_codex":0.000136256,"about_ca_system_score_gemma":0.000120645454,"threshold_uncertainty_score":0.99905777},"labels":[],"label_agreement":null},{"id":"W1827158947","doi":"10.1109/tmc.2015.2409882","title":"Delay Analysis of Multichannel Opportunistic Spectrum Access MAC Protocols","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Channel (broadcasting); Bottleneck; Access control; Queueing theory; Cognitive radio; Markov chain; Media access control; Control channel; Aloha; Queue; Queuing delay; Throughput; Protocol (science); Wireless; Base station; Telecommunications; Embedded system","score_opus":0.0678461264804908,"score_gpt":0.33429202545879594,"score_spread":0.2664458989783051,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1827158947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015751788,0.000030493735,0.98078585,0.000081466525,0.00039435743,0.0024458664,0.00001290816,0.00019451826,0.0003027794],"genre_scores_gemma":[0.9939344,0.000005573417,0.005539924,0.00015775938,0.00007038342,0.00021781342,0.0000031193438,0.00001841297,0.000052639232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793434,0.00014581412,0.0005261367,0.0005534049,0.00042004595,0.0004202518],"domain_scores_gemma":[0.99839693,0.00030732522,0.00024200435,0.0006010533,0.0002042967,0.00024839913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004732516,0.00023597601,0.0004949071,0.00064762344,0.00021485599,0.00021117079,0.00070630905,0.00007655458,0.000026812775],"category_scores_gemma":[0.00001042915,0.00023625734,0.00027980382,0.0022747018,0.00007096142,0.0003075853,0.00001651323,0.00027769222,0.000009031521],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027070573,0.00027887218,0.00007917661,0.000015600624,0.00039126855,0.000044279124,0.0006004963,0.92837775,0.000113023845,0.0001843316,0.000067977526,0.06982015],"study_design_scores_gemma":[0.00048052683,0.00025626319,0.00021380003,0.000077301156,0.00020345238,0.00001998092,0.000056695964,0.9944571,0.0036503565,0.00014015227,0.00019180753,0.0002525267],"about_ca_topic_score_codex":0.0000910264,"about_ca_topic_score_gemma":0.00006847421,"teacher_disagreement_score":0.9781826,"about_ca_system_score_codex":0.00012158898,"about_ca_system_score_gemma":0.00013636159,"threshold_uncertainty_score":0.9634295},"labels":[],"label_agreement":null},{"id":"W1964687629","doi":"10.1109/tmc.2011.92","title":"FESCIM: Fair, Efficient, and Secure Cooperation Incentive Mechanism for Multihop Cellular Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Network packet; Overhead (engineering); Relay; Collusion; Computer security; Payment; Node (physics); Incentive","score_opus":0.032046914871176994,"score_gpt":0.252424370414075,"score_spread":0.220377455542898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964687629","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029310277,0.00017851619,0.9684656,0.00005637801,0.00079279474,0.0008077998,0.0000038876055,0.00024215392,0.00014254409],"genre_scores_gemma":[0.9632168,0.00014544465,0.03617981,0.0002215811,0.00005151983,0.000099137644,0.0000033272825,0.000019618115,0.00006276794],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858,0.00015991114,0.0003150171,0.00049679045,0.00012947124,0.0003188465],"domain_scores_gemma":[0.9988238,0.0002282068,0.0001122188,0.0004807985,0.00024713596,0.000107808475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034751772,0.00021746698,0.00020202502,0.00013182474,0.0009762037,0.00014527823,0.00048047933,0.00010072308,0.000015408024],"category_scores_gemma":[0.000006492543,0.00022093547,0.00008825041,0.00042053408,0.000059690763,0.00020173247,0.00002230246,0.00029897373,0.000007970178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007105198,0.0007661265,0.00001711223,0.000044369313,0.00011757781,0.0000062317367,0.0130715575,0.5054235,0.0077916426,0.09528309,0.000101937374,0.37730578],"study_design_scores_gemma":[0.00060037925,0.00019277315,0.000016473636,0.00006136086,0.000015175256,0.0000041541985,0.00010388871,0.97533774,0.023127532,0.00016549141,0.00013434341,0.0002406831],"about_ca_topic_score_codex":0.000007612568,"about_ca_topic_score_gemma":0.000022687947,"teacher_disagreement_score":0.9339065,"about_ca_system_score_codex":0.000060891587,"about_ca_system_score_gemma":0.000034083903,"threshold_uncertainty_score":0.9009487},"labels":[],"label_agreement":null},{"id":"W1964718088","doi":"10.1109/tmc.2012.100","title":"Underwater Localization with Time-Synchronization and Propagation Speed Uncertainties","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":141,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Underwater; Benchmark (surveying); Synchronization (alternating current); Node (physics); Underwater acoustic communication; Global Positioning System; Radio propagation; Real-time computing; Propagation delay; Underwater acoustics; Network packet; Algorithm; Channel (broadcasting); Telecommunications; Computer network; Acoustics","score_opus":0.010979478833190939,"score_gpt":0.20775461919342883,"score_spread":0.19677514036023788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964718088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14935802,0.000101118,0.84969485,0.000013264796,0.00007975922,0.00026270642,0.0000016650047,0.00029577184,0.00019284747],"genre_scores_gemma":[0.9983972,0.000027695787,0.0013212961,0.000024726107,0.000057191977,0.000017024573,0.00001050976,0.000035820212,0.00010854612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99931616,0.000050215822,0.00019505755,0.00011370566,0.00012655267,0.00019832612],"domain_scores_gemma":[0.99965,0.000037855385,0.000036304686,0.00016219045,0.000053378637,0.000060290993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012551958,0.00013632585,0.000117048716,0.00009294018,0.00021435072,0.000069150236,0.00006262434,0.00005811933,0.000028499917],"category_scores_gemma":[1.975401e-7,0.00011879222,0.00002009334,0.00018775344,0.000037707334,0.0002521458,0.000001437939,0.00010987278,0.000041280862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008007542,0.000040686868,0.00024959128,0.000060424638,0.000033963195,1.3872942e-7,0.0014280225,0.95773244,0.004052916,0.000007848302,0.000013273279,0.036372665],"study_design_scores_gemma":[0.0003202647,0.00007341527,0.000088179666,0.00008835849,0.000024265137,0.000017283284,0.0003722462,0.9484512,0.049430396,0.000009398436,0.00092851755,0.00019646822],"about_ca_topic_score_codex":0.00001492449,"about_ca_topic_score_gemma":0.0000053611743,"teacher_disagreement_score":0.84903914,"about_ca_system_score_codex":0.00008945039,"about_ca_system_score_gemma":0.000007855505,"threshold_uncertainty_score":0.4844206},"labels":[],"label_agreement":null},{"id":"W1972961267","doi":"10.1109/tmc.2015.2416181","title":"Energy and Throughput Trade-Offs in Cellular Networks Using Base Station Switching","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Telecommunications link; Computer science; Base station; Scheduling (production processes); Bottleneck; Benchmark (surveying); Computer network; Efficient energy use; Cellular network; Real-time computing; Embedded system; Engineering","score_opus":0.018088609770751916,"score_gpt":0.23416101860080127,"score_spread":0.21607240883004936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972961267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10583921,0.00037873097,0.8926175,0.0000032656205,0.0006794529,0.0001892016,0.0000025362922,0.000238382,0.000051699888],"genre_scores_gemma":[0.9796342,0.000037550726,0.020137278,0.000018397877,0.00009035289,0.000015757463,0.000005747775,0.000056756944,0.000003956724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989714,0.00006875998,0.0003465795,0.000242365,0.00011113473,0.00025975265],"domain_scores_gemma":[0.9995852,0.00009358015,0.000053594315,0.0001511801,0.000022139357,0.000094284755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020452359,0.0001869945,0.00019969748,0.00017758487,0.00010795457,0.000042517586,0.00005877911,0.000100985526,0.0000021857554],"category_scores_gemma":[0.0000021031963,0.00022294353,0.000033306187,0.00033186417,0.000014538928,0.0002830671,0.0000014110745,0.00020802087,7.056472e-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.00000654357,0.000024382407,0.000021643413,0.000022839038,0.0000101514415,0.000005978724,0.00067448337,0.957678,0.0036792997,0.000012936845,0.0000045678476,0.037859127],"study_design_scores_gemma":[0.0005367845,0.000040435516,0.000004820705,0.000117905154,0.000012469672,0.000012512895,0.000411453,0.99414194,0.004435235,0.000031789175,0.000048385016,0.00020625656],"about_ca_topic_score_codex":0.00010784175,"about_ca_topic_score_gemma":0.00009830087,"teacher_disagreement_score":0.873795,"about_ca_system_score_codex":0.00023286142,"about_ca_system_score_gemma":0.000015435144,"threshold_uncertainty_score":0.90913737},"labels":[],"label_agreement":null},{"id":"W1975668354","doi":"10.1109/tmc.2003.1233528","title":"Modeling and analysis of wap performance over wireless links","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Goodput; Computer science; Wireless Application Protocol; Wireless; Channel (broadcasting); Computer network; Rayleigh fading; Network packet; Wireless network; Fading; General Packet Radio Service; Throughput; Telecommunications","score_opus":0.02438602890010434,"score_gpt":0.28429300523409035,"score_spread":0.259906976333986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975668354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45767257,0.00007465114,0.5419229,0.000010516067,0.00006607926,0.00009204071,0.0000010274013,0.000051275558,0.00010890891],"genre_scores_gemma":[0.9868808,0.00023437009,0.012782136,0.00003561608,0.000007741803,0.000017642673,9.138462e-7,0.00001178021,0.000029000861],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998436,0.00019373019,0.0003825189,0.00036487338,0.00033574025,0.0002871421],"domain_scores_gemma":[0.9985063,0.00031512385,0.000083506675,0.0008524933,0.00014951613,0.000093057904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005732934,0.00014401697,0.00029334566,0.0005094174,0.0003301114,0.000082334744,0.0006135941,0.000117041076,0.0000150628475],"category_scores_gemma":[0.000003937594,0.00014837108,0.00012263858,0.0018400714,0.00006613834,0.00025511076,0.000013500174,0.00055819406,0.0000032782364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000319339,0.000076571945,0.00026403484,0.000016497428,0.0001245708,4.2170558e-7,0.0003928133,0.9000951,0.0003067201,0.00041555034,0.0000011900092,0.098303355],"study_design_scores_gemma":[0.00019884705,0.000058558897,0.00028962406,0.00004172692,0.000048727976,0.0000027454819,0.00003567838,0.99567705,0.0034706648,0.000015864993,0.000022166678,0.00013833553],"about_ca_topic_score_codex":0.000027976139,"about_ca_topic_score_gemma":0.000012836515,"teacher_disagreement_score":0.52920824,"about_ca_system_score_codex":0.000049289552,"about_ca_system_score_gemma":0.000054285145,"threshold_uncertainty_score":0.6050397},"labels":[],"label_agreement":null},{"id":"W1976864402","doi":"10.1109/tmc.2015.2412940","title":"Opportunistic Channel Selection by Cognitive Wireless Nodes Under Imperfect Observations and Limited Memory: A Repeated Game Model","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Academy of Finland; Science Foundation Ireland; National Science Foundation","keywords":"Computer science; Channel (broadcasting); Imperfect; Stochastic game; Distributed computing; Computer network; Cognitive radio; Wireless; Automaton; Telecommunications; Theoretical computer science","score_opus":0.04986149910598351,"score_gpt":0.262378937578177,"score_spread":0.21251743847219348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976864402","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3122129,0.000057978315,0.68660575,0.00012553763,0.00022685155,0.00031633698,0.00002297415,0.0003356957,0.000095946365],"genre_scores_gemma":[0.9969879,0.000050513943,0.002317358,0.00037959171,0.00006419243,0.000030540356,0.00001586747,0.000036207104,0.0001178321],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979612,0.0001737242,0.00035474982,0.0006988172,0.00036082554,0.00045064065],"domain_scores_gemma":[0.9984342,0.00040165448,0.00014645114,0.00022897361,0.00050955045,0.0002791964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004421226,0.00030216304,0.00031282872,0.00021899416,0.0005187914,0.0002561862,0.00018214034,0.00012459,0.000002313942],"category_scores_gemma":[0.00002021751,0.0003237934,0.000089623405,0.0008291506,0.000095683485,0.0003981849,0.0000103180355,0.00041473823,0.000004064237],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006746175,0.0003499549,0.000026347101,0.000021636695,0.00014313492,0.000016685897,0.0021204508,0.88304675,0.006335883,0.0002611567,0.00023269281,0.10737783],"study_design_scores_gemma":[0.0008934218,0.00026939056,0.00006551056,0.00014382416,0.000059404418,0.00009321927,0.0003548269,0.9933649,0.0040602274,0.00032852584,0.000007812807,0.00035898513],"about_ca_topic_score_codex":0.00009279372,"about_ca_topic_score_gemma":0.000043308093,"teacher_disagreement_score":0.684775,"about_ca_system_score_codex":0.00021295834,"about_ca_system_score_gemma":0.00021203671,"threshold_uncertainty_score":0.99992144},"labels":[],"label_agreement":null},{"id":"W1982821438","doi":"10.1109/tmc.2015.2413782","title":"Robust Ergodic Uplink Resource Allocation in Underlay OFDMA Cognitive Radio Networks","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":45,"is_retracted":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; Manitoba Beekeepers' Association","funders":"","keywords":"Computer science; Mathematical optimization; Cognitive radio; Telecommunications link; Transmitter power output; Underlay; Constraint (computer-aided design); Channel state information; Resource allocation; Optimization problem; Quality of service; Channel (broadcasting); Signal-to-noise ratio (imaging); Algorithm; Wireless; Mathematics; Computer network; Telecommunications; Transmitter","score_opus":0.025062099688905094,"score_gpt":0.23680806309269856,"score_spread":0.21174596340379345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982821438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020613952,0.00042685017,0.97662497,0.000016940272,0.0007638341,0.00055710913,0.0000037613904,0.0005445088,0.00044805923],"genre_scores_gemma":[0.99572283,0.00004866785,0.0037884626,0.000027266151,0.00014248509,0.00010287209,0.000015476237,0.000073785974,0.000078145305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875873,0.000082302,0.00040820567,0.00029334,0.00013806185,0.00031938645],"domain_scores_gemma":[0.99933755,0.00021447222,0.00006618891,0.00018718216,0.00007762856,0.00011696208],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002761793,0.0002189535,0.00023684211,0.00023658872,0.000104482104,0.000037676287,0.00011331813,0.00015771156,0.000011081987],"category_scores_gemma":[0.000007962816,0.00026207796,0.000055797023,0.000582103,0.00003314769,0.0001809316,0.000001615452,0.00042738428,0.000021023412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018277642,0.000048694328,0.00003941545,0.000023054672,0.00002424798,0.0000035718424,0.00064468745,0.96891785,0.0000515383,0.000006727761,0.00006534695,0.030156603],"study_design_scores_gemma":[0.0008601017,0.00005919606,0.000030663836,0.00028719468,0.000021853824,0.000011336389,0.00063450757,0.99667835,0.0010826631,0.000008762889,0.000077338795,0.00024802308],"about_ca_topic_score_codex":0.000024271587,"about_ca_topic_score_gemma":0.000049750495,"teacher_disagreement_score":0.97510886,"about_ca_system_score_codex":0.00036537097,"about_ca_system_score_gemma":0.00003009248,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W1982868438","doi":"10.1109/tmc.2012.173","title":"Quality Prediction-Based Dynamic Content Adaptation Framework Applied to Collaborative Mobile Presentations","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Multimedia Communication and Technology","field":"Social Sciences","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"","keywords":"Computer science; Transcoding; Adaptation (eye); Content adaptation; Multimedia; Dynamic web page; Quality (philosophy); Quality of experience; The Internet; Mobile device; On the fly; World Wide Web; Human–computer interaction; Ubiquitous computing; Computer network; Quality of service; Web page; Operating system","score_opus":0.0648451575247619,"score_gpt":0.3805682967868894,"score_spread":0.31572313926212753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982868438","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10441166,0.000056907742,0.8899082,0.00045704783,0.0009392868,0.0017969807,0.00006145836,0.00051788654,0.0018505595],"genre_scores_gemma":[0.9713204,0.000026174093,0.027073106,0.0002791236,0.00007953769,0.0010585801,0.000017597316,0.000019833595,0.00012565187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"qualitative","domain_scores_codex":[0.99807096,0.0004385628,0.000429487,0.00027175216,0.00038327897,0.0004059583],"domain_scores_gemma":[0.997446,0.0014459082,0.00016662171,0.0004382829,0.00027265458,0.00023053416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007616183,0.00015763509,0.00021081923,0.00023889287,0.0012573939,0.00005842868,0.00031053828,0.00020808548,0.00020578613],"category_scores_gemma":[0.00008397891,0.00017774964,0.00008189203,0.0010033413,0.00021743841,0.00014650973,0.0000040680775,0.00040487887,0.00013144828],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011338884,0.001600561,0.0010757293,0.000023330265,0.00010540834,3.025896e-7,0.08343169,0.6393267,0.002349104,0.011387223,0.00016507393,0.2604215],"study_design_scores_gemma":[0.004827715,0.0010758808,0.02131835,0.00033281537,0.00026985613,0.0000024731619,0.44789577,0.42266518,0.016900891,0.0014188663,0.08085863,0.0024335654],"about_ca_topic_score_codex":0.0004075924,"about_ca_topic_score_gemma":0.00070699916,"teacher_disagreement_score":0.8669087,"about_ca_system_score_codex":0.00026396554,"about_ca_system_score_gemma":0.0001909767,"threshold_uncertainty_score":0.9670984},"labels":[],"label_agreement":null},{"id":"W1983109928","doi":"10.1109/tmc.2015.2425396","title":"Secondary VoIP Capacity in Opportunistic Spectrum Access Networks with Friendly Scheduling","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Scheduling (production processes); Voice over IP; Dynamic priority scheduling; Network packet; Quality of service; Schedule; Cognitive radio; Distributed computing; The Internet; Mathematical optimization; Telecommunications","score_opus":0.04603838214109765,"score_gpt":0.26290670296934326,"score_spread":0.21686832082824561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983109928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14056696,0.000062531755,0.8566558,0.00013440492,0.00090828235,0.00032136758,0.0000030742233,0.00026263346,0.001084964],"genre_scores_gemma":[0.98195964,0.000013686365,0.01758115,0.00018280355,0.00019437478,0.000013273978,0.0000021214423,0.00003220869,0.00002076765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976254,0.00016743162,0.0004277833,0.0007325254,0.00035361506,0.000693212],"domain_scores_gemma":[0.998622,0.0002999149,0.00015212418,0.0005030015,0.00010886213,0.0003141214],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058736344,0.00032001748,0.00037657304,0.0003144043,0.00037999594,0.00044075598,0.00063269516,0.00011140412,0.000013889788],"category_scores_gemma":[0.0000068138506,0.00031247985,0.00009203446,0.0011258423,0.000103318176,0.0006476371,0.000016668984,0.0009757023,0.000010381387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002938275,0.00012507838,0.00011687356,0.000008954654,0.000024577264,0.00013175319,0.00040096356,0.9160732,0.000013228845,0.00035273007,0.000015831469,0.08270744],"study_design_scores_gemma":[0.0009250894,0.00037651608,0.00034107524,0.00019808317,0.0000147241835,0.00017134628,0.00018349465,0.9964361,0.0005195722,0.00032466665,0.00010134155,0.0004079774],"about_ca_topic_score_codex":0.00018493766,"about_ca_topic_score_gemma":0.0004883415,"teacher_disagreement_score":0.84139264,"about_ca_system_score_codex":0.00025980646,"about_ca_system_score_gemma":0.00026241998,"threshold_uncertainty_score":0.9999327},"labels":[],"label_agreement":null},{"id":"W1986895073","doi":"10.1109/tmc.2014.2307330","title":"Concurrent Multipath Transfer Using SCTP: Modelling and Congestion Window Management","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"Western University","funders":"","keywords":"Computer science; Multihoming; Stream Control Transmission Protocol; Transport layer; Computer network; Scalability; Throughput; Distributed computing; Markov process; Markov chain; Window (computing); Network congestion; Multipath propagation; Sliding window protocol; Session (web analytics); Channel (broadcasting); Layer (electronics); Wireless; Internet Protocol; The Internet; Telecommunications; Path (computing)","score_opus":0.018901233409715137,"score_gpt":0.23557447165189802,"score_spread":0.21667323824218288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986895073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10999528,0.000107276814,0.8879709,0.000047530455,0.0010251058,0.00044572775,0.0000018814113,0.00030518358,0.00010107523],"genre_scores_gemma":[0.98026526,0.000049502894,0.01935611,0.00014808185,0.000096951335,0.000030750423,7.8415593e-7,0.00001947423,0.00003306023],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826556,0.00015042344,0.00034929544,0.0005928994,0.00026796607,0.0003738445],"domain_scores_gemma":[0.99917644,0.0002153068,0.000055097695,0.00032988057,0.00007442166,0.00014887034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003935604,0.00024998773,0.00025130413,0.00016392673,0.00047687395,0.0001744892,0.00029142274,0.000082296894,0.000005640911],"category_scores_gemma":[9.2647826e-7,0.00025909432,0.00009779056,0.0002578122,0.00006447471,0.00024433137,0.0000055494033,0.00028852167,0.000011960682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037433583,0.000048917507,0.000004048723,0.000014291486,0.000019991896,0.000001935767,0.00015749734,0.5560975,0.000060374314,0.0012227852,0.0000013207145,0.44236758],"study_design_scores_gemma":[0.0011221444,0.00012380483,0.000022518832,0.00014489556,0.000047379675,0.000019712286,0.000041170715,0.9973465,0.00045005415,0.00006234892,0.00034653832,0.00027289125],"about_ca_topic_score_codex":0.000011773276,"about_ca_topic_score_gemma":0.00000519363,"teacher_disagreement_score":0.87027,"about_ca_system_score_codex":0.000059088063,"about_ca_system_score_gemma":0.000019206731,"threshold_uncertainty_score":0.9999861},"labels":[],"label_agreement":null},{"id":"W1987479549","doi":"10.1109/tmc.2015.2404791","title":"Virtual Servers Co-Migration for Mobile Accesses: Online versus Off-Line","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Tech University; University of New Brunswick","funders":"","keywords":"Server; Computer science; Online algorithm; Lambda; Computer network; Wireless network; Mathematics; Wireless; Combinatorics; Discrete mathematics; Algorithm; Operating system; Physics","score_opus":0.06621270087283197,"score_gpt":0.3247944025949143,"score_spread":0.25858170172208234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987479549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3284363,0.00005529331,0.66849613,0.000076775126,0.0020911028,0.00042642283,0.000039251016,0.00033399047,0.00004471813],"genre_scores_gemma":[0.9937568,0.000035249654,0.0054284125,0.00019230103,0.0002263931,0.000099661076,0.000026116059,0.000024298057,0.00021077997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982744,0.000086786844,0.00038770842,0.0005401177,0.00035662774,0.00035435977],"domain_scores_gemma":[0.9983635,0.00053794915,0.00013545455,0.0005032302,0.00027246602,0.00018740368],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003882807,0.00023941546,0.00025223923,0.00020045086,0.00035008133,0.000220372,0.0006471652,0.00010187766,0.0000055266646],"category_scores_gemma":[0.000020322206,0.00024696128,0.00019696938,0.00039714135,0.000040661103,0.0005474334,0.000008594696,0.00027810616,0.00003886011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016676034,0.00036846357,0.0000072422686,0.000012130336,0.00004830265,0.0000037856535,0.00071072334,0.7345579,0.00065729185,0.00006413698,0.00044240433,0.26296085],"study_design_scores_gemma":[0.0026317989,0.0020335102,0.000007467255,0.000051523646,0.000033952332,0.0000097852735,0.0009418698,0.9845195,0.00552211,0.000032017193,0.0038922129,0.0003242876],"about_ca_topic_score_codex":0.00010935337,"about_ca_topic_score_gemma":0.00015817254,"teacher_disagreement_score":0.6653205,"about_ca_system_score_codex":0.0001727686,"about_ca_system_score_gemma":0.00016336923,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W1988792675","doi":"10.1109/tmc.2011.94","title":"On Reliable Broadcast in Low Duty-Cycle Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Atomic broadcast; Computer network; Wireless sensor network; Distributed computing; Broadcast radiation; Broadcast domain; Scalability; Broadcast communication network; Broadcasting (networking)","score_opus":0.01245002267926181,"score_gpt":0.21754064166890275,"score_spread":0.20509061898964093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988792675","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2732886,0.00003592693,0.7229548,0.000020977404,0.0016619817,0.00029672915,0.0000014338708,0.00043408116,0.0013054559],"genre_scores_gemma":[0.98345655,0.000040900777,0.015800979,0.00030194232,0.00010481546,0.00004261408,0.0000013961011,0.000058964186,0.00019180661],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968559,0.00019265636,0.00061978225,0.0009935537,0.00041263964,0.00092544046],"domain_scores_gemma":[0.99803007,0.00044349284,0.00018267176,0.001063721,0.00007699399,0.00020305792],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042062218,0.00041415283,0.0004137722,0.0004078097,0.0004110009,0.00012759153,0.0009640435,0.0002453592,0.000047257297],"category_scores_gemma":[0.0000036784397,0.00043911766,0.00018510637,0.001287637,0.000093440925,0.00026698003,0.00001655467,0.0009463563,0.00011677118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003810635,0.0006071144,0.000040278042,0.000012498312,0.000016096908,0.00006984153,0.00063886505,0.93995464,0.00006734345,0.00080084073,0.000036109435,0.057718284],"study_design_scores_gemma":[0.00067875884,0.00030038846,0.00015010386,0.00035511574,0.000007242,0.000027401364,0.000057091584,0.9923077,0.0055395616,0.000063751686,0.000059466784,0.0004533988],"about_ca_topic_score_codex":0.0001863109,"about_ca_topic_score_gemma":0.00004991683,"teacher_disagreement_score":0.71016794,"about_ca_system_score_codex":0.00018947097,"about_ca_system_score_gemma":0.000046949324,"threshold_uncertainty_score":0.99980605},"labels":[],"label_agreement":null},{"id":"W2001084946","doi":"10.1109/tmc.2011.246","title":"EMAP: Expedite Message Authentication Protocol for Vehicular Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":218,"is_retracted":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":"Hash-based message authentication code; Computer science; Revocation list; Message authentication code; Computer network; Public key infrastructure; Authentication (law); Public-key cryptography; Revocation; Computer security; Communication source; Vehicular ad hoc network; Message broker; Wireless ad hoc network; Cryptography; Wireless; Encryption; Overhead (engineering); Telecommunications","score_opus":0.024196094358240473,"score_gpt":0.25790238593029796,"score_spread":0.2337062915720575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001084946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009215251,0.00010174793,0.9387267,0.000005909324,0.00082989846,0.049989738,0.0000075880694,0.0008964445,0.00022671523],"genre_scores_gemma":[0.8578534,0.000013323001,0.00952734,0.000034468514,0.00026922894,0.13206634,0.00000909979,0.0001354967,0.00009128283],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982651,0.000059471484,0.00047986725,0.00040120396,0.00020593578,0.0005884298],"domain_scores_gemma":[0.99906015,0.00013119732,0.00008782905,0.0004944969,0.00007345287,0.00015287864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003171613,0.0003322525,0.00028743886,0.00013837114,0.000282863,0.00005634453,0.00026399922,0.00021625595,0.00011002393],"category_scores_gemma":[0.0000026722546,0.00035657122,0.00023367688,0.00028414678,0.000046017693,0.00016824597,0.0000028071668,0.0004296465,0.000041562293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039959534,0.0001180628,0.0000030372403,0.00010112683,0.00007779239,0.000004724744,0.0006186349,0.931643,0.00039271463,0.000013753952,0.00030197657,0.066685185],"study_design_scores_gemma":[0.00095606426,0.00018611806,0.000046134333,0.00017737529,0.000054186574,0.000012715697,0.00006466563,0.98386514,0.0068878075,0.00004824334,0.0073339795,0.00036756677],"about_ca_topic_score_codex":0.0000021634928,"about_ca_topic_score_gemma":0.000009559524,"teacher_disagreement_score":0.9291994,"about_ca_system_score_codex":0.00012614793,"about_ca_system_score_gemma":0.000019837325,"threshold_uncertainty_score":0.9998886},"labels":[],"label_agreement":null},{"id":"W2015003673","doi":"10.1109/tmc.2013.83","title":"Optimal Design of the Spectrum Sensing Parameters in the Overlay Spectrum Sharing","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Carleton University; University of British Columbia","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Overlay; Transmitter; Fading; Cognitive radio; Interference (communication); Mathematical optimization; Transmission (telecommunications); Computer network; Algorithm; Topology (electrical circuits); Wireless; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.019236901457483458,"score_gpt":0.23046850890383408,"score_spread":0.2112316074463506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015003673","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32647735,0.000025458898,0.67179734,0.00048073058,0.00047603168,0.00055576384,5.1247133e-7,0.000058315196,0.00012848736],"genre_scores_gemma":[0.97738844,0.000010070905,0.02223525,0.00025975413,0.000064095046,0.0000074672785,1.2915876e-7,0.000018608796,0.000016192991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784076,0.00031011194,0.00043926417,0.0005006949,0.00036761904,0.00054153043],"domain_scores_gemma":[0.9981455,0.00086987234,0.00016841773,0.00072814035,0.000035881363,0.00005217783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006399064,0.00023996583,0.0002640579,0.00016928153,0.00043908315,0.00028968684,0.0008751178,0.000068311216,0.000010073795],"category_scores_gemma":[0.000008145459,0.00016730587,0.0001966589,0.0010099879,0.00010818135,0.00026994367,0.000018701972,0.0006110075,0.000013740635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005457169,0.00006823172,0.000037810427,0.0000056888807,0.000021043043,0.000009123546,0.0013852639,0.963632,0.0007960403,0.00017158191,0.000019444366,0.03384834],"study_design_scores_gemma":[0.0002714661,0.00012824724,0.0010955555,0.00014672741,0.000013204322,0.000097306765,0.00025811107,0.9800562,0.017054558,0.00066741346,0.000009425172,0.00020177312],"about_ca_topic_score_codex":0.00031063333,"about_ca_topic_score_gemma":0.0000482166,"teacher_disagreement_score":0.6509111,"about_ca_system_score_codex":0.000113252754,"about_ca_system_score_gemma":0.000047955822,"threshold_uncertainty_score":0.68225354},"labels":[],"label_agreement":null},{"id":"W2015398759","doi":"10.1109/tmc.2015.2417880","title":"Downlink Power Control in Self-Organizing Dense Small Cells Underlaying Macrocells: A Mean Field Game","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":70,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Mathematical optimization; Nash equilibrium; Base station; Telecommunications link; Power control; Relaxation (psychology); Cellular network; Power (physics); Mathematics; Computer network","score_opus":0.012104384029354551,"score_gpt":0.21801056353718837,"score_spread":0.20590617950783383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015398759","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1319709,0.00014437192,0.8650928,0.000012369106,0.0010974046,0.0005110842,0.0000051624093,0.0007925876,0.00037329193],"genre_scores_gemma":[0.98767096,0.00001889623,0.011978567,0.00011808828,0.00006690148,0.000022136886,0.0000013460372,0.00008927107,0.00003385213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984949,0.00007577267,0.0005031458,0.00033347262,0.00015291796,0.0004397851],"domain_scores_gemma":[0.9990803,0.0003069928,0.000073723524,0.00028567069,0.00009895533,0.00015436226],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00028509443,0.00028217823,0.00032337444,0.00025506347,0.00008982132,0.00006306138,0.00016893362,0.00017170009,0.000019832603],"category_scores_gemma":[0.000007392678,0.0003298826,0.00008143934,0.00043368308,0.000011447615,0.00015559206,0.0000023987016,0.00048423655,0.00007052557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015002833,0.00006380364,0.00002566208,0.00005002586,0.000035533503,0.000017645272,0.0032682715,0.98338896,0.009865389,0.0000029062403,0.000027726934,0.0032390563],"study_design_scores_gemma":[0.0016963771,0.00012963837,0.000003962716,0.00017433405,0.000030432231,0.000028604594,0.0014140015,0.9500152,0.045930006,0.000020496738,0.000143752,0.00041322253],"about_ca_topic_score_codex":0.00004475889,"about_ca_topic_score_gemma":0.000087713284,"teacher_disagreement_score":0.8557001,"about_ca_system_score_codex":0.00038789853,"about_ca_system_score_gemma":0.00004124498,"threshold_uncertainty_score":0.9999153},"labels":[],"label_agreement":null},{"id":"W2020662527","doi":"10.1109/tmc.2010.152","title":"Distributed Multi-Interface Multichannel Random Access Using Convex Optimization","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Channel (broadcasting); Node (physics); Wireless ad hoc network; Channel allocation schemes; Optimization problem; Interface (matter); Convex optimization; Distributed algorithm; Mathematical optimization; Algorithm; Random access; Throughput; Wireless; Distributed computing; Computer network; Regular polygon; Mathematics","score_opus":0.02669440846908288,"score_gpt":0.30193889635787863,"score_spread":0.27524448788879574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020662527","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046638217,0.000029609622,0.94791645,0.00003927253,0.0039100274,0.0008862971,0.000018274459,0.0005381945,0.000023682278],"genre_scores_gemma":[0.83028376,0.0000070538485,0.1693987,0.00007728001,0.00011869705,0.0000506998,0.000007271564,0.00003563034,0.000020918496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975489,0.00015910313,0.00057343015,0.0008011212,0.00032942713,0.000588035],"domain_scores_gemma":[0.997943,0.00045696116,0.0002498608,0.00088615244,0.0002455076,0.00021852959],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044085842,0.00036073246,0.00038994616,0.00019760663,0.00065207435,0.0005457558,0.001349679,0.00021737505,0.00009858137],"category_scores_gemma":[0.000018864415,0.0003770166,0.00018395722,0.0008085765,0.00010463978,0.0008436962,0.000032565775,0.0008873245,0.000024679406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024691046,0.00024226525,0.000015830637,0.000013383885,0.000034035053,0.0000068688787,0.00026661262,0.9786478,0.0035153658,0.000019104718,0.000022665132,0.017191345],"study_design_scores_gemma":[0.0021012921,0.00006131702,0.000018237011,0.00006396425,0.000026103278,0.000040676518,0.000035535562,0.96947986,0.027697915,0.000009632554,0.00009036057,0.00037509066],"about_ca_topic_score_codex":0.00007464526,"about_ca_topic_score_gemma":0.00003744498,"teacher_disagreement_score":0.7836455,"about_ca_system_score_codex":0.00010021262,"about_ca_system_score_gemma":0.00008479296,"threshold_uncertainty_score":0.99986815},"labels":[],"label_agreement":null},{"id":"W2025416284","doi":"10.1109/tmc.2012.206","title":"Background Subtraction for Online Calibration of Baseline RSS in RF Sensing Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; Beijing University of Posts and Telecommunications","keywords":"RSS; Computer science; Background subtraction; Calibration; Baseline (sea); Artificial intelligence; Pixel; Computer vision; Mathematics","score_opus":0.020730493715700477,"score_gpt":0.2583825845539969,"score_spread":0.2376520908382964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025416284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25190988,0.00009296018,0.7466209,0.000008965501,0.00080733944,0.00025442842,0.0000135635,0.00027757374,0.0000144210735],"genre_scores_gemma":[0.99069196,0.00004117771,0.009017486,0.000020819245,0.00014808372,0.000010250511,0.000027032125,0.000034818648,0.000008394475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990901,0.000028652694,0.00038944292,0.0001244767,0.00008904554,0.00027832476],"domain_scores_gemma":[0.999461,0.00025856946,0.000058086316,0.00014466897,0.000042986718,0.000034666995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026953034,0.00014052508,0.00018862778,0.00021812637,0.00008309507,0.000014839528,0.00005930263,0.00015410331,0.00001062272],"category_scores_gemma":[0.0000064960554,0.00015578583,0.00007339639,0.0003553795,0.00002618316,0.00020863117,9.371778e-7,0.00022729418,9.261506e-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.000013848303,0.00007983026,0.00007177676,0.000051999687,0.000012094247,2.3016308e-7,0.00010451654,0.9187198,0.0022052536,0.000023078728,0.000020489291,0.07869703],"study_design_scores_gemma":[0.00033371765,0.000042189997,0.000104232764,0.0000653839,0.000015824924,0.000004487975,0.0003094915,0.9363401,0.062490173,0.000013425691,0.00014459791,0.00013638282],"about_ca_topic_score_codex":0.000022962568,"about_ca_topic_score_gemma":0.00005876758,"teacher_disagreement_score":0.73878205,"about_ca_system_score_codex":0.000099182485,"about_ca_system_score_gemma":0.000008876756,"threshold_uncertainty_score":0.6352762},"labels":[],"label_agreement":null},{"id":"W2031322911","doi":"10.1109/tmc.2014.2318700","title":"An Evolutionary Game for Distributed Resource Allocation in Self-Organizing Small Cells","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":147,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Resource allocation; Evolutionary game theory; Mathematical optimization; Macrocell; Game theory; Orthogonal frequency-division multiple access; Distributed computing; Base station; Computer network; Orthogonal frequency-division multiplexing; Mathematics","score_opus":0.007355821565909815,"score_gpt":0.21159318036079433,"score_spread":0.20423735879488453,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031322911","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06299397,0.000030528478,0.9350355,0.0000070499377,0.00040587925,0.0006351555,0.000023776076,0.0008282034,0.000039934737],"genre_scores_gemma":[0.94558364,0.00000613394,0.054061536,0.000015633761,0.00010775355,0.000094681294,0.00005285641,0.00006817872,0.000009602427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988877,0.000071470604,0.00037286483,0.00029116083,0.00008485384,0.00029193645],"domain_scores_gemma":[0.9993023,0.00021806711,0.000059347145,0.0002737118,0.00007340616,0.00007315676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023037542,0.00018548837,0.00018977068,0.00017494553,0.00013991928,0.00003094288,0.0001400162,0.00011638251,0.0000041043654],"category_scores_gemma":[0.000005894549,0.00023234797,0.000052086918,0.0003588491,0.000013356124,0.00015815388,9.803119e-7,0.00019495438,0.000010097173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007966804,0.00008021224,0.000012200162,0.00007356356,0.000011057847,2.9032165e-7,0.00040350694,0.9757096,0.014613502,0.000014804497,0.00001816057,0.0090551],"study_design_scores_gemma":[0.0005173421,0.00009844275,0.000051700452,0.00008076152,0.000014413555,0.000003988924,0.0001648318,0.97224,0.025831401,0.000022096565,0.00074915035,0.00022588146],"about_ca_topic_score_codex":0.00000925439,"about_ca_topic_score_gemma":0.000018307313,"teacher_disagreement_score":0.88258964,"about_ca_system_score_codex":0.00031536873,"about_ca_system_score_gemma":0.000014760468,"threshold_uncertainty_score":0.94748753},"labels":[],"label_agreement":null},{"id":"W2032997440","doi":"10.1109/tmc.2004.1261818","title":"QoS-oriented packet scheduling for wireless multimedia CDMA communications","year":2004,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Quality of service; Transmission delay; Network packet; Scheduling (production processes); Code division multiple access; Packet loss; Wireless; Telecommunications","score_opus":0.03757708550607677,"score_gpt":0.3231624036712443,"score_spread":0.2855853181651676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032997440","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029201789,0.00017441559,0.96688557,0.0009611313,0.00084149675,0.0011434355,0.00001656084,0.00063723145,0.00013835322],"genre_scores_gemma":[0.6643511,0.00011089801,0.33495474,0.0001257779,0.00007907203,0.00030090642,0.0000114995255,0.000032376283,0.00003363018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974532,0.00023791884,0.0005926658,0.0006078879,0.0004507284,0.00065757305],"domain_scores_gemma":[0.9949309,0.0012383863,0.00018956925,0.002971791,0.00043606365,0.00023328609],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00074170355,0.00028330082,0.00031726883,0.00032867322,0.001436698,0.00023648498,0.003105635,0.0001567526,0.0000076183323],"category_scores_gemma":[0.00002526542,0.00031141305,0.00022519396,0.0011838888,0.00023183944,0.00045014804,0.00006949542,0.0008112736,0.00007537528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020430862,0.00067133136,0.000013597986,0.000031065974,0.00006544773,0.0000020005546,0.0015989662,0.7042112,0.0015253281,0.006474319,0.00004532446,0.28534102],"study_design_scores_gemma":[0.0014337689,0.00016971046,0.00003461473,0.00017290638,0.000012043931,0.000012243094,0.00020524923,0.9846475,0.011263261,0.00027193446,0.0014481433,0.00032862154],"about_ca_topic_score_codex":0.000053356143,"about_ca_topic_score_gemma":0.00006533755,"teacher_disagreement_score":0.6351493,"about_ca_system_score_codex":0.00030144965,"about_ca_system_score_gemma":0.00024241488,"threshold_uncertainty_score":0.9999338},"labels":[],"label_agreement":null},{"id":"W2037324986","doi":"10.1109/tmc.2011.251","title":"Coalition-Based Cooperative Packet Delivery under Uncertainty: A Dynamic Bayesian Coalitional Game","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Bayesian game; Node (physics); Computer network; Network packet; Nash equilibrium; Markov decision process; Game theory; Wireless network; Core (optical fiber); Best response; Distributed computing; Wireless; Sequential game; Markov process; Mathematical optimization; Mathematical economics; Telecommunications","score_opus":0.02807585781632486,"score_gpt":0.25090287717687665,"score_spread":0.2228270193605518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037324986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013436511,0.000035459547,0.9837512,0.0001241142,0.0009148043,0.00041825764,0.00007182054,0.00041903942,0.00082881085],"genre_scores_gemma":[0.98060906,0.000010601185,0.017645357,0.0014152556,0.000056915353,0.000067764464,0.000031314386,0.000028823553,0.0001348901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976092,0.00024563263,0.00050850573,0.00069468684,0.0004091173,0.0005328564],"domain_scores_gemma":[0.99822915,0.0005302414,0.00015390007,0.00056630094,0.0002644693,0.00025595273],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032865469,0.00034090402,0.0003287539,0.00021056981,0.0005332397,0.00014321672,0.0005357255,0.00015935407,0.00033948114],"category_scores_gemma":[0.0000012991121,0.00034560467,0.00020253076,0.000499781,0.00018392742,0.0002860519,0.000007817929,0.00045514453,0.00008699344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009864405,0.000770596,0.000020816065,0.000027720678,0.00011710629,0.00008755338,0.0011874824,0.90489596,0.000104369865,0.0033154516,0.0002816616,0.08909264],"study_design_scores_gemma":[0.0007745809,0.00032655572,0.000056315635,0.00011730054,0.000030027091,0.000038092705,0.0002397093,0.9965335,0.00032686713,0.001046496,0.000107588596,0.00040294332],"about_ca_topic_score_codex":0.00011159585,"about_ca_topic_score_gemma":0.000057373833,"teacher_disagreement_score":0.96717256,"about_ca_system_score_codex":0.00018960114,"about_ca_system_score_gemma":0.00038547898,"threshold_uncertainty_score":0.9998996},"labels":[],"label_agreement":null},{"id":"W2040714707","doi":"10.1109/tmc.2013.36","title":"Two-Tier HetNets with Cognitive Femtocells: Downlink Performance Modeling and Analysis in a Multichannel Environment","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":154,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Femtocell; Heterogeneous network; Computer science; Femto-; Macro; Stochastic geometry; Interference (communication); Computer network; Telecommunications link; Macrocell; Cognitive radio; LTE Advanced; Base station; Rayleigh fading; Transmission (telecommunications); Wireless; Fading; Wireless network; Telecommunications; Channel (broadcasting)","score_opus":0.00782092328080329,"score_gpt":0.20280593295384494,"score_spread":0.19498500967304166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040714707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44740954,0.00007066752,0.5519846,0.0000012352335,0.000036097696,0.00037917303,0.0000033901913,0.00007665914,0.00003861983],"genre_scores_gemma":[0.9857266,0.00009045214,0.013926706,0.000008543382,0.000017242439,0.00017151237,0.00000592178,0.00003635977,0.00001665232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.000026829279,0.00028549344,0.00028511617,0.00011033359,0.00025890913],"domain_scores_gemma":[0.9996458,0.00007380831,0.00003920261,0.00013759214,0.000034902092,0.00006869471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008202008,0.0002026863,0.00024460134,0.00030389015,0.00011070858,0.00003421439,0.000051707717,0.000056835674,0.000025107493],"category_scores_gemma":[7.7865707e-7,0.00020018668,0.000040881067,0.00037289067,0.000027232021,0.0002341626,0.000001670446,0.0002309838,0.000022075676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008657405,0.00003736906,0.00030917692,0.00003588226,0.00010404846,0.0000011972305,0.000888964,0.97827363,0.00025924164,1.5073114e-7,1.3638774e-7,0.020081535],"study_design_scores_gemma":[0.0007247818,0.000064163054,0.000107389445,0.00012256886,0.000093358256,0.000004068473,0.00062292133,0.9964542,0.0015783255,0.0000014160547,6.6939236e-7,0.00022613356],"about_ca_topic_score_codex":0.000052450116,"about_ca_topic_score_gemma":0.000024005325,"teacher_disagreement_score":0.5383171,"about_ca_system_score_codex":0.00010460785,"about_ca_system_score_gemma":0.0000052518863,"threshold_uncertainty_score":0.8163376},"labels":[],"label_agreement":null},{"id":"W2072676840","doi":"10.1109/tmc.2012.62","title":"Resource Allocation with Flexible Channel Cooperation in Cognitive Radio Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Cognitive radio; Resource allocation; Benchmark (surveying); Channel allocation schemes; Channel (broadcasting); Relay; Computer network; Heuristic; Resource management (computing); Optimization problem; Distributed computing; Mathematical optimization; Telecommunications; Algorithm; Wireless; Artificial intelligence","score_opus":0.03409540344574342,"score_gpt":0.2798092778000625,"score_spread":0.24571387435431907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072676840","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027211003,0.00042584672,0.9703936,0.00018013456,0.00028522738,0.0005001595,7.932974e-7,0.0002443952,0.0007588246],"genre_scores_gemma":[0.9959715,0.00013496121,0.0032004658,0.00030308028,0.000107743996,0.000103129736,0.0000071521904,0.000019303608,0.00015265415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984835,0.00028008842,0.00030266758,0.0003338516,0.0001837183,0.000416176],"domain_scores_gemma":[0.9989061,0.00034729452,0.00009732373,0.00041651327,0.000116110044,0.000116691735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059491955,0.00019797105,0.00018877827,0.0002228389,0.00048498964,0.00013031044,0.00038155145,0.000078063684,0.000018799361],"category_scores_gemma":[0.000005629412,0.00019115636,0.000044664674,0.0011059169,0.000051995194,0.0006161293,0.000010434299,0.0004399121,0.000020471862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031111307,0.00028551754,0.000100556514,0.0000048192924,0.00001997425,0.0000010953579,0.002621807,0.8474497,0.00012819708,0.0009894405,0.000052788608,0.14831495],"study_design_scores_gemma":[0.00079187413,0.00019203272,0.0006231126,0.00022420204,0.000010709702,0.000022349637,0.0002101624,0.99224436,0.004740575,0.0000058856426,0.0006355571,0.00029917748],"about_ca_topic_score_codex":0.000007797296,"about_ca_topic_score_gemma":0.000030916228,"teacher_disagreement_score":0.9687605,"about_ca_system_score_codex":0.00012989804,"about_ca_system_score_gemma":0.000046661542,"threshold_uncertainty_score":0.779513},"labels":[],"label_agreement":null},{"id":"W2075829594","doi":"10.1109/tmc.2013.56","title":"Uplink Scheduling in Wireless Networks with Successive Interference Cancellation","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Telecommunications link; Scheduling (production processes); Single antenna interference cancellation; Computational complexity theory; Wireless; Distributed computing; Computer network; Job shop scheduling; Fair-share scheduling; Wireless network; Mathematical optimization; Algorithm; Quality of service; Channel (broadcasting); Telecommunications; Mathematics","score_opus":0.01743833570027899,"score_gpt":0.25568265323445905,"score_spread":0.23824431753418004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2075829594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19303563,0.00008947726,0.80578727,0.00014395072,0.00025483742,0.00036891195,1.7832602e-7,0.000144086,0.00017563973],"genre_scores_gemma":[0.98518676,0.00013108463,0.014320143,0.00016049446,0.000037697468,0.000102389065,0.0000011475039,0.000014649239,0.000045610668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865776,0.00014010475,0.00033120342,0.00041256333,0.00013884415,0.00031952467],"domain_scores_gemma":[0.99878454,0.00032649326,0.00010608908,0.0005137093,0.00018627346,0.000082899205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019698743,0.00019050496,0.00019981868,0.00018196338,0.00034123994,0.00025031634,0.0006690494,0.0000684309,0.000039739713],"category_scores_gemma":[0.000002695276,0.00017596224,0.00004281933,0.0008533358,0.00005280002,0.000491363,0.000015119932,0.00053776935,0.000029108432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004172713,0.00004604317,0.0001393011,0.0000039462448,0.000007037668,0.0000013663557,0.00043441696,0.74227035,0.00027963961,0.0002401693,0.00000394402,0.25656962],"study_design_scores_gemma":[0.00034360753,0.00010164746,0.00042183194,0.00026938674,0.0000028272573,0.000005777379,0.00007726939,0.9967272,0.0018099993,0.00001843208,0.000009569947,0.00021243573],"about_ca_topic_score_codex":0.00008361191,"about_ca_topic_score_gemma":0.00027433378,"teacher_disagreement_score":0.79215115,"about_ca_system_score_codex":0.000131701,"about_ca_system_score_gemma":0.000062261926,"threshold_uncertainty_score":0.7175532},"labels":[],"label_agreement":null},{"id":"W2087478559","doi":"10.1109/tmc.2012.212","title":"Designing Truthful Spectrum Double Auctions with Local Markets","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Shanghai Jiao Tong University","keywords":"Spectrum auction; Computer science; Common value auction; License; Locality; Profit (economics); Revenue; Double auction; Auction theory; Business; Microeconomics; Revenue equivalence; Economics","score_opus":0.05241344568600851,"score_gpt":0.3322993702205266,"score_spread":0.27988592453451805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087478559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.083751105,0.000034836725,0.9113922,0.00018305249,0.000869292,0.00040868358,0.000009074647,0.00024847072,0.0031032874],"genre_scores_gemma":[0.99185526,0.0000033001584,0.0059174174,0.00009753567,0.00025710737,0.00010568481,0.0000014477116,0.000031760548,0.0017304801],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99741125,0.00022669889,0.00056956866,0.0005253647,0.00070831977,0.00055877195],"domain_scores_gemma":[0.997526,0.0011652248,0.00022029708,0.0006737987,0.00013036972,0.00028429303],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017539002,0.00024405637,0.0002753128,0.00035619893,0.0013561865,0.00017309455,0.00042723998,0.00010124233,0.0011429248],"category_scores_gemma":[0.000012450351,0.00019501134,0.00016612039,0.0013995302,0.0002524098,0.00051609625,0.000004822632,0.00044383784,0.001004652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004058663,0.0008921373,0.00041185308,0.000007816923,0.00009763167,0.0000036142512,0.0018454893,0.71581197,0.0011595057,0.0033264612,0.0007708021,0.27526683],"study_design_scores_gemma":[0.009059702,0.0017685341,0.006085831,0.00036047265,0.00058110734,0.0018603519,0.042891078,0.20415558,0.60783195,0.017206958,0.104119234,0.0040791756],"about_ca_topic_score_codex":0.000022185517,"about_ca_topic_score_gemma":0.000016580329,"teacher_disagreement_score":0.9081042,"about_ca_system_score_codex":0.000110109744,"about_ca_system_score_gemma":0.00006210148,"threshold_uncertainty_score":0.9999439},"labels":[],"label_agreement":null},{"id":"W2089946312","doi":"10.1109/tmc.2013.143","title":"Reducing the Positional Error of Connectivity-Based Positioning Algorithms Through Cooperation Between Neighbors","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","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":"York University","funders":"","keywords":"Computer science; Wireless sensor network; Algorithm; Probabilistic logic; Range (aeronautics); Set (abstract data type); Brooks–Iyengar algorithm; Distributed algorithm; Real-time computing; Distributed computing; Key distribution in wireless sensor networks; Computer network; Wireless; Wireless network; Artificial intelligence; Telecommunications","score_opus":0.013968955136682141,"score_gpt":0.24610582933579284,"score_spread":0.2321368741991107,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089946312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18056098,0.0000209176,0.81796646,0.000068244386,0.00035977637,0.00021776134,0.000022811106,0.00048118783,0.00030187127],"genre_scores_gemma":[0.99332595,0.000003178821,0.0064139343,0.00007139328,0.00010057617,0.000029835817,0.000019103129,0.000031047268,0.000005009588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990025,0.00008205061,0.0003350348,0.00019142011,0.00018247723,0.0002065226],"domain_scores_gemma":[0.9990979,0.00047449188,0.00006558029,0.00022939465,0.000107872045,0.00002478766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023863978,0.00016658072,0.00020341018,0.00011542575,0.0004636536,0.000043441923,0.00015432404,0.00011452524,0.000026403066],"category_scores_gemma":[0.000011612713,0.00014874813,0.000098113924,0.0003841753,0.00009746282,0.00013336645,0.0000016587308,0.0003012837,0.000008388348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004127335,0.000026656355,0.00003754316,0.000029478988,0.000031832762,2.461213e-7,0.0002779588,0.97268057,0.0031706651,0.00036480933,0.00002044235,0.023355698],"study_design_scores_gemma":[0.00029624536,0.000116399504,0.00019727346,0.000095295836,0.000032918764,0.0000032418652,0.0001247154,0.74337786,0.25540897,0.00011768579,0.000079454316,0.00014992637],"about_ca_topic_score_codex":0.000031372478,"about_ca_topic_score_gemma":0.000003884815,"teacher_disagreement_score":0.81276494,"about_ca_system_score_codex":0.000080454745,"about_ca_system_score_gemma":0.000022716307,"threshold_uncertainty_score":0.6065773},"labels":[],"label_agreement":null},{"id":"W2094667486","doi":"10.1109/tmc.2013.96","title":"Pricing, Spectrum Sharing, and Service Selection in Two-Tier Small Cell Networks: A Hierarchical Dynamic Game Approach","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":136,"is_retracted":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":"Stackelberg competition; Computer science; Macrocell; Computer network; Game theory; Service provider; Service (business); Resource allocation; Evolutionary game theory; Nash equilibrium; Mathematical optimization; Base station; Business; Microeconomics","score_opus":0.006133857085514785,"score_gpt":0.21001357910320648,"score_spread":0.2038797220176917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094667486","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25380522,0.00009421011,0.7445288,0.0000074152235,0.00020693919,0.00066299253,7.874996e-7,0.0003702135,0.00032344146],"genre_scores_gemma":[0.9830303,0.000049844402,0.01652247,0.000034249966,0.00006418682,0.00014622501,0.0000046091186,0.00007875564,0.00006935567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986291,0.000046079436,0.00038160855,0.00042258226,0.00009198009,0.0004286579],"domain_scores_gemma":[0.9995606,0.00007940694,0.000058211393,0.00017463468,0.000030150835,0.000096974305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013578185,0.00025830223,0.00025003948,0.00027803323,0.00011747459,0.00008350317,0.00013070919,0.00010876215,0.00002024684],"category_scores_gemma":[0.0000014109735,0.00029528313,0.00004419416,0.0006737526,0.000019339363,0.00020306246,0.000004229199,0.0006110452,0.000015962958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046252144,0.00006681974,0.00017822032,0.00011849477,0.000012986316,7.5959895e-7,0.00058228953,0.98911583,0.00084443553,0.00000425879,0.000001922515,0.009069366],"study_design_scores_gemma":[0.00058028137,0.00004477129,0.000289609,0.00008661793,0.000012762954,0.000024044217,0.000110484216,0.9979864,0.0005353032,0.0000434224,0.0000142366425,0.0002721109],"about_ca_topic_score_codex":0.00020282764,"about_ca_topic_score_gemma":0.00028160235,"teacher_disagreement_score":0.7292251,"about_ca_system_score_codex":0.00023722195,"about_ca_system_score_gemma":0.000010975828,"threshold_uncertainty_score":0.99994993},"labels":[],"label_agreement":null},{"id":"W2094800057","doi":"10.1109/tmc.2012.156","title":"Outage Performance of the Primary Service in Spectrum Sharing Networks","year":2012,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","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":"Carleton University","funders":"","keywords":"Outage probability; Computer science; Stochastic geometry; Rayleigh fading; Transmitter; Throughput; Coverage probability; Transmitter power output; Power control; Constraint (computer-aided design); Fading; Node (physics); Computer network; Probability density function; Wireless network; Channel (broadcasting); Wireless; Topology (electrical circuits); Power (physics); Telecommunications; Mathematics; Statistics; Physics; Electrical engineering; Engineering","score_opus":0.01258942923578825,"score_gpt":0.22139247657882974,"score_spread":0.2088030473430415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2094800057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49644852,0.00008438029,0.50203216,0.00006880206,0.0007814763,0.00016502384,4.3648097e-7,0.000051644955,0.00036754],"genre_scores_gemma":[0.9979475,0.00002614061,0.0015176575,0.00031113805,0.00015149581,0.000005543822,2.8933556e-7,0.000015672062,0.000024569572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985541,0.000071807255,0.0003467236,0.00029521962,0.00021675997,0.0005153591],"domain_scores_gemma":[0.99910545,0.00017870222,0.00012678887,0.0004924142,0.000028699407,0.000067951114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045023503,0.00017065815,0.0002218551,0.00011919876,0.00026367017,0.000052183223,0.00057909265,0.0000663875,0.000006688412],"category_scores_gemma":[0.0000012478589,0.0001457812,0.00010608589,0.0010371265,0.00003417533,0.00035978557,0.000024312383,0.00049478054,0.0000059120252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010539369,0.00014795011,0.006005324,0.000032680935,0.000014655318,0.000001446016,0.0009726711,0.9124617,0.00024093744,0.00019774608,0.0000026648106,0.079911664],"study_design_scores_gemma":[0.0002507614,0.000047552658,0.028070834,0.00021818445,0.00000816104,0.00002743006,0.000028792518,0.9675759,0.0035497136,0.000020324484,0.000033380802,0.00016894886],"about_ca_topic_score_codex":0.00004479823,"about_ca_topic_score_gemma":0.000055475928,"teacher_disagreement_score":0.501499,"about_ca_system_score_codex":0.00012688656,"about_ca_system_score_gemma":0.000029195371,"threshold_uncertainty_score":0.5944785},"labels":[],"label_agreement":null},{"id":"W2095143852","doi":"10.1109/tmc.2014.2343636","title":"Joint Indoor Localization and Radio Map Construction with Limited Deployment Load","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":139,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Mitacs","keywords":"Computer science; RSS; Real-time computing; Bottleneck; Floor plan; Software deployment; Construct (python library); Radio propagation; Set (abstract data type); Data mining; Computer network; Embedded system; Telecommunications","score_opus":0.007109315937893406,"score_gpt":0.18885269386622355,"score_spread":0.18174337792833015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095143852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11922408,0.00006148214,0.87867457,0.000021365204,0.00043631656,0.00026922676,0.000002925075,0.0011691066,0.00014094952],"genre_scores_gemma":[0.9947288,0.000047884918,0.0050424696,0.000047937225,0.000040883293,0.000031805863,0.0000034455893,0.000041473195,0.000015294476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908054,0.000032684606,0.00025344797,0.00023026827,0.00018209816,0.00022094639],"domain_scores_gemma":[0.9995699,0.000055649347,0.000045925168,0.00019326565,0.00007856493,0.000056686044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000120953635,0.00019361309,0.00019064246,0.00017871357,0.0002274979,0.00005767572,0.00006568389,0.000118651435,0.000016201433],"category_scores_gemma":[0.000004392136,0.00018219018,0.000035807414,0.00027305234,0.000103163584,0.00009829022,0.000001623258,0.00021798447,0.000014507184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012481523,0.000023977798,0.00014708826,0.000069114576,0.000034301596,0.0000011573608,0.0002158566,0.8817252,0.00066798064,0.00012663782,0.00004939138,0.116926834],"study_design_scores_gemma":[0.00078060495,0.00021168159,0.000093069146,0.000119719814,0.000034964654,0.000040788644,0.00028368089,0.89994353,0.096856445,0.000054777902,0.0013150376,0.00026567894],"about_ca_topic_score_codex":0.000011816787,"about_ca_topic_score_gemma":0.0000149161615,"teacher_disagreement_score":0.87550473,"about_ca_system_score_codex":0.00013850375,"about_ca_system_score_gemma":0.000015324778,"threshold_uncertainty_score":0.74295},"labels":[],"label_agreement":null},{"id":"W2095691144","doi":"10.1109/tmc.2006.85","title":"Queue-aware uplink bandwidth allocation and rate control for polling service in IEEE 802.16 broadband wireless networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":148,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Polling; Computer network; Computer science; Wireless broadband; Quality of service; Bandwidth allocation; Wireless network; Wireless; Telecommunications","score_opus":0.005773359184752195,"score_gpt":0.2109810775830105,"score_spread":0.2052077183982583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095691144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13369143,0.0002790983,0.8641117,0.000031865995,0.0006398769,0.00086176314,0.000012743868,0.00034968453,0.000021788243],"genre_scores_gemma":[0.99603313,0.00014787343,0.0031445322,0.00009062503,0.00025905055,0.0001771815,0.000031492644,0.000095061754,0.000021038037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985331,0.00005287828,0.0004970155,0.0003745673,0.000096574426,0.00044582033],"domain_scores_gemma":[0.99912596,0.00042279527,0.00009224847,0.0001951818,0.00009629167,0.00006750885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002353854,0.0002959818,0.00033481818,0.00017638037,0.00025370374,0.00007179641,0.0001074706,0.00018708989,0.0000043491755],"category_scores_gemma":[0.0000012247096,0.00035143903,0.000063179665,0.00048449592,0.000026271247,0.00021891599,0.0000011053569,0.00033,0.0000019222603],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050841103,0.000042192845,0.00006895461,0.00009164233,0.000023170704,0.0000010767931,0.000077809884,0.9660026,0.0009952105,0.000026899983,0.000016004395,0.032603633],"study_design_scores_gemma":[0.0018469619,0.000045440862,0.00012770867,0.00021682361,0.00003376689,0.000004467073,0.000044360728,0.9934088,0.0038343184,0.00005847167,0.000045205063,0.00033367463],"about_ca_topic_score_codex":0.00008395866,"about_ca_topic_score_gemma":0.00040117206,"teacher_disagreement_score":0.8623417,"about_ca_system_score_codex":0.00022406691,"about_ca_system_score_gemma":0.000018337052,"threshold_uncertainty_score":0.9998938},"labels":[],"label_agreement":null},{"id":"W2096391112","doi":"10.1109/tmc.2009.148","title":"Extended Knowledge-Based Reasoning Approach to Spectrum Sensing for Cognitive Radio","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Institute for Information Industry, Ministry of Science and Technology, Taiwan; Natural Sciences and Engineering Research Council of Canada","keywords":"Cognitive radio; Computer science; Overhead (engineering); Channel (broadcasting); Transmission (telecommunications); Markov chain; Computation; Channel state information; Data transmission; Real-time computing; Algorithm; Computer network; Wireless; Telecommunications; Machine learning","score_opus":0.016887801965010347,"score_gpt":0.26773668433774356,"score_spread":0.25084888237273323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096391112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016054705,0.00010524994,0.97894174,0.00020135047,0.00075890997,0.0012133652,0.000006641179,0.0005805285,0.002137538],"genre_scores_gemma":[0.8331495,0.0000028731088,0.1659349,0.0005212162,0.0002911436,0.0000137783545,0.0000034727852,0.000031857937,0.00005124998],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973259,0.0001559095,0.00042407573,0.0010125221,0.00026340384,0.000818205],"domain_scores_gemma":[0.99819905,0.000773371,0.00012428251,0.00042932527,0.00020544574,0.0002685302],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051889586,0.00038995506,0.000439867,0.00041997415,0.00092760555,0.0003314519,0.0003569572,0.00011225415,0.0000023911184],"category_scores_gemma":[0.000022268492,0.0004242576,0.00030028488,0.0010887454,0.00004671311,0.00020458936,0.000004820656,0.0004204411,0.000017658766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008414213,0.0004453864,0.000001108031,0.000016447675,0.000042878488,0.000011285291,0.0011228542,0.2131308,0.0007100567,0.00073738996,0.00005814533,0.7836395],"study_design_scores_gemma":[0.0011505117,0.000739923,0.000149235,0.00035241176,0.00004332592,0.00007426441,0.00014504147,0.97510177,0.021260967,0.00031735067,0.00014710682,0.0005180913],"about_ca_topic_score_codex":0.000008442147,"about_ca_topic_score_gemma":0.000007928126,"teacher_disagreement_score":0.8170948,"about_ca_system_score_codex":0.00022155666,"about_ca_system_score_gemma":0.00013755873,"threshold_uncertainty_score":0.99982095},"labels":[],"label_agreement":null},{"id":"W2099737489","doi":"10.1109/tmc.2013.129","title":"Mobility and Intruder Prior Information Improving the Barrier Coverage of Sparse Sensor Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":181,"is_retracted":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; Huawei Technologies (Canada)","funders":"","keywords":"Patrolling; Computer science; Wireless sensor network; Heuristic; Scheduling (production processes); Distributed computing; Real-time computing; Location awareness; Computer network; Artificial intelligence; Mathematical optimization","score_opus":0.006099576699461959,"score_gpt":0.19951007876226198,"score_spread":0.19341050206280003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099737489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34850135,0.000031625197,0.6503396,0.0000464715,0.00046031844,0.00044235872,0.000001667148,0.00010632389,0.00007028482],"genre_scores_gemma":[0.98958343,0.000025008549,0.010029731,0.00023050977,0.00005080627,0.000044056,9.682836e-7,0.000011927873,0.00002356279],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983819,0.00015189135,0.00051693915,0.0003210233,0.00027408704,0.00035417522],"domain_scores_gemma":[0.9982471,0.0005838967,0.00024245774,0.000664714,0.000160128,0.00010169847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042243671,0.00020766626,0.00022322503,0.000113324895,0.00043851827,0.00024666646,0.00043937642,0.00011600099,0.000020432173],"category_scores_gemma":[0.000011911789,0.00016362357,0.0000933465,0.00042685255,0.00013556654,0.00075961655,0.000021976068,0.00041906387,0.000013155336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040692175,0.00004229069,0.00003587795,0.000014965128,0.000012380519,3.5677064e-7,0.00048248656,0.7545261,0.00023869862,0.000089093126,0.000011027291,0.24454267],"study_design_scores_gemma":[0.00029179323,0.0000932079,0.0008038989,0.00003783595,0.000010780504,0.000013812683,0.00011251878,0.9951211,0.0032337634,0.000020326243,0.00009291942,0.0001680068],"about_ca_topic_score_codex":0.00013613155,"about_ca_topic_score_gemma":0.000008146869,"teacher_disagreement_score":0.6410821,"about_ca_system_score_codex":0.000054599317,"about_ca_system_score_gemma":0.000035464658,"threshold_uncertainty_score":0.6672375},"labels":[],"label_agreement":null},{"id":"W2108337720","doi":"10.1109/tmc.2006.25","title":"Power saving access points for IEEE 802-11 wireless network infrastructure","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Blackberry (Canada); McMaster University","funders":"Indian Council of Agricultural Research; McMaster University","keywords":"Computer science; Computer network; Inter-Access Point Protocol; Wireless distribution system; IEEE 802.11; Wireless; IEEE 802.11u; Wireless network; IEEE 802.11b-1999; IEEE 802; Backward compatibility; Software deployment; Network allocation vector; Wi-Fi; Telecommunications; Quality of service","score_opus":0.012041216543759309,"score_gpt":0.2713476528080319,"score_spread":0.25930643626427263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108337720","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0651357,0.00003152125,0.92759156,0.00008842229,0.0024796596,0.0039934386,0.000012141631,0.00046214083,0.00020540293],"genre_scores_gemma":[0.964955,0.000003431264,0.03249932,0.000384438,0.00076845934,0.0012588524,0.0000034061143,0.00005402442,0.00007311615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972364,0.00012425934,0.00060556276,0.00080200855,0.0003563334,0.00087549165],"domain_scores_gemma":[0.9981609,0.00054531265,0.00026133802,0.0007219141,0.00017112814,0.00013941614],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045438367,0.00040118105,0.0004215427,0.00015280461,0.00091944303,0.0006608839,0.0013653277,0.0002234552,0.000038045837],"category_scores_gemma":[0.0000020920795,0.00039981,0.0002794748,0.00081654824,0.000064045205,0.00062408135,0.000019217841,0.0004570482,0.000013006839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022500422,0.0000980464,0.0002651466,0.00003458256,0.000023744788,0.000006137438,0.00011037337,0.92390686,0.00027090582,0.0006594228,0.0031349892,0.071467265],"study_design_scores_gemma":[0.0016646765,0.0003717517,0.0023305381,0.00051725,0.000028770732,0.00004752933,0.000025334104,0.9721162,0.010748245,0.0037159082,0.0074053183,0.0010284983],"about_ca_topic_score_codex":0.000056706125,"about_ca_topic_score_gemma":0.00006721876,"teacher_disagreement_score":0.89981925,"about_ca_system_score_codex":0.000121206904,"about_ca_system_score_gemma":0.00009761333,"threshold_uncertainty_score":0.9998454},"labels":[],"label_agreement":null},{"id":"W2109294155","doi":"10.1109/tmc.2006.95","title":"Discovering the architecture of geo-located web services for next generation mobile networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Service-Oriented Architecture and Web Services","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Web service; World Wide Web; Mobile computing; Computer network; Architecture; Middleware (distributed applications); Mobile Web; Database; Mobile technology","score_opus":0.010912450971467157,"score_gpt":0.22634484326684073,"score_spread":0.2154323922953736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109294155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32213464,0.0002611487,0.675901,0.000111123176,0.0007038658,0.00066251575,0.000011376907,0.00016281572,0.000051534458],"genre_scores_gemma":[0.99094355,0.00001697704,0.00799276,0.0003648357,0.00042627394,0.00018182704,0.000020189402,0.00002904722,0.000024531706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981683,0.00010336151,0.0004889274,0.00053118734,0.0002780622,0.0004301672],"domain_scores_gemma":[0.9985407,0.00037974192,0.00023350706,0.00067021174,0.000119196186,0.000056662153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002621671,0.00028543794,0.00026759456,0.00016818702,0.0006431123,0.00023728189,0.00095428684,0.0001105531,0.000006173985],"category_scores_gemma":[4.1643767e-7,0.0002163213,0.00020772855,0.0007479555,0.000049115646,0.00028981952,0.00001781775,0.0003182463,0.0000034471504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015970476,0.00010998211,0.000014863113,0.000076860975,0.000033530447,7.973074e-7,0.00093698216,0.93560404,0.015409584,0.00026181637,0.00001051499,0.04752505],"study_design_scores_gemma":[0.0004209947,0.00021823824,0.00005310795,0.0000894258,0.00003316526,0.000012681544,0.00020835268,0.96855736,0.02869871,0.00017802301,0.0013012656,0.00022866316],"about_ca_topic_score_codex":0.0004562483,"about_ca_topic_score_gemma":0.0009949569,"teacher_disagreement_score":0.66880894,"about_ca_system_score_codex":0.000034344004,"about_ca_system_score_gemma":0.000049861974,"threshold_uncertainty_score":0.88213265},"labels":[],"label_agreement":null},{"id":"W2111586256","doi":"10.1109/tmc.2010.41","title":"Channel Assignment for Multihop Cellular Networks: Minimum Delay","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Lethbridge; Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Cellular network; Network packet; Code division multiple access; Benchmark (surveying); Heuristic; Channel (broadcasting); Duplex (building); Throughput; Transmission delay; Wireless; Telecommunications","score_opus":0.007393418480356151,"score_gpt":0.21856210153641858,"score_spread":0.21116868305606243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111586256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030222062,0.00008276246,0.9645227,0.0000076004567,0.0036943117,0.0007649481,0.0000118665785,0.00063504744,0.000058668007],"genre_scores_gemma":[0.97008204,0.000037485268,0.029044893,0.000030108586,0.00040857203,0.00022612966,0.000014306922,0.00010141442,0.00005503349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879557,0.000017873184,0.00032627667,0.00029668742,0.0001282698,0.00043529854],"domain_scores_gemma":[0.99923307,0.00025686616,0.000055760658,0.00028351962,0.000061279905,0.0001095054],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00014227473,0.0002503566,0.00021193619,0.000105025385,0.0002774379,0.000039157294,0.00015362356,0.00017076137,0.000025377989],"category_scores_gemma":[0.0000025748732,0.0002852026,0.00012415615,0.00022161685,0.00003268134,0.00011346083,0.000001471354,0.00045234044,0.000011948976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011215755,0.000058675247,0.0000010461782,0.000023500628,0.000032480162,0.0000015923671,0.00011712334,0.9495335,0.0066840807,0.000005461168,0.00009270027,0.04343861],"study_design_scores_gemma":[0.00052378466,0.00006932845,0.0000019549302,0.00003773702,0.00002478073,0.000004037601,0.000043796575,0.97203076,0.026233051,0.000016519158,0.00073140085,0.00028284706],"about_ca_topic_score_codex":0.000001601389,"about_ca_topic_score_gemma":0.000010323368,"teacher_disagreement_score":0.93986,"about_ca_system_score_codex":0.00007360083,"about_ca_system_score_gemma":0.000009745017,"threshold_uncertainty_score":0.99996},"labels":[],"label_agreement":null},{"id":"W2113234775","doi":"10.1109/tmc.2010.173","title":"Flexible Broadcasting of Scalable Video Streams to Heterogeneous Mobile Devices","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Multimedia Communication and Technology","field":"Social Sciences","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Testbed; Broadcasting (networking); Mobile device; Computer network; Scalable Video Coding; Energy consumption; Channel (broadcasting); Efficient energy use; Bitstream; Real-time computing; Decoding methods; Telecommunications","score_opus":0.02226645719882147,"score_gpt":0.327763971506339,"score_spread":0.30549751430751754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113234775","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.8815002,0.00005015225,0.112152725,0.00014475135,0.00085192395,0.00066039676,0.0000099670515,0.00044385905,0.004186015],"genre_scores_gemma":[0.9882692,0.000021999324,0.01122278,0.00009719289,0.000070208196,0.00008823257,0.0000012518262,0.000019493993,0.00020965257],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9986028,0.00011856083,0.00036474623,0.00028871352,0.0002590243,0.00036612668],"domain_scores_gemma":[0.9985034,0.000520914,0.00013976597,0.0005119801,0.00016461078,0.00015933519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005076295,0.00013831841,0.00022475825,0.00023343305,0.000742496,0.000049190778,0.0005848721,0.00017637236,0.00042846595],"category_scores_gemma":[0.000039766877,0.00015133095,0.00010200367,0.00061014696,0.00023305854,0.00009208386,0.000009899971,0.00044012966,0.0000930098],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013361235,0.00031416622,0.00030681436,0.000018388746,0.000027740576,0.0000015162559,0.0044363923,0.07381706,0.017075274,0.00018383245,0.000029318227,0.90377617],"study_design_scores_gemma":[0.0016491843,0.0011212368,0.00036390184,0.0003777692,0.00011191851,0.000041665477,0.013005882,0.10136396,0.75126857,0.000355311,0.12898159,0.0013589923],"about_ca_topic_score_codex":0.001407629,"about_ca_topic_score_gemma":0.0030787284,"teacher_disagreement_score":0.9024171,"about_ca_system_score_codex":0.000048897342,"about_ca_system_score_gemma":0.000101860955,"threshold_uncertainty_score":0.6171097},"labels":[],"label_agreement":null},{"id":"W2113996774","doi":"10.1109/tmc.2010.251","title":"Wireless Fountain Coding with IEEE 802.11e Block ACK for Media Streaming in Wireline-cum-WiFi Networks: A Performance Study","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Wireless network; Automatic repeat request; Wireless; Linear network coding; Wireline; Real-time computing; Telecommunications link; Hybrid automatic repeat request; Telecommunications","score_opus":0.044597579841522475,"score_gpt":0.2693348494283819,"score_spread":0.2247372695868594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113996774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4182318,0.00004270467,0.5801461,0.000014502565,0.00043502785,0.00085547916,0.000001500014,0.00017865354,0.0000942657],"genre_scores_gemma":[0.9867241,0.00015870902,0.012502084,0.00010086006,0.000112604874,0.000304055,0.0000020440032,0.0000443633,0.000051185445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974404,0.00024900137,0.0006570113,0.00072411203,0.0003034496,0.0006260003],"domain_scores_gemma":[0.9977605,0.000740163,0.00021612922,0.0009015511,0.00024457928,0.00013711474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00091005675,0.00038083908,0.00043735138,0.00040487462,0.0008062397,0.0001604793,0.0011474892,0.000097810174,0.000008534127],"category_scores_gemma":[0.0000070631827,0.00036275756,0.000100187164,0.0013991542,0.0000820489,0.00049993215,0.000024810184,0.0006152112,0.000008051518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014081279,0.0012683424,0.0024732538,0.000041789026,0.00009326873,0.000014832008,0.01705128,0.65042526,0.00027733418,0.0002601173,0.000035316694,0.3279184],"study_design_scores_gemma":[0.0017177137,0.0009598459,0.0013552948,0.00037745252,0.000026455356,0.000017054437,0.0010802493,0.99236745,0.0015856622,0.0000074554277,0.00004673961,0.00045865998],"about_ca_topic_score_codex":0.00002924819,"about_ca_topic_score_gemma":0.0005359778,"teacher_disagreement_score":0.5684923,"about_ca_system_score_codex":0.0001746463,"about_ca_system_score_gemma":0.00009959751,"threshold_uncertainty_score":0.99988246},"labels":[],"label_agreement":null},{"id":"W2114499779","doi":"10.1109/tmc.2006.29","title":"Call admission control for voice/data integration, in.broadband, wireless networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Handover; Call Admission Control; Quality of service; Wireless broadband; Bandwidth (computing); Mobile broadband; Bandwidth allocation; Broadband networks; Wireless; Wireless network; Broadband; Telecommunications","score_opus":0.026935046007550024,"score_gpt":0.3015962590009492,"score_spread":0.2746612129933992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114499779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007735009,0.00024153956,0.9895929,0.00042574148,0.0005228941,0.0010933847,0.000018102868,0.00026214635,0.00010824748],"genre_scores_gemma":[0.9812887,0.000053852767,0.01792157,0.00013724683,0.00017973447,0.00019016757,0.000038166687,0.00003141351,0.00015916264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973634,0.00030403075,0.00065724726,0.0007375126,0.0003588074,0.0005789952],"domain_scores_gemma":[0.9962635,0.0013812768,0.0001663255,0.0018577663,0.0002034701,0.00012764052],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009890049,0.0002508971,0.0003227742,0.00028520953,0.0005236529,0.00026983398,0.0024716859,0.00017453966,0.0000072583007],"category_scores_gemma":[0.00001292123,0.0002476808,0.00010692833,0.00087064976,0.00007151519,0.00053217856,0.000035159104,0.0006706063,0.000014944014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034449204,0.00023763282,0.00007277744,0.000009971215,0.00001003098,0.0000022024185,0.00006779782,0.73371553,0.00019449682,0.00046763787,0.00058592675,0.26460153],"study_design_scores_gemma":[0.0013421904,0.00010926475,0.00036613978,0.00014923226,0.00000786581,0.0000069098937,0.000019700996,0.9956734,0.0007327367,0.0001513077,0.0011948715,0.00024634803],"about_ca_topic_score_codex":0.00017206167,"about_ca_topic_score_gemma":0.000397051,"teacher_disagreement_score":0.97355366,"about_ca_system_score_codex":0.00016544086,"about_ca_system_score_gemma":0.00012511513,"threshold_uncertainty_score":0.99999756},"labels":[],"label_agreement":null},{"id":"W2114795108","doi":"10.1109/tmc.2007.70769","title":"Adaptive Cluster-Based Data Collection in Sensor Networks with Direct Sink Access","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Wireless sensor network; Energy consumption; Network packet; Cluster analysis; Computer network; Random access; Sink (geography); Robustness (evolution); Efficient energy use; Access control; Distributed computing; Data collection; Data access; Real-time computing","score_opus":0.039956022929606684,"score_gpt":0.26477423122594035,"score_spread":0.22481820829633367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2114795108","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0708997,0.000047638518,0.926763,0.00006904783,0.000829978,0.0005412396,0.000004314208,0.00049359066,0.00035149982],"genre_scores_gemma":[0.9357699,0.000026360112,0.0637212,0.00022336136,0.000086949985,0.000041350835,0.000009353454,0.000041712297,0.00007980318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99704885,0.00033789515,0.00044787826,0.0011070067,0.00044419008,0.0006141707],"domain_scores_gemma":[0.99732786,0.00085419696,0.00019053006,0.0013654983,0.0001279226,0.0001339789],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003712163,0.0003468987,0.00038006902,0.00042710215,0.0007032103,0.00017121446,0.0015004748,0.00015847677,0.000006667037],"category_scores_gemma":[0.000005325549,0.0003351589,0.00007569388,0.0023355342,0.00013337703,0.0005967169,0.000031379986,0.00064493594,0.000007637197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013091312,0.00034282307,0.00016784017,0.0000061137785,0.000025140529,0.00007112772,0.00019157915,0.98441714,0.000014644882,0.0000037573645,0.00012505219,0.0145038385],"study_design_scores_gemma":[0.0011215298,0.00034566585,0.00051000406,0.00016774607,0.000013212568,0.000072459756,0.000027137801,0.99613214,0.0011515637,7.335584e-7,0.00007413827,0.0003836963],"about_ca_topic_score_codex":0.00021977248,"about_ca_topic_score_gemma":0.00035488515,"teacher_disagreement_score":0.8648702,"about_ca_system_score_codex":0.00021897285,"about_ca_system_score_gemma":0.00016641611,"threshold_uncertainty_score":0.99991006},"labels":[],"label_agreement":null},{"id":"W2115189853","doi":"10.1109/tmc.2010.43","title":"Optimal Cooperative Relaying Schemes in IR-UWB Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"University of Melbourne; University of Cambridge","keywords":"Computer science; Computer network; Network packet; Throughput; Fading; Overhead (engineering); Relay; Wireless; Wireless network; Cooperative diversity; Diversity gain; Interval (graph theory); Distributed computing; Channel (broadcasting); Power (physics); Telecommunications","score_opus":0.01948486199234165,"score_gpt":0.27817714473698946,"score_spread":0.2586922827446478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115189853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16078956,0.00013753338,0.83691996,0.00018116942,0.0009686264,0.0003034331,7.5033086e-7,0.00024594658,0.000453016],"genre_scores_gemma":[0.95259607,0.00012784195,0.046767272,0.0002608146,0.00008337693,0.00005871912,0.0000013557968,0.000019523866,0.00008502055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982736,0.00019497501,0.00042021065,0.0005078652,0.00018762091,0.00041574254],"domain_scores_gemma":[0.99844235,0.00045389068,0.00009510109,0.0007730722,0.00012067494,0.00011490569],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005458526,0.00023707739,0.00024835285,0.00022820542,0.000663811,0.00023632537,0.00093149213,0.00012930202,0.0000609312],"category_scores_gemma":[0.00001221001,0.0002453836,0.00009695405,0.001003223,0.00008693981,0.00041595055,0.00002702584,0.0014213695,0.000037203197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000068385443,0.0001410163,0.000057113903,0.0000028003758,0.000016801727,0.000006183962,0.0008670434,0.8391181,0.0019021871,0.0023386627,0.00003674387,0.1555065],"study_design_scores_gemma":[0.00046306342,0.00009042679,0.00014746148,0.000068961774,0.0000038797375,0.000017855087,0.000068002555,0.99244744,0.004900016,0.000011254051,0.0015025606,0.00027910707],"about_ca_topic_score_codex":0.000007772175,"about_ca_topic_score_gemma":0.000099774465,"teacher_disagreement_score":0.7918065,"about_ca_system_score_codex":0.00006802984,"about_ca_system_score_gemma":0.00007588282,"threshold_uncertainty_score":0.9999998},"labels":[],"label_agreement":null},{"id":"W2119545161","doi":"10.1109/tmc.2010.254","title":"Lifetime Analysis of Random Event-Driven Clustered Wireless Sensor Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Wireless sensor network; Voronoi diagram; Network packet; Probabilistic logic; Energy consumption; Event (particle physics); Real-time computing; Computer network; Wireless network; Wireless; Telecommunications; Artificial intelligence; Engineering","score_opus":0.0160951400112579,"score_gpt":0.2362901031820996,"score_spread":0.2201949631708417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119545161","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1856811,0.000047206242,0.812524,0.000012653409,0.0008881789,0.00029924596,0.000005389359,0.0002997989,0.00024240775],"genre_scores_gemma":[0.97258294,0.000033019624,0.027080407,0.000084252686,0.000065528286,0.000023945628,0.000004282501,0.000033460154,0.0000921593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997019,0.00035430302,0.0008393535,0.00076211564,0.00043670723,0.00058850605],"domain_scores_gemma":[0.99758464,0.00057237234,0.00040746713,0.0010757197,0.00017096178,0.00018882078],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004256652,0.00035036032,0.0007557737,0.0007146246,0.0003142118,0.00006587775,0.0010106129,0.00020254601,0.000059895992],"category_scores_gemma":[0.000003285929,0.00035430584,0.0006221515,0.0027306112,0.000121289035,0.00019368577,0.00001916144,0.00043857488,0.000015131789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065589826,0.0003601415,0.00013525241,0.0000092791215,0.00067138433,0.000013420088,0.0010335386,0.9702733,0.00027996936,0.00011763715,0.0000109262955,0.027029525],"study_design_scores_gemma":[0.00095721165,0.00017291566,0.00035159363,0.00007507601,0.00037242676,0.000007967981,0.000060294686,0.9923298,0.0053186817,0.000003850714,0.000017036145,0.0003331534],"about_ca_topic_score_codex":0.000092314556,"about_ca_topic_score_gemma":0.000049481725,"teacher_disagreement_score":0.78690183,"about_ca_system_score_codex":0.00007502919,"about_ca_system_score_gemma":0.000040801002,"threshold_uncertainty_score":0.99989086},"labels":[],"label_agreement":null},{"id":"W2120051217","doi":"10.1109/tmc.2006.72","title":"Reliable packet transmissions in multipath routed wireless networks","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":65,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Network packet; Load balancing (electrical power); Source routing; Computer network; Erasure; Erasure code; Path (computing); Multipath propagation; Distributed computing; Algorithm; Decoding methods; Routing protocol; Routing table","score_opus":0.016994762535962084,"score_gpt":0.25754107185144776,"score_spread":0.24054630931548568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120051217","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05569963,0.0002546593,0.94194055,0.00022423964,0.00048385758,0.00037758928,0.0000019111937,0.00037508502,0.00064249185],"genre_scores_gemma":[0.9878331,0.00025952503,0.011363631,0.00016891336,0.00006309972,0.00005972599,0.000004437912,0.000022980148,0.00022458579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980982,0.0002132085,0.0005101039,0.00050278945,0.00020761519,0.000468078],"domain_scores_gemma":[0.99865794,0.000315958,0.00009516766,0.0007505732,0.00007912707,0.00010120415],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039474666,0.00024185248,0.00027035206,0.0002449483,0.00057200604,0.00015281556,0.0007930616,0.000116367984,0.00002935315],"category_scores_gemma":[0.0000019647168,0.0002474865,0.00012342473,0.0012736595,0.000049105103,0.00028804535,0.000011541434,0.00061886455,0.000021299842],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000700528,0.00027755415,0.00011000766,0.0000045519464,0.0000062067757,0.0000071192408,0.0002970688,0.83203155,0.00052097824,0.0007823319,0.00013531756,0.16582029],"study_design_scores_gemma":[0.0006944814,0.000064569846,0.00071450294,0.0001606661,0.000004928967,0.000008166201,0.000027485388,0.9944925,0.0021361152,0.000074888056,0.0013409825,0.00028071878],"about_ca_topic_score_codex":0.00008964695,"about_ca_topic_score_gemma":0.0002442965,"teacher_disagreement_score":0.9321335,"about_ca_system_score_codex":0.00012890888,"about_ca_system_score_gemma":0.000059552418,"threshold_uncertainty_score":0.99999774},"labels":[],"label_agreement":null},{"id":"W2120668076","doi":"10.1109/tmc.2010.68","title":"On the Design of Opportunistic MAC Protocols for Multihop Wireless ; Networks with Beamforming Antennas","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","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":"Toronto Metropolitan University","funders":"University of Toronto; Cairo University; University of Texas at Arlington","keywords":"Exponential backoff; Computer science; Computer network; Beamforming; Network packet; Overhead (engineering); Wireless; Wireless network; Throughput; Transmission (telecommunications); Reuse; Node (physics); Telecommunications; Engineering","score_opus":0.03523551401724262,"score_gpt":0.28385177730166516,"score_spread":0.24861626328442255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120668076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028142182,0.000001688154,0.9479785,0.00007024336,0.0003069388,0.04863588,0.0000068323075,0.00014985433,0.000035821402],"genre_scores_gemma":[0.879027,0.0000013602182,0.0723984,0.00016313126,0.000110242436,0.048222292,0.0000010455573,0.00003781955,0.000038699363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815935,0.00012405809,0.0004515987,0.00048242472,0.00029766368,0.0004848862],"domain_scores_gemma":[0.9965408,0.0020549598,0.00030148018,0.0007958224,0.00019109569,0.00011583124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091964664,0.0002864531,0.00033039384,0.000102795595,0.00065430114,0.00016102911,0.0009357242,0.00013095235,0.000012300393],"category_scores_gemma":[0.000008869712,0.00019302189,0.0001344714,0.00042517146,0.00013313854,0.00016018115,0.00000817164,0.000643826,0.0000026544717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015501167,0.00022910332,0.000005537134,0.00004652901,0.000035312612,0.0000040130835,0.00019620215,0.8415596,0.0020983852,0.0032544746,0.000054220192,0.15236162],"study_design_scores_gemma":[0.00072678074,0.0011281802,0.0000074817135,0.0004134959,0.000012826129,0.000018119033,0.000028246373,0.98820734,0.008728527,0.000202354,0.00027812566,0.000248547],"about_ca_topic_score_codex":0.000010342355,"about_ca_topic_score_gemma":0.000010416114,"teacher_disagreement_score":0.8762128,"about_ca_system_score_codex":0.000025825653,"about_ca_system_score_gemma":0.00012514913,"threshold_uncertainty_score":0.7871204},"labels":[],"label_agreement":null},{"id":"W2120869623","doi":"10.1109/tmc.2009.39","title":"Analysis of Enhanced Collision Avoidance Scheme Proposed for IEEE 802.11e-Enhanced Distributed Channel Access Protocol","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Computer science; Throughput; Computer network; Channel (broadcasting); Network packet; Protocol (science); Queue; Collision avoidance; Scheme (mathematics); Markov chain; Capture effect; Markov process; Collision; Real-time computing; Wireless; Telecommunications","score_opus":0.025073298572393283,"score_gpt":0.3333150148199676,"score_spread":0.30824171624757435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120869623","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0131089045,0.000004472713,0.8827073,0.00006338195,0.00026602967,0.10346742,0.000056555058,0.0002842995,0.000041627947],"genre_scores_gemma":[0.8951593,0.0000020089446,0.017592898,0.000101492624,0.00008995472,0.08698473,0.000011567688,0.000020839245,0.000037209127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687463,0.00014893923,0.0009132921,0.0009372419,0.00048909313,0.00063679763],"domain_scores_gemma":[0.99745125,0.00038142115,0.0005914713,0.0009044421,0.000507423,0.00016398575],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005530575,0.00039510123,0.000776398,0.0004406752,0.0005760293,0.00027524808,0.0013899697,0.00019496222,0.000011593977],"category_scores_gemma":[0.000012076849,0.00037646267,0.00048510384,0.0033490008,0.00006761629,0.00059604057,0.000011504536,0.0003518657,0.0000037582445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020370024,0.0005904935,0.000003816471,0.00010326203,0.0001838528,0.000001316115,0.00030135398,0.89743865,0.031638082,0.000059240014,0.000052713924,0.06942352],"study_design_scores_gemma":[0.001114763,0.0007681001,0.00011752571,0.00019880067,0.00005961939,6.453912e-7,0.000012287968,0.5881158,0.40913272,0.00011178599,0.000087049666,0.00028091122],"about_ca_topic_score_codex":0.000012227001,"about_ca_topic_score_gemma":0.000014598485,"teacher_disagreement_score":0.8820504,"about_ca_system_score_codex":0.00013207557,"about_ca_system_score_gemma":0.00014206486,"threshold_uncertainty_score":0.99986875},"labels":[],"label_agreement":null},{"id":"W2123545238","doi":"10.1109/tmc.2013.106","title":"An Optimization Framework for XOR-Assisted Cooperative Relaying in Cellular Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Linear network coding; Cooperative diversity; Relay; Maximization; Optimization problem; Bipartite graph; Resource allocation; Coding (social sciences); Mathematical optimization; Channel (broadcasting); Computer network; Theoretical computer science; Power (physics); Algorithm; Mathematics; Fading","score_opus":0.027734281654068244,"score_gpt":0.28793953124787675,"score_spread":0.26020524959380853,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123545238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010606916,0.0001562513,0.9869474,0.00022624814,0.0005834939,0.0011164375,0.0000012269511,0.0002836831,0.000078326695],"genre_scores_gemma":[0.7408381,0.00008323679,0.25842988,0.00027884092,0.000055768516,0.0002650386,0.000005752925,0.000021327507,0.00002200114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981398,0.00033195387,0.0004661379,0.0005255744,0.00014986572,0.00038669488],"domain_scores_gemma":[0.9980378,0.00072466343,0.0001295719,0.00075367105,0.00023349297,0.00012075911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041308222,0.0002290343,0.00025259977,0.00021513403,0.00072695594,0.0003817019,0.0007616685,0.00015514363,0.0000580528],"category_scores_gemma":[0.000014881939,0.00024093031,0.000090908856,0.0009785539,0.000044482233,0.0006965892,0.000011178539,0.00053320045,0.000014418963],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005418247,0.00016773939,0.000013362806,0.0000043783793,0.000010612551,7.211492e-7,0.00065939437,0.8618472,0.0004194888,0.0020442181,0.000017960347,0.13480948],"study_design_scores_gemma":[0.00041445394,0.0002137143,0.000085140506,0.00013515096,0.000005590812,0.0000026741843,0.00012414204,0.9969605,0.0015691804,0.00016095431,0.000059594862,0.00026888205],"about_ca_topic_score_codex":0.000013622717,"about_ca_topic_score_gemma":0.000016973334,"teacher_disagreement_score":0.7302312,"about_ca_system_score_codex":0.00013685999,"about_ca_system_score_gemma":0.00005088845,"threshold_uncertainty_score":0.9824853},"labels":[],"label_agreement":null},{"id":"W2124050329","doi":"10.1109/tmc.2011.77","title":"Gossip-Enabled Stochastic Channel Negotiation for Cognitive Radio Ad Hoc Networks","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Wireless ad hoc network; Cognitive radio; Computer network; Control channel; Channel (broadcasting); Vehicular ad hoc network; Negotiation; Overhead (engineering); Markov chain; Wireless network; Distributed computing; Gossip; Mobile ad hoc network; Markov process; Wireless; Telecommunications; Network packet; Telecommunications link","score_opus":0.023960685889079986,"score_gpt":0.24128058583961667,"score_spread":0.2173198999505367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124050329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014467351,0.0004709315,0.9813103,0.000035017274,0.001973498,0.0011186129,0.000008809044,0.0004247438,0.0001907124],"genre_scores_gemma":[0.9880391,0.000050653627,0.011250408,0.00019038744,0.00026549905,0.000092368944,0.0000053648546,0.000043930744,0.00006228993],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977902,0.00011955416,0.00042909142,0.0007449083,0.00022166509,0.00069457776],"domain_scores_gemma":[0.99829346,0.0007759107,0.0002034181,0.00033525878,0.00021606378,0.00017590556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037562323,0.00033521763,0.00035832333,0.00024158036,0.0008320613,0.00017099777,0.00035784647,0.00014337947,0.000016665183],"category_scores_gemma":[0.000012442506,0.00035605358,0.0002501462,0.00063643313,0.00007401994,0.00038478017,0.0000075058956,0.0004092841,0.00001750497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013712152,0.0002720483,0.0000017362222,0.000017011567,0.000118156895,0.000012090841,0.0030819296,0.4783918,0.0000568089,0.0002686094,0.000036499885,0.5176062],"study_design_scores_gemma":[0.001231684,0.00062386645,0.00015170591,0.00021111421,0.000068998525,0.000045849756,0.00020847059,0.9952537,0.0012721117,0.00048873044,0.000027607586,0.00041620166],"about_ca_topic_score_codex":0.000010842425,"about_ca_topic_score_gemma":0.000026641754,"teacher_disagreement_score":0.9735717,"about_ca_system_score_codex":0.00012541587,"about_ca_system_score_gemma":0.00006874991,"threshold_uncertainty_score":0.99988914},"labels":[],"label_agreement":null},{"id":"W2132128535","doi":"10.1109/tmc.2007.1051","title":"Optimal and Approximate Mobility-Assisted Opportunistic Scheduling in Cellular Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scheduling (production processes); Macrocell; Dynamic priority scheduling; Round-robin scheduling; Fair-share scheduling; Distributed computing; Algorithm; Computer network; Mathematical optimization; Quality of service; Base station; Mathematics","score_opus":0.011444725564159252,"score_gpt":0.23036018100810307,"score_spread":0.2189154554439438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132128535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33837488,0.0001353129,0.6604739,0.0000018847774,0.00033568253,0.00028147025,0.00000200585,0.00031904964,0.00007582049],"genre_scores_gemma":[0.95386636,0.000090953305,0.04585167,0.000013001767,0.000072077244,0.000024345964,0.000008944586,0.000063197665,0.000009474224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853927,0.000033217442,0.00048235033,0.00033418313,0.00012911823,0.00048185396],"domain_scores_gemma":[0.9993123,0.00025002332,0.000055187804,0.00022448518,0.000029549974,0.00012847374],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043960885,0.00024380485,0.00025995137,0.0002140082,0.00017042572,0.000040632218,0.000097769545,0.00015104038,0.000011336475],"category_scores_gemma":[0.0000030683188,0.00029523522,0.000052277268,0.00048782866,0.000059340346,0.00013285436,0.0000027663039,0.0005111469,0.0000023677162],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019118628,0.000068274836,0.000046970104,0.00004953577,0.0000147794435,0.000020092397,0.00012467836,0.9405582,0.00092493196,0.000017988754,5.5802934e-7,0.05815489],"study_design_scores_gemma":[0.0004251016,0.000042655953,0.0001374071,0.00011695182,0.000015054828,0.000013759579,0.00015164002,0.99621207,0.002597444,0.000008995394,0.000014287826,0.00026465146],"about_ca_topic_score_codex":0.000004687817,"about_ca_topic_score_gemma":0.00001398591,"teacher_disagreement_score":0.61549145,"about_ca_system_score_codex":0.00015397996,"about_ca_system_score_gemma":0.000010777189,"threshold_uncertainty_score":0.99995},"labels":[],"label_agreement":null},{"id":"W2134298603","doi":"10.1109/tmc.2008.74","title":"Utility-Based Rate-Controlled Parallel Wireless Transmission of Multimedia Streams with Multiple Importance Levels","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Quality of service; Wireless; Computer network; Reliability (semiconductor); Resource allocation; Exploit; Multimedia; Distributed computing; Power (physics); Telecommunications","score_opus":0.013158122243363756,"score_gpt":0.21928404000324997,"score_spread":0.2061259177598862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134298603","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37059206,0.00007422725,0.62817603,0.0000038208427,0.0001289766,0.00064061646,0.0000172224,0.00033233906,0.000034690525],"genre_scores_gemma":[0.9315337,0.00007001918,0.068137854,0.000014109105,0.000034315046,0.00009047721,0.000014757602,0.00008172045,0.000023070308],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982839,0.00008154386,0.00062281475,0.0003650408,0.00025905183,0.00038762263],"domain_scores_gemma":[0.9986635,0.0005860421,0.00014892536,0.00034996468,0.00012090656,0.00013067375],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00013594203,0.00035250085,0.00058765674,0.00015390427,0.00024289142,0.000010165212,0.00016383117,0.00013946561,0.000052082134],"category_scores_gemma":[0.0000037935326,0.00032505972,0.00016197834,0.00044644714,0.00011848372,0.00015651976,7.445647e-7,0.00035786274,0.0000036646816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004228062,0.00018947698,0.00068872946,0.000072440926,0.00007499282,0.000011054642,0.00027993767,0.94238657,0.004618467,6.0409934e-7,0.0000062182285,0.0512487],"study_design_scores_gemma":[0.0063465154,0.00013432802,0.0006846789,0.00017741918,0.000041514704,0.0000067321207,0.000046853092,0.94775724,0.04447831,0.0000022389931,0.000019488705,0.00030465057],"about_ca_topic_score_codex":0.000010634116,"about_ca_topic_score_gemma":0.000023266333,"teacher_disagreement_score":0.56094164,"about_ca_system_score_codex":0.00006390906,"about_ca_system_score_gemma":0.0000643213,"threshold_uncertainty_score":0.9999201},"labels":[],"label_agreement":null},{"id":"W2134537668","doi":"10.1109/tmc.2005.74","title":"A mobility prediction architecture based on contextual knowledge and spatial conceptual maps","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","cited_by":134,"is_retracted":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; Component (thermodynamics); Context (archaeology); A priori and a posteriori; Process (computing); Data mining; Artificial intelligence; Dempster–Shafer theory; Information retrieval","score_opus":0.01696949112275252,"score_gpt":0.2824695090405268,"score_spread":0.2655000179177743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2134537668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28458863,0.000046638444,0.7122755,0.00025376887,0.00028296452,0.0005737967,0.00007026038,0.00022939812,0.0016790576],"genre_scores_gemma":[0.9986923,0.0000074555633,0.00028280992,0.0002567809,0.00045877974,0.00006724349,0.000012928498,0.000015045064,0.0002066571],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785006,0.0005917759,0.000359736,0.00051385444,0.0003504976,0.00033408662],"domain_scores_gemma":[0.9983894,0.0009463283,0.00008700944,0.00027592626,0.00013929047,0.000162021],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00092231797,0.00020016578,0.0002450495,0.00019356523,0.0013914306,0.000079915684,0.00016347473,0.00018231545,0.0004836571],"category_scores_gemma":[0.000042785057,0.0002070349,0.00016435614,0.00033738092,0.00064404804,0.00008954979,0.0000018718941,0.0005089688,0.000059951486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171087,0.00068582647,0.00014615095,0.000015451225,0.00002840813,7.385361e-7,0.013900565,0.49548122,0.00007263164,0.00013293356,0.00006616745,0.4893982],"study_design_scores_gemma":[0.002241086,0.0009905389,0.0012540792,0.00017508458,0.00016943159,0.0000023942855,0.007978141,0.95943034,0.0020261763,0.0001889578,0.024920199,0.0006235731],"about_ca_topic_score_codex":0.0015248884,"about_ca_topic_score_gemma":0.0125880325,"teacher_disagreement_score":0.7141037,"about_ca_system_score_codex":0.00026314415,"about_ca_system_score_gemma":0.00023920771,"threshold_uncertainty_score":0.9999086},"labels":[],"label_agreement":null},{"id":"W2137663561","doi":"10.1109/tmc.2011.229","title":"Exploiting Spectrum Heterogeneity in Dynamic Spectrum Market","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":31,"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":"Defense Advanced Research Projects Agency; Harbin Institute of Technology; University of Toronto; University of Wisconsin-Madison; National Science Foundation","keywords":"Spectrum management; Computer science; Duopoly; Cognitive radio; Frequency allocation; Lease; Stochastic game; Wireless; Telecommunications; Computer network; Microeconomics; Business; Economics","score_opus":0.02058372274088885,"score_gpt":0.24191357805974723,"score_spread":0.22132985531885838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137663561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27609676,0.000077521036,0.7205421,0.000057590463,0.0008089485,0.00028001535,0.000002235365,0.00030154816,0.001833336],"genre_scores_gemma":[0.988772,0.000045428682,0.010818323,0.00018834644,0.000077655546,0.000015363454,5.9787254e-7,0.000036610232,0.000045692588],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973383,0.00020796394,0.00052687153,0.0008350887,0.00027808393,0.00081370014],"domain_scores_gemma":[0.99883115,0.00024299187,0.000143298,0.0006015911,0.000029028039,0.00015195535],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052007916,0.00033877918,0.00036139364,0.00042351286,0.00037975877,0.00013798474,0.000571832,0.000104117564,0.00012371785],"category_scores_gemma":[0.0000042241263,0.00037495533,0.00020966218,0.000899104,0.00006681926,0.00037931406,0.0000156333,0.000617379,0.000044579912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018579933,0.0018576812,0.0013515602,0.00008990586,0.00021862212,0.0009781206,0.0072103105,0.17793164,0.0019201521,0.0012779421,0.000058367477,0.8069199],"study_design_scores_gemma":[0.0006162234,0.00027805025,0.004592831,0.00018430944,0.00001253531,0.00016145028,0.0001525902,0.9728804,0.019404702,0.0011511082,0.000038215643,0.00052757707],"about_ca_topic_score_codex":0.00013224834,"about_ca_topic_score_gemma":0.0005746061,"teacher_disagreement_score":0.8063923,"about_ca_system_score_codex":0.00025496725,"about_ca_system_score_gemma":0.000052407817,"threshold_uncertainty_score":0.99987024},"labels":[],"label_agreement":null},{"id":"W2137940221","doi":"10.1109/tmc.2010.40","title":"Localized Multicast: Efficient and Distributed Replica Detection in Large-Scale Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Security in Wireless Sensor Networks","field":"Computer Science","cited_by":95,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Wuhan University; National University of Singapore; George Mason University","keywords":"Multicast; Computer science; Node (physics); Computer network; Replica; Distributed computing; Replication (statistics); Adversary; Wireless sensor network; Reliable multicast; Source-specific multicast; Computer security","score_opus":0.006467901101342321,"score_gpt":0.23652912507924323,"score_spread":0.2300612239779009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137940221","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42384708,0.000018463543,0.57451934,0.00004722292,0.00097337307,0.00032296812,0.000005752593,0.00025454987,0.000011218172],"genre_scores_gemma":[0.9842697,0.00001164452,0.015448345,0.00008964903,0.00010660743,0.000040386305,0.0000025672489,0.000025357522,0.00000576756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976815,0.00015485294,0.00047866133,0.00079909415,0.00025949068,0.00062638917],"domain_scores_gemma":[0.9983208,0.0005328725,0.000121895704,0.00076397404,0.000075996824,0.0001844524],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00052652776,0.00027078166,0.00031319994,0.00020620291,0.00042667834,0.00017507956,0.00038040776,0.0002580825,0.000010209623],"category_scores_gemma":[0.0000134360325,0.00028950136,0.000105139734,0.00084534765,0.00010273293,0.0001148586,0.000017510958,0.0012068424,0.000012589206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024259258,0.00028764474,0.000070587215,0.0000095559735,0.000010040013,0.000015443546,0.00058284024,0.92460763,0.002234787,0.000040512852,0.0000030852757,0.0721136],"study_design_scores_gemma":[0.0010025181,0.00009009562,0.00050101895,0.00004746982,0.000009938182,0.00008213755,0.000108542314,0.98986524,0.0077981236,0.000014703476,0.00019377364,0.00028644063],"about_ca_topic_score_codex":0.00004743313,"about_ca_topic_score_gemma":0.0002937622,"teacher_disagreement_score":0.5604226,"about_ca_system_score_codex":0.00007745901,"about_ca_system_score_gemma":0.00001922679,"threshold_uncertainty_score":0.9999557},"labels":[],"label_agreement":null},{"id":"W2141435168","doi":"10.1109/tmc.2008.94","title":"Efficient Broadcasting in Mobile Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","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":"University of British Columbia","funders":"","keywords":"Computer science; Flooding (psychology); Communication source; Broadcasting (networking); Wireless ad hoc network; Computer network; Algorithm; Mobile ad hoc network; Node (physics); Hop (telecommunications); Distributed computing; Theoretical computer science; Wireless; Network packet; Telecommunications","score_opus":0.015949714305613472,"score_gpt":0.240187802158681,"score_spread":0.2242380878530675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141435168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.267977,0.0017677611,0.72744185,0.00001695714,0.0013769504,0.00071085204,0.0000015064959,0.0004795336,0.00022757852],"genre_scores_gemma":[0.98176086,0.00031935656,0.0171944,0.00017884387,0.00014745495,0.0002399601,0.0000012857624,0.00004943712,0.00010837886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964442,0.00022456252,0.00078413927,0.0010440587,0.0004990981,0.0010039147],"domain_scores_gemma":[0.99781865,0.0006565294,0.0002043527,0.0010045012,0.00008629201,0.00022968146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005696622,0.00042219562,0.0004675311,0.00036961152,0.00072157953,0.000114722316,0.0010467557,0.0002072056,0.000037485832],"category_scores_gemma":[0.000005753613,0.00046035656,0.0002314819,0.0017208545,0.00012653347,0.00018455494,0.000027354357,0.0010347428,0.00009367113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010177826,0.00025748656,0.000036904217,0.000007520591,0.000010569419,0.00007868108,0.00077954866,0.71268976,0.00006921115,0.000021750224,0.00003767631,0.28600073],"study_design_scores_gemma":[0.0007476041,0.0003158652,0.00020247663,0.00015202712,0.0000069409975,0.00019279664,0.00006741524,0.99598914,0.0006944981,0.000012055005,0.0011685631,0.0004505988],"about_ca_topic_score_codex":0.000013218827,"about_ca_topic_score_gemma":0.00002392618,"teacher_disagreement_score":0.71378386,"about_ca_system_score_codex":0.00027367886,"about_ca_system_score_gemma":0.00010850129,"threshold_uncertainty_score":0.9997848},"labels":[],"label_agreement":null},{"id":"W2143480613","doi":"10.1109/tmc.2006.17","title":"Cellular CDMA capacity with out-of-band multihop relaying","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer network; Computer science; Telecommunications link; Base station; Wireless ad hoc network; Soft handover; Relay; Near-far problem; Code division multiple access; Cellular network; Wireless; Telecommunications","score_opus":0.029343390558348233,"score_gpt":0.24747544139963834,"score_spread":0.21813205084129011,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143480613","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23397598,0.00009842995,0.7642515,0.000047862755,0.0003410809,0.00020397588,0.000001512142,0.00016889634,0.0009108164],"genre_scores_gemma":[0.9715037,0.000025342057,0.028220724,0.000051322702,0.000047306694,0.000017845132,0.0000011031331,0.000015517417,0.00011715481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986356,0.00015238632,0.00035461172,0.0003579403,0.0002369285,0.00026251917],"domain_scores_gemma":[0.99866045,0.00027207902,0.00014958327,0.0006932136,0.00016501392,0.000059650905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002875702,0.00018591153,0.0002228741,0.00014304621,0.0005101557,0.000086501874,0.0005747829,0.000060011276,0.0000142161725],"category_scores_gemma":[0.0000025950617,0.00017141597,0.00009218432,0.0005034036,0.00009087373,0.00021845147,0.000007670686,0.00034437855,0.000017145438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020631285,0.0004804566,0.00024885358,0.000034256147,0.000049774826,0.000009193216,0.0022294316,0.79239833,0.047538776,0.0016372865,0.00008494735,0.15526804],"study_design_scores_gemma":[0.0010416413,0.0002941497,0.00033219476,0.00024986145,0.000023292527,0.000011904714,0.00009391833,0.72741705,0.26845506,0.00007366654,0.0015328609,0.0004744061],"about_ca_topic_score_codex":0.00003596625,"about_ca_topic_score_gemma":0.00007817963,"teacher_disagreement_score":0.7375277,"about_ca_system_score_codex":0.00006348785,"about_ca_system_score_gemma":0.000041629904,"threshold_uncertainty_score":0.69901407},"labels":[],"label_agreement":null},{"id":"W2144431033","doi":"10.1109/tmc.2013.2296502","title":"Maximum Stable Throughput of Network-Coded Multiple Broadcast Sessions for WirelessTandem Random Access Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Iran Telecommunication Research Center","keywords":"Computer science; Linear network coding; Computer network; Network packet; Random access; Aloha; Throughput; Distributed computing; Wireless network; Wireless","score_opus":0.03701657566618761,"score_gpt":0.3012260340177361,"score_spread":0.2642094583515485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144431033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0050849803,0.0003302319,0.9916913,0.0001757653,0.0011719009,0.000939337,0.000007464705,0.00029518548,0.00030384137],"genre_scores_gemma":[0.9641445,0.00034092824,0.034819726,0.00025536108,0.00018687107,0.00013991114,0.0000061927453,0.000033769516,0.00007269411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758875,0.0003752314,0.0006662424,0.0005530447,0.00024825745,0.00056845206],"domain_scores_gemma":[0.9959653,0.0023011647,0.00030992524,0.001007824,0.00027880646,0.00013695256],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00094492343,0.00029113283,0.0005197187,0.00012539513,0.0011405991,0.00023684234,0.0014134411,0.00012903377,0.000022946395],"category_scores_gemma":[0.000025177666,0.00028187048,0.0002485246,0.00086653087,0.00009057788,0.0004787633,0.000040668758,0.00040734845,0.000003986061],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004941246,0.0001253336,0.00004552812,0.000016340331,0.000034396213,2.301867e-7,0.00023473213,0.74944496,0.00022254833,0.0009833161,0.0002621093,0.2485811],"study_design_scores_gemma":[0.002321447,0.00016512796,0.000050206007,0.00022198817,0.000022750017,0.0000029743014,0.000031500233,0.98946524,0.0033886796,0.00039209292,0.0036442361,0.00029376076],"about_ca_topic_score_codex":0.000014330735,"about_ca_topic_score_gemma":0.00007157495,"teacher_disagreement_score":0.9590596,"about_ca_system_score_codex":0.00007304027,"about_ca_system_score_gemma":0.00007530532,"threshold_uncertainty_score":0.99996334},"labels":[],"label_agreement":null},{"id":"W2144723957","doi":"10.1109/tmc.2007.1017","title":"Kernel-Based Positioning in Wireless Local Area Networks","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":428,"is_retracted":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":"RSS; Computer science; Hybrid positioning system; Wi-Fi; Local area network; Context (archaeology); Signal strength; Kernel (algebra); Location-based service; Wireless; Computer network; Wireless network; Histogram; Point (geometry); Location awareness; Ubiquitous computing; Wireless lan; Real-time computing; Positioning system; Telecommunications; Artificial intelligence; Geography; World Wide Web; Human–computer interaction","score_opus":0.00660713434968295,"score_gpt":0.21523298720016243,"score_spread":0.20862585285047947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144723957","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18340492,0.00004577894,0.81455046,0.0000063797647,0.0005125252,0.00016218015,0.0000019518511,0.0009308183,0.00038500005],"genre_scores_gemma":[0.99876326,0.000009775722,0.0010614406,0.000060467588,0.00003762225,0.000015749432,0.0000048844145,0.000038394253,0.000008380427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989307,0.000016940721,0.0003330677,0.00019773896,0.00012684312,0.0003947173],"domain_scores_gemma":[0.9995358,0.00017406362,0.000028600472,0.00018205882,0.000028959379,0.0000505344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022586946,0.00017791186,0.00017440807,0.0003093061,0.00015610893,0.000032920634,0.00013644673,0.00018351899,0.000024752519],"category_scores_gemma":[0.000001420783,0.00020282048,0.00007374308,0.00058028765,0.00006447786,0.000065953274,0.0000011108833,0.0004544824,0.000012124449],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000106124,0.000037934755,0.00013322239,0.000016546192,0.000008215058,0.000015322377,0.00006756084,0.8971224,0.0002710889,0.000042315754,0.000010665823,0.10226412],"study_design_scores_gemma":[0.00038929837,0.000044696328,0.00021081092,0.00012053563,0.000006716151,0.0000060802513,0.00021235406,0.9343386,0.064418264,0.000016009584,0.000035522946,0.00020107158],"about_ca_topic_score_codex":0.000018976636,"about_ca_topic_score_gemma":0.000075259304,"teacher_disagreement_score":0.81535834,"about_ca_system_score_codex":0.00021134487,"about_ca_system_score_gemma":0.000012488486,"threshold_uncertainty_score":0.8270779},"labels":[],"label_agreement":null},{"id":"W2145552549","doi":"10.1109/tmc.2013.132","title":"Adaptive Context Dissemination in Heterogeneous Environments","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Blackberry (Canada)","funders":"","keywords":"Computer science; Middleware (distributed applications); Context (archaeology); Distributed computing; Overlay network; Overlay; Context model; Protocol (science); Computer network; Context awareness; Personalization; Ubiquitous computing; World Wide Web; Human–computer interaction; The Internet; Operating system; Artificial intelligence","score_opus":0.016194441889625353,"score_gpt":0.2438644258242591,"score_spread":0.22766998393463375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145552549","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21968469,0.000034983677,0.7787832,0.0000511846,0.00048728852,0.00067542144,0.0000037322634,0.00012255345,0.00015694759],"genre_scores_gemma":[0.9979741,0.0000060605294,0.0014183697,0.00011670423,0.000029207495,0.0002427947,0.0000012370575,0.000018444733,0.00019308225],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825215,0.00018840622,0.00040091967,0.0005299313,0.00029721315,0.00033138326],"domain_scores_gemma":[0.9988379,0.0004664114,0.0001358673,0.00041002332,0.000046824953,0.00010297891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020128921,0.00021132668,0.00023935568,0.00026238622,0.00017754242,0.00015124983,0.00040294163,0.00009104387,0.000084340216],"category_scores_gemma":[0.000004675357,0.00022975125,0.000108271764,0.0003431471,0.00004045745,0.00065122626,0.000008339709,0.00027417243,0.0005904774],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054698335,0.0003025355,0.000060920334,0.0000063323478,0.000023273491,0.000009859551,0.0012568831,0.02877774,0.0032571608,0.000016618276,0.000033745342,0.96624947],"study_design_scores_gemma":[0.0008886816,0.00042002974,0.0015061039,0.00026448793,0.000009539772,0.00009007935,0.00067377416,0.93292224,0.06207458,0.00015925935,0.00040584602,0.00058540265],"about_ca_topic_score_codex":0.00018078418,"about_ca_topic_score_gemma":0.00006530505,"teacher_disagreement_score":0.965664,"about_ca_system_score_codex":0.00022929422,"about_ca_system_score_gemma":0.000022008142,"threshold_uncertainty_score":0.9368984},"labels":[],"label_agreement":null},{"id":"W2146940657","doi":"10.1109/tmc.2009.16","title":"On the Planning of Wireless Sensor Networks: Energy-Efficient Clustering under the Joint Routing and Coverage Constraint","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":167,"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":"Wireless sensor network; Computer science; Heuristic; Energy consumption; Network topology; Integer programming; Cluster analysis; Routing (electronic design automation); Distributed computing; Key distribution in wireless sensor networks; Topology (electrical circuits); Linear programming; Mathematical optimization; Computer network; Wireless network; Wireless; Algorithm; Mathematics; Engineering","score_opus":0.015664708098835488,"score_gpt":0.22736356686652276,"score_spread":0.21169885876768726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146940657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29321027,0.00006948303,0.7053595,0.0002794212,0.00049650035,0.00020254843,0.0000014206981,0.00014178439,0.000239035],"genre_scores_gemma":[0.99720955,0.000020834435,0.0016097637,0.0010186903,0.00008836528,0.000010607845,5.679087e-7,0.000022079368,0.000019553761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757385,0.00031286103,0.00056456996,0.0005671508,0.00042867084,0.00055288186],"domain_scores_gemma":[0.9971382,0.0016856345,0.00029777386,0.000700748,0.00008296572,0.0000946663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073123304,0.00032602646,0.00032829645,0.00013034011,0.00097115524,0.00022005064,0.00057959073,0.00011248269,0.000004305076],"category_scores_gemma":[0.0000065652744,0.00022279282,0.0001583113,0.00054559304,0.00020773885,0.000068106725,0.000021587684,0.0006091496,0.0000013774936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012877165,0.000109499066,0.0000020981217,0.0000042610595,0.000028129809,0.0000085941665,0.00065896846,0.93819803,0.0006390206,0.010403788,0.000009811517,0.049924918],"study_design_scores_gemma":[0.0003101165,0.00020722132,0.0001131951,0.00034884154,0.000014841407,0.000054905948,0.0004822262,0.99443746,0.003712153,0.00007101281,0.00001124547,0.00023677052],"about_ca_topic_score_codex":0.000023112429,"about_ca_topic_score_gemma":0.00000456185,"teacher_disagreement_score":0.7039993,"about_ca_system_score_codex":0.000090126014,"about_ca_system_score_gemma":0.00003530527,"threshold_uncertainty_score":0.9085227},"labels":[],"label_agreement":null},{"id":"W2147411015","doi":"10.1109/tmc.2013.23","title":"On Quality of Monitoring for Multichannel Wireless Infrastructure Networks","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","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":"McMaster University","funders":"National Science Foundation","keywords":"Computer science; Wireless; Metric (unit); Wireless network; Frame (networking); Channel (broadcasting); Inference; Computer network; Data mining; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.022924980232338892,"score_gpt":0.29790909630370077,"score_spread":0.27498411607136186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147411015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12740508,0.000014726226,0.86758345,0.000030371406,0.0011431739,0.0036442373,0.000004221631,0.00014944012,0.000025294727],"genre_scores_gemma":[0.9746709,0.0000049288874,0.023294453,0.000058812773,0.0001945172,0.0017297918,7.494462e-7,0.000022639764,0.000023234408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998271,0.000116146395,0.0005168302,0.00044282194,0.00024387019,0.00040932235],"domain_scores_gemma":[0.99794364,0.001012186,0.00023773506,0.00053427153,0.00016154359,0.00011063888],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033714023,0.00023120474,0.00034286722,0.0001048968,0.00032023503,0.000121354715,0.0005944033,0.00015238895,0.000011772278],"category_scores_gemma":[0.000005053136,0.00021658903,0.00019018493,0.00033225774,0.000043104432,0.00022948255,0.000007955297,0.00035970932,0.00000656671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016600221,0.00008009162,0.000039969884,0.00004051814,0.00002000142,2.2451344e-7,0.00020761359,0.7412671,0.00054369343,0.00047320357,0.000039764076,0.25727123],"study_design_scores_gemma":[0.00064287224,0.00031249318,0.0005379662,0.00020173346,0.000005043315,0.0000013438699,0.000042328957,0.9830405,0.014268311,0.0006947665,0.000021641135,0.00023100263],"about_ca_topic_score_codex":0.000059194626,"about_ca_topic_score_gemma":0.0000018817649,"teacher_disagreement_score":0.8472658,"about_ca_system_score_codex":0.00005664426,"about_ca_system_score_gemma":0.000030561827,"threshold_uncertainty_score":0.8832245},"labels":[],"label_agreement":null},{"id":"W2149136155","doi":"10.1109/tmc.2003.1195148","title":"Policy-driven personalized multimedia services for mobile users","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Agent-Based Network Management","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"National Research Council Canada","keywords":"Computer science; Provisioning; Service (business); World Wide Web; Mobile device; The Internet; Service provider; Presentation (obstetrics); Negotiation; Mobile computing; Multimedia; Work (physics); Telecommunications; Business","score_opus":0.015190335042676901,"score_gpt":0.26735585452956806,"score_spread":0.25216551948689114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149136155","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02517706,0.00009378908,0.9702653,0.00007923051,0.0013270609,0.0021273992,0.00001742391,0.0005600755,0.00035264963],"genre_scores_gemma":[0.88742083,0.000042391996,0.11007204,0.00080915866,0.00015057942,0.0009773064,0.00000600983,0.000054636417,0.00046707492],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971436,0.00021021589,0.00049828354,0.0009168312,0.00043780528,0.0007932477],"domain_scores_gemma":[0.99795836,0.00055445125,0.00020071275,0.0009049313,0.00013805117,0.00024349304],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00047733565,0.00039412105,0.00037117332,0.00040068966,0.00063352974,0.00024382092,0.0010051659,0.0001179984,0.000058857597],"category_scores_gemma":[0.000006118555,0.00041632482,0.0003371576,0.00091229455,0.00008037383,0.0003438907,0.0000124852095,0.00027133463,0.00009532652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021329884,0.00029186162,0.000024673063,0.000117859156,0.000113969596,0.000008365344,0.0014586413,0.8708083,0.0005161972,0.001559247,0.00022017777,0.12485938],"study_design_scores_gemma":[0.0018443128,0.00043737656,0.000016914948,0.00009985985,0.000046106452,0.00001188303,0.00038932217,0.96761143,0.0069951215,0.00017966141,0.021846937,0.0005210965],"about_ca_topic_score_codex":0.00006572774,"about_ca_topic_score_gemma":0.000029955956,"teacher_disagreement_score":0.8622438,"about_ca_system_score_codex":0.00029852954,"about_ca_system_score_gemma":0.00015818712,"threshold_uncertainty_score":0.9998289},"labels":[],"label_agreement":null},{"id":"W2149492558","doi":"10.1109/tmc.2007.1046","title":"Enhancing WLAN Capacity by Strategic Placement of Tetherless Relay Points","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Relay; Wireless; Throughput; Wireless network; Rayleigh fading; Telecommunications; Channel (broadcasting); Fading","score_opus":0.023865911176451617,"score_gpt":0.27223506504425693,"score_spread":0.2483691538678053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149492558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21178147,0.000023172024,0.78601795,0.000018201334,0.00038834361,0.0012997885,0.0000047652074,0.00012546904,0.00034083083],"genre_scores_gemma":[0.97739977,0.0000041153276,0.022276698,0.00007588773,0.00005586024,0.00011899344,8.1137006e-7,0.00001685402,0.00005098517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99811065,0.000111750174,0.00055173645,0.0004261398,0.00034513327,0.00045457308],"domain_scores_gemma":[0.9987222,0.00038017577,0.00021307057,0.00047004208,0.00008694573,0.00012759995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011147002,0.0002088283,0.00026578727,0.00012070554,0.00027497366,0.000073422256,0.00052611803,0.00011444905,0.000026963431],"category_scores_gemma":[0.0000015377651,0.00020541146,0.00011669381,0.00044661004,0.000055788,0.00015773959,0.000006561873,0.00039723268,0.000014861086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011509504,0.0012482135,0.00011380412,0.0002374619,0.0001479413,0.000023613384,0.004219437,0.67877436,0.15102486,0.0021863305,0.00014569808,0.16176318],"study_design_scores_gemma":[0.0011538652,0.0007913409,0.00006724986,0.00046204616,0.00001709835,0.000025080128,0.00046322652,0.30887008,0.68681335,0.000373787,0.00040254818,0.00056035916],"about_ca_topic_score_codex":0.00006802095,"about_ca_topic_score_gemma":0.000051261817,"teacher_disagreement_score":0.7656183,"about_ca_system_score_codex":0.00009451785,"about_ca_system_score_gemma":0.000048698614,"threshold_uncertainty_score":0.83764356},"labels":[],"label_agreement":null},{"id":"W2149525424","doi":"10.1109/tmc.2010.42","title":"TDMA Scheduling with Optimized Energy Efficiency and Minimum Delay in Clustered Wireless Sensor Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":170,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Time division multiple access; Computer science; Wireless sensor network; Scheduling (production processes); Computer network; Frequency-division multiple access; Energy consumption; Efficient energy use; Wireless; Power control; Wireless network; Frame (networking); Reliability (semiconductor); Distributed computing; Mathematical optimization; Power (physics); Orthogonal frequency-division multiplexing; Channel (broadcasting); Telecommunications","score_opus":0.006405290231647739,"score_gpt":0.21383205322392396,"score_spread":0.20742676299227622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149525424","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4136662,0.00004296944,0.5849963,0.000048844027,0.00076632283,0.00017948876,7.4587786e-7,0.00022597786,0.00007315469],"genre_scores_gemma":[0.88441557,0.00003266739,0.115167595,0.00015174905,0.00010430529,0.0000370873,0.0000014720782,0.000047166966,0.00004240035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970289,0.00018793369,0.00057309115,0.0010197036,0.00037606969,0.00081430236],"domain_scores_gemma":[0.99797106,0.0007196646,0.0002015739,0.0007705773,0.000104150284,0.00023299278],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044880246,0.00043101996,0.00046923207,0.00040389295,0.00048301957,0.0002705588,0.0006922786,0.00027632387,0.0000067531664],"category_scores_gemma":[0.0000043239625,0.00040493527,0.00010140619,0.0011399388,0.00018751348,0.00026326338,0.000022555378,0.0010193211,0.0000030760737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005739146,0.00023222565,0.000046594374,0.000009075839,0.000020257594,0.000054830103,0.0003280012,0.95518506,0.0010296411,0.00030321314,0.0000019084987,0.04273181],"study_design_scores_gemma":[0.0016638177,0.00021595084,0.000037541122,0.00014781488,0.000014334219,0.00015851241,0.0000747662,0.9941791,0.002991668,0.0000053180825,0.00003696909,0.00047415483],"about_ca_topic_score_codex":0.00009502238,"about_ca_topic_score_gemma":0.0002827995,"teacher_disagreement_score":0.47074935,"about_ca_system_score_codex":0.000060157552,"about_ca_system_score_gemma":0.000070172006,"threshold_uncertainty_score":0.99984026},"labels":[],"label_agreement":null},{"id":"W2151667449","doi":"10.1109/tmc.2005.19","title":"Call admission control in wideband CDMA cellular networks by using fuzzy logic","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Call blocking; Computer science; Call Admission Control; Code division multiple access; Computer network; Handover; Fuzzy logic; Cellular network; Wideband; Blocking (statistics); Base station; Scheme (mathematics); Telecommunications; Wireless; Wireless network; Mathematics","score_opus":0.022386736012835293,"score_gpt":0.2845824088462968,"score_spread":0.2621956728334615,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151667449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03387071,0.0009421161,0.9635431,0.0004277406,0.000297093,0.0005291578,0.0000023842433,0.00021717433,0.00017053603],"genre_scores_gemma":[0.98432916,0.00009775163,0.014862128,0.0004412197,0.00010760237,0.000035594894,0.0000024299009,0.000028793911,0.00009529076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972686,0.00048313275,0.0005711608,0.0005846822,0.00041740818,0.0006749723],"domain_scores_gemma":[0.99794275,0.00059988274,0.00014142746,0.0009790079,0.000108806904,0.00022814563],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076436426,0.000261962,0.000323487,0.0002674307,0.00048674323,0.00020609895,0.0012811823,0.00018867072,0.00002570011],"category_scores_gemma":[0.000007301897,0.00026818467,0.00012220671,0.0009099319,0.000076011085,0.00039297855,0.00002311528,0.00094461726,0.000027083193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014755784,0.00021725538,0.000030910684,0.000005522243,0.000011155228,0.000006168317,0.00013328494,0.8330283,0.005084327,0.00003075818,0.00018176685,0.16125575],"study_design_scores_gemma":[0.0009657628,0.00008885767,0.0000115710545,0.00010616333,0.0000058599735,0.0000117732425,0.00001615629,0.99261767,0.00495322,0.000023687719,0.0009357468,0.00026356138],"about_ca_topic_score_codex":0.000081764236,"about_ca_topic_score_gemma":0.00003815552,"teacher_disagreement_score":0.95045847,"about_ca_system_score_codex":0.00031473924,"about_ca_system_score_gemma":0.00009384734,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W2155785578","doi":"10.1109/tmc.2006.130","title":"End-to-End Batch Transmission in a Multihop and Multirate Wireless Network: Latency, Reliability, and Throughput Analysis","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of British Columbia","funders":"Asian Institute of Technology; Thammasat University; University of British Columbia; University of Manitoba","keywords":"Computer science; Computer network; Network packet; Latency (audio); Hybrid automatic repeat request; Wireless network; Automatic repeat request; Wireless; Transmission (telecommunications); Transmission Control Protocol; Selective Repeat ARQ; Node (physics); Reliability (semiconductor); End-to-end principle; Markov chain; Telecommunications; Engineering; Telecommunications link","score_opus":0.009240752330363608,"score_gpt":0.24402687829733063,"score_spread":0.23478612596696702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155785578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37021247,0.00016443426,0.62852955,0.0001252325,0.00019611252,0.00052625925,0.000003784244,0.0001671141,0.000075073134],"genre_scores_gemma":[0.94736695,0.00009762897,0.052153736,0.00012558606,0.000084351035,0.00007705344,0.0000031959544,0.000029273306,0.00006221713],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965384,0.00029904104,0.0007575833,0.0012718383,0.0003748255,0.000758299],"domain_scores_gemma":[0.9981544,0.00068319484,0.00013715909,0.0007065597,0.00008996242,0.00022874685],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009009238,0.00040213202,0.000613834,0.00040668345,0.00046039518,0.0002354099,0.00047519524,0.00020368591,0.000020963726],"category_scores_gemma":[0.0000028888533,0.0004019553,0.0001717923,0.0025510134,0.00011872993,0.00038336695,0.000029354316,0.00057062326,0.0000068925583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018688137,0.00016652522,0.0016498894,0.00002216363,0.000041630858,0.000016491842,0.0005764077,0.74406844,0.0003276506,0.00008650304,0.000016154228,0.2530094],"study_design_scores_gemma":[0.000801243,0.00015927828,0.009593313,0.00011986267,0.00009358036,0.00001436006,0.000033960616,0.98735267,0.0008811056,0.00028792964,0.0002431051,0.0004195846],"about_ca_topic_score_codex":0.0013218691,"about_ca_topic_score_gemma":0.0009674347,"teacher_disagreement_score":0.5771545,"about_ca_system_score_codex":0.00011373904,"about_ca_system_score_gemma":0.000049042657,"threshold_uncertainty_score":0.99984324},"labels":[],"label_agreement":null},{"id":"W2155962735","doi":"10.1109/tmc.2010.229","title":"Adaptive Asynchronous Sleep Scheduling Protocols for Delay Tolerant Networks","year":2010,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","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":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Sleep mode; Computer network; Energy consumption; Distributed computing; Efficient energy use; Scalability; Power management; Network packet; Scheduling (production processes); Power consumption; Power (physics)","score_opus":0.02207387829873364,"score_gpt":0.27644032573473315,"score_spread":0.2543664474359995,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155962735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005664502,0.000026773036,0.9828836,0.00006224624,0.002066194,0.0085049225,0.00000959728,0.00051309535,0.00026909527],"genre_scores_gemma":[0.8013803,0.0000021508692,0.19445357,0.00023163995,0.00042694912,0.0034264985,0.0000023128443,0.00003859931,0.00003801323],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974048,0.000076924145,0.00061525364,0.00081962114,0.00030759783,0.00077580655],"domain_scores_gemma":[0.9979321,0.00068100856,0.00023074806,0.0006762085,0.00019913865,0.00028080857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006342931,0.00038035456,0.00042145938,0.00015476334,0.0009002403,0.00029466543,0.0008636939,0.00027533885,0.00002886502],"category_scores_gemma":[0.00000229083,0.00037749176,0.00028166696,0.00041719948,0.00009981898,0.00032572803,0.0000130406,0.0010133139,0.000025300691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048412094,0.00018586499,0.0000036121198,0.000011918574,0.000033747416,0.000012691593,0.0001589992,0.5995022,0.00013657981,0.00075230293,0.000026465852,0.3991272],"study_design_scores_gemma":[0.0009479038,0.00051148294,0.0000075884586,0.00009746004,0.000027300837,0.00007467226,0.00003346308,0.9959016,0.00096030126,0.0002801931,0.00071912917,0.00043891277],"about_ca_topic_score_codex":0.000013921096,"about_ca_topic_score_gemma":0.000017122073,"teacher_disagreement_score":0.79571575,"about_ca_system_score_codex":0.00006453772,"about_ca_system_score_gemma":0.00015787497,"threshold_uncertainty_score":0.9998677},"labels":[],"label_agreement":null},{"id":"W2156371250","doi":"10.1109/tmc.2008.125","title":"A Tabu Search Algorithm for Cluster Building in Wireless Sensor Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":57,"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":"Tabu search; Computer science; Wireless sensor network; Cluster analysis; Energy consumption; Simulated annealing; Quality of service; Key distribution in wireless sensor networks; Distributed computing; Heuristic; Computer network; Wireless network; Wireless; Algorithm; Data mining; Machine learning","score_opus":0.01835153577391628,"score_gpt":0.25917700854078707,"score_spread":0.24082547276687077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156371250","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19000871,0.00004893272,0.80766404,0.00006364647,0.0011977688,0.0006441455,0.0000035080698,0.00033243845,0.000036807738],"genre_scores_gemma":[0.76900923,0.000038210597,0.23034003,0.00018036789,0.00019791273,0.00008363255,0.0000018704168,0.000044750508,0.000103972314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969522,0.00021284525,0.00056718464,0.00089415687,0.0004052727,0.0009683684],"domain_scores_gemma":[0.99790275,0.0010404423,0.00011486664,0.0006431686,0.00012782191,0.00017095527],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00057160994,0.00034119544,0.00040765124,0.00042271815,0.0007065824,0.00011720816,0.00078584586,0.00021403881,0.0000046448604],"category_scores_gemma":[0.0000029776565,0.00037051173,0.00022093533,0.0011751337,0.000108161046,0.000257121,0.00001768456,0.0007059672,0.000009662108],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010890075,0.0001779088,0.000031727137,0.0000088959705,0.000015784994,0.00002446058,0.00037510585,0.801957,0.00014081305,0.00009055023,0.00002556203,0.19714129],"study_design_scores_gemma":[0.0010736764,0.00016627603,0.000053996533,0.00012309384,0.0000062162894,0.00011969219,0.00004280825,0.9939765,0.0039270385,0.0000065752824,0.00011987282,0.00038430942],"about_ca_topic_score_codex":0.0000621388,"about_ca_topic_score_gemma":0.000017661972,"teacher_disagreement_score":0.57900053,"about_ca_system_score_codex":0.00020928518,"about_ca_system_score_gemma":0.00007709924,"threshold_uncertainty_score":0.9998747},"labels":[],"label_agreement":null},{"id":"W2156919687","doi":"10.1109/tmc.2009.105","title":"Relay Node Deployment Strategies in Heterogeneous Wireless Sensor Networks","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":171,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Software deployment; Computer science; Relay; Wireless sensor network; Computer network; Energy consumption; Base station; Network packet; Wireless; Distributed computing; Key distribution in wireless sensor networks; Wireless network; Telecommunications; Engineering; Power (physics)","score_opus":0.010550615405070081,"score_gpt":0.2410141750016289,"score_spread":0.23046355959655881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156919687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29233232,0.000109728935,0.7057081,0.00010493581,0.00081218756,0.00026343515,8.226395e-7,0.0004986699,0.0001698099],"genre_scores_gemma":[0.97672004,0.00006528255,0.02257472,0.00043060488,0.000107982254,0.000022811952,0.0000014363453,0.00003379957,0.00004334523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705607,0.0002192359,0.00062106544,0.000860695,0.00040662233,0.0008363168],"domain_scores_gemma":[0.9985041,0.00029004537,0.00015638565,0.00082247914,0.00006077325,0.00016621103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030140168,0.00039516916,0.00038953076,0.00031363068,0.0003481299,0.0003080452,0.0008058235,0.00020644901,0.0000075039147],"category_scores_gemma":[0.0000013453159,0.00041749596,0.00018222054,0.00094349886,0.00005743259,0.00029512442,0.000008487608,0.0007114681,0.000021994912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015420537,0.00032188682,0.000015699241,0.000004762696,0.000014497233,0.00010055853,0.00030019175,0.91723615,0.00042918994,0.00032037243,0.000010095951,0.08123117],"study_design_scores_gemma":[0.0005282138,0.00027576435,0.00012199501,0.00013734447,0.000008253273,0.00007448826,0.000071143775,0.993118,0.005159176,0.000027011294,0.00006208264,0.00041654552],"about_ca_topic_score_codex":0.00004106196,"about_ca_topic_score_gemma":0.00005605136,"teacher_disagreement_score":0.6843877,"about_ca_system_score_codex":0.0002143268,"about_ca_system_score_gemma":0.000060261762,"threshold_uncertainty_score":0.9998277},"labels":[],"label_agreement":null},{"id":"W2157753773","doi":"10.1109/tmc.2006.1599403","title":"Minimum-energy multicast in wireless ad hoc networks with adaptive antennas: MILP formulations and heuristic algorithms","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Multicast; Wireless ad hoc network; Heuristic; Integer programming; Wireless network; Wireless; Distributed computing; Computer network; Mobile ad hoc network; Linear programming; Algorithm; Mathematical optimization; Mathematics; Telecommunications","score_opus":0.009490260515106751,"score_gpt":0.21924146352580023,"score_spread":0.20975120301069347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157753773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054705918,0.00051639293,0.9435498,0.00003597895,0.00036961553,0.00046713464,0.000006649731,0.00024905056,0.00009942935],"genre_scores_gemma":[0.94903344,0.000092394264,0.05045406,0.00008238709,0.00010460176,0.000116241565,0.00000457543,0.000041285894,0.00007098544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99751914,0.00013791883,0.0005447368,0.00082686445,0.0003049871,0.0006663347],"domain_scores_gemma":[0.99838394,0.00062132196,0.0001670017,0.00055105967,0.00012923939,0.00014742474],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021361628,0.00037567745,0.00039479014,0.0002845702,0.0004272953,0.00017930924,0.00043427298,0.00015567869,0.0000047986437],"category_scores_gemma":[0.000001559777,0.00036360972,0.00008583339,0.0010281572,0.00014666271,0.00038876157,0.000015184558,0.0004839813,0.000003973927],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003675499,0.00024892035,0.000061030358,0.0000075650905,0.000021946242,0.00005221297,0.00020343765,0.77062255,0.00004707501,0.0005913639,0.000018559846,0.22808857],"study_design_scores_gemma":[0.001145495,0.00043241927,0.0008964688,0.00020682653,0.000020753248,0.00007982127,0.000080482656,0.9963118,0.0001756695,0.00014127331,0.0000986758,0.0004103523],"about_ca_topic_score_codex":0.0001769032,"about_ca_topic_score_gemma":0.00083217374,"teacher_disagreement_score":0.8943275,"about_ca_system_score_codex":0.00013269903,"about_ca_system_score_gemma":0.000058843652,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W2159141994","doi":"10.1109/tmc.2007.49","title":"Distributed and Energy-Aware MAC for Differentiated Services Wireless Packet Networks: A General Queuing Analytical Framework","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","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":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Network packet; Queueing theory; Node (physics); Queue management system; Queue; Markovian arrival process; Wireless network; Real-time computing; Wireless","score_opus":0.011358742759590744,"score_gpt":0.27305192263304645,"score_spread":0.2616931798734557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159141994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064849496,0.0000674522,0.932964,0.00005477294,0.00058783795,0.0011088583,0.000026132164,0.00033186097,0.00000957255],"genre_scores_gemma":[0.98563176,0.00002127115,0.013263862,0.00026041907,0.0003394778,0.0004010775,0.000022074955,0.000033976485,0.000026064637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769497,0.000096646094,0.00051694544,0.00069126504,0.0002506899,0.00074949797],"domain_scores_gemma":[0.9981688,0.0008212559,0.00016425905,0.000454877,0.00013435466,0.0002564268],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043591243,0.00033698787,0.00039731688,0.00014279949,0.00063424,0.00037476103,0.00052061916,0.00026637482,0.000007825951],"category_scores_gemma":[0.0000014900323,0.00032346867,0.00017231188,0.00067863165,0.000062922314,0.00021397822,0.000019146888,0.0004147089,0.0000012303681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013171442,0.00029338716,0.0003848669,0.00013162034,0.00015223962,0.000021496448,0.00035949345,0.42346302,0.00010711623,0.0042275568,0.00007747852,0.57065004],"study_design_scores_gemma":[0.00055606454,0.00020193652,0.00036157,0.00032238572,0.000030890773,0.000014188698,0.00005148608,0.9961691,0.0010744457,0.00046088742,0.00039089745,0.0003661272],"about_ca_topic_score_codex":0.000056046913,"about_ca_topic_score_gemma":0.00006971984,"teacher_disagreement_score":0.92078227,"about_ca_system_score_codex":0.00007246726,"about_ca_system_score_gemma":0.00002769877,"threshold_uncertainty_score":0.99992174},"labels":[],"label_agreement":null},{"id":"W2161062743","doi":"10.1109/tmc.2011.58","title":"Distributed Throughput Maximization in Wireless Networks via Random Power Allocation","year":2011,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal","funders":"","keywords":"Computer science; Throughput; Distributed algorithm; Distributed computing; Wireless network; Mathematical optimization; Gossip; Wireless; Utility maximization; Maximization; Power (physics); Resource allocation; Power control; Computer network; Mathematics; Telecommunications","score_opus":0.026319829353325254,"score_gpt":0.25076834847825086,"score_spread":0.2244485191249256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161062743","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017328762,0.000103872975,0.98063844,0.00006564786,0.0007340739,0.00046204226,0.0000014931966,0.0002822465,0.00038341153],"genre_scores_gemma":[0.99105674,0.00022310688,0.008435328,0.00015119929,0.000024607969,0.00006337756,0.000009449063,0.000017787112,0.000018378256],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830467,0.00030057257,0.00046522194,0.00042983235,0.00017718693,0.00032250897],"domain_scores_gemma":[0.99872804,0.00022567903,0.00013796393,0.00067686377,0.0001538267,0.00007762636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044595546,0.00020752149,0.00023457076,0.0001772828,0.00037452907,0.00009284416,0.00069430546,0.00010413193,0.000054182947],"category_scores_gemma":[0.0000053369554,0.00021839901,0.00008950897,0.0010843041,0.0000513982,0.00041801968,0.000016453234,0.0003931898,0.000023006185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004937634,0.0004181503,0.00014415299,0.000005663761,0.00002726866,0.0000051293055,0.0023545774,0.73949295,0.00037478513,0.0014373409,0.00004260967,0.255648],"study_design_scores_gemma":[0.0009973521,0.000091519025,0.0009185929,0.000079579484,0.0000063601096,0.000008350994,0.00004571739,0.9948793,0.0025628174,0.00008123016,0.00008978781,0.00023941709],"about_ca_topic_score_codex":0.000024016246,"about_ca_topic_score_gemma":0.00006594612,"teacher_disagreement_score":0.973728,"about_ca_system_score_codex":0.00013140433,"about_ca_system_score_gemma":0.000038241975,"threshold_uncertainty_score":0.89060533},"labels":[],"label_agreement":null},{"id":"W2162971298","doi":"10.1109/tmc.2005.26","title":"Fair resource allocation with guaranteed statistical QoS for multimedia traffic in wideband CDMA cellular network","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Quality of service; Computer network; Resource allocation; Weighting; Telecommunications link; Cellular network; Fading; Code division multiple access; Channel (broadcasting); Real-time computing","score_opus":0.016371654507289994,"score_gpt":0.2699364562629294,"score_spread":0.2535648017556394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2162971298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038402457,0.00012751877,0.95938873,0.00042347237,0.00017591422,0.0011498367,0.0000063227053,0.00025344847,0.00007228227],"genre_scores_gemma":[0.8202071,0.000015238156,0.17914112,0.00013233926,0.000185086,0.00022142059,0.000010618219,0.000031481286,0.00005558525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99753547,0.00030951705,0.00052064436,0.00060367514,0.00037751824,0.0006531811],"domain_scores_gemma":[0.9970799,0.0016683522,0.00011863382,0.0008595328,0.00012895514,0.00014459096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008378308,0.00024240433,0.00029179608,0.00022828382,0.00044196958,0.00016824018,0.0010038133,0.00012023519,0.000013551778],"category_scores_gemma":[0.000012151644,0.00023763394,0.00007428559,0.00088182307,0.00011940036,0.00024675054,0.000012539722,0.0005817485,0.0000246644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006112578,0.00019083926,0.000012723809,0.000013641734,0.00001468612,0.0000023226796,0.0005903529,0.70327526,0.00017045272,0.0002013935,0.00023903664,0.29522815],"study_design_scores_gemma":[0.0013114302,0.00024249748,0.00007190377,0.00012847573,0.000008706748,0.000010261765,0.00007593272,0.9919716,0.0017202795,0.000024296194,0.0041739843,0.0002606403],"about_ca_topic_score_codex":0.00001935704,"about_ca_topic_score_gemma":0.0002453623,"teacher_disagreement_score":0.7818046,"about_ca_system_score_codex":0.0001880026,"about_ca_system_score_gemma":0.00011813533,"threshold_uncertainty_score":0.9690431},"labels":[],"label_agreement":null},{"id":"W2163004199","doi":"10.1109/tmc.2008.26","title":"A Mobile-Directory Approach to Service Discovery in Wireless Ad Hoc Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Forskningsrådet om Hälsa, Arbetsliv och Välfärd","keywords":"Computer science; Service discovery; Computer network; Directory; Directory service; Wireless ad hoc network; Mobile ad hoc network; Distributed computing; Network topology; Service (business); Wireless network; Heuristic; Wireless; World Wide Web; Web service; Artificial intelligence; Telecommunications","score_opus":0.0189154969990156,"score_gpt":0.23876511610395823,"score_spread":0.21984961910494263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163004199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20759526,0.00049035647,0.7885359,0.000025522217,0.0011760977,0.0011840443,0.00000386807,0.00051923335,0.00046971304],"genre_scores_gemma":[0.9764855,0.000265742,0.021243762,0.0008437107,0.0001737752,0.00069531606,0.0000038249887,0.00006880282,0.00021960225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961374,0.0002862747,0.00072630466,0.0013164928,0.0005347311,0.0009988421],"domain_scores_gemma":[0.9977017,0.00039751033,0.00015842772,0.0013238288,0.000105509156,0.00031299365],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004836459,0.00050666806,0.0005865909,0.0004302331,0.0005362192,0.00019909613,0.0015305609,0.00023524674,0.000007706091],"category_scores_gemma":[0.0000024833337,0.0005491458,0.00021366322,0.002774523,0.00007671901,0.0007674882,0.000042667558,0.0010044413,0.00006735901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032452797,0.0005604542,0.000048611204,0.000026286143,0.00002472915,0.000035074005,0.0019590433,0.874515,0.0001523663,0.000076664815,0.00014025583,0.12242906],"study_design_scores_gemma":[0.0007154888,0.00029867113,0.00032718724,0.00016812289,0.000010508105,0.000119987475,0.000116040916,0.9957386,0.0008048221,0.00001610199,0.0010425517,0.0006418668],"about_ca_topic_score_codex":0.000069708534,"about_ca_topic_score_gemma":0.00010377929,"teacher_disagreement_score":0.7688902,"about_ca_system_score_codex":0.00033205948,"about_ca_system_score_gemma":0.00015453981,"threshold_uncertainty_score":0.999696},"labels":[],"label_agreement":null},{"id":"W2164562671","doi":"10.1109/tmc.2009.42","title":"Large Connectivity for Dynamic Random Geometric Graphs","year":2009,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Random graph; Random geometric graph; Wireless ad hoc network; Geometric networks; Spatial network; Torus; Wireless network; Theoretical computer science; Wireless; Mathematics; Combinatorics; Complex network; Graph; Telecommunications","score_opus":0.010224502172423966,"score_gpt":0.25905162031996715,"score_spread":0.24882711814754319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2164562671","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054287028,0.00017549383,0.94194436,0.00010501842,0.001395019,0.0012856857,0.00001553666,0.0006444205,0.0001474611],"genre_scores_gemma":[0.9807641,0.000028659537,0.018499058,0.00041673981,0.00006222304,0.00012768879,0.0000030022004,0.00002349124,0.00007503812],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975459,0.00013441227,0.0004456361,0.00079507375,0.00031938186,0.0007595814],"domain_scores_gemma":[0.99753994,0.0011910425,0.00016437231,0.0007935287,0.00014400376,0.00016712],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008334554,0.0003117636,0.00042392933,0.0005304293,0.0007053806,0.000188102,0.0008102602,0.00014788918,0.000016766598],"category_scores_gemma":[0.00001713465,0.00032405555,0.00037435628,0.0018380918,0.00003375465,0.00036838226,0.0000058912988,0.00042376638,0.00002845442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000651753,0.0006473924,0.000011318993,0.000019145504,0.000049764953,0.000007713861,0.00028095738,0.3737288,0.00040074688,0.001864179,0.00018318661,0.62274164],"study_design_scores_gemma":[0.0030870945,0.00063198974,0.0003263996,0.000046720088,0.000026968586,0.000026260897,0.000027940205,0.9900747,0.0023842042,0.002210878,0.00075429457,0.00040253717],"about_ca_topic_score_codex":0.000005359932,"about_ca_topic_score_gemma":0.000015534464,"teacher_disagreement_score":0.9264771,"about_ca_system_score_codex":0.00013437224,"about_ca_system_score_gemma":0.000056905963,"threshold_uncertainty_score":0.99992114},"labels":[],"label_agreement":null},{"id":"W2165903656","doi":"10.1109/tmc.2006.132","title":"Maximizing the Lifetime of Wireless Sensor Networks through Optimal Single-Session Flow Routing","year":2006,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Office of Naval Research","keywords":"Computer science; Computer network; Routing (electronic design automation); Network packet; Flow control (data); Wireless sensor network; Routing table; Routing protocol; Static routing; Session (web analytics)","score_opus":0.012066663127931688,"score_gpt":0.22311169438859912,"score_spread":0.21104503126066743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165903656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15040202,0.000116678086,0.8468169,0.00009584503,0.001408925,0.0003187953,0.0000026307537,0.00041996565,0.00041825703],"genre_scores_gemma":[0.88567865,0.00001503439,0.11372409,0.00011064431,0.00032325706,0.000016114462,0.0000029258154,0.00004927132,0.00008000397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99676454,0.0003174082,0.00083259906,0.00074576883,0.0005686764,0.00077099365],"domain_scores_gemma":[0.997353,0.001019739,0.000427666,0.0009425946,0.0001802059,0.00007680112],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051645125,0.00040089045,0.0004420242,0.00013183389,0.0009234167,0.00022115774,0.0010445599,0.00020885523,0.000010287638],"category_scores_gemma":[0.000005249559,0.0003330353,0.00029798603,0.0010944521,0.0001791916,0.00032103196,0.00003168825,0.0007063229,0.0000105914805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150361375,0.00027351757,0.000017753715,0.000011372589,0.000024955965,0.000011146641,0.00039529972,0.9382607,0.0025578763,0.00026628163,0.00004429307,0.05812181],"study_design_scores_gemma":[0.00041537712,0.00014107379,0.000035428457,0.0002774471,0.000025738645,0.00004416176,0.00014076367,0.96896577,0.02948318,0.000014252377,0.000121049525,0.00033573073],"about_ca_topic_score_codex":0.00012510389,"about_ca_topic_score_gemma":0.0000138384285,"teacher_disagreement_score":0.73527664,"about_ca_system_score_codex":0.00012533602,"about_ca_system_score_gemma":0.00004522138,"threshold_uncertainty_score":0.99991214},"labels":[],"label_agreement":null},{"id":"W2168954868","doi":"10.1109/tmc.2005.42","title":"Information raining and optimal link-layer design for mobile hotspots","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","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 Toronto","funders":"","keywords":"Computer science; Heuristics; Bipartite graph; Network packet; Repeater (horology); Computer network; Theoretical computer science; Artificial intelligence; Graph","score_opus":0.044549062107336765,"score_gpt":0.29518761822612294,"score_spread":0.25063855611878616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168954868","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016675916,0.00023991574,0.9813622,0.0002697594,0.00027136505,0.0007859441,0.0000026786481,0.00026999568,0.00012222797],"genre_scores_gemma":[0.7908808,0.00014025386,0.20828891,0.00037930548,0.0000809452,0.00017246006,0.0000015219068,0.000009793884,0.000046031208],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988741,0.00010842605,0.00036260794,0.00022601086,0.00014586629,0.00028293967],"domain_scores_gemma":[0.99866587,0.0005655486,0.00011216938,0.0003986093,0.00016262844,0.00009518455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005718813,0.0001753772,0.0001739179,0.0001946162,0.00073576905,0.00027813786,0.0004268306,0.0000741513,0.000014382484],"category_scores_gemma":[0.000009037101,0.00018259905,0.000074754375,0.0003397254,0.000039119193,0.00095198036,0.00001405789,0.00024842433,0.000026712272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007832412,0.00002222068,8.7262276e-7,0.0000046467235,0.000008438977,8.6637705e-8,0.0020278536,0.4569329,0.000236962,0.00013316615,0.000060588198,0.5405644],"study_design_scores_gemma":[0.0006147506,0.00024819962,0.000027116968,0.000048689886,0.000007979358,0.00001192557,0.00014530844,0.9820607,0.0055633336,0.000013968808,0.011048681,0.00020939198],"about_ca_topic_score_codex":0.0000011125513,"about_ca_topic_score_gemma":0.0000019264169,"teacher_disagreement_score":0.77420485,"about_ca_system_score_codex":0.000071310635,"about_ca_system_score_gemma":0.00005442263,"threshold_uncertainty_score":0.7446173},"labels":[],"label_agreement":null},{"id":"W2170777543","doi":"10.1109/tmc.2007.70727","title":"A Noncooperative Game-Theoretic Framework for Radio Resource Management in 4G Heterogeneous Wireless Access Networks","year":2008,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Networks and Protocols","field":"Computer Science","cited_by":181,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer network; Computer science; Wireless network; Quality of service; Bandwidth allocation; Dynamic bandwidth allocation; Heterogeneous wireless network; Bandwidth (computing); Resource allocation; Radio resource management; Handover; Call Admission Control; Heterogeneous network; Wireless; Telecommunications","score_opus":0.025249061896740706,"score_gpt":0.29745286295817197,"score_spread":0.27220380106143127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170777543","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018844714,0.0001062511,0.9734726,0.00008309462,0.0005266604,0.0065240366,0.0000034349248,0.00026142361,0.00017780525],"genre_scores_gemma":[0.9572805,0.00009287579,0.03771351,0.00038603676,0.00018672286,0.004219206,0.0000018607233,0.00004679952,0.00007246859],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974097,0.00022749328,0.00054766115,0.0008270742,0.00028288097,0.00070520665],"domain_scores_gemma":[0.99816173,0.00074734126,0.00015688657,0.00072441244,0.000062178726,0.00014742279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038878463,0.0003513974,0.00042494287,0.00023690853,0.00047453135,0.00025422752,0.001252091,0.00019406468,0.000012781349],"category_scores_gemma":[0.0000023208586,0.00035547046,0.00020276674,0.00096175,0.000120196346,0.00025844263,0.000027852702,0.00059305085,0.000007852034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068545996,0.00019418591,0.00001547527,0.000035106,0.00004337251,0.000071885544,0.00079348154,0.8549477,0.000003198433,0.002673076,0.000065134656,0.14108886],"study_design_scores_gemma":[0.0009731241,0.0003377336,0.0000364354,0.00036473272,0.000012694318,0.000070780465,0.00003590444,0.99484926,0.0010332406,0.0010390853,0.0008255782,0.00042141046],"about_ca_topic_score_codex":0.000011341951,"about_ca_topic_score_gemma":0.00000985146,"teacher_disagreement_score":0.9384358,"about_ca_system_score_codex":0.00015427174,"about_ca_system_score_gemma":0.00004391899,"threshold_uncertainty_score":0.99988973},"labels":[],"label_agreement":null},{"id":"W2172100059","doi":"10.1109/tmc.2013.147","title":"A Scalable Bandwidth-Efficient Hybrid Adaptive Service Discovery Protocol for Vehicular Networks with Infrastructure Support","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Computer network; Service discovery; Scalability; Correctness; Service provider; Bandwidth (computing); Routing protocol; Network packet; Vehicular ad hoc network; Service (business); Distributed computing; Wireless ad hoc network; Wireless; Web service; Telecommunications; World Wide Web; Database","score_opus":0.00934413978443698,"score_gpt":0.23763467440057165,"score_spread":0.22829053461613466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172100059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029069555,0.0000033649144,0.9419306,0.00005918605,0.00048178626,0.05405308,0.0000097648235,0.00039632723,0.00015893298],"genre_scores_gemma":[0.8540322,5.309002e-7,0.0557517,0.000695546,0.0002865239,0.089064986,0.000005581983,0.000072298135,0.00009062569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968849,0.00017030757,0.00053164025,0.0010630263,0.0004918156,0.00085834146],"domain_scores_gemma":[0.9976583,0.00048132867,0.00028146643,0.0010366604,0.00031798432,0.00022422218],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005661954,0.0004852756,0.0004688173,0.00014867209,0.00069517386,0.00041818508,0.0009763142,0.00014559379,0.000023114892],"category_scores_gemma":[0.0000039372376,0.00041211228,0.00019236648,0.0008127022,0.00008088024,0.00045834153,0.000023482951,0.000617678,0.000015464771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014146596,0.00019723215,0.000011990903,0.00006210799,0.000050311704,0.000006708476,0.00015349897,0.94070077,0.000039930546,0.0002880038,0.00032896388,0.058019042],"study_design_scores_gemma":[0.0019769138,0.0012605467,0.000052124924,0.00023881771,0.000031215797,0.00007290716,0.000027744682,0.9887027,0.0025693122,0.00008824235,0.004481807,0.000497664],"about_ca_topic_score_codex":0.000021279971,"about_ca_topic_score_gemma":0.00002119062,"teacher_disagreement_score":0.8861789,"about_ca_system_score_codex":0.00016654094,"about_ca_system_score_gemma":0.00017685203,"threshold_uncertainty_score":0.99983305},"labels":[],"label_agreement":null},{"id":"W2206237806","doi":"10.1109/tmc.2015.2460251","title":"Diffusion Adaptation over Multi-Agent Networks with Wireless Link Impairments","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Division of Electrical, Communications and Cyber Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Fading; Computer science; Channel state information; Path loss; Computer network; Channel (broadcasting); Wireless network; Wireless; Diffusion; Equalization (audio); Distributed computing; Telecommunications","score_opus":0.0247672620838634,"score_gpt":0.25323016102580603,"score_spread":0.22846289894194263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2206237806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24639523,0.000033415177,0.75166136,0.0000025999652,0.0004393045,0.00034752116,0.0000047893977,0.0010826382,0.000033120254],"genre_scores_gemma":[0.9454534,0.000026483407,0.05421573,0.000020424233,0.000089701505,0.00007307761,0.0000053652657,0.00007549498,0.000040321887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896365,0.000033712004,0.00023876254,0.00025788226,0.00020593911,0.00030002458],"domain_scores_gemma":[0.99944454,0.00005139906,0.00005303434,0.00024573624,0.00006954599,0.00013572053],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010636393,0.00024406408,0.000189112,0.00011416426,0.00012673174,0.000034485543,0.00012694643,0.000093792056,0.00000798498],"category_scores_gemma":[0.0000011258278,0.0002346451,0.000055702752,0.00021916284,0.000032824148,0.00016145443,0.0000031780337,0.00034712956,0.000010718645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025791309,0.00007166485,0.000035112214,0.000013693452,0.000025064572,0.000009161756,0.00041359718,0.9065082,0.0011993538,0.0000016766755,0.000019062538,0.09167759],"study_design_scores_gemma":[0.000749279,0.00027857765,0.0002361504,0.00016796011,0.000016199712,0.000012655812,0.00013433046,0.99260056,0.005295816,0.0000065155564,0.00023207431,0.00026986035],"about_ca_topic_score_codex":0.000020380514,"about_ca_topic_score_gemma":0.000019323605,"teacher_disagreement_score":0.6990582,"about_ca_system_score_codex":0.0002756578,"about_ca_system_score_gemma":0.000015204506,"threshold_uncertainty_score":0.95685494},"labels":[],"label_agreement":null},{"id":"W2320242814","doi":"10.1109/tmc.2016.2538227","title":"Energy Aware Offloading for Competing Users on a Shared Communication Channel","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":83,"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; Nash equilibrium; Upload; Cloud computing; Energy consumption; Base station; Game theory; Channel (broadcasting); Distributed computing; Computation offloading; Set (abstract data type); Computer network; Mathematical optimization; Edge computing; Operating system","score_opus":0.024778383875383145,"score_gpt":0.257888408299263,"score_spread":0.23311002442387987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320242814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018832842,0.000041789324,0.9747797,0.00048439414,0.004554543,0.00038634884,0.0000049071773,0.00065536075,0.000260066],"genre_scores_gemma":[0.9840162,0.000016834818,0.0147420885,0.00040034569,0.0005299161,0.0000987975,0.000004296078,0.000047770893,0.00014376214],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976239,0.00017453419,0.00052384543,0.00070923014,0.00030213143,0.00066636276],"domain_scores_gemma":[0.99680716,0.0016865152,0.00024721678,0.0009121199,0.00019526623,0.00015170276],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005721223,0.00033313697,0.00033045464,0.0003396201,0.0012279939,0.00022765178,0.0011459814,0.00013043081,0.000005109867],"category_scores_gemma":[0.000013646876,0.0002897002,0.000250977,0.00047875513,0.00006062435,0.00041434963,0.000026655933,0.00024089786,0.000038499646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006209153,0.00031172278,0.000020651094,0.000055363806,0.00009148011,0.0000048192996,0.0022060794,0.047347773,0.0037122122,0.0006820421,0.0013864766,0.9441193],"study_design_scores_gemma":[0.0014244237,0.00043702408,0.000034783614,0.0009985336,0.000019658088,0.000018628001,0.00012039039,0.9620715,0.029087966,0.00048048768,0.0047022724,0.00060434075],"about_ca_topic_score_codex":0.000037041842,"about_ca_topic_score_gemma":0.0000065269214,"teacher_disagreement_score":0.9651833,"about_ca_system_score_codex":0.00023459159,"about_ca_system_score_gemma":0.00006631917,"threshold_uncertainty_score":0.99995553},"labels":[],"label_agreement":null},{"id":"W2333394547","doi":"10.1109/tmc.2016.2547867","title":"NoPSM: A Concurrent MAC Protocol over Low-Data-Rate Low-Power Wireless Channel without PRR-SINR Model","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","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":"Carleton University","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Throughput; Concurrency; Network packet; Block (permutation group theory); Distributed computing; Wireless sensor network; Wireless","score_opus":0.02273045278110039,"score_gpt":0.2851860075487925,"score_spread":0.2624555547676921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333394547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044892535,0.0000083390605,0.9381707,0.000111763446,0.0015624352,0.014201751,0.000051258852,0.00082864,0.00017261025],"genre_scores_gemma":[0.9863408,0.0000071047616,0.0051594474,0.00027113606,0.0001609566,0.007567993,0.000004190945,0.00009192044,0.0003964412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99539936,0.00028859457,0.00083051354,0.001671489,0.0007268469,0.0010832085],"domain_scores_gemma":[0.9964221,0.00040895535,0.00038517005,0.0021939867,0.000256029,0.0003337706],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006917849,0.00062847417,0.0005655754,0.00028694174,0.0005736615,0.00028635375,0.00222843,0.00024204221,0.00004024984],"category_scores_gemma":[0.000008256004,0.00049697346,0.00021156119,0.0007299118,0.00020403016,0.00079708395,0.00008404348,0.0005826246,0.00012618951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044337503,0.0006492109,0.000010824463,0.00005814119,0.0000531736,0.000016868209,0.00035224133,0.92817026,0.0037572926,0.00029967798,0.00024646922,0.06634152],"study_design_scores_gemma":[0.0019445644,0.00020079066,0.000020725776,0.00079162593,0.000017931561,0.00001929115,0.000014083229,0.97955614,0.016321108,0.00003566529,0.00039753932,0.00068052753],"about_ca_topic_score_codex":0.000018539999,"about_ca_topic_score_gemma":0.000022520084,"teacher_disagreement_score":0.9414483,"about_ca_system_score_codex":0.00024925746,"about_ca_system_score_gemma":0.00022861482,"threshold_uncertainty_score":0.9997482},"labels":[],"label_agreement":null},{"id":"W2343343021","doi":"10.1109/tmc.2015.2513052","title":"Resource Allocation for an OFDMA Cloud-RAN of Small Cells Underlaying a Macrocell","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Macrocell; Computer science; Transmitter power output; Quality of service; Computer network; Cellular network; Telecommunications link; Radio access network; Resource allocation; Optimization problem; Base station; Mobile station; Algorithm; Transmitter","score_opus":0.0326695615136331,"score_gpt":0.253141921735149,"score_spread":0.2204723602215159,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2343343021","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08403331,0.00012540583,0.9139063,0.000004428313,0.0007079197,0.0006574019,0.000019735582,0.00037180094,0.0001737533],"genre_scores_gemma":[0.96266204,0.000012195198,0.036962133,0.0000139251315,0.000113545226,0.00008112718,0.000010351885,0.000075010874,0.00006967896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989676,0.00004335412,0.00040143874,0.00023733589,0.00011170776,0.00023857482],"domain_scores_gemma":[0.9992299,0.00015357068,0.00009827594,0.00025672137,0.0001492997,0.00011222781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023964724,0.00017880359,0.00022291137,0.00014448164,0.00010575957,0.000023267903,0.0001462544,0.00010319044,0.000002957008],"category_scores_gemma":[0.0000042151096,0.0002121908,0.000075911536,0.00026752052,0.000019232097,0.000120835844,0.0000011529714,0.00014235804,0.0000047589583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002417052,0.00006191789,0.0000019931335,0.00013637402,0.00002310361,2.1929347e-7,0.0013017089,0.94654447,0.03140855,0.000010125203,0.000052033774,0.020435352],"study_design_scores_gemma":[0.0005996836,0.00014598345,8.236349e-7,0.00011000799,0.0000280996,0.0000028681218,0.0009530639,0.8208895,0.1766696,0.000022693772,0.0004018616,0.0001758498],"about_ca_topic_score_codex":0.000019431982,"about_ca_topic_score_gemma":0.000024331453,"teacher_disagreement_score":0.87862873,"about_ca_system_score_codex":0.00013974622,"about_ca_system_score_gemma":0.0000267087,"threshold_uncertainty_score":0.865289},"labels":[],"label_agreement":null},{"id":"W2345267774","doi":"10.1109/tmc.2016.2519343","title":"Relay-Assisted Device-to-Device Communication: A Stochastic Analysis of Energy Saving","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Relay; Computer science; Energy consumption; Poisson point process; Energy (signal processing); Monte Carlo method; Wireless; Probabilistic logic; Point (geometry); Stochastic geometry; Efficient energy use; Point process; Electronic engineering; Telecommunications; Electrical engineering; Mathematics; Engineering; Statistics; Artificial intelligence","score_opus":0.014241619449268514,"score_gpt":0.24980913974319308,"score_spread":0.23556752029392455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2345267774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03985346,0.00014388298,0.9589778,0.000018047103,0.00022751233,0.00020472507,0.00002156594,0.00037081612,0.0001821547],"genre_scores_gemma":[0.983069,0.000023198932,0.016665071,0.000024325916,0.000021233802,0.00006742735,0.0000054319685,0.00004928097,0.00007505467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987002,0.000082997474,0.00056190137,0.00025380225,0.00016272698,0.00023837389],"domain_scores_gemma":[0.9984132,0.00057422294,0.00012489266,0.000629365,0.00016159685,0.000096713666],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016734692,0.00019839304,0.00038363572,0.00060115714,0.00016167517,0.000018124907,0.00024980502,0.00008990504,0.000043285643],"category_scores_gemma":[0.000011087192,0.00018613713,0.00015684991,0.0016740479,0.000031456566,0.00014318856,0.000004003037,0.000119441196,0.000015357811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076883525,0.000036648904,0.00001252387,0.000021734808,0.00032861574,4.418403e-7,0.0002455584,0.9400271,0.008681493,0.00002091737,0.000007667204,0.05060958],"study_design_scores_gemma":[0.0004275902,0.00006276046,0.00026823313,0.0004942899,0.00045840855,0.000005350853,0.00016693112,0.99016553,0.007475883,0.0000060054517,0.0001446421,0.0003243694],"about_ca_topic_score_codex":0.000041594394,"about_ca_topic_score_gemma":0.00020896031,"teacher_disagreement_score":0.9432155,"about_ca_system_score_codex":0.0002262914,"about_ca_system_score_gemma":0.000017039245,"threshold_uncertainty_score":0.7590452},"labels":[],"label_agreement":null},{"id":"W2415364921","doi":"10.1109/tmc.2015.2480063","title":"Optimizing Video Request Routing in Mobile Networks with Built-in Content Caching","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":24,"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; Computer network; Server; Distributed computing; Static routing; Routing (electronic design automation); Routing protocol; Policy-based routing; Dynamic Source Routing","score_opus":0.037449273134749175,"score_gpt":0.25452774424474595,"score_spread":0.21707847110999678,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2415364921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35474977,0.00022127495,0.6436563,0.000036939477,0.0005828027,0.00036322206,8.4609576e-7,0.00023387023,0.00015498386],"genre_scores_gemma":[0.99184304,0.00002080653,0.007688958,0.00018815529,0.00008140872,0.00009422917,0.0000013558999,0.000033798242,0.00004824955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973136,0.00026019342,0.000609726,0.00075209205,0.00037939235,0.0006849627],"domain_scores_gemma":[0.99855095,0.00035750872,0.00016614584,0.0006131788,0.00011472852,0.0001974752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011923658,0.00031995593,0.00041571725,0.00040111807,0.00024916962,0.00026817413,0.00067721796,0.000116536175,0.0000018724887],"category_scores_gemma":[0.000012235512,0.00030984887,0.00010955183,0.0008341156,0.00004660558,0.0005875683,0.000020074047,0.00095877785,0.000010130789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040824332,0.00017106473,0.0007073865,0.000007273118,0.0000141866185,0.00009661132,0.0016301357,0.95591056,0.00023138047,0.000055509925,0.0000058983246,0.041129142],"study_design_scores_gemma":[0.0017584123,0.00038818247,0.00014200619,0.0005327322,0.000009278936,0.000070134716,0.0010908265,0.9950622,0.00051421166,0.000011613654,0.000035472578,0.00038496693],"about_ca_topic_score_codex":0.0014861668,"about_ca_topic_score_gemma":0.0007458408,"teacher_disagreement_score":0.63709325,"about_ca_system_score_codex":0.00043270702,"about_ca_system_score_gemma":0.00012538284,"threshold_uncertainty_score":0.9999354},"labels":[],"label_agreement":null},{"id":"W2461609381","doi":"10.1109/tmc.2016.2591527","title":"Characterizing the Instantaneous Connectivity of Large-Scale Urban Vehicular Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Human Mobility and Location-Based Analysis","field":"Social Sciences","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":"Seventh Framework Programme; Research Executive Agency","keywords":"Network topology; Computer science; Vehicular ad hoc network; Context (archaeology); Topology (electrical circuits); Navigability; Software deployment; Computer network; Reliability (semiconductor); Block (permutation group theory); Distributed computing; Wireless ad hoc network; Telecommunications; Wireless; Engineering; Power (physics)","score_opus":0.011533657406296588,"score_gpt":0.26491191103532524,"score_spread":0.25337825362902866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2461609381","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48819992,0.000030270334,0.51070356,0.00030761474,0.0002177285,0.00020640231,0.000010614804,0.000062614185,0.00026125388],"genre_scores_gemma":[0.99940145,0.000047638685,0.000047346253,0.00014083202,0.00017586089,0.000023601748,0.0000010311484,0.000011656611,0.00015060045],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983502,0.00046193882,0.00030369844,0.00027175172,0.0002848417,0.00032754717],"domain_scores_gemma":[0.99829525,0.0010484902,0.00014857082,0.00032070503,0.00010904863,0.000077934295],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012502425,0.00011994161,0.00021277285,0.000074370655,0.0013161815,0.000040251252,0.0002567232,0.00009964641,0.00021916932],"category_scores_gemma":[0.00002349575,0.000082840466,0.00019796067,0.0004088794,0.00029857102,0.00010243604,0.0000024697708,0.00020512349,0.000015384627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014092207,0.0016280041,0.0038205665,0.00006894791,0.0003962377,0.0000150461365,0.057786603,0.336903,0.011250619,0.0019205741,0.000104802275,0.5859647],"study_design_scores_gemma":[0.0046048225,0.0012982722,0.010091076,0.001897215,0.0010339674,0.000023503915,0.05379798,0.8002316,0.062999845,0.0008821545,0.06039423,0.002745349],"about_ca_topic_score_codex":0.0006476153,"about_ca_topic_score_gemma":0.003266027,"teacher_disagreement_score":0.5832193,"about_ca_system_score_codex":0.0001267514,"about_ca_system_score_gemma":0.00009432064,"threshold_uncertainty_score":0.99998397},"labels":[],"label_agreement":null},{"id":"W2462138333","doi":"10.1109/tmc.2016.2582482","title":"Utility Maximization for Multimedia Data Dissemination in Large-Scale VANETs","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":61,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Dissemination; Scalability; Wireless ad hoc network; Computer network; Quality of service; Maximization; Path (computing); Taxis; Distributed computing; Multimedia; Telecommunications; Wireless; Mathematical optimization","score_opus":0.014978766361281494,"score_gpt":0.2626810506432161,"score_spread":0.24770228428193464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2462138333","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11287372,0.00006553795,0.88502306,0.000024995492,0.0007517038,0.0006749173,0.00021129596,0.00032381044,0.000050981005],"genre_scores_gemma":[0.9892179,0.000044897988,0.010352653,0.000010656771,0.00009953814,0.000062944324,0.00010163891,0.00005209013,0.00005769812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861753,0.0000474035,0.00035850191,0.00040360942,0.00016042868,0.00041250524],"domain_scores_gemma":[0.99880016,0.00046040775,0.000044574506,0.00056587125,0.000049558417,0.00007944771],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042377063,0.00018886596,0.0001995708,0.00013823889,0.00011271688,0.00002798483,0.00027513545,0.00012999687,0.00006089346],"category_scores_gemma":[0.000014165391,0.00017555282,0.00005825278,0.00024840876,0.000024277038,0.0002782522,0.0000048302854,0.0001753717,0.00002330383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009796902,0.000080661914,0.00011336546,0.000031673175,0.00001282832,0.0000011529736,0.00015720085,0.7159725,0.0011472133,8.6452434e-7,0.00021963478,0.28225315],"study_design_scores_gemma":[0.00072340283,0.00002883282,0.00077750394,0.00017157794,0.000018340565,0.000003596365,0.000047990987,0.99126285,0.0055056335,0.000015264784,0.0012436897,0.00020133684],"about_ca_topic_score_codex":0.000004881132,"about_ca_topic_score_gemma":0.00025953204,"teacher_disagreement_score":0.87634414,"about_ca_system_score_codex":0.00010797559,"about_ca_system_score_gemma":0.000015161673,"threshold_uncertainty_score":0.7158836},"labels":[],"label_agreement":null},{"id":"W2469954218","doi":"10.1109/tmc.2016.2585106","title":"Network Coding as a Performance Booster for Concurrent Multi-Path Transfer of Data in Multi-Hop Wireless Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Linear network coding; Network packet; Transport layer; Stream Control Transmission Protocol; Testbed; Wireless network; Distributed computing; Network layer; Wireless; Layer (electronics)","score_opus":0.09436529703555026,"score_gpt":0.3288500961123661,"score_spread":0.23448479907681585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2469954218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04294038,0.00033483712,0.95475954,0.0001365433,0.0008439618,0.00083216245,0.0000170742,0.00011940106,0.00001610276],"genre_scores_gemma":[0.97803706,0.00083037274,0.020702165,0.00016351476,0.000066529145,0.000098902005,0.000005610395,0.00002631268,0.00006953446],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977679,0.00021438113,0.00067000365,0.0006475,0.0001894763,0.00051072065],"domain_scores_gemma":[0.99759126,0.00085918256,0.00012039259,0.0011907257,0.00014086225,0.00009760542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008760882,0.00026204175,0.00038201074,0.0001410338,0.00036477004,0.00006832553,0.0016048906,0.000102233964,0.000013252915],"category_scores_gemma":[0.0000078540525,0.00021937038,0.00010369143,0.0005528446,0.000095733456,0.00060882815,0.000050165574,0.00031142015,0.0000073781903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003902442,0.00031744828,0.00023886151,0.000040625004,0.0000306241,0.000001287651,0.00077374466,0.16536206,0.0010809209,0.00047723134,0.000042552823,0.8315956],"study_design_scores_gemma":[0.0023098486,0.00019148692,0.00032296992,0.0008509602,0.000012369691,0.000005762697,0.000025262647,0.99334836,0.0020634762,0.0000039239208,0.0005791144,0.00028645582],"about_ca_topic_score_codex":0.0000066447496,"about_ca_topic_score_gemma":0.000085851665,"teacher_disagreement_score":0.9350967,"about_ca_system_score_codex":0.00009189824,"about_ca_system_score_gemma":0.00008208435,"threshold_uncertainty_score":0.8945665},"labels":[],"label_agreement":null},{"id":"W2512240773","doi":"10.1109/tmc.2016.2604260","title":"How to Download More Data from Neighbors? A Metric for D2D Data Offloading Opportunity","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Computer network; Mobile device; Metric (unit); Object (grammar); Download; Mobile computing; Distributed computing; Operating system","score_opus":0.10744815447260204,"score_gpt":0.3154034379914188,"score_spread":0.20795528351881676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2512240773","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002636759,0.00008338077,0.9892347,0.0018884145,0.0019712688,0.00079294055,0.002898372,0.0003992941,0.00009486203],"genre_scores_gemma":[0.9178651,0.000039645583,0.08041787,0.0007993299,0.00034268637,0.000043440454,0.00021325205,0.00002904858,0.00024962582],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966169,0.00011073146,0.0005096231,0.0016096906,0.00047139527,0.00068167114],"domain_scores_gemma":[0.9927946,0.0018978631,0.00021295398,0.004355477,0.0001617992,0.0005773509],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083323615,0.00036235127,0.00046626633,0.0003447659,0.00055808487,0.00051309,0.004476048,0.0001512681,0.000045485864],"category_scores_gemma":[0.00003138257,0.0002911004,0.000110194844,0.0009080708,0.00006816625,0.0014157328,0.00018477258,0.0002789452,0.000060153936],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035448975,0.0002037732,0.000014786992,0.000016525393,0.000099527744,0.000022402039,0.00015599716,0.0017056656,0.0005434485,0.000050202936,0.01299998,0.98415226],"study_design_scores_gemma":[0.0008326256,0.00020545753,0.000012363984,0.00015806961,0.000076229684,0.000017588694,0.0000853424,0.9754565,0.0006602544,0.00014632182,0.021864679,0.0004846153],"about_ca_topic_score_codex":0.00008104598,"about_ca_topic_score_gemma":0.000024824863,"teacher_disagreement_score":0.9836676,"about_ca_system_score_codex":0.00009543371,"about_ca_system_score_gemma":0.00024259434,"threshold_uncertainty_score":0.9999541},"labels":[],"label_agreement":null},{"id":"W2517006165","doi":"10.1109/tmc.2016.2607748","title":"Delay Analysis and Routing for Two-Dimensional VANETs Using Carry-and-Forward Mechanism","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":78,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Flooding (psychology); Computer network; Propagation delay; Wireless ad hoc network; Path (computing); Shortest path problem; Node (physics); Routing protocol; Routing (electronic design automation); Transmission delay; Topology (electrical circuits); Wireless; Network packet; Telecommunications; Mathematics","score_opus":0.009755353520571488,"score_gpt":0.23498105210495276,"score_spread":0.22522569858438127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2517006165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45831457,0.00007968117,0.5409345,0.000007961712,0.00024723247,0.00022379636,0.000018636016,0.0001658524,0.00000773918],"genre_scores_gemma":[0.9805529,0.000012523733,0.019175444,0.00003277275,0.00011191107,0.000026981788,0.0000033236306,0.000062966865,0.000021135475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985016,0.000047063513,0.00036161693,0.0004164739,0.00018439852,0.0004888417],"domain_scores_gemma":[0.99905074,0.00043388465,0.000062885105,0.000224697,0.00006414599,0.0001636336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034582135,0.00027791443,0.0003776886,0.0002770178,0.00035969916,0.000054278073,0.00009026401,0.00011888685,0.000020289432],"category_scores_gemma":[0.0000044835697,0.00024659932,0.00018691453,0.00034513616,0.000041888314,0.00012883691,0.000005026325,0.00019236986,0.0000035282028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096867825,0.000013379373,0.00003174422,0.000019874064,0.00041851113,0.0000047237513,0.00009979235,0.9459402,0.017135093,0.000030005825,0.0000044233093,0.03629256],"study_design_scores_gemma":[0.00073010114,0.000056159162,0.000036029218,0.00010117519,0.00050561863,0.000054170247,0.000026948983,0.9831747,0.014895041,0.0000863352,0.000030661784,0.00030310033],"about_ca_topic_score_codex":0.000035963953,"about_ca_topic_score_gemma":0.0000670434,"teacher_disagreement_score":0.5222384,"about_ca_system_score_codex":0.00012966082,"about_ca_system_score_gemma":0.000017381357,"threshold_uncertainty_score":0.9999986},"labels":[],"label_agreement":null},{"id":"W2546966125","doi":"10.1109/tmc.2016.2624732","title":"PLP: Protecting Location Privacy Against Correlation Analyze Attack in Crowdsensing","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Crowdsensing; Publication; Context (archaeology); Computer security; Field (mathematics); Data mining; Internet privacy","score_opus":0.01840302831943537,"score_gpt":0.25890753243447356,"score_spread":0.2405045041150382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2546966125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3973673,0.00002179817,0.60109305,0.00010005839,0.00056489394,0.00038332032,6.661991e-7,0.00032781265,0.00014112753],"genre_scores_gemma":[0.9861557,0.0000074927925,0.013452164,0.00011735369,0.000104970575,0.000029391811,8.067026e-7,0.00003681433,0.00009533717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99718976,0.00032200353,0.00068821246,0.0008298032,0.00037904398,0.0005911608],"domain_scores_gemma":[0.9979124,0.000702941,0.0002735085,0.00078224845,0.00020383215,0.00012503988],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009994279,0.00031218276,0.0003096814,0.00052853976,0.00066696585,0.00023803035,0.00043660606,0.00016086426,0.0000061503124],"category_scores_gemma":[0.00007389653,0.00027635793,0.00013134105,0.0013524772,0.000070406306,0.00064088014,0.000013561833,0.0005279945,0.00008065351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010399531,0.00008877616,0.00027096755,0.000021661395,0.0000123337,0.000012132711,0.0010960812,0.5223055,0.014378397,0.000040120874,0.000010538167,0.46175307],"study_design_scores_gemma":[0.0009715935,0.0001319741,0.0011346706,0.0011131212,0.0000114714585,0.00004664875,0.00015959154,0.9660312,0.02964935,0.00010395191,0.00015106009,0.0004953593],"about_ca_topic_score_codex":0.00003717291,"about_ca_topic_score_gemma":0.00002713297,"teacher_disagreement_score":0.5887884,"about_ca_system_score_codex":0.0003960269,"about_ca_system_score_gemma":0.00010390879,"threshold_uncertainty_score":0.9999689},"labels":[],"label_agreement":null},{"id":"W2550686015","doi":"10.1109/tmc.2016.2632715","title":"DV-maxHop: A Fast and Accurate Range-Free Localization Algorithm for Anisotropic Wireless Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","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":"Acadia University","funders":"","keywords":"Computer science; Wireless sensor network; Algorithm; Network topology; Node (physics); Isotropy; Wireless; Range (aeronautics); Distributed computing; Computer network; Telecommunications","score_opus":0.007684205611487831,"score_gpt":0.21500571793343587,"score_spread":0.20732151232194804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2550686015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0078007644,0.00013293131,0.98965526,0.000035900946,0.000741384,0.00048079086,0.000043464308,0.001076658,0.00003282667],"genre_scores_gemma":[0.9934993,0.00028125333,0.0058550886,0.00004032955,0.00010267215,0.000102248,0.0000038845014,0.000056679222,0.000058538815],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990151,0.000021778713,0.00027679454,0.00025851635,0.00010387491,0.0003239209],"domain_scores_gemma":[0.9993731,0.00019036702,0.000045184057,0.00027080462,0.00006488505,0.00005565622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008856938,0.00020998165,0.00020932779,0.0001440718,0.00027578173,0.00005636906,0.00017596984,0.00017198296,0.000014876878],"category_scores_gemma":[0.0000051143475,0.00017677218,0.00007141991,0.00024753783,0.000077474746,0.00014462149,0.0000039790134,0.0001262442,0.0000056879267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005413448,0.000013984465,0.000014053712,0.000023629813,0.000022751941,8.640951e-7,0.000056503643,0.45056412,0.00017002597,0.00005322355,0.00010028916,0.54897517],"study_design_scores_gemma":[0.0011563795,0.00010349349,0.000020216286,0.00010570564,0.000025837668,0.0000074913382,0.00009717536,0.985476,0.012046875,0.00014048092,0.00058278453,0.00023754663],"about_ca_topic_score_codex":0.000004882218,"about_ca_topic_score_gemma":0.0000132839805,"teacher_disagreement_score":0.9856985,"about_ca_system_score_codex":0.00008371785,"about_ca_system_score_gemma":0.000009672026,"threshold_uncertainty_score":0.720856},"labels":[],"label_agreement":null},{"id":"W2552070661","doi":"10.1109/tmc.2016.2628034","title":"A Priority-Aware Truthful Mechanism for Supporting Multi-Class Delay-Sensitive Medical Packet Transmissions in E-Health Networks","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Body Area Networks","field":"Engineering","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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Network packet; Base station; Queueing theory; Body area network; Default gateway; Quality of service; Gateway (web page); Wireless; Scheduling (production processes); Wireless network; Transmission (telecommunications); Telecommunications; Wireless sensor network","score_opus":0.013108353161062373,"score_gpt":0.2700638260722778,"score_spread":0.25695547291121545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552070661","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053435754,0.000050101622,0.94294775,0.00037007584,0.0012496206,0.00115092,0.00006499431,0.0007075284,0.000023257062],"genre_scores_gemma":[0.9940354,0.0001522056,0.005047023,0.0001671116,0.00022837482,0.00018871947,0.000009630121,0.00013474099,0.00003675273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967559,0.00018045664,0.0010227531,0.00057524495,0.00036312744,0.0011025172],"domain_scores_gemma":[0.9977066,0.0012739196,0.00013823446,0.00033242884,0.00009163342,0.00045721748],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00095588696,0.00041710105,0.00059100933,0.00026300267,0.00038082292,0.00003541408,0.00026290765,0.0004118643,0.000054912944],"category_scores_gemma":[0.000027075257,0.00037058952,0.00024871534,0.00041908683,0.00007070442,0.00014956133,0.0000040005402,0.00079775206,0.000009977669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037576967,0.00016271207,0.000011709716,0.000121372526,0.000065411456,0.000037577054,0.00075508386,0.68457735,0.00034789465,0.0001325301,0.00006866373,0.3136821],"study_design_scores_gemma":[0.0021540092,0.00016181676,0.000033030163,0.001240124,0.000019913328,0.000045391247,0.00027172404,0.99254113,0.0029106645,0.00007241507,0.00013083097,0.00041892484],"about_ca_topic_score_codex":0.000039605402,"about_ca_topic_score_gemma":0.0003830473,"teacher_disagreement_score":0.9405997,"about_ca_system_score_codex":0.00041253984,"about_ca_system_score_gemma":0.00016198322,"threshold_uncertainty_score":0.9998746},"labels":[],"label_agreement":null},{"id":"W2560891425","doi":"10.1109/tmc.2016.2645686","title":"Decoupled Uplink-Downlink User Association in Multi-Tier Full-Duplex Cellular Networks: A Two-Sided Matching Game","year":2016,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":71,"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 Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications link; Cellular network; Base station; Karush–Kuhn–Tucker conditions; Computer network; Association scheme; Mathematical optimization; Provisioning; Optimization problem; Duplex (building); Distributed computing; Algorithm; Mathematics","score_opus":0.013142189507991882,"score_gpt":0.24286624955306113,"score_spread":0.22972406004506926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560891425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47903973,0.00013404463,0.5192731,0.00005481974,0.0005732088,0.0003838903,0.0000100116495,0.00051671575,0.000014445149],"genre_scores_gemma":[0.98758507,0.0002107356,0.011393601,0.00006033294,0.00012132704,0.00020709315,0.000013222092,0.00014011418,0.00026852122],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973901,0.00018160547,0.00087989226,0.00047837445,0.00029855172,0.0007714901],"domain_scores_gemma":[0.99728906,0.0014307146,0.00018072344,0.0008191172,0.00012688672,0.0001534996],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000620451,0.0004262962,0.00047283486,0.00037186148,0.00027602393,0.00010559888,0.0005128145,0.00029298925,0.00014928593],"category_scores_gemma":[0.000032933258,0.00041646982,0.00022703061,0.0006266805,0.000043933436,0.00027266616,0.000011766345,0.00084723363,0.00018798586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014870695,0.0001621879,0.0002057252,0.00002183177,0.00008616781,0.00000484444,0.0005235271,0.9436431,0.034090213,0.000011096779,0.000040911775,0.021195544],"study_design_scores_gemma":[0.0020804028,0.000039346643,0.00045396073,0.00040893882,0.000039143455,0.0000054048755,0.00012058599,0.9898333,0.0062583187,0.0000048079587,0.0002593395,0.00049646705],"about_ca_topic_score_codex":0.00013047717,"about_ca_topic_score_gemma":0.0006156886,"teacher_disagreement_score":0.50854534,"about_ca_system_score_codex":0.0010845516,"about_ca_system_score_gemma":0.0000409083,"threshold_uncertainty_score":0.9998287},"labels":[],"label_agreement":null},{"id":"W2607164663","doi":"10.1109/tmc.2017.2690636","title":"Improving VANET Simulation with Calibrated Vehicular Mobility Traces","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":62,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Fundação de Amparo à Pesquisa do Estado de Minas Gerais; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Computer science; Vehicular ad hoc network; Network topology; Mobility model; Computer network; Reliability (semiconductor); Granularity; Wireless ad hoc network; Key (lock); Network simulation; Cluster analysis; Distributed computing; Graph; Trustworthiness; Topology (electrical circuits); Theoretical computer science; Computer security; Artificial intelligence; Telecommunications; Wireless","score_opus":0.009904312255489899,"score_gpt":0.230969378774905,"score_spread":0.2210650665194151,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607164663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49328744,0.00005063534,0.5053578,0.000005281084,0.00033894007,0.0003527368,0.0000076184465,0.0004862059,0.00011335058],"genre_scores_gemma":[0.99762696,0.00000789837,0.0020555032,0.000017103115,0.00012807886,0.00004153663,0.000006542227,0.00008482708,0.000031531465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842316,0.000058165533,0.00034196043,0.0004233071,0.00027089886,0.00048250458],"domain_scores_gemma":[0.9986603,0.00016832747,0.00012324235,0.0008262386,0.00007664702,0.00014520223],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00026812078,0.000322449,0.00030432185,0.00009236342,0.00082700903,0.00028127583,0.0003301877,0.00016653124,0.000041134826],"category_scores_gemma":[0.0000062278673,0.00031257572,0.00010823443,0.00014194104,0.00009699396,0.00043331095,0.0000033485228,0.0005431424,0.00002758348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022395432,0.00006549827,0.000084723186,0.00006161321,0.00006762459,0.000019064375,0.00012117377,0.94355017,0.0018314011,0.0000015508068,0.0000073667484,0.054167446],"study_design_scores_gemma":[0.00058416184,0.0001260228,0.00071473233,0.00009683545,0.000055923,0.000014022979,0.000047600137,0.9879574,0.00986791,0.000006603419,0.00017783683,0.00035095113],"about_ca_topic_score_codex":0.00010408075,"about_ca_topic_score_gemma":0.00013434092,"teacher_disagreement_score":0.5043395,"about_ca_system_score_codex":0.00012990498,"about_ca_system_score_gemma":0.000030699393,"threshold_uncertainty_score":0.99993265},"labels":[],"label_agreement":null},{"id":"W2744996721","doi":"10.1109/tmc.2017.2737422","title":"Performance Analysis of Network Coding with IEEE 802.11 DCF in Multi-Hop Wireless Networks","year":2017,"lang":"en","type":"preprint","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Retransmission; Computer network; Linear network coding; Network packet; Wireless network; Distributed coordination function; IEEE 802.11; Queueing theory; Unicast; Wireless; Distributed computing; Telecommunications","score_opus":0.04734255140235394,"score_gpt":0.3000373913583815,"score_spread":0.25269483995602754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2744996721","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.234264,0.00022447281,0.763593,0.00003317588,0.0010395359,0.000558091,0.000005945931,0.00016424284,0.00011753171],"genre_scores_gemma":[0.9803682,0.0018241011,0.017399322,0.00006516035,0.00010165418,0.00011912647,0.000012449794,0.00004192063,0.00006808946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644774,0.00041757125,0.00097292295,0.0010625281,0.0004248093,0.0006744265],"domain_scores_gemma":[0.9954093,0.0005388725,0.0009152642,0.0026794972,0.00031475115,0.0001423283],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011364346,0.00056730147,0.0011875636,0.0007954616,0.0009212944,0.0003415185,0.002781775,0.00032797112,0.000013414307],"category_scores_gemma":[0.0000048915035,0.00056723756,0.0003856563,0.0019021347,0.00019058776,0.000308387,0.00012661512,0.0016915996,0.0000034196887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021343056,0.00018559264,0.0032783188,0.000048013168,0.00038224657,0.000005863771,0.0007982728,0.8891241,0.000026534593,0.000041900297,0.000015225363,0.10607262],"study_design_scores_gemma":[0.0005811796,0.00009813156,0.005895571,0.001474171,0.00024452136,0.000003738917,0.000028073346,0.9907473,0.00032599655,0.0000026012956,0.00003758307,0.00056115864],"about_ca_topic_score_codex":0.00009939852,"about_ca_topic_score_gemma":0.0015410706,"teacher_disagreement_score":0.7461937,"about_ca_system_score_codex":0.00023766844,"about_ca_system_score_gemma":0.00020149835,"threshold_uncertainty_score":0.9996779},"labels":[],"label_agreement":null},{"id":"W2747746134","doi":"10.1109/tmc.2017.2741481","title":"An Incentive Mechanism Integrating Joint Power, Channel and Link Management for Social-Aware D2D Content Sharing and Proactive Caching","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","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":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Base station; Cache; Telecommunications link; Power control; Wireless; Scheduling (production processes); Distributed computing; Power (physics); Telecommunications; Mathematical optimization","score_opus":0.052788461821680135,"score_gpt":0.2837829283760228,"score_spread":0.2309944665543427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2747746134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22261372,0.000028033877,0.77567065,0.00017935447,0.00054636155,0.00071772706,0.000010266667,0.00015532681,0.00007857595],"genre_scores_gemma":[0.994805,0.000019668627,0.0047863545,0.00011472276,0.00007649204,0.0001173075,0.0000016230102,0.000024031373,0.000054812528],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829894,0.0000617819,0.00030014248,0.00077685475,0.0001953319,0.00036696743],"domain_scores_gemma":[0.9989777,0.000076018485,0.0002455216,0.00045669323,0.00012889026,0.00011514987],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005422694,0.0002609216,0.00029189218,0.00016593226,0.0029576684,0.0009015522,0.0005228788,0.000082871156,7.0389655e-7],"category_scores_gemma":[0.0000054085153,0.0002605785,0.000113094786,0.000059447317,0.0000679293,0.0007210392,0.000052447594,0.00036549353,9.0654015e-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.00009562194,0.0004218447,0.00007353216,0.00021948817,0.0004887441,0.00004007421,0.017691806,0.006943555,0.008107212,0.016790336,0.0000074831178,0.9491203],"study_design_scores_gemma":[0.0009756391,0.00037040966,0.0004138273,0.00026859954,0.0000478724,0.000015554293,0.00332162,0.9891779,0.003781088,0.0012684431,0.00000697503,0.0003520925],"about_ca_topic_score_codex":0.00018803288,"about_ca_topic_score_gemma":0.000032647895,"teacher_disagreement_score":0.9822343,"about_ca_system_score_codex":0.00010930616,"about_ca_system_score_gemma":0.000017426024,"threshold_uncertainty_score":0.9999846},"labels":[],"label_agreement":null},{"id":"W2767873707","doi":"10.1109/tmc.2017.2771353","title":"QoS-Aware Energy and Jitter-Efficient Downlink Predictive Scheduler for Heterogeneous Traffic LTE Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network 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":"Western University","funders":"","keywords":"Computer science; Jitter; Quality of service; Scheduling (production processes); Telecommunications link; Network packet; Computer network; Efficient energy use; Optimization problem; User equipment; Radio access network; Distributed computing; Real-time computing; Mathematical optimization; Base station; Algorithm","score_opus":0.008430268066044588,"score_gpt":0.22757831187119348,"score_spread":0.2191480438051489,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767873707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10942211,0.00022094551,0.88798046,0.000011702058,0.0014643832,0.00042302316,0.000023124732,0.0004279363,0.00002630344],"genre_scores_gemma":[0.99397874,0.00015805643,0.0052066436,0.000027312022,0.00035160556,0.00016143486,0.000011935604,0.00008591667,0.000018374338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987998,0.000023471475,0.00028163582,0.0003774273,0.00011646948,0.00040120198],"domain_scores_gemma":[0.99917936,0.0001500868,0.00009869825,0.00039836124,0.00006176716,0.000111733796],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000082713486,0.0002720911,0.00025292882,0.000091631795,0.00083364826,0.0001263607,0.00018768874,0.0001551922,0.000004890001],"category_scores_gemma":[0.000002339452,0.0003020806,0.000105582796,0.00007942528,0.00008152315,0.00011580148,0.0000042337724,0.000210029,0.0000010852671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026162437,0.000042201867,0.000002741143,0.00002498204,0.000055763772,0.0000023240593,0.000093958006,0.8828464,0.000056719502,0.000004955631,0.000016854627,0.116826914],"study_design_scores_gemma":[0.00061702455,0.00012984603,0.000020860422,0.0001114593,0.000040551928,0.000013395477,0.000029868723,0.996609,0.0019327559,0.0000035327314,0.00021429501,0.00027744134],"about_ca_topic_score_codex":0.0000020082548,"about_ca_topic_score_gemma":0.000012262344,"teacher_disagreement_score":0.8845566,"about_ca_system_score_codex":0.000097261385,"about_ca_system_score_gemma":0.000009670809,"threshold_uncertainty_score":0.99994314},"labels":[],"label_agreement":null},{"id":"W2768526075","doi":"10.1109/tmc.2017.2775221","title":"Dynamic SON-Enabled Location Management in LTE Networks","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Royal Commission for Jubail and Yanbu","keywords":"Computer science; Overhead (engineering); Computer network; Pooling; Control reconfiguration; Heuristic; Wireless network; Distributed computing; User equipment; Quality of experience; Network packet; Wireless; Quality of service; Base station; Telecommunications; Embedded system; Artificial intelligence","score_opus":0.0070609574632530805,"score_gpt":0.23927205647682184,"score_spread":0.23221109901356876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2768526075","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01468514,0.00008591434,0.98206925,0.0000085200445,0.0012083594,0.0005517735,0.0000013345004,0.00032655787,0.0010631396],"genre_scores_gemma":[0.99030083,0.000101532,0.009265833,0.000008086729,0.000031556836,0.00008973924,0.0000033561225,0.000046987825,0.0001520482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909955,0.000021536087,0.0002886773,0.00023080743,0.00008771758,0.0002717168],"domain_scores_gemma":[0.9993459,0.00003472777,0.000075166434,0.00047420006,0.00002811582,0.00004187962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001489503,0.00016340718,0.00016202552,0.0001609978,0.00032737295,0.00008885798,0.00020638794,0.000077981036,0.000009445203],"category_scores_gemma":[0.000001468549,0.00019705096,0.00004094946,0.00016729876,0.000021826678,0.00024366124,0.0000024397832,0.00022950143,0.000025643387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004555137,0.000025740885,0.000014102021,0.000056981793,0.000021599655,0.0000047050116,0.00008330345,0.91501176,0.00006376059,0.000013489796,0.0000062614085,0.08469376],"study_design_scores_gemma":[0.00046639313,0.00001708473,0.00033379914,0.00019175527,0.000012762763,0.0000030137471,0.00007300759,0.9983419,0.0003132477,0.000022063394,0.000045879864,0.00017905468],"about_ca_topic_score_codex":0.000018728386,"about_ca_topic_score_gemma":0.00008285894,"teacher_disagreement_score":0.97561574,"about_ca_system_score_codex":0.00025143014,"about_ca_system_score_gemma":0.0000053793597,"threshold_uncertainty_score":0.8035505},"labels":[],"label_agreement":null},{"id":"W2769860519","doi":"10.1109/tmc.2017.2777481","title":"A Truthful Online Mechanism for Location-Aware Tasks in Mobile Crowd Sensing","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Auction algorithm; Competitive analysis; Combinatorial auction; Focus (optics); Mechanism design; Block (permutation group theory); Remuneration; Common value auction; Vickrey–Clarke–Groves auction; Online algorithm; Payment; Incentive compatibility; Mathematical optimization; Distributed computing; Incentive; Auction theory; Revenue equivalence; Algorithm; World Wide Web; Upper and lower bounds; Microeconomics","score_opus":0.02346257707735367,"score_gpt":0.28885113307263005,"score_spread":0.2653885559952764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2769860519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20179856,0.000036073176,0.79540634,0.00013694403,0.0014269666,0.0008186185,0.000016955866,0.00030022048,0.000059343234],"genre_scores_gemma":[0.9568253,0.000011306255,0.04251064,0.00020873871,0.00018208801,0.000073320974,0.0000049543974,0.000050552142,0.00013309451],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736404,0.00009919039,0.00061477564,0.0009238088,0.00031687753,0.000681318],"domain_scores_gemma":[0.997114,0.00044587298,0.0003406796,0.0015909285,0.00034858388,0.00015992502],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005756494,0.0003685187,0.00044017963,0.00033365467,0.0017887416,0.000717368,0.0009899564,0.00019248018,0.0000054461952],"category_scores_gemma":[0.000043117892,0.00040500978,0.00021691239,0.0003388251,0.00010064466,0.0004753152,0.00002185902,0.0004918987,0.000019574665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002815684,0.0003899225,0.000020747937,0.000109706896,0.000040781713,0.00003356349,0.0018266235,0.41630888,0.0038657761,0.0006953287,0.000043874596,0.5766367],"study_design_scores_gemma":[0.0011372066,0.00027090084,0.00010228942,0.00042481947,0.000021753749,0.000059645965,0.0004821762,0.9667752,0.029178744,0.0008073406,0.00025465322,0.0004852972],"about_ca_topic_score_codex":0.00019238595,"about_ca_topic_score_gemma":0.0002567735,"teacher_disagreement_score":0.75502676,"about_ca_system_score_codex":0.00018829445,"about_ca_system_score_gemma":0.00015826747,"threshold_uncertainty_score":0.9998402},"labels":[],"label_agreement":null},{"id":"W2783749042","doi":"10.1109/tmc.2018.2793198","title":"Transmission Management of Delay-Sensitive Medical Packets in Beyond Wireless Body Area Networks: A Queueing Game Approach","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Queueing theory; Network packet; Body area network; Default gateway; Quality of service; Transmission (telecommunications); Wireless; Gateway (web page); Base station; Layered queueing network; Distributed computing; Telecommunications; Wireless sensor network","score_opus":0.007823626103067239,"score_gpt":0.2240175858149654,"score_spread":0.21619395971189814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2783749042","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3377538,0.00009778788,0.6597647,0.000007560458,0.00040436402,0.0003887216,0.0000031123707,0.0002519216,0.0013280294],"genre_scores_gemma":[0.99642974,0.00021607408,0.002999701,0.000030293724,0.00015948684,0.00005505356,0.0000079477,0.00008780411,0.000013909484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976828,0.00011555384,0.0006680942,0.00046046005,0.0004773677,0.00059568585],"domain_scores_gemma":[0.99911416,0.00020181264,0.00007753773,0.00034000518,0.00007100312,0.00019545828],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004779104,0.00034860647,0.000467787,0.0002809661,0.0001363001,0.000027670036,0.00027569555,0.000286447,0.000043848333],"category_scores_gemma":[0.0000010076138,0.00037159564,0.00014612278,0.0007814404,0.00016685238,0.00012342494,0.000006212651,0.00070220936,0.0000069954235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047103153,0.00018518842,0.00001892124,0.00014103632,0.00011292396,0.00006305161,0.0008866339,0.7785837,0.00027517462,0.00003699475,0.000029581754,0.21961966],"study_design_scores_gemma":[0.00084243785,0.000116312294,0.0002445599,0.0011589193,0.00004490463,0.000038187445,0.000389251,0.9917749,0.0050036893,0.000018019116,0.000036579553,0.0003322018],"about_ca_topic_score_codex":0.000023440152,"about_ca_topic_score_gemma":0.000026875194,"teacher_disagreement_score":0.6586759,"about_ca_system_score_codex":0.00016024633,"about_ca_system_score_gemma":0.000025008909,"threshold_uncertainty_score":0.9998736},"labels":[],"label_agreement":null},{"id":"W2789414605","doi":"10.1109/tmc.2018.2812722","title":"Optimal Power Allocation and Scheduling for Non-Orthogonal Multiple Access Relay-Assisted Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","cited_by":163,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Relay; Computer science; Time division multiple access; Computer network; Telecommunications link; Noma; Throughput; Scheduling (production processes); Cellular network; Transmitter power output; Relay channel; Base station; Spectral efficiency; Wireless; Channel (broadcasting); Power (physics); Telecommunications; Mathematical optimization; Transmitter; Mathematics","score_opus":0.018627063096252828,"score_gpt":0.27869569213543116,"score_spread":0.2600686290391783,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789414605","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3432869,0.000080931306,0.6553039,0.00002152231,0.0003162068,0.0003260178,0.0000050293843,0.0006311571,0.00002833388],"genre_scores_gemma":[0.8940264,0.00007438617,0.10561672,0.000021653534,0.000051376446,0.00014788451,0.0000063226007,0.000047472193,0.000007770522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907273,0.000016592967,0.00029488717,0.00025561982,0.0000868917,0.00027326652],"domain_scores_gemma":[0.9990452,0.00035632265,0.00006596943,0.00037907515,0.000103056074,0.00005037935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013194847,0.00018577356,0.00017794102,0.00014997562,0.00042674263,0.00007464106,0.00029621704,0.00015307871,0.00000804931],"category_scores_gemma":[0.000011694966,0.00021149681,0.000060840066,0.00024838542,0.00012341037,0.00024243924,0.000009193372,0.00033086038,0.0000043083583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017681652,0.000031124746,0.00003741019,0.000018234354,0.000031457,2.0525324e-7,0.00009799511,0.9032174,0.002134395,0.000023808507,0.000010061423,0.09438023],"study_design_scores_gemma":[0.0004536546,0.000106145206,0.00041384992,0.000081352046,0.000011635844,0.0000061719284,0.00012661405,0.9740628,0.024337929,0.000017218066,0.00016968524,0.00021297156],"about_ca_topic_score_codex":0.000002492107,"about_ca_topic_score_gemma":0.0000120900395,"teacher_disagreement_score":0.5507395,"about_ca_system_score_codex":0.000072447445,"about_ca_system_score_gemma":0.000011900342,"threshold_uncertainty_score":0.86245894},"labels":[],"label_agreement":null},{"id":"W2792845577","doi":"10.1109/tmc.2018.2810228","title":"Optimal Resource Allocations for Mobile Data Offloading via Dual-Connectivity","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":55,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Small cell; Base station; Exploit; Telecommunications link; Cellular network; Optimization problem; Scheduling (production processes); Bandwidth allocation; Bandwidth (computing); Handover; Distributed computing; Mathematical optimization; Algorithm","score_opus":0.022023838797690504,"score_gpt":0.2738646612198756,"score_spread":0.25184082242218514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792845577","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03214407,0.00007517177,0.9641806,0.000008306704,0.0010737027,0.001185975,0.00012391283,0.0009294853,0.00027879194],"genre_scores_gemma":[0.9243089,0.000007179919,0.07474969,0.000021210753,0.0004074357,0.00026189905,0.000055674864,0.00009897332,0.00008905843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000048515434,0.00042166392,0.0005308897,0.00013726481,0.00041479344],"domain_scores_gemma":[0.99837023,0.00041379986,0.00008160267,0.00089307124,0.00013966138,0.00010164552],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003550177,0.00025951106,0.0002629377,0.00018621002,0.0005818185,0.00006184828,0.0003148877,0.00012509545,0.000033423137],"category_scores_gemma":[0.000015190878,0.0003105789,0.00008043978,0.0004013584,0.00007469939,0.0003793799,0.000007800028,0.00024106291,0.000051357667],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013381966,0.00006225913,0.000002090651,0.000051480187,0.000054835833,6.173347e-7,0.00044520295,0.9556709,0.0060660723,0.0000055052815,0.00028609563,0.037341546],"study_design_scores_gemma":[0.00041722748,0.00018053383,0.000003426367,0.00007858335,0.00004291207,0.000022160944,0.0002500318,0.9663775,0.027855387,0.00000767985,0.0044595296,0.00030501],"about_ca_topic_score_codex":0.00001421943,"about_ca_topic_score_gemma":0.00003728303,"teacher_disagreement_score":0.8921648,"about_ca_system_score_codex":0.00017686257,"about_ca_system_score_gemma":0.000026231444,"threshold_uncertainty_score":0.9999346},"labels":[],"label_agreement":null},{"id":"W2794838781","doi":"10.1109/tmc.2019.2908403","title":"Joint Communication, Computation, Caching, and Control in Big Data Multi-Access Edge Computing","year":2019,"lang":"en","type":"preprint","venue":"IEEE Transactions on Mobile Computing","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":"Institut National de la Recherche Scientifique","funders":"National Research Foundation of Korea","keywords":"Computer science; Cloud computing; Server; Edge computing; Distributed computing; Overhead (engineering); Upper and lower bounds; Optimization problem; Computation offloading; Mobile edge computing; Computation; Bandwidth (computing); Computer network; Enhanced Data Rates for GSM Evolution; Algorithm; Operating system; Mathematics","score_opus":0.10252900560045566,"score_gpt":0.3338326797343236,"score_spread":0.23130367413386796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794838781","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053594023,0.00093466445,0.92582905,0.000304936,0.016727572,0.0018346531,0.000024489078,0.00064194616,0.00010865363],"genre_scores_gemma":[0.954689,0.00010357277,0.04363012,0.0005343912,0.00080049824,0.000033029257,0.0000883999,0.00009214119,0.000028840495],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99337995,0.0009588914,0.0017651494,0.0023254233,0.0006025649,0.0009680029],"domain_scores_gemma":[0.99337995,0.0013909201,0.0009947332,0.0036141803,0.00037266474,0.00024755838],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002561032,0.0008911612,0.0012698756,0.0010140924,0.0010250804,0.0015878095,0.0050410335,0.00050207635,0.0000018382547],"category_scores_gemma":[0.00004571826,0.0010117361,0.00021772004,0.0008514869,0.00019337988,0.0007244223,0.0011049985,0.002993863,0.000036419973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011428891,0.0003785194,0.0010277609,0.00031999414,0.00010897554,0.000013903523,0.0021275321,0.8215037,0.0000628088,0.0000121739795,0.00044678265,0.17398642],"study_design_scores_gemma":[0.0021160957,0.000074233576,0.0033259378,0.0013607547,0.00005367066,0.000042839005,0.00007254614,0.99123275,0.00016921447,0.00017925238,0.00041282107,0.0009598717],"about_ca_topic_score_codex":0.00097393163,"about_ca_topic_score_gemma":0.00010426188,"teacher_disagreement_score":0.901095,"about_ca_system_score_codex":0.00034171884,"about_ca_system_score_gemma":0.00048496944,"threshold_uncertainty_score":0.99944866},"labels":[],"label_agreement":null},{"id":"W2799292918","doi":"10.1109/tmc.2018.2831679","title":"Multipath Cooperative Routing with Efficient Acknowledgement for LEO Satellite Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":165,"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; National Natural Science Foundation of China","keywords":"Computer network; Computer science; Multipath routing; Dynamic Source Routing; Acknowledgement; Routing protocol; Distributed computing; Network packet; Linear network coding; Static routing; Retransmission; Multipath propagation; Channel (broadcasting)","score_opus":0.026441189963418432,"score_gpt":0.28621969294979666,"score_spread":0.2597785029863782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2799292918","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013084361,0.00020599461,0.9837743,0.00011759197,0.00090174907,0.0010242362,0.0000024866342,0.00032743148,0.0005618293],"genre_scores_gemma":[0.957207,0.00007884223,0.04188072,0.00027245612,0.0002170731,0.00014539913,0.0000025233076,0.000027011694,0.00016895111],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812746,0.00018159825,0.00038591592,0.0006105826,0.00020082308,0.0004936116],"domain_scores_gemma":[0.99793816,0.00049360096,0.0001395759,0.000729951,0.00057535805,0.00012333428],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005650203,0.00027992306,0.0002587357,0.0001341844,0.0014758562,0.00025285376,0.00072139077,0.00006745871,0.000021986625],"category_scores_gemma":[0.000009103613,0.00024254096,0.00010258735,0.00076119043,0.00013906245,0.00015233958,0.000022835848,0.00030511836,0.000045962934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036839,0.00020973975,0.000013755075,0.000006643451,0.000047379646,9.871502e-7,0.0022302193,0.6373525,0.00026499463,0.0014726572,0.000044836626,0.3583194],"study_design_scores_gemma":[0.00085685204,0.00072230544,0.000061131475,0.00017067566,0.000015491854,0.0000058350684,0.000121710815,0.98703605,0.007971344,0.000005204639,0.002721931,0.00031149227],"about_ca_topic_score_codex":0.0000022899094,"about_ca_topic_score_gemma":0.00006148602,"teacher_disagreement_score":0.9441227,"about_ca_system_score_codex":0.00014414501,"about_ca_system_score_gemma":0.00007857921,"threshold_uncertainty_score":0.9998241},"labels":[],"label_agreement":null},{"id":"W2805491853","doi":"10.1109/tmc.2018.2842733","title":"Backup Battery Analysis and Allocation against Power Outage for Cellular Base Stations","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Battery Technologies Research","field":"Engineering","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":"Simon Fraser University","funders":"","keywords":"Backup; Battery (electricity); Base station; Computer science; Reliability engineering; Power (physics); Reliability (semiconductor); Service (business); IT service continuity; Computer network; Engineering; Operating system","score_opus":0.013907107570950083,"score_gpt":0.26796945171290276,"score_spread":0.25406234414195267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2805491853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34159622,0.000021081827,0.6574126,0.000031058746,0.00017009616,0.00029503013,0.00004311785,0.00036424008,0.00006655681],"genre_scores_gemma":[0.97609,0.000023305225,0.023576822,0.000053428434,0.00003550457,0.00010325312,0.000017842936,0.0000389325,0.000060893508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896574,0.000023653802,0.00025138192,0.00030198874,0.00013745126,0.00031979592],"domain_scores_gemma":[0.9991777,0.00026825245,0.00003285018,0.00034146436,0.00011463134,0.000065127555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001446703,0.00016629416,0.00018764743,0.00050716323,0.0002935261,0.000055653512,0.00014321253,0.00008897042,0.000058195255],"category_scores_gemma":[0.000009711616,0.00018431428,0.000094259056,0.00070744444,0.00011043659,0.00014610132,0.0000033311726,0.00021827387,0.000025673344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009476181,0.0000484722,0.000056644527,0.000042334083,0.0002335317,0.0000018832399,0.00027071717,0.8700519,0.047423314,0.000007119063,0.00007794421,0.08177664],"study_design_scores_gemma":[0.0003066476,0.00014876931,0.00014793481,0.000022119453,0.00008425318,8.673761e-7,0.00037513697,0.8604544,0.13770926,0.00003861511,0.00048016573,0.00023184813],"about_ca_topic_score_codex":0.000003669782,"about_ca_topic_score_gemma":0.000024090374,"teacher_disagreement_score":0.6344938,"about_ca_system_score_codex":0.000102416074,"about_ca_system_score_gemma":0.00001082508,"threshold_uncertainty_score":0.7516118},"labels":[],"label_agreement":null},{"id":"W2808881604","doi":"10.1109/tmc.2018.2848644","title":"Flexible and Efficient Authenticated Key Agreement Scheme for BANs Based on Physiological Features","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Body Area Networks","field":"Engineering","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Innovation-Driven Project of Central South University; Postdoctoral Science Foundation of Central South University; China Scholarship Council","keywords":"Computer science; Authentication (law); Computer security; Computer network; Key (lock); Scheme (mathematics); Session key; Access control; Session (web analytics); Cryptography; Secure communication; Encryption; World Wide Web","score_opus":0.015347708678058163,"score_gpt":0.2471728123893377,"score_spread":0.23182510371127954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808881604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34460503,0.000026554071,0.6538089,0.000021273663,0.0005043484,0.00042421688,0.00001464652,0.00038033657,0.00021471996],"genre_scores_gemma":[0.99435353,0.0000034763148,0.0051976275,0.00008299893,0.00018136943,0.00009114239,0.0000068409536,0.00003707158,0.00004591722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989194,0.00002851342,0.00020732245,0.00033002088,0.00014730143,0.0003674262],"domain_scores_gemma":[0.99937147,0.00020422206,0.000029691817,0.00024622044,0.000056712117,0.000091683825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014097091,0.00022024862,0.00020034476,0.00011181508,0.00032222914,0.000044485078,0.0001218727,0.0001167072,0.000046559075],"category_scores_gemma":[0.00000357634,0.00020420873,0.000091317255,0.0001990431,0.000095796706,0.00002177097,0.0000020233852,0.00024429202,0.00002453208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004723418,0.00014397387,0.0000028566096,0.00004429253,0.0000344811,8.0677427e-7,0.00018955837,0.97174054,0.009810523,0.000026334414,0.00037798492,0.017581413],"study_design_scores_gemma":[0.0005909209,0.00042494948,0.00030612934,0.00012375535,0.000021084816,0.0000015132074,0.000036955844,0.9452757,0.05275388,0.000011475565,0.0002457474,0.0002078437],"about_ca_topic_score_codex":0.0000031787433,"about_ca_topic_score_gemma":0.0000031804054,"teacher_disagreement_score":0.6497485,"about_ca_system_score_codex":0.00007842236,"about_ca_system_score_gemma":0.000010768094,"threshold_uncertainty_score":0.83273906},"labels":[],"label_agreement":null},{"id":"W2809450641","doi":"10.1109/tmc.2018.2847350","title":"Reward or Penalty: Aligning Incentives of Stakeholders in Crowdsourcing","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crowdsourcing; Incentive; Computer science; Payment; Crowdsourcing software development; Quality (philosophy); Key (lock); Perspective (graphical); Data science; Knowledge management; Computer security; World Wide Web; Artificial intelligence; Microeconomics; Economics","score_opus":0.045404160681853045,"score_gpt":0.28470959608749746,"score_spread":0.23930543540564442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809450641","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40494838,0.000025710762,0.5937441,0.000028701545,0.00053449214,0.00021565716,0.0000015560815,0.00015937777,0.00034200202],"genre_scores_gemma":[0.97783554,0.000008423547,0.021785993,0.00011272444,0.00009817565,0.000014514232,4.2965334e-7,0.000030129842,0.000114064234],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743754,0.00021247711,0.00068471924,0.0006853008,0.00039183535,0.0005881508],"domain_scores_gemma":[0.99828935,0.00047033612,0.0002527486,0.0006921877,0.00017443388,0.000120961835],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085731444,0.0002799649,0.0004107324,0.00051714043,0.00043393843,0.00015017547,0.0006468372,0.00011179965,0.000029811232],"category_scores_gemma":[0.000024222201,0.00026699158,0.00014762348,0.0012546285,0.00021787213,0.00035556825,0.00001765343,0.00039366566,0.000023137442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018092257,0.00062241766,0.0008423231,0.00018851944,0.00010502081,0.000093794006,0.023378985,0.35586214,0.027992845,0.0002504449,0.00014198989,0.5903406],"study_design_scores_gemma":[0.001980826,0.0012446131,0.00078822055,0.0016792777,0.000034687688,0.00011324824,0.0040900568,0.6042551,0.38405547,0.00015971922,0.0007056192,0.0008931916],"about_ca_topic_score_codex":0.00015022416,"about_ca_topic_score_gemma":0.00010859489,"teacher_disagreement_score":0.5894474,"about_ca_system_score_codex":0.0001258978,"about_ca_system_score_gemma":0.00013905719,"threshold_uncertainty_score":0.99997824},"labels":[],"label_agreement":null},{"id":"W2884365744","doi":"10.1109/tmc.2018.2857826","title":"How Expensive is Consistency? Performance Analysis of Consistent Rate Provisioning to Mobile Users in Cellular Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Provisioning; Consistency (knowledge bases); Class (philosophy); Independence (probability theory); Cellular network; Computer network; Distributed computing; Artificial intelligence","score_opus":0.010209619560298085,"score_gpt":0.22558963103681806,"score_spread":0.21538001147651997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884365744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39565915,0.000070430724,0.60306317,0.0000053420367,0.00039079666,0.0006411997,0.0000072138373,0.0001055318,0.00005718331],"genre_scores_gemma":[0.9930197,0.00002888944,0.006565827,0.00004355147,0.000044124292,0.00017613296,0.000005390604,0.00004663158,0.00006976058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984927,0.00006767344,0.00054325396,0.00038300487,0.0001511537,0.00036219938],"domain_scores_gemma":[0.9989791,0.00017886276,0.0001277871,0.00040336666,0.00021312128,0.00009777103],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023340753,0.00025233685,0.00050736574,0.0006772587,0.00017282007,0.000048978993,0.00014630178,0.00011062278,0.000026916758],"category_scores_gemma":[0.000006156551,0.00028093395,0.00015689713,0.0017217064,0.00008047972,0.00019019091,0.000004028813,0.00022388565,0.000007781459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021036194,0.000033786797,0.0001482974,0.000046632533,0.0001951476,0.0000023180573,0.001501638,0.98264784,0.0055274563,0.0000021648784,0.000012859972,0.009860851],"study_design_scores_gemma":[0.00028865258,0.00023467188,0.000066475455,0.00020306975,0.00012534215,0.0000016938609,0.0010804303,0.9319145,0.06575378,6.8649445e-7,0.00008245416,0.00024820914],"about_ca_topic_score_codex":0.00001826171,"about_ca_topic_score_gemma":0.000044291537,"teacher_disagreement_score":0.59736055,"about_ca_system_score_codex":0.00018256756,"about_ca_system_score_gemma":0.000023452669,"threshold_uncertainty_score":0.9999643},"labels":[],"label_agreement":null},{"id":"W2892472137","doi":"10.1109/tmc.2018.2871686","title":"Collision Avoidance Energy Efficient Multi-Channel MAC Protocol for UnderWater Acoustic Sensor Networks","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Handshaking; Computer science; Channel (broadcasting); Computer network; Throughput; Control channel; Network packet; Underwater acoustic communication; Collision; Multiple Access with Collision Avoidance for Wireless; Data transmission; Propagation delay; Underwater; Wireless; Telecommunications; Routing protocol; Telecommunications link; Computer security","score_opus":0.027231140662991815,"score_gpt":0.27519839053971307,"score_spread":0.24796724987672125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892472137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030205667,0.000010558986,0.97617733,0.000012701486,0.00038192302,0.01969936,0.000008959572,0.00064810313,0.000040496485],"genre_scores_gemma":[0.9500709,0.0000025829715,0.006284044,0.000055286328,0.00020849447,0.043101966,0.0000018599989,0.00009089547,0.00018396026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866587,0.00006906816,0.00042536028,0.00029335706,0.00014586453,0.00040048576],"domain_scores_gemma":[0.9991447,0.00016647865,0.00006761441,0.00040496542,0.00012285098,0.00009341141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001899401,0.00024356734,0.00022308598,0.00010757129,0.0005099897,0.000088319866,0.00023949817,0.00013225726,0.000013254286],"category_scores_gemma":[4.769851e-7,0.00022968787,0.00012188095,0.00021325458,0.000059586237,0.000047047863,0.000004510515,0.00019189861,0.000030517782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000362436,0.0001223653,6.493373e-7,0.00006784086,0.000031609132,5.3165166e-7,0.00029584224,0.987654,0.005212674,0.0000018032373,0.000057526664,0.0065189376],"study_design_scores_gemma":[0.0010488306,0.00017068551,0.0000032174962,0.00017319225,0.000012674588,0.000008050648,0.00012859775,0.9221801,0.07096682,0.0000054562943,0.00506043,0.00024196383],"about_ca_topic_score_codex":0.000023971506,"about_ca_topic_score_gemma":0.00004632965,"teacher_disagreement_score":0.9698933,"about_ca_system_score_codex":0.00013208763,"about_ca_system_score_gemma":0.000014129705,"threshold_uncertainty_score":0.9366399},"labels":[],"label_agreement":null},{"id":"W2896913059","doi":"10.1109/tmc.2018.2865340","title":"On Mutual Interference Analysis in Hybrid Interweave-Underlay Cognitive Communications","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":8,"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":"Underlay; Computer science; Interference (communication); Computer network; Cognitive radio; Telecommunications; Wireless; Signal-to-noise ratio (imaging); Channel (broadcasting)","score_opus":0.022253314654316386,"score_gpt":0.2880059926411514,"score_spread":0.265752677986835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896913059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21191502,0.000023697203,0.7856045,0.000103368075,0.00039073412,0.00023048441,0.000007885721,0.00016139408,0.0015629345],"genre_scores_gemma":[0.9951151,0.000022026745,0.0043059243,0.00040192518,0.000077345525,0.000014289373,0.000003909223,0.000016774327,0.000042721924],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979082,0.00030714367,0.000452943,0.00066502945,0.00022904997,0.00043768785],"domain_scores_gemma":[0.99728286,0.0014092379,0.00013279912,0.0008727575,0.00019528941,0.00010707957],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003657912,0.00025767324,0.00035635382,0.0008215664,0.0005034314,0.0002127531,0.0008814109,0.00006120027,0.000042413827],"category_scores_gemma":[0.000017580282,0.00027094182,0.00021880637,0.001913259,0.00026103816,0.00023009433,0.000029815696,0.0006249214,0.00011591036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011816465,0.001081256,0.00017898266,0.000009076095,0.000604064,0.000049305567,0.006940902,0.05418482,0.00030024367,0.0020859162,0.000054411437,0.93439287],"study_design_scores_gemma":[0.00046946856,0.0006277194,0.00055032497,0.00025453971,0.000079825535,0.000021391881,0.00033638338,0.9927694,0.0041530877,0.00040467046,0.000024932646,0.00030824027],"about_ca_topic_score_codex":0.00007425715,"about_ca_topic_score_gemma":0.00077508396,"teacher_disagreement_score":0.9385846,"about_ca_system_score_codex":0.00017532629,"about_ca_system_score_gemma":0.000053151914,"threshold_uncertainty_score":0.99997425},"labels":[],"label_agreement":null},{"id":"W2904313714","doi":"10.1109/tmc.2018.2883451","title":"Nocturnal Epileptic Seizures Detection Using Inertial and Muscular Sensors","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"EEG and Brain-Computer Interfaces","field":"Neuroscience","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 Waterloo","funders":"","keywords":"Accelerometer; Computer science; Gyroscope; Sliding window protocol; Inertial measurement unit; False alarm; ALARM; Constant false alarm rate; Pattern recognition (psychology); Artificial intelligence; Real-time computing; Computer vision; Control theory (sociology); Window (computing); Engineering","score_opus":0.026437092194500585,"score_gpt":0.2837980301438689,"score_spread":0.2573609379493683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2904313714","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.6180952,0.000009664993,0.3805927,0.000012433803,0.0009903222,0.00013926532,0.0000025804504,0.00011430548,0.000043506854],"genre_scores_gemma":[0.9980301,0.000005339637,0.001250297,0.00023630616,0.00041057798,0.0000044572193,1.0397026e-7,0.00002586651,0.000036947768],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9985356,0.0001702323,0.00027321145,0.00048689215,0.00021615768,0.00031792858],"domain_scores_gemma":[0.9993121,0.00025221024,0.00008913559,0.00019367949,0.000053728632,0.00009914868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016192085,0.00020033043,0.00017621543,0.0001968571,0.00073251565,0.00013540508,0.00014123517,0.000086226435,0.000038369915],"category_scores_gemma":[0.0000163876,0.00018697535,0.00009048236,0.0002310385,0.00022352835,0.00016369071,0.000005441512,0.00032913836,0.000025742265],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004118143,0.000065620225,0.000010016598,0.000017413078,0.000012105316,0.000015848384,0.00093401026,0.13870884,0.79165083,0.0000022947966,0.0000045134793,0.06853734],"study_design_scores_gemma":[0.00023436363,0.00026453604,0.000048170976,0.000045314526,0.000015569527,0.0002643166,0.00006131812,0.41759786,0.5811752,0.00001200691,0.00014221281,0.00013908968],"about_ca_topic_score_codex":0.000042389445,"about_ca_topic_score_gemma":0.000018987643,"teacher_disagreement_score":0.37993488,"about_ca_system_score_codex":0.00005186708,"about_ca_system_score_gemma":0.000019346533,"threshold_uncertainty_score":0.76246333},"labels":[],"label_agreement":null},{"id":"W2909444676","doi":"10.1109/tmc.2019.2893917","title":"Cooperative Caching for Multiple Bitrate Videos in Small Cell Edges","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","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":"University of Waterloo","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Server; Quality of experience; Function (biology); Mobile device; Enhanced Data Rates for GSM Evolution; Constant bitrate; Mobile edge computing; Software deployment; Computer network; Variable bitrate; Bit rate; Quality of service; Artificial intelligence","score_opus":0.019722116296718113,"score_gpt":0.23126746341815335,"score_spread":0.21154534712143525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909444676","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43368694,0.000040281968,0.5647868,0.000029282886,0.00071981666,0.0004939942,0.0000055378255,0.000121400844,0.00011596402],"genre_scores_gemma":[0.99392796,0.0000069854723,0.00535309,0.00022813729,0.00004340481,0.000071918126,0.0000016826582,0.000020207972,0.0003465917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985263,0.000110129244,0.00031864454,0.00055328786,0.00011511059,0.00037656547],"domain_scores_gemma":[0.9986146,0.00075679214,0.00008179308,0.0003867772,0.000089240995,0.000070796064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003567907,0.00020660735,0.00025217157,0.00022594798,0.0002612595,0.0001598085,0.00046364297,0.000076186596,0.000005283421],"category_scores_gemma":[0.000006097708,0.00020933752,0.00015183752,0.00032061743,0.000017817638,0.00024954663,0.0000071046857,0.0003767354,0.000059067854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024549101,0.00019817968,0.00025252503,0.00003840734,0.000013894922,0.000004248192,0.0010527811,0.9328697,0.022372318,0.00006716882,0.000014833526,0.043091394],"study_design_scores_gemma":[0.0012373414,0.0002898378,0.00007962997,0.000110812805,0.000006783919,0.000005623014,0.00021233551,0.9540804,0.043536115,0.000026989908,0.00014144329,0.0002726955],"about_ca_topic_score_codex":0.00021264833,"about_ca_topic_score_gemma":0.00016586014,"teacher_disagreement_score":0.56024104,"about_ca_system_score_codex":0.00009101234,"about_ca_system_score_gemma":0.00007188965,"threshold_uncertainty_score":0.85365367},"labels":[],"label_agreement":null},{"id":"W2916491361","doi":"10.1109/tmc.2019.2901474","title":"Near-Optimal and Truthful Online Auction for Computation Offloading in Green Edge-Computing Systems","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":134,"is_retracted":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":"Innovation-Driven Project of Central South University; International Science and Technology Cooperation Programme; Higher Education Discipline Innovation Project; Kuwait Foundation for the Advancement of Sciences; National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Mobile edge computing; Computation offloading; Lyapunov optimization; Computation; Edge computing; Enhanced Data Rates for GSM Evolution; Wireless; Task (project management); Distributed computing; Mobile device; Channel (broadcasting); Computer network; Algorithm; Artificial intelligence; Telecommunications; Operating system","score_opus":0.01632178714720007,"score_gpt":0.2634931279648677,"score_spread":0.24717134081766762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916491361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45647252,0.000069632435,0.5360403,0.000048361304,0.0063965633,0.00070157833,0.0000016531287,0.00024073194,0.00002864288],"genre_scores_gemma":[0.95589083,0.0000044536037,0.04309195,0.000081736966,0.0007786987,0.000019540934,0.000008817241,0.000044611308,0.00007937503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970714,0.00016045076,0.0007941233,0.0009478259,0.00032039185,0.00070579624],"domain_scores_gemma":[0.9982366,0.0007998647,0.0002826918,0.00037415134,0.00016817433,0.00013854346],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008208459,0.00037727327,0.0005148206,0.0004628868,0.00061487104,0.0004599463,0.0004435814,0.00018241354,0.0000012117108],"category_scores_gemma":[0.000009659779,0.00042018527,0.00015378513,0.000792718,0.000055680197,0.0005388622,0.000025846191,0.0005141296,0.000025935098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024628003,0.00014021204,0.00030577558,0.00016106527,0.000027323285,0.0000037469172,0.0018983522,0.8064643,0.00048661348,0.000040965228,0.000040349103,0.19040668],"study_design_scores_gemma":[0.0013551825,0.0003834273,0.00085414987,0.00035943347,0.000016140943,0.000067731904,0.00024724175,0.99533975,0.00048560186,0.00004887795,0.00040899127,0.0004334964],"about_ca_topic_score_codex":0.00021277812,"about_ca_topic_score_gemma":0.000007820567,"teacher_disagreement_score":0.4994183,"about_ca_system_score_codex":0.0002466717,"about_ca_system_score_gemma":0.00009666346,"threshold_uncertainty_score":0.999825},"labels":[],"label_agreement":null},{"id":"W2916760466","doi":"10.1109/tmc.2019.2901671","title":"On the Interaction of Charging-Aware Mobility and Wireless Capacity","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Harvesting in Wireless Networks","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":"University of Alberta","funders":"","keywords":"Computer science; Computer network; Waypoint; Wireless; Node (physics); Inductive charging; Mobility model; Mobile device; Hotspot (geology); Wireless network; Telecommunications; Real-time computing; Engineering","score_opus":0.012440425616742024,"score_gpt":0.21354558190864387,"score_spread":0.20110515629190184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2916760466","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.7987376,0.000012048176,0.19957548,0.00000927109,0.0008830959,0.00024499305,0.0000066694306,0.00021218348,0.0003186552],"genre_scores_gemma":[0.9996853,0.000017679942,0.00013391598,0.000028603394,0.00004405313,0.000027185442,0.0000010691518,0.000035792942,0.000026394075],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904513,0.00007371903,0.0002745531,0.0002391278,0.00015612142,0.00021133751],"domain_scores_gemma":[0.99860805,0.0008857024,0.00006599115,0.00034826327,0.00004610559,0.00004585824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002535556,0.0001845951,0.00021491891,0.000079349265,0.00012935614,0.000028072225,0.00013810897,0.0000936568,0.0000537356],"category_scores_gemma":[0.0000043674836,0.0001583439,0.0000746675,0.00019282558,0.00006466759,0.00008738432,0.0000023485848,0.0005451464,0.000017450293],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012614614,0.000054877804,0.000091854694,0.00009108821,0.000033653094,3.6097418e-7,0.0002955029,0.9803972,0.0035088495,0.00014709131,0.000015283425,0.01535157],"study_design_scores_gemma":[0.00018352664,0.00011858674,0.00034368443,0.00033151766,0.000012086864,0.000006433922,0.00016604913,0.962484,0.03612097,0.000033504206,0.00003836551,0.00016127028],"about_ca_topic_score_codex":0.000039450384,"about_ca_topic_score_gemma":0.000015429405,"teacher_disagreement_score":0.2009477,"about_ca_system_score_codex":0.00008406713,"about_ca_system_score_gemma":0.0000074688514,"threshold_uncertainty_score":0.6457077},"labels":[],"label_agreement":null},{"id":"W2940299710","doi":"10.1109/tmc.2019.2911935","title":"<i>Razor</i>: Scaling Backend Capacity for Mobile Applications","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Wuhan University; National Natural Science Foundation of China","keywords":"Computer science; Burstiness; Schedule; Mobile device; Computer network; Real-time computing; Key (lock); Distributed computing; Term (time); Operating system; Network packet","score_opus":0.016744550679614365,"score_gpt":0.24322299262574373,"score_spread":0.22647844194612937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940299710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18111503,0.000054585365,0.8159215,0.000029118359,0.000907047,0.0013027705,0.000021339103,0.00038561146,0.00026301038],"genre_scores_gemma":[0.97444284,0.000008667488,0.024356019,0.00024511365,0.00010633841,0.0005151745,0.000003315919,0.000023964229,0.00029859145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832684,0.000053418105,0.00034121188,0.0006433041,0.00023529983,0.00039993686],"domain_scores_gemma":[0.99845,0.00044490403,0.000108758955,0.00074669597,0.0001352682,0.000114406386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033527755,0.0002135187,0.0002475029,0.00015923513,0.00048816824,0.00017931864,0.0006467557,0.00009104597,0.00001831606],"category_scores_gemma":[0.0000019557215,0.00022660273,0.0002611451,0.0003816403,0.000035356978,0.00027363983,0.000008015156,0.0003100661,0.00021215278],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015766327,0.00032849368,0.000034758683,0.00008256678,0.000054981432,8.754478e-7,0.00050594273,0.554969,0.012785257,0.0011035356,0.0001054476,0.43001336],"study_design_scores_gemma":[0.0009512253,0.0003364156,0.000023560337,0.00009102168,0.000029965448,0.000026774045,0.00016700507,0.9656819,0.017596709,0.00028731814,0.014295237,0.00051283406],"about_ca_topic_score_codex":0.000039739116,"about_ca_topic_score_gemma":0.000005303544,"teacher_disagreement_score":0.7933278,"about_ca_system_score_codex":0.00008727913,"about_ca_system_score_gemma":0.000049019527,"threshold_uncertainty_score":0.92405915},"labels":[],"label_agreement":null},{"id":"W2943828857","doi":"10.1109/tmc.2019.2911945","title":"Possibility-based trust for mobile wireless networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Ad Hoc 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":"Defence Research and Development Canada","funders":"","keywords":"Computer science; Reputation; Network packet; Computer network; Authentication (law); Wireless; Mobile ad hoc network; Mobile computing; Wireless network; Mobile wireless; Computer security; Telecommunications","score_opus":0.01048481649275894,"score_gpt":0.24871920237001316,"score_spread":0.2382343858772542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2943828857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1757167,0.00006850935,0.818103,0.00003861539,0.002760347,0.0024914693,0.000011154675,0.0006424316,0.0001677801],"genre_scores_gemma":[0.97373325,0.000007164858,0.024558978,0.00047251803,0.00021425284,0.0006763904,0.0000072622547,0.00006579066,0.00026437783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966265,0.00016531421,0.00067700783,0.0012345472,0.00039678608,0.00089982484],"domain_scores_gemma":[0.99662656,0.001134198,0.00023323885,0.0016079308,0.00016947064,0.0002286305],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007426222,0.00044026307,0.0005246617,0.0001581399,0.0005029939,0.00028390271,0.0012970913,0.00026143313,0.000083543135],"category_scores_gemma":[0.0000029070022,0.00045761798,0.0004308692,0.00083729276,0.00008008888,0.00036343408,0.000013467103,0.0006274695,0.000113975104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038673672,0.00027046524,0.00012454025,0.00004852209,0.000028781493,0.000002612422,0.00011312708,0.8223516,0.00018246644,0.0003379655,0.00008990724,0.17641136],"study_design_scores_gemma":[0.0013130674,0.0008054531,0.000074913354,0.000111982925,0.000020907188,0.000008986935,0.000039246617,0.9910096,0.004630786,0.0001041874,0.0013885475,0.00049235235],"about_ca_topic_score_codex":0.00002133706,"about_ca_topic_score_gemma":0.000012896497,"teacher_disagreement_score":0.79801655,"about_ca_system_score_codex":0.00021232135,"about_ca_system_score_gemma":0.00016060336,"threshold_uncertainty_score":0.99978757},"labels":[],"label_agreement":null},{"id":"W2944741907","doi":"10.1109/tmc.2019.2915071","title":"A Seamless Mobility Management Protocol in 5G Locator Identificator Split Dense Small Cells","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Mobility management; Handover; Packet loss; Network packet; Scalability; Routing protocol; Distributed computing; Operating system","score_opus":0.00920451216935654,"score_gpt":0.23602896495602468,"score_spread":0.22682445278666813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2944741907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16029252,0.0000074998443,0.79851663,0.0000016864408,0.0007278041,0.039642725,0.000008583989,0.00043575818,0.00036678906],"genre_scores_gemma":[0.9677079,0.0000028201941,0.0075051114,0.0000109803605,0.000030228144,0.024425028,0.0000021583187,0.00007548955,0.00024028271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982987,0.00006793937,0.00057960505,0.00049153634,0.00016793111,0.0003942867],"domain_scores_gemma":[0.99911237,0.00008314909,0.00007503013,0.000589121,0.00005088791,0.00008944623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003011354,0.00027425934,0.00029268645,0.00026780952,0.00008128959,0.00005915072,0.00022613117,0.00011306593,0.000066948174],"category_scores_gemma":[9.716946e-7,0.0003171691,0.00009683691,0.00050225714,0.000023271878,0.00014705253,0.0000032678333,0.00031728955,0.0002972059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024202103,0.00017223177,0.000050032577,0.0007946833,0.000028201162,0.000007417975,0.00021969438,0.9753419,0.006474594,0.000012030695,0.000010079049,0.016864918],"study_design_scores_gemma":[0.0014763906,0.00007472558,0.0002334222,0.00041670687,0.000019697483,0.000006515668,0.00046839446,0.90817714,0.08800782,0.000017277407,0.00061160617,0.00049029186],"about_ca_topic_score_codex":0.000021828804,"about_ca_topic_score_gemma":0.000033230288,"teacher_disagreement_score":0.80741537,"about_ca_system_score_codex":0.0003982141,"about_ca_system_score_gemma":0.000016334012,"threshold_uncertainty_score":0.99992806},"labels":[],"label_agreement":null},{"id":"W2948999504","doi":"10.1109/tmc.2019.2920819","title":"Optimal Mobile Computation Offloading with Hard Deadline Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":47,"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; Computation offloading; Markov process; Markov chain; Distributed computing; Wireless; Markov decision process; Computation; Task (project management); Energy consumption; Channel (broadcasting); Mobile device; Real-time computing; Algorithm; Cloud computing; Computer network; Edge computing","score_opus":0.012421989687256843,"score_gpt":0.24502031423056905,"score_spread":0.2325983245433122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948999504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40546653,0.000022904003,0.5892298,0.000023300823,0.0038350224,0.0005376452,0.0000010084239,0.00045083542,0.0004329348],"genre_scores_gemma":[0.89275056,0.0000030723013,0.10649985,0.00015482081,0.00036344532,0.000032429612,0.000004337071,0.000041165713,0.00015030878],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972001,0.00012322626,0.00054876646,0.0009087316,0.00049797754,0.00072122324],"domain_scores_gemma":[0.9983585,0.00043938778,0.0002304701,0.0005650349,0.00021545507,0.00019117177],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00046898617,0.00040426716,0.00043729393,0.0003418561,0.0005436405,0.00033412708,0.0006760676,0.00013167325,0.00003067012],"category_scores_gemma":[0.0000029955224,0.00038959688,0.00017201115,0.0008120447,0.00012116426,0.0005177711,0.000017941838,0.000592148,0.00039267208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023302384,0.0001609732,0.00015195484,0.000039368908,0.000054575954,0.000018232382,0.0009359675,0.7813724,0.001495468,0.000038013564,0.00010945432,0.21560028],"study_design_scores_gemma":[0.001293424,0.00088816014,0.00020336836,0.00025859204,0.000024427349,0.00017196061,0.00017156343,0.98433095,0.011179082,0.000022049791,0.0008722264,0.0005842055],"about_ca_topic_score_codex":0.000017297309,"about_ca_topic_score_gemma":0.0000010832707,"teacher_disagreement_score":0.48728403,"about_ca_system_score_codex":0.00016110268,"about_ca_system_score_gemma":0.00015243165,"threshold_uncertainty_score":0.9998556},"labels":[],"label_agreement":null},{"id":"W2949089721","doi":"10.1109/tmc.2019.2922614","title":"Coverage Performance in MIMO-ZFBF Dense HetNets with Multiplexing and LOS/NLOS Path-Loss Attenuation","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Shenzhen University; National Natural Science Foundation of China","keywords":"MIMO; Non-line-of-sight propagation; Beamforming; Computer science; Multiplexing; Spatial multiplexing; Path loss; Robustness (evolution); Context (archaeology); Algorithm; Topology (electrical circuits); Telecommunications; Mathematics; Wireless","score_opus":0.005924428433289776,"score_gpt":0.2045398459508831,"score_spread":0.19861541751759332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949089721","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.50936913,0.000043129396,0.4897827,0.0000017130384,0.00018730789,0.0003868567,0.0000053042677,0.00013342782,0.00009041238],"genre_scores_gemma":[0.9953031,0.00006144981,0.004436705,0.0000141586925,0.000030889518,0.00004412794,0.0000063859848,0.00005570389,0.000047465444],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989873,0.000032961798,0.00029460355,0.00028400804,0.00013419989,0.0002668806],"domain_scores_gemma":[0.9995218,0.000114783135,0.000059478207,0.00020667561,0.000045334004,0.000051928782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001258851,0.00020598737,0.00021600124,0.00017190825,0.00010414721,0.000035348537,0.00006606955,0.000083794475,0.0000112591715],"category_scores_gemma":[0.000001866001,0.00021689018,0.000027349815,0.0002765993,0.000022187522,0.0003241267,0.0000015724883,0.0002733628,0.000030069243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025837951,0.0000280438,0.003943582,0.00016082963,0.000013724792,0.000004987323,0.0005218587,0.9762734,0.0021725076,0.0000020297755,8.68425e-7,0.01685234],"study_design_scores_gemma":[0.0011262076,0.000116821626,0.0016999799,0.00044658905,0.000008062337,0.000036589467,0.0001158541,0.9900703,0.0060768533,0.000002160657,0.0000368465,0.00026376382],"about_ca_topic_score_codex":0.000011095319,"about_ca_topic_score_gemma":0.000033195676,"teacher_disagreement_score":0.48593396,"about_ca_system_score_codex":0.00015254892,"about_ca_system_score_gemma":0.000012643541,"threshold_uncertainty_score":0.8844525},"labels":[],"label_agreement":null},{"id":"W2953406779","doi":"10.1109/tmc.2019.2926713","title":"Profit Maximization in 5G+ Networks with Heterogeneous Aerial and Ground Base Stations","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","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":"Carleton University; University of Toronto","funders":"","keywords":"Computer science; Base station; Orthogonal frequency-division multiple access; Computational complexity theory; Mathematical optimization; Wireless network; Integer programming; Profit maximization; Optimization problem; Heterogeneous network; Resource allocation; Linear programming; Cellular network; Wireless; Computer network; Orthogonal frequency-division multiplexing; Profit (economics); Channel (broadcasting); Algorithm; Mathematics; Telecommunications","score_opus":0.004667069890156266,"score_gpt":0.18774709183032942,"score_spread":0.18308002194017314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953406779","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43686336,0.000024302595,0.5623908,0.000004574124,0.00012702345,0.0004049517,0.000004517489,0.00011150092,0.00006895724],"genre_scores_gemma":[0.9929841,0.000048575388,0.0067375493,0.000017709966,0.000032534386,0.00009840165,0.000017384018,0.000037504073,0.000026229352],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993082,0.000021092803,0.00020138882,0.00020822044,0.00008283867,0.00017822243],"domain_scores_gemma":[0.9996679,0.00005783928,0.000031106923,0.0001629573,0.000035066347,0.000045125056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006575762,0.00013364252,0.00012451877,0.00013278448,0.000102653335,0.000059632894,0.000051159615,0.000066291665,0.00004220724],"category_scores_gemma":[4.425872e-7,0.00013902276,0.000020180478,0.00033576248,0.00001868887,0.00012203008,7.5530556e-7,0.00015411022,0.000010320419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148617455,0.000026793921,0.0002021469,0.000021096248,0.000012294883,9.2332573e-7,0.0001592189,0.98174787,0.00020982733,0.000018522038,0.00000266082,0.017583763],"study_design_scores_gemma":[0.00056617893,0.00008285905,0.0006426287,0.000039071365,0.000012565802,0.000011413403,0.00006440608,0.9974552,0.0009272715,0.0000069661182,0.000033105203,0.00015834067],"about_ca_topic_score_codex":0.00003297547,"about_ca_topic_score_gemma":0.00008741822,"teacher_disagreement_score":0.55612075,"about_ca_system_score_codex":0.000068998954,"about_ca_system_score_gemma":0.000011757403,"threshold_uncertainty_score":0.5669184},"labels":[],"label_agreement":null},{"id":"W2964280086","doi":"10.1109/tmc.2019.2908638","title":"Enabling Strong Privacy Preservation and Accurate Task Allocation for Mobile Crowdsensing","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":193,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; University of Waterloo","funders":"","keywords":"Computer science; Mobile device; Computer security; Mobile computing; Service provider; Information privacy; Mobile commerce; Encryption; Internet privacy; Computer network; Service (business); World Wide Web","score_opus":0.01993404008538232,"score_gpt":0.26755603159582275,"score_spread":0.24762199151044043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964280086","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41410044,0.00007103515,0.5839243,0.0000501791,0.00061839906,0.0009208458,0.000002964496,0.00026010457,0.000051728523],"genre_scores_gemma":[0.9723435,0.000018033083,0.027056927,0.00012089182,0.00011309217,0.00009021145,0.0000057042944,0.000041876483,0.00020974361],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770325,0.000108705884,0.00050866866,0.0008519339,0.00029394103,0.00053352345],"domain_scores_gemma":[0.9979889,0.0006592889,0.00023782751,0.00074539625,0.00024234565,0.00012625864],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557053,0.00030327355,0.00031639735,0.0002575885,0.00067909394,0.0005472902,0.00039586812,0.00013628349,0.000006110122],"category_scores_gemma":[0.000020000582,0.00032667746,0.00013328086,0.00045482913,0.000045865603,0.0009839063,0.000018348523,0.00032438443,0.00002135933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025523674,0.00009600605,0.000054173484,0.00012424712,0.00004015221,0.0000015849799,0.0019920326,0.706493,0.03854324,0.0003552851,0.000028749844,0.252246],"study_design_scores_gemma":[0.00081272324,0.00033506757,0.000098459306,0.00021529567,0.00002441419,0.000025946561,0.00035519365,0.95624495,0.03987595,0.00012895888,0.0015034155,0.00037963295],"about_ca_topic_score_codex":0.000036249483,"about_ca_topic_score_gemma":0.000005439365,"teacher_disagreement_score":0.5582431,"about_ca_system_score_codex":0.00011461507,"about_ca_system_score_gemma":0.000084378386,"threshold_uncertainty_score":0.9999185},"labels":[],"label_agreement":null},{"id":"W2964316170","doi":"10.1109/tmc.2018.2861861","title":"Seamless Resource Sharing in Wearable Networks by Application Function Virtualization","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Virtualization; Network Functions Virtualization; Wearable computer; Computer network; Function (biology); Shared resource; Resource (disambiguation); Wearable technology; Mobile computing; Distributed computing; Cloud computing; Embedded system; Operating system","score_opus":0.009163064384485366,"score_gpt":0.232434279132622,"score_spread":0.22327121474813663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964316170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02162038,0.00014554456,0.9763662,0.000041247586,0.00066304934,0.00037635482,0.0000013044179,0.000489189,0.00029670252],"genre_scores_gemma":[0.99667305,0.000023584713,0.002503515,0.00034704633,0.00022012752,0.00007619301,0.0000065408235,0.000027873855,0.000122064455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820787,0.00008475175,0.00037908065,0.00068610744,0.00023706842,0.00040510323],"domain_scores_gemma":[0.9989586,0.00017428746,0.00012781902,0.0005692669,0.00008419403,0.00008584803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004658005,0.00019552182,0.00018315502,0.00018913619,0.00047402456,0.00018313268,0.0005049664,0.00014872367,0.0000143007155],"category_scores_gemma":[0.0000033743233,0.00021836422,0.00006317239,0.0012493677,0.000047818976,0.00034013085,0.000012382221,0.00032777127,0.00004748827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019314046,0.00010303792,0.00017940708,0.0000060729235,0.000008529557,6.8210164e-7,0.00022161182,0.73233706,0.0002283109,0.00027930853,0.00034014098,0.2662765],"study_design_scores_gemma":[0.00037803504,0.00019710221,0.0001758192,0.00009264216,0.000007502413,0.00000542215,0.000041150754,0.99474174,0.0013298285,0.00018301059,0.0026233406,0.00022440267],"about_ca_topic_score_codex":0.00007846366,"about_ca_topic_score_gemma":0.000042260916,"teacher_disagreement_score":0.97505265,"about_ca_system_score_codex":0.0001274348,"about_ca_system_score_gemma":0.000020830796,"threshold_uncertainty_score":0.8904635},"labels":[],"label_agreement":null},{"id":"W2981080014","doi":"10.1109/tmc.2019.2948014","title":"Optimal ADMM-Based Spectrum and Power Allocation for Heterogeneous Small-Cell Networks with Hybrid Energy Supplies","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Mobile Communications Research Laboratory, Southeast University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Mathematical optimization; Computer science; Maximization; Utility maximization problem; Convexity; Optimization problem; Grid; Convex optimization; Minification; Energy consumption; Lagrangian relaxation; Regular polygon; Mathematics; Utility maximization","score_opus":0.004130425254912459,"score_gpt":0.18181707689298812,"score_spread":0.17768665163807568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981080014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15959403,0.0001337658,0.8389649,0.000005478557,0.00038374885,0.00055237906,0.00001031028,0.00029491255,0.00006050071],"genre_scores_gemma":[0.97266704,0.000015734664,0.026952393,0.000027727403,0.00004622075,0.000111393274,0.000019856929,0.00008713982,0.00007247521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990737,0.00001809401,0.00023403025,0.00030247142,0.00007588292,0.0002958632],"domain_scores_gemma":[0.99947006,0.00013604986,0.00005768856,0.00022469451,0.00004529845,0.0000662353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006312243,0.00022842166,0.00021001713,0.00009694032,0.00019418754,0.00008091512,0.00007977482,0.000068470654,0.00001372689],"category_scores_gemma":[4.4216407e-7,0.00023911161,0.00005575599,0.000117352254,0.000021170974,0.000080531056,0.0000010715451,0.00012590156,0.0000037185769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048625643,0.00003639023,0.000011124796,0.000066899906,0.000029644885,0.0000014530469,0.000045522498,0.99602056,0.0012465939,0.00000443034,0.000007293902,0.0024814461],"study_design_scores_gemma":[0.0007938495,0.00033384506,0.0000018404377,0.00006213429,0.000023213712,0.000020635995,0.000043951954,0.91550994,0.082799464,0.0000019138254,0.00016272724,0.000246489],"about_ca_topic_score_codex":0.0000092670925,"about_ca_topic_score_gemma":0.0000264964,"teacher_disagreement_score":0.81307304,"about_ca_system_score_codex":0.000085922264,"about_ca_system_score_gemma":0.000016879616,"threshold_uncertainty_score":0.97506887},"labels":[],"label_agreement":null},{"id":"W2983694339","doi":"10.1109/tmc.2019.2953163","title":"Software-Defined Cooperative Data Sharing in Edge Computing Assisted 5G-VANET","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":149,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Beijing Municipality; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Vehicular ad hoc network; Computer network; Distributed computing; Mobile edge computing; Data sharing; Software-defined networking; Edge computing; Dedicated short-range communications; Wireless ad hoc network; Cloud computing; Server; Wireless; Operating system","score_opus":0.02471518104194979,"score_gpt":0.2561665114549453,"score_spread":0.2314513304129955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2983694339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30614284,0.0001727435,0.69042504,0.000008583281,0.0013607728,0.000739268,0.000031749998,0.00083104084,0.0002879669],"genre_scores_gemma":[0.9847299,0.00002191123,0.014741762,0.00006667185,0.00013648925,0.000018944624,0.00007479017,0.00013252928,0.00007700127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971853,0.00012335031,0.000688088,0.00091534824,0.00030411876,0.00078378187],"domain_scores_gemma":[0.99781954,0.0006112599,0.00008567909,0.001275358,0.00006557547,0.00014258966],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073459203,0.0004405168,0.00054981007,0.00029297615,0.00021269025,0.0001581102,0.00093678175,0.00020485124,0.00012404844],"category_scores_gemma":[0.00001567317,0.00050496904,0.000094666546,0.00080511125,0.000041459673,0.00033253283,0.000028735603,0.0010716837,0.00029437363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016283137,0.00009178638,0.00024845309,0.000073096766,0.00008329466,0.000023596933,0.00031366915,0.9517846,0.0012006517,0.000004583916,0.00016230193,0.045997664],"study_design_scores_gemma":[0.0010043965,0.00009349066,0.0006504115,0.00038282643,0.000028929639,0.00004307789,0.00010304553,0.9951136,0.0016115267,0.0000054053608,0.00045692967,0.00050635054],"about_ca_topic_score_codex":0.00004909071,"about_ca_topic_score_gemma":0.00009964019,"teacher_disagreement_score":0.6785871,"about_ca_system_score_codex":0.0002950121,"about_ca_system_score_gemma":0.000053425058,"threshold_uncertainty_score":0.9997402},"labels":[],"label_agreement":null},{"id":"W2984468147","doi":"10.1109/tmc.2019.2952848","title":"Optimal Scheduling for Unmanned Aerial Vehicle Networks With Flow-Level Dynamics","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":12,"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; National Science Foundation","keywords":"Computer science; Queueing theory; Scheduling (production processes); Wireless; Distributed computing; Wireless network; Fading; Dynamic priority scheduling; Vehicle dynamics; Throughput; Real-time computing; Channel (broadcasting); Computer network; Mathematical optimization; Quality of service; Telecommunications","score_opus":0.00745129455024186,"score_gpt":0.20656836843316156,"score_spread":0.19911707388291972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984468147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26446804,0.000015550924,0.7340422,0.000007983329,0.00047888668,0.0005987156,0.000025473708,0.00028361627,0.00007952622],"genre_scores_gemma":[0.84659487,0.000009221407,0.15301807,0.000015399104,0.00011275823,0.000109506014,0.00003032042,0.000059415666,0.000050446994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915344,0.000009990121,0.0002200467,0.00023913397,0.00009510059,0.00028226722],"domain_scores_gemma":[0.9995068,0.00010170991,0.000037186517,0.00022454899,0.00007162437,0.000058165653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000092400216,0.00017338704,0.00017062011,0.00007995217,0.00020184094,0.00006239135,0.0001150417,0.000103743514,0.000027414158],"category_scores_gemma":[6.587017e-7,0.00018013109,0.00007103101,0.00025287198,0.000017864899,0.00010392382,0.0000011724388,0.0002010927,0.00002017772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034446464,0.000038507264,0.000015853213,0.000027541166,0.00003799339,1.9470676e-7,0.00006564859,0.9749159,0.00022925039,0.00003304479,0.000008084087,0.024593487],"study_design_scores_gemma":[0.00081729237,0.0001389248,0.000025086209,0.000047013982,0.000028133329,0.0000032656433,0.00009273339,0.9971455,0.0013868058,0.0000029799603,0.00009051453,0.00022179274],"about_ca_topic_score_codex":0.000005563372,"about_ca_topic_score_gemma":0.000017699636,"teacher_disagreement_score":0.5821268,"about_ca_system_score_codex":0.000116237636,"about_ca_system_score_gemma":0.000017678469,"threshold_uncertainty_score":0.7345533},"labels":[],"label_agreement":null},{"id":"W2991627768","doi":"10.1109/tmc.2019.2955948","title":"Energy Efficient Collaborative Beamforming for Reducing Sidelobe in Wireless Sensor Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Antenna Design and Optimization","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Beamforming; Wireless sensor network; Cuckoo search; Efficient energy use; Optimization problem; Node (physics); Transmission (telecommunications); Mathematical optimization; Distributed computing; Algorithm; Computer network; Particle swarm optimization; Telecommunications; Mathematics; Engineering; Electrical engineering","score_opus":0.005291760724860604,"score_gpt":0.20491713591642702,"score_spread":0.19962537519156642,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2991627768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17767656,0.00005733395,0.8206717,0.0000050738577,0.000803038,0.00045161994,0.00000628122,0.00018707142,0.00014135826],"genre_scores_gemma":[0.99013716,0.00003803113,0.009534507,0.000028669312,0.000063779386,0.00006449437,0.0000064413043,0.00005006094,0.000076839686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989872,0.000029089833,0.00031625107,0.00024503242,0.00009976014,0.0003226695],"domain_scores_gemma":[0.99947256,0.00022222837,0.00004666382,0.00014587255,0.00006367345,0.00004899498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015062586,0.00017841734,0.00022345304,0.00017842946,0.00012252668,0.00003698153,0.000078430574,0.00010582515,0.000012324003],"category_scores_gemma":[0.0000012794023,0.00019740371,0.00006946298,0.00048684416,0.000015258815,0.000069926034,9.987634e-7,0.00017779741,0.0000053551166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002405162,0.000037774054,0.0000062670038,0.00003102003,0.00001764625,0.0000011086528,0.0004151785,0.97382647,0.0033957008,0.000035839097,0.000009451263,0.022199504],"study_design_scores_gemma":[0.0005262943,0.00008018614,0.0000045858296,0.00017269311,0.000009777772,0.0000030688284,0.00048107942,0.9875276,0.010914624,0.0000025734025,0.00006559352,0.00021192165],"about_ca_topic_score_codex":0.000017372231,"about_ca_topic_score_gemma":0.000012685071,"teacher_disagreement_score":0.8124606,"about_ca_system_score_codex":0.00016172661,"about_ca_system_score_gemma":0.000023441824,"threshold_uncertainty_score":0.804989},"labels":[],"label_agreement":null},{"id":"W2997803755","doi":"10.1109/tmc.2019.2962126","title":"Load Management, Power and Admission Control in Downlink Cellular OFDMA Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","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":"University of Toronto; University of Manitoba","funders":"","keywords":"Telecommunications link; Computer science; Base station; Computer network; Load balancing (electrical power); Transmitter power output; Power control; Orthogonal frequency-division multiple access; Admission control; Cellular network; Resource management (computing); Orthogonal frequency-division multiplexing; Distributed computing; Power (physics); Transmitter; Mathematics; Quality of service","score_opus":0.0026288476344518328,"score_gpt":0.18963445289293476,"score_spread":0.18700560525848292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997803755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15720136,0.0004512652,0.84048426,0.000008801742,0.00066494825,0.00052601856,0.0000024302306,0.00024134567,0.0004195674],"genre_scores_gemma":[0.9970897,0.0003419682,0.0023133617,0.0000482566,0.000034964694,0.00003424568,0.0000022951633,0.00004690963,0.00008831724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901927,0.000031487227,0.000264047,0.00026628558,0.00012729815,0.00029164233],"domain_scores_gemma":[0.9995858,0.0000889122,0.000037684636,0.00019656266,0.000020385804,0.00007066671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011654482,0.00018816773,0.0002065102,0.00012670302,0.00007107793,0.000028292023,0.00008486686,0.000105619394,0.00007908519],"category_scores_gemma":[4.5274624e-7,0.00020817184,0.00004603215,0.00028438077,0.000014953179,0.000122069505,0.0000019694048,0.0003139066,0.00001889423],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002018567,0.00003231384,0.00016530063,0.00004066305,0.00002610117,0.0000054187767,0.00006802307,0.94939613,0.0007128293,0.000010651832,0.000014663826,0.049507737],"study_design_scores_gemma":[0.0011385838,0.000042955347,0.00016726092,0.0001977365,0.00001537988,0.0000018901269,0.00004035273,0.9972006,0.0006768216,0.000010109084,0.00030023165,0.00020808892],"about_ca_topic_score_codex":0.0000030834435,"about_ca_topic_score_gemma":0.0000031647621,"teacher_disagreement_score":0.83988833,"about_ca_system_score_codex":0.00011644877,"about_ca_system_score_gemma":0.000005504977,"threshold_uncertainty_score":0.84890014},"labels":[],"label_agreement":null},{"id":"W2998898452","doi":"10.1109/tmc.2020.2965929","title":"Edge-Enabled V2X Service Placement for Intelligent Transportation Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":181,"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); Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristic; Integer programming; Service (business); Quality of service; Linear programming; Enhanced Data Rates for GSM Evolution; Computation; Set (abstract data type); Resource allocation","score_opus":0.01853816813043831,"score_gpt":0.22755114404623097,"score_spread":0.20901297591579265,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998898452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.094172865,0.00022980552,0.90206677,0.00006519171,0.001307336,0.0013081963,0.00004659992,0.0007314015,0.000071812174],"genre_scores_gemma":[0.99739873,0.000035120127,0.0016946385,0.00019973992,0.0002666609,0.00025303112,0.000038308208,0.00008636096,0.000027387525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985615,0.000032837008,0.00046981705,0.00032787386,0.00020290066,0.00040509147],"domain_scores_gemma":[0.99932665,0.0001433985,0.00005543647,0.00019350163,0.0000977352,0.00018325646],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001557437,0.00026097219,0.00028659162,0.00007197038,0.00017545353,0.00006656546,0.00017433651,0.00011123552,0.000038496823],"category_scores_gemma":[0.000001435187,0.00029573333,0.00013860168,0.00037521753,0.000010417813,0.000096586795,5.8198736e-7,0.00029623602,0.00006305744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036855432,0.000041922267,0.0000024487767,0.00044535418,0.00010856492,0.000003422627,0.0011956317,0.98795253,0.0015361448,0.000011797737,0.0004051192,0.008260179],"study_design_scores_gemma":[0.0005640522,0.00015647031,0.0000061757582,0.00013082344,0.00007535568,0.0000031872107,0.00055845716,0.9820247,0.009605334,0.0000024243798,0.0065961513,0.00027685362],"about_ca_topic_score_codex":0.000016455435,"about_ca_topic_score_gemma":0.000034939432,"teacher_disagreement_score":0.9032259,"about_ca_system_score_codex":0.00014600603,"about_ca_system_score_gemma":0.000024184828,"threshold_uncertainty_score":0.99994946},"labels":[],"label_agreement":null},{"id":"W2998910091","doi":"10.1109/tmc.2020.2965450","title":"Dynamic Model for Network Selection in Next Generation HetNets With Memory-Affecting Rational Users","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Alberta","funders":"National Research Foundation of Korea","keywords":"Computer science; Heterogeneous network; Evolutionary game theory; Game theory; Wireless network; Network formation; Selection (genetic algorithm); Service (business); Distributed computing; Wireless; Artificial intelligence; Telecommunications; Mathematics","score_opus":0.023076380376729447,"score_gpt":0.23812649483682713,"score_spread":0.2150501144600977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998910091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11919624,0.000035908743,0.87914985,0.00001941337,0.00026023036,0.00092339993,0.000005409777,0.00038966732,0.00001985975],"genre_scores_gemma":[0.9051677,0.000006292715,0.09436394,0.000052761367,0.0001507628,0.00015911623,0.000018768218,0.000067007546,0.000013651725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894357,0.00003531984,0.0003250897,0.0003048083,0.000114531125,0.00027666258],"domain_scores_gemma":[0.999622,0.000104676634,0.000065985216,0.00007536646,0.000067764086,0.00006421026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012749631,0.00019857998,0.00019691026,0.00009570264,0.00023263085,0.000053757365,0.000063295105,0.0000883867,0.0000046542996],"category_scores_gemma":[0.0000045577362,0.00022623046,0.000052710824,0.0004581632,0.000011375098,0.00032705232,7.447243e-7,0.00023920626,0.0000032985292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029555613,0.000017245851,0.000014683544,0.000060612834,0.000021647278,4.5117744e-7,0.00063651975,0.9794703,0.011748997,0.0000041017634,0.000026317835,0.007969567],"study_design_scores_gemma":[0.0006864009,0.000118976146,0.000007647607,0.000064959684,0.00001647875,0.0000059816266,0.0001048304,0.9960175,0.0027445196,0.0000063304806,0.000005351874,0.00022099295],"about_ca_topic_score_codex":0.000004490517,"about_ca_topic_score_gemma":0.00019497577,"teacher_disagreement_score":0.78597146,"about_ca_system_score_codex":0.00025374643,"about_ca_system_score_gemma":0.00003278914,"threshold_uncertainty_score":0.9225411},"labels":[],"label_agreement":null},{"id":"W2999263473","doi":"10.1109/tmc.2020.2967038","title":"The Design of Dynamic Probabilistic Caching with Time-Varying Content Popularity","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":83,"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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Probabilistic logic; Popularity; Dynamic web page; Markov chain; Exploit; Markov decision process; Markov process; Mathematical optimization; Artificial intelligence; Machine learning; Computer security; Mathematics; Statistics","score_opus":0.03543056412763705,"score_gpt":0.23232863268019663,"score_spread":0.1968980685525596,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2999263473","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061961293,0.00008313343,0.936673,0.0003502492,0.00019713893,0.00048041303,0.0000029493385,0.00022219404,0.000029621186],"genre_scores_gemma":[0.98985094,0.000006713143,0.009883049,0.00017115573,0.000017394288,0.000020623871,5.3597364e-7,0.00001525345,0.000034322085],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844575,0.00022958062,0.00033773214,0.00040075084,0.00030631898,0.00027988176],"domain_scores_gemma":[0.99863833,0.0006043337,0.00014861683,0.00039924908,0.00010968312,0.00009980228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041094993,0.00018079055,0.00023053012,0.000050395636,0.00064427085,0.00014198963,0.000636172,0.000041484025,0.000002045503],"category_scores_gemma":[0.000018081824,0.0001304869,0.00010905967,0.0003322373,0.00007264503,0.0001647482,0.000010011282,0.00039227816,0.000012624526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006104114,0.00007855717,0.000009388041,0.000025147372,0.000051768537,0.000008880239,0.0006108009,0.9243668,0.00966452,0.00010883268,0.0000066639177,0.06500765],"study_design_scores_gemma":[0.00035315007,0.0004358185,0.000027714319,0.00009455331,0.000025347219,0.000020907091,0.000070663235,0.9972727,0.0014899418,0.00003881673,0.000011132737,0.00015926074],"about_ca_topic_score_codex":0.00007091697,"about_ca_topic_score_gemma":0.0000058623577,"teacher_disagreement_score":0.92788965,"about_ca_system_score_codex":0.000069520516,"about_ca_system_score_gemma":0.00007386819,"threshold_uncertainty_score":0.5321101},"labels":[],"label_agreement":null},{"id":"W3004215161","doi":"10.1109/tmc.2020.2970902","title":"SST: Software Sonic Thermometer on Acoustic-Enabled IoT Devices","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Soil Moisture and Remote Sensing","field":"Environmental 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":"McMaster University","funders":"National Natural Science Foundation of China","keywords":"Thermometer; Computer science; Real-time computing; Temperature measurement; Software; Pipeline transport; Computer hardware; Embedded system; Environmental science","score_opus":0.014459423350645723,"score_gpt":0.22759690955681341,"score_spread":0.21313748620616768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3004215161","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.6040072,0.00002410202,0.39218447,0.00024063227,0.00047008556,0.0002907454,0.0000024212393,0.00027555437,0.0025048207],"genre_scores_gemma":[0.9945584,0.0000051763545,0.0029217256,0.0022179184,0.0001353613,0.0000026774517,9.333501e-7,0.000037446265,0.00012038158],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985503,0.00007276434,0.00023143862,0.0004774902,0.000307155,0.00036083773],"domain_scores_gemma":[0.99928164,0.00024575862,0.000074676485,0.00023155076,0.000010094877,0.00015626034],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000107294785,0.0002254139,0.00020572475,0.00004227812,0.00041620716,0.000055567067,0.00020347166,0.00009981834,0.00029989384],"category_scores_gemma":[0.000009134149,0.00019217559,0.00013949952,0.000357069,0.00008088193,0.000060679533,0.0000063616276,0.00040533487,0.0008282234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027112594,0.000080056525,0.00019335485,0.000015293112,0.000025407264,0.00001606612,0.0007745054,0.6636863,0.0082920445,2.267349e-7,0.0001690958,0.32672054],"study_design_scores_gemma":[0.0030095698,0.002849545,0.030317545,0.0005615601,0.0004065354,0.00010642205,0.0020337086,0.81069875,0.13645211,0.00009044097,0.011064352,0.0024094617],"about_ca_topic_score_codex":0.00008868449,"about_ca_topic_score_gemma":0.00012904798,"teacher_disagreement_score":0.3905512,"about_ca_system_score_codex":0.000118228345,"about_ca_system_score_gemma":0.00001219731,"threshold_uncertainty_score":0.99994975},"labels":[],"label_agreement":null},{"id":"W3007412953","doi":"10.1109/tmc.2020.2975792","title":"PROTECT: Efficient Password-Based Threshold Single-Sign-On Authentication for Mobile Users against Perpetual Leakage","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Password; Computer science; Computer security; Security token; Authentication (law); S/KEY; Authentication server; Computer network; Mobile device; Server; One-time password; World Wide Web","score_opus":0.03566837131189985,"score_gpt":0.25863941984195776,"score_spread":0.22297104853005792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007412953","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2426762,0.000017899469,0.7531756,0.0005552627,0.0006283296,0.002280074,0.000020434745,0.0005830465,0.000063139836],"genre_scores_gemma":[0.99472004,0.0000011244476,0.00327659,0.0011023717,0.00011936487,0.000683756,0.000010009778,0.00004641771,0.000040308725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732447,0.0001426528,0.0005995664,0.0009122225,0.0005310885,0.0004900144],"domain_scores_gemma":[0.9982449,0.00037624285,0.00022407394,0.0007157941,0.00018275723,0.0002562381],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004047213,0.00033388633,0.00032646905,0.00022451037,0.0006133729,0.00032519925,0.0008266117,0.00013262201,0.000014732724],"category_scores_gemma":[0.000019691455,0.00034022817,0.00029468138,0.0007010092,0.00007126243,0.00014677178,0.000008403132,0.0003603057,0.00012503838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010745376,0.0016399685,0.000011647087,0.00024536924,0.00007003922,0.0000054883776,0.033759523,0.86217153,0.029452953,0.0005798876,0.00016178834,0.071794346],"study_design_scores_gemma":[0.00094242307,0.0009081524,0.000014084005,0.00011235335,0.000020457583,0.0000017371025,0.0003389747,0.94051313,0.05543472,0.000018375435,0.0013509811,0.0003445907],"about_ca_topic_score_codex":0.000004268925,"about_ca_topic_score_gemma":0.000002732365,"teacher_disagreement_score":0.75204384,"about_ca_system_score_codex":0.00016091668,"about_ca_system_score_gemma":0.00010550274,"threshold_uncertainty_score":0.999905},"labels":[],"label_agreement":null},{"id":"W3009727746","doi":"10.1109/tmc.2020.2977902","title":"Multi-Adversarial In-Car Activity Recognition Using RFIDs","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Activity recognition; Radio-frequency identification; Software deployment; Wearable computer; Domain (mathematical analysis); Wireless; Identification (biology); Wearable technology; Radio frequency; Deep learning; Human–computer interaction; Artificial intelligence; Real-time computing; Embedded system; Computer security; Telecommunications","score_opus":0.05087555828928229,"score_gpt":0.25995392903430276,"score_spread":0.20907837074502048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3009727746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49277806,0.000013053416,0.5057504,0.000004551467,0.0009404946,0.00020732729,0.000010996975,0.0002576048,0.000037500522],"genre_scores_gemma":[0.98635346,0.000010621553,0.013168574,0.000025080952,0.0003583085,0.000018648057,0.0000015494956,0.00006250044,0.0000012578954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883157,0.00006144591,0.0002658376,0.00032184288,0.00017136439,0.00034792084],"domain_scores_gemma":[0.9995102,0.0001423242,0.000039563216,0.00014012135,0.00003706749,0.00013069143],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010850454,0.00023424286,0.0002409977,0.00015409305,0.0001452448,0.000045760582,0.0001238569,0.00012476687,0.000029028855],"category_scores_gemma":[0.000009178593,0.00029618622,0.00011412773,0.00051170733,0.000027247257,0.00026460012,0.0000029397097,0.00055557064,0.00006523642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018204038,0.000047268437,0.00009931938,0.00004330379,0.000021038766,0.0000111486315,0.00038577977,0.6076837,0.3484882,6.453678e-8,0.0000017612495,0.043200176],"study_design_scores_gemma":[0.00089270534,0.000081385566,0.00015195881,0.000116360185,0.000023364106,0.000005440959,0.00014939663,0.6270671,0.37117824,0.00000380931,0.000018673427,0.00031156812],"about_ca_topic_score_codex":0.00006503385,"about_ca_topic_score_gemma":0.00001570388,"teacher_disagreement_score":0.4935754,"about_ca_system_score_codex":0.00028058857,"about_ca_system_score_gemma":0.000024122583,"threshold_uncertainty_score":0.99994904},"labels":[],"label_agreement":null},{"id":"W3014297757","doi":"10.1109/tmc.2020.2984261","title":"LeaD: Large-Scale Edge Cache Deployment Based on Spatio-Temporal WiFi Traffic Statistics","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":144,"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":"National Key Research and Development Program of China; Higher Education Discipline Innovation Project; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Cache; Computer network; Software deployment; Backhaul (telecommunications); Bottleneck; Enhanced Data Rates for GSM Evolution; Telecommunications; Operating system; Embedded system; Base station","score_opus":0.023736029891642318,"score_gpt":0.2440994077803274,"score_spread":0.2203633778886851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3014297757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073687196,0.000026333666,0.92385864,0.00049280695,0.0008512982,0.00033628067,0.00007064074,0.00058405456,0.000092770926],"genre_scores_gemma":[0.9768414,0.0000037141006,0.02105977,0.0018024999,0.00011778738,0.000027536158,0.00001537038,0.00003173995,0.00010016835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978886,0.00016720501,0.00039247048,0.0006590932,0.00045865035,0.00043397365],"domain_scores_gemma":[0.9988197,0.00029263174,0.00011495837,0.00046742932,0.0000851654,0.00022009393],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00025639535,0.0002760783,0.00027415223,0.00016764505,0.00046772134,0.00018126401,0.00053772295,0.00008132964,0.000027814967],"category_scores_gemma":[0.0000067640854,0.0002881056,0.00016763285,0.00050839566,0.00003583826,0.00014518494,0.000007166668,0.0005149404,0.00014045286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040880932,0.00038379626,0.000038650018,0.00002819095,0.00002040999,0.000025115163,0.0009692824,0.90419805,0.00019706132,0.00007089536,0.00092868786,0.093098976],"study_design_scores_gemma":[0.0008404877,0.00061305985,0.000036236197,0.00005844924,0.000021820695,0.000003995857,0.0001132157,0.9950192,0.0015895403,0.0000063974135,0.0013979367,0.00029966646],"about_ca_topic_score_codex":0.000026388616,"about_ca_topic_score_gemma":0.00004581895,"teacher_disagreement_score":0.9031542,"about_ca_system_score_codex":0.000113131864,"about_ca_system_score_gemma":0.00011267554,"threshold_uncertainty_score":0.9999571},"labels":[],"label_agreement":null},{"id":"W3016835749","doi":"10.1109/tmc.2019.2910074","title":"Energy Efficient Scheduling Algorithms for Sweep Coverage in Mobile Sensor Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Key Research and Development Program of China Stem Cell and Translational Research; National Natural Science Foundation of China; Shanghai Science and Technology Development Foundation","keywords":"Computer science; Wireless sensor network; Algorithm; Scheduling (production processes); Scalability; Schedule; Wireless ad hoc network; Mobile device; Distributed computing; Real-time computing; Wireless; Mathematical optimization; Computer network; Telecommunications","score_opus":0.017319510006784035,"score_gpt":0.24554659227501807,"score_spread":0.22822708226823404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016835749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059048336,0.0003288131,0.937638,0.00014496215,0.0015405408,0.000667054,0.000008062163,0.0005581355,0.00006612541],"genre_scores_gemma":[0.92635906,0.000059409915,0.07216749,0.0007826159,0.00033534906,0.00019771147,0.000005523373,0.000062959916,0.000029880699],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966131,0.0001786558,0.00072813977,0.0011589201,0.00040942797,0.00091177697],"domain_scores_gemma":[0.99791634,0.00088442233,0.00020358025,0.0005864006,0.00011318634,0.00029606622],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036591548,0.00043229503,0.0005085225,0.0002491436,0.00044839655,0.00021930698,0.00085994805,0.00022884067,0.000009849128],"category_scores_gemma":[0.000007947084,0.00047700398,0.00029734176,0.0013661785,0.00006412671,0.00015458604,0.000022420116,0.000590218,0.000012778594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028744542,0.00022466127,0.00000450864,0.00001808327,0.000022562552,0.000020915775,0.00046067953,0.83027494,0.00026217636,0.00022543021,0.000012673606,0.16844463],"study_design_scores_gemma":[0.0011336887,0.00040366582,0.0000063517723,0.000102234706,0.000013196853,0.000012496412,0.00008467173,0.9919741,0.004867739,0.000009392852,0.000913545,0.000478888],"about_ca_topic_score_codex":0.000038992268,"about_ca_topic_score_gemma":0.000012968579,"teacher_disagreement_score":0.8673107,"about_ca_system_score_codex":0.00017851099,"about_ca_system_score_gemma":0.00006925304,"threshold_uncertainty_score":0.99976814},"labels":[],"label_agreement":null},{"id":"W3017967519","doi":"10.1109/tmc.2020.2983688","title":"Profit-Oriented Task Allocation for Mobile Crowdsensing With Worker Dynamics: Cooperative Offline Solution and Predictive Online Solution","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Online and offline; Online algorithm; Crowdsourcing; Scale (ratio); Data mining; Machine learning; Algorithm; World Wide Web","score_opus":0.013444001855619246,"score_gpt":0.24202445204851356,"score_spread":0.2285804501928943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017967519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17824334,0.000076146986,0.8187568,0.0005422381,0.0003492006,0.0015211585,0.00006079185,0.00043368517,0.000016642378],"genre_scores_gemma":[0.93271345,0.000011542113,0.06650983,0.00030056134,0.00017185164,0.00012985707,0.000066167195,0.000046308232,0.000050460832],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975045,0.00015487416,0.00050655473,0.0009876535,0.0003295415,0.00051690417],"domain_scores_gemma":[0.99831885,0.00030159426,0.00024564328,0.00038218417,0.00052853994,0.00022319498],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00031721004,0.00038359067,0.00038809908,0.00016550251,0.0009872027,0.00021596946,0.00022415193,0.00015339864,0.0000021073045],"category_scores_gemma":[0.00002354875,0.00036783682,0.00010424419,0.0007648238,0.00016862231,0.0004927093,0.000015655007,0.000458601,0.0000043876153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029288244,0.00022852409,0.000040222156,0.00008134982,0.000114312774,0.0000063075277,0.0038993112,0.80249506,0.009685012,0.00015564667,0.000063730404,0.18293767],"study_design_scores_gemma":[0.001245236,0.001630572,0.000077384015,0.000268839,0.000071490875,0.000040921954,0.00080568704,0.9835029,0.011797119,0.000013846625,0.00016590666,0.00038004355],"about_ca_topic_score_codex":0.000030560717,"about_ca_topic_score_gemma":0.00006427176,"teacher_disagreement_score":0.7544701,"about_ca_system_score_codex":0.00024073367,"about_ca_system_score_gemma":0.00013961748,"threshold_uncertainty_score":0.99987733},"labels":[],"label_agreement":null},{"id":"W3025029677","doi":"10.1109/tmc.2020.2994639","title":"Toward an Automated Auction Framework for Wireless Federated Learning Services Market","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":261,"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":"Dalian Science and Technology Innovation Fund; National Research Foundation of Korea; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Federated learning; Artificial intelligence; Machine learning; Server; Social Welfare; Computer security; World Wide Web","score_opus":0.03505927190919694,"score_gpt":0.30126244497585947,"score_spread":0.2662031730666625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025029677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04917139,0.000023986047,0.93649006,0.002934918,0.000845201,0.0005727956,0.000018850342,0.009912499,0.000030287276],"genre_scores_gemma":[0.71329504,0.000012770401,0.2861842,0.0003179002,0.00007762094,0.0000641336,0.000010247539,0.000032835458,0.0000052683176],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761426,0.00019204317,0.00042598834,0.0009481212,0.00030493594,0.0005146266],"domain_scores_gemma":[0.99723315,0.0005020637,0.00020948739,0.0017257202,0.00016348761,0.00016610521],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.00037745363,0.0003034532,0.00031642817,0.0001593265,0.0008577806,0.000537669,0.006801773,0.00028214682,0.000024549501],"category_scores_gemma":[0.00030458352,0.00033300105,0.00011344195,0.0009788818,0.000055587647,0.0008420306,0.0004554318,0.00080980966,0.000025823803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018485486,0.00044956035,0.00007388591,0.0005950576,0.00021120871,0.000030009778,0.0026253937,0.3877023,0.0064005163,0.00028921038,0.0044556614,0.59698236],"study_design_scores_gemma":[0.00034786473,0.0004824022,0.00003375476,0.00013796342,0.0000156609,0.000013115106,0.00038248248,0.98126537,0.014501447,0.0020947868,0.0003844517,0.0003407203],"about_ca_topic_score_codex":0.000030233055,"about_ca_topic_score_gemma":0.000004942447,"teacher_disagreement_score":0.66412365,"about_ca_system_score_codex":0.0001024298,"about_ca_system_score_gemma":0.000058040107,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W3025507213","doi":"10.1109/tmc.2020.2994354","title":"Uplink Scheduling in Multi-Cell OFDMA Networks: A Comprehensive Study","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Network Optimization","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":"Computer science; Telecommunications link; Scheduling (production processes); Goodput; Benchmark (surveying); Cellular network; Computer network; Distributed computing; Mathematical optimization; Telecommunications; Wireless","score_opus":0.02506381545907331,"score_gpt":0.25246457490581387,"score_spread":0.22740075944674054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3025507213","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32125333,0.00033053444,0.6768759,0.000009181733,0.00039158124,0.00062713097,0.0000019293311,0.0004995044,0.000010893359],"genre_scores_gemma":[0.9752313,0.00013372472,0.0242477,0.00009043041,0.00010892063,0.000090928246,0.000003076085,0.000088531066,0.0000053727763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985933,0.00006325825,0.00045319536,0.00038325912,0.00013459331,0.00037241256],"domain_scores_gemma":[0.99941826,0.00016358464,0.00005038338,0.00019003847,0.000057352812,0.000120362885],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000054116914,0.00027855893,0.0003302293,0.00012473906,0.00014539919,0.000038970822,0.00017297034,0.00009966668,0.000022645034],"category_scores_gemma":[0.0000019283048,0.00033693845,0.000078008154,0.0007596819,0.000021376112,0.00013518351,0.0000037960535,0.00066450646,0.000021087295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001793076,0.00025273112,0.00015940156,0.000041552303,0.000028887185,0.000012878043,0.0012078406,0.96793807,0.0006544342,2.434252e-7,0.0000037524394,0.02968228],"study_design_scores_gemma":[0.0014938699,0.0001300356,0.00012513087,0.00008204076,0.000020764857,0.0000014069785,0.0009067518,0.9959014,0.0010282809,3.4936443e-7,0.000016342552,0.00029360515],"about_ca_topic_score_codex":0.000008684354,"about_ca_topic_score_gemma":0.000016005362,"teacher_disagreement_score":0.653978,"about_ca_system_score_codex":0.000098682154,"about_ca_system_score_gemma":0.000011433504,"threshold_uncertainty_score":0.99990827},"labels":[],"label_agreement":null},{"id":"W3038876156","doi":"10.1109/tmc.2020.3006713","title":"Prediction of Traffic Flow via Connected Vehicles","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Traffic Prediction and Management Techniques","field":"Engineering","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":"Toronto Metropolitan University; Polytechnique Montréal","funders":"","keywords":"Mean squared error; Autoregressive integrated moving average; Computer science; Artificial neural network; Trajectory; Traffic flow (computer networking); Time series; Deep learning; Measure (data warehouse); Artificial intelligence; Intelligent transportation system; Flow (mathematics); Recurrent neural network; Machine learning; Data mining; Statistics; Mathematics; Engineering","score_opus":0.015966058535235583,"score_gpt":0.20195223583827507,"score_spread":0.18598617730303948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3038876156","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17696294,0.00003426157,0.81616855,0.000027422244,0.0004328054,0.0002802522,0.000032493685,0.005873711,0.00018759284],"genre_scores_gemma":[0.99688923,0.00004605552,0.002858746,0.0000671236,0.00006864294,0.000027085367,0.0000065075205,0.00003232443,0.000004252828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.000025875037,0.00031021674,0.00018509942,0.00014807361,0.00016221282],"domain_scores_gemma":[0.9996624,0.00005099772,0.000035190005,0.00013465215,0.000034033874,0.00008271228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006827943,0.00014620625,0.00017728221,0.000116813986,0.00008772487,0.000014620169,0.00011660032,0.00007744756,0.000030105717],"category_scores_gemma":[0.0000018469218,0.00016592539,0.00009614869,0.0003195186,0.00003160866,0.000087674496,0.0000012229979,0.00022569786,0.000016344571],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009165516,0.000040451483,0.0000019071089,0.000066502595,0.00004374204,0.0000010966004,0.00032773067,0.76421,0.0077024377,0.0000030397857,0.00098769,0.22660623],"study_design_scores_gemma":[0.00034965907,0.00018547122,0.00006181826,0.0000418928,0.00003183465,0.000002527085,0.0000932895,0.96183985,0.03655306,0.0000013938826,0.0007319173,0.000107261876],"about_ca_topic_score_codex":0.0000012819248,"about_ca_topic_score_gemma":0.0000016329649,"teacher_disagreement_score":0.8199263,"about_ca_system_score_codex":0.000034614084,"about_ca_system_score_gemma":0.000006557653,"threshold_uncertainty_score":0.6766241},"labels":[],"label_agreement":null},{"id":"W3049705125","doi":"10.1109/tmc.2021.3082927","title":"Computation Offloading in Heterogeneous Vehicular Edge Networks: On-Line and Off-Policy Bandit Solutions","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Mobile Computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca; Bundesministerium für Bildung und Forschung","keywords":"Computation offloading; Computer science; Base station; Mobile edge computing; Server; Edge computing; Computer network; Enhanced Data Rates for GSM Evolution; Latency (audio); Distributed computing; Cellular network; Network congestion; Computation; Edge device; Vehicular ad hoc network; Cloud computing; Wireless; Wireless ad hoc network; Artificial intelligence; Telecommunications","score_opus":0.030876974550178096,"score_gpt":0.28250189590348346,"score_spread":0.2516249213533054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3049705125","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1965348,0.00085377134,0.791357,0.00017839295,0.009959966,0.00064461055,0.000002947916,0.00039391004,0.00007463579],"genre_scores_gemma":[0.98883927,0.0002476722,0.008440827,0.0003403805,0.0019433328,0.00006849619,0.000029289564,0.00006772141,0.000023030258],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954955,0.0004306306,0.0010066129,0.0015807974,0.00047251617,0.00101397],"domain_scores_gemma":[0.9976148,0.00068692694,0.0003648572,0.0008809176,0.00020446604,0.00024801705],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007815884,0.00069869286,0.0008128104,0.0010134146,0.00090690295,0.00077483605,0.00080298405,0.00050014164,0.0000027713168],"category_scores_gemma":[0.000022379094,0.00081944955,0.0003560639,0.0011254696,0.00010697751,0.000231516,0.000169035,0.0019612608,0.00001429771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008388681,0.00023170006,0.000013005995,0.00007868324,0.00006562727,0.0000775027,0.0008930561,0.79369897,0.00004342808,0.000019992342,0.000041543957,0.20482808],"study_design_scores_gemma":[0.00063612015,0.00021759367,0.000117124815,0.0011186098,0.000034775134,0.00010893,0.00004167957,0.9957434,0.00096181827,0.00019020765,0.00014359795,0.00068615837],"about_ca_topic_score_codex":0.00018245509,"about_ca_topic_score_gemma":0.000036420963,"teacher_disagreement_score":0.79230446,"about_ca_system_score_codex":0.0005553014,"about_ca_system_score_gemma":0.00037984466,"threshold_uncertainty_score":0.99942565},"labels":[],"label_agreement":null},{"id":"W3068675400","doi":"10.1109/tmc.2020.3017646","title":"Decoupled Uplink-Downlink Association in Full-Duplex Cellular Networks: A Contract-Theory Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Full-Duplex Wireless Communications","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Key Research and Development Program of China; Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Telecommunications link; Computer science; Base station; Computer network; User equipment; Duplex (building); Cellular network; Association (psychology); Association scheme; Contract theory; Network topology; Channel (broadcasting); Wireless; Wireless network; Telecommunications; Microeconomics; Mathematics","score_opus":0.011627490306822896,"score_gpt":0.21018511727588324,"score_spread":0.19855762696906035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3068675400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3444242,0.00038641045,0.6534791,0.000090396046,0.0003067997,0.00051855826,0.000010402292,0.00065497524,0.00012914429],"genre_scores_gemma":[0.9928377,0.00015859796,0.006291582,0.00020074008,0.00016849431,0.00017322073,0.000036890942,0.000100137135,0.000032630654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997825,0.00020958003,0.00071952643,0.00042270462,0.00025479807,0.0005683806],"domain_scores_gemma":[0.9981211,0.0009632283,0.00013773769,0.00050231913,0.00008759571,0.00018806107],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00058976136,0.00034930086,0.0004591591,0.00018452009,0.00025812525,0.00009788041,0.00048474185,0.00030132371,0.00010277832],"category_scores_gemma":[0.00003295057,0.00042391784,0.00019784507,0.0008293398,0.00003792767,0.00014873467,0.0000069371067,0.0012766796,0.000092472656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031515454,0.00016884254,0.00006579339,0.000053345673,0.000097714365,0.0000035911453,0.001032588,0.97583216,0.0046237726,0.00004293728,0.00007648794,0.01797122],"study_design_scores_gemma":[0.00093755353,0.000067072,0.00013938113,0.0000618264,0.000047498095,0.0000031678799,0.00023070864,0.9959437,0.00188942,0.000002676259,0.00028997607,0.00038699535],"about_ca_topic_score_codex":0.000024672474,"about_ca_topic_score_gemma":0.000032222884,"teacher_disagreement_score":0.64841354,"about_ca_system_score_codex":0.00048270778,"about_ca_system_score_gemma":0.000037237794,"threshold_uncertainty_score":0.99982125},"labels":[],"label_agreement":null},{"id":"W3082183248","doi":"10.1109/tmc.2021.3073772","title":"Distributed Cooperation Under Uncertainty in Drone-Based Wireless Networks: A Bayesian Coalitional Game","year":2021,"lang":"en","type":"preprint","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","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":"University of Manitoba","funders":"","keywords":"Drone; Pooling; Computer science; Unavailability; Game theory; Bayesian game; Wireless network; Wireless; Bayesian probability; Divergence (linguistics); Mathematical optimization; Operations research; Sequential game; Artificial intelligence; Economics; Telecommunications; Mathematical economics; Engineering; Mathematics","score_opus":0.009505673007928168,"score_gpt":0.2288612947084637,"score_spread":0.21935562170053552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082183248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09857766,0.000110191635,0.89921856,0.00004599928,0.0006949444,0.00073011336,0.00017277739,0.00042067774,0.000029076773],"genre_scores_gemma":[0.9942256,0.00009183289,0.0030449906,0.00007554259,0.000115433584,0.00047252153,0.0018918709,0.0000742305,0.0000079384145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998181,0.00011095329,0.00061008096,0.00053493096,0.00021626567,0.00034678465],"domain_scores_gemma":[0.9990218,0.00017973241,0.00009244259,0.00044319063,0.00016753694,0.00009524522],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018632493,0.00037453554,0.0003874619,0.00022030696,0.00017092611,0.00020987398,0.000189726,0.00040047348,0.000107597625],"category_scores_gemma":[0.0000018885936,0.00046607276,0.00015650617,0.0005959489,0.00004743533,0.000082078426,0.000005536926,0.0009584903,0.000004944567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010881815,0.00018352542,0.000013890884,0.00009581637,0.000046913094,0.0000034885948,0.000090052454,0.993914,0.00011505609,0.000037261514,0.000027695938,0.0054613883],"study_design_scores_gemma":[0.0005382849,0.000022028065,0.00013921554,0.00039527434,0.000038568447,0.0000031224083,0.00009482703,0.9978362,0.0004501357,0.0000262343,0.000037724956,0.00041843284],"about_ca_topic_score_codex":0.00014776806,"about_ca_topic_score_gemma":0.0004623299,"teacher_disagreement_score":0.8961736,"about_ca_system_score_codex":0.00064102496,"about_ca_system_score_gemma":0.0001673238,"threshold_uncertainty_score":0.9997791},"labels":[],"label_agreement":null},{"id":"W3088881913","doi":"10.1109/tmc.2020.3025116","title":"Partial Computation Offloading and Adaptive Task Scheduling for 5G-Enabled Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":202,"is_retracted":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; Simon Fraser University","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Computation offloading; Scheduling (production processes); Distributed computing; Computer network; Computation; Dynamic priority scheduling; Vehicular ad hoc network; Stochastic game; Mathematical optimization; Wireless; Wireless ad hoc network; Edge computing; Internet of Things; Quality of service; Algorithm; Computer security","score_opus":0.024726931463749238,"score_gpt":0.25081265574565154,"score_spread":0.2260857242819023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088881913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06115924,0.00015369302,0.9335665,0.00030595605,0.0036046149,0.00067919627,8.562358e-7,0.00048639398,0.000043516586],"genre_scores_gemma":[0.92531395,0.000007446035,0.07281548,0.00048801655,0.0012979063,0.000036461275,0.0000028823486,0.00003315453,0.000004702647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977696,0.00012135535,0.00048637058,0.0007963874,0.00023879511,0.0005874702],"domain_scores_gemma":[0.9986468,0.00057775626,0.00018471367,0.00021297122,0.00013083614,0.0002469006],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041713953,0.00030782184,0.00036850848,0.00012763817,0.00096564426,0.00032427063,0.00037425512,0.00013497459,0.0000010285906],"category_scores_gemma":[0.000014021311,0.00033736863,0.00017238119,0.00057241495,0.000054832755,0.0003843052,0.0000137687,0.00045340712,0.000010540686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034881585,0.000043007647,0.000012784735,0.000036510435,0.000048518552,0.000006203336,0.0012531516,0.88696295,0.00063918636,0.00010254649,0.00007568648,0.1107846],"study_design_scores_gemma":[0.000879815,0.00042689592,0.0000217555,0.0001116078,0.000033119355,0.000013583573,0.00007492003,0.9933382,0.004300579,0.000113802795,0.0003291877,0.0003565109],"about_ca_topic_score_codex":0.000012243442,"about_ca_topic_score_gemma":5.3482717e-7,"teacher_disagreement_score":0.8641547,"about_ca_system_score_codex":0.000070030284,"about_ca_system_score_gemma":0.00006468798,"threshold_uncertainty_score":0.99990785},"labels":[],"label_agreement":null},{"id":"W3089314236","doi":"10.1109/tmc.2020.3025201","title":"Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"National Key Research and Development Program of China; Beijing Municipal Natural Science Foundation","keywords":"Computer science; Cache; Latency (audio); Content delivery; Computer network; Information-centric networking; Bandwidth (computing); Telecommunications","score_opus":0.012585359209285336,"score_gpt":0.20514561151961874,"score_spread":0.1925602523103334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089314236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04542158,0.00004026815,0.9530205,0.0003763948,0.00027360165,0.0005553384,0.0000017107595,0.00020897927,0.000101636506],"genre_scores_gemma":[0.98317903,0.0000528976,0.015775103,0.0009305285,0.000025095365,0.000021488106,0.0000049296173,0.00000704874,0.0000038593653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987206,0.00005280269,0.00052643125,0.00021733207,0.00024329874,0.00023955974],"domain_scores_gemma":[0.9993216,0.00008928403,0.00016277819,0.00019841726,0.0001003535,0.00012761235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018883227,0.00015525628,0.00016462126,0.00020406293,0.00020493098,0.00022790475,0.0002934825,0.00008630605,0.0000126610585],"category_scores_gemma":[0.000012685898,0.00015607067,0.000049664075,0.000738514,0.000024391316,0.001748942,0.000011793622,0.00029553947,0.00003791032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007514798,0.000032504042,0.00004945684,0.000023852928,0.0000048942015,0.0000024919095,0.0015741504,0.8900344,0.00001667385,0.00013423123,0.00002944876,0.10809042],"study_design_scores_gemma":[0.00067552074,0.00013166854,0.00029737156,0.000067055145,0.0000033469194,0.0000067286746,0.00016908417,0.99757487,0.00079684716,0.000008342514,0.000109108616,0.0001600758],"about_ca_topic_score_codex":0.000013432837,"about_ca_topic_score_gemma":0.000001929266,"teacher_disagreement_score":0.9377575,"about_ca_system_score_codex":0.000067805675,"about_ca_system_score_gemma":0.00004133232,"threshold_uncertainty_score":0.6364377},"labels":[],"label_agreement":null},{"id":"W3104711241","doi":"10.1109/tmc.2020.3038710","title":"Online Bitrate Selection for Viewport Adaptive 360-Degree Video Streaming","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Viewport; Computer science; Variable bitrate; Quality of experience; Upload; Constant bitrate; Streaming algorithm; Video quality; Bandwidth (computing); Dynamic Adaptive Streaming over HTTP; Real-time computing; Multimedia; Computer vision; Quality of service; Bit rate; Computer network; Upper and lower bounds; Metric (unit)","score_opus":0.08319445523496753,"score_gpt":0.32464107369505935,"score_spread":0.2414466184600918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104711241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01398806,0.00004751837,0.98341066,0.00072860817,0.0004969321,0.0007242049,0.000027945607,0.00048180323,0.00009428769],"genre_scores_gemma":[0.8757062,0.000011751397,0.122477084,0.0014242153,0.00022658682,0.00006826002,0.0000057126194,0.000025234662,0.00005494044],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979677,0.000120243836,0.0005011669,0.00069047,0.00029924288,0.0004211278],"domain_scores_gemma":[0.99883443,0.00032830992,0.00018182746,0.00028167327,0.0002014113,0.00017231794],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030894988,0.00026239135,0.0003107869,0.00012420423,0.0005034316,0.000165695,0.00046712306,0.00008747058,0.000014072639],"category_scores_gemma":[0.000010095656,0.00027390692,0.0002218128,0.00067769643,0.000032093576,0.00049339846,0.0000083433815,0.00038913294,0.000026953236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006223227,0.00062479335,0.000017415781,0.00010126915,0.00012310305,0.000008776293,0.0020296655,0.24374409,0.005976937,0.0006080412,0.00030493469,0.74639875],"study_design_scores_gemma":[0.000644863,0.0010294177,0.00008121846,0.00007560216,0.000036081172,0.000012737552,0.0003342299,0.9642171,0.031843785,0.00011920998,0.0012783156,0.0003274063],"about_ca_topic_score_codex":0.000054061293,"about_ca_topic_score_gemma":0.00004018797,"teacher_disagreement_score":0.8617182,"about_ca_system_score_codex":0.00011567758,"about_ca_system_score_gemma":0.0001532859,"threshold_uncertainty_score":0.99997133},"labels":[],"label_agreement":null},{"id":"W3105504538","doi":"10.1109/tmc.2020.3036871","title":"Deep Reinforcement Learning for Task Offloading in Mobile Edge Computing Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":531,"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 British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Reinforcement learning; Mobile edge computing; Task (project management); Enhanced Data Rates for GSM Evolution; Edge computing; Node (physics); Mobile device; Edge device; Distributed computing; Exploit; Computer network; Real-time computing; Artificial intelligence; Cloud computing; Operating system","score_opus":0.02226726386392214,"score_gpt":0.2558794744901244,"score_spread":0.23361221062620224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3105504538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034070812,0.0003229656,0.9554053,0.00009058824,0.007533656,0.0015391712,3.2126184e-7,0.00076014374,0.0002770724],"genre_scores_gemma":[0.98784846,0.000013906956,0.01022428,0.00033914563,0.0013351601,0.0001194495,0.000005155816,0.000060665996,0.000053799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961433,0.00020835764,0.0010788213,0.0010668992,0.0004441071,0.001058549],"domain_scores_gemma":[0.9978626,0.0008800861,0.00034916177,0.00044625334,0.00017089557,0.00029102023],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000861219,0.00047091863,0.00063274626,0.00037203656,0.000993864,0.00045464002,0.0010025431,0.00017313029,0.000003306915],"category_scores_gemma":[0.00003143181,0.000529443,0.00028754378,0.001180838,0.000048737656,0.00042352217,0.000045796598,0.0008914106,0.00006485995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019602012,0.000071004586,0.000060876464,0.0001611728,0.000033825807,0.000011948975,0.005286566,0.8934547,0.0009427708,0.00005724947,0.00013708674,0.099763215],"study_design_scores_gemma":[0.0011069127,0.00064961903,0.000017403207,0.0002960178,0.000017621473,0.000019632687,0.00046884644,0.9901747,0.0022312577,0.000011370832,0.0044635483,0.00054305844],"about_ca_topic_score_codex":0.000044534143,"about_ca_topic_score_gemma":0.0000020495715,"teacher_disagreement_score":0.9537776,"about_ca_system_score_codex":0.00032420584,"about_ca_system_score_gemma":0.000107287895,"threshold_uncertainty_score":0.9997157},"labels":[],"label_agreement":null},{"id":"W3107627141","doi":"10.1109/tmc.2020.3040945","title":"A Reinforcement Learning Framework for Efficient Informative Sensing","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Motion planning; Path (computing); Inference; Process (computing); Plan (archaeology); Mathematical optimization; Artificial intelligence; Robot; Distributed computing; Mathematics","score_opus":0.01973670981837335,"score_gpt":0.25837263188972825,"score_spread":0.2386359220713549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107627141","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026128095,0.000021126694,0.97133213,0.00029248095,0.0006468403,0.00064213644,0.0000012863169,0.0006960932,0.00023983352],"genre_scores_gemma":[0.86092603,0.0000026137918,0.13807443,0.0008102586,0.000121246805,0.00001679121,0.000001205111,0.000024067056,0.000023387925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980588,0.00008314293,0.00049648347,0.00050368323,0.00033494295,0.00052292575],"domain_scores_gemma":[0.9983401,0.0007259158,0.0002130347,0.00034946643,0.00015458874,0.0002169317],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036412315,0.00027156522,0.00029668162,0.00013349864,0.00096935313,0.00030119106,0.0003681988,0.00011065223,0.0000073170368],"category_scores_gemma":[0.00005163241,0.00028181978,0.00022172499,0.0005954419,0.000047892583,0.00017223158,0.000013498121,0.00064024125,0.000050896204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018597093,0.000021550335,9.0576185e-7,0.00004285702,0.000025759582,0.0000031372301,0.008147943,0.85137993,0.00039332133,0.0006791637,0.000021879363,0.13926497],"study_design_scores_gemma":[0.0004161513,0.0004416012,0.0000023377452,0.0001924086,0.000015822387,0.000013979729,0.00084874086,0.9760544,0.02069439,0.00008214634,0.0009376624,0.00030039155],"about_ca_topic_score_codex":0.000007104912,"about_ca_topic_score_gemma":3.7455908e-7,"teacher_disagreement_score":0.8347979,"about_ca_system_score_codex":0.0001023667,"about_ca_system_score_gemma":0.000070612,"threshold_uncertainty_score":0.9999634},"labels":[],"label_agreement":null},{"id":"W3111189508","doi":"10.1109/tmc.2020.3042925","title":"Online Altitude Control and Scheduling Policy for Minimizing AoI in UAV-assisted IoT Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":126,"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; Markov decision process; Lyapunov optimization; Scheduling (production processes); Reinforcement learning; Computer network; Base station; Online algorithm; Optimization problem; Upload; Wireless; Channel state information; Software deployment; Wireless network; Real-time computing; Markov process; Distributed computing; Mathematical optimization; Telecommunications; Artificial intelligence","score_opus":0.017582990612235838,"score_gpt":0.2640407087262677,"score_spread":0.2464577181140319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111189508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05072679,0.000044183762,0.94670016,0.0014221935,0.00021691446,0.00062610285,0.000008862384,0.00023509993,0.000019670164],"genre_scores_gemma":[0.8282045,0.000016198446,0.1702039,0.0013756498,0.00014056347,0.000034153276,0.0000044348553,0.000016499465,0.000004109672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854827,0.00006379384,0.00052768545,0.00036384858,0.00016277077,0.00033362175],"domain_scores_gemma":[0.9990134,0.0003679121,0.00018331615,0.00019927767,0.00009502868,0.00014106827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022815564,0.00019303709,0.00027055907,0.00023519948,0.00029152972,0.00017422502,0.000335144,0.000104893494,0.0000020081977],"category_scores_gemma":[0.000022475422,0.0002139586,0.00007844024,0.00069438166,0.000035128072,0.0003600449,0.000008180146,0.00028817877,0.000002469215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022817674,0.00007116493,0.000018582154,0.000030243005,0.000015372872,0.0000017237764,0.0009819935,0.87670535,0.00015184811,0.00018865125,0.0000049020255,0.12180736],"study_design_scores_gemma":[0.0017174573,0.00013986001,0.00018501999,0.00009345226,0.000008959605,0.000009064243,0.00018178528,0.9970815,0.0003285865,0.000010512132,0.000044749802,0.00019903512],"about_ca_topic_score_codex":0.000022873137,"about_ca_topic_score_gemma":0.000016174241,"teacher_disagreement_score":0.7774777,"about_ca_system_score_codex":0.00009576807,"about_ca_system_score_gemma":0.00009051298,"threshold_uncertainty_score":0.8724978},"labels":[],"label_agreement":null},{"id":"W3112548650","doi":"10.1109/tmc.2020.3043736","title":"Joint Server Selection, Cooperative Offloading and Handover in Multi-access Edge Computing Wireless Network: A Deep Reinforcement Learning Approach","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":97,"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":"Computer science; Server; Mobile edge computing; Computation offloading; Reinforcement learning; Wireless network; Handover; Computer network; Distributed computing; Edge computing; Wireless; Enhanced Data Rates for GSM Evolution; Artificial intelligence","score_opus":0.04258256282409849,"score_gpt":0.2678853654331454,"score_spread":0.2253028026090469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3112548650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1634386,0.00009620263,0.83361304,0.000077292636,0.001572592,0.00064015854,1.0484697e-7,0.00041644947,0.0001455762],"genre_scores_gemma":[0.9775497,0.000016255437,0.021166181,0.0004997625,0.0006579152,0.000026681355,0.000003008217,0.00004485272,0.00003565951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964961,0.00033700687,0.00083423004,0.0010689315,0.0003638837,0.00089984806],"domain_scores_gemma":[0.9987528,0.00026091622,0.00028366095,0.00025008604,0.00018929056,0.0002632469],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520822,0.00046499886,0.0005942729,0.00025570477,0.0012822099,0.00068731233,0.00061345246,0.00015390188,0.000005240901],"category_scores_gemma":[0.0000183945,0.0004979768,0.0001398992,0.0017351665,0.000072205585,0.00074951124,0.000099993464,0.001174021,0.000013709547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002081317,0.00010001682,0.000961416,0.0000886684,0.000050280334,0.000009296182,0.006231633,0.94986063,0.00039758056,0.00004573738,0.000053592194,0.042180344],"study_design_scores_gemma":[0.0014973757,0.00023466474,0.00072520855,0.00021683089,0.00001655707,0.000032686425,0.00017321855,0.9939332,0.00251974,0.0000055394376,0.00012096445,0.0005240308],"about_ca_topic_score_codex":0.00009362509,"about_ca_topic_score_gemma":0.000013963134,"teacher_disagreement_score":0.81411105,"about_ca_system_score_codex":0.00020666653,"about_ca_system_score_gemma":0.00010042425,"threshold_uncertainty_score":0.99974716},"labels":[],"label_agreement":null},{"id":"W3118639493","doi":"10.1109/tmc.2021.3051665","title":"Boosting Chirp Signal Based Aerial Acoustic Communication Under Dynamic Channel Conditions","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","field":"Engineering","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":"McMaster University","funders":"","keywords":"Computer science; Bit error rate; Fading; Robustness (evolution); Channel (broadcasting); Multipath propagation; Communications system; Chirp; Transmission (telecommunications); Real-time computing; Data transmission; Algorithm; Telecommunications; Electronic engineering; Computer network; Engineering","score_opus":0.01439244555626429,"score_gpt":0.2411125298944728,"score_spread":0.2267200843382085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118639493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10891273,0.00021629997,0.8892263,0.00007954087,0.0003195605,0.00024502396,0.0000405549,0.0005730128,0.0003869685],"genre_scores_gemma":[0.9968144,0.00004384219,0.0026634538,0.00012644347,0.00005312715,0.00009124072,0.00007290187,0.000060828304,0.0000737056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986493,0.00017698063,0.00044068298,0.00023824317,0.00019218549,0.0003025847],"domain_scores_gemma":[0.9987433,0.000345838,0.00007169943,0.0006194757,0.00012644248,0.00009327451],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018019511,0.00021773906,0.00023348982,0.00012757974,0.00065408077,0.00013396799,0.00028532356,0.00011726432,0.00014412701],"category_scores_gemma":[0.0000011111699,0.00025906428,0.00013995747,0.00034281754,0.000055221073,0.0001214803,0.0000057076186,0.00044452096,0.00006204594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004201459,0.00009301996,0.0000015847995,0.000041788186,0.000050382998,0.0000021548483,0.00025256036,0.94089967,0.05403671,0.0000077277455,0.000017571945,0.0045926487],"study_design_scores_gemma":[0.00058929675,0.00003482687,0.00006416943,0.00020974746,0.000043205637,0.00002848552,0.0007939786,0.9523104,0.045314543,0.00008465525,0.00025052638,0.00027619558],"about_ca_topic_score_codex":0.00001942539,"about_ca_topic_score_gemma":0.000086021435,"teacher_disagreement_score":0.8879017,"about_ca_system_score_codex":0.00018132648,"about_ca_system_score_gemma":0.000062788095,"threshold_uncertainty_score":0.9999862},"labels":[],"label_agreement":null},{"id":"W3132420509","doi":"10.1109/tmc.2021.3058787","title":"Measuring Roaming in Europe: Infrastructure and Implications on Users’ QoE","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","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":"Western University","funders":"Horizon 2020 Framework Programme; European Commission","keywords":"Roaming; Quality of experience; Computer science; Computer network; Telecommunications; Latency (audio); Order (exchange); Computer security; Quality of service; Business; Finance","score_opus":0.03407407743208634,"score_gpt":0.28650872601408955,"score_spread":0.2524346485820032,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132420509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18388411,0.000058302314,0.81478715,0.00039305288,0.00028245023,0.00014148912,0.00000283805,0.00010751623,0.0003431111],"genre_scores_gemma":[0.9816957,0.00003374951,0.017634286,0.00051967,0.000035016812,0.000017954511,0.000001115939,0.000013419561,0.00004907424],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985587,0.00016825944,0.0002943536,0.00050543115,0.00019746447,0.0002757833],"domain_scores_gemma":[0.9989931,0.0002451781,0.00006524949,0.00048791445,0.00012954386,0.00007904031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024994707,0.0001583898,0.00017198837,0.00016694354,0.00032616314,0.00022493672,0.00028354742,0.000055585624,0.000007716233],"category_scores_gemma":[0.000014256842,0.00017168238,0.000046817117,0.00085719884,0.00002649007,0.00027756975,0.0000143945545,0.00041368234,0.0000120286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067553215,0.00029938057,0.0005988488,0.00005525549,0.000034769037,0.0000564793,0.003159762,0.29426423,0.01070063,0.0021762848,0.000065236265,0.68858236],"study_design_scores_gemma":[0.003134381,0.0006024799,0.12565358,0.0010765281,0.00005869075,0.00039530837,0.0018379546,0.65382,0.20495021,0.0016050013,0.0050739674,0.0017919079],"about_ca_topic_score_codex":0.000017586954,"about_ca_topic_score_gemma":0.000022172879,"teacher_disagreement_score":0.79781157,"about_ca_system_score_codex":0.000093041075,"about_ca_system_score_gemma":0.00011234953,"threshold_uncertainty_score":0.7001004},"labels":[],"label_agreement":null},{"id":"W3135807060","doi":"10.1109/tmc.2021.3062775","title":"Privacy-Preserving Streaming Truth Discovery in Crowdsourcing With Differential Privacy","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","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 Waterloo","funders":"Higher Education Discipline Innovation Project; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Differential privacy; Crowdsourcing; Computer science; Internet privacy; Privacy protection; Information privacy; Privacy software; Computer security; World Wide Web; Data mining","score_opus":0.0116516055892134,"score_gpt":0.23471800594834075,"score_spread":0.22306640035912734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135807060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4813098,0.000042364016,0.5175817,0.000055094843,0.0004906218,0.00017026428,0.0000030007611,0.0002131252,0.00013405137],"genre_scores_gemma":[0.97795725,0.00001109,0.021567842,0.000075485426,0.00012875308,0.000031941272,0.000004544856,0.00005680313,0.00016630565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99654347,0.00027285478,0.00062626967,0.0011667755,0.0005514035,0.00083924184],"domain_scores_gemma":[0.9973765,0.00071770867,0.00019401252,0.001405805,0.00013174044,0.00017422423],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003209683,0.00044544577,0.0005060842,0.00036461014,0.0006464865,0.0009848473,0.0009571517,0.00013671951,0.000024870751],"category_scores_gemma":[0.0000382592,0.00043443873,0.00019885405,0.0012197132,0.00007321304,0.0009023619,0.00007145839,0.0008176031,0.0000106439875],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053027572,0.0006821256,0.00095515454,0.00014836382,0.00009835717,0.00045532765,0.0053026406,0.8310135,0.017150646,0.00026484238,0.000018120256,0.14385787],"study_design_scores_gemma":[0.0024361447,0.00031834166,0.0033502027,0.0016789049,0.00005598499,0.00036153765,0.0013224378,0.82117677,0.16777231,0.00016593549,0.00020874388,0.0011527162],"about_ca_topic_score_codex":0.00012289317,"about_ca_topic_score_gemma":0.000082922124,"teacher_disagreement_score":0.49664745,"about_ca_system_score_codex":0.00021804863,"about_ca_system_score_gemma":0.00022141874,"threshold_uncertainty_score":0.99981076},"labels":[],"label_agreement":null},{"id":"W3159475051","doi":"10.1109/tmc.2021.3074917","title":"QoE-Aware Efficient Content Distribution Scheme For Satellite-Terrestrial Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":154,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Cache; Quality of experience; Computer network; Network topology; Distributed computing; Real-time computing; Quality of service","score_opus":0.035296122757390865,"score_gpt":0.2549687856965256,"score_spread":0.21967266293913473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159475051","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10503543,0.00028668408,0.89036787,0.00014971753,0.003407703,0.00040536243,0.00003112459,0.0002985639,0.000017538365],"genre_scores_gemma":[0.99671125,0.00003437927,0.0026270887,0.00015424684,0.00024120137,0.000063742395,0.000040834337,0.000016620805,0.000110651155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981486,0.00011250685,0.00041012446,0.00062088826,0.00025884685,0.00044900517],"domain_scores_gemma":[0.9986663,0.00041898515,0.00011131692,0.0005139961,0.00015982185,0.00012961728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030614983,0.000221045,0.00026043633,0.00006157958,0.0005528133,0.0002646359,0.00037077,0.000111150905,0.000005771997],"category_scores_gemma":[0.0000095533005,0.00023099889,0.00033590186,0.00036966937,0.000035035006,0.000114141294,0.00001113474,0.00032529334,0.000014344235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005601083,0.0003403149,0.000022691169,0.000016972052,0.000057952748,0.00002080247,0.00011089065,0.7986159,0.0018593158,0.00045042278,0.000104705425,0.19834402],"study_design_scores_gemma":[0.0010596353,0.00015884792,0.000061739935,0.00010402274,0.000023413746,0.000029309336,0.00008407024,0.98925596,0.007815286,0.000015940295,0.0011329353,0.00025886306],"about_ca_topic_score_codex":0.000026243353,"about_ca_topic_score_gemma":0.000008542007,"teacher_disagreement_score":0.8916758,"about_ca_system_score_codex":0.00015141592,"about_ca_system_score_gemma":0.00009214785,"threshold_uncertainty_score":0.94198614},"labels":[],"label_agreement":null},{"id":"W3160147183","doi":"10.1109/tmc.2021.3080714","title":"Location Privacy-Preserving Task Recommendation With Geometric Range Query in Mobile Crowdsensing","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":83,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Crowdsensing; Task (project management); Mobile computing; Privacy protection; Range query (database); Information privacy; Mobile device; Range (aeronautics); Information retrieval; Web search query; World Wide Web; Computer network; Sargable; Computer security; Search engine","score_opus":0.015299288162377552,"score_gpt":0.24793596530437467,"score_spread":0.23263667714199712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160147183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30427954,0.00022507396,0.6938936,0.00015385031,0.00056834414,0.0003733878,0.0000016624577,0.00029877777,0.00020572828],"genre_scores_gemma":[0.96856505,0.000045053876,0.03085641,0.00021785121,0.00009052904,0.000060743452,0.0000079707415,0.000047138794,0.000109230714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99692017,0.00035792484,0.0006479015,0.0010113295,0.0004209078,0.00064175663],"domain_scores_gemma":[0.99751705,0.0006647137,0.00023100134,0.0010406317,0.00039836334,0.0001482533],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00079758564,0.00035312213,0.00040811088,0.0008104488,0.0005879312,0.00047829075,0.0005068048,0.00015415282,0.00003149333],"category_scores_gemma":[0.000047058533,0.0003762094,0.00011954275,0.004103699,0.000055250453,0.00072316383,0.00003222258,0.00066970877,0.00003408969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020172009,0.000310177,0.0003246777,0.000094309726,0.000030579322,0.00007061345,0.0014626244,0.6193892,0.003270329,0.000015737718,0.000052669824,0.3749589],"study_design_scores_gemma":[0.0018775534,0.00038929383,0.0014539589,0.0011194933,0.00004147838,0.0003869195,0.0011343933,0.92027444,0.07063891,0.00007417675,0.0016696206,0.00093976455],"about_ca_topic_score_codex":0.00013260453,"about_ca_topic_score_gemma":0.00013773046,"teacher_disagreement_score":0.66428554,"about_ca_system_score_codex":0.0003489637,"about_ca_system_score_gemma":0.00024063674,"threshold_uncertainty_score":0.999869},"labels":[],"label_agreement":null},{"id":"W3171631644","doi":"10.1109/tmc.2021.3086687","title":"Maximization of Value of Service for Mobile Collaborative Computing Through Situation-Aware Task Offloading","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computation offloading; Distributed computing; Mobile computing; Mobile device; Mobile edge computing; Quality of service; Mobile cloud computing; Provisioning; Partition (number theory); Computer network; Server; Cloud computing; Edge computing","score_opus":0.016706698316556964,"score_gpt":0.27598628281227816,"score_spread":0.2592795844957212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171631644","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12262123,0.0001538179,0.8721179,0.000084789666,0.0039325478,0.00076607463,0.000013845705,0.00017972715,0.00013006516],"genre_scores_gemma":[0.8574574,0.000012883351,0.14193176,0.00018839606,0.00029763975,0.000033605695,0.00001885478,0.000033863762,0.00002560289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997231,0.00021618881,0.00096544944,0.00070177135,0.0004288335,0.0004567231],"domain_scores_gemma":[0.99585354,0.0011556913,0.0006014414,0.00060179667,0.0017080817,0.0000794308],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050529133,0.00031247473,0.0005750007,0.0002063483,0.00059504295,0.0001069259,0.00058746856,0.00015257613,0.0000052702853],"category_scores_gemma":[0.000029675984,0.0003593593,0.00022810958,0.0022745798,0.000059467166,0.0004646297,0.0000328767,0.000260673,0.00000604157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020407033,0.00031752084,0.000037577585,0.00031926978,0.000104833394,0.0000032832652,0.010384973,0.92718774,0.010968541,0.00050895533,0.00011208417,0.050034825],"study_design_scores_gemma":[0.00079208426,0.0002452406,0.00004707247,0.00037562632,0.000045764507,0.000013837325,0.0008623412,0.8157066,0.18095882,0.0003660616,0.00029439482,0.00029214466],"about_ca_topic_score_codex":0.000055293876,"about_ca_topic_score_gemma":0.000008893885,"teacher_disagreement_score":0.73483616,"about_ca_system_score_codex":0.00012259345,"about_ca_system_score_gemma":0.00039723265,"threshold_uncertainty_score":0.99988586},"labels":[],"label_agreement":null},{"id":"W3176790016","doi":"10.1109/tmc.2021.3093259","title":"Acoustic Software Defined Platform: A Versatile Sensing and General Benchmarking Platform","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Benchmarking; Software; Usability; Interface (matter); User interface; Focus (optics); Ubiquitous computing; Embedded system; Graphical user interface; Human–computer interaction; Software engineering; Operating system","score_opus":0.012017022441308268,"score_gpt":0.21554543594089662,"score_spread":0.20352841349958836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176790016","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34672138,0.00012442036,0.6515821,0.0000041232415,0.0005835528,0.00009582647,0.000009385616,0.0007655171,0.000113680864],"genre_scores_gemma":[0.9765,0.000073248324,0.023211367,0.00005017329,0.000073745854,0.00000590565,0.000010599115,0.00004222277,0.00003278025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989866,0.000010143521,0.00026497585,0.0002554049,0.00014857564,0.00033432723],"domain_scores_gemma":[0.9994662,0.00017359253,0.000031576936,0.0002059378,0.000062879706,0.000059809256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000075924574,0.00020961736,0.00021334826,0.00015244189,0.0003509349,0.00008690063,0.00007174067,0.00015433726,0.000045496738],"category_scores_gemma":[0.0000120424065,0.00023495586,0.00007437591,0.00033286455,0.00004574306,0.00013039033,0.000004834937,0.00032715534,0.000010310504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003823693,0.000011085775,0.000020701804,0.000052495343,0.000033166565,0.000022511107,0.00030564718,0.75165546,0.0028473719,0.0000118504495,0.000039713075,0.24499615],"study_design_scores_gemma":[0.00041502656,0.00004728171,0.000048878268,0.0001189772,0.000038099195,0.00009894211,0.0005068707,0.9195095,0.07867331,0.00007599707,0.00018559655,0.00028152764],"about_ca_topic_score_codex":0.000014890513,"about_ca_topic_score_gemma":0.000053306794,"teacher_disagreement_score":0.62977856,"about_ca_system_score_codex":0.000112664966,"about_ca_system_score_gemma":0.00003105933,"threshold_uncertainty_score":0.9581222},"labels":[],"label_agreement":null},{"id":"W3182470338","doi":"10.1109/tmc.2021.3093316","title":"Matrix Gaussian Mechanisms for Differentially-Private Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Differential privacy; Computer science; Scalability; Novelty; Gaussian; Dimensionality reduction; Information privacy; Theoretical computer science; Artificial intelligence; Machine learning; Data mining; Computer security","score_opus":0.021123104044203554,"score_gpt":0.282879726962925,"score_spread":0.2617566229187215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182470338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012418789,0.000063941785,0.9821157,0.0015688175,0.0015946793,0.00038739608,0.000017620243,0.0017500563,0.000083026775],"genre_scores_gemma":[0.56611556,0.000022772903,0.4335507,0.00006289233,0.000034095665,0.00005724864,0.0000066070793,0.000026033038,0.00012410148],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764013,0.00013257725,0.00041193896,0.0008902631,0.000326315,0.0005987594],"domain_scores_gemma":[0.9953992,0.00048312178,0.00015417159,0.0037416818,0.000121854064,0.000099972814],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003556245,0.0002786584,0.00031155834,0.00021213724,0.0007261056,0.00034133968,0.0075765145,0.0001805159,0.000041239204],"category_scores_gemma":[0.000494551,0.0003000346,0.0002146361,0.0006628282,0.000049212435,0.00033263653,0.0010315729,0.00062743394,0.000045852314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035149416,0.00067892915,0.000023964512,0.00022464854,0.00026748507,0.00011220841,0.00033824265,0.12803565,0.091384426,0.016166499,0.002646384,0.7600864],"study_design_scores_gemma":[0.0005281732,0.00018399366,0.00001841888,0.00009773792,0.00002187548,0.000042721033,0.00006882007,0.71834576,0.2386045,0.04054737,0.0011916788,0.00034891526],"about_ca_topic_score_codex":0.000006836519,"about_ca_topic_score_gemma":0.000006666303,"teacher_disagreement_score":0.7597375,"about_ca_system_score_codex":0.00011467589,"about_ca_system_score_gemma":0.00008155755,"threshold_uncertainty_score":0.99994516},"labels":[],"label_agreement":null},{"id":"W3192883372","doi":"10.1109/tmc.2021.3076088","title":"Joint Observation and Transmission Scheduling in Agile Satellite Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Science Basic Research Program of Shaanxi Province; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Initialization; Agile software development; Scheduling (production processes); Data transmission; Integer programming; Real-time computing; Population; Transmission (telecommunications); Algorithm; Mathematical optimization; Computer network; Telecommunications","score_opus":0.02943505902220186,"score_gpt":0.24160857474381808,"score_spread":0.21217351572161622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192883372","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2903836,0.005079211,0.70352316,0.000030841067,0.00035016154,0.00018790652,0.000001236205,0.00024103106,0.00020286736],"genre_scores_gemma":[0.9876485,0.0031525686,0.009004873,0.000044005763,0.00004254668,0.000027535169,0.000007941345,0.000041441883,0.000030608375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988108,0.00011538465,0.00046533995,0.00024600248,0.00012744911,0.00023496685],"domain_scores_gemma":[0.9993011,0.00019906834,0.00003873666,0.0003345358,0.000050225823,0.000076328004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028358004,0.0001689592,0.00022551407,0.00013505826,0.00013158028,0.00006878649,0.00009358442,0.00012231486,0.000021849177],"category_scores_gemma":[0.0000027992712,0.00019914367,0.000063547115,0.00050534133,0.000020990396,0.00013367923,0.0000021277724,0.00042008318,0.000009915579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025863997,0.000026338012,0.0001353019,0.000054107477,0.000010918407,0.000004012031,0.00045964055,0.7392951,0.008338562,0.000009804124,8.1793473e-7,0.2516628],"study_design_scores_gemma":[0.0003452554,0.000016719663,0.0016149051,0.0004115684,0.00000842465,0.000021329026,0.00028587782,0.9658668,0.029381588,0.000022718028,0.001818637,0.00020619866],"about_ca_topic_score_codex":0.000011956791,"about_ca_topic_score_gemma":0.00001840943,"teacher_disagreement_score":0.69726485,"about_ca_system_score_codex":0.00010149912,"about_ca_system_score_gemma":0.00001739772,"threshold_uncertainty_score":0.8120843},"labels":[],"label_agreement":null},{"id":"W3195136400","doi":"10.1109/tmc.2021.3106256","title":"Lightweight and Secure Face-based Active Authentication for Mobile Users","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Biometrics; Authentication (law); Mobile device; Overhead (engineering); Cloud computing; Smart card; Embedded system; Computer network; Computer security; Operating system","score_opus":0.015671604667771993,"score_gpt":0.26240497800053925,"score_spread":0.24673337333276726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195136400","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15575606,0.000093983785,0.8421603,0.0003087612,0.00067798403,0.0007215178,0.000024048892,0.00022252173,0.000034826757],"genre_scores_gemma":[0.991331,0.000010431995,0.007892725,0.00021965092,0.000044170247,0.00025801285,0.0000102402055,0.000019921285,0.00021387731],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842614,0.00012301937,0.0003258667,0.0006046654,0.00023622473,0.00028411293],"domain_scores_gemma":[0.9985908,0.00038227078,0.00012228482,0.00053824,0.0002332748,0.00013307726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020574381,0.00019328631,0.00022278793,0.00015017552,0.00045310013,0.00023900895,0.00031494952,0.00010688107,0.00001770168],"category_scores_gemma":[0.000007557771,0.00020234307,0.0001410822,0.00042571707,0.00004556261,0.00025265256,0.0000058330193,0.00018664786,0.00002331837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015441731,0.00370989,0.0001571772,0.0010156353,0.00062382675,0.000033930504,0.22272491,0.08236848,0.048604522,0.009151857,0.00072430214,0.63073105],"study_design_scores_gemma":[0.00078850647,0.00016576087,0.00009377969,0.000081658305,0.00003328229,0.000015343961,0.0007070419,0.87727326,0.11577314,0.00022965265,0.004568034,0.00027053469],"about_ca_topic_score_codex":0.000005699397,"about_ca_topic_score_gemma":0.000011611312,"teacher_disagreement_score":0.8355749,"about_ca_system_score_codex":0.00007727754,"about_ca_system_score_gemma":0.0001272049,"threshold_uncertainty_score":0.8251311},"labels":[],"label_agreement":null},{"id":"W3198602495","doi":"10.1109/tmc.2021.3107458","title":"Mobility Load Management in Cellular Networks: A Deep Reinforcement Learning Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Reinforcement learning; Cellular network; Load balancing (electrical power); Robustness (evolution); Distributed computing; Throughput; Cellular traffic; Telecommunications link; Computer network; Artificial intelligence; Wireless; Telecommunications","score_opus":0.008481284533606468,"score_gpt":0.21280502348375052,"score_spread":0.20432373895014405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198602495","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008137663,0.00040231206,0.9869426,0.0000017663925,0.0005276982,0.0005870046,3.5948435e-7,0.00042039584,0.0029802215],"genre_scores_gemma":[0.98131245,0.00012090907,0.018091915,0.0000118217495,0.000045422603,0.00015226433,0.000011126157,0.000049267324,0.00020481521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850225,0.000081412545,0.00047098807,0.00037698296,0.000194047,0.00037430777],"domain_scores_gemma":[0.99943006,0.000061540646,0.00004992075,0.00032773818,0.00006511758,0.000065606626],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027172707,0.0002217978,0.00024279051,0.00012553696,0.00015093402,0.000042947395,0.00011083264,0.000094389456,0.00003373208],"category_scores_gemma":[0.0000026411824,0.0002747774,0.00009038132,0.000634225,0.00001812267,0.00012411803,0.000004426741,0.00045138295,0.000014517861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006295945,0.00009091576,0.000011051098,0.00014705764,0.000046610443,0.000018503273,0.00039096762,0.96590215,0.00029009406,0.000013251028,0.0000030644835,0.03308004],"study_design_scores_gemma":[0.0005100388,0.000026613137,0.000010489391,0.000095621705,0.000019245012,0.0000071029945,0.0006216401,0.9950348,0.0033016186,0.0000053367576,0.00013098719,0.00023650093],"about_ca_topic_score_codex":0.000008961926,"about_ca_topic_score_gemma":0.000012845869,"teacher_disagreement_score":0.9731748,"about_ca_system_score_codex":0.00054129685,"about_ca_system_score_gemma":0.000015228492,"threshold_uncertainty_score":0.99997044},"labels":[],"label_agreement":null},{"id":"W3204080079","doi":"10.1109/tmc.2021.3116157","title":"New Routing Protocol for Reliability to Intelligent Transportation Communication","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT Networks and Protocols","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":"Polytechnique Montréal","funders":"","keywords":"Computer science; Computer network; Zone Routing Protocol; Enhanced Interior Gateway Routing Protocol; Link-state routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Routing protocol; Static routing; Routing Information Protocol; Distributed computing; Network packet","score_opus":0.024520883626849517,"score_gpt":0.3108057120607756,"score_spread":0.2862848284339261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3204080079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013425354,0.0000043580876,0.86615473,0.00004096781,0.00020343681,0.1317792,0.000009100277,0.00030234587,0.0001633309],"genre_scores_gemma":[0.5090993,0.00000195933,0.0742837,0.00008684802,0.00014693021,0.4161709,0.000014084663,0.00006027026,0.00013604763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888694,0.000048915063,0.00043324285,0.0002505857,0.00012259658,0.00025772362],"domain_scores_gemma":[0.9990984,0.0002324865,0.000041567975,0.0003903811,0.00012475777,0.00011240354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026400064,0.00016767919,0.00018282297,0.00005265793,0.00023369158,0.00006523351,0.00014580971,0.00009181376,0.00008723042],"category_scores_gemma":[0.00000531744,0.00018924223,0.00012986388,0.00031660363,0.0000088057905,0.00008365714,8.995052e-7,0.00025239366,0.00001739733],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031829455,0.00004315789,0.000008939757,0.000100630336,0.000012910196,4.303483e-7,0.0005405589,0.80504495,0.00051753613,0.000028980498,0.0004259747,0.1932441],"study_design_scores_gemma":[0.0014260268,0.00030112613,0.00017099714,0.00078433886,0.000032780976,0.0000041463813,0.0002544195,0.7369637,0.20701008,0.00038420112,0.052122418,0.0005457709],"about_ca_topic_score_codex":0.000020837588,"about_ca_topic_score_gemma":0.000068185014,"teacher_disagreement_score":0.791871,"about_ca_system_score_codex":0.0001215686,"about_ca_system_score_gemma":0.000056797046,"threshold_uncertainty_score":0.7717075},"labels":[],"label_agreement":null},{"id":"W3208661763","doi":"10.1109/tmc.2020.3031319","title":"An Analysis of a Stochastic ON-OFF Queueing Mobility Model for Software-Defined Vehicle Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","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":"Carleton University","funders":"","keywords":"Queueing theory; Computer science; Layered queueing network; Node (physics); Exponential distribution; Mobility model; Poisson distribution; Queue; Distributed computing; Service (business); Computer network; Mathematical optimization; Mathematics","score_opus":0.015476768712646466,"score_gpt":0.24194751976982398,"score_spread":0.2264707510571775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208661763","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32421237,0.00006901728,0.6744792,0.000011199,0.00015420423,0.00049784535,0.000049182538,0.000522315,0.000004663578],"genre_scores_gemma":[0.99089915,0.000006214277,0.008655374,0.00012001116,0.000097958284,0.000105660976,0.000023090653,0.000089253335,0.000003278226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981048,0.00006267809,0.00057380745,0.0005194058,0.00024095486,0.00049834285],"domain_scores_gemma":[0.99854445,0.00054002274,0.00009379822,0.00049092213,0.000084571984,0.00024625435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027929887,0.0003219229,0.00061280676,0.00021954495,0.00020036119,0.00004274417,0.00028340507,0.00016667953,0.000017864219],"category_scores_gemma":[0.000013255871,0.00036816506,0.000431146,0.0009970384,0.000046432775,0.000121187484,0.0000028175496,0.00045735922,0.0000038071535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007787609,0.00015628805,0.000015752794,0.000056963538,0.00049503735,0.0000012735011,0.0005454103,0.97421026,0.0005186085,0.000011148271,0.000013492097,0.023897896],"study_design_scores_gemma":[0.0004975858,0.0002938785,0.000059366237,0.000050878272,0.00056054856,6.6675386e-7,0.00005209758,0.99761945,0.0005375383,0.000015942074,0.0000044044377,0.00030763212],"about_ca_topic_score_codex":0.000015973907,"about_ca_topic_score_gemma":0.000053039068,"teacher_disagreement_score":0.6666868,"about_ca_system_score_codex":0.00013498885,"about_ca_system_score_gemma":0.000032812397,"threshold_uncertainty_score":0.99987704},"labels":[],"label_agreement":null},{"id":"W4205093761","doi":"10.1109/tmc.2021.3136611","title":"Joint Client Selection and Bandwidth Allocation Algorithm for Federated Learning","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Research Foundation","keywords":"Computer science; Markov decision process; Curse of dimensionality; Reinforcement learning; Scheduling (production processes); Mathematical optimization; Wireless; Algorithm; Bandwidth (computing); Distributed computing; Markov process; Computer network; Artificial intelligence; Mathematics; Telecommunications","score_opus":0.02474850513147081,"score_gpt":0.27059510866971886,"score_spread":0.24584660353824805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205093761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018505368,0.00008367669,0.9785257,0.0009706429,0.000612379,0.00034130368,0.0000055177093,0.0009248426,0.000030593124],"genre_scores_gemma":[0.56546175,0.00004724685,0.43427193,0.000064322936,0.00003107815,0.000056407498,0.000007851589,0.000013977513,0.00004540543],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984237,0.000116841475,0.00030041533,0.0006520864,0.00018984098,0.0003171272],"domain_scores_gemma":[0.99840987,0.00026209455,0.0001096835,0.0009286371,0.0002289648,0.00006073208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004208471,0.00017022325,0.00018805651,0.00015409458,0.0008660652,0.0003177358,0.0012020783,0.000120391254,0.0000066085267],"category_scores_gemma":[0.00033014256,0.00019023352,0.00006721815,0.0005878191,0.000035033594,0.00031891518,0.0002778822,0.00040380086,0.0000064637034],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030109684,0.00010432042,0.000009429507,0.00002248436,0.000033307875,0.0000033021788,0.00009224477,0.039006595,0.0059541846,0.00004949621,0.00051801145,0.9542036],"study_design_scores_gemma":[0.0003590139,0.00018051612,0.000038818354,0.000053542066,0.000010621459,0.00005174318,0.00007442129,0.8727616,0.12453275,0.0011613839,0.0006024381,0.0001731559],"about_ca_topic_score_codex":0.000014843244,"about_ca_topic_score_gemma":0.000012638373,"teacher_disagreement_score":0.95403045,"about_ca_system_score_codex":0.00013081396,"about_ca_system_score_gemma":0.00008294128,"threshold_uncertainty_score":0.7757498},"labels":[],"label_agreement":null},{"id":"W4205670437","doi":"10.1109/tmc.2021.3136236","title":"Utility-Aware Legitimacy Detection of Mobile Crowdsensing Tasks via Knowledge-Based Self Organizing Feature Map","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Artificial intelligence; Task (project management); Crowdsensing; Feature (linguistics); Machine learning; Frame (networking); Data mining; Computer security","score_opus":0.010740745935985799,"score_gpt":0.24322912769872665,"score_spread":0.23248838176274084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205670437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13384502,0.00039345282,0.8622086,0.00005847073,0.0019915064,0.00045204192,0.000008121206,0.00088511023,0.00015767131],"genre_scores_gemma":[0.9722767,0.0000072465327,0.027199643,0.00011369865,0.00017092306,0.000023748553,0.0000056542426,0.00007210151,0.00013029376],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9965151,0.0004232234,0.00072461896,0.0011444138,0.00047897213,0.0007136607],"domain_scores_gemma":[0.99670833,0.0006481586,0.00031701615,0.001308486,0.0007958795,0.00022213616],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055564253,0.00049654965,0.0006211669,0.00038073148,0.001051164,0.00032962664,0.00052712887,0.0002971138,0.0000298415],"category_scores_gemma":[0.000018125453,0.0005649054,0.00039811106,0.0016941408,0.0001165614,0.00036179644,0.000027542528,0.0009403814,0.000049064845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030027028,0.0010345652,0.00004859569,0.000472361,0.00013933756,0.00010810469,0.0035023184,0.24600802,0.20916334,0.000018619652,0.000103060614,0.53937167],"study_design_scores_gemma":[0.00050608424,0.0001419681,0.000039677878,0.00028483281,0.000045596622,0.00012183167,0.00032886007,0.4924912,0.50458336,0.000017938713,0.0010850292,0.00035360598],"about_ca_topic_score_codex":0.000047538695,"about_ca_topic_score_gemma":0.000064482796,"teacher_disagreement_score":0.83843166,"about_ca_system_score_codex":0.00020680114,"about_ca_system_score_gemma":0.00042881208,"threshold_uncertainty_score":0.9996802},"labels":[],"label_agreement":null},{"id":"W4206480403","doi":"10.1109/tmc.2022.3141930","title":"On the Impact of Recharging Behavior on Mobility","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant 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; Node (physics); Probability density function; Bounded function; Distortion (music); Inversion (geology); Regular polygon; Topology (electrical circuits); Mathematical optimization; Mathematics; Computer network; Mathematical analysis; Physics; Geometry; Statistics; Acoustics; Bandwidth (computing)","score_opus":0.031142329604661827,"score_gpt":0.2882260434484933,"score_spread":0.25708371384383144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206480403","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37168047,0.000009144275,0.6266536,0.000045198714,0.0005910385,0.00038691715,0.000021747564,0.00010823627,0.00050362456],"genre_scores_gemma":[0.99890023,0.0000030950143,0.00065514125,0.00017765709,0.00003537448,0.00013381867,0.0000016383375,0.000016730308,0.000076318465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980673,0.0002958672,0.0003789811,0.0004628073,0.00045512134,0.0003398869],"domain_scores_gemma":[0.9977643,0.0010486355,0.00017619913,0.00086346397,0.000056031764,0.00009138878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008175317,0.00020821123,0.00024176548,0.00014513698,0.00091864046,0.000058385624,0.0007723715,0.000047429254,0.00025706572],"category_scores_gemma":[0.000002353991,0.0001596253,0.00030979287,0.00056402327,0.000060326314,0.00007573676,0.00001729694,0.0007633981,0.00001643271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004768926,0.00094616186,0.000032587865,0.000004326715,0.000030679406,0.000016482481,0.0005394126,0.7643908,0.00021754538,0.0007852408,0.0003054432,0.2326836],"study_design_scores_gemma":[0.00028618425,0.0014026697,0.00019641675,0.00003580531,0.000015986881,0.000027252087,0.00013023899,0.99634284,0.0009922828,0.0003342285,0.00004318453,0.00019291021],"about_ca_topic_score_codex":0.000075304386,"about_ca_topic_score_gemma":0.0000010087308,"teacher_disagreement_score":0.62721974,"about_ca_system_score_codex":0.00022122901,"about_ca_system_score_gemma":0.00011771251,"threshold_uncertainty_score":0.7065533},"labels":[],"label_agreement":null},{"id":"W4206666877","doi":"10.1109/tmc.2021.3135301","title":"Dual-Anonymous Off-Line Electronic Cash for Mobile Payment","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph; Queen's University","funders":"","keywords":"Mobile payment; Computer science; Payment; Computer security; Database transaction; Electronic cash; Electronic money; Dual (grammatical number); Payment service provider; Mobile computing; Scheme (mathematics); Internet privacy; Computer network; World Wide Web; Database","score_opus":0.011181069841244097,"score_gpt":0.26084045117917926,"score_spread":0.24965938133793517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206666877","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09659236,0.000595412,0.90053415,0.0004096228,0.0004258542,0.00078433077,0.000017022314,0.0005661127,0.00007514703],"genre_scores_gemma":[0.9753643,0.00012122548,0.023031645,0.00030532133,0.00007255019,0.0007594071,0.0000067607302,0.00002355177,0.0003152288],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980149,0.00006370881,0.00039527475,0.00073919626,0.00019431049,0.00059258495],"domain_scores_gemma":[0.9983671,0.00029738346,0.00010894774,0.0009282908,0.00020914551,0.000089185094],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033153454,0.00022702909,0.00027417316,0.00014199743,0.0006228043,0.000091157184,0.00049834774,0.00017409436,0.00003172613],"category_scores_gemma":[0.000005019205,0.0002452558,0.00020188061,0.00070028123,0.00006169481,0.00009747927,0.000015889571,0.00046056573,0.000036687823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000119705,0.0011366826,0.000005174262,0.000040409184,0.00010887273,0.000021090776,0.0005573775,0.14038646,0.0056756805,0.013311551,0.00030034737,0.8384444],"study_design_scores_gemma":[0.0010948064,0.000794997,0.000011381477,0.00003771213,0.000046641795,0.00021165056,0.00019799668,0.72179526,0.23318556,0.0039119846,0.038192768,0.0005192285],"about_ca_topic_score_codex":0.000009862401,"about_ca_topic_score_gemma":0.00004851548,"teacher_disagreement_score":0.87877196,"about_ca_system_score_codex":0.00016301649,"about_ca_system_score_gemma":0.00021376957,"threshold_uncertainty_score":0.99999994},"labels":[],"label_agreement":null},{"id":"W4214889552","doi":"10.1109/tmc.2022.3155657","title":"Optimized Controller Provisioning in Software-Defined LEO Satellite Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"St. Francis Xavier University","funders":"Science and Technology Commission of Shanghai Municipality; National Natural Science Foundation of China","keywords":"Computer science; Overhead (engineering); Network topology; Provisioning; Controller (irrigation); Rounding; Software-defined networking; Distributed computing; Computer network; Operating system","score_opus":0.012679508755944625,"score_gpt":0.22837622825145906,"score_spread":0.21569671949551444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214889552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028959729,0.0031244806,0.9641148,0.00002159653,0.0012749771,0.0009873057,0.000008703753,0.0010468242,0.00046158198],"genre_scores_gemma":[0.9911853,0.0002716695,0.0077940873,0.000070661925,0.000047795365,0.0004410125,0.000008663834,0.00008811918,0.00009268829],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797595,0.00030672387,0.000688529,0.00032207862,0.00027802133,0.000428695],"domain_scores_gemma":[0.9984763,0.00079271663,0.00009036632,0.00052590587,0.000035485762,0.00007918015],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006905556,0.00025591836,0.00040477558,0.0003428594,0.00045131388,0.000071718954,0.00041583987,0.00008224369,0.00011629961],"category_scores_gemma":[0.0000068021463,0.00030228804,0.00015135146,0.00076183036,0.00002852317,0.00010202167,0.000010181099,0.0009098809,0.00002951887],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043933695,0.00006756217,0.000063363965,0.000016954455,0.00003474155,0.0000043773266,0.00055726274,0.8786926,0.00021304358,0.000007205161,0.000012706848,0.12028624],"study_design_scores_gemma":[0.001717125,0.00007490226,0.000109163004,0.000072510586,0.0000122716165,0.000020345513,0.0003614119,0.99203515,0.0003544206,0.00001098433,0.0049137524,0.0003179377],"about_ca_topic_score_codex":0.00003271678,"about_ca_topic_score_gemma":0.00000740913,"teacher_disagreement_score":0.96222556,"about_ca_system_score_codex":0.00036145642,"about_ca_system_score_gemma":0.000025566535,"threshold_uncertainty_score":0.9999429},"labels":[],"label_agreement":null},{"id":"W4226178516","doi":"10.1109/tmc.2022.3159697","title":"A Deep Learning Framework for Beam Selection and Power Control in Massive MIMO - Millimeter-Wave Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"École de Technologie Supérieure","funders":"Mitacs","keywords":"Computer science; MIMO; Base station; Channel state information; Extremely high frequency; Transmitter power output; User equipment; Power control; Channel (broadcasting); Ray tracing (physics); Transmission (telecommunications); Real-time computing; Power (physics); Electronic engineering; Telecommunications; Wireless; Transmitter; Engineering","score_opus":0.018006066301912677,"score_gpt":0.24508580799564716,"score_spread":0.2270797416937345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226178516","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13554437,0.00033476824,0.8628249,0.000044082884,0.00031186995,0.00066443876,0.000015378004,0.0002233329,0.000036851863],"genre_scores_gemma":[0.9717551,0.00006491587,0.0276176,0.00011290939,0.000023372322,0.0003504409,0.000008881164,0.00005306314,0.000013704816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988375,0.00012760445,0.00035475008,0.00025790834,0.00013423411,0.00028801826],"domain_scores_gemma":[0.99900824,0.0005856223,0.000066111446,0.00022098928,0.000054362805,0.00006466159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032104636,0.00017888995,0.00022015013,0.00029646646,0.0006408821,0.00004824527,0.00012913764,0.00007911389,0.00006153439],"category_scores_gemma":[0.00001185627,0.00022386997,0.00009486764,0.0003273588,0.000026666095,0.00007814077,0.000006328029,0.0008494886,0.0000027319227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023212977,0.00006639155,0.000019264837,0.000023113182,0.000046916615,7.1088255e-7,0.0018069023,0.96426266,0.0065538213,0.000016828471,0.0000036518736,0.027176546],"study_design_scores_gemma":[0.0007191791,0.00025092164,0.000019324765,0.000039674946,0.00003105387,0.000014508413,0.0011403472,0.99281895,0.004150076,0.00019742757,0.00039599364,0.00022255356],"about_ca_topic_score_codex":0.000011909763,"about_ca_topic_score_gemma":0.000020142685,"teacher_disagreement_score":0.8362107,"about_ca_system_score_codex":0.00018894534,"about_ca_system_score_gemma":0.000014468498,"threshold_uncertainty_score":0.9129152},"labels":[],"label_agreement":null},{"id":"W4291653259","doi":"10.1109/tmc.2022.3199048","title":"HealthFort: A Cloud-Based eHealth System With Conditional Forward Transparency and Secure Provenance via Blockchain","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"University of Waterloo","funders":"Putian University; National Natural Science Foundation of China","keywords":"Computer science; Computer security; Cloud computing; eHealth; Encryption; Transparency (behavior); Forward secrecy; Confidentiality; Delegate; Internet privacy; Key (lock); Verifiable secret sharing; Authentication (law); Delegation; Secrecy; Smart contract; Public-key cryptography; Server; Password; World Wide Web; Blockchain; Health care","score_opus":0.006905866799278625,"score_gpt":0.2242207163075572,"score_spread":0.21731484950827856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4291653259","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06274586,0.00016639938,0.9339526,0.0010106618,0.0002560757,0.0010692939,0.000088718545,0.0006765741,0.000033780525],"genre_scores_gemma":[0.9841026,0.000003430258,0.014453052,0.00041602,0.000033590233,0.0009492196,0.000008087344,0.000021883672,0.00001209488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978765,0.00015087232,0.00041423517,0.00072889926,0.00038334524,0.0004461081],"domain_scores_gemma":[0.99881774,0.00016411912,0.00020879543,0.0005850582,0.0000786852,0.00014561099],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00047659955,0.00024173412,0.00029914133,0.0002315486,0.0018446972,0.000042212567,0.00055879913,0.00009124913,0.0000097811835],"category_scores_gemma":[7.33143e-7,0.00024316464,0.00007662185,0.00083083304,0.00012297991,0.000057220765,0.000009919969,0.00074654113,0.0000032793168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000705098,0.0007868666,0.00012219157,0.0003686485,0.00006211906,0.00003434724,0.0014968644,0.8842944,0.00013790725,0.053394318,0.000069179616,0.059162665],"study_design_scores_gemma":[0.001068715,0.001084014,0.000091140566,0.000065924585,0.000017507738,0.0002635739,0.00030700135,0.9939906,0.0009536252,0.0010342496,0.0008056619,0.0003179968],"about_ca_topic_score_codex":0.00007336296,"about_ca_topic_score_gemma":0.000042025673,"teacher_disagreement_score":0.92135674,"about_ca_system_score_codex":0.00023995606,"about_ca_system_score_gemma":0.00025001977,"threshold_uncertainty_score":0.99945474},"labels":[],"label_agreement":null},{"id":"W4292387182","doi":"10.1109/tmc.2022.3200104","title":"Electrocardiogram Based Group Device Pairing for Wearables","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"User Authentication and Security Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Fundamental Research Funds for the Central Universities; Education Department of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Group key; Wearable computer; Computer network; Pairing; Randomness; Protocol (science); Entropy (arrow of time); Computer security; Embedded system; Encryption","score_opus":0.018832111968408623,"score_gpt":0.2551343065351563,"score_spread":0.23630219456674767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292387182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023307147,0.00008453311,0.9742538,0.00015971568,0.0009436725,0.00068927393,0.000009320874,0.00049985974,0.000052728134],"genre_scores_gemma":[0.98847026,0.0000016694519,0.010474515,0.00043565987,0.00004594224,0.00049229106,0.000003763778,0.000020683094,0.000055231358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998333,0.00020097321,0.00030295708,0.0004650767,0.00033612188,0.00036191035],"domain_scores_gemma":[0.99892795,0.00035670015,0.00009544316,0.00047553578,0.000062088046,0.000082266684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006583829,0.00015321055,0.00019258936,0.00023504217,0.0011636257,0.0001603082,0.0006692203,0.000033380064,0.000019332534],"category_scores_gemma":[0.0000030067379,0.00017659957,0.00023694335,0.0006637671,0.000016813625,0.00013948529,0.000007538417,0.00026499893,0.000013282491],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006959294,0.0014312753,0.000113361675,0.0002286561,0.00021254105,0.00001058539,0.014872956,0.62299496,0.0064831297,0.0032948598,0.0006034343,0.34968466],"study_design_scores_gemma":[0.00051463715,0.00033632418,0.000024760948,0.000019485888,0.000014664937,0.000014183063,0.00020625323,0.9838856,0.0033007073,0.00013993759,0.011334603,0.0002088746],"about_ca_topic_score_codex":0.000020180869,"about_ca_topic_score_gemma":0.000007763342,"teacher_disagreement_score":0.9651631,"about_ca_system_score_codex":0.00012698832,"about_ca_system_score_gemma":0.000060311195,"threshold_uncertainty_score":0.8949786},"labels":[],"label_agreement":null},{"id":"W4293198317","doi":"10.1109/tmc.2022.3199876","title":"Multi-Objective Parallel Task Offloading and Content Caching in D2D-aided MEC Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":159,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Task (project management); Computer network; Distributed computing","score_opus":0.027613079849307456,"score_gpt":0.2406868773261701,"score_spread":0.21307379747686267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293198317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35203114,0.0002142687,0.6464669,0.00005778798,0.00074882514,0.0002877615,0.0000036732686,0.00016706048,0.000022553917],"genre_scores_gemma":[0.9952306,0.000027430267,0.00415349,0.0003346392,0.000036017373,0.000108598666,0.000001466761,0.000021121876,0.00008664921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978647,0.00034824133,0.0003986505,0.0006653922,0.00027715458,0.00044582877],"domain_scores_gemma":[0.99900156,0.00037862323,0.0001231204,0.00035660932,0.000035711844,0.00010437953],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00064745056,0.00023305602,0.00029749083,0.00031515825,0.0009819097,0.000148716,0.00046501655,0.000052968997,0.000006501209],"category_scores_gemma":[0.000003979056,0.00026136386,0.00013165668,0.00049068354,0.000037625217,0.00026714848,0.000031341715,0.0009464494,0.0000034020022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027986493,0.00018514745,0.00024727208,0.0000059392423,0.000031532552,0.000043192293,0.0020160414,0.9418213,0.0014913968,0.000064248765,0.00000841262,0.05405755],"study_design_scores_gemma":[0.0013901418,0.00019095141,0.0006213927,0.00005641648,0.000011845304,0.0000801648,0.00095967983,0.99620765,0.00014795049,0.000019336834,0.000032792712,0.00028164918],"about_ca_topic_score_codex":0.0007892254,"about_ca_topic_score_gemma":0.00012702661,"teacher_disagreement_score":0.64319944,"about_ca_system_score_codex":0.0002708922,"about_ca_system_score_gemma":0.000041440522,"threshold_uncertainty_score":0.99998385},"labels":[],"label_agreement":null},{"id":"W4296707149","doi":"10.1109/tmc.2022.3208229","title":"When Virtual Network Operator Meets E-Commerce Platform: Advertising via Data Reward","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Digital Platforms and Economics","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Stackelberg competition; Computer science; Nash equilibrium; Operator (biology); Incentive; Game theory; Best response; Mathematical optimization; Microeconomics","score_opus":0.029193414529770454,"score_gpt":0.22923629145116706,"score_spread":0.2000428769213966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296707149","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.70194,0.000059978567,0.2884853,0.00015263054,0.0035895156,0.0005456435,0.000040300307,0.00041143806,0.004775197],"genre_scores_gemma":[0.9955359,0.000003993354,0.0007822847,0.0023777676,0.00085614424,0.00003130684,0.00012132037,0.00006590781,0.00022538168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981051,0.000005343362,0.00050776626,0.0005869155,0.000258645,0.00053622347],"domain_scores_gemma":[0.998927,0.00009729588,0.00019636935,0.0007032276,0.000041262676,0.000034825876],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00057816016,0.0002723025,0.00030644893,0.00017903974,0.0015545298,0.00074775895,0.0008769789,0.00005648984,0.00062252395],"category_scores_gemma":[0.0000051897628,0.0002998605,0.00011573745,0.00037314257,0.000038575763,0.003941988,0.0001195239,0.00048622934,0.0002650536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063712745,0.00014950143,0.000060043214,0.00002342677,0.000060201066,0.000009323042,0.00008375326,0.8018807,0.000044046737,0.00046005918,0.004647771,0.19251746],"study_design_scores_gemma":[0.00089888467,0.000105379935,0.00005702106,0.000065597545,0.00007759881,0.000023295788,0.0013212711,0.8650836,0.00005105712,0.0009808925,0.13065022,0.0006851871],"about_ca_topic_score_codex":0.00026421723,"about_ca_topic_score_gemma":0.00007699079,"teacher_disagreement_score":0.29359588,"about_ca_system_score_codex":0.00012487022,"about_ca_system_score_gemma":0.000032676227,"threshold_uncertainty_score":0.99994534},"labels":[],"label_agreement":null},{"id":"W4312305523","doi":"10.1109/tmc.2022.3226448","title":"Fine-Grained Spatio-Temporal Distribution Prediction of Mobile Content Delivery in 5G Ultra-Dense Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China","keywords":"Computer science; Provisioning; Distributed computing; Dependency (UML); Feature (linguistics); Data mining; Computer network; Artificial intelligence","score_opus":0.020296553853010362,"score_gpt":0.21829247684625547,"score_spread":0.19799592299324512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312305523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46295738,0.0000948736,0.5354476,0.000026067291,0.00087939005,0.000351223,0.00008579143,0.00014315911,0.000014518295],"genre_scores_gemma":[0.999251,0.0000174707,0.00025906088,0.00005433726,0.000053909313,0.00019893041,0.00008837264,0.000016058439,0.000060839793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99772483,0.0003054937,0.0006672542,0.000515525,0.00042979987,0.00035709512],"domain_scores_gemma":[0.99884605,0.00027363686,0.00023556572,0.00045733404,0.0001056511,0.00008175215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000641036,0.00021420258,0.0003088467,0.00023519792,0.0004808415,0.000057907004,0.00046473797,0.00007014888,0.000025757154],"category_scores_gemma":[0.000005872729,0.00024490786,0.00022048465,0.0007823676,0.000049932627,0.00024159557,0.000012800311,0.00059538754,0.0000034240177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084954394,0.00044238457,0.0010106489,0.000013613751,0.000027882392,0.000016317006,0.00044866197,0.9537172,0.0014263939,0.000075004384,0.00010628329,0.04263067],"study_design_scores_gemma":[0.0011064959,0.00077870983,0.0012439453,0.000068920264,0.000019517316,0.00003924037,0.00033881387,0.9936705,0.0022509657,0.000023130007,0.00024053476,0.00021922334],"about_ca_topic_score_codex":0.00076561613,"about_ca_topic_score_gemma":0.000119634125,"teacher_disagreement_score":0.5362936,"about_ca_system_score_codex":0.00032476248,"about_ca_system_score_gemma":0.00007920473,"threshold_uncertainty_score":0.99870527},"labels":[],"label_agreement":null},{"id":"W4312354825","doi":"10.1109/tmc.2022.3220720","title":"MOTO: Mobility-Aware Online Task Offloading With Adaptive Load Balancing in Small-Cell MEC","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":94,"is_retracted":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 Calgary","funders":"Key Research and Development Program of Hunan Province of China; Higher Education Discipline Innovation Project; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Computer science; Server; Task (project management); Load balancing (electrical power); Mobile edge computing; Enhanced Data Rates for GSM Evolution; Limiting; Artificial intelligence; Computer network; Mathematics","score_opus":0.014556747067839316,"score_gpt":0.22495368271572022,"score_spread":0.2103969356478809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312354825","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37753722,0.00006623697,0.61878777,0.00004315443,0.002552334,0.0005096758,0.000004950479,0.0003244728,0.00017416333],"genre_scores_gemma":[0.9773885,0.000003776925,0.021811182,0.00024475684,0.00028215488,0.00010000097,0.0000044359836,0.000048576312,0.0001166364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99642265,0.00033681092,0.0006535223,0.0011185857,0.0005968864,0.00087152695],"domain_scores_gemma":[0.99813706,0.00053113967,0.00023628467,0.00077210896,0.00015547161,0.00016796432],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092999736,0.00042900076,0.00047711932,0.00043541662,0.0011755052,0.00015167314,0.0011361494,0.00008402446,0.000014962334],"category_scores_gemma":[0.000005127328,0.00045406364,0.00017478626,0.0017064773,0.0000585125,0.0002971098,0.00007441606,0.0013684711,0.000017590635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006404418,0.0009824954,0.0002553344,0.000048490147,0.000034653393,0.0001063887,0.0042543714,0.9157004,0.0011675389,0.000018261535,0.000062780986,0.07730524],"study_design_scores_gemma":[0.0013130595,0.00086143403,0.00023888092,0.00015603061,0.00002039172,0.00009106351,0.0011374899,0.9915008,0.0034116395,0.00006743162,0.00060485495,0.0005969236],"about_ca_topic_score_codex":0.0004330824,"about_ca_topic_score_gemma":0.000119908625,"teacher_disagreement_score":0.59985125,"about_ca_system_score_codex":0.0009599427,"about_ca_system_score_gemma":0.0004047168,"threshold_uncertainty_score":0.9997911},"labels":[],"label_agreement":null},{"id":"W4312389599","doi":"10.1109/tmc.2022.3223119","title":"QoE-Aware Decentralized Task Offloading and Resource Allocation for End-Edge-Cloud Systems: A Game-Theoretical Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":137,"is_retracted":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":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Nash equilibrium; Server; Distributed computing; Computation offloading; Quality of experience; Mobile edge computing; Potential game; Mobile device; Game theory; Task (project management); Resource allocation; Enhanced Data Rates for GSM Evolution; Edge computing; Computer network; Mathematical optimization; Quality of service; Artificial intelligence","score_opus":0.013516009334974226,"score_gpt":0.23998565083244414,"score_spread":0.2264696414974699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312389599","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036037702,0.00025950212,0.9562631,0.00014204081,0.005508957,0.0011180708,0.0000062995096,0.00048200708,0.00018226598],"genre_scores_gemma":[0.98590994,0.00000722595,0.012939132,0.00016646195,0.0005657465,0.0002864996,0.000013078118,0.000045560184,0.0000663765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99700856,0.00038348578,0.0005666564,0.0008903491,0.00045351448,0.00069743773],"domain_scores_gemma":[0.9982199,0.0007548566,0.0001922804,0.0005382693,0.000103310515,0.00019140232],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0011391026,0.0003138655,0.00038794667,0.00028879073,0.0015388209,0.00034012436,0.0007296455,0.000094914976,0.000006722754],"category_scores_gemma":[0.000014232618,0.0003470116,0.00017649625,0.0006802458,0.00012219953,0.0001787704,0.000047042155,0.0005291111,0.000004980365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013637899,0.0006359576,0.000024954132,0.00034934198,0.0001503748,0.0000128912925,0.008690648,0.78161323,0.0015022054,0.011292071,0.00209439,0.19349757],"study_design_scores_gemma":[0.0009858247,0.0002834237,0.000009480201,0.00006678738,0.000038149577,0.00013874665,0.000588179,0.98495847,0.00089367025,0.00019907665,0.011451509,0.0003866932],"about_ca_topic_score_codex":0.000019843646,"about_ca_topic_score_gemma":2.7930625e-7,"teacher_disagreement_score":0.9498722,"about_ca_system_score_codex":0.0002619228,"about_ca_system_score_gemma":0.000102850514,"threshold_uncertainty_score":0.9998982},"labels":[],"label_agreement":null},{"id":"W4312399768","doi":"10.1109/tmc.2022.3232543","title":"Edge-Based Video Stream Generation for Multi-Party Mobile Augmented Reality","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Augmented reality; Mobile edge computing; Mobile device; Rendering (computer graphics); Overlay; Distributed computing; Edge computing; Enhanced Data Rates for GSM Evolution; Quality of experience; Edge device; Mobile computing; Reinforcement learning; Computer network; Quality of service; Human–computer interaction; Cloud computing; Artificial intelligence; Operating system","score_opus":0.08053232138263793,"score_gpt":0.34977079695506996,"score_spread":0.269238475572432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312399768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026258364,0.000042083353,0.9699656,0.00019788074,0.0015246827,0.0014727347,0.00010294408,0.00040649856,0.000029229825],"genre_scores_gemma":[0.92687166,0.0000024849103,0.07059902,0.000676414,0.00011342658,0.0014740797,0.000047776473,0.000025126697,0.00019004376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973616,0.00041609906,0.00055049197,0.0007707981,0.00045195522,0.0004490584],"domain_scores_gemma":[0.9984403,0.0003122807,0.00020274772,0.00077227404,0.00015591226,0.00011644123],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009867218,0.00025084635,0.00027138603,0.00019416034,0.001613105,0.00019801028,0.00061884185,0.00005771429,0.000077032164],"category_scores_gemma":[0.0000064581877,0.0002804089,0.00025279453,0.0005136603,0.0000392374,0.0002986394,0.000017949678,0.00036210334,0.0000114308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025980713,0.0011448533,0.000006888916,0.000035944468,0.000036477446,0.0000040664027,0.0005543912,0.8478269,0.0068320213,0.00012470556,0.0009474039,0.14246038],"study_design_scores_gemma":[0.0013576716,0.0007019261,0.000022281805,0.000013942277,0.000023308736,0.0000053578156,0.00020854577,0.9338395,0.059620358,0.000025817399,0.0038946946,0.000286574],"about_ca_topic_score_codex":0.00011550652,"about_ca_topic_score_gemma":0.000038943224,"teacher_disagreement_score":0.90061325,"about_ca_system_score_codex":0.00039611568,"about_ca_system_score_gemma":0.00022827378,"threshold_uncertainty_score":0.99996483},"labels":[],"label_agreement":null},{"id":"W4312689295","doi":"10.1109/tmc.2022.3230758","title":"BlockSense: Towards Trustworthy Mobile Crowdsensing via Proof-of-Data Blockchain","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Crowdsensing; Trustworthiness; Computer security; Mobile computing; Proof of concept; Computer network; Operating system","score_opus":0.020791260614942606,"score_gpt":0.26973512234979136,"score_spread":0.24894386173484875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312689295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21086316,0.00013066057,0.7866402,0.00018856248,0.0007141719,0.0007885671,0.000053175027,0.00052017905,0.00010128211],"genre_scores_gemma":[0.95614177,0.0000038388794,0.04335522,0.00011878945,0.000055649012,0.00022808502,0.000007652718,0.00003112331,0.00005785982],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971176,0.00019108962,0.00064273085,0.0010386219,0.00050646067,0.0005034884],"domain_scores_gemma":[0.99669456,0.00025422717,0.00028744983,0.0025210823,0.00013454727,0.00010814126],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010334313,0.0002918571,0.00039453222,0.0004134645,0.0012649386,0.000057519956,0.0023718923,0.00012599831,0.00006836852],"category_scores_gemma":[0.000005955699,0.00033397635,0.00015791065,0.001612241,0.00017825411,0.00012122502,0.00016433213,0.0010610424,0.000006898365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001018408,0.00060943246,0.000007301151,0.000020410736,0.00005234995,0.000015456115,0.0006228343,0.2901179,0.0019804786,0.0005247336,0.00011453804,0.7059244],"study_design_scores_gemma":[0.00039608695,0.00035943236,0.000009252585,0.0000149590505,0.000028410457,0.00022175905,0.00020769998,0.9547092,0.039008573,0.0007065482,0.003983963,0.00035413262],"about_ca_topic_score_codex":0.00008609592,"about_ca_topic_score_gemma":0.000023238192,"teacher_disagreement_score":0.7452786,"about_ca_system_score_codex":0.00009290666,"about_ca_system_score_gemma":0.00017025536,"threshold_uncertainty_score":0.99991125},"labels":[],"label_agreement":null},{"id":"W4312735650","doi":"10.1109/tmc.2022.3230370","title":"CROMOSim: A Deep Learning-Based Cross-Modality Inertial Measurement Simulator","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Human Pose and Action Recognition","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":"Western University; McMaster University","funders":"","keywords":"Computer science; Inertial measurement unit; Artificial intelligence; Wearable computer; Deep learning; Motion capture; Computer vision; Activity recognition; Modality (human–computer interaction); Pose; Simulation; Motion (physics); Embedded system","score_opus":0.024614681269913185,"score_gpt":0.27271634740766876,"score_spread":0.24810166613775558,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312735650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20547974,0.000022033852,0.7924378,0.00008015133,0.0010530034,0.00030408672,0.000005383931,0.000502503,0.00011529824],"genre_scores_gemma":[0.99805444,9.741826e-7,0.0011772006,0.00043826067,0.000090235444,0.00013524624,0.0000041902135,0.000023278408,0.000076153636],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973743,0.00036747428,0.0004224247,0.00059838744,0.0008501594,0.00038724276],"domain_scores_gemma":[0.9989264,0.00015519821,0.00016690836,0.00041209487,0.0002106145,0.00012875801],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00082545547,0.00022059485,0.0002079533,0.00022879324,0.0020556855,0.0002662985,0.0005175244,0.00005569928,0.0003406332],"category_scores_gemma":[0.000010372518,0.00025259578,0.00021524265,0.00056160096,0.000047311,0.000257029,0.000014543955,0.00075300026,0.00007162264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027790524,0.00040907174,0.000042867145,0.000013757009,0.000023974419,0.000009441042,0.00026698323,0.9288214,0.0013725028,0.000016176034,0.000017508955,0.06897855],"study_design_scores_gemma":[0.0009850855,0.0004803265,0.0002853679,0.000017911896,0.00001565857,0.000012964112,0.000050396222,0.9774531,0.01792615,0.000067805886,0.0023975912,0.00030764687],"about_ca_topic_score_codex":0.00003956862,"about_ca_topic_score_gemma":0.000009623266,"teacher_disagreement_score":0.7925747,"about_ca_system_score_codex":0.00039309033,"about_ca_system_score_gemma":0.00015539775,"threshold_uncertainty_score":0.9999926},"labels":[],"label_agreement":null},{"id":"W4312997030","doi":"10.1109/tmc.2022.3228870","title":"Joint Optimization of Mobility and Reliability-Guaranteed Air-to-Ground Communication for UAVs","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Postdoctoral Program for Innovative Talents; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Probabilistic logic; Reliability (semiconductor); Fading; Transmission (telecommunications); Energy consumption; Optimization problem; Scheduling (production processes); Channel (broadcasting); Mathematical optimization; Real-time computing; Computer network; Power (physics); Algorithm; Telecommunications","score_opus":0.010687536946377588,"score_gpt":0.22738759703343686,"score_spread":0.21670006008705928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312997030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2086927,0.000055592456,0.7897516,0.000038927683,0.00012552955,0.0010398846,0.00006575639,0.00016590086,0.000064141386],"genre_scores_gemma":[0.92931277,0.000034473356,0.06991983,0.000039588387,0.000010587276,0.0006142272,0.000023532712,0.000031147967,0.000013832721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990206,0.00006233488,0.0004053603,0.000233335,0.00013033419,0.00014806422],"domain_scores_gemma":[0.99917185,0.00018953621,0.000069448084,0.00041925214,0.00010173941,0.00004818262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034093924,0.00012722466,0.00018940684,0.00015126921,0.0004675236,0.000017595758,0.00013549582,0.00004369941,0.000035529793],"category_scores_gemma":[0.000005836718,0.0001554374,0.00006898657,0.00039661347,0.000039610117,0.00007412269,0.0000064891597,0.00018032543,9.669752e-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.000022250624,0.00014574874,0.000010105837,0.00007031693,0.000012914784,2.6593021e-8,0.0006712325,0.98997736,0.0008050788,0.000044619417,0.000023463566,0.008216901],"study_design_scores_gemma":[0.00037228022,0.0001673898,0.00014681401,0.000018798844,0.000025432588,0.0000029461023,0.00043804126,0.99553895,0.002688343,0.00006381231,0.00039495184,0.00014221562],"about_ca_topic_score_codex":0.000034300214,"about_ca_topic_score_gemma":0.000005915612,"teacher_disagreement_score":0.7206201,"about_ca_system_score_codex":0.00015009772,"about_ca_system_score_gemma":0.000016156253,"threshold_uncertainty_score":0.63385534},"labels":[],"label_agreement":null},{"id":"W4321483959","doi":"10.1109/tmc.2023.3246994","title":"Stochastic Resource Optimization for Wireless Powered Hybrid Coded Edge Computing Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Server; Mobile edge computing; Computation; Distributed computing; Computation offloading; Wireless network; Edge computing; Enhanced Data Rates for GSM Evolution; Wireless; Optimization problem; Quality of service; Edge device; Minification; Computer network; Cloud computing; Algorithm; Artificial intelligence","score_opus":0.010181551506705553,"score_gpt":0.2274304397939131,"score_spread":0.21724888828720754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321483959","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025875876,0.00004156994,0.97041243,0.000021878735,0.00070811727,0.0010067752,0.00003874817,0.0017975956,0.000096996155],"genre_scores_gemma":[0.9859277,0.00002456366,0.01335249,0.000035724646,0.00019031897,0.00015251857,0.00014729486,0.000112960624,0.000056416997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985837,0.00003230326,0.0004305845,0.0003582434,0.00014972794,0.0004454633],"domain_scores_gemma":[0.99903643,0.00040051504,0.00007906141,0.0003023058,0.00008501497,0.00009668812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024710954,0.00024752272,0.0002485953,0.00025489336,0.0005553916,0.000093914336,0.00018639634,0.000106313055,0.000020762644],"category_scores_gemma":[0.000004103843,0.00029789069,0.00012158095,0.0008006507,0.000034453475,0.00008881988,0.0000034631892,0.0002518265,0.000023462791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012961054,0.00003609612,8.6757206e-7,0.000038141126,0.00003448558,6.6583095e-7,0.00015930104,0.9532996,0.00011174925,0.000023174825,0.00038638245,0.045896586],"study_design_scores_gemma":[0.0005646439,0.000056982757,0.0000073878455,0.00008319069,0.000036501355,0.000005913607,0.00011007344,0.99778897,0.00082978467,0.000010932302,0.00021566673,0.000289937],"about_ca_topic_score_codex":0.000003959482,"about_ca_topic_score_gemma":0.0000023802272,"teacher_disagreement_score":0.96005183,"about_ca_system_score_codex":0.000116575364,"about_ca_system_score_gemma":0.00001677189,"threshold_uncertainty_score":0.9999473},"labels":[],"label_agreement":null},{"id":"W4321608109","doi":"10.1109/tmc.2023.3248376","title":"Time-Varying Resource Graph Based Processing on the Way for Space-Terrestrial Integrated Vehicle Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","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":"St. Francis Xavier University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Network topology; Resource (disambiguation); Graph; Theoretical computer science; Distributed computing; Computer network","score_opus":0.029763882311624495,"score_gpt":0.253296682379178,"score_spread":0.22353280006755352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321608109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10608952,0.00019001847,0.8889485,0.00018795814,0.00081964,0.0012237641,0.000015835629,0.0020656222,0.00045917102],"genre_scores_gemma":[0.99876297,0.000017424347,0.00051877846,0.00007433202,0.00017641293,0.00024534628,0.000023650227,0.00009551641,0.00008559547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855596,0.00017405768,0.0004018196,0.00027126365,0.00019992076,0.00039697601],"domain_scores_gemma":[0.997516,0.0017346641,0.000079732854,0.0005570682,0.000044309418,0.000068239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006650953,0.00024201165,0.00023046439,0.00025039946,0.00062426145,0.00014063212,0.00039237045,0.0001279294,0.000019071116],"category_scores_gemma":[0.000014956205,0.00020694347,0.00016629384,0.0011480224,0.00005811479,0.00006867661,0.0000029426935,0.00050905097,0.00007639308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004161306,0.000025075893,0.0000026676794,0.000030741066,0.000028712633,8.584857e-7,0.00029600662,0.93196434,0.0017325169,0.0000032660062,0.0003731906,0.06550101],"study_design_scores_gemma":[0.0005267265,0.000066425346,0.000009740792,0.00035713403,0.000017558681,0.0000014896261,0.00024836912,0.9840385,0.00803553,0.000007690955,0.0064832494,0.00020760225],"about_ca_topic_score_codex":0.000008429287,"about_ca_topic_score_gemma":0.0000030055992,"teacher_disagreement_score":0.89267343,"about_ca_system_score_codex":0.00010864825,"about_ca_system_score_gemma":0.000024628507,"threshold_uncertainty_score":0.84389096},"labels":[],"label_agreement":null},{"id":"W4327523253","doi":"10.1109/tmc.2023.3256404","title":"Decoupled Association With Rate Splitting Multiple Access in UAV-Assisted Cellular Networks Using Multi-Agent Deep Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Computer science; Telecommunications link; Reinforcement learning; Beamforming; Backhaul (telecommunications); Multicast; Markov decision process; Precoding; Transmitter power output; Computer network; Partially observable Markov decision process; Base station; Spectral efficiency; Power control; Transmitter; Cellular network; Markov process; Markov chain; Telecommunications; Artificial intelligence; Power (physics); MIMO; Markov model; Machine learning","score_opus":0.019811890814123476,"score_gpt":0.2500340366751445,"score_spread":0.23022214586102102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327523253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43067613,0.000013902751,0.5683299,0.000003054257,0.0001774278,0.000382121,6.496681e-7,0.00040360185,0.00001324516],"genre_scores_gemma":[0.99268323,0.00006175204,0.006888768,0.00001314392,0.000056352106,0.00013113195,0.00003725635,0.00007224493,0.00005613498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984675,0.000077916186,0.00049269147,0.00031029957,0.00019429518,0.00045729146],"domain_scores_gemma":[0.99920815,0.0002961726,0.00015244182,0.0001951759,0.00008860231,0.000059450034],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000569648,0.00022778587,0.0002295237,0.00031870598,0.00041665463,0.00015021817,0.0001453002,0.00013501938,0.000020056892],"category_scores_gemma":[0.000011356552,0.00025215585,0.00006930792,0.0013627203,0.000011679628,0.00021506814,0.0000054564875,0.00045039368,0.000017132148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013081438,0.00004162027,0.0029064221,0.000039182985,0.000047562447,0.0000042208235,0.00032732316,0.98518205,0.0024346907,6.7015213e-7,0.0000021515093,0.009001044],"study_design_scores_gemma":[0.00095196045,0.00002938271,0.0033238125,0.00012738282,0.000034109897,0.0000014001037,0.00021831493,0.9911412,0.0038707086,5.519694e-7,0.000029119014,0.00027208574],"about_ca_topic_score_codex":0.00008357709,"about_ca_topic_score_gemma":0.0001565302,"teacher_disagreement_score":0.56200707,"about_ca_system_score_codex":0.0006074976,"about_ca_system_score_gemma":0.000019845706,"threshold_uncertainty_score":0.9999931},"labels":[],"label_agreement":null},{"id":"W4327808488","doi":"10.1109/tmc.2023.3258750","title":"Optimal Random Access Strategies for Trigger-Based Multiple-Packet Reception Channels","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","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":"Notation; Network packet; Channel (broadcasting); Computer science; Algorithm; Discrete mathematics; Mathematics; Arithmetic; Computer network","score_opus":0.04334691770578537,"score_gpt":0.31602089040250614,"score_spread":0.2726739726967208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4327808488","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21049735,0.00003137568,0.7843393,0.000068332454,0.0005860895,0.00096974545,0.00004783229,0.0033918505,0.00006811235],"genre_scores_gemma":[0.99161524,0.00009014407,0.0071764677,0.000034256613,0.00007816301,0.00084827805,0.000052004918,0.000081612845,0.00002385702],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987056,0.000079080884,0.00040460387,0.00026950147,0.00017923868,0.0003619361],"domain_scores_gemma":[0.99834836,0.00095024775,0.00006637335,0.00045684332,0.00010807013,0.000070080714],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041251746,0.00024325325,0.00029078432,0.00041508948,0.0003313097,0.00023296835,0.00045046303,0.00015260853,0.00003003944],"category_scores_gemma":[0.000009927544,0.0002783534,0.00019437366,0.00064397196,0.000050123977,0.00034368128,0.000003945635,0.00033293467,0.00003256736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006296533,0.0000560035,0.0000024755138,0.000095890464,0.00003097951,6.641806e-7,0.00040727452,0.96464735,0.0038053046,0.000014088669,0.00068118144,0.030195802],"study_design_scores_gemma":[0.0014391753,0.00009110101,0.000011013683,0.00011197415,0.000016666125,0.0000013219958,0.0002891747,0.91016895,0.0857812,0.000077964134,0.0017477748,0.0002636755],"about_ca_topic_score_codex":0.000014483187,"about_ca_topic_score_gemma":0.000015243752,"teacher_disagreement_score":0.78111786,"about_ca_system_score_codex":0.00010399466,"about_ca_system_score_gemma":0.000041367537,"threshold_uncertainty_score":0.99996686},"labels":[],"label_agreement":null},{"id":"W4328007429","doi":"10.1109/tmc.2023.3259007","title":"Tree Learning: Towards Promoting Coordination in Scalable Multi-Client Training Acceleration","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","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":"Science, Technology and Innovation Commission of Shenzhen Municipality","keywords":"Computer science; Scalability; Synchronization (alternating current); Distributed computing; Convergence (economics); Edge device; Speedup; Data synchronization; Enhanced Data Rates for GSM Evolution; Process (computing); Partition (number theory); Tree (set theory); Artificial intelligence; Machine learning; Parallel computing; Computer network; Cloud computing","score_opus":0.06824652339246039,"score_gpt":0.31188069329587326,"score_spread":0.24363416990341286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328007429","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20669748,0.000012288481,0.7879826,0.0017583974,0.00062083045,0.00045471737,0.0000027447359,0.00232594,0.00014502258],"genre_scores_gemma":[0.9121565,0.000012340413,0.08750276,0.000032394768,0.00003089591,0.00011135695,0.000009660549,0.00002753649,0.00011652062],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974301,0.00019324748,0.0005296912,0.00080219615,0.00041337704,0.00063143135],"domain_scores_gemma":[0.9976269,0.00032585108,0.00017331519,0.0017063047,0.00009555079,0.00007207702],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013297776,0.00024514765,0.00026778431,0.000787372,0.0005350791,0.00029134212,0.0047792094,0.00017166139,0.000011610479],"category_scores_gemma":[0.0010275146,0.00027407665,0.00008786336,0.0025366412,0.000055657325,0.00079541677,0.00059035065,0.0008056025,0.00008392181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040846835,0.00016035556,0.00014265966,0.00002970339,0.000013295476,0.000017081698,0.001963588,0.19416165,0.0042172894,0.000031689895,0.00045230455,0.7988063],"study_design_scores_gemma":[0.0006267651,0.00015211679,0.0008420219,0.0001456407,0.000004289445,0.000009468933,0.000544861,0.9760544,0.020559343,0.00064702233,0.0001556967,0.0002584186],"about_ca_topic_score_codex":0.00005405378,"about_ca_topic_score_gemma":0.000048640424,"teacher_disagreement_score":0.79854786,"about_ca_system_score_codex":0.00023205625,"about_ca_system_score_gemma":0.00009777632,"threshold_uncertainty_score":0.99997115},"labels":[],"label_agreement":null},{"id":"W4361856134","doi":"10.1109/tmc.2023.3263229","title":"Pa-Count: Passenger Counting in Vehicles Using Wi-Fi Signals","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Algorithm; Artificial intelligence","score_opus":0.01924642407147712,"score_gpt":0.251195030620437,"score_spread":0.2319486065489599,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361856134","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.5981759,0.000059842594,0.399318,0.000012432081,0.00051838794,0.00017935349,0.000008872244,0.0016153647,0.000111859656],"genre_scores_gemma":[0.9990621,0.00006105555,0.0006693446,0.000032440093,0.000060146533,0.000025650212,0.0000035737821,0.000060021743,0.000025663687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986807,0.000031906882,0.00038188498,0.00025037123,0.00020726306,0.00044788848],"domain_scores_gemma":[0.9994523,0.00021257998,0.00004104313,0.00021069199,0.00004719741,0.00003620031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029281946,0.00020795279,0.00023275755,0.000511654,0.00022880439,0.00006867164,0.00016860453,0.00016475539,0.000032426386],"category_scores_gemma":[0.000007921817,0.00023309629,0.000083203646,0.0012268852,0.000043994198,0.00014833889,0.0000031177199,0.00038362353,0.00008969711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025471436,0.00001975666,0.00017813168,0.00005440974,0.000017654247,0.000014279405,0.00035853268,0.96004164,0.01259056,0.000013502621,0.00006178595,0.026647188],"study_design_scores_gemma":[0.00025602157,0.000020977168,0.00018106173,0.00014837705,0.000011248998,0.0000057726224,0.0007907472,0.9223479,0.07555877,0.000061686944,0.00036637989,0.0002510836],"about_ca_topic_score_codex":0.000034703782,"about_ca_topic_score_gemma":0.000024699473,"teacher_disagreement_score":0.4008862,"about_ca_system_score_codex":0.00015642076,"about_ca_system_score_gemma":0.000019676152,"threshold_uncertainty_score":0.9505391},"labels":[],"label_agreement":null},{"id":"W4378965902","doi":"10.1109/tmc.2023.3268323","title":"Energy Efficient and Differentially Private Federated Learning via a Piggyback Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China; National Science Foundation","keywords":"Computer science; Additive white Gaussian noise; Wireless; Efficient energy use; Mobile device; Artificial noise; Leverage (statistics); Differential privacy; Algorithm; Telecommunications; Channel (broadcasting); Artificial intelligence; Electrical engineering","score_opus":0.019575428839413548,"score_gpt":0.24560936744401513,"score_spread":0.22603393860460158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378965902","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16844386,0.000032061627,0.82758886,0.00033650864,0.00044842504,0.0001991173,0.0000033625402,0.002844003,0.00010378664],"genre_scores_gemma":[0.9459284,0.000046143505,0.0537988,0.000044015127,0.000026712414,0.00005152056,0.000008741169,0.0000312125,0.000064468055],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976333,0.00017742792,0.0003573092,0.00088717445,0.00035960606,0.0005852216],"domain_scores_gemma":[0.9973931,0.00032187082,0.0001272623,0.001993475,0.000060352544,0.00010396772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039657345,0.00028535983,0.0002795581,0.0004284406,0.0008613781,0.00037563412,0.0045733894,0.0001552691,0.0000057525385],"category_scores_gemma":[0.00013825845,0.00028619543,0.00008412436,0.0014977596,0.00010758707,0.00017822237,0.0013157586,0.00057775446,0.000037430476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011298703,0.00020407845,0.000033031884,0.000046648252,0.00006638575,0.00001983013,0.0002023994,0.46015054,0.0065348535,0.00019343224,0.0005262424,0.5320113],"study_design_scores_gemma":[0.00035526836,0.00013134863,0.00014299378,0.000049987662,0.000009407911,0.000028021142,0.000037247195,0.9857006,0.012069838,0.0009436879,0.00024214627,0.000289421],"about_ca_topic_score_codex":0.0000349041,"about_ca_topic_score_gemma":0.000003398429,"teacher_disagreement_score":0.77748454,"about_ca_system_score_codex":0.00007765942,"about_ca_system_score_gemma":0.000032266435,"threshold_uncertainty_score":0.999959},"labels":[],"label_agreement":null},{"id":"W4379116721","doi":"10.1109/tmc.2023.3282243","title":"Joint In-Orbit Computation and Communication for Minimizing Download Time From LEO Satellites","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","field":"Engineering","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":"Toronto Metropolitan University; Carleton University","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Mathematical optimization; Computation; Convex optimization; Scheduling (production processes); Optimization problem; Online algorithm; Regular polygon; Algorithm; Mathematics","score_opus":0.029022304052284675,"score_gpt":0.25798230192456784,"score_spread":0.22895999787228316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379116721","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.64867836,0.0018015676,0.34666353,0.0000680144,0.0003622769,0.00096986216,0.00008077797,0.0011022905,0.00027330013],"genre_scores_gemma":[0.9882838,0.00075571664,0.010573934,0.000022789425,0.000028422286,0.00014745597,0.00012238999,0.00004169,0.000023801247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987094,0.00012268021,0.00053782517,0.00024984046,0.0001285503,0.00025170628],"domain_scores_gemma":[0.9980479,0.0013284998,0.00007553359,0.00042856584,0.000061175364,0.0000583661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043777126,0.00019114108,0.0002796488,0.00034619033,0.00021950122,0.000089622175,0.00019374317,0.0001090244,0.000012339497],"category_scores_gemma":[0.000008450635,0.00022878632,0.00007427077,0.00050337735,0.00004245359,0.00014077775,0.000005937768,0.0002522695,0.00017149397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000110699975,0.00003400504,0.00007709167,0.00008260285,0.0000429783,7.279281e-7,0.0026749887,0.8139487,0.019311402,0.000005462065,0.000079369296,0.16373159],"study_design_scores_gemma":[0.0006422273,0.000037493643,0.0009896865,0.0002853018,0.000016402462,0.0000033688132,0.00063277147,0.9830241,0.012993813,0.00014969466,0.0009584998,0.000266635],"about_ca_topic_score_codex":0.000052870375,"about_ca_topic_score_gemma":0.000026053343,"teacher_disagreement_score":0.33960542,"about_ca_system_score_codex":0.00011061305,"about_ca_system_score_gemma":0.000011436593,"threshold_uncertainty_score":0.93296355},"labels":[],"label_agreement":null},{"id":"W4381785874","doi":"10.1109/tmc.2023.3288392","title":"Federated Learning With Dynamic Epoch Adjustment and Collaborative Training in Mobile Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Server; Edge computing; Mobile edge computing; Reliability (semiconductor); Convergence (economics); Enhanced Data Rates for GSM Evolution; Distributed computing; Edge device; Wireless; Computer network; Artificial intelligence; Cloud computing; Operating system","score_opus":0.020398010748838936,"score_gpt":0.2812393761255259,"score_spread":0.26084136537668695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381785874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3896109,0.00014740817,0.60745424,0.00025444938,0.00034082434,0.0005869786,0.0000075660946,0.0015154846,0.00008214687],"genre_scores_gemma":[0.94500065,0.00010268021,0.054634556,0.000045811725,0.000020363768,0.00011549764,0.000009771157,0.000040163683,0.000030525905],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99711037,0.00025162322,0.0004929362,0.0010186495,0.000372028,0.0007543812],"domain_scores_gemma":[0.9974984,0.00081828475,0.00019436525,0.0012596548,0.00012476426,0.00010454456],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073822506,0.0003632803,0.0004314882,0.00066033786,0.00079018605,0.00030749667,0.0027567325,0.00016037555,0.0000048647476],"category_scores_gemma":[0.00020830358,0.00036333554,0.000047369314,0.003337456,0.00015581789,0.00044835507,0.000709713,0.0009820666,0.000025134468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002072248,0.00009116037,0.00010352223,0.000046049805,0.00005420203,0.00010369035,0.0033617741,0.45475438,0.0010444974,0.000032369408,0.00014380869,0.5402438],"study_design_scores_gemma":[0.0008436539,0.0005432679,0.00048495014,0.00033124178,0.000009903367,0.00006010654,0.004297608,0.9902022,0.0022196316,0.00049738155,0.0001062526,0.00040379583],"about_ca_topic_score_codex":0.000029357248,"about_ca_topic_score_gemma":0.000091014765,"teacher_disagreement_score":0.55538976,"about_ca_system_score_codex":0.00025381424,"about_ca_system_score_gemma":0.00018840325,"threshold_uncertainty_score":0.99988186},"labels":[],"label_agreement":null},{"id":"W4385287558","doi":"10.1109/tmc.2023.3298641","title":"UAV-Assisted Wireless Cooperative Communication and Coded Caching: A Multiagent Two-Timescale DRL Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"National Science Foundation of Sri Lanka; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Aggregate (composite); Wireless; Computer network; Wireless network; Base station; Cluster analysis; Cache; Transmission (telecommunications); Scalability; Distributed computing; Artificial intelligence; Telecommunications; Database","score_opus":0.027949167263826815,"score_gpt":0.2689508654677831,"score_spread":0.24100169820395625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385287558","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3002931,0.00007509958,0.698127,0.00012337006,0.00024007409,0.00033593984,0.000006976435,0.00060327933,0.00019516792],"genre_scores_gemma":[0.9939092,0.000045473324,0.005346215,0.00013604749,0.000025827274,0.00008171014,0.000012232575,0.000022539298,0.00042079488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981337,0.00035738188,0.00033822315,0.00056244916,0.00026953686,0.00033869938],"domain_scores_gemma":[0.99852306,0.00043364885,0.00010534371,0.00069478014,0.00011624357,0.00012694934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005328715,0.00023350355,0.00027247946,0.0002501248,0.0010167074,0.00027417587,0.00057568203,0.000075870776,0.0000034941427],"category_scores_gemma":[0.0000055114688,0.00023481224,0.00011020321,0.0007872474,0.00009125733,0.0002739,0.000030069476,0.00048061466,0.00004081261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021616102,0.00042073123,0.00004839758,0.000035686862,0.00009701261,0.000011598793,0.0054468615,0.6898714,0.010340279,0.0003541023,0.00017997992,0.29317236],"study_design_scores_gemma":[0.0008792747,0.00009387624,0.0003286812,0.000082391954,0.000019675435,0.00003361904,0.00058991247,0.99513584,0.0024941755,0.0000126058185,0.00006922328,0.00026070018],"about_ca_topic_score_codex":0.00025275123,"about_ca_topic_score_gemma":0.000035054916,"teacher_disagreement_score":0.6936161,"about_ca_system_score_codex":0.00008675402,"about_ca_system_score_gemma":0.0000490574,"threshold_uncertainty_score":0.9575365},"labels":[],"label_agreement":null},{"id":"W4385444829","doi":"10.1109/tmc.2023.3300311","title":"Joint Energy-Efficiency Communication Optimization and Perimeter Traffic Flow Control for Multi-Region LTE-V2V Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Vehicular Ad Hoc Networks (VANETs)","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":"University of British Columbia","funders":"","keywords":"Computer science; Cell Transmission Model; Controller (irrigation); Efficient energy use; Traffic flow (computer networking); Optimization problem; Power control; Real-time computing; Computer network; Power (physics); Traffic congestion; Engineering; Algorithm","score_opus":0.018963120222466007,"score_gpt":0.22983600134549964,"score_spread":0.21087288112303362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385444829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027191276,0.00048470357,0.96995854,0.00003090857,0.0005924183,0.0006755222,0.000009926867,0.0010434387,0.000013245238],"genre_scores_gemma":[0.9800683,0.00034358996,0.019074282,0.000048265974,0.00009420221,0.00020920829,0.000041308347,0.00008856729,0.000032252105],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998642,0.00009786883,0.00038367053,0.00031266114,0.00012732095,0.0004364502],"domain_scores_gemma":[0.9991491,0.00027289733,0.000062736384,0.00035023663,0.000062626335,0.000102437676],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030212756,0.00025440287,0.0002779718,0.00021291878,0.0004879107,0.00009236185,0.00015132745,0.00016836062,0.00000708624],"category_scores_gemma":[0.0000042724478,0.00028329447,0.00014253188,0.00044110182,0.00005582853,0.00012831221,0.0000030887238,0.00028377312,0.000005026898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011868291,0.00005430675,0.0000011356628,0.000027390626,0.000047724207,0.0000015640197,0.00022642358,0.9373961,0.00011869596,0.000007362954,0.000099249795,0.062008187],"study_design_scores_gemma":[0.0012208974,0.00009763233,0.000017236345,0.00009551998,0.000054428478,0.000014339335,0.00006489161,0.9976713,0.00034111587,0.0000024481249,0.00014879147,0.00027138655],"about_ca_topic_score_codex":0.0000062023905,"about_ca_topic_score_gemma":0.000018553246,"teacher_disagreement_score":0.95287704,"about_ca_system_score_codex":0.00010016792,"about_ca_system_score_gemma":0.000012660755,"threshold_uncertainty_score":0.9999619},"labels":[],"label_agreement":null},{"id":"W4385627407","doi":"10.1109/tmc.2023.3303017","title":"DetFed: Dynamic Resource Scheduling for Deterministic Federated Learning Over Time-Sensitive Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":140,"is_retracted":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","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Jitter; Reinforcement learning; Scheduling (production processes); Network packet; Distributed computing; Markov decision process; Queueing theory; Transmission delay; Packet loss; Server; Computer network; Real-time computing; Markov process; Artificial intelligence; Mathematical optimization","score_opus":0.011562342655380685,"score_gpt":0.2615333743360205,"score_spread":0.24997103168063978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385627407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13674328,0.000020983742,0.85745794,0.00005540661,0.0036372049,0.0004989825,9.914123e-7,0.0014633788,0.00012185812],"genre_scores_gemma":[0.98452497,0.000004321582,0.013933358,0.0001651664,0.0005961833,0.00004074203,0.000013937078,0.000070173075,0.0006511743],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972393,0.00021025898,0.0005146299,0.000841121,0.00028716616,0.00090752513],"domain_scores_gemma":[0.9973773,0.001775399,0.00019627348,0.00036574772,0.00012475635,0.00016053492],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00081854075,0.0003588816,0.00038517188,0.00037698512,0.0020010108,0.00045925914,0.0004746933,0.00018178864,0.0000030927445],"category_scores_gemma":[0.00003454018,0.0003986437,0.00024805244,0.0012270807,0.000058477468,0.000209264,0.000028271423,0.00069972884,0.0001533501],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020899692,0.000036713474,0.000006601584,0.000020399617,0.000036864192,0.000023911538,0.0006297493,0.8150173,0.00081615016,0.000006352389,0.00011262139,0.18327245],"study_design_scores_gemma":[0.00057127076,0.000261998,0.00009011202,0.00019497509,0.000024995483,0.00003114389,0.000069999085,0.99615735,0.0012873091,0.000039228576,0.00084064924,0.00043096035],"about_ca_topic_score_codex":0.000008410825,"about_ca_topic_score_gemma":0.0000021684427,"teacher_disagreement_score":0.84778166,"about_ca_system_score_codex":0.0001948323,"about_ca_system_score_gemma":0.00011225022,"threshold_uncertainty_score":0.9998465},"labels":[],"label_agreement":null},{"id":"W4385901200","doi":"10.1109/tmc.2023.3301577","title":"Wireless and Service Allocation for Mobile Computation Offloading With Task Deadlines","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":12,"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; Mobile edge computing; Wireless; Computation offloading; Distributed computing; Task (project management); Quality of service; Mobile device; Mobile computing; Computation; Server; Computer network; Enhanced Data Rates for GSM Evolution; Edge computing; Algorithm; Telecommunications; Operating system","score_opus":0.019401823504249644,"score_gpt":0.2692003969797334,"score_spread":0.24979857347548376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385901200","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35836455,0.000019901261,0.6384642,0.00015044573,0.0017806863,0.00058272877,0.0000012994014,0.0006172938,0.00001884404],"genre_scores_gemma":[0.9730838,0.000010822448,0.025974432,0.00024500515,0.0004233627,0.00016521357,0.00001319018,0.000039387523,0.00004478086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816895,0.000066482986,0.00037134727,0.00065219286,0.00026191105,0.00047912807],"domain_scores_gemma":[0.99850535,0.0006470622,0.0001530122,0.00029320802,0.00028769567,0.00011364747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004491076,0.00026578325,0.0002670176,0.00033666426,0.0008506444,0.00026238555,0.0003495812,0.00009318841,5.186688e-7],"category_scores_gemma":[0.000003517794,0.0002612106,0.00006939588,0.0013440555,0.00003965731,0.00038524682,0.000014055768,0.0002093156,0.000029878964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024497218,0.000078574674,0.00004299747,0.00015556917,0.000043067866,0.0000043149043,0.0025035958,0.5760046,0.0028303638,0.00006258624,0.00021685218,0.41803294],"study_design_scores_gemma":[0.000700694,0.00032132526,0.0001753107,0.00016826089,0.000023250423,0.000029885075,0.00020107941,0.99162924,0.005688218,0.00013894642,0.0006012024,0.00032258627],"about_ca_topic_score_codex":0.00004002407,"about_ca_topic_score_gemma":0.000013443118,"teacher_disagreement_score":0.6147192,"about_ca_system_score_codex":0.000068609115,"about_ca_system_score_gemma":0.00007435105,"threshold_uncertainty_score":0.999984},"labels":[],"label_agreement":null},{"id":"W4386081024","doi":"10.1109/tmc.2023.3327097","title":"ILCAS: Imitation Learning-Based Configuration- Adaptive Streaming for Live Video Analytics With Cross-Camera Collaboration","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Analytics; Imitation; Multimedia; Real-time computing; Computer vision; Human–computer interaction; Artificial intelligence; Data science","score_opus":0.03273965689453764,"score_gpt":0.3320054092933656,"score_spread":0.29926575239882797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386081024","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041624803,0.000008897308,0.9563347,0.0002599017,0.00034463417,0.0008370099,0.000019977866,0.0005062221,0.000063827865],"genre_scores_gemma":[0.9718349,0.0000044185144,0.027423564,0.0002094738,0.00006502651,0.00019749894,0.00003639069,0.000025229303,0.0002035047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812984,0.00016787807,0.00041940337,0.0005425692,0.00038735574,0.00035292318],"domain_scores_gemma":[0.9972995,0.0012878361,0.00025941987,0.0003152274,0.00074049743,0.000097512355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052230415,0.00022367838,0.00023162128,0.00030633973,0.00089925434,0.0005602472,0.0002592001,0.00008315463,0.000011239811],"category_scores_gemma":[0.000037174526,0.00022518434,0.00010360515,0.0012417727,0.00006881414,0.0006768163,0.0000032577007,0.00025783203,0.000050424587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055025666,0.00009465956,0.000033773435,0.00003388415,0.000049446728,0.000005416699,0.0022325167,0.96119624,0.00053119194,0.00028627447,0.00005767299,0.03542389],"study_design_scores_gemma":[0.00092685496,0.001105967,0.00026873214,0.00009608844,0.00003395021,0.000002089413,0.0023680367,0.97665596,0.017993089,0.000079321384,0.00020041001,0.00026947143],"about_ca_topic_score_codex":0.000038739418,"about_ca_topic_score_gemma":0.000060549235,"teacher_disagreement_score":0.9302101,"about_ca_system_score_codex":0.00017767315,"about_ca_system_score_gemma":0.0003856746,"threshold_uncertainty_score":0.91827506},"labels":[],"label_agreement":null},{"id":"W4386280917","doi":"10.1109/tmc.2023.3309633","title":"RingSFL: An Adaptive Split Federated Learning Towards Taming Client Heterogeneity","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":89,"is_retracted":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":"Computer science; Convergence (economics); Scheme (mathematics); Distributed computing; Data modeling; Raw data; Information privacy; Benchmark (surveying); Computer network; Computer security; Database","score_opus":0.048144002707414105,"score_gpt":0.3056492883687118,"score_spread":0.2575052856612977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386280917","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38510603,0.000014966006,0.60983604,0.00024434156,0.00065475295,0.0002459028,0.00000819476,0.0037977756,0.00009199554],"genre_scores_gemma":[0.90966886,0.00002577828,0.090041876,0.000070517555,0.00004917989,0.000058214195,0.0000087433655,0.000039966846,0.000036889218],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968519,0.00025649235,0.00046992145,0.001127407,0.0005043721,0.00078991224],"domain_scores_gemma":[0.9961677,0.000291137,0.00017673272,0.0030698008,0.00013463036,0.00015999595],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008964448,0.00034229536,0.00032270188,0.0004651558,0.0012244254,0.0004375859,0.0075881723,0.00019264634,0.000011387467],"category_scores_gemma":[0.00034688937,0.00037298846,0.000143275,0.0017405829,0.000103484155,0.0007448007,0.0013218478,0.0009742656,0.00017780538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018611245,0.00017023984,0.00008629198,0.000023295232,0.00006456451,0.00005925226,0.00037387357,0.34304067,0.0025793172,0.000079046156,0.0004421478,0.6530627],"study_design_scores_gemma":[0.00028734424,0.00047344578,0.00047135184,0.000087109,0.000009928302,0.000025030771,0.0002610948,0.9545748,0.042396735,0.00071331154,0.00032000546,0.00037982836],"about_ca_topic_score_codex":0.00010418931,"about_ca_topic_score_gemma":0.000029712151,"teacher_disagreement_score":0.65268284,"about_ca_system_score_codex":0.00023825902,"about_ca_system_score_gemma":0.00008407328,"threshold_uncertainty_score":0.9998722},"labels":[],"label_agreement":null},{"id":"W4386766554","doi":"10.1109/tmc.2023.3315961","title":"Multi-Agent Deep Reinforcement Learning to Enable Dynamic TDD in a Multi-Cell Environment","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières","funders":"","keywords":"Reinforcement learning; Computer science; Distributed computing; Human–computer interaction; Artificial intelligence","score_opus":0.019648982804701794,"score_gpt":0.2545781797765407,"score_spread":0.2349291969718389,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386766554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03962503,0.00006139501,0.95705247,0.000083977764,0.0009690681,0.0014692046,0.0000045589677,0.0006836396,0.000050652798],"genre_scores_gemma":[0.97841686,0.00003231073,0.019483684,0.000105863866,0.000020929912,0.00040495608,0.000010908893,0.000045374883,0.0014791305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964287,0.0002423743,0.00079695997,0.0009928624,0.00055717985,0.0009818797],"domain_scores_gemma":[0.99846476,0.00023290483,0.00018504294,0.0007911131,0.000045895325,0.000280275],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079403503,0.00039924233,0.00041013624,0.0006556116,0.00044897213,0.00020117583,0.00091400935,0.00012512933,0.000030171059],"category_scores_gemma":[0.000012321125,0.0004450388,0.00019688619,0.0011615804,0.000027768952,0.00025568876,0.000044638684,0.0005526485,0.0017838051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009372938,0.0003529598,0.000050528866,0.000035341367,0.000025770505,0.000047660844,0.0021896767,0.95577055,0.00995981,0.0000034205787,0.000015124733,0.031539813],"study_design_scores_gemma":[0.002167555,0.00022807854,0.0003493422,0.00010470909,0.000011436686,0.000005773795,0.00062193035,0.9912024,0.003744815,0.0000014585089,0.0011338581,0.00042862314],"about_ca_topic_score_codex":0.00016388677,"about_ca_topic_score_gemma":0.00006983252,"teacher_disagreement_score":0.9387918,"about_ca_system_score_codex":0.000769208,"about_ca_system_score_gemma":0.0000545633,"threshold_uncertainty_score":0.99980015},"labels":[],"label_agreement":null},{"id":"W4387068050","doi":"10.1109/tmc.2023.3319544","title":"A Blockchain-Based Distributed and Intelligent Clustering-Enabled Authentication Protocol for UAV Swarms","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Innovation for Defence Excellence and Security","keywords":"Computer science; Authentication (law); Cluster analysis; Single point of failure; Authentication protocol; Computer network; Wireless; Protocol (science); Distributed computing; Computer security; Artificial intelligence","score_opus":0.019198814239219996,"score_gpt":0.27694972150468833,"score_spread":0.25775090726546834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387068050","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015105976,0.0000018165538,0.9488415,0.000036498015,0.00011032497,0.03501816,0.000041949916,0.00082794315,0.000015846195],"genre_scores_gemma":[0.86723834,0.0000013612782,0.005525667,0.000014894116,0.000037190035,0.12707259,0.000030563388,0.000042679032,0.000036698726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917,0.000014719984,0.00027239046,0.00022425929,0.000091219816,0.00022739],"domain_scores_gemma":[0.99948627,0.00014641027,0.00004070851,0.00019459738,0.000067490364,0.00006453743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015504795,0.00014872057,0.00012691582,0.00016562137,0.00025152785,0.000055679906,0.000081747705,0.000071405426,0.000016086964],"category_scores_gemma":[0.00000347094,0.00015726077,0.000057770285,0.00047505624,0.000023227629,0.000020075593,0.0000015635842,0.000107265805,0.000017331931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016816333,0.00005088987,0.0000044256367,0.0001564551,0.000016343989,2.100645e-7,0.0001685851,0.97415775,0.0011347374,0.000010190521,0.000068774,0.024214832],"study_design_scores_gemma":[0.0006100825,0.00007501718,0.000041986677,0.00006411652,0.000017132716,0.0000011692073,0.00006599023,0.98300445,0.014517306,0.000032280816,0.0014140228,0.00015646886],"about_ca_topic_score_codex":0.000004630054,"about_ca_topic_score_gemma":0.000006757254,"teacher_disagreement_score":0.9433158,"about_ca_system_score_codex":0.00007758603,"about_ca_system_score_gemma":0.000015672558,"threshold_uncertainty_score":0.6412908},"labels":[],"label_agreement":null},{"id":"W4387068346","doi":"10.1109/tmc.2023.3319545","title":"DQ-Based Random Access NOMA for Massive Critical IoT Scenarios in 5G Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","field":"Engineering","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":"Ericsson (Canada); Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Computer network; Noma; Aloha; Base station; Low latency (capital markets); Benchmark (surveying); Distributed computing; Node (physics); Key (lock); Transmission (telecommunications); Throughput; Wireless; Telecommunications link; Telecommunications; Computer security","score_opus":0.02614667819666722,"score_gpt":0.3121826186513627,"score_spread":0.2860359404546955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387068346","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052847385,0.00010414887,0.9433571,0.00020735481,0.0005746438,0.0006704278,0.000012758467,0.0021881438,0.000038003694],"genre_scores_gemma":[0.9926283,0.000058722988,0.0065757735,0.00004356505,0.000035124933,0.0005803088,0.000007752886,0.00006178353,0.000008677246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987908,0.000042388998,0.00036734957,0.0002585122,0.00011026844,0.00043066734],"domain_scores_gemma":[0.9973998,0.0020035547,0.000035088808,0.00046015624,0.00005191339,0.00004948409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018432864,0.00019952623,0.00027476755,0.00038534845,0.00023304184,0.00006219753,0.00048398308,0.00016781513,0.000013279523],"category_scores_gemma":[0.000040424216,0.00022827926,0.00011317847,0.00084523694,0.00009087369,0.00010769733,0.0000054370603,0.0005199302,0.000015626078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003203982,0.000042208787,0.000019299507,0.00005060368,0.00001265002,0.000003811282,0.00005272649,0.91955924,0.00033449568,0.000042860825,0.000050511964,0.07979958],"study_design_scores_gemma":[0.0012901356,0.00004850296,0.00008434849,0.00014867779,0.000008114183,0.000001081973,0.00015427198,0.98351634,0.0142106945,0.00015053876,0.00016330401,0.0002239971],"about_ca_topic_score_codex":0.000007085109,"about_ca_topic_score_gemma":0.000033808472,"teacher_disagreement_score":0.9397809,"about_ca_system_score_codex":0.00014226092,"about_ca_system_score_gemma":0.000020602143,"threshold_uncertainty_score":0.9308958},"labels":[],"label_agreement":null},{"id":"W4387303184","doi":"10.1109/tmc.2023.3321701","title":"Online Incentive Mechanisms for Socially-Aware and Socially-Unaware Mobile Crowdsensing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Innovation for Defence Excellence and Security","keywords":"Computer science; Incentive; Incentive compatibility; Reverse auction; Rationality; Mobile device; Exploit; Computer security; Selection (genetic algorithm); Bidding; Artificial intelligence; World Wide Web; Microeconomics","score_opus":0.019873434698961558,"score_gpt":0.2798639538124632,"score_spread":0.25999051911350163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387303184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114219494,0.00004748768,0.8813142,0.00025776846,0.0017776148,0.0009889129,0.000053088243,0.0013042885,0.000037137757],"genre_scores_gemma":[0.95533246,0.000039594546,0.043616574,0.00029310037,0.00022998027,0.00010423797,0.000019524667,0.00007488763,0.00028964315],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997029,0.00015603218,0.0005477801,0.0010033507,0.00041613405,0.00084769714],"domain_scores_gemma":[0.9979396,0.0008189591,0.00021827174,0.0005325515,0.00028881006,0.00020181885],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006490397,0.00041847225,0.0004939304,0.00037275345,0.0018461782,0.0004113949,0.0004762635,0.00023600004,0.000006873505],"category_scores_gemma":[0.000018169601,0.00046436206,0.00029037966,0.0009936747,0.00013131012,0.0003137509,0.000034435212,0.00046405435,0.000029172275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038825212,0.0004480018,0.000012724835,0.00020691146,0.00017736858,0.000054753706,0.0071841623,0.21882741,0.010889681,0.0029016957,0.00054387574,0.75871456],"study_design_scores_gemma":[0.0013559439,0.0005507844,0.00011388896,0.00034348734,0.00007153812,0.000040415383,0.0035285351,0.964575,0.022092165,0.005672513,0.0007755407,0.0008801908],"about_ca_topic_score_codex":0.000043242566,"about_ca_topic_score_gemma":0.00008563365,"teacher_disagreement_score":0.841113,"about_ca_system_score_codex":0.00017435254,"about_ca_system_score_gemma":0.00032481257,"threshold_uncertainty_score":0.99978083},"labels":[],"label_agreement":null},{"id":"W4387441444","doi":"10.1109/tmc.2023.3298935","title":"A Novel Federated Learning-Based Smart Power and 3D Trajectory Control for Fairness Optimization in Secure UAV-Assisted MEC Services","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","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":"École de Technologie Supérieure; Université du Québec à Montréal","funders":"Ministère de la Défense Nationale; Innovation for Defence Excellence and Security","keywords":"Computer science; Reinforcement learning; Artificial intelligence; Machine learning","score_opus":0.007048894619185787,"score_gpt":0.21621561681018997,"score_spread":0.20916672219100418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387441444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07912827,0.00002767585,0.9190504,0.00002296589,0.000192348,0.000799764,0.000034301174,0.0006915419,0.000052734085],"genre_scores_gemma":[0.99045235,0.000012251378,0.008976727,0.000038138427,0.000018500043,0.00035336823,0.00006930444,0.000058869653,0.000020494715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905014,0.00003205573,0.0002946147,0.00027380433,0.000102523125,0.000246872],"domain_scores_gemma":[0.9994726,0.00021956993,0.000051972584,0.00010972872,0.00009232163,0.000053792246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017988401,0.00018732525,0.00020370487,0.00028847216,0.0002950834,0.00009020805,0.00006818367,0.00013265744,0.000015657557],"category_scores_gemma":[0.0000026499915,0.00021383254,0.000054535518,0.0006906032,0.00001876646,0.000099122095,8.626958e-7,0.00020732185,0.0000043814443],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029235229,0.00007275293,0.000042314477,0.0001079671,0.000027308968,5.317433e-7,0.0003230711,0.9922138,0.0021492585,0.000004011723,0.000004371591,0.0050253994],"study_design_scores_gemma":[0.0017718305,0.000076862205,0.0005105898,0.00007995026,0.000026353491,0.0000021934702,0.0003302848,0.9961175,0.00077552197,0.0000017447112,0.00009740044,0.00020976906],"about_ca_topic_score_codex":0.000027242255,"about_ca_topic_score_gemma":0.0001219656,"teacher_disagreement_score":0.9113241,"about_ca_system_score_codex":0.0000782134,"about_ca_system_score_gemma":0.000024342655,"threshold_uncertainty_score":0.87198377},"labels":[],"label_agreement":null},{"id":"W4387490197","doi":"10.1109/tmc.2023.3323280","title":"Real-Time Contactless Eye Blink Detection Using UWB Radar","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":44,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Radar; Computer vision; Artificial intelligence; Real-time computing; Telecommunications","score_opus":0.01640704340066011,"score_gpt":0.2541898789256774,"score_spread":0.2377828355250173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387490197","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.5861381,0.000013797197,0.41005847,0.0000023271439,0.001743766,0.00024989055,0.000009955809,0.0015556514,0.00022800638],"genre_scores_gemma":[0.9973534,0.000046795587,0.0019817422,0.0000050121457,0.00037539622,0.000030950516,0.000003498149,0.00012415076,0.000079076206],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998431,0.000058320347,0.00037337388,0.00034799043,0.000265415,0.0005238788],"domain_scores_gemma":[0.99918604,0.00026001054,0.000054279022,0.00030773293,0.00006288794,0.0001290221],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023766168,0.00029200214,0.00028696004,0.0004230365,0.00040647667,0.000085518855,0.00017261284,0.00015236576,0.000036823065],"category_scores_gemma":[0.0000046450505,0.00035121813,0.00015969257,0.0009986077,0.00003413893,0.00020887177,0.0000036894044,0.00041975218,0.00039559804],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005800559,0.0000142028175,0.00002238321,0.000034961467,0.00003603166,0.000017256121,0.00012479763,0.45932752,0.519998,5.030453e-7,0.0000062732443,0.02041228],"study_design_scores_gemma":[0.00039947766,0.00007878946,0.00012153136,0.00015050052,0.000038884984,0.000017811268,0.00016659388,0.38445655,0.61408293,0.000017106613,0.000094690964,0.0003751348],"about_ca_topic_score_codex":0.00009085949,"about_ca_topic_score_gemma":0.00000958978,"teacher_disagreement_score":0.41121522,"about_ca_system_score_codex":0.00035920858,"about_ca_system_score_gemma":0.000024049368,"threshold_uncertainty_score":0.99989396},"labels":[],"label_agreement":null},{"id":"W4387717444","doi":"10.1109/tmc.2023.3325301","title":"Bayesian Meta-Learning for Adaptive Traffic Prediction in Wireless Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Traffic Prediction and Management Techniques","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":"University of British Columbia","funders":"","keywords":"Computer science; Probabilistic logic; Mean squared error; Data mining; Inference; Machine learning; Artificial intelligence; Wireless; Wireless network; Baseline (sea); Statistics","score_opus":0.019122635876919786,"score_gpt":0.23543061419045966,"score_spread":0.21630797831353987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387717444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02377497,0.000036968006,0.96384954,0.000014946037,0.00085309363,0.00078481704,0.000011820574,0.010444028,0.00022982477],"genre_scores_gemma":[0.9981751,0.00010321793,0.00086374325,0.00001773348,0.00008179866,0.000587823,0.000015855303,0.00006098938,0.00009372849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.00005009382,0.00032940556,0.00027897698,0.0001296136,0.00035582142],"domain_scores_gemma":[0.99956185,0.00018311244,0.000034765275,0.00014027656,0.000020620428,0.000059355905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003385831,0.00020456217,0.000264451,0.00044577863,0.00018867136,0.00003636029,0.000114324976,0.000120791155,0.0000147246565],"category_scores_gemma":[0.0000016060084,0.00022555355,0.00019092053,0.0006953775,0.000021770877,0.000120593686,0.0000016495793,0.00041548212,0.000010275652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000122814345,0.000029902158,0.0000027906908,0.000028102502,0.00016474255,0.0000022627398,0.00016775088,0.835086,0.000044073942,0.000023345892,0.000863807,0.16357498],"study_design_scores_gemma":[0.00037221762,0.00014971882,0.00006586913,0.000048768354,0.00013530861,0.0000018550278,0.00022344184,0.99762315,0.00048360092,0.0000066019275,0.00071942806,0.00017002372],"about_ca_topic_score_codex":0.0000042279044,"about_ca_topic_score_gemma":0.000025476753,"teacher_disagreement_score":0.97440016,"about_ca_system_score_codex":0.00010384812,"about_ca_system_score_gemma":0.000007134078,"threshold_uncertainty_score":0.9197807},"labels":[],"label_agreement":null},{"id":"W4387789555","doi":"10.1109/tmc.2023.3325826","title":"Combining IMU With Acoustics for Head Motion Tracking Leveraging Wireless Earphone","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Inertial measurement unit; Wireless; Tracking (education); Head (geology); Match moving; Motion (physics); Acoustics; Computer vision; Telecommunications","score_opus":0.021588765239083436,"score_gpt":0.24942493380143993,"score_spread":0.2278361685623565,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387789555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34107244,0.00001254489,0.65568054,0.000013261208,0.00057462667,0.0002889006,0.000014000005,0.0023018846,0.000041831765],"genre_scores_gemma":[0.99741155,0.000025441006,0.0022598463,0.00002223995,0.000060115664,0.000081141836,0.000013809048,0.00008428352,0.000041566564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887335,0.00001565682,0.00027454173,0.00025079632,0.00017236774,0.0004132961],"domain_scores_gemma":[0.99939686,0.00022730143,0.000041829062,0.00020138506,0.0000879628,0.000044632252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017709221,0.00021108986,0.00022177928,0.00030695458,0.00043316654,0.00007600637,0.00014001295,0.00012097063,0.0000072269777],"category_scores_gemma":[0.000004885983,0.0002195701,0.000078292236,0.0007101752,0.000043874883,0.00012036894,0.0000018893563,0.00030166694,0.00001742356],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010161502,0.000020851456,0.000026976975,0.00009643427,0.00003218391,0.000003973853,0.00056091766,0.83243227,0.0064400714,0.00001777572,0.000043527023,0.16031486],"study_design_scores_gemma":[0.000649442,0.00010821393,0.00013350698,0.00016647406,0.000027677275,0.000009728798,0.0010633098,0.90089464,0.09658205,0.000040573614,0.000074365176,0.00025000505],"about_ca_topic_score_codex":0.000008324444,"about_ca_topic_score_gemma":0.000006924794,"teacher_disagreement_score":0.6563391,"about_ca_system_score_codex":0.0001096806,"about_ca_system_score_gemma":0.0000149735715,"threshold_uncertainty_score":0.89538085},"labels":[],"label_agreement":null},{"id":"W4387790169","doi":"10.1109/tmc.2023.3325334","title":"Accelerating and Securing Blockchain-Enabled Distributed Machine Learning","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Science, Technology and Innovation Commission of Shenzhen Municipality; Public Safety Canada; Western Canada Research Grid; Compute Canada","keywords":"Computer science; Blockchain; Latency (audio); Server; Proof-of-work system; Distributed computing; Artificial intelligence; Theoretical computer science; Computer network; Computer security","score_opus":0.014232909913778208,"score_gpt":0.24125340069763987,"score_spread":0.22702049078386166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387790169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36365435,0.000055591445,0.63411194,0.00023108968,0.00013756106,0.0002208234,0.0000065598892,0.0015338722,0.000048189246],"genre_scores_gemma":[0.99280536,0.00003973371,0.006884529,0.000059868256,0.00003363496,0.00008629532,0.0000056955473,0.000020280651,0.00006459367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998349,0.0000861337,0.00032465838,0.00059592084,0.00018407263,0.0004602284],"domain_scores_gemma":[0.99894196,0.00034155292,0.00010781308,0.0004413043,0.00006680428,0.00010055243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048692795,0.00021554828,0.00022817326,0.000313586,0.0012985277,0.00016051417,0.0004848427,0.00014081356,0.000009050827],"category_scores_gemma":[0.000012847676,0.00022880067,0.00007232906,0.0014195585,0.00006896531,0.000092403774,0.000033520246,0.0007355029,0.000037346414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007344043,0.00016705478,0.000337979,0.00005993733,0.000070295726,0.000032927554,0.0018897319,0.66455406,0.003934091,0.0046921824,0.000051918276,0.3242025],"study_design_scores_gemma":[0.00034360454,0.00008991798,0.00013836338,0.00003586194,0.000008350236,0.000033761306,0.00016067078,0.98853636,0.009204281,0.00061749533,0.00059941446,0.00023194792],"about_ca_topic_score_codex":0.000033162945,"about_ca_topic_score_gemma":0.000012990218,"teacher_disagreement_score":0.629151,"about_ca_system_score_codex":0.000047631456,"about_ca_system_score_gemma":0.000025174671,"threshold_uncertainty_score":0.99873567},"labels":[],"label_agreement":null},{"id":"W4389317812","doi":"10.1109/tmc.2023.3338602","title":"A Repeated Auction Model for Load-Aware Dynamic Resource Allocation in Multi-Access Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","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 Manitoba","funders":"","keywords":"Computer science; Bidding; Server; Resource allocation; Computation offloading; Distributed computing; Resource management (computing); Edge computing; Mobile edge computing; Computer network; Nash equilibrium; Service provider; Service (business); Cloud computing; Mathematical optimization; Operating system; Microeconomics","score_opus":0.05189364837230872,"score_gpt":0.32698734434799676,"score_spread":0.27509369597568806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389317812","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11180088,0.000023749979,0.8813966,0.00016810346,0.0041598957,0.0009894966,0.0000026076855,0.0014282744,0.000030396257],"genre_scores_gemma":[0.9774293,0.00000803765,0.021704694,0.00013787141,0.00026494864,0.00008907441,0.000021540167,0.00006254549,0.00028199935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966415,0.00015559603,0.00082328083,0.001097596,0.00041686013,0.00086516753],"domain_scores_gemma":[0.99813104,0.0005013065,0.0002671661,0.00069439237,0.0002721268,0.00013399],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012510134,0.00038207616,0.0004005742,0.0007528802,0.000903212,0.00036363653,0.00104259,0.00020179668,8.5920186e-7],"category_scores_gemma":[0.000027947108,0.000443391,0.00022029839,0.002277551,0.000051939245,0.0005643236,0.000047977224,0.00053599564,0.000037812395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020000738,0.00014166557,0.000025876705,0.00007343235,0.000018077397,0.00000617584,0.0024330877,0.8739854,0.0007232454,0.000008776089,0.00024283034,0.12232142],"study_design_scores_gemma":[0.0011661878,0.000095239615,0.00029862626,0.00026614955,0.000013569876,0.000015589794,0.00012487192,0.9957275,0.0015399561,0.00009034856,0.00021399824,0.00044795542],"about_ca_topic_score_codex":0.00008051704,"about_ca_topic_score_gemma":0.00004950801,"teacher_disagreement_score":0.8656284,"about_ca_system_score_codex":0.0005946806,"about_ca_system_score_gemma":0.00021527815,"threshold_uncertainty_score":0.9998018},"labels":[],"label_agreement":null},{"id":"W4389543055","doi":"10.1109/tmc.2023.3341082","title":"Age of Processing-Aware Offloading Decision for Autonomous Vehicles in 5G Open RAN Environment","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Computer science; Cloud computing; Computation offloading; Edge computing; Distributed computing; Computation; Latency (audio); Embedded system; Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Operating system","score_opus":0.024624974739677556,"score_gpt":0.28214784803396364,"score_spread":0.2575228732942861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389543055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044843968,0.000009317365,0.953737,0.0000461339,0.00020831986,0.000874332,0.000006228708,0.00016938329,0.00010531755],"genre_scores_gemma":[0.90689325,0.000012148607,0.09284742,0.00004252125,0.000012048112,0.00010660618,0.000007968281,0.000014867299,0.000063144354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.000036593367,0.0005388897,0.00030853113,0.0002269062,0.000246438],"domain_scores_gemma":[0.9990767,0.00032288337,0.00019132259,0.0003077202,0.000050668288,0.000050699273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726855,0.00013751048,0.00021372506,0.00037522314,0.00026774406,0.00017571893,0.00076365675,0.00006945536,0.000008689608],"category_scores_gemma":[0.000009604613,0.0001460182,0.00006973294,0.00063796306,0.000030464882,0.00075583684,0.000019768182,0.00012361638,0.00002699508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010412231,0.000046689962,0.0000061767605,0.000025955955,0.0000033452443,0.0000017242479,0.0013535538,0.65391463,0.00028118378,0.00003193364,0.000017310367,0.34430707],"study_design_scores_gemma":[0.00076764886,0.00012092194,0.00022463698,0.00017987886,0.0000039675765,0.0000027718972,0.0002671722,0.9894393,0.008493411,0.00014980196,0.00020318705,0.00014730194],"about_ca_topic_score_codex":0.000015269568,"about_ca_topic_score_gemma":0.0000061301193,"teacher_disagreement_score":0.8620493,"about_ca_system_score_codex":0.00013684526,"about_ca_system_score_gemma":0.00006904569,"threshold_uncertainty_score":0.5954449},"labels":[],"label_agreement":null},{"id":"W4389610117","doi":"10.1109/tmc.2023.3341810","title":"End-to-End Resource Slicing for Coexistence of eMBB and URLLC Services in 5G-Advanced/6G Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Business Finland; Oulun Yliopisto; Academy of Finland","keywords":"Computer science; C-RAN; Resource allocation; Latency (audio); Radio access network; Optimization problem; Computer network; Distributed computing; Mathematical optimization; Algorithm; Base station; Telecommunications; Mathematics","score_opus":0.015328514790672139,"score_gpt":0.2619358727123419,"score_spread":0.2466073579216698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389610117","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20744176,0.000137852,0.79108703,0.00011022512,0.0004272741,0.0004643664,0.0000067278675,0.00026989513,0.000054848082],"genre_scores_gemma":[0.9816439,0.000045536715,0.017805155,0.000275,0.000070115915,0.000080623635,0.000002715023,0.000024687957,0.00005224722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982074,0.00005871682,0.00043746835,0.0005839077,0.0002124302,0.000500092],"domain_scores_gemma":[0.9981308,0.0011388048,0.00012677655,0.00042889823,0.000058696718,0.00011604891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207405,0.00020538522,0.00032280353,0.00031835775,0.0002928794,0.00008742204,0.0005087093,0.000094155635,0.0000031355883],"category_scores_gemma":[0.0000059884865,0.00021733863,0.00008962317,0.0014655648,0.000043575386,0.00019264864,0.000019384908,0.00025330452,0.0000040730556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001923225,0.000031823707,0.00011432149,0.00005484198,0.000009343382,0.000003519945,0.0011417301,0.76191145,0.00015201412,0.00008857491,0.000026890431,0.23644626],"study_design_scores_gemma":[0.00056772464,0.00027430867,0.0011397579,0.00037934628,0.00001014689,0.000009181198,0.00033837123,0.9950786,0.00097159535,0.0001351273,0.0008590261,0.0002368004],"about_ca_topic_score_codex":0.000086761946,"about_ca_topic_score_gemma":0.00012366903,"teacher_disagreement_score":0.77420217,"about_ca_system_score_codex":0.00004140425,"about_ca_system_score_gemma":0.000023343227,"threshold_uncertainty_score":0.8862812},"labels":[],"label_agreement":null},{"id":"W4389610120","doi":"10.1109/tmc.2023.3341809","title":"Deployment Cost-Aware UAV and BS Collaboration in Cell-Free Integrated Aerial-Terrestrial Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":9,"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; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Computer science; MIMO; Software deployment; Base station; Cluster analysis; Real-time computing; Computer network; Distributed computing; Non-line-of-sight propagation; Telecommunications link; Wireless; Telecommunications; Channel (broadcasting); Artificial intelligence","score_opus":0.009129844519161774,"score_gpt":0.2350227940320617,"score_spread":0.22589294951289993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389610120","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25814947,0.00003197582,0.7398223,0.000030779345,0.00072344154,0.00065964775,0.000019992485,0.0005036442,0.00005870685],"genre_scores_gemma":[0.9981465,0.00022221573,0.0011675686,0.000013949036,0.00009302311,0.00023983567,0.000049451835,0.000040129526,0.000027367207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911654,0.000039395276,0.00030014216,0.00021999287,0.000098573226,0.00022533843],"domain_scores_gemma":[0.99955845,0.00010471556,0.000035683785,0.00021459465,0.000028180284,0.000058388552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014285177,0.00015489463,0.00015247526,0.0002177961,0.00015079175,0.00008454509,0.000102553146,0.00011483127,0.000016319937],"category_scores_gemma":[0.0000019466788,0.00017428485,0.000029005576,0.0010706445,0.000020238014,0.000098439035,0.0000028001416,0.00021546244,0.000014196785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001540215,0.000035031302,0.000027014541,0.000011814209,0.0000085394995,0.0000016850754,0.00019631578,0.9727913,0.0004970424,0.000005395499,0.00036615194,0.026044285],"study_design_scores_gemma":[0.0009285981,0.00004407349,0.00012421422,0.000041573454,0.00001276395,0.0000013213977,0.00024354634,0.9950831,0.002725187,0.000011430306,0.0006242885,0.0001598936],"about_ca_topic_score_codex":0.000050150404,"about_ca_topic_score_gemma":0.00022064487,"teacher_disagreement_score":0.73999697,"about_ca_system_score_codex":0.00012452279,"about_ca_system_score_gemma":0.00002393424,"threshold_uncertainty_score":0.71071297},"labels":[],"label_agreement":null},{"id":"W4389610124","doi":"10.1109/tmc.2023.3340925","title":"SlpRoF: Improving the Temporal Coverage and Robustness of RF-Based Vital Sign Monitoring During Sleep","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Non-Invasive Vital Sign Monitoring","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; European Commission","keywords":"Computer science; Torso; Sleep (system call); Robustness (evolution); Heart rate; Vital signs; Real-time computing; Simulation; Speech recognition; Medicine; Blood pressure; Anesthesia","score_opus":0.010690342174390407,"score_gpt":0.21828000584569396,"score_spread":0.20758966367130355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389610124","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.5780062,0.00004957914,0.4199435,0.0000035251244,0.0012535541,0.00027913606,0.000009628085,0.00043788602,0.000016972632],"genre_scores_gemma":[0.9984601,0.000019023393,0.0010163918,0.0000018232065,0.0003214229,0.00007254116,0.0000017169946,0.00009256437,0.00001440942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99842715,0.00005278677,0.00041330885,0.0003316477,0.00030181574,0.00047331373],"domain_scores_gemma":[0.99883544,0.0005991935,0.00008401024,0.00032558033,0.00005967718,0.00009608843],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030135506,0.0002961273,0.0002856493,0.00027333907,0.00045069028,0.00008425534,0.00022606192,0.000105659696,0.0000053526505],"category_scores_gemma":[0.000010345575,0.0002828912,0.00013046277,0.0007001641,0.00007540154,0.00019806591,0.000008987613,0.00045675,0.000008512425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001257117,0.000019789548,0.0012264205,0.00023363497,0.000031330248,0.000010834695,0.00017966422,0.73849016,0.2367939,3.8545494e-7,0.0000014203313,0.022999868],"study_design_scores_gemma":[0.0006089625,0.00008468187,0.0017221064,0.00026443432,0.000032158874,0.0000094764055,0.00045031722,0.28688163,0.7096299,0.000004458395,0.0000033944239,0.0003084922],"about_ca_topic_score_codex":0.00003606415,"about_ca_topic_score_gemma":0.000004535078,"teacher_disagreement_score":0.472836,"about_ca_system_score_codex":0.00013281658,"about_ca_system_score_gemma":0.000026652002,"threshold_uncertainty_score":0.99996233},"labels":[],"label_agreement":null},{"id":"W4389887582","doi":"10.1109/tmc.2023.3343715","title":"Distributionally Robust Cost Minimized Edge Semantic Intelligence in the Sustainable Metaverse","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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 Waterloo","funders":"Info-communications Media Development Authority; National Research Foundation Singapore","keywords":"Computer science; Metaverse; Reservation; Matching (statistics); Computer network; Virtual reality; Human–computer interaction","score_opus":0.02857787603887938,"score_gpt":0.2718848308018686,"score_spread":0.24330695476298922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389887582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033508394,0.000030543088,0.960849,0.0003913148,0.0036512383,0.00075443625,0.0000016700075,0.00044167502,0.0003717518],"genre_scores_gemma":[0.9944892,0.000018965966,0.0044863736,0.0002190601,0.0003180292,0.00009040084,0.000008351429,0.000019520818,0.0003500902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972234,0.00029916916,0.00052930583,0.0006066615,0.00046522424,0.0008762729],"domain_scores_gemma":[0.9977,0.0012768888,0.0001198396,0.00065180036,0.00015942767,0.00009204862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017313898,0.00027173097,0.0002942218,0.00042301833,0.0008750688,0.00035152084,0.0013673006,0.00009385734,0.000008909903],"category_scores_gemma":[0.000037810278,0.00023252043,0.00019988994,0.0030543993,0.000088567154,0.0003490702,0.000033885008,0.00056753744,0.0002799837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002022036,0.00026773653,0.000042161104,0.0000622577,0.000035759436,0.00020489411,0.0033969532,0.9051669,0.000061010487,0.0013654591,0.0019200656,0.087456584],"study_design_scores_gemma":[0.0004249099,0.0000964366,0.0003855595,0.00008390889,0.00001898612,0.000045956436,0.0014461447,0.99147755,0.001304179,0.00058397977,0.0037978117,0.00033455197],"about_ca_topic_score_codex":0.000078861594,"about_ca_topic_score_gemma":0.0000072082585,"teacher_disagreement_score":0.96098083,"about_ca_system_score_codex":0.00018526358,"about_ca_system_score_gemma":0.00015053753,"threshold_uncertainty_score":0.9481908},"labels":[],"label_agreement":null},{"id":"W4389924147","doi":"10.1109/tmc.2023.3343709","title":"Accuracy-Aware Cooperative Sensing and Computing for Connected Autonomous Vehicles","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Computer network; Human–computer interaction","score_opus":0.025946546468648767,"score_gpt":0.2828374104328161,"score_spread":0.2568908639641674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389924147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2840236,0.000045192573,0.7095967,0.00016921418,0.004262723,0.0005901189,0.000003125959,0.0012677788,0.000041554486],"genre_scores_gemma":[0.9786922,0.000012278254,0.020249337,0.00024938936,0.00065850397,0.000012962979,0.0000076098104,0.00004810862,0.00006965564],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99737436,0.00015732441,0.00055264717,0.000879781,0.00024412162,0.00079178985],"domain_scores_gemma":[0.9961604,0.00273851,0.00019774406,0.0004506892,0.00028092272,0.00017174809],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00066337007,0.0003730962,0.00043188376,0.00038407493,0.0017388925,0.0004736374,0.00046823846,0.0001414617,0.0000012764654],"category_scores_gemma":[0.00004243506,0.0003954156,0.00015640726,0.0011442296,0.000094560404,0.0003218779,0.00003991307,0.000423343,0.000042933792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018304538,0.00006517749,0.000031616593,0.00008232474,0.00007553637,0.000026105694,0.003986323,0.20089568,0.0028762112,0.00008963886,0.00072304177,0.79113007],"study_design_scores_gemma":[0.00080831436,0.00023553848,0.00019377073,0.00018241632,0.00001949348,0.000058459937,0.00029486042,0.98378414,0.012907374,0.00012762286,0.0009386661,0.00044935814],"about_ca_topic_score_codex":0.000042373544,"about_ca_topic_score_gemma":0.0000056852077,"teacher_disagreement_score":0.7906807,"about_ca_system_score_codex":0.00010703433,"about_ca_system_score_gemma":0.00013208872,"threshold_uncertainty_score":0.9998498},"labels":[],"label_agreement":null},{"id":"W4390204169","doi":"10.1109/tmc.2023.3345898","title":"ShuttleBus: Dense Packet Assembling With QUIC Stream Multiplexing for Massive IoT","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"National Postdoctoral Program for Innovative Talents; China Postdoctoral Science Foundation; Special Project for Research and Development in Key areas of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Network packet; Multiplexing; Latency (audio); Cluster analysis; Overhead (engineering); Packet forwarding; Data stream mining; Distributed computing; Telecommunications","score_opus":0.029146836093488837,"score_gpt":0.28241630203361096,"score_spread":0.2532694659401221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390204169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23412143,0.000020936104,0.75919884,0.0001372569,0.0046244524,0.00062008103,0.0000036074357,0.001191607,0.00008177987],"genre_scores_gemma":[0.9385644,0.000005788125,0.06010951,0.00013448282,0.000861281,0.00010191228,0.000007080112,0.000066528846,0.00014899009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971643,0.000085412335,0.0004854462,0.00089984754,0.000413797,0.00095119246],"domain_scores_gemma":[0.9973604,0.0013701429,0.00020498801,0.00064603967,0.0002307466,0.00018769105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006156822,0.00039237473,0.000386407,0.00053285767,0.0011813376,0.0003728625,0.0007371365,0.00013419367,0.0000026639236],"category_scores_gemma":[0.000021426638,0.00037358532,0.0002274867,0.0015324076,0.000062151696,0.00027605513,0.000020889704,0.0004368934,0.00009019693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043092008,0.00014220014,0.00009093369,0.00008767749,0.00009763814,0.000045221987,0.002178136,0.7608554,0.0022586922,0.000061303246,0.00083142385,0.2333083],"study_design_scores_gemma":[0.0011049827,0.0004561583,0.00012808946,0.00029641922,0.00002760157,0.000031547068,0.00034521092,0.9777124,0.018121758,0.00014770137,0.0011108639,0.00051730336],"about_ca_topic_score_codex":0.000029166878,"about_ca_topic_score_gemma":0.000011606872,"teacher_disagreement_score":0.704443,"about_ca_system_score_codex":0.00014717977,"about_ca_system_score_gemma":0.0001406251,"threshold_uncertainty_score":0.9998716},"labels":[],"label_agreement":null},{"id":"W4390421908","doi":"10.1109/tmc.2023.3348136","title":"Privacy-Preserving Location-Based Advertising via Longitudinal Geo-Indistinguishability","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","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 Waterloo","funders":"National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Obfuscation; Computer science; Inference; Differential privacy; Computer security; Data mining; Artificial intelligence","score_opus":0.0295127119607585,"score_gpt":0.2908800245725671,"score_spread":0.2613673126118086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390421908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105008475,0.00003663475,0.8861061,0.0019723508,0.0013369862,0.00056542974,0.000014762589,0.0048443982,0.000114879236],"genre_scores_gemma":[0.865481,0.000004835741,0.13418657,0.00010388969,0.00007129758,0.00007959964,0.00001131096,0.000040019608,0.000021484591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961102,0.00020352959,0.00070516777,0.001349057,0.0007090334,0.00092303375],"domain_scores_gemma":[0.98934966,0.001466088,0.00024944765,0.008467316,0.0003060597,0.00016139682],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0012183265,0.0004019946,0.00037465495,0.00062846194,0.0010988351,0.0003383029,0.016449751,0.00021569303,0.000037935075],"category_scores_gemma":[0.0030719195,0.0004481374,0.00018532385,0.0034667838,0.00017868397,0.0006367043,0.0020484866,0.0008065892,0.00024831848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026578437,0.00044079524,0.0031483716,0.00031056846,0.000086174165,0.000083144034,0.00036417943,0.65317255,0.0019014499,0.00005941859,0.0060693985,0.33433735],"study_design_scores_gemma":[0.00040336183,0.000119536126,0.0039852303,0.00024473353,0.000015180336,0.000015413732,0.00003712288,0.9750434,0.014158801,0.0053436696,0.0001893168,0.0004442079],"about_ca_topic_score_codex":0.00016590094,"about_ca_topic_score_gemma":0.000029145864,"teacher_disagreement_score":0.76047254,"about_ca_system_score_codex":0.0003655311,"about_ca_system_score_gemma":0.00019665751,"threshold_uncertainty_score":0.99979705},"labels":[],"label_agreement":null},{"id":"W4390534264","doi":"10.1109/tmc.2023.3347580","title":"Cooperative Deep Reinforcement Learning Enabled Power Allocation for Packet Duplication URLLC in Multi-Connectivity Vehicular Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Communication Security Techniques","field":"Engineering","cited_by":60,"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; Toronto Metropolitan University","funders":"Natural Science Foundation of Jiangsu Province for Distinguished Young Scholars; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Retransmission; Network packet; Computer network; Reinforcement learning; Scheduling (production processes); Telecommunications link; Distributed computing; Artificial intelligence","score_opus":0.015167811872945696,"score_gpt":0.2680953196626805,"score_spread":0.25292750778973483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390534264","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079293884,0.00041453235,0.91754586,0.00004739422,0.0002745053,0.0011498873,0.0000018664077,0.0011911634,0.00008088884],"genre_scores_gemma":[0.99466676,0.00019078027,0.004143197,0.000027801327,0.000027352067,0.0008198329,0.000030554074,0.00006369405,0.000030058825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987599,0.000107151216,0.0004109339,0.00031448703,0.00012354754,0.00028392783],"domain_scores_gemma":[0.99901044,0.00045971255,0.00004427315,0.00033765275,0.000097674245,0.000050257917],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005034254,0.00021940403,0.000218015,0.0002557287,0.00022746537,0.00011587299,0.000176697,0.00015797901,0.00002016939],"category_scores_gemma":[0.000012588051,0.00025348045,0.000100438985,0.00048682708,0.000029507783,0.00024613,0.0000040607983,0.0006412703,0.000011516897],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009861174,0.00006348016,0.000009211878,0.00006621573,0.000044417146,8.7282183e-7,0.0014043306,0.9719054,0.002837832,0.00022445641,0.00001723042,0.023416687],"study_design_scores_gemma":[0.00032831845,0.00009978614,0.000057371053,0.00021470756,0.000015998254,0.000002774332,0.00019572547,0.9733427,0.024718126,0.000018208708,0.00076497556,0.00024127796],"about_ca_topic_score_codex":0.000029812134,"about_ca_topic_score_gemma":0.0000844466,"teacher_disagreement_score":0.91537285,"about_ca_system_score_codex":0.00037874878,"about_ca_system_score_gemma":0.00002499721,"threshold_uncertainty_score":0.9999917},"labels":[],"label_agreement":null},{"id":"W4390659127","doi":"10.1109/tmc.2024.3350885","title":"UAV Swarm-Enabled Collaborative Secure Relay Communications With Time-Domain Colluding Eavesdropper","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Computer science; Relay; Swarm behaviour; Beamforming; Computer network; Optimization problem; Base station; Energy consumption; Terminal (telecommunication); Real-time computing; Telecommunications; Algorithm; Artificial intelligence; Electrical engineering","score_opus":0.0058059094570404235,"score_gpt":0.22284385407659657,"score_spread":0.21703794461955614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044240907,0.0005632278,0.9488615,0.00013861469,0.00026112056,0.00078076136,0.00006490701,0.0012378239,0.003851141],"genre_scores_gemma":[0.9570971,0.00014799128,0.0418159,0.000033254826,0.000058429356,0.00027490204,0.000026348465,0.00009561602,0.00045043277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988434,0.00006460926,0.00031676108,0.00031578957,0.00017603925,0.0002834321],"domain_scores_gemma":[0.9989057,0.00026077207,0.00003649053,0.0005831542,0.00012373964,0.00009012807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018152338,0.0002505601,0.00021595565,0.00023831782,0.00055182725,0.00018956776,0.00025786212,0.000115628485,0.00009060869],"category_scores_gemma":[0.0000011653216,0.00024141476,0.0000702972,0.0014829559,0.0000871124,0.00015852074,0.0000040613018,0.0004752,0.0002051511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008300446,0.000058877707,0.000002552661,0.000049773535,0.00012117144,0.0000037873638,0.0015071207,0.98925227,0.0024297785,0.00022517671,0.0005740266,0.005767163],"study_design_scores_gemma":[0.00028543445,0.00009494639,0.000005045328,0.00024317756,0.0000633525,0.0000196632,0.0006076129,0.98350024,0.004964089,0.000037956182,0.009872144,0.0003063567],"about_ca_topic_score_codex":0.0000071291456,"about_ca_topic_score_gemma":0.000023143857,"teacher_disagreement_score":0.9128562,"about_ca_system_score_codex":0.00023460359,"about_ca_system_score_gemma":0.000079530626,"threshold_uncertainty_score":0.98446083},"labels":[],"label_agreement":null},{"id":"W4390659130","doi":"10.1109/tmc.2024.3350886","title":"Joint Task Offloading and Resource Allocation in Aerial-Terrestrial UAV Networks With Edge and Fog Computing for Post-Disaster Rescue","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":171,"is_retracted":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":"Computer science; Edge computing; Mobile edge computing; Resource allocation; Task (project management); Resource management (computing); Distributed computing; Enhanced Data Rates for GSM Evolution; Software deployment; Mobile device; Real-time computing; Computer network; Artificial intelligence; Operating system","score_opus":0.00898458552482317,"score_gpt":0.21574714763041822,"score_spread":0.20676256210559504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390659130","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35241485,0.00018838514,0.6463615,0.00003180753,0.00025247,0.0005265468,0.0000068439585,0.00018495298,0.000032660275],"genre_scores_gemma":[0.9915559,0.000039651703,0.007978885,0.000024226938,0.00023801059,0.00007626639,0.000020211159,0.000054878627,0.000011918379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990066,0.000030354597,0.00031968558,0.00032580402,0.000077195364,0.00024030988],"domain_scores_gemma":[0.9995416,0.00020516178,0.000027261985,0.00013855673,0.000027398222,0.000060069968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023911151,0.00018105832,0.00018620671,0.00020207612,0.00019416984,0.00018163034,0.000052465624,0.000099210374,0.0000027247631],"category_scores_gemma":[0.000002903412,0.00018122912,0.00003640607,0.00028899033,0.000037776477,0.00012499052,0.0000030358892,0.00023637938,0.000001154324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003449658,0.000017781149,0.00000945314,0.000087363704,0.000024886645,0.0000010966642,0.0008551745,0.93019766,0.0016381965,0.000028701314,0.000029438403,0.06707576],"study_design_scores_gemma":[0.0006088026,0.00012010655,0.00015192304,0.0003518809,0.00003468959,0.000018466848,0.0002540684,0.9971988,0.0006605079,0.000008228595,0.00039500007,0.00019749174],"about_ca_topic_score_codex":0.000032568118,"about_ca_topic_score_gemma":0.000070276976,"teacher_disagreement_score":0.6391411,"about_ca_system_score_codex":0.00007574567,"about_ca_system_score_gemma":0.000016590217,"threshold_uncertainty_score":0.7390309},"labels":[],"label_agreement":null},{"id":"W4391128425","doi":"10.1109/tmc.2024.3357499","title":"CoralDB: A Collaborative Database for Data Sharing Based on Permissioned Blockchain","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","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":"Carleton University","funders":"Key Research and Development Program of Hunan Province of China; Hunan Provincial Innovation Foundation for Postgraduate; National Natural Science Foundation of China","keywords":"Blockchain; Computer science; Data sharing; USable; Database; Distributed database; Database transaction; Leverage (statistics); Usability; Data access; Block (permutation group theory); Distributed computing; Computer security; World Wide Web; Operating system","score_opus":0.0376172104951786,"score_gpt":0.317061174145097,"score_spread":0.2794439636499184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391128425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056141834,0.00015872,0.98965985,0.0012101157,0.00064918597,0.0010534895,0.00033403057,0.0012224497,0.00009796141],"genre_scores_gemma":[0.90423566,0.000009096552,0.0949321,0.00032636794,0.000062576124,0.00029556165,0.000040702922,0.00002920758,0.000068742134],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976533,0.000056407695,0.00034683073,0.0013385641,0.00023839815,0.00036648815],"domain_scores_gemma":[0.9967305,0.00074293016,0.000069737755,0.0022288272,0.00011595436,0.00011203472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073431595,0.00025130028,0.00023085145,0.00037452768,0.00072967703,0.00026380268,0.0019491385,0.00014325598,0.000019770845],"category_scores_gemma":[0.000019211091,0.0002434012,0.000087086744,0.0013048992,0.000076783545,0.0001623027,0.000043317163,0.0004963688,0.00003285492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008157608,0.0011699265,0.000007127383,0.00027048218,0.00013197384,0.000051600622,0.0011185617,0.32935417,0.0039657718,0.031814914,0.003226551,0.62880737],"study_design_scores_gemma":[0.00037819493,0.00022756851,0.0000016962166,0.00021367313,0.00002248128,0.000008422235,0.0000669648,0.9832262,0.008962088,0.00064639916,0.0059932657,0.00025304253],"about_ca_topic_score_codex":0.00001281475,"about_ca_topic_score_gemma":0.000011695521,"teacher_disagreement_score":0.89862144,"about_ca_system_score_codex":0.00008945908,"about_ca_system_score_gemma":0.00019377471,"threshold_uncertainty_score":0.9925613},"labels":[],"label_agreement":null},{"id":"W4391853792","doi":"10.1109/tmc.2024.3366340","title":"PPRP: Preserving Location Privacy for Range-Based Positioning in Mobile Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Hybrid positioning system; Mobile computing; Location-based service; Information privacy; Computer security; Mobile telephony; Privacy protection; Range (aeronautics); Computer network; Internet privacy; Mobile radio; Positioning system","score_opus":0.009627036629012042,"score_gpt":0.2444950658575567,"score_spread":0.23486802922854466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391853792","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03955852,0.0011897011,0.9554105,0.000025113462,0.0010270589,0.00083823234,0.000009188401,0.0018409109,0.00010079129],"genre_scores_gemma":[0.99598247,0.000045188477,0.003228322,0.000029469093,0.00009126739,0.0005150331,0.000015603306,0.00006402569,0.000028595554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989282,0.000025866337,0.00033541056,0.0002755117,0.000113959075,0.0003210388],"domain_scores_gemma":[0.99933666,0.00033029867,0.000022273536,0.0002260825,0.00005083578,0.00003387062],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020863226,0.0001876513,0.0001736801,0.00036903273,0.00018228286,0.00013018613,0.00017579664,0.00016062795,0.000023941368],"category_scores_gemma":[0.0000064186747,0.00021002837,0.00009833189,0.00076476287,0.000027785549,0.00016753646,0.0000020721363,0.00033461617,0.000010212074],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009208994,0.000029583207,0.000020270774,0.00024988485,0.00001778508,0.0000025904963,0.00022827966,0.9349739,0.00028527444,0.00005115681,0.00008549077,0.064046554],"study_design_scores_gemma":[0.00035351436,0.00008308734,0.000026958884,0.00048660286,0.000019056237,0.000002916395,0.00012060311,0.9807515,0.017094545,0.000063537576,0.0007884232,0.00020921983],"about_ca_topic_score_codex":0.000010552436,"about_ca_topic_score_gemma":0.000014908304,"teacher_disagreement_score":0.956424,"about_ca_system_score_codex":0.00020557776,"about_ca_system_score_gemma":0.000029630743,"threshold_uncertainty_score":0.8564709},"labels":[],"label_agreement":null},{"id":"W4391853798","doi":"10.1109/tmc.2024.3365951","title":"CPPer-FL: Clustered Parallel Training for Efficient Personalized Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","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":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Training (meteorology); Computer architecture; Multimedia; Distributed computing; Computer network; Artificial intelligence","score_opus":0.04878786099221449,"score_gpt":0.3069871642057065,"score_spread":0.258199303213492,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391853798","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017712165,0.00035341622,0.9726327,0.0024052525,0.0017978187,0.0007544692,0.000020748548,0.004183045,0.00014039001],"genre_scores_gemma":[0.79096556,0.000018599225,0.20847747,0.00011218565,0.00006533311,0.00015443783,0.000007909037,0.000045591212,0.0001529339],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725384,0.00014358005,0.00047077396,0.0010533539,0.00036734142,0.0007111198],"domain_scores_gemma":[0.99687827,0.0011054855,0.000093078546,0.0017202267,0.000097651195,0.000105271196],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007941718,0.0003360067,0.00034229152,0.00037897733,0.0009892217,0.0007976848,0.005157125,0.00019037075,0.000022495746],"category_scores_gemma":[0.0003571491,0.00033866326,0.00025592605,0.00089368725,0.00011400642,0.00029084663,0.0004224419,0.00083279016,0.00005250526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037264323,0.00011856073,0.0000013562056,0.00013184825,0.00014761042,0.000029701421,0.0018064477,0.5733554,0.0019039988,0.00043208737,0.0025602747,0.4194755],"study_design_scores_gemma":[0.0006270883,0.00025110308,0.0000026272444,0.0002989495,0.000027041087,0.000052360712,0.00045780677,0.99036056,0.002834438,0.0009813607,0.0037403887,0.000366299],"about_ca_topic_score_codex":0.000014497026,"about_ca_topic_score_gemma":0.0000046800624,"teacher_disagreement_score":0.7732534,"about_ca_system_score_codex":0.00021281562,"about_ca_system_score_gemma":0.00015016229,"threshold_uncertainty_score":0.99990654},"labels":[],"label_agreement":null},{"id":"W4392309314","doi":"10.1109/tmc.2024.3371772","title":"Filling the Missing: Exploring Generative AI for Enhanced Federated Learning Over Heterogeneous Mobile Edge Devices","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Info-communications Media Development Authority; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Enhanced Data Rates for GSM Evolution; Mobile device; Generative grammar; Generative model; Mobile computing; Computer network; Distributed computing; Multimedia; Artificial intelligence; World Wide Web","score_opus":0.05206983829696601,"score_gpt":0.30882655792391595,"score_spread":0.25675671962694996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392309314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08212958,0.00082044466,0.9108146,0.0010796653,0.00211278,0.0007883307,0.000015038929,0.0022069134,0.000032668446],"genre_scores_gemma":[0.9328598,0.00007715987,0.06586576,0.0002554703,0.00016508003,0.0006657801,0.000006105175,0.000054778913,0.000050103205],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974175,0.00016440626,0.00047344057,0.0010041633,0.00031600273,0.00062447635],"domain_scores_gemma":[0.9963894,0.0013967844,0.00011479295,0.0018869817,0.00013347816,0.00007855075],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.000554214,0.0003617846,0.0002909783,0.00024371808,0.0017051848,0.0013588293,0.0049616373,0.00014205438,0.000018838986],"category_scores_gemma":[0.00024904066,0.00030221784,0.00021249667,0.0008416258,0.000097455486,0.0008304043,0.0005015274,0.0009009584,0.000027599901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009814403,0.000057179044,0.0000018121985,0.00008316973,0.000113755894,0.000013513136,0.0009014218,0.5491275,0.017405124,0.00003900253,0.00073039916,0.4315173],"study_design_scores_gemma":[0.00014102877,0.00018148129,0.0000012798527,0.00022146231,0.000018048853,0.000017701132,0.00012959998,0.710689,0.28443894,0.00081210345,0.003094491,0.0002548586],"about_ca_topic_score_codex":0.000018991399,"about_ca_topic_score_gemma":0.0000124090875,"teacher_disagreement_score":0.8507302,"about_ca_system_score_codex":0.0001958609,"about_ca_system_score_gemma":0.00010535438,"threshold_uncertainty_score":0.999943},"labels":[],"label_agreement":null},{"id":"W4392449633","doi":"10.1109/tmc.2024.3373529","title":"Enhancing Reliability in Federated mmWave Networks: A Practical and Scalable Solution Using Radar-Aided Dynamic Blockage Recognition","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Millimeter-Wave Propagation and Modeling","field":"Engineering","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":"Carleton University","funders":"Engineering and Physical Sciences Research Council","keywords":"Computer science; Radar; Real-time computing; Scalability; Reliability (semiconductor); Computer network; Telecommunications","score_opus":0.02152382095383333,"score_gpt":0.26692371894976047,"score_spread":0.24539989799592715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392449633","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41511455,0.00022559725,0.5835094,0.000017068422,0.00050431106,0.00027183205,0.0000041633934,0.0003260393,0.000027031172],"genre_scores_gemma":[0.9769438,0.00015786152,0.022729775,0.000022440572,0.00005225905,0.000020935226,0.000009778809,0.00005145496,0.000011701224],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984694,0.00012022962,0.0005003397,0.00041197214,0.00014442441,0.00035360988],"domain_scores_gemma":[0.999399,0.00029454211,0.000033730557,0.0001288232,0.000058987836,0.000084925116],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006166491,0.0002191881,0.0002248329,0.00026059742,0.00023628857,0.00018684192,0.0000347849,0.00015687798,0.00003127438],"category_scores_gemma":[0.000015595188,0.00024789356,0.00006981198,0.00046141993,0.000033189488,0.00030158734,0.0000029042174,0.0006486436,0.0000137077695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013831454,0.00004310011,0.000002138724,0.00016308129,0.000023377745,0.000011655052,0.00025507755,0.87001026,0.07488941,4.3573442e-7,0.0000036117774,0.054584052],"study_design_scores_gemma":[0.0002596756,0.000048586695,0.000007759668,0.0005887946,0.00003994868,0.000059914597,0.00016391474,0.95626265,0.042259667,0.00006134658,0.000008245079,0.0002395163],"about_ca_topic_score_codex":0.000057782156,"about_ca_topic_score_gemma":0.00012309747,"teacher_disagreement_score":0.56182927,"about_ca_system_score_codex":0.0003716955,"about_ca_system_score_gemma":0.000054924443,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W4392796562","doi":"10.1109/tmc.2024.3377226","title":"A Unified Framework for Guiding Generative AI With Wireless Perception in Resource Constrained Mobile Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","field":"Computer Science","cited_by":73,"is_retracted":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":"Guangdong Provincial Pearl River Talents Program; Info-communications Media Development Authority; National Natural Science Foundation of China; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Computer science; Wireless; Enhanced Data Rates for GSM Evolution; Wireless network; Resource (disambiguation); Generative grammar; Mobile computing; Perception; Computer network; Mobile telephony; Distributed computing; Mobile radio; Human–computer interaction; Telecommunications; Artificial intelligence","score_opus":0.02564544004550459,"score_gpt":0.2788105216645401,"score_spread":0.2531650816190355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392796562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01566495,0.00016580665,0.9809897,0.00021662809,0.0010828245,0.0011347642,0.000012804478,0.0005228237,0.00020968192],"genre_scores_gemma":[0.9287472,0.000027665077,0.069900915,0.0005443621,0.0003182871,0.000301995,0.0000102611975,0.000045227076,0.00010407927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976226,0.00015021415,0.0005199136,0.00085544615,0.00025922144,0.0005925741],"domain_scores_gemma":[0.9981558,0.0010512144,0.00009178296,0.00045333357,0.0000926137,0.00015530788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000563504,0.00034414144,0.00037909075,0.00028492082,0.00046735996,0.00044304327,0.00042190895,0.00025132927,0.000021310627],"category_scores_gemma":[0.000001482843,0.00031872766,0.00015466801,0.0009795624,0.00012603587,0.0002895822,0.000008973611,0.0006737534,0.00000837035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050298513,0.000095313706,0.0000043298865,0.000039588263,0.000041148996,0.000044375367,0.0016033542,0.62078005,0.00010860572,0.0036538248,0.00018004225,0.37339905],"study_design_scores_gemma":[0.00047955543,0.00050206215,0.0000045195725,0.0007560809,0.000029869376,0.00005939085,0.00055750285,0.9955716,0.0001925495,0.00060218124,0.0008638689,0.00038082534],"about_ca_topic_score_codex":0.000012844262,"about_ca_topic_score_gemma":0.000013314727,"teacher_disagreement_score":0.91308224,"about_ca_system_score_codex":0.0001797739,"about_ca_system_score_gemma":0.00018762038,"threshold_uncertainty_score":0.9999265},"labels":[],"label_agreement":null},{"id":"W4394896937","doi":"10.1109/tmc.2024.3390208","title":"ProSecutor: Protecting Mobile AIGC Services on Two-Layer Blockchain via Reputation and Contract Theoretic Approaches","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Blockchain; Computer science; Computer security; Reputation; Layer (electronics); Reputation management; Computer network; Law; Chemistry","score_opus":0.014244770123394618,"score_gpt":0.2520721446569496,"score_spread":0.23782737453355499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394896937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34356397,0.00029170592,0.6534083,0.00015944685,0.00026707363,0.0011748,0.0000048827874,0.0010045299,0.00012531574],"genre_scores_gemma":[0.98938304,0.000013745634,0.009485649,0.000117381416,0.00007875551,0.00085734815,0.0000017761739,0.00003443818,0.000027868287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977806,0.00017105069,0.00042025154,0.00097416196,0.00025691654,0.00039700192],"domain_scores_gemma":[0.99857634,0.00051113,0.0001218483,0.00063534325,0.00006382744,0.00009149215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085755513,0.0003098914,0.0002629664,0.00033501495,0.0007953796,0.0003488342,0.00047435876,0.00019709636,0.000009564195],"category_scores_gemma":[0.0000040299547,0.00028877865,0.00010812737,0.0007192585,0.00013398733,0.00016502217,0.00001658503,0.000923553,0.00003178348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017017992,0.00033338676,0.0000104850105,0.00024993363,0.000075662974,0.000016091226,0.005053885,0.15920113,0.0034541956,0.016530134,0.000003017636,0.8150551],"study_design_scores_gemma":[0.0002883897,0.00036087743,0.000017899165,0.00018935389,0.0000256255,0.00009952799,0.0003311089,0.9599026,0.033722457,0.0045864712,0.00018247703,0.00029325334],"about_ca_topic_score_codex":0.000042065574,"about_ca_topic_score_gemma":0.000013331389,"teacher_disagreement_score":0.8147618,"about_ca_system_score_codex":0.00008887773,"about_ca_system_score_gemma":0.000043239794,"threshold_uncertainty_score":0.9999564},"labels":[],"label_agreement":null},{"id":"W4396594881","doi":"10.1109/tmc.2024.3395388","title":"Enabling Efficient and Distributed Access Control for Pervasive Edge Computing Services","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Access Control and Trust","field":"Social Sciences","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":"Queen's University; University of Waterloo","funders":"","keywords":"Computer science; Ubiquitous computing; Distributed computing; Edge computing; Computer network; Access control; Context-aware pervasive systems; Mobile computing; Enhanced Data Rates for GSM Evolution; Computer security; Telecommunications; Operating system","score_opus":0.018638181771750698,"score_gpt":0.32096647719704297,"score_spread":0.30232829542529227,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396594881","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19932848,0.0008141572,0.79670966,0.00030248053,0.0012982413,0.00088485726,0.00011117265,0.00036843185,0.00018253911],"genre_scores_gemma":[0.9989467,0.000042980813,0.00024423492,0.00015894146,0.00047483112,0.00005991224,0.0000075877633,0.000026475607,0.00003833732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99829286,0.00012322009,0.0003243477,0.0004950089,0.0002626829,0.00050189387],"domain_scores_gemma":[0.9979683,0.0014992872,0.00008435102,0.00013138168,0.00016619351,0.00015046625],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0006557507,0.00020296831,0.00027857334,0.00016072279,0.0018606677,0.00091460487,0.00031611242,0.000115346105,0.000026725658],"category_scores_gemma":[0.000014336433,0.00019434236,0.00016074949,0.0004531115,0.00014160328,0.00025982753,0.0000063053863,0.00027089735,0.000009543354],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006661596,0.00015581679,0.00020767759,0.00039024395,0.00018631954,0.000012529571,0.00911861,0.64525557,0.00023908823,0.0012748839,0.000028634879,0.34306398],"study_design_scores_gemma":[0.0010179996,0.000091238595,0.00024605123,0.00037813227,0.00014476133,0.0000040405894,0.0047143176,0.9875554,0.00041864777,0.00014654336,0.004966114,0.00031675608],"about_ca_topic_score_codex":0.0005042029,"about_ca_topic_score_gemma":0.0002355372,"teacher_disagreement_score":0.79961824,"about_ca_system_score_codex":0.00011581661,"about_ca_system_score_gemma":0.000110839275,"threshold_uncertainty_score":0.99943876},"labels":[],"label_agreement":null},{"id":"W4396680684","doi":"10.1109/tmc.2024.3397164","title":"Mobility-Aware Congestion Control for Multipath QUIC in Integrated Terrestrial Satellite Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","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":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada","keywords":"Computer science; Computer network; Multipath propagation; Satellite; Network congestion; Telecommunications","score_opus":0.020411419310946154,"score_gpt":0.26773080366651014,"score_spread":0.247319384355564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06614479,0.0031007058,0.92456347,0.00001993826,0.003347015,0.001602222,0.00005174087,0.0011305116,0.000039603052],"genre_scores_gemma":[0.99820673,0.00035535728,0.00060645025,0.00001780809,0.00018879696,0.00048776637,0.00003279306,0.00008057169,0.000023735698],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982774,0.00017727929,0.00067885546,0.00036701738,0.00013318122,0.00036622913],"domain_scores_gemma":[0.99800754,0.001375811,0.00004114495,0.00044697928,0.00004831997,0.00008021623],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00061093864,0.00027796865,0.00034559311,0.00031585497,0.00011318141,0.00014720012,0.00023720624,0.00021161197,0.0000143276475],"category_scores_gemma":[0.000009419639,0.0002903752,0.00017289778,0.00056560745,0.00004585859,0.00014947285,0.0000015138755,0.00061499886,0.000028827406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004662863,0.00004867845,0.000047100173,0.00009555326,0.00004731739,0.000002820912,0.00034899195,0.7689674,0.000482656,0.000008748095,0.0000098281935,0.22989427],"study_design_scores_gemma":[0.0010360377,0.00008822893,0.00014518113,0.00054690905,0.000027442095,0.000008500013,0.0001794078,0.99254966,0.00086320203,0.00001364927,0.0042823516,0.00025945847],"about_ca_topic_score_codex":0.000065783635,"about_ca_topic_score_gemma":0.000117161035,"teacher_disagreement_score":0.9320619,"about_ca_system_score_codex":0.00035037883,"about_ca_system_score_gemma":0.000038739523,"threshold_uncertainty_score":0.9999548},"labels":[],"label_agreement":null},{"id":"W4396680687","doi":"10.1109/tmc.2024.3396793","title":"Covert Communication in Large-Scale Multi-Tier LEO Satellite Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cryptographic Implementations and Security","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; Ericsson (Canada)","funders":"National Natural Science Foundation of China","keywords":"Computer science; Communications satellite; Computer network; Covert; Satellite; Scale (ratio); Telecommunications; Distributed computing; Geography","score_opus":0.016606250999084554,"score_gpt":0.2944146018835499,"score_spread":0.2778083508844653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396680687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037679236,0.0012484707,0.9592973,0.00014820774,0.00081536395,0.00036406738,0.000009869443,0.0003279808,0.00010950942],"genre_scores_gemma":[0.9636987,0.0004366627,0.035566557,0.00014858456,0.000027751901,0.00005486793,0.000009203703,0.000016659416,0.000041041334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844056,0.0001560112,0.00040802706,0.00043259092,0.00018695107,0.00037583904],"domain_scores_gemma":[0.9989715,0.00028532057,0.000046190366,0.0005871084,0.00004032038,0.0000695325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005735656,0.00017095415,0.0001699257,0.00034612493,0.0003619641,0.00031934332,0.0004904031,0.00008522903,0.00003326313],"category_scores_gemma":[0.0000011923339,0.0001802131,0.00013720842,0.0012205546,0.000040824703,0.00039314578,0.000012876255,0.0005090496,0.000029486093],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010481058,0.00070162973,0.00065769267,0.000058215002,0.000057237205,0.000018792467,0.009737267,0.44675,0.00020146444,0.004000929,0.00013442851,0.53767186],"study_design_scores_gemma":[0.00040255798,0.00005420411,0.0009872315,0.000121813275,0.000008433203,0.000010236898,0.00029344863,0.99172354,0.00027369312,0.00016647113,0.0057616006,0.00019676764],"about_ca_topic_score_codex":0.00008769863,"about_ca_topic_score_gemma":0.0005066347,"teacher_disagreement_score":0.92601943,"about_ca_system_score_codex":0.000091233305,"about_ca_system_score_gemma":0.0000429817,"threshold_uncertainty_score":0.7348877},"labels":[],"label_agreement":null},{"id":"W4399110650","doi":"10.1109/tmc.2024.3406607","title":"Dynamic Human Digital Twin Deployment at the Edge for Task Execution: A Two-Timescale Accuracy-Aware Online Optimization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Digital Transformation in Industry","field":"Engineering","cited_by":111,"is_retracted":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; Concordia University","funders":"National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Software deployment; Task (project management); Enhanced Data Rates for GSM Evolution; Distributed computing; Real-time computing; Operating system; Artificial intelligence","score_opus":0.014809786531655145,"score_gpt":0.2728077714048264,"score_spread":0.25799798487317127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399110650","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03726784,0.00016845805,0.95749575,0.00010093747,0.00136242,0.0009052803,0.0006351826,0.001244741,0.00081940414],"genre_scores_gemma":[0.9977412,0.000015061176,0.0009366345,0.000034901055,0.00011640979,0.00021154353,0.00023968691,0.000093289505,0.0006112338],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867046,0.000016593873,0.00046712483,0.0002960321,0.0002189248,0.0003308537],"domain_scores_gemma":[0.9992107,0.0003324239,0.00003555697,0.0002815887,0.00005884444,0.000080879036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108034765,0.0002698029,0.00017364543,0.0001502731,0.000431422,0.00040098515,0.0002104933,0.0001085907,0.00009282867],"category_scores_gemma":[0.0000028378713,0.00024413528,0.00020176165,0.0003710012,0.000062833424,0.00057283044,0.0000040889986,0.00036330687,0.00006311621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057796447,0.00007212481,0.0000011959643,0.00012319995,0.000071214214,0.000001930426,0.00027843472,0.94294316,0.00030089755,0.000014018272,0.00060308835,0.055584937],"study_design_scores_gemma":[0.00041565587,0.00008333142,0.0000037053328,0.0002440273,0.00004747161,0.00003236282,0.00032344676,0.9915484,0.0025896027,0.000026912188,0.004412284,0.00027279515],"about_ca_topic_score_codex":0.000002735371,"about_ca_topic_score_gemma":0.000013212148,"teacher_disagreement_score":0.9604734,"about_ca_system_score_codex":0.0004282534,"about_ca_system_score_gemma":0.000030012985,"threshold_uncertainty_score":0.9955548},"labels":[],"label_agreement":null},{"id":"W4399311126","doi":"10.1109/tmc.2024.3408425","title":"Hypergraph-Aided Task-Resource Matching for Maximizing Value of Task Completion in Collaborative IoT Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Task (project management); Hypergraph; Matching (statistics); Resource (disambiguation); Distributed computing; Resource allocation; Value (mathematics); Theoretical computer science; Computer network; Machine learning","score_opus":0.012957326192174986,"score_gpt":0.25840187178312074,"score_spread":0.24544454559094575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399311126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17474481,0.00057564036,0.8163396,0.00010623387,0.006828835,0.00087177526,0.000009163881,0.00038023377,0.00014368742],"genre_scores_gemma":[0.9752039,0.0000070483634,0.024134038,0.000057553883,0.00043400444,0.00008360695,0.00000457466,0.00004372837,0.00003155714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972321,0.00025469193,0.00082691957,0.0007514975,0.00037900952,0.0005558262],"domain_scores_gemma":[0.9978819,0.0012348294,0.00019206395,0.00042975755,0.000166784,0.00009466479],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010432124,0.00032639972,0.00052042847,0.0007414515,0.00043734838,0.00034790323,0.00060101406,0.00013554713,8.7717996e-7],"category_scores_gemma":[0.000010289673,0.00034235002,0.00022896174,0.001794712,0.000063461775,0.00019571633,0.000017139371,0.00045665947,0.000010643053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025613755,0.00013837525,0.000014263182,0.00042366833,0.000075487435,0.000015047263,0.0050905296,0.9355621,0.009280606,0.0020662048,0.00025820633,0.04704992],"study_design_scores_gemma":[0.0005515914,0.00023495663,0.000045062974,0.001170646,0.000026828604,0.000031794818,0.00052138156,0.98950744,0.0041157827,0.00034074235,0.0031030544,0.00035073928],"about_ca_topic_score_codex":0.00016542147,"about_ca_topic_score_gemma":0.000006508776,"teacher_disagreement_score":0.8004591,"about_ca_system_score_codex":0.0002106299,"about_ca_system_score_gemma":0.00014220443,"threshold_uncertainty_score":0.99990284},"labels":[],"label_agreement":null},{"id":"W4399526294","doi":"10.1109/tmc.2024.3412751","title":"Bridge the Present and Future: A Cross-Layer Matching Game in Dynamic Cloud-Aided Mobile Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant Networks","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":"Western University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Aeronautical Science Foundation of China; National Natural Science Foundation of China; Natural Science Foundation of Xiamen City","keywords":"Computer science; Cloud computing; Bridge (graph theory); Enhanced Data Rates for GSM Evolution; Matching (statistics); Layer (electronics); Mobile telephony; Distributed computing; Computer network; Telecommunications; Mobile radio; Operating system","score_opus":0.015787920957551466,"score_gpt":0.2856436364600143,"score_spread":0.2698557155024628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399526294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10762241,0.0027777113,0.88360673,0.00034118767,0.0044587813,0.00064969104,0.000007070559,0.00037395753,0.00016244217],"genre_scores_gemma":[0.9970224,0.00039788886,0.0011626915,0.00021760113,0.00086626376,0.00011800299,0.0000027267085,0.000038800183,0.00017361362],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757975,0.0001731605,0.00054630544,0.00078254374,0.00031151247,0.00060671207],"domain_scores_gemma":[0.9984201,0.00068195484,0.00008067482,0.0006272008,0.000040416424,0.00014961856],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007053578,0.00032604972,0.00030806128,0.00017268666,0.00043900838,0.00088369957,0.0006198761,0.00017118048,0.000022349941],"category_scores_gemma":[3.8979078e-7,0.00026221797,0.0001616499,0.00075036375,0.00012855278,0.000352909,0.00003180746,0.0010308011,0.000022654884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012102372,0.00007130999,0.000014107236,0.00003439875,0.000030475092,0.00008043826,0.0014798428,0.48761022,0.000017122682,0.0003023337,0.00013723502,0.5102104],"study_design_scores_gemma":[0.00031857495,0.00010574332,0.0003410302,0.0001721388,0.000019423573,0.00015369484,0.000100609795,0.99472195,0.000026971686,0.00046113593,0.0032907065,0.00028802786],"about_ca_topic_score_codex":0.000077014716,"about_ca_topic_score_gemma":0.000030507532,"teacher_disagreement_score":0.8894,"about_ca_system_score_codex":0.00011011598,"about_ca_system_score_gemma":0.00009278752,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W4399618835","doi":"10.1109/tmc.2024.3412810","title":"An Efficient Resource Allocation Scheme With Uncertain Network Status in Edge Computing-Enabled Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"Carleton University","funders":"Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Computer science; Resource allocation; Scheme (mathematics); Computer network; Distributed computing; Resource management (computing); Enhanced Data Rates for GSM Evolution; Edge computing; Mobile edge computing; Server; Telecommunications","score_opus":0.011408793552076264,"score_gpt":0.2532576635229399,"score_spread":0.2418488699708636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399618835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14205562,0.0004313386,0.8508888,0.00008855459,0.0045339395,0.0005906038,4.9155796e-7,0.001082246,0.00032844304],"genre_scores_gemma":[0.9600988,0.000009627601,0.038076375,0.0002021653,0.0014670021,0.000026286349,0.00000961953,0.000065977336,0.000044168642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99586636,0.00035022153,0.0006974215,0.0012479182,0.00049068773,0.0013473937],"domain_scores_gemma":[0.99795634,0.00066853996,0.0001405742,0.00085088256,0.00010493048,0.00027874805],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012975262,0.00047141235,0.00042166482,0.0004616165,0.0007571179,0.00076907896,0.0008381552,0.00018600469,0.000004455553],"category_scores_gemma":[0.00000439038,0.00045029953,0.00013432377,0.0027768586,0.0000929771,0.00033290102,0.000024407822,0.0010667059,0.000032408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002990038,0.0002027224,0.00011518946,0.000054673368,0.000034202483,0.000056699773,0.0016589797,0.9005408,0.00004589838,0.0003115067,0.0002552801,0.096694134],"study_design_scores_gemma":[0.000556556,0.0004166623,0.000251855,0.00072468875,0.00001707503,0.00004471361,0.000104735074,0.99460506,0.00022947676,0.000038093633,0.0024814026,0.00052970083],"about_ca_topic_score_codex":0.000116695854,"about_ca_topic_score_gemma":0.000020569641,"teacher_disagreement_score":0.8180432,"about_ca_system_score_codex":0.00041458223,"about_ca_system_score_gemma":0.0002518954,"threshold_uncertainty_score":0.9997949},"labels":[],"label_agreement":null},{"id":"W4400314708","doi":"10.1109/tmc.2024.3423399","title":"A Hierarchical Incentive Mechanism for Federated Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Beijing Municipality","keywords":"Computer science; Incentive; Mechanism (biology); Computer network; Distributed computing","score_opus":0.024439552802130414,"score_gpt":0.28901657292238775,"score_spread":0.26457702012025736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400314708","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009987676,0.00006867397,0.9818287,0.0021393355,0.001718849,0.0005283787,0.000017730004,0.0035958793,0.00011478528],"genre_scores_gemma":[0.8017847,0.000019792302,0.19782388,0.000094659605,0.000050064595,0.000113539674,0.000003864267,0.000026990949,0.00008248927],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980591,0.00010233114,0.0003061768,0.0008032616,0.00025589782,0.00047321318],"domain_scores_gemma":[0.9974087,0.0008943243,0.000051606494,0.0014688832,0.00010271365,0.00007379862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040713695,0.0002224901,0.00020641934,0.0003096018,0.0006869607,0.0005848331,0.004952878,0.000155213,0.000011014392],"category_scores_gemma":[0.00044409084,0.00022349169,0.0001486675,0.00078018656,0.000065794855,0.0004070037,0.00053081603,0.00088520534,0.0000576489],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025082094,0.00019841325,0.000002301124,0.0001532831,0.00017238999,0.000059581307,0.0005678175,0.024663994,0.0075006955,0.016396211,0.003896699,0.9463635],"study_design_scores_gemma":[0.00019995078,0.0002544757,0.0000013716619,0.00016699286,0.0000115665825,0.000020856132,0.00005243751,0.9137947,0.039415862,0.044923656,0.000936558,0.0002216007],"about_ca_topic_score_codex":0.00001149845,"about_ca_topic_score_gemma":0.00000387218,"teacher_disagreement_score":0.94614196,"about_ca_system_score_codex":0.00016052037,"about_ca_system_score_gemma":0.000095717405,"threshold_uncertainty_score":0.92037624},"labels":[],"label_agreement":null},{"id":"W4400447774","doi":"10.1109/tmc.2024.3415661","title":"Large Language Models (LLMs) Inference Offloading and Resource Allocation in Cloud-Edge Computing: An Active Inference Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Cloud Data Security Solutions","field":"Computer Science","cited_by":72,"is_retracted":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":"Computer science; Inference; Cloud computing; Resource allocation; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence; Computer network","score_opus":0.02912644320797005,"score_gpt":0.2995773100000774,"score_spread":0.2704508667921074,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400447774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24171157,0.0002188363,0.7562356,0.00007166824,0.00037595988,0.00043913638,0.000049638733,0.00058545446,0.00031211536],"genre_scores_gemma":[0.98380154,0.000025502355,0.015820164,0.00011663943,0.000107906075,0.000039820705,0.00003419103,0.00003346036,0.000020797543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970364,0.00028692547,0.00051771867,0.0011430685,0.00038036102,0.0006355492],"domain_scores_gemma":[0.9980529,0.00074050564,0.0000992418,0.0008209965,0.00008310599,0.00020326709],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080261636,0.0003498989,0.00033363444,0.000598254,0.00050208776,0.00057558256,0.0008459395,0.00017948513,0.0000059070508],"category_scores_gemma":[0.000025813097,0.00039102422,0.00008698919,0.0014920477,0.00009947527,0.0012981384,0.000063199914,0.00096525997,0.000019397901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016863218,0.0006679016,0.000028709226,0.00016011938,0.000047540718,0.000029554323,0.053278293,0.74792343,0.0014146589,0.0208437,0.000040415198,0.17554884],"study_design_scores_gemma":[0.00036183558,0.0001210037,0.00012981481,0.0002794228,0.00001704774,0.000033729673,0.0017584745,0.99471164,0.0014307733,0.0005829815,0.00017973974,0.0003935676],"about_ca_topic_score_codex":0.00016854236,"about_ca_topic_score_gemma":0.00016897098,"teacher_disagreement_score":0.7420899,"about_ca_system_score_codex":0.00024458882,"about_ca_system_score_gemma":0.00015966764,"threshold_uncertainty_score":0.99985415},"labels":[],"label_agreement":null},{"id":"W4400487859","doi":"10.1109/tmc.2024.3426046","title":"De-Anonymizing Avatars in Virtual Reality: Attacks and Countermeasures","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Malware Detection Techniques","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Virtual reality; Computer security; Human–computer interaction","score_opus":0.018249200687069537,"score_gpt":0.2963100311414671,"score_spread":0.27806083045439756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400487859","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04783137,0.00019118628,0.9497248,0.00009842509,0.0005834841,0.00023335333,0.000005095779,0.0011774842,0.00015482151],"genre_scores_gemma":[0.98539436,0.00006288262,0.014207475,0.00015778908,0.000040771483,0.000048127,3.7912332e-7,0.000022001908,0.00006622292],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985499,0.000085289925,0.00029905795,0.0005412006,0.00020706264,0.0003175108],"domain_scores_gemma":[0.99917775,0.00033763156,0.000039461025,0.00032787252,0.000039975068,0.00007730937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053792354,0.00017880296,0.00017892291,0.0003764325,0.00018826753,0.00030052118,0.00029406603,0.00009077432,0.000006401058],"category_scores_gemma":[0.000007960383,0.00019405203,0.00006485305,0.0005565484,0.00006320603,0.00048096923,0.000009868449,0.00048752123,0.000009853051],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009964142,0.000053740547,0.000023667712,0.000051995466,0.000018257302,0.00006904948,0.0011908478,0.1661631,0.0040042223,0.00070414005,0.000076154596,0.8276349],"study_design_scores_gemma":[0.00020930966,0.00027609486,0.00008869733,0.0004180607,0.000008747962,0.00017124362,0.00012526485,0.93918085,0.05532521,0.0011658032,0.0027035116,0.00032720118],"about_ca_topic_score_codex":0.000058395526,"about_ca_topic_score_gemma":0.000042638032,"teacher_disagreement_score":0.937563,"about_ca_system_score_codex":0.00021426998,"about_ca_system_score_gemma":0.00007278571,"threshold_uncertainty_score":0.7913212},"labels":[],"label_agreement":null},{"id":"W4401357717","doi":"10.1109/tmc.2024.3439099","title":"A Binary Structured Sparsity Approach for Multi-Anchor Direct Localization","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Structural Health Monitoring Techniques","field":"Engineering","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":"University of Toronto","funders":"University of Toronto","keywords":"Computer science; Binary number; Theoretical computer science; Algorithm; Arithmetic; Mathematics","score_opus":0.03448263951078525,"score_gpt":0.3037689634810982,"score_spread":0.269286323970313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401357717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05384342,0.00035867494,0.93972284,0.0000035432151,0.0023427089,0.0008729952,0.00004679623,0.0027234764,0.00008553852],"genre_scores_gemma":[0.9130394,0.000020990592,0.08643825,0.000011308052,0.0002152209,0.00015148669,0.000012479878,0.0000683042,0.000042539818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895364,0.000028759947,0.00025992372,0.00032863862,0.00012494388,0.00030409318],"domain_scores_gemma":[0.9995497,0.00010451863,0.000020183244,0.00020755526,0.000041790885,0.00007628516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012917834,0.00021547907,0.00020805809,0.00020359438,0.00024241272,0.000063420826,0.00013115282,0.00013956681,0.000010171037],"category_scores_gemma":[0.000002526571,0.00021965471,0.00011750813,0.0003607058,0.000026103158,0.00010552398,0.000001568869,0.00029884683,0.000005104079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010075817,0.000019122077,0.000007995701,0.00056491734,0.000036933565,0.0000017563268,0.00039933142,0.8712102,0.0011468802,0.0000081329445,0.00028540837,0.12630925],"study_design_scores_gemma":[0.00015550728,0.00008177136,0.00012795274,0.00012676069,0.000029295807,0.00000838215,0.00005635062,0.9707289,0.02788819,0.000020045525,0.0005658507,0.00021104157],"about_ca_topic_score_codex":0.000015926602,"about_ca_topic_score_gemma":0.0000025988277,"teacher_disagreement_score":0.859196,"about_ca_system_score_codex":0.00024709565,"about_ca_system_score_gemma":0.000020153646,"threshold_uncertainty_score":0.89572597},"labels":[],"label_agreement":null},{"id":"W4401567242","doi":"10.1109/tmc.2024.3442909","title":"Task Offloading and Trajectory Optimization for Secure Communications in Dynamic User Multi-UAV MEC Systems","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hunan Province; Natural Sciences and Engineering Research Council of Canada; Universidade de Macau; National Natural Science Foundation of China","keywords":"Computer science; Mobile edge computing; Markov decision process; Base station; Resource allocation; Robustness (evolution); Optimization problem; Trajectory optimization; Bidding; Distributed computing; Software deployment; Trajectory; Computer network; Markov process; Server","score_opus":0.012366648009519383,"score_gpt":0.2584067837113384,"score_spread":0.246040135701819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401567242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012450437,0.001724474,0.9837236,0.000023185157,0.00049212447,0.0009431636,0.000062029976,0.0005223897,0.000058599177],"genre_scores_gemma":[0.9359445,0.00048207436,0.062956005,0.000007966942,0.000023277094,0.00043522008,0.00003783376,0.000061306106,0.000051830553],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913216,0.00003367846,0.00032377033,0.0002487457,0.00007130137,0.00019036134],"domain_scores_gemma":[0.9993528,0.00023211067,0.000025778209,0.00029858778,0.00004391058,0.00004679726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017186055,0.00016306355,0.00016077164,0.00029341344,0.00021062205,0.00013533796,0.0001379142,0.00011065888,0.0000063100692],"category_scores_gemma":[0.0000019976762,0.00018582559,0.0000542392,0.00042727377,0.00003256728,0.00017159763,0.0000023269247,0.00024675124,0.0000046013424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022460306,0.000042536227,0.000004831775,0.00018782685,0.00002872169,3.4717286e-7,0.0005639674,0.98765796,0.00071447337,0.000087466484,0.000019195724,0.0106904255],"study_design_scores_gemma":[0.0002881066,0.000024140421,0.000019240979,0.00021769862,0.000033066462,0.000006532923,0.00026211195,0.9980662,0.00014354908,0.0000040468904,0.00075578416,0.00017951457],"about_ca_topic_score_codex":0.000025004796,"about_ca_topic_score_gemma":0.00008284746,"teacher_disagreement_score":0.92349404,"about_ca_system_score_codex":0.00018100247,"about_ca_system_score_gemma":0.000020576412,"threshold_uncertainty_score":0.7577748},"labels":[],"label_agreement":null},{"id":"W4401878764","doi":"10.1109/tmc.2024.3449645","title":"Cross-Modal Generative Semantic Communications for Mobile AIGC: Joint Semantic Encoding and Prompt Engineering","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Robotics and Automated Systems","field":"Engineering","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Info-communications Media Development Authority; National Natural Science Foundation of China; Singapore University of Technology and Design; Ministry of Education - Singapore; Ministry of Education, India; National Science Foundation","keywords":"Computer science; Joint (building); Encoding (memory); Modal; Semantic integration; Generative grammar; Semantic computing; Artificial intelligence; Semantic Web","score_opus":0.021769592912191292,"score_gpt":0.27314620341828094,"score_spread":0.25137661050608967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401878764","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20855203,0.0013167566,0.78692204,0.00001862204,0.0012254317,0.0008736604,0.00003529798,0.0009918754,0.000064277556],"genre_scores_gemma":[0.99105483,0.0001321609,0.008115847,0.000008407297,0.00012931797,0.00038010647,0.000008890738,0.00009285307,0.00007757242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987012,0.000026560228,0.0004618873,0.0003270211,0.00012830416,0.00035502628],"domain_scores_gemma":[0.9991336,0.0002981003,0.00003239044,0.00038874557,0.000058024954,0.000089173765],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002696538,0.00026852835,0.000300353,0.0002369083,0.00038716168,0.00037425535,0.00018048678,0.00010782781,0.000009493202],"category_scores_gemma":[0.0000038350377,0.00028003348,0.00013765327,0.00027815666,0.000049295377,0.00016114747,0.0000065178733,0.00036244153,0.000016851414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011962361,0.00002921979,0.0000047895064,0.00064156234,0.0001122875,0.000003936287,0.0010243348,0.95468706,0.033354845,0.000096389645,0.00002275985,0.010021638],"study_design_scores_gemma":[0.00019967291,0.000086475055,0.000023319559,0.0005800145,0.00004751638,0.000043388845,0.0001330155,0.9751465,0.022869486,0.000016252312,0.00056867715,0.000285687],"about_ca_topic_score_codex":0.00001187059,"about_ca_topic_score_gemma":0.000005922184,"teacher_disagreement_score":0.78250283,"about_ca_system_score_codex":0.00011306843,"about_ca_system_score_gemma":0.000024579214,"threshold_uncertainty_score":0.9999652},"labels":[],"label_agreement":null},{"id":"W4402039818","doi":"10.1109/tmc.2024.3452510","title":"Privacy-Preserving Gaze-Assisted Immersive Video Streaming","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","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":"McGill University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province","keywords":"Computer science; Gaze; Video streaming; Multimedia; Human–computer interaction; Computer vision; Computer network","score_opus":0.015226939448324942,"score_gpt":0.2603802102320453,"score_spread":0.24515327078372035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402039818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08567349,0.0016257734,0.9074811,0.00006345551,0.00079664926,0.00026212374,0.00001284598,0.0034446816,0.00063990516],"genre_scores_gemma":[0.98852247,0.00038099714,0.010805934,0.000014280634,0.000036336176,0.000077643665,0.000004184726,0.00008125901,0.000076882905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988047,0.000034379813,0.00033761832,0.00031346548,0.00016679184,0.0003430352],"domain_scores_gemma":[0.99861234,0.0004963574,0.000032105152,0.00075944717,0.000043615717,0.000056158664],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00010459032,0.00024456874,0.0002103065,0.00034179082,0.00025978268,0.00010701263,0.00057688635,0.00012974629,0.00006104657],"category_scores_gemma":[0.0000113158585,0.0002717391,0.00012881802,0.00067460554,0.00006229004,0.0002704604,0.000015031049,0.00071090925,0.00008584427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017806335,0.000019169933,0.0000023202474,0.00008857873,0.00005751814,0.000007560361,0.00033931324,0.6582919,0.018150281,0.00003762894,0.000087468004,0.32291648],"study_design_scores_gemma":[0.00015363623,0.000044519613,0.000049253806,0.00056069635,0.00002205296,0.000021602655,0.00096152455,0.8572186,0.1379072,0.00014823329,0.0025865636,0.00032605618],"about_ca_topic_score_codex":0.000011069794,"about_ca_topic_score_gemma":0.00000732003,"teacher_disagreement_score":0.902849,"about_ca_system_score_codex":0.00024171965,"about_ca_system_score_gemma":0.000020016756,"threshold_uncertainty_score":0.9999735},"labels":[],"label_agreement":null},{"id":"W4402568879","doi":"10.1109/tmc.2024.3462721","title":"FD MU-MIMO Systems: Performance Analysis in the Presence of Imperfect CSI and Non-Ideal Transceivers","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Lakehead University; Confederation College; Western University","funders":"","keywords":"Computer science; Imperfect; Transceiver; MIMO; Ideal (ethics); Telecommunications; Electronic engineering; Wireless; Beamforming; Engineering","score_opus":0.006216130444227058,"score_gpt":0.22407471296612957,"score_spread":0.21785858252190252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402568879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38421065,0.00060129404,0.614364,0.0000025844254,0.00026639114,0.00031133607,0.000009975811,0.00010220329,0.0001315625],"genre_scores_gemma":[0.9990971,0.0002539756,0.00052499736,0.0000023280975,0.000028738807,0.000053228337,0.0000020073664,0.00002335369,0.000014276328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902517,0.00005987882,0.00035021987,0.00022456255,0.00014467415,0.00019550238],"domain_scores_gemma":[0.9993976,0.00031399392,0.000030052004,0.00019966744,0.000028536697,0.00003015756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031429235,0.00015674974,0.00025048634,0.00038417673,0.00008794524,0.00005236097,0.00013348035,0.00006546053,0.0000041722637],"category_scores_gemma":[0.0000013843048,0.00013480554,0.00009494142,0.0011704891,0.000040228533,0.00019952068,6.031713e-7,0.00026227094,0.0000030521417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004767726,0.00001365741,0.00017521561,0.00046754951,0.000121693534,0.0000035221112,0.0024771215,0.98486125,0.0013361742,0.0000039755564,0.000004005645,0.01053106],"study_design_scores_gemma":[0.00014684738,0.000060593644,0.0003754594,0.0003078334,0.00013035486,0.0000114668155,0.0007851827,0.9958779,0.0021510904,7.144238e-7,0.000028212753,0.0001243167],"about_ca_topic_score_codex":0.000085482534,"about_ca_topic_score_gemma":0.000045328197,"teacher_disagreement_score":0.61488646,"about_ca_system_score_codex":0.00006883293,"about_ca_system_score_gemma":0.000014202721,"threshold_uncertainty_score":0.54972106},"labels":[],"label_agreement":null},{"id":"W4402570247","doi":"10.1109/tmc.2024.3461708","title":"LI2: A New Learning-Based Approach to Timely Monitoring of Points-of-Interest With UAV","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Target Tracking and Data Fusion in Sensor Networks","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":"Southeast University; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Point of interest; Human–computer interaction; Real-time computing; Artificial intelligence","score_opus":0.03987953474150036,"score_gpt":0.2704630004616543,"score_spread":0.23058346572015392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402570247","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055015504,0.000109139175,0.94305253,0.000057338388,0.00090136385,0.00022775546,0.0000051766824,0.0004140901,0.0002171088],"genre_scores_gemma":[0.828743,0.0000038068583,0.17098984,0.000018558052,0.00009812439,0.000009145579,0.0000014259247,0.000024955647,0.00011117032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841803,0.00008512705,0.00038749064,0.0005392224,0.00027889232,0.0002912379],"domain_scores_gemma":[0.99875474,0.0004122391,0.00009159548,0.0004901681,0.00009562542,0.00015563857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028051424,0.00020620275,0.00027507683,0.00032519945,0.00014500001,0.00013531958,0.0005654916,0.00007680962,0.000011546194],"category_scores_gemma":[0.000006546219,0.00018306974,0.00012734075,0.0009888129,0.000042486634,0.00016067203,0.000009987196,0.00049691857,0.000026388825],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027425202,0.00013820193,0.00005571845,0.000082543935,0.00003472807,0.000006207454,0.0007551534,0.8857018,0.00063472096,0.00019134131,0.00010647163,0.1122657],"study_design_scores_gemma":[0.00032941464,0.0006641262,0.00007445631,0.0010950671,0.000027516551,0.00002359966,0.00012796542,0.9547397,0.041381862,0.000027885935,0.0012465904,0.00026180735],"about_ca_topic_score_codex":0.00006160983,"about_ca_topic_score_gemma":0.0000023634022,"teacher_disagreement_score":0.7737275,"about_ca_system_score_codex":0.000041717878,"about_ca_system_score_gemma":0.00012449488,"threshold_uncertainty_score":0.74653673},"labels":[],"label_agreement":null},{"id":"W4402626816","doi":"10.1109/tmc.2024.3464512","title":"Knowledge-Aware Parameter Coaching for Communication-Efficient Personalized Federated Learning in Mobile Edge Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Recommender Systems and Techniques","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Coaching; Mobile computing; Edge computing; Mobile edge computing; Mobile telephony; Enhanced Data Rates for GSM Evolution; Multimedia; Mobile device; Computer network; Distributed computing; World Wide Web; Artificial intelligence; Mobile radio","score_opus":0.030426088110508648,"score_gpt":0.3143957564740178,"score_spread":0.2839696683635091,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402626816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037896562,0.0015704421,0.95614785,0.0001091639,0.0010974256,0.0013765835,0.0000062066397,0.0015151761,0.0002805927],"genre_scores_gemma":[0.97306997,0.000038834158,0.026141906,0.00007265398,0.00006757273,0.0003671975,0.00000862269,0.00005397692,0.0001792784],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972038,0.00048584322,0.0007343131,0.0007990101,0.00022447568,0.0005525439],"domain_scores_gemma":[0.9968209,0.002286547,0.00013869075,0.00049790216,0.0001506344,0.00010531704],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014364752,0.00034824814,0.00045025308,0.0005077239,0.0010252965,0.0008512393,0.00071227155,0.00016028841,0.000009516541],"category_scores_gemma":[0.000013488229,0.00035068157,0.00028306106,0.00091394916,0.00006367899,0.00025736535,0.000030300216,0.0009120289,0.000024223778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011766139,0.00037167233,0.000022845097,0.00026548436,0.00007347065,0.000008351436,0.00902725,0.44426233,0.00043753168,0.000852236,0.00023059666,0.54443645],"study_design_scores_gemma":[0.00044665465,0.0002184724,0.000012668594,0.00090095337,0.00001332001,0.000032474243,0.0007666202,0.9871493,0.0024702006,0.00007758367,0.007540981,0.00037074482],"about_ca_topic_score_codex":0.00008721435,"about_ca_topic_score_gemma":0.000037920283,"teacher_disagreement_score":0.9351734,"about_ca_system_score_codex":0.0003133856,"about_ca_system_score_gemma":0.00013889711,"threshold_uncertainty_score":0.9998945},"labels":[],"label_agreement":null},{"id":"W4402809523","doi":"10.1109/tmc.2024.3465591","title":"Multi-User Task Offloading in UAV-Assisted LEO Satellite Edge Computing: A Game-Theoretic Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Edge computing; Mobile edge computing; Enhanced Data Rates for GSM Evolution; Game theory; Distributed computing; Human–computer interaction; Server; Computer network; Artificial intelligence; Systems engineering","score_opus":0.02398179475272112,"score_gpt":0.2700767323897098,"score_spread":0.2460949376369887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402809523","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07301799,0.0009386487,0.9118638,0.00009851846,0.011006713,0.00071250397,0.0000015477673,0.001530947,0.0008293378],"genre_scores_gemma":[0.9302181,0.00003799257,0.06834244,0.00016557051,0.00078647153,0.000032940774,0.0000050626645,0.00008959842,0.00032179878],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952035,0.0003834216,0.0010531828,0.0016023184,0.0005294135,0.0012281543],"domain_scores_gemma":[0.9977088,0.0008430329,0.00016224995,0.00091553474,0.00011668901,0.0002537066],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013020855,0.0006398459,0.00064178905,0.0011121011,0.0005441114,0.0009235166,0.0012964623,0.0002714397,0.0000062827407],"category_scores_gemma":[0.000015154875,0.000657014,0.00040317283,0.002753926,0.00013768452,0.0005193116,0.000053800693,0.001394911,0.00020482537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028400427,0.0010286884,0.00015894338,0.0005712676,0.00015402962,0.00024404912,0.014186171,0.1904455,0.0052348445,0.0013826882,0.0002793072,0.7862861],"study_design_scores_gemma":[0.0007880539,0.00014281133,0.0006296574,0.0007643163,0.00003393893,0.00019740655,0.00017077311,0.98946226,0.002589953,0.00010166747,0.0043775034,0.0007416824],"about_ca_topic_score_codex":0.00005126759,"about_ca_topic_score_gemma":0.0000055679843,"teacher_disagreement_score":0.85720015,"about_ca_system_score_codex":0.00040232367,"about_ca_system_score_gemma":0.00018862181,"threshold_uncertainty_score":0.99958813},"labels":[],"label_agreement":null},{"id":"W4402978230","doi":"10.1109/tmc.2024.3470993","title":"Long-Term or Temporary? Hybrid Worker Recruitment for Mobile Crowd Sensing and Computing","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Western University","funders":"Aeronautical Science Foundation of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Term (time); Mobile computing; Crowd sourcing; Mobile telephony; Computer security; Computer network; World Wide Web; Mobile radio","score_opus":0.04354741402426556,"score_gpt":0.30814538540501735,"score_spread":0.2645979713807518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402978230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27230388,0.00078464445,0.72215754,0.00007414207,0.0021662049,0.001449817,0.000010263515,0.0009963467,0.000057158704],"genre_scores_gemma":[0.9638738,0.000047364687,0.03494672,0.00019514978,0.00033246962,0.00008498819,0.0000054681473,0.000088585344,0.0004254456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660176,0.00015716687,0.0007299048,0.0013348111,0.00036674074,0.0008096244],"domain_scores_gemma":[0.9973761,0.0013483724,0.00014670409,0.0007438337,0.00013068289,0.00025435115],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008971867,0.0005142115,0.0005063143,0.00040739696,0.0011228431,0.0012817578,0.00042132018,0.00013741049,0.000013967641],"category_scores_gemma":[0.0000108152935,0.00047038737,0.00028157825,0.00068459543,0.00012640872,0.00041295734,0.000031745898,0.0005775178,0.000026986823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037692105,0.00010754751,0.000039976494,0.00026847754,0.000110224755,0.0001817476,0.0012442555,0.078496136,0.0013952993,0.000034307144,0.00023590117,0.9178484],"study_design_scores_gemma":[0.000666213,0.0005634695,0.00006802223,0.0016406716,0.000072457835,0.0007696402,0.0002070851,0.9717882,0.021215042,0.000072653376,0.0022504448,0.00068605546],"about_ca_topic_score_codex":0.000029445619,"about_ca_topic_score_gemma":0.000013990965,"teacher_disagreement_score":0.91716236,"about_ca_system_score_codex":0.00019567201,"about_ca_system_score_gemma":0.00017525304,"threshold_uncertainty_score":0.99977475},"labels":[],"label_agreement":null},{"id":"W4402978271","doi":"10.1109/tmc.2024.3470831","title":"Joint Optimization of Data Acquisition and Trajectory Planning for UAV-Assisted Wireless Powered Internet of Things","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Wireless; Trajectory; Internet of Things; The Internet; Computer network; Real-time computing; Telecommunications; Computer security; World Wide Web; Engineering","score_opus":0.027750972139213015,"score_gpt":0.2645786008264033,"score_spread":0.23682762868719026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402978271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0672057,0.00033492263,0.9315302,0.000006071901,0.00024012613,0.000349706,0.00006764513,0.0002015419,0.00006411918],"genre_scores_gemma":[0.93260556,0.00005188294,0.06715257,0.000005747643,0.000021803125,0.000028803934,0.00009079613,0.00003206681,0.000010736399],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922746,0.000014802556,0.0003483948,0.00022028665,0.00008555079,0.0001034912],"domain_scores_gemma":[0.9995164,0.00012970483,0.000056080786,0.00021312569,0.000057129306,0.000027544207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017118391,0.00011252952,0.00017030523,0.00018493574,0.000052123767,0.000034706543,0.00010686669,0.00007259425,0.00001568867],"category_scores_gemma":[0.000001413319,0.00012253602,0.000044379674,0.000223056,0.000030156898,0.00025475255,0.0000030837455,0.000103896135,4.8240486e-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.000010879729,0.000033179513,0.0000019701988,0.00034535053,0.00005338807,2.472501e-7,0.0009180454,0.94026935,0.007951559,0.000024096358,0.00003872577,0.050353218],"study_design_scores_gemma":[0.00020710047,0.00006729234,0.00003409237,0.00037342648,0.000053721666,0.0000051076036,0.00016927966,0.9816724,0.01726887,0.000007843638,0.00003872788,0.000102115824],"about_ca_topic_score_codex":0.000012567464,"about_ca_topic_score_gemma":9.363236e-7,"teacher_disagreement_score":0.8653999,"about_ca_system_score_codex":0.000037360216,"about_ca_system_score_gemma":0.000015200034,"threshold_uncertainty_score":0.4996874},"labels":[],"label_agreement":null},{"id":"W4403052626","doi":"10.1109/tmc.2024.3472643","title":"Secure Localization for Underwater Wireless Sensor Networks via AUV Cooperative Beamforming With Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","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":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Computer science; Reinforcement learning; Beamforming; Underwater; Wireless sensor network; Wireless; Computer network; Acoustic sensor; Underwater acoustic communication; Computer security; Telecommunications; Artificial intelligence; Acoustics; Oceanography; Geology","score_opus":0.009653512937284581,"score_gpt":0.22327743163194522,"score_spread":0.21362391869466063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403052626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0135570085,0.00013922654,0.98450154,0.000018494835,0.00027592323,0.000658341,0.0000027104884,0.0007405057,0.0001062562],"genre_scores_gemma":[0.99684334,0.000049009206,0.0024168459,0.00003538238,0.00010453084,0.00016457618,0.000025841835,0.00008180747,0.0002786415],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989388,0.000046187684,0.00033612057,0.0002392771,0.00014274994,0.00029688678],"domain_scores_gemma":[0.9994861,0.00014685877,0.000033844386,0.00018295806,0.00008821768,0.000062026134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016652458,0.00022397371,0.00019681276,0.00011822409,0.00044525435,0.00019296231,0.00011474072,0.00009867176,0.000017670725],"category_scores_gemma":[1.6231944e-7,0.00019432447,0.00007864462,0.000286899,0.000029392777,0.00016711735,0.0000023773273,0.00036803057,0.000013267895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015392216,0.000013418524,0.000003350347,0.00015015561,0.00012035283,0.0000015668863,0.0016303457,0.9600712,0.0017747391,0.000015395313,0.000012600595,0.036191486],"study_design_scores_gemma":[0.00028913026,0.00020195889,4.3545975e-7,0.00038736383,0.000037723417,0.000020382618,0.0007394065,0.97007734,0.022244733,0.0000040548866,0.005750868,0.00024658543],"about_ca_topic_score_codex":0.000015862779,"about_ca_topic_score_gemma":0.000021171745,"teacher_disagreement_score":0.9832864,"about_ca_system_score_codex":0.00016190571,"about_ca_system_score_gemma":0.000018628025,"threshold_uncertainty_score":0.7924322},"labels":[],"label_agreement":null},{"id":"W4403420284","doi":"10.1109/tmc.2024.3481276","title":"Deep Reinforcement Learning-Based Joint Caching and Routing in AI-Driven Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Caching and Content Delivery","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National Research Foundation Singapore","keywords":"Computer science; Reinforcement learning; Joint (building); Routing (electronic design automation); Computer network; Artificial intelligence; Distributed computing","score_opus":0.012709366229248538,"score_gpt":0.23611230977656303,"score_spread":0.2234029435473145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403420284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040622674,0.00024384189,0.9572735,0.0001787938,0.0008779932,0.00022369785,1.8944442e-7,0.0004914069,0.00008794843],"genre_scores_gemma":[0.99854213,0.000019885883,0.000994188,0.0002783358,0.00006802042,0.000022339931,0.0000012830812,0.000020757681,0.000053078358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983332,0.00013857335,0.00038413174,0.0005361217,0.00021714893,0.00039079256],"domain_scores_gemma":[0.9992736,0.0003016327,0.000055568853,0.00025191152,0.00002711251,0.00009020535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005031686,0.00020770865,0.00021188588,0.00033125572,0.00039146998,0.000433884,0.00023212445,0.000079437916,0.000005820892],"category_scores_gemma":[0.0000052373525,0.00021413788,0.00012232293,0.0004525226,0.000029632456,0.00027089132,0.000012215317,0.0009647393,0.0000110361025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044151907,0.000025898356,0.00005999817,0.000025417074,0.000015769445,0.00003657131,0.00058833184,0.90715796,0.00017789184,0.00019916135,0.000004347203,0.09170424],"study_design_scores_gemma":[0.00029117032,0.00015451212,0.00006129066,0.00045951954,0.00001141892,0.000020800851,0.000072221854,0.99837476,0.00026664956,0.000014992851,0.000049019396,0.00022361905],"about_ca_topic_score_codex":0.00019317208,"about_ca_topic_score_gemma":0.000047865582,"teacher_disagreement_score":0.9579194,"about_ca_system_score_codex":0.00015700221,"about_ca_system_score_gemma":0.000054105265,"threshold_uncertainty_score":0.8732289},"labels":[],"label_agreement":null},{"id":"W4403826584","doi":"10.1109/tmc.2024.3487175","title":"MANSY: Generalizing Neural Adaptive Immersive Video Streaming With Ensemble and Representation Learning","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","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":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Multimedia; Video streaming; Representation (politics); Streaming data; Artificial intelligence; Human–computer interaction; Computer network; Data mining","score_opus":0.026361263789720566,"score_gpt":0.2990375361200079,"score_spread":0.2726762723302873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403826584","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1261022,0.00023534271,0.87245524,0.0001596746,0.0003606089,0.0002306247,0.0000012919223,0.0002519604,0.00020308864],"genre_scores_gemma":[0.97389346,0.000028348348,0.02570643,0.00009232247,0.00007177899,0.000027491396,0.0000016422879,0.00002144201,0.00015706538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983665,0.0001866267,0.00024505283,0.0006217098,0.00027128108,0.00030885436],"domain_scores_gemma":[0.99914885,0.00039679202,0.000067861525,0.00023705918,0.0000690528,0.00008038589],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002389128,0.00019762847,0.0001802176,0.0002050594,0.00050174515,0.0004722682,0.00017871296,0.00004780822,0.0000056217987],"category_scores_gemma":[0.0000025277252,0.00018462972,0.00007333434,0.00048298697,0.00004729187,0.0007452011,0.000010078077,0.00042960417,0.00001097783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019575244,0.00004727328,0.00003523565,0.000053342967,0.00009023323,0.00010938459,0.0056378264,0.53031886,0.0079596,0.000862386,0.00002172825,0.45484456],"study_design_scores_gemma":[0.00025893713,0.00041219918,0.00009731664,0.00020967548,0.00003401866,0.00009408012,0.002514801,0.96428,0.03168406,0.00007846971,0.00009668079,0.00023973957],"about_ca_topic_score_codex":0.00016862813,"about_ca_topic_score_gemma":0.000017933653,"teacher_disagreement_score":0.84779125,"about_ca_system_score_codex":0.000089097644,"about_ca_system_score_gemma":0.000054186763,"threshold_uncertainty_score":0.75289816},"labels":[],"label_agreement":null},{"id":"W4403826586","doi":"10.1109/tmc.2024.3486689","title":"Defending Data Poisoning Attacks in DP-Based Crowdsensing: A Game-Theoretic Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Spam and Phishing Detection","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Crowdsensing; Computer security; Game theory; Computer network","score_opus":0.03899618105861772,"score_gpt":0.2929222057781125,"score_spread":0.25392602471949477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403826586","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048818104,0.00022378076,0.9472565,0.00010751937,0.001997417,0.0002854957,0.0000063699317,0.0008496112,0.00045520856],"genre_scores_gemma":[0.9652203,0.0000066328266,0.034468472,0.00010090693,0.00011929514,0.000016212633,0.000006739413,0.000036931644,0.000024535517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763054,0.00018552902,0.0003946697,0.001006194,0.00032515274,0.0004579061],"domain_scores_gemma":[0.99815345,0.0006172216,0.000062564584,0.001036763,0.00003501887,0.00009499998],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009383676,0.00025255396,0.00023281747,0.00062309863,0.00028768936,0.00070934655,0.00094013667,0.0001230705,0.000009798598],"category_scores_gemma":[0.000016315678,0.0002645896,0.000110265864,0.0015059846,0.000063919964,0.00058811286,0.000019334842,0.0007401707,0.000042366057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011710358,0.00013605136,0.000029336488,0.00012420256,0.000025264138,0.0000501025,0.0014390093,0.7684936,0.0011188324,0.0006905144,0.000053176405,0.2278282],"study_design_scores_gemma":[0.00026287543,0.00008911192,0.00004453503,0.0003785649,0.000018269973,0.00007012893,0.00008148342,0.99428725,0.0039508045,0.00019201564,0.00034404008,0.000280902],"about_ca_topic_score_codex":0.000065895205,"about_ca_topic_score_gemma":0.00001580343,"teacher_disagreement_score":0.91640216,"about_ca_system_score_codex":0.00018297705,"about_ca_system_score_gemma":0.00011815006,"threshold_uncertainty_score":0.9999806},"labels":[],"label_agreement":null},{"id":"W4404787749","doi":"10.1109/tmc.2024.3507051","title":"QoS-Driven Contextual MAB for MPQUIC Supporting Video Streaming in Mobile Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Video Coding and Compression Technologies","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Quality of service; Computer network; Video streaming; Mobile computing; Mobile QoS; Multimedia; Service provider; Service (business)","score_opus":0.018668472399198333,"score_gpt":0.2909358073951642,"score_spread":0.2722673349959659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404787749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07307938,0.0007535572,0.92131627,0.00012192628,0.0021654856,0.00072108523,0.000008238843,0.0017613422,0.00007272061],"genre_scores_gemma":[0.9877679,0.000055716373,0.011398543,0.0000760543,0.00013297377,0.0004213616,0.0000024259778,0.00003671597,0.00010832901],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974936,0.000080064434,0.0006417112,0.0008567833,0.00024141668,0.000686408],"domain_scores_gemma":[0.99813306,0.001044609,0.000118580996,0.0005608188,0.00005746001,0.00008545916],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004927068,0.000302574,0.00036019896,0.00048344338,0.00040432383,0.00041364008,0.0008841739,0.00019111807,0.000018329856],"category_scores_gemma":[0.000015103191,0.00029691617,0.00023591696,0.00085862103,0.00006627898,0.00039089675,0.000028379998,0.00066262047,0.000019942367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006873327,0.0000691543,0.00001561206,0.000042628522,0.000019886842,0.000021156631,0.00040149415,0.4914674,0.00050961913,0.0005846657,0.00016931981,0.50669223],"study_design_scores_gemma":[0.00040955102,0.000362382,0.000016018344,0.000594014,0.000013567272,0.000028275117,0.00049471983,0.9870891,0.008918153,0.00043330557,0.001314049,0.00032685653],"about_ca_topic_score_codex":0.000024070589,"about_ca_topic_score_gemma":0.00002221153,"teacher_disagreement_score":0.9146885,"about_ca_system_score_codex":0.00015237836,"about_ca_system_score_gemma":0.00008889087,"threshold_uncertainty_score":0.9999483},"labels":[],"label_agreement":null},{"id":"W4404788100","doi":"10.1109/tmc.2024.3507035","title":"HearLoc: Locating Unknown Sound Sources in 3D With a Small-Sized Microphone Array","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Speech and Audio Processing","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":"National Natural Science Foundation of China","keywords":"Computer science; Microphone array; Sound (geography); Microphone; Speech recognition; Acoustics; Telecommunications; Sound pressure","score_opus":0.014054655585145327,"score_gpt":0.24058046981448242,"score_spread":0.2265258142293371,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404788100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31558132,0.00055909273,0.6825334,0.00012222548,0.00045037924,0.00019479915,9.660748e-7,0.0004249656,0.0001329083],"genre_scores_gemma":[0.79662573,0.000010652111,0.20296854,0.00013065663,0.00008706711,0.000029936284,5.0176703e-7,0.00002979597,0.00011714457],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9980112,0.00008259518,0.00038473037,0.0007311968,0.0002574699,0.0005328207],"domain_scores_gemma":[0.99903995,0.00034569926,0.000074306125,0.00036952613,0.00006272491,0.000107798405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003960556,0.00027655272,0.00028334605,0.00037741088,0.0003904865,0.00070614996,0.00048360083,0.00008330308,0.000013676173],"category_scores_gemma":[0.000004465414,0.0002443599,0.00009228154,0.0014898636,0.000080457365,0.0003249522,0.0000065463205,0.0005949541,0.000058674897],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028321894,0.00021000135,0.00009337198,0.00021962568,0.000061435014,0.00011738813,0.0051669097,0.3195335,0.076485515,0.0000135181335,0.000011329497,0.59805906],"study_design_scores_gemma":[0.0011358601,0.00042597132,0.00006249395,0.001941544,0.000030774394,0.0003073692,0.0005471663,0.20087133,0.792637,0.00024846534,0.0010122148,0.0007798309],"about_ca_topic_score_codex":0.000079792735,"about_ca_topic_score_gemma":0.00014387755,"teacher_disagreement_score":0.7161515,"about_ca_system_score_codex":0.00012896967,"about_ca_system_score_gemma":0.00021066844,"threshold_uncertainty_score":0.99647075},"labels":[],"label_agreement":null},{"id":"W4404809472","doi":"10.1109/tmc.2024.3508260","title":"Incentive Mechanism Design for Cross-Device Federated Learning: A Reinforcement Auction Approach","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Incentive; Mechanism design; Mechanism (biology); Double auction; Incentive compatibility; Computer security; Common value auction; Artificial intelligence; Microeconomics","score_opus":0.02566485237195155,"score_gpt":0.28531135585152273,"score_spread":0.2596465034795712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404809472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047460054,0.0000888466,0.9913244,0.00013532372,0.00065070746,0.00130327,0.0000029352398,0.0016285332,0.00011995245],"genre_scores_gemma":[0.91973156,0.000016202777,0.07916916,0.000059301812,0.000046766163,0.00065500947,0.000004560113,0.000022428023,0.00029503411],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983191,0.00008606102,0.00034668864,0.0007051409,0.0001876197,0.0003554263],"domain_scores_gemma":[0.99909073,0.00027613208,0.00008337533,0.00033124795,0.00015889056,0.000059613852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612914,0.00021646387,0.00018674556,0.0002692748,0.0011134127,0.00044672115,0.0004294353,0.0001939624,0.000006685939],"category_scores_gemma":[0.000005711673,0.00022151877,0.00013513831,0.000841214,0.00006277219,0.0002450585,0.000010304357,0.0005449047,0.000031775413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001638147,0.00016162852,5.2704246e-7,0.0000726052,0.00008063333,0.0000021984397,0.000842878,0.8580013,0.0015570496,0.023418572,0.000058421225,0.1157878],"study_design_scores_gemma":[0.00026740917,0.00028762795,0.0000018917194,0.00004354905,0.000018341116,0.000019015364,0.000098405006,0.94819695,0.04720789,0.0024576187,0.0011895284,0.00021178307],"about_ca_topic_score_codex":0.000013419294,"about_ca_topic_score_gemma":0.0000010561142,"teacher_disagreement_score":0.91498554,"about_ca_system_score_codex":0.00016919347,"about_ca_system_score_gemma":0.00008832428,"threshold_uncertainty_score":0.90332735},"labels":[],"label_agreement":null},{"id":"W4405178998","doi":"10.1109/tmc.2024.3514173","title":"Service Function Chain Deployment With VNF-Dependent Software Migration in Multi-Domain Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Info-communications Media Development Authority; National Natural Science Foundation of China; Ministry of Education - Singapore; National Research Foundation Singapore","keywords":"Computer science; Software deployment; Computer network; Service (business); Function (biology); Domain (mathematical analysis); Distributed computing; Software engineering; Business","score_opus":0.015382851257527015,"score_gpt":0.23651939773821665,"score_spread":0.22113654648068964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405178998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056727014,0.0005586343,0.938999,0.00025840048,0.0017076746,0.00058573566,0.0000033740484,0.0011521353,0.000008038061],"genre_scores_gemma":[0.9630055,0.000045327724,0.036078695,0.00047505944,0.00012711916,0.00016035374,0.000006255664,0.00004888339,0.0000528273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777436,0.0001399911,0.00041821608,0.00080422335,0.00036694814,0.00049627025],"domain_scores_gemma":[0.9989705,0.00034759496,0.00007488396,0.0004225915,0.00006876706,0.00011563198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045763614,0.00031663335,0.00024335936,0.00032341888,0.00029894014,0.00034354386,0.00034985182,0.000145483,0.000013952776],"category_scores_gemma":[0.0000017687538,0.00028788252,0.00009720246,0.0014531267,0.000022555436,0.00041084233,0.000010727288,0.00060437445,0.00004322538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002994851,0.00016553192,0.00021504346,0.000037968104,0.000035671692,0.00003804006,0.0006469559,0.8338328,0.000037518726,0.00007314248,0.00004027478,0.16484709],"study_design_scores_gemma":[0.00066485704,0.00032040974,0.0005378045,0.00042926177,0.000021900067,0.00004325455,0.00012967698,0.99679327,0.00022131951,0.000080863465,0.00041841384,0.00033895555],"about_ca_topic_score_codex":0.00026381086,"about_ca_topic_score_gemma":0.0022701193,"teacher_disagreement_score":0.9062785,"about_ca_system_score_codex":0.00023851708,"about_ca_system_score_gemma":0.00008353467,"threshold_uncertainty_score":0.9999573},"labels":[],"label_agreement":null},{"id":"W4405179107","doi":"10.1109/tmc.2024.3514214","title":"Joint Encoding and Enhancement for Low-Light Video Analytics in Mobile Edge Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Analytics; Encoding (memory); Enhanced Data Rates for GSM Evolution; Mobile telephony; Computer network; Telecommunications; Artificial intelligence; Mobile radio; Data science","score_opus":0.027309099170652048,"score_gpt":0.30751356645251854,"score_spread":0.2802044672818665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405179107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01726965,0.00088758854,0.97910964,0.00022682096,0.001441456,0.00076005346,0.0000034767636,0.00019103398,0.00011027415],"genre_scores_gemma":[0.9842436,0.00015282039,0.014881051,0.00021221372,0.00013059373,0.0002321754,0.0000016118531,0.000019930176,0.00012600512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807423,0.00008310127,0.0005490864,0.0006412757,0.00020892355,0.00044337814],"domain_scores_gemma":[0.9989988,0.00043280757,0.00006683876,0.00035832697,0.000048817357,0.00009436214],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007924996,0.00022264058,0.00029102247,0.00029810244,0.00026126357,0.000429137,0.00027163353,0.000083794344,0.00001222516],"category_scores_gemma":[0.0000035275702,0.00022246767,0.00014066472,0.0005693164,0.000032011903,0.0003717386,0.000014221664,0.0003441856,0.000010406271],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010004623,0.0002931353,0.000006047286,0.00030782592,0.00006607758,0.00002987645,0.002553362,0.53730017,0.0035544126,0.0012458197,0.00023859924,0.45439467],"study_design_scores_gemma":[0.00031411293,0.00028243707,0.000011377454,0.0004512827,0.000019866462,0.000010040211,0.00015867339,0.9654022,0.031106085,0.00020626008,0.0017866662,0.0002510131],"about_ca_topic_score_codex":0.000015881544,"about_ca_topic_score_gemma":0.000017685235,"teacher_disagreement_score":0.96697396,"about_ca_system_score_codex":0.00019553101,"about_ca_system_score_gemma":0.00008336113,"threshold_uncertainty_score":0.9071968},"labels":[],"label_agreement":null},{"id":"W4405784836","doi":"10.1109/tmc.2024.3521934","title":"Reliability-Optimal UAV-Assisted Mobile Edge Computing: Joint Resource Allocation, Data Transmission Scheduling and Motion Control","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","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 Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Mobile edge computing; Reliability (semiconductor); Distributed computing; Resource allocation; Mobile computing; Dynamic priority scheduling; Data transmission; Computer network; Real-time computing; Server; Quality of service; Mathematical optimization","score_opus":0.02743418996179658,"score_gpt":0.2722467677498975,"score_spread":0.2448125777881009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405784836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08691447,0.0008791475,0.90507805,0.00042506328,0.0042204866,0.0009283144,0.0000063989405,0.0014464768,0.00010156168],"genre_scores_gemma":[0.9255533,0.000028264274,0.073131815,0.00019132617,0.00091203087,0.000027586144,0.000026362244,0.00006421579,0.000065046326],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952814,0.00041218408,0.0010609325,0.0018819111,0.0005837147,0.0007798388],"domain_scores_gemma":[0.99684614,0.0009529197,0.00018819442,0.0014860869,0.00020980289,0.00031686344],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021593198,0.0005291279,0.0005512243,0.000487056,0.0012414734,0.0009059278,0.0012068244,0.0002533932,0.000008034392],"category_scores_gemma":[0.000023217144,0.00052660046,0.00021217985,0.0011309638,0.00015656478,0.0008971073,0.00006950553,0.0010580677,0.000049311475],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016192562,0.00021552139,0.000009486536,0.00020723049,0.000060657167,0.00001829811,0.0017317946,0.37919667,0.003370405,0.000049924183,0.0003642213,0.61475956],"study_design_scores_gemma":[0.0007751583,0.0002500574,0.00019368103,0.00064944697,0.00007746561,0.00013451846,0.00015575114,0.98208517,0.003256142,0.00007116398,0.011818755,0.00053271645],"about_ca_topic_score_codex":0.00004104854,"about_ca_topic_score_gemma":9.1592966e-7,"teacher_disagreement_score":0.8386389,"about_ca_system_score_codex":0.00021122163,"about_ca_system_score_gemma":0.00019260029,"threshold_uncertainty_score":0.99971855},"labels":[],"label_agreement":null},{"id":"W4405812078","doi":"10.1109/tmc.2024.3522207","title":"Resource Allocation for the Uplink of a Multi-User Massive MIMO System","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications link; MIMO; Computer network; Resource allocation; Multi-user MIMO; Channel (broadcasting)","score_opus":0.01311476158237268,"score_gpt":0.24814977630535676,"score_spread":0.23503501472298408,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405812078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011571575,0.0007190545,0.99511147,0.00002109051,0.0012036827,0.0010178296,0.000022005614,0.00067999813,0.00006774289],"genre_scores_gemma":[0.9838773,0.00001602626,0.015478092,0.000005380418,0.000092056085,0.000247102,0.000004424573,0.00006497056,0.00021465129],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991764,0.000024789928,0.00034431188,0.0001978123,0.00008771534,0.00016898259],"domain_scores_gemma":[0.9991042,0.0005035139,0.000045809084,0.00024143487,0.0000755449,0.00002946742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018779418,0.0001451117,0.00015800913,0.00011933989,0.00015059038,0.000036930178,0.0001237967,0.000066642475,0.0000033573815],"category_scores_gemma":[0.0000038882235,0.00012382827,0.000112993635,0.000289077,0.000023688015,0.00008442371,0.0000010036492,0.0001687581,0.000011402253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006028766,0.000013465554,3.2787148e-7,0.00055016275,0.00007278286,7.401193e-7,0.0006583768,0.96884865,0.002796999,0.00015491858,0.00006201868,0.026835548],"study_design_scores_gemma":[0.00022075002,0.00003494039,0.00000126039,0.00046203588,0.000054505606,0.0000075328203,0.0008244608,0.9776068,0.018989319,0.0000013885001,0.0016843769,0.00011264265],"about_ca_topic_score_codex":0.0000068879262,"about_ca_topic_score_gemma":0.0000048468164,"teacher_disagreement_score":0.98272014,"about_ca_system_score_codex":0.00015638456,"about_ca_system_score_gemma":0.000016393386,"threshold_uncertainty_score":0.504957},"labels":[],"label_agreement":null},{"id":"W4406028367","doi":"10.1109/tmc.2025.3525477","title":"Multi-Task Semantic Communication With Graph Attention-Based Feature Correlation Extraction","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Graph Neural Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Computer science; Correlation; Feature extraction; Graph; Task (project management); Artificial intelligence; Feature (linguistics); Semantic feature; Natural language processing; Pattern recognition (psychology); Theoretical computer science","score_opus":0.009291780807133998,"score_gpt":0.2653748857324918,"score_spread":0.2560831049253578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406028367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017821968,0.00020730142,0.9794553,0.0003823813,0.00080547866,0.0006592639,0.0000026321736,0.00060218753,0.00006349924],"genre_scores_gemma":[0.85102963,0.000028532828,0.14838216,0.00024555248,0.000014070611,0.000068966285,0.000009612651,0.000017491093,0.00020394922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983382,0.00019570928,0.0003192707,0.000568082,0.00026640957,0.00031230916],"domain_scores_gemma":[0.9981905,0.00046695757,0.0001856569,0.00089555036,0.0001929388,0.000068386486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021196206,0.00026344674,0.0002158832,0.0004398909,0.0008754242,0.00015748023,0.0005512143,0.00014763103,0.0000033101257],"category_scores_gemma":[0.0000038713856,0.00025518794,0.00014541962,0.0016367767,0.00008954779,0.00052868586,0.000006073544,0.00072092697,0.000013975682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027915185,0.00021776819,0.00023183174,0.000022907288,0.00003216578,0.0000033845752,0.0000725069,0.89673805,0.0013676493,0.00016100083,0.000049871232,0.10107496],"study_design_scores_gemma":[0.00093520246,0.00012726025,0.0028155586,0.00035447476,0.00004109069,0.000012944497,0.000047751433,0.99307406,0.0020594343,0.00013915545,0.00014232923,0.00025071396],"about_ca_topic_score_codex":0.00002544283,"about_ca_topic_score_gemma":0.000092218164,"teacher_disagreement_score":0.83320767,"about_ca_system_score_codex":0.00011592798,"about_ca_system_score_gemma":0.000062286585,"threshold_uncertainty_score":0.99999005},"labels":[],"label_agreement":null},{"id":"W4406110370","doi":"10.1109/tmc.2025.3526573","title":"FastTuner: Fast Resolution and Model Tuning for Multi-Object Tracking in Edge Video Analytics","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Video Surveillance and Tracking Methods","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":"McMaster University","funders":"China Scholarship Council","keywords":"Computer science; Analytics; Video tracking; Enhanced Data Rates for GSM Evolution; Tracking (education); Object (grammar); Computer vision; Artificial intelligence; Data mining","score_opus":0.05133420868989664,"score_gpt":0.3437616184360394,"score_spread":0.2924274097461428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406110370","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029763386,0.00015933276,0.96863174,0.000089644964,0.00057370885,0.0004633291,0.000006552304,0.0002164545,0.0000958699],"genre_scores_gemma":[0.7351813,0.000025985839,0.26451686,0.00011744769,0.000022102224,0.000040990464,9.340092e-7,0.00001343317,0.000080965896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981362,0.00015875575,0.00047063158,0.00063940417,0.00015410423,0.0004408567],"domain_scores_gemma":[0.99863803,0.00067440537,0.000104153325,0.00040119377,0.00011747105,0.00006471798],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011775625,0.00022765958,0.00033107653,0.0005521102,0.0004583017,0.00019545357,0.00036237182,0.00012289852,5.617783e-7],"category_scores_gemma":[0.000036134785,0.00024966904,0.00013045988,0.0008576336,0.000052657448,0.0003425151,0.000011947168,0.00038052624,0.0000012799829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013613773,0.00009234153,0.00021142293,0.000047497477,0.000019288953,0.0000020686577,0.00060920266,0.6941706,0.0016805654,0.00030822496,0.0000073386195,0.30283782],"study_design_scores_gemma":[0.00094912376,0.00007068786,0.0005992626,0.00023341908,0.000015952892,0.0000053002063,0.00010510708,0.9928175,0.004538191,0.00038214368,0.000062471976,0.00022082354],"about_ca_topic_score_codex":0.00003217839,"about_ca_topic_score_gemma":0.00013620518,"teacher_disagreement_score":0.7054179,"about_ca_system_score_codex":0.00012786548,"about_ca_system_score_gemma":0.00010861463,"threshold_uncertainty_score":0.9999955},"labels":[],"label_agreement":null},{"id":"W4406457489","doi":"10.1109/tmc.2025.3530486","title":"Intelligent End-to-End Deterministic Scheduling Across Converged Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; End-to-end principle; Scheduling (production processes); Computer network; Distributed computing; Processor scheduling; Mathematical optimization","score_opus":0.017273020686504433,"score_gpt":0.29384679014102344,"score_spread":0.276573769454519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406457489","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057643835,0.00010928534,0.9349886,0.0001201986,0.005641031,0.0005307318,0.0000113641745,0.00061968266,0.000335284],"genre_scores_gemma":[0.9873158,0.000007842516,0.011580951,0.0005276471,0.00013594232,0.000050410807,0.000004076971,0.000020941763,0.00035640638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970839,0.0001970213,0.000726239,0.00086461776,0.00032084333,0.0008073919],"domain_scores_gemma":[0.99793357,0.0007018584,0.00015001814,0.00085333356,0.00013716439,0.00022406061],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00075107615,0.00036217296,0.00043225443,0.00023088006,0.00090996316,0.00047593215,0.0012482387,0.00015536186,0.000021524946],"category_scores_gemma":[0.000015773205,0.00038605527,0.00023479585,0.0013205692,0.000085911204,0.00014441887,0.00003833903,0.00057269423,0.00014731262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012372188,0.00010983334,0.000032377775,0.000033026114,0.00005507114,0.000015398447,0.0007885439,0.82978845,0.00010630925,0.00048169217,0.00006963892,0.16850732],"study_design_scores_gemma":[0.00036553483,0.00016077973,0.000082580744,0.0003806735,0.000017627246,0.000021462674,0.00018015134,0.9933826,0.002518452,0.000075329386,0.0024470268,0.00036783388],"about_ca_topic_score_codex":0.00004987784,"about_ca_topic_score_gemma":0.000015538873,"teacher_disagreement_score":0.92967194,"about_ca_system_score_codex":0.00017527633,"about_ca_system_score_gemma":0.00013173063,"threshold_uncertainty_score":0.99985915},"labels":[],"label_agreement":null},{"id":"W4406890314","doi":"10.1109/tmc.2025.3535567","title":"MWRS: A MAB-Based Worker Recruitment Scheme With Tripartite Stackelberg Game for Reliable Mobile Crowdsensing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Evacuation and Crowd Dynamics","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Stackelberg competition; Crowdsensing; Computer science; Scheme (mathematics); Computer network; Computer security; Mathematics","score_opus":0.020245198762132318,"score_gpt":0.2787440308393798,"score_spread":0.2584988320772475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406890314","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15797406,0.00015279696,0.83842444,0.000033141903,0.00064075546,0.0015471876,0.000019617957,0.00061324803,0.00059474824],"genre_scores_gemma":[0.9686168,0.000019592664,0.02967634,0.00019247412,0.00004219958,0.0007166622,0.000014410687,0.000069097165,0.0006524419],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855554,0.000029875857,0.00042356603,0.0003617464,0.00018693341,0.0004423534],"domain_scores_gemma":[0.9990593,0.00026836587,0.00005918143,0.00038192715,0.000141232,0.00008998209],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023743001,0.00028624697,0.00029487791,0.00056072004,0.00026410897,0.00011176959,0.00012548428,0.0001268378,0.000054586],"category_scores_gemma":[0.0000035325033,0.00029073696,0.00014709435,0.0013462657,0.0000446378,0.00010597958,0.0000015443401,0.00031395603,0.00002023332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009116276,0.000124489,0.000022401866,0.00012242133,0.00009290747,0.0000020395478,0.00015883328,0.95306337,0.0015116832,0.000046890607,0.00026114515,0.044502635],"study_design_scores_gemma":[0.0016771507,0.00019916333,0.000020516989,0.00047202842,0.000068303685,0.0000024124545,0.00023595645,0.9635738,0.024380125,0.000036175577,0.0090332385,0.00030114022],"about_ca_topic_score_codex":0.000008810143,"about_ca_topic_score_gemma":0.00004297929,"teacher_disagreement_score":0.8106427,"about_ca_system_score_codex":0.00029416083,"about_ca_system_score_gemma":0.000097690034,"threshold_uncertainty_score":0.99995446},"labels":[],"label_agreement":null},{"id":"W4407354563","doi":"10.1109/tmc.2025.3541191","title":"Optimizing Federated Semantic Learning in Distributed AIGC-Enabled Human Digital Twins: A Multi-Criteria and Multi-Shard User Selection Framework","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Education - Singapore","keywords":"Computer science; Selection (genetic algorithm); Distributed learning; Distributed computing; Human–computer interaction; Artificial intelligence","score_opus":0.02530336937577078,"score_gpt":0.3048579214552302,"score_spread":0.27955455207945945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407354563","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18026571,0.0000654565,0.8168641,0.00037757217,0.00038882694,0.00047101016,0.00001562792,0.0015411011,0.00001063016],"genre_scores_gemma":[0.7722191,0.000012411423,0.22756772,0.000053257252,0.000012706642,0.000051803734,0.000013969203,0.000022151902,0.00004686206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744916,0.00017649127,0.00057746214,0.0009799886,0.00020542176,0.0006114479],"domain_scores_gemma":[0.99785835,0.00045293692,0.00015116227,0.0013399542,0.00012275495,0.00007483995],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004018062,0.00035452595,0.00040096947,0.0005942646,0.0010035569,0.0011707621,0.0029988824,0.0002970698,0.0000075576186],"category_scores_gemma":[0.00092721183,0.00039903054,0.00008526089,0.0018255443,0.00009834339,0.0009616368,0.00084427325,0.0013581131,0.000008426686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010030169,0.0024331317,0.010808798,0.0005016159,0.00041807935,0.00013167273,0.00196188,0.77323586,0.027703498,0.00021583843,0.0013328709,0.18115649],"study_design_scores_gemma":[0.0011049696,0.00011003066,0.0009978476,0.00071038865,0.00001461275,0.000014839433,0.00020328541,0.9887884,0.0070669577,0.000527929,0.00010192967,0.00035879668],"about_ca_topic_score_codex":0.000089252135,"about_ca_topic_score_gemma":0.0000585181,"teacher_disagreement_score":0.5919534,"about_ca_system_score_codex":0.00027795258,"about_ca_system_score_gemma":0.000069841924,"threshold_uncertainty_score":0.9998661},"labels":[],"label_agreement":null},{"id":"W4407449107","doi":"10.1109/tmc.2025.3541575","title":"3D Cooperative Positioning via RIS and Sidelink Communications With Zero Access Points","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","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 Toronto","funders":"","keywords":"Computer science; Computer network; Telecommunications","score_opus":0.010232029976379552,"score_gpt":0.2616984447516208,"score_spread":0.25146641477524123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407449107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03464275,0.0001636948,0.96252966,0.00010337988,0.00017270194,0.00029342677,0.000010267078,0.00063218566,0.001451924],"genre_scores_gemma":[0.98919636,0.00012888206,0.0103873545,0.00014857999,0.000007490225,0.000058097427,0.0000060023403,0.000021455855,0.000045753008],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992824,0.00003707373,0.00023458696,0.00018469492,0.00008077594,0.00018043116],"domain_scores_gemma":[0.9992694,0.0001828805,0.000029491777,0.0003732068,0.00011377422,0.000031230982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008009493,0.00016287595,0.0001684541,0.0002255941,0.00056428433,0.000120719444,0.0002634494,0.00009304293,0.000018755576],"category_scores_gemma":[0.000003321488,0.00015902321,0.00002994077,0.0005218928,0.0001263195,0.00017979194,0.000008863437,0.0003435964,0.000009828507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000916881,0.000039861523,0.00014724457,0.000039628045,0.00008292987,0.00000147028,0.00027175323,0.89530224,0.00057611405,0.0001873348,0.000067435256,0.10327483],"study_design_scores_gemma":[0.00050828664,0.00007843161,0.0001608411,0.000234755,0.00005238408,0.000012389102,0.00024454543,0.95203626,0.04592431,0.00016587292,0.00034111523,0.00024082189],"about_ca_topic_score_codex":0.000037451697,"about_ca_topic_score_gemma":0.00006975794,"teacher_disagreement_score":0.95455366,"about_ca_system_score_codex":0.00007480954,"about_ca_system_score_gemma":0.000020636366,"threshold_uncertainty_score":0.64847785},"labels":[],"label_agreement":null},{"id":"W4407900133","doi":"10.1109/tmc.2025.3545437","title":"MoCo: Urban User Mobile Contact Detection Based on Cellular Signaling Trace","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Context-Aware Activity Recognition Systems","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"Higher Education Discipline Innovation Project; National Natural Science Foundation of China","keywords":"Computer science; TRACE (psycholinguistics); Mobile computing; Cellular network; Computer network; Human–computer interaction","score_opus":0.012879257999351773,"score_gpt":0.24567063704613445,"score_spread":0.23279137904678268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407900133","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13750201,0.000064972395,0.85773945,0.00005351001,0.002190414,0.0011735129,0.000010317686,0.00076751295,0.0004983173],"genre_scores_gemma":[0.99691796,0.0000020727389,0.0018426111,0.00035174633,0.000108158616,0.00035051303,0.0000020439174,0.000036243044,0.00038864344],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99696004,0.00041940002,0.0006374102,0.0009764221,0.0004886168,0.0005180839],"domain_scores_gemma":[0.99720615,0.0013049282,0.00022418116,0.00089613406,0.00022135701,0.00014722106],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066543417,0.00040852517,0.00045226992,0.00068437046,0.0007637498,0.00038108559,0.00066638045,0.00020910377,0.00005112995],"category_scores_gemma":[0.000012864736,0.00045051557,0.00035613714,0.0012158297,0.00004106756,0.00047545493,0.000008528215,0.000702877,0.0001325027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007198815,0.0006990126,0.000049551854,0.00008704285,0.00009134416,0.000021705482,0.0005334295,0.49904338,0.08585823,0.000058440044,0.0000913746,0.41339448],"study_design_scores_gemma":[0.00091038214,0.00043781233,0.000041251184,0.0003135799,0.00003016407,0.000006476394,0.00013273784,0.60524267,0.38977978,0.000019616326,0.0027348432,0.00035068628],"about_ca_topic_score_codex":0.00008774897,"about_ca_topic_score_gemma":0.000028033643,"teacher_disagreement_score":0.85941595,"about_ca_system_score_codex":0.00036279054,"about_ca_system_score_gemma":0.00015845087,"threshold_uncertainty_score":0.99979466},"labels":[],"label_agreement":null},{"id":"W4407937491","doi":"10.1109/tmc.2025.3545444","title":"Vehicle-Assisted Service Caching for Task Offloading in Vehicular Edge Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","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":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Edge computing; Task (project management); Mobile edge computing; Computer network; Service (business); Mobile computing; Server; Enhanced Data Rates for GSM Evolution; Distributed computing; Cloud computing; Operating system; Telecommunications","score_opus":0.01663381487815505,"score_gpt":0.2727074205078433,"score_spread":0.25607360562968823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407937491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27360624,0.000103632825,0.7169959,0.0003063285,0.0075498433,0.00069324195,0.0000011886918,0.00048981665,0.00025383531],"genre_scores_gemma":[0.97325194,0.0000028381203,0.025129845,0.0010157618,0.0004471793,0.000045850287,0.0000040057917,0.000040435654,0.00006214945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964431,0.00022835465,0.0009259324,0.0010805508,0.000321014,0.0010010714],"domain_scores_gemma":[0.9973646,0.0012871528,0.0002246204,0.00074439135,0.00024187507,0.00013736707],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011796212,0.00045501097,0.0005747226,0.00081608526,0.0012431642,0.00038507668,0.0012233324,0.0002215561,0.0000012814797],"category_scores_gemma":[0.000026632848,0.000519833,0.00028439233,0.0023316434,0.000041304298,0.00039812934,0.00005032731,0.0008299709,0.000023286239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025128258,0.00028193256,0.00026119288,0.00023766115,0.00007259284,0.000017701315,0.0015907908,0.6620982,0.00599193,0.00020474163,0.00021715982,0.32900095],"study_design_scores_gemma":[0.0014310451,0.00009887368,0.0009555502,0.0008212097,0.00003093638,0.000017764447,0.00009791663,0.9867767,0.0073343273,0.00018462044,0.0017594359,0.00049161364],"about_ca_topic_score_codex":0.00027364242,"about_ca_topic_score_gemma":0.000051377494,"teacher_disagreement_score":0.6996457,"about_ca_system_score_codex":0.00039194644,"about_ca_system_score_gemma":0.0002139796,"threshold_uncertainty_score":0.99972534},"labels":[],"label_agreement":null},{"id":"W4408145244","doi":"10.1109/tmc.2025.3547946","title":"Multi-Agent Moth-Flame Reinforcement Learning Based Broadcast Beam Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Photonic Communication 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":"Carleton University","funders":"","keywords":"Reinforcement learning; Computer science; Reinforcement; Beam (structure); Artificial intelligence; Materials science; Composite material; Structural engineering; Engineering","score_opus":0.013381880439858171,"score_gpt":0.25794490934524483,"score_spread":0.24456302890538667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408145244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048111123,0.00018472648,0.99191993,0.000013647417,0.00083596347,0.00060984684,0.0000029140108,0.0008888219,0.0007330048],"genre_scores_gemma":[0.97075,0.000060758866,0.02839783,0.000052626994,0.000018302408,0.0001410902,0.000012161282,0.000044013985,0.00052326306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987535,0.00006798581,0.00048282914,0.0002495132,0.00017003175,0.00027616107],"domain_scores_gemma":[0.9990593,0.00020456091,0.00007575965,0.0005131433,0.00008337583,0.00006387],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019627548,0.00022253058,0.00022034734,0.0002654863,0.00036084134,0.000054831253,0.0002444824,0.00008989351,0.000080342405],"category_scores_gemma":[0.000006553342,0.0002673112,0.000111056004,0.00047800454,0.000030224168,0.000101416044,0.0000040898794,0.00046782717,0.00003108228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000069797043,0.000049512193,0.000008066757,0.000060897473,0.000042311127,6.301378e-7,0.00024624655,0.9753921,0.002296817,0.0000022924032,0.000016983893,0.021877157],"study_design_scores_gemma":[0.00069992134,0.000039418377,0.000009329638,0.00021595626,0.0000207816,0.0000015739173,0.00022014976,0.9723172,0.023357367,5.5092295e-7,0.0029169247,0.00020083622],"about_ca_topic_score_codex":0.000016229238,"about_ca_topic_score_gemma":0.000004005078,"teacher_disagreement_score":0.96593887,"about_ca_system_score_codex":0.00037515842,"about_ca_system_score_gemma":0.00003923605,"threshold_uncertainty_score":0.9999779},"labels":[],"label_agreement":null},{"id":"W4408423544","doi":"10.1109/tmc.2025.3551537","title":"A Joint Secure Mechanism of Multi-Task Learning for a UAV Team Under FDI Attacks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Task (project management); Mechanism (biology); Computer security; Human–computer interaction; Engineering","score_opus":0.020074393173923146,"score_gpt":0.29529807487008,"score_spread":0.27522368169615685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408423544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075029987,0.000052071453,0.9894193,0.00014428333,0.0014490194,0.00077273813,0.0000037492114,0.00043867744,0.00021718456],"genre_scores_gemma":[0.8604711,0.0000055568503,0.13880803,0.00013411729,0.000045623,0.000072735056,0.0000015674569,0.000028464192,0.0004327741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99780124,0.00021541979,0.00056858023,0.00067765056,0.0002771556,0.00045995458],"domain_scores_gemma":[0.9982678,0.0006606198,0.00026894364,0.00052129687,0.00020216615,0.00007916398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067201274,0.00029341076,0.00043387484,0.00040770738,0.00069683813,0.000097363816,0.00067951874,0.0001754519,0.000010620246],"category_scores_gemma":[0.00004612735,0.00030975416,0.00030024766,0.0007319603,0.00006409249,0.00022177509,0.000028654318,0.0008205005,0.000008626343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016081505,0.0001815539,0.000010337205,0.00009150915,0.00007991967,0.0000014891187,0.0009192905,0.94294786,0.0035516361,0.0057435,0.000021532911,0.04643526],"study_design_scores_gemma":[0.0011952531,0.00024881636,0.000030171668,0.00024597393,0.000043616004,0.00000700999,0.00044227706,0.9813967,0.014870151,0.000927986,0.00032943414,0.00026262135],"about_ca_topic_score_codex":0.000041160136,"about_ca_topic_score_gemma":0.000011886736,"teacher_disagreement_score":0.85296816,"about_ca_system_score_codex":0.0001552224,"about_ca_system_score_gemma":0.00015948368,"threshold_uncertainty_score":0.99993545},"labels":[],"label_agreement":null},{"id":"W4408951699","doi":"10.1109/tmc.2025.3555640","title":"A Digital Twin-Based Intelligent Network Architecture for Underwater Acoustic Sensor Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","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":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Architecture; Underwater acoustic communication; Underwater; Acoustic sensor; Wireless sensor network; Computer network; Computer architecture; Acoustics","score_opus":0.011479957096929502,"score_gpt":0.23202118813567377,"score_spread":0.22054123103874426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408951699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0059287813,0.0001743763,0.9914485,0.00007127566,0.00061366474,0.0006904091,0.000012256589,0.0007631756,0.00029752107],"genre_scores_gemma":[0.9937213,0.000009679712,0.0054756245,0.00018357963,0.00013150954,0.00014123697,0.0000079417505,0.00006054689,0.00026855487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988578,0.000038924256,0.00038283056,0.00023616315,0.00009596315,0.0003883432],"domain_scores_gemma":[0.99902564,0.0004495057,0.000035925746,0.00037682307,0.000046134763,0.00006594264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001252268,0.00023102942,0.00023874638,0.00012505813,0.0002887057,0.00017094493,0.00023809412,0.000118287004,0.000009175514],"category_scores_gemma":[5.5456775e-7,0.00022328983,0.00019098666,0.000300631,0.000034580597,0.000041584542,0.000003089735,0.0003363753,0.000013798324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020685244,0.00004195051,0.000010976492,0.00007749529,0.000082576924,5.7223633e-7,0.000081425314,0.8908164,0.00033693988,0.0000037532516,0.00010697357,0.10842024],"study_design_scores_gemma":[0.00036342695,0.00006534054,0.000005471785,0.00022596605,0.000037446134,0.0000033272734,0.00010512702,0.9800088,0.0051248074,0.000073679344,0.013769099,0.0002175126],"about_ca_topic_score_codex":0.0000038595076,"about_ca_topic_score_gemma":0.00001937339,"teacher_disagreement_score":0.98779255,"about_ca_system_score_codex":0.00011288014,"about_ca_system_score_gemma":0.000022497496,"threshold_uncertainty_score":0.91054946},"labels":[],"label_agreement":null},{"id":"W4409014175","doi":"10.1109/tmc.2025.3556143","title":"Edge Intelligence Enhanced Monte Carlo Tree Search for Virtually Coupled Train Set Optimal Control","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Railway Systems and Energy Efficiency","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":"Carleton University","funders":"Beijing Jiaotong University; Natural Science Foundation of Beijing Municipality; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Monte Carlo tree search; Monte Carlo method; Set (abstract data type); Tree (set theory); Algorithm; Mathematics; Statistics","score_opus":0.011992438618770775,"score_gpt":0.25474177258446307,"score_spread":0.2427493339656923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409014175","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25724608,0.00013543208,0.7400011,0.00001385965,0.0011585262,0.0005963122,0.000034053388,0.00033824518,0.00047644498],"genre_scores_gemma":[0.99761164,0.000021101045,0.0014981058,0.00003334424,0.000092252965,0.00023912133,0.0000022972702,0.00004401149,0.00045814508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984263,0.000046441586,0.0004899744,0.00036623594,0.00017576978,0.0004952416],"domain_scores_gemma":[0.99901533,0.00045102093,0.00003325196,0.00029642673,0.00011121701,0.00009275327],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003708009,0.00026777585,0.0003657332,0.00023452104,0.0002994749,0.00007264957,0.00027845937,0.00013539239,0.000019537825],"category_scores_gemma":[0.0000055088203,0.00028198442,0.00021119977,0.000408536,0.000052080948,0.0000816378,0.0000015793046,0.00030762353,0.000012495531],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031265816,0.000052695643,8.13591e-7,0.00008601185,0.00008371492,0.0000013873943,0.0008744664,0.884359,0.018834777,0.00005240773,0.000040743376,0.09558273],"study_design_scores_gemma":[0.00065996085,0.00017374325,0.000011612544,0.0001376964,0.000030319005,0.0000024767237,0.0007622829,0.9436593,0.054039475,0.000003325332,0.00028461133,0.00023519216],"about_ca_topic_score_codex":0.00006364388,"about_ca_topic_score_gemma":0.000052833922,"teacher_disagreement_score":0.74036556,"about_ca_system_score_codex":0.00014801134,"about_ca_system_score_gemma":0.00006375635,"threshold_uncertainty_score":0.9999632},"labels":[],"label_agreement":null},{"id":"W4409076546","doi":"10.1109/tmc.2025.3555322","title":"Joint Adaptation for Mobile 360-Degree Video Streaming and Enhancement","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Joint (building); Adaptation (eye); Video streaming; Degree (music); Mobile telephony; Multimedia; Real-time computing; Computer network; Mobile radio","score_opus":0.04516044204518072,"score_gpt":0.3184599806217179,"score_spread":0.27329953857653716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409076546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023323061,0.00017710456,0.9741383,0.00017697108,0.0007990535,0.0009531751,0.000005681405,0.00016989362,0.00025672387],"genre_scores_gemma":[0.9106604,0.000030874256,0.08821438,0.00033605887,0.00003729203,0.00034985543,0.0000022254262,0.000010058265,0.00035885817],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984068,0.00008447846,0.00045042176,0.000537819,0.00020137228,0.00031907018],"domain_scores_gemma":[0.99889463,0.00039690977,0.00011647721,0.0003990282,0.00012896556,0.00006400813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004766786,0.00019500408,0.00024141114,0.00021723221,0.0005315441,0.00022270194,0.00025885913,0.000063607695,0.000008220548],"category_scores_gemma":[0.0000068455197,0.00020395638,0.000112362126,0.00032244856,0.00003798686,0.00032629797,0.000011665091,0.0001770624,0.0000070409938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011653195,0.00022006656,0.0000027228707,0.00010679882,0.000049396276,0.0000015070989,0.0014675128,0.06316954,0.00410065,0.0010495243,0.00009739796,0.9297232],"study_design_scores_gemma":[0.00088866666,0.00052695227,0.0000798199,0.00025028,0.000037115296,0.0000039014644,0.000994618,0.89479613,0.099726446,0.000689948,0.001732644,0.0002734553],"about_ca_topic_score_codex":0.00005493082,"about_ca_topic_score_gemma":0.000022113541,"teacher_disagreement_score":0.9294498,"about_ca_system_score_codex":0.0001319077,"about_ca_system_score_gemma":0.00010757178,"threshold_uncertainty_score":0.83171},"labels":[],"label_agreement":null},{"id":"W4409233275","doi":"10.1109/tmc.2025.3558406","title":"FedLFP: Communication-Efficient Personalized Federated Learning on Non-IID Data in Mobile Edge Computing Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Mobile computing; Edge computing; Mobile telephony; Mobile edge computing; Enhanced Data Rates for GSM Evolution; Computer network; Distributed computing; Server; Mobile radio; Artificial intelligence","score_opus":0.027574735301641767,"score_gpt":0.29929109086068134,"score_spread":0.27171635555903956,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409233275","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.120555714,0.0002604164,0.87560105,0.0008156254,0.0006199487,0.0008819033,0.000023797627,0.00073768914,0.00050384563],"genre_scores_gemma":[0.9452618,0.00011400752,0.05404467,0.00027177183,0.000018020859,0.000075912176,0.00005633076,0.0000324675,0.00012505606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961403,0.00046186746,0.00077116705,0.0014022292,0.0005157494,0.00070870854],"domain_scores_gemma":[0.99012375,0.0013365636,0.00026633608,0.008135001,0.000051921976,0.000086421365],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0013894469,0.00042296347,0.00047460894,0.0006319294,0.0013704215,0.00040456056,0.017446918,0.00023018147,0.000020974725],"category_scores_gemma":[0.0004881396,0.0004722848,0.00010327887,0.0015076558,0.00023040197,0.0003651418,0.00393271,0.0016301743,0.000091841546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032169104,0.0009564511,0.00019156317,0.00004687077,0.00007854989,0.000015351068,0.0005544247,0.75988394,0.0012213805,0.00008725936,0.0017737969,0.23515823],"study_design_scores_gemma":[0.0011064417,0.00015130712,0.0002676595,0.0005283717,0.000014329731,0.000006635856,0.00044032373,0.98941094,0.005059946,0.0001889602,0.0024415115,0.000383604],"about_ca_topic_score_codex":0.000104209015,"about_ca_topic_score_gemma":0.000023415632,"teacher_disagreement_score":0.8247061,"about_ca_system_score_codex":0.000500293,"about_ca_system_score_gemma":0.00013080575,"threshold_uncertainty_score":0.99992967},"labels":[],"label_agreement":null},{"id":"W4409257386","doi":"10.1109/tmc.2025.3558793","title":"Plugging and Breathing on the Air: A Practical Defense System for Deep Learning-Based Wireless Semantic Communications","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Network Security and Intrusion Detection","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":"Mila - Quebec Artificial Intelligence Institute","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China; National Research Foundation","keywords":"Computer science; Wireless; Artificial intelligence; Computer security; Multimedia; Telecommunications","score_opus":0.017428509419552717,"score_gpt":0.27211242333557556,"score_spread":0.25468391391602285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409257386","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028705264,0.000076070246,0.967406,0.0019113064,0.00056700566,0.00066933985,0.0000014287241,0.0004657765,0.00019784547],"genre_scores_gemma":[0.9899331,0.000019473673,0.009300109,0.0005226128,0.0000341382,0.00015054949,8.725558e-7,0.000013706532,0.000025453919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843293,0.00039781755,0.00031563005,0.0003980365,0.0001790303,0.00027658002],"domain_scores_gemma":[0.99531955,0.0036537629,0.00013001064,0.00072489976,0.00011455789,0.000057203815],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00083148543,0.00017685925,0.00019854933,0.00019592108,0.0022751861,0.0002292906,0.0004800073,0.00009812934,0.0000016803416],"category_scores_gemma":[0.000030179395,0.00015220558,0.00012569074,0.00053106627,0.000097030796,0.00016292879,0.00001923902,0.0006889558,0.000007105282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007870021,0.00029818498,0.000012525617,0.00022241224,0.0000883336,0.0000058003397,0.0015130308,0.7348386,0.00033175913,0.028257316,0.00006217517,0.23429117],"study_design_scores_gemma":[0.0003803368,0.00018681513,0.000012292277,0.00047442032,0.000037152353,0.000030026278,0.00038534877,0.99433845,0.0029216288,0.00013893622,0.00095332746,0.00014127968],"about_ca_topic_score_codex":0.000027637549,"about_ca_topic_score_gemma":0.000029096193,"teacher_disagreement_score":0.96122783,"about_ca_system_score_codex":0.00012419214,"about_ca_system_score_gemma":0.00006891163,"threshold_uncertainty_score":0.99902374},"labels":[],"label_agreement":null},{"id":"W4409327552","doi":"10.1109/tmc.2025.3559676","title":"Multi-Task Reinforcement Learning-Based Multiple Access for Dynamic Wireless Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Wireless Body Area Networks","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":"McGill University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Task (project management); Wireless; Wireless network; Computer network; Distributed computing; Artificial intelligence; Telecommunications","score_opus":0.01090824097278315,"score_gpt":0.2607953289238036,"score_spread":0.24988708795102044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409327552","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041543555,0.00013752056,0.9537944,0.000023532974,0.0020020935,0.0012278777,0.000009053132,0.0011890933,0.00007286682],"genre_scores_gemma":[0.99638265,0.000037774058,0.0025660906,0.00010965647,0.00006249442,0.00050035387,0.000036618243,0.000095533935,0.00020881093],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981986,0.000053328335,0.0005235283,0.00043753823,0.00015753933,0.0006294444],"domain_scores_gemma":[0.9986354,0.0007189653,0.00008001358,0.00038210166,0.00008366042,0.00009984824],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022729841,0.0003749841,0.00037041563,0.00029119928,0.0005451907,0.00014216802,0.00041300437,0.00022442685,0.00001611542],"category_scores_gemma":[0.000006149984,0.00043567043,0.000235285,0.000553844,0.000055835593,0.0001436854,0.0000056746444,0.0007005534,0.000007648969],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046094257,0.000083071594,0.00007917905,0.00014441914,0.00010561089,0.0000018802918,0.000062409985,0.93242097,0.0004953468,0.0000031359093,0.000107396845,0.0664505],"study_design_scores_gemma":[0.001758977,0.000083814586,0.00012862385,0.00033749975,0.000055289493,9.28646e-7,0.00004261614,0.9926049,0.0038979307,0.000002535255,0.00071042875,0.00037646125],"about_ca_topic_score_codex":0.000023546729,"about_ca_topic_score_gemma":0.00011070101,"teacher_disagreement_score":0.9548391,"about_ca_system_score_codex":0.00033043372,"about_ca_system_score_gemma":0.000047402977,"threshold_uncertainty_score":0.9998095},"labels":[],"label_agreement":null},{"id":"W4409882680","doi":"10.1109/tmc.2025.3564843","title":"WiCG: In-Body Cardiac Motion Sensing Based on a Mix-Medium Wi-Fi Fresnel Zone Model","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Non-Invasive Vital Sign Monitoring","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":"McMaster University","funders":"European Commission","keywords":"Computer science; Fresnel zone; Computer graphics (images); Optics; Physics","score_opus":0.00866874640406717,"score_gpt":0.22921922985279142,"score_spread":0.22055048344872424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409882680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2608549,0.00005079063,0.7353487,0.000021309934,0.002203186,0.0004084256,0.000017956863,0.0006368055,0.00045794537],"genre_scores_gemma":[0.9929873,0.000012805008,0.0065923487,0.000058102054,0.0001664343,0.000036461766,0.0000051825714,0.00009497404,0.00004644489],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818957,0.00008716917,0.00044428202,0.00046150273,0.0003010298,0.0005164235],"domain_scores_gemma":[0.9989603,0.00039257895,0.000044093213,0.00042998968,0.00007102211,0.00010202315],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002869852,0.00036076264,0.00038618827,0.00064911606,0.00023071136,0.00006839389,0.00016242843,0.00018415671,0.0000041847043],"category_scores_gemma":[0.0000103118655,0.000437584,0.00019776735,0.00078679743,0.00004228719,0.00013581499,0.0000036554748,0.00072034803,0.00002951338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019244257,0.00008657755,0.00011017825,0.000100154895,0.000039568225,0.000010854295,0.00020083504,0.89087933,0.080350295,0.0000049830614,0.000036117584,0.028161878],"study_design_scores_gemma":[0.00053659914,0.000049853323,0.00017956967,0.0005002036,0.000032991076,0.0000010916721,0.00009267872,0.8130846,0.1851821,0.000032484986,0.000028671697,0.00027917812],"about_ca_topic_score_codex":0.00006880367,"about_ca_topic_score_gemma":0.000025551471,"teacher_disagreement_score":0.7321324,"about_ca_system_score_codex":0.0005681069,"about_ca_system_score_gemma":0.00006640173,"threshold_uncertainty_score":0.9998076},"labels":[],"label_agreement":null},{"id":"W4409916910","doi":"10.1109/tmc.2025.3563345","title":"BAT: A Versatile Bipartite Attention-Based Approach for Comprehensive Truth Inference in Mobile Crowdsourcing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Crowdsourcing; Computer science; Inference; Bipartite graph; Artificial intelligence; Ground truth; Mobile computing; World Wide Web; Theoretical computer science; Computer network; Graph","score_opus":0.022646144104512447,"score_gpt":0.2863331307574352,"score_spread":0.2636869866529228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409916910","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15629303,0.00013493968,0.840693,0.000039464892,0.0009117667,0.001152472,0.000011383178,0.0005066835,0.0002572385],"genre_scores_gemma":[0.94983584,0.000005828334,0.04919194,0.00029286154,0.000043980355,0.0005052534,0.000008561804,0.00003035197,0.00008540657],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969904,0.00020372296,0.0007183371,0.0010530319,0.00030675484,0.0007277679],"domain_scores_gemma":[0.9963189,0.0022502805,0.00019000543,0.000870498,0.00024397338,0.00012638207],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050201325,0.00040802493,0.00052488706,0.00076792313,0.00071149465,0.00035516516,0.0007051043,0.00018186604,0.0000065579234],"category_scores_gemma":[0.00003112939,0.00044950494,0.00031601262,0.0014842149,0.00011597579,0.0002700661,0.000016893593,0.0005248251,0.000012040246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036514324,0.00034847212,0.00018863112,0.00015942128,0.00003494673,0.000003993849,0.0005465197,0.9338992,0.0024121602,0.00026520574,0.00005010427,0.06205479],"study_design_scores_gemma":[0.0016493577,0.00022455909,0.00025878978,0.00037303942,0.000030192625,0.0000033750393,0.000498693,0.9842789,0.011697056,0.00008035351,0.0004997153,0.00040595388],"about_ca_topic_score_codex":0.00006629411,"about_ca_topic_score_gemma":0.000012625332,"teacher_disagreement_score":0.7935428,"about_ca_system_score_codex":0.00024360554,"about_ca_system_score_gemma":0.00024104775,"threshold_uncertainty_score":0.9997957},"labels":[],"label_agreement":null},{"id":"W4410086631","doi":"10.1109/tmc.2025.3567179","title":"Mixture-of-Experts as Continual Knowledge Adapter for Mobile Vision Understanding","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image Retrieval and Classification Techniques","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Adapter (computing); Mobile computing; Mobile telephony; Human–computer interaction; Multimedia; Computer security; Telecommunications; Mobile radio; Operating system","score_opus":0.0254552294492189,"score_gpt":0.3292681171957355,"score_spread":0.3038128877465166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410086631","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025324163,0.00023840669,0.9932973,0.00009717627,0.0008880896,0.0008461204,0.0000059088497,0.0003754093,0.0017192187],"genre_scores_gemma":[0.9797412,0.00002563992,0.018880399,0.00010456173,0.000031014108,0.00013987538,0.0000013974853,0.000013346829,0.0010625765],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99863946,0.00007013741,0.00041707806,0.000448878,0.00016255566,0.00026185677],"domain_scores_gemma":[0.99864423,0.00054973294,0.00012649906,0.0004268574,0.00019556622,0.000057095396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003315575,0.00018617303,0.0002605542,0.0002981482,0.00036681004,0.000106421,0.0004951659,0.00011936674,0.000011511915],"category_scores_gemma":[0.000008987338,0.00017773052,0.00020498643,0.0005926504,0.000081312566,0.00022975184,0.000010350798,0.00016087785,0.000008264127],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010609265,0.0009737639,0.000008128594,0.00021635981,0.00010845874,0.0000025480474,0.0029048487,0.0031003738,0.04384257,0.028040268,0.0015370025,0.9191596],"study_design_scores_gemma":[0.0008921327,0.0009289624,0.000011458873,0.00044037792,0.00003355318,0.000007912708,0.0007387379,0.26817033,0.71016526,0.003563472,0.014686092,0.00036169446],"about_ca_topic_score_codex":0.000008093481,"about_ca_topic_score_gemma":0.0000025662835,"teacher_disagreement_score":0.9772088,"about_ca_system_score_codex":0.00018213374,"about_ca_system_score_gemma":0.00012939303,"threshold_uncertainty_score":0.724764},"labels":[],"label_agreement":null},{"id":"W4410294515","doi":"10.1109/tmc.2025.3569547","title":"TraCemop: Toward Federated Learning With Traceable Contribution Evaluation and Model Ownership Protection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"Queen's University","funders":"Key Research and Development Projects of Shaanxi Province; National Natural Science Foundation of China","keywords":"Computer science; Computer security; Federated learning; Distributed computing","score_opus":0.03738398925649043,"score_gpt":0.2903370247470432,"score_spread":0.25295303549055276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410294515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09300436,0.00009342463,0.90154165,0.0027919747,0.00022540861,0.0010878575,0.0000031187355,0.0011244429,0.0001277795],"genre_scores_gemma":[0.9503523,0.000017902645,0.049269866,0.000059308026,0.000010403598,0.00020005679,0.0000047943095,0.000013244959,0.000072137016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799764,0.0002379057,0.00030993397,0.00070361,0.00038157284,0.000369322],"domain_scores_gemma":[0.99815965,0.00016067567,0.00014339104,0.0011642022,0.00031987583,0.00005219793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011093802,0.00023042408,0.00022809458,0.0003339891,0.0008644569,0.00036461971,0.0017200706,0.00018531647,0.0000039233087],"category_scores_gemma":[0.0005464714,0.00021418442,0.00004562463,0.0009611697,0.00008291575,0.00064792053,0.00017459654,0.00073701947,0.0000046153914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049911192,0.00009332251,0.000017536964,0.00003548934,0.000042419048,0.0000015842774,0.00013679937,0.65854394,0.0028229514,0.00013216055,0.00015320383,0.33797064],"study_design_scores_gemma":[0.0009090245,0.0002451235,0.000051401425,0.00015719044,0.00003859959,0.000015477397,0.00011660098,0.9601327,0.033962704,0.004102684,0.000056400633,0.00021208097],"about_ca_topic_score_codex":0.000033999728,"about_ca_topic_score_gemma":0.000016867634,"teacher_disagreement_score":0.8573479,"about_ca_system_score_codex":0.0003009531,"about_ca_system_score_gemma":0.00017874599,"threshold_uncertainty_score":0.87341875},"labels":[],"label_agreement":null},{"id":"W4410294847","doi":"10.1109/tmc.2025.3569407","title":"Efficient Model Training in Edge Networks With Hierarchical Split Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Machine Learning and ELM","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 Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Training (meteorology); Enhanced Data Rates for GSM Evolution; Artificial intelligence; Machine learning","score_opus":0.01048774381927405,"score_gpt":0.2536253834284963,"score_spread":0.24313763960922222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410294847","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14479402,0.000038274797,0.8525717,0.00018538059,0.00030969488,0.00019676304,2.938209e-7,0.00035225064,0.0015515768],"genre_scores_gemma":[0.9675007,0.000002933783,0.031816002,0.00020517367,0.000032829805,0.000031253094,6.198894e-7,0.000016450274,0.00039407486],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816394,0.00016570932,0.000326265,0.0005958571,0.00022520432,0.0005230511],"domain_scores_gemma":[0.99907273,0.00037199302,0.00006731503,0.00035546866,0.000040673876,0.00009184023],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055227085,0.00022200638,0.00027020116,0.0003818587,0.0004929662,0.00014045012,0.0004772461,0.000097765216,0.0000043810983],"category_scores_gemma":[0.000007658002,0.0002076846,0.000088973145,0.001046629,0.00005747246,0.00006019794,0.000011556115,0.0011153583,0.000007281714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015868492,0.00008237761,0.00003703119,0.000010551414,0.000010750271,0.000007243132,0.0021692999,0.7256782,0.000015620835,0.0007987248,0.0000030077208,0.27117133],"study_design_scores_gemma":[0.00058670714,0.0001375398,0.00014580794,0.00023088181,0.000007797271,0.000010610427,0.00013111655,0.9982575,0.00006317044,0.00006149046,0.00016129708,0.00020603664],"about_ca_topic_score_codex":0.000029626253,"about_ca_topic_score_gemma":0.000014683076,"teacher_disagreement_score":0.82270664,"about_ca_system_score_codex":0.00009469991,"about_ca_system_score_gemma":0.00015548512,"threshold_uncertainty_score":0.8469132},"labels":[],"label_agreement":null},{"id":"W4410428100","doi":"10.1109/tmc.2025.3571186","title":"Optimizing Mobile-Friendly Viewport Prediction for Live 360-Degree Video Streaming","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Image and Video Quality Assessment","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Viewport; Computer science; Degree (music); Video streaming; Mobile telephony; Multimedia; Mobile computing; Mobile radio; Computer network; Computer graphics (images)","score_opus":0.027683589066853267,"score_gpt":0.3148080385263113,"score_spread":0.28712444945945803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410428100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008654745,0.00023452869,0.98602426,0.00014199775,0.0022077607,0.0014465108,0.000029243762,0.000605326,0.00065561355],"genre_scores_gemma":[0.86321574,0.00004498946,0.13509443,0.00039490045,0.00012558512,0.000594738,0.00000764825,0.000025975742,0.0004959793],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973086,0.00014327552,0.0007505658,0.00087261223,0.00034988055,0.0005750682],"domain_scores_gemma":[0.997894,0.00073989714,0.00020481461,0.0007888026,0.0002583715,0.00011411487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007781597,0.0003347327,0.00039562414,0.00037412115,0.0009430729,0.00032249722,0.0007214822,0.0001451889,0.000016538683],"category_scores_gemma":[0.00001447823,0.0003582035,0.00031551844,0.00068615563,0.000060273076,0.00067725085,0.000020714226,0.00042442878,0.00002351048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026903956,0.00040715703,0.00002011297,0.00016030442,0.0001265271,0.000007599763,0.0018486397,0.32416248,0.0013488942,0.0007071792,0.0004377062,0.6707465],"study_design_scores_gemma":[0.0012842602,0.0009161761,0.000122060075,0.0005684201,0.00011037565,0.000018028168,0.0013636558,0.9590256,0.029522518,0.00032132317,0.0062537375,0.00049381255],"about_ca_topic_score_codex":0.00005693379,"about_ca_topic_score_gemma":0.000016510112,"teacher_disagreement_score":0.85456103,"about_ca_system_score_codex":0.00027743782,"about_ca_system_score_gemma":0.00023118797,"threshold_uncertainty_score":0.999887},"labels":[],"label_agreement":null},{"id":"W4410428120","doi":"10.1109/tmc.2025.3570851","title":"Multi-Variate Time Series Prediction of Traffic and Users for Dynamic RRH-BBU Mapping in C-RAN","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Brain Tumor Detection and Classification","field":"Neuroscience","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 Waterloo","funders":"Key Research and Development Program of Hunan Province of China; Natural Science Foundation of Hainan Province; National Natural Science Foundation of China","keywords":"Computer science; Series (stratigraphy); Computer network; Time series; Random variate; Data mining; Machine learning; Mathematics","score_opus":0.022833299374764835,"score_gpt":0.26437327307352865,"score_spread":0.24153997369876382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410428120","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.5302556,0.000008122126,0.46853766,0.00007643575,0.00032314996,0.0006352209,0.00002820162,0.000109691675,0.000025879495],"genre_scores_gemma":[0.9973618,0.000017423143,0.0020378844,0.00005877819,0.000007804251,0.00012804137,0.0000017656772,0.000013598607,0.00037294818],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989347,0.000097493,0.0003463352,0.00036252072,0.00008749409,0.00017144739],"domain_scores_gemma":[0.9993614,0.00032738055,0.00009755577,0.00015071919,0.00003247268,0.000030456556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021468892,0.00012162047,0.00017263569,0.00034045483,0.00024574244,0.000032787502,0.000089535926,0.000073345494,0.00000764362],"category_scores_gemma":[0.00003121027,0.00013686466,0.000064218206,0.00052302,0.00008934477,0.0001388041,0.0000016413316,0.00017353261,0.000002824439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008763641,0.00025001203,0.000032026826,0.0001469043,0.0000113541555,7.56112e-7,0.0010637324,0.2785345,0.63940257,0.0000318854,0.0000066170514,0.08043199],"study_design_scores_gemma":[0.0010112043,0.000107781285,0.00214022,0.00015599001,0.0000125395145,0.0000075433472,0.0004477888,0.91633534,0.079525344,0.000018108814,0.0001434653,0.000094689785],"about_ca_topic_score_codex":0.00000510405,"about_ca_topic_score_gemma":0.000018611818,"teacher_disagreement_score":0.6378008,"about_ca_system_score_codex":0.00008017202,"about_ca_system_score_gemma":0.000033786233,"threshold_uncertainty_score":0.55811787},"labels":[],"label_agreement":null},{"id":"W4410771506","doi":"10.1109/tmc.2025.3574065","title":"Characterizing and Scheduling of Diffusion Process for Text-to-Image Generation in Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Computing and Algorithms","field":"Social Sciences","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Process (computing); Artificial intelligence; Distributed computing; Mathematical optimization","score_opus":0.020854987264623946,"score_gpt":0.3310176194665385,"score_spread":0.3101626322019146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410771506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43498757,0.000029539435,0.56418115,0.00008505309,0.00029370023,0.00032264012,0.0000013647559,0.00003425982,0.00006469567],"genre_scores_gemma":[0.9869618,0.00002502285,0.012664283,0.00008562013,0.00015726853,0.000042785745,0.0000016037767,0.00000914493,0.00005249884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908686,0.000061369654,0.00026029488,0.00025894208,0.000097651224,0.00023485813],"domain_scores_gemma":[0.9994876,0.0002301682,0.0000745083,0.000080913735,0.00007937968,0.000047452413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004075453,0.000096123695,0.0001701604,0.00017701411,0.0005767015,0.00004458662,0.00009672697,0.00006999034,0.000001744439],"category_scores_gemma":[0.00002216005,0.00010712492,0.000041252395,0.00047563075,0.000055346027,0.000097145756,0.0000027230674,0.00015347212,3.8032553e-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.000016780212,0.00008271269,0.00006552318,0.00004014832,0.000006032397,2.9984744e-7,0.0037273394,0.6551101,0.008256927,0.00013533878,0.0000013442532,0.33255744],"study_design_scores_gemma":[0.00039175776,0.000069103575,0.0001830978,0.00031200823,0.000010097986,2.8713683e-7,0.001565896,0.9879046,0.00917074,0.00011440395,0.00014797969,0.00013000073],"about_ca_topic_score_codex":0.000052776042,"about_ca_topic_score_gemma":0.00007140598,"teacher_disagreement_score":0.5519742,"about_ca_system_score_codex":0.000057447014,"about_ca_system_score_gemma":0.000053098716,"threshold_uncertainty_score":0.44355798},"labels":[],"label_agreement":null},{"id":"W4410808519","doi":"10.1109/tmc.2025.3574740","title":"Toward Deterministic Satellite-Terrestrial Integrated Networks via Resource Adaptation and Differentiated Scheduling","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Satellite Communication Systems","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 Calgary","funders":"National Natural Science Foundation of China","keywords":"Computer science; Scheduling (production processes); Distributed computing; Satellite; Adaptation (eye); Communications satellite; Computer network","score_opus":0.028640813480337618,"score_gpt":0.2497313255970823,"score_spread":0.2210905121167447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410808519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14198649,0.0014178177,0.85433084,0.000008568399,0.0010336165,0.00038643106,0.000003529212,0.00060938834,0.00022330084],"genre_scores_gemma":[0.9974713,0.00032767013,0.0019722404,0.000026249229,0.000060700248,0.00004746822,0.000020483501,0.00004074818,0.00003318504],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861014,0.00017208183,0.00054599985,0.00028229444,0.00012176056,0.00026769782],"domain_scores_gemma":[0.99887604,0.0005480511,0.000068478745,0.00038531603,0.000046875382,0.000075243486],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020950964,0.00024981354,0.0002865686,0.00027064196,0.0002291573,0.00013464771,0.0002181347,0.00016610796,0.000009018393],"category_scores_gemma":[0.00000891546,0.00027168484,0.00007935935,0.00052053365,0.000054319127,0.00007731654,0.0000046862556,0.00048426862,0.0000094053385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025956882,0.000023322355,0.000024228615,0.000042989246,0.000057129728,0.0000014607299,0.0004239808,0.67883706,0.00080023473,0.0000043935675,0.000002442631,0.31975678],"study_design_scores_gemma":[0.00055751455,0.00004027295,0.00016241068,0.00034638043,0.000047452646,0.000008396276,0.00046522793,0.9949974,0.0020009023,0.00001405131,0.0011463162,0.00021367558],"about_ca_topic_score_codex":0.000029163748,"about_ca_topic_score_gemma":0.000017029164,"teacher_disagreement_score":0.8554848,"about_ca_system_score_codex":0.00011883045,"about_ca_system_score_gemma":0.00002027596,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W4411550741","doi":"10.1109/tmc.2025.3582284","title":"Video Conferencing With Predictive Generation and Collaborative Computation Across Mobile Headsets","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Innovative Human-Technology Interaction","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; McGill University","funders":"","keywords":"Computer science; Teleconference; Videoconferencing; Multimedia; Mobile telephony; Mobile computing; Computer network; Computation; Mobile device; Human–computer interaction; Mobile radio; World Wide Web; Algorithm","score_opus":0.01329185020259089,"score_gpt":0.3030047322856835,"score_spread":0.2897128820830926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411550741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38565516,0.0000365866,0.61253834,0.00009213778,0.00056889496,0.0006231288,0.000011187846,0.00030553402,0.00016905616],"genre_scores_gemma":[0.97744215,0.00001086725,0.021915432,0.0002364034,0.000039149378,0.0002477694,0.0000082695715,0.000015180062,0.00008481348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814194,0.00016557678,0.00040994745,0.00071426417,0.00022853777,0.0003397248],"domain_scores_gemma":[0.9984169,0.0003027867,0.00021024035,0.0003183229,0.00071236625,0.000039393926],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003216601,0.00027219128,0.00028521486,0.00036919315,0.0009723452,0.00028938305,0.000260487,0.00015498644,0.000004423997],"category_scores_gemma":[0.000009252413,0.0002720191,0.0000385924,0.001307746,0.0001956849,0.0006866061,0.0000146776465,0.00051682047,0.000008384936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011188659,0.0003272405,0.00026754822,0.000052211617,0.00024297435,0.000014316326,0.009574186,0.655036,0.018244417,0.0025503824,0.00022980302,0.3133491],"study_design_scores_gemma":[0.001064196,0.001064435,0.0006358562,0.0002356463,0.000024160958,0.000034352346,0.0019559884,0.87093097,0.12334578,0.0002140335,0.00019541343,0.00029919646],"about_ca_topic_score_codex":0.000023783708,"about_ca_topic_score_gemma":0.00008913437,"teacher_disagreement_score":0.591787,"about_ca_system_score_codex":0.00026248433,"about_ca_system_score_gemma":0.00014700758,"threshold_uncertainty_score":0.9999732},"labels":[],"label_agreement":null},{"id":"W4411599731","doi":"10.1109/tmc.2025.3582864","title":"Embodied AI-Enhanced Vehicular Networks: An Integrated Vision Language Models and Reinforcement Learning Method","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Transportation and Mobility Innovations","field":"Engineering","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 Waterloo","funders":"Chiang Mai University; Ministry of Science and ICT, South Korea; Ministry of Education - Singapore; National Research Foundation","keywords":"Embodied cognition; Computer science; Reinforcement learning; Human–computer interaction; Artificial intelligence; Cognitive science; Psychology","score_opus":0.008551245628869705,"score_gpt":0.28536783881716715,"score_spread":0.27681659318829743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411599731","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095091164,0.00007075779,0.9029508,0.000017541097,0.0003304641,0.0003563563,0.0000032316473,0.00066767354,0.00051196845],"genre_scores_gemma":[0.99119246,0.000039595798,0.008347324,0.00014451046,0.000017654218,0.00006033288,0.000043994336,0.000025331565,0.00012879248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989416,0.00006391531,0.00038365106,0.00026975715,0.00011395582,0.00022714322],"domain_scores_gemma":[0.9994981,0.000098351644,0.00003406287,0.00020954694,0.00009655107,0.000063363506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025938315,0.00019487154,0.00020793329,0.00024077018,0.0002795207,0.0000694428,0.00008791683,0.00011155963,0.000027473103],"category_scores_gemma":[0.00000241464,0.00020775484,0.0000613358,0.0005411928,0.000027860493,0.00022417588,0.000001147907,0.0005228353,0.0000024388273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012600525,0.0000366081,0.00000225729,0.0000352771,0.00004978862,0.00000104335,0.0010191314,0.87281567,0.0041281963,0.0002564955,0.000009810642,0.12163313],"study_design_scores_gemma":[0.0004574745,0.00008794245,0.00004891194,0.00012332277,0.000040661944,0.0000010908118,0.0009763088,0.9881571,0.0096577825,0.000038015933,0.00023398991,0.0001774321],"about_ca_topic_score_codex":0.000048036352,"about_ca_topic_score_gemma":0.000056980578,"teacher_disagreement_score":0.8961013,"about_ca_system_score_codex":0.000075946926,"about_ca_system_score_gemma":0.000020636802,"threshold_uncertainty_score":0.8471997},"labels":[],"label_agreement":null},{"id":"W4412081587","doi":"10.1109/tmc.2025.3586441","title":"Fed$n$nP: Federated Unlearning With Multiple Client Set Partitions","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Data Compression Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Priority Academic Program Development of Jiangsu Higher Education Institutions","keywords":"Computer science; Set (abstract data type); Theoretical computer science; Distributed computing; Computer network; Programming language","score_opus":0.014784199580807612,"score_gpt":0.2867042894395307,"score_spread":0.27192008985872307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412081587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017129011,0.00003430355,0.9795679,0.00016676691,0.00044068712,0.000526819,0.000018806833,0.0016120337,0.00050367886],"genre_scores_gemma":[0.86717725,0.000012282149,0.13199511,0.00037058233,0.000017186157,0.00014334195,0.000008562484,0.00001882369,0.000256848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801666,0.00015986213,0.00039680366,0.0007102563,0.00028312192,0.0004332935],"domain_scores_gemma":[0.99833184,0.0005102007,0.00013742896,0.0007369266,0.00017056428,0.00011302473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022092868,0.00026927667,0.0002618302,0.00031730137,0.0011907299,0.00030786003,0.0006385282,0.00008888251,0.000022518341],"category_scores_gemma":[0.000014271974,0.00024782185,0.00008840853,0.0010765101,0.00007846685,0.0005111439,0.000024750754,0.00056019786,0.000036762125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005095927,0.00036471282,0.00019962253,0.00003336036,0.00006293751,0.000020979152,0.0003248847,0.7687801,0.002774829,0.000618184,0.0014107042,0.22535872],"study_design_scores_gemma":[0.00089973735,0.00039910685,0.00016301202,0.00043883955,0.000022055434,0.000029245624,0.00015444671,0.902824,0.08345217,0.0003004176,0.010859009,0.00045795288],"about_ca_topic_score_codex":0.00003307475,"about_ca_topic_score_gemma":0.000032638593,"teacher_disagreement_score":0.85004824,"about_ca_system_score_codex":0.0001259123,"about_ca_system_score_gemma":0.000105511026,"threshold_uncertainty_score":0.9999974},"labels":[],"label_agreement":null},{"id":"W4412536710","doi":"10.1109/tmc.2025.3591016","title":"An Underwater Secure Localization Scheme Based on Physical Layer Cryptographic Learning","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","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":"University of Ottawa","funders":"Tianjin Science and Technology Program; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Canada Research Chairs","keywords":"Computer science; Cryptography; Physical layer; Scheme (mathematics); Computer network; Cryptographic primitive; Layer (electronics); Cryptographic protocol; Computer security; Telecommunications; Wireless; Mathematics","score_opus":0.010047616246897097,"score_gpt":0.2513022671787013,"score_spread":0.2412546509318042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412536710","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19653761,0.000017455362,0.80201924,0.000022433773,0.00014533933,0.00019294462,0.0000016891609,0.0006177356,0.00044555095],"genre_scores_gemma":[0.9984195,0.0000072776397,0.0012346747,0.00014808896,0.00005012196,0.00004917057,0.000009201048,0.00004150433,0.00004041775],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989577,0.00013644513,0.00024667906,0.0002514722,0.00017088755,0.00023685205],"domain_scores_gemma":[0.9993513,0.00010878181,0.00003173281,0.00038648918,0.00005893125,0.00006274267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013368635,0.00020232315,0.00018824654,0.00027115564,0.0003754309,0.000109019435,0.00021169474,0.00010204757,0.000021302953],"category_scores_gemma":[3.6904282e-7,0.00020358246,0.00011393844,0.00051334244,0.000031898602,0.000099817385,0.0000016597152,0.0004712222,0.00003156881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009916868,0.0001573098,0.00010558787,0.00005252661,0.00003292489,5.5836654e-7,0.00035739847,0.9705109,0.013828945,0.000043502067,0.000008770269,0.014891647],"study_design_scores_gemma":[0.00036687823,0.000118383425,0.000045811088,0.00015611065,0.000016211674,7.0793095e-7,0.00023779705,0.94662,0.050180558,0.000058390568,0.002013303,0.00018588356],"about_ca_topic_score_codex":0.000012684147,"about_ca_topic_score_gemma":0.000008551772,"teacher_disagreement_score":0.8018819,"about_ca_system_score_codex":0.000078448895,"about_ca_system_score_gemma":0.00001691629,"threshold_uncertainty_score":0.8301852},"labels":[],"label_agreement":null},{"id":"W4412567070","doi":"10.1109/tmc.2025.3591822","title":"An Overlapping Coalition Game Approach for Collaborative Block Mining and Edge Task Offloading in MEC-Assisted Blockchain Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Blockchain Technology Applications and Security","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Key Research and Development Program of China; Ministry of Education, India; Queen's University; Nanyang Technological University; Info-communications Media Development Authority; National Research Foundation Singapore; Natural Science Foundation of Guangdong Province; National Research Foundation; Queen's University Belfast","keywords":"Computer science; Blockchain; Block (permutation group theory); Mobile edge computing; Task (project management); Enhanced Data Rates for GSM Evolution; Edge computing; Computer network; Game theory; Computer security; Distributed computing; Server; Artificial intelligence","score_opus":0.012603391807090983,"score_gpt":0.2607983203611138,"score_spread":0.2481949285540228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412567070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1274136,0.0002889059,0.87046903,0.00013603046,0.00025638455,0.0009824341,0.00001072188,0.00033668996,0.0001061842],"genre_scores_gemma":[0.91162723,0.000018743878,0.087681904,0.00014804958,0.00003865182,0.00044735993,0.000005503203,0.000013753596,0.000018812761],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980741,0.00015161044,0.0004608878,0.0007856454,0.000115441995,0.00041230887],"domain_scores_gemma":[0.99870557,0.00043888847,0.00014324879,0.0005158137,0.000121903235,0.000074574666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006515258,0.00024288919,0.0003416702,0.0004926754,0.0005878992,0.000115413415,0.00046046678,0.00026190365,6.876202e-7],"category_scores_gemma":[0.000008162773,0.00027974707,0.00006714374,0.0016387431,0.000105360516,0.0001316252,0.000013695887,0.00036090915,2.6890163e-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.000041150346,0.00073163403,0.00012329462,0.000092064234,0.00008364294,0.0000029464118,0.0025385742,0.7593237,0.0025834793,0.011358742,0.00008901119,0.22303171],"study_design_scores_gemma":[0.00083106034,0.00014727803,0.00019332972,0.000114791,0.000020659665,0.000010648375,0.0008942303,0.9952216,0.0017986079,0.00036328644,0.00015732845,0.00024716128],"about_ca_topic_score_codex":0.000020804362,"about_ca_topic_score_gemma":0.000041988336,"teacher_disagreement_score":0.7842136,"about_ca_system_score_codex":0.00013360694,"about_ca_system_score_gemma":0.000083949606,"threshold_uncertainty_score":0.9999655},"labels":[],"label_agreement":null},{"id":"W4412718920","doi":"10.1109/tmc.2025.3588474","title":"Minimizing Age of Semantic Information for Analytics-Oriented Video Streaming Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Analytics; Video streaming; Multimedia; World Wide Web; Computer network; Data science","score_opus":0.009948387836885798,"score_gpt":0.24869344685170364,"score_spread":0.23874505901481785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412718920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007326844,0.000017840983,0.98989147,0.000035864527,0.0011434166,0.0007561151,0.000010292346,0.00021145097,0.0006067222],"genre_scores_gemma":[0.9271798,0.0000061058154,0.07256782,0.000075246324,0.000015015622,0.000050828912,0.000016076554,0.0000063066404,0.000082760496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854016,0.00004173862,0.000780946,0.0001823804,0.00023168465,0.00022307418],"domain_scores_gemma":[0.99851006,0.00036437123,0.00033687838,0.00037947643,0.00036619316,0.00004301813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036471453,0.000154842,0.00024215668,0.00063106365,0.00030672696,0.00017959943,0.00035559843,0.00008195959,0.0000019151703],"category_scores_gemma":[0.000027605383,0.00016669091,0.00011811905,0.00088735827,0.00003125266,0.0012050251,0.0000073551146,0.00012423801,0.000006094174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009301394,0.000040377887,0.000008943272,0.00021187525,0.000039372757,3.5146664e-7,0.000997414,0.9541377,0.00014648588,0.0023351281,0.000050090497,0.042022977],"study_design_scores_gemma":[0.00055255665,0.0000850357,0.00003283745,0.00030447828,0.000025627553,0.0000027044364,0.00060648884,0.9918861,0.0058304965,0.000025926274,0.0005178913,0.00012988779],"about_ca_topic_score_codex":0.00002506324,"about_ca_topic_score_gemma":0.0000024613205,"teacher_disagreement_score":0.919853,"about_ca_system_score_codex":0.000121938276,"about_ca_system_score_gemma":0.00008893875,"threshold_uncertainty_score":0.6797458},"labels":[],"label_agreement":null},{"id":"W4412939447","doi":"10.1109/tmc.2025.3594358","title":"An Enhanced Dual-Currency VCG Auction Mechanism for Resource Allocation in IoV: A Value of Information Perspective","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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 Waterloo","funders":"National Natural Science Foundation of China","keywords":"Computer science; Dual (grammatical number); Mechanism (biology); Perspective (graphical); Value (mathematics); Mechanism design; Vickrey–Clarke–Groves auction; Resource allocation; Currency; Computer network; Vickrey auction; Common value auction; Distributed computing; Auction theory; Microeconomics; Artificial intelligence","score_opus":0.006563893447016584,"score_gpt":0.2661177403370514,"score_spread":0.2595538468900348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412939447","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091113344,0.000016008675,0.9070485,0.0003241118,0.0002544063,0.0008587392,0.000007188774,0.00022938871,0.0001482917],"genre_scores_gemma":[0.96948457,0.000008754239,0.030061638,0.00009281203,0.000012050584,0.00032159445,0.0000045245033,0.000005062263,0.000008991328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988197,0.00007359966,0.0004388432,0.0003373784,0.0001324013,0.00019806236],"domain_scores_gemma":[0.99882793,0.0001486593,0.00017283697,0.000503211,0.00031807864,0.000029284472],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040502797,0.00013533654,0.00018269331,0.0006053629,0.00026587024,0.00004168538,0.00037178374,0.00016082531,0.0000014289678],"category_scores_gemma":[0.000015675943,0.00015594652,0.00007610298,0.0010396962,0.000048356167,0.00040754525,0.000005820175,0.0002548607,0.0000024867434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028741117,0.00048328136,0.000002342225,0.00005606906,0.000026175587,1.2905844e-7,0.004659178,0.20391802,0.007833123,0.5856414,0.000010868461,0.19734067],"study_design_scores_gemma":[0.0005516192,0.00023647686,0.00006604659,0.000070609756,0.000012422594,0.0000022279376,0.0013133386,0.80048674,0.16175474,0.035292193,0.000077697034,0.00013587419],"about_ca_topic_score_codex":0.00009284274,"about_ca_topic_score_gemma":0.000034365956,"teacher_disagreement_score":0.87837124,"about_ca_system_score_codex":0.0001925343,"about_ca_system_score_gemma":0.000093426956,"threshold_uncertainty_score":0.63593143},"labels":[],"label_agreement":null},{"id":"W4413212349","doi":"10.1109/tmc.2025.3597713","title":"Energy-Efficient and Real-Time Sensing for Federated Continual Learning via Sample-Driven Control","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Microwave Imaging and Scattering Analysis","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":"University of Saskatchewan","funders":"Trường Đại học Bách Khoa Hà Nội","keywords":"Computer science; Sample (material); Efficient energy use; Control (management); Energy (signal processing); Real-time computing; Artificial intelligence; Electrical engineering","score_opus":0.003918115053836531,"score_gpt":0.21132426555711756,"score_spread":0.20740615050328104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413212349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.204833,0.000046800946,0.79411256,0.00002782741,0.0002291678,0.00014264527,0.000014215403,0.0004840834,0.000109701636],"genre_scores_gemma":[0.9949929,0.000016050291,0.004653384,0.000047000794,0.00004397794,0.000013098921,0.00000790105,0.000036585123,0.00018910879],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998931,0.00006765756,0.00030526114,0.00029722374,0.000080452795,0.00031840664],"domain_scores_gemma":[0.99906284,0.00063058897,0.000042069652,0.0001266818,0.000076321085,0.000061483865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018559214,0.00020927546,0.0003220899,0.00023253018,0.00050838577,0.00012717934,0.00005871864,0.000073199655,0.000008847337],"category_scores_gemma":[0.000007232552,0.000235632,0.0001261761,0.00023818586,0.000039281284,0.000027194048,0.00000165831,0.0002052537,0.0000036870597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010661513,0.000016320826,0.000016307176,0.000033359902,0.00014054409,0.0000011674741,0.00014390901,0.7889831,0.111409046,0.0000017738765,0.00005239808,0.099191435],"study_design_scores_gemma":[0.00067310967,0.000035143123,0.000016078706,0.00011721021,0.00011160222,0.0000068262875,0.000084547755,0.97602063,0.02231204,0.000006075137,0.0004157941,0.0002009139],"about_ca_topic_score_codex":0.00015452069,"about_ca_topic_score_gemma":0.000012961907,"teacher_disagreement_score":0.7901599,"about_ca_system_score_codex":0.00008198131,"about_ca_system_score_gemma":0.000014700161,"threshold_uncertainty_score":0.9608794},"labels":[],"label_agreement":null},{"id":"W4413267640","doi":"10.1109/tmc.2025.3593263","title":"Latency Minimization for Movable Relay-Aided D2D-MEC Communication Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Antenna Design and 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":"Concordia University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Relay; Computer network; Latency (audio); Minification; Telecommunications","score_opus":0.00948214675521368,"score_gpt":0.230651726873177,"score_spread":0.22116958011796334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413267640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009080172,0.00043136853,0.98695976,0.000024880665,0.0010394172,0.0008493877,0.000010193969,0.00061644166,0.0009884114],"genre_scores_gemma":[0.9777421,0.00021997315,0.020833813,0.000036421614,0.000028401362,0.00018239632,0.000027717797,0.000038936705,0.0008902551],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990759,0.000052788193,0.000379868,0.00018946298,0.00009226999,0.00020971258],"domain_scores_gemma":[0.99924195,0.00022323096,0.000053959375,0.00031413703,0.00013083045,0.000035872356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018649294,0.0001590402,0.00018997771,0.00021728747,0.00034040853,0.000074887466,0.00015656634,0.00012892479,0.000011028378],"category_scores_gemma":[0.00000522943,0.000180151,0.00008426274,0.00042826516,0.000021923322,0.00013954384,0.0000013208141,0.00017262217,0.000013524394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013973584,0.00004310815,0.0000056523945,0.0001022068,0.000042071064,2.0383284e-7,0.00018749891,0.9892821,0.0010134905,0.00018818233,0.00049770426,0.008623845],"study_design_scores_gemma":[0.0004901207,0.000039354192,0.000013189656,0.0002283126,0.000044913966,0.000001879806,0.00023232438,0.99517965,0.0028154473,0.0000438292,0.00075402803,0.00015693782],"about_ca_topic_score_codex":0.000019694795,"about_ca_topic_score_gemma":0.0000042354122,"teacher_disagreement_score":0.9686619,"about_ca_system_score_codex":0.00012939719,"about_ca_system_score_gemma":0.000023989787,"threshold_uncertainty_score":0.73463446},"labels":[],"label_agreement":null},{"id":"W4413318797","doi":"10.1109/tmc.2025.3599917","title":"RipeTrack: Assessing Fruit Ripeness and Remaining Lifetime Using Smartphones","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Horticultural and Viticultural Research","field":"Agricultural and Biological Sciences","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":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Ripeness; Computer science","score_opus":0.03647660004323944,"score_gpt":0.3164903274517235,"score_spread":0.28001372740848407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413318797","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.99027073,0.0001529779,0.008115247,0.00026625246,0.00037403527,0.00028305466,0.000008460226,0.00013302805,0.00039623195],"genre_scores_gemma":[0.99860513,0.00003417995,0.00064809923,0.0001492753,0.00012173666,0.000013903851,0.000004578861,0.0000016848172,0.0004214359],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.998458,0.00013466604,0.0003098486,0.0004305741,0.00023771364,0.00042915653],"domain_scores_gemma":[0.9990578,0.0005622196,0.00006490101,0.00006491477,0.00012563377,0.00012448797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031853883,0.00020773937,0.0002516679,0.000041344912,0.0011813228,0.00034165868,0.00017449273,0.00011867458,0.0000979656],"category_scores_gemma":[0.000020947075,0.00008731107,0.00010869621,0.00065982447,0.00009778904,0.00025837633,0.000009967978,0.0003432403,0.000013485855],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020253963,0.00010323662,0.00065725343,0.000031594267,0.000034593922,0.00000826512,0.00015709896,0.0052321265,0.4379071,0.000022818303,0.00002410651,0.5558016],"study_design_scores_gemma":[0.0019942266,0.0012464786,0.1788771,0.0034517942,0.0003628486,0.00023543074,0.01518032,0.30049503,0.48580676,0.00050362654,0.009075054,0.0027713554],"about_ca_topic_score_codex":0.00025166376,"about_ca_topic_score_gemma":0.00012327451,"teacher_disagreement_score":0.5530302,"about_ca_system_score_codex":0.000065204484,"about_ca_system_score_gemma":0.000020320942,"threshold_uncertainty_score":0.90859},"labels":[],"label_agreement":null},{"id":"W4413318829","doi":"10.1109/tmc.2025.3599838","title":"A Novel Secure Split Federated Semantic Learning Framework and its Optimization for Digital Twin Network Evolution","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Distributed computing; Theoretical computer science; Computer network","score_opus":0.014943278642971245,"score_gpt":0.26461885085755343,"score_spread":0.2496755722145822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413318829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011510274,0.00022393606,0.9845589,0.0009420966,0.00081479555,0.00069068087,0.0000153545,0.001198095,0.00004591124],"genre_scores_gemma":[0.67222095,0.000014620185,0.32757154,0.000055063083,0.00003724688,0.00004840773,0.0000067273118,0.000014120908,0.000031321502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833024,0.000046417797,0.00034395867,0.00067274476,0.00017180492,0.00043481603],"domain_scores_gemma":[0.9978158,0.0007552166,0.00012996141,0.0010922367,0.00015586473,0.00005090788],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003108663,0.00022825561,0.00023489517,0.00021964376,0.00093892985,0.0005868981,0.0024178335,0.00023966952,0.00000337869],"category_scores_gemma":[0.00093119405,0.00025478587,0.000075305456,0.0011266178,0.000045813173,0.00060440635,0.0004916645,0.0005911097,0.000003926686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014484353,0.000077045515,0.00003620611,0.00006719704,0.000044980865,9.876635e-7,0.000055893695,0.954901,0.00012907862,0.0013371367,0.00042837314,0.042907607],"study_design_scores_gemma":[0.00037210653,0.000118627155,0.000039361585,0.00044491584,0.000019040961,0.000010574526,0.0000515983,0.9903759,0.00062106363,0.007598303,0.00012721583,0.00022128757],"about_ca_topic_score_codex":0.0000057014463,"about_ca_topic_score_gemma":0.000002203728,"teacher_disagreement_score":0.6607107,"about_ca_system_score_codex":0.00014857699,"about_ca_system_score_gemma":0.000074369236,"threshold_uncertainty_score":0.99999046},"labels":[],"label_agreement":null},{"id":"W4413318886","doi":"10.1109/tmc.2025.3599885","title":"Distributed Resource Allocation and Coordinated Scheduling for End-Edge-Cloud Collaborative Computing","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Key Research and Development Program of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computer science; Cloud computing; Distributed computing; Scheduling (production processes); Resource allocation; Edge computing; Computer network; Operating system","score_opus":0.011005535577206257,"score_gpt":0.26607694674805243,"score_spread":0.2550714111708462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413318886","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04537484,0.000263246,0.95024437,0.00045329804,0.0015274748,0.0011250918,0.000080994585,0.0006676431,0.0002630414],"genre_scores_gemma":[0.97371197,0.0000061357127,0.025703277,0.0002032818,0.000119440774,0.000055684704,0.000053658077,0.00002205922,0.00012451288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973109,0.00026571387,0.0006976593,0.0009102318,0.00023968294,0.00057582144],"domain_scores_gemma":[0.99723804,0.0013401153,0.00027854525,0.0005377683,0.00046429315,0.00014125144],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008912063,0.0003722599,0.00047076575,0.0003015634,0.0012861212,0.00045570853,0.0006774704,0.00018115781,0.000002147589],"category_scores_gemma":[0.000045728146,0.00040434857,0.00013805537,0.0017530334,0.00012928978,0.00020566757,0.000027558635,0.0003905834,0.000006939414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049796283,0.00020647782,0.000047647423,0.00016471435,0.00015646948,0.000004124238,0.0013316291,0.8923553,0.00075862603,0.0058205635,0.00078505545,0.098319545],"study_design_scores_gemma":[0.0013325035,0.00021782768,0.00008790582,0.00046439815,0.000040773924,0.000014271484,0.0006633765,0.984444,0.004513688,0.0002300191,0.0075939796,0.0003972088],"about_ca_topic_score_codex":0.000025549858,"about_ca_topic_score_gemma":0.0000059213708,"teacher_disagreement_score":0.9283371,"about_ca_system_score_codex":0.0001797043,"about_ca_system_score_gemma":0.0002063984,"threshold_uncertainty_score":0.99984086},"labels":[],"label_agreement":null},{"id":"W4413343973","doi":"10.1109/tmc.2025.3600434","title":"SC-GIR: Goal-Oriented Semantic Communication via Invariant Representation Learning for Image Transmission","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Data Compression Techniques","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":"Memorial University of Newfoundland","funders":"","keywords":"Computer science; Invariant (physics); Theoretical computer science; Representation (politics); Artificial intelligence; Natural language processing; Multimedia; Mathematics","score_opus":0.012042501656240072,"score_gpt":0.31176892062399836,"score_spread":0.2997264189677583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413343973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020840054,0.00011839303,0.9945252,0.0004254206,0.0003510962,0.0011726428,0.000004798771,0.0011451163,0.00017334234],"genre_scores_gemma":[0.58316183,0.000073515606,0.41621056,0.00013754284,0.000013933245,0.00018900083,0.000017621935,0.000018552711,0.00017740883],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777263,0.0003070106,0.000618021,0.0006883624,0.00027158976,0.00034236308],"domain_scores_gemma":[0.997559,0.0007558171,0.00019667241,0.0010825441,0.00032026993,0.00008566624],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00056410703,0.00024672554,0.00029032637,0.0003892875,0.0010605268,0.00016680219,0.00090960995,0.00011792763,0.000011596341],"category_scores_gemma":[0.00003888645,0.00025659386,0.00016661228,0.0009373386,0.00007053663,0.0007947053,0.000029237895,0.0005132301,0.000010530726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055101813,0.00024837424,0.000010451423,0.000077643956,0.00003742562,0.00000301343,0.00056312745,0.18092759,0.06564278,0.0012831973,0.00034136663,0.7508099],"study_design_scores_gemma":[0.0005915199,0.00012422701,0.000043001222,0.0004125752,0.000022041886,0.000007810359,0.00006491021,0.7867558,0.2078302,0.0015535908,0.0023878217,0.00020649291],"about_ca_topic_score_codex":0.00004934626,"about_ca_topic_score_gemma":0.0000050306257,"teacher_disagreement_score":0.75060344,"about_ca_system_score_codex":0.00012642269,"about_ca_system_score_gemma":0.00006785583,"threshold_uncertainty_score":0.9999886},"labels":[],"label_agreement":null},{"id":"W4413677374","doi":"10.1109/tmc.2025.3602911","title":"PPBR: Privacy-Preserving and Byzantine-Robust Edge-Assisted Hierarchical Federated Learning in Mobile Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","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 Waterloo","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Computer science; Computer network; Enhanced Data Rates for GSM Evolution; Information privacy; Mobile computing; Distributed computing; Computer security; Artificial intelligence","score_opus":0.019793392581460522,"score_gpt":0.27110543312694985,"score_spread":0.25131204054548933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413677374","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13210133,0.0004875751,0.8623039,0.001660857,0.00077551865,0.00064398086,0.000003441731,0.0016217766,0.00040160408],"genre_scores_gemma":[0.9227593,0.00019322395,0.07656997,0.00015907439,0.00003457165,0.00013182616,0.0000060707794,0.000032253418,0.000113738446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964344,0.0003907333,0.0007540465,0.0012482245,0.00032031158,0.00085229834],"domain_scores_gemma":[0.99515706,0.0012444364,0.00017464526,0.0032044149,0.000098358374,0.00012108954],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008871468,0.00041950046,0.0005140547,0.00075865537,0.00092838553,0.000579481,0.008248342,0.00035650723,0.000014874071],"category_scores_gemma":[0.00088119507,0.00045526162,0.00011409125,0.0023778062,0.00019197489,0.0005653892,0.0031216098,0.002076354,0.000008405942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003295498,0.00030702163,0.0010010423,0.00008607205,0.00006340708,0.000047116977,0.00014661763,0.56873703,0.0007744019,0.00014240172,0.0017469871,0.42691496],"study_design_scores_gemma":[0.00085674215,0.00015566744,0.0013769299,0.0005378219,0.000013729199,0.000030132776,0.0000975524,0.9925633,0.0021014377,0.000892077,0.000978404,0.00039617103],"about_ca_topic_score_codex":0.00008012077,"about_ca_topic_score_gemma":0.000055605364,"teacher_disagreement_score":0.79065794,"about_ca_system_score_codex":0.00014847737,"about_ca_system_score_gemma":0.00013400814,"threshold_uncertainty_score":0.9997899},"labels":[],"label_agreement":null},{"id":"W4413925784","doi":"10.1109/tmc.2025.3604722","title":"Uplink Resource Allocation for RSMA-Aided Digital Twin-Assisted User-Centric Cell-Free Massive MIMO Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","field":"Engineering","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":"Université Laval; University of Calgary; École de Technologie Supérieure","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Telecommunications link; Resource allocation; MIMO; Computer network; Distributed computing","score_opus":0.008187402815690583,"score_gpt":0.2244636609554674,"score_spread":0.21627625813977683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413925784","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009138657,0.00031792503,0.984515,0.000028247778,0.0019181632,0.0018896378,0.0000681824,0.0009635237,0.0011606229],"genre_scores_gemma":[0.9902992,0.000011592425,0.0072853304,0.000021813996,0.00011685097,0.0003656433,0.000051177034,0.000091659414,0.0017567276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982431,0.000043732874,0.0006790579,0.0004438913,0.00016330884,0.00042692394],"domain_scores_gemma":[0.9985402,0.0004631353,0.00012216732,0.0005919744,0.00019133324,0.00009116781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00015401519,0.00032741032,0.0003639011,0.00040396533,0.0003320982,0.00019385897,0.00031929274,0.0001958867,0.0000050265326],"category_scores_gemma":[0.000022251916,0.0003806389,0.00017117658,0.0007612426,0.000028523868,0.0002693262,0.0000049056935,0.0002713011,0.000023725079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025032294,0.000089796835,0.000007724148,0.00040831597,0.000076677534,0.0000015147627,0.00013116552,0.9820622,0.0017299067,0.000046096044,0.0012360587,0.014185467],"study_design_scores_gemma":[0.0015206956,0.000076099655,0.000010278908,0.00034986695,0.00008057791,0.0000072044018,0.00048496205,0.98283684,0.010725874,0.000012624742,0.003549864,0.00034512472],"about_ca_topic_score_codex":0.000010897081,"about_ca_topic_score_gemma":0.000004467361,"teacher_disagreement_score":0.9811605,"about_ca_system_score_codex":0.00046302285,"about_ca_system_score_gemma":0.000046746794,"threshold_uncertainty_score":0.9998646},"labels":[],"label_agreement":null},{"id":"W4414079705","doi":"10.1109/tmc.2025.3606847","title":"MaestroBot: Generalized Gesture-Driven Hierarchical Coordination for Robotic Formations","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Robot Manipulation and Learning","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":"Impact","funders":"National Natural Science Foundation of China","keywords":"Scalability; Adaptability; Wearable computer; Wireless; Testbed; Swarm behaviour; Robot; Domain (mathematical analysis); Gesture","score_opus":0.014953940781619835,"score_gpt":0.26316172608730876,"score_spread":0.24820778530568893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414079705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015594613,0.00003107547,0.98133415,0.0001390258,0.001112045,0.0006182094,0.0000013189408,0.0006047936,0.00056477456],"genre_scores_gemma":[0.9840852,0.0000071531963,0.015091423,0.00010218684,0.000067795685,0.00014475119,0.000019928568,0.000030951825,0.00045062625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905634,0.000046162106,0.00034089398,0.00019352844,0.00010310981,0.00025999363],"domain_scores_gemma":[0.9994305,0.00023009631,0.00003836937,0.00017622786,0.00006855854,0.000056274137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011440428,0.0001713196,0.00020042222,0.000288176,0.00040001448,0.00007563757,0.00012183242,0.00010640922,0.000032465716],"category_scores_gemma":[0.000007730485,0.00019195006,0.0001410218,0.0003520948,0.0000231403,0.00013008964,0.0000013993574,0.00031937665,0.0000269378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007914054,0.00003473767,0.000021447848,0.000060655682,0.000045161236,3.102871e-7,0.00018394845,0.96913224,0.0010375422,0.00062738423,0.00028671126,0.028561912],"study_design_scores_gemma":[0.0006691935,0.000044967193,0.00031590994,0.00006297687,0.00004123607,0.0000029520102,0.00005145055,0.99624777,0.0013228742,0.00013392775,0.0009413628,0.00016537374],"about_ca_topic_score_codex":0.000005299512,"about_ca_topic_score_gemma":0.000009759093,"teacher_disagreement_score":0.96849054,"about_ca_system_score_codex":0.00012362715,"about_ca_system_score_gemma":0.000020780033,"threshold_uncertainty_score":0.78274965},"labels":[],"label_agreement":null},{"id":"W4414079816","doi":"10.1109/tmc.2025.3607138","title":"Mobility Resilient Vehicular Federated Learning: Enhancing Training Efficiency in Dynamic Environments","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Scheduling (production processes); Federated learning; Latency (audio); Key (lock); Vehicular ad hoc network; Robustness (evolution); Training (meteorology); Spectral efficiency; Cloud computing","score_opus":0.01451585427400681,"score_gpt":0.26887630076241426,"score_spread":0.25436044648840744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414079816","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.340198,0.00007539451,0.65776974,0.00041452647,0.00046420866,0.00038587037,0.0000019569243,0.00054934894,0.00014094485],"genre_scores_gemma":[0.97213966,0.000029194036,0.027560743,0.00008135344,0.0000056257572,0.00007319146,0.000003014956,0.000017018107,0.00009021756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99687207,0.00029602612,0.0006607392,0.0011169015,0.00037828722,0.00067595893],"domain_scores_gemma":[0.9964091,0.00055173103,0.00014081907,0.0028002667,0.000030265533,0.000067794215],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0010961433,0.0003080942,0.00035485555,0.00055358233,0.00066332426,0.00018910509,0.006052427,0.00020449626,0.000009698703],"category_scores_gemma":[0.0007080199,0.00034367535,0.000114049544,0.0014973712,0.00012959566,0.0003204673,0.00080254045,0.0011572755,0.000026494392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013553721,0.00049177714,0.00013225504,0.00004343043,0.000031694217,0.00002787754,0.0005351697,0.77892834,0.016826136,0.00003714468,0.000057425506,0.2028752],"study_design_scores_gemma":[0.00050064473,0.00013431475,0.000569252,0.00025352076,0.000008112507,0.000006250015,0.0003761565,0.959417,0.037284397,0.00093000534,0.00024071154,0.0002796672],"about_ca_topic_score_codex":0.000040578732,"about_ca_topic_score_gemma":0.00005078956,"teacher_disagreement_score":0.6319416,"about_ca_system_score_codex":0.00062100566,"about_ca_system_score_gemma":0.00016048212,"threshold_uncertainty_score":0.99990153},"labels":[],"label_agreement":null},{"id":"W4414165923","doi":"10.1109/tmc.2025.3607599","title":"Reliable Intelligent Reflecting Surface-Assisted Mobile Edge Computing Systems: A Physical Layer Security and Encryption Design","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","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":"École de Technologie Supérieure","funders":"","keywords":"Encryption; Physical layer; Mobile edge computing; Wireless; Energy consumption; Secure transmission; Wireless network; Mobile computing; Cryptography","score_opus":0.03259891439398486,"score_gpt":0.3060555179537226,"score_spread":0.2734566035597377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414165923","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30846846,0.0008242572,0.6878139,0.000011039945,0.0004700582,0.00064841134,0.0000037007994,0.0016130455,0.00014713831],"genre_scores_gemma":[0.98235095,0.00028831788,0.017125431,0.000014434681,0.000030220031,0.00010123309,0.0000026852344,0.000049472426,0.0000372684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834585,0.00013506191,0.00051700964,0.00042871182,0.00016765234,0.00040571138],"domain_scores_gemma":[0.998319,0.0008030472,0.000107508626,0.0005918895,0.00011825957,0.000060306425],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036411808,0.00032053277,0.00041186574,0.00025263973,0.00056555844,0.00011728016,0.0003180696,0.00017956301,0.0000031527904],"category_scores_gemma":[0.000014536654,0.00035891263,0.00009148162,0.00075033447,0.000098385346,0.00017060005,0.000019661216,0.00082310877,0.000013436204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010669638,0.000106091866,0.000018059362,0.00017396243,0.000059724814,0.000001374911,0.00079543906,0.92097217,0.014136089,0.00008384011,0.00003710898,0.063605495],"study_design_scores_gemma":[0.0002510321,0.00009454397,0.000015799475,0.00046251947,0.000026818541,0.000009651764,0.0017070693,0.8947255,0.10191452,0.00017825849,0.00033850112,0.00027580105],"about_ca_topic_score_codex":0.000034747456,"about_ca_topic_score_gemma":0.0000051909383,"teacher_disagreement_score":0.6738825,"about_ca_system_score_codex":0.00039159023,"about_ca_system_score_gemma":0.000029991186,"threshold_uncertainty_score":0.9998863},"labels":[],"label_agreement":null},{"id":"W4414229223","doi":"10.1109/tmc.2025.3610915","title":"Accelerating Stable Matching Between Workers and Spatial-Temporal Tasks for Dynamic MCS: A Stagewise Service Trading Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Transportation and Mobility Innovations","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":"Western University","funders":"Aeronautical Science Foundation of China; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Matching (statistics); Futures contract; Key (lock); Service (business); Task (project management); Incentive; Software deployment; Path (computing); Pareto principle","score_opus":0.020129966484849562,"score_gpt":0.2632609947721499,"score_spread":0.24313102828730038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414229223","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36099452,0.000035443183,0.63735807,0.000048217327,0.00024880358,0.00066817435,0.00008086836,0.00039427856,0.00017161557],"genre_scores_gemma":[0.9753775,0.0000050716885,0.024121137,0.00007870458,0.000030350471,0.00020438018,0.00007459831,0.000047218105,0.000061017272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985938,0.000028374332,0.0005391313,0.00036050507,0.00012504004,0.00035315647],"domain_scores_gemma":[0.9992854,0.0002761799,0.00006147741,0.0002174059,0.00008583598,0.00007369483],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029176232,0.0002572959,0.00030478838,0.00030585512,0.00052414305,0.0001350411,0.00013661143,0.00012241461,0.000011398955],"category_scores_gemma":[0.0000025033155,0.00030540908,0.00008541392,0.0006925042,0.00003698244,0.0001972149,0.0000015737501,0.00038904144,0.0000013006743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015301941,0.00006973981,0.0010035487,0.00063399377,0.00016415361,4.637751e-7,0.001976868,0.89582235,0.0018325578,0.00006147007,0.000019449832,0.09840011],"study_design_scores_gemma":[0.0009369505,0.00003756843,0.0023919316,0.00023226741,0.00010875399,0.0000014389831,0.0028635613,0.9906043,0.002173241,0.00012491351,0.00019372576,0.00033134682],"about_ca_topic_score_codex":0.00043741014,"about_ca_topic_score_gemma":0.0006262359,"teacher_disagreement_score":0.614383,"about_ca_system_score_codex":0.00012709737,"about_ca_system_score_gemma":0.000053879336,"threshold_uncertainty_score":0.9999398},"labels":[],"label_agreement":null},{"id":"W4414348312","doi":"10.1109/tmc.2025.3612221","title":"Energy-Efficient Multi-UAV Navigation for Cooperative Data Sensing and Transmission","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Transmission (telecommunications); Data transmission; Signal processing; Signal-to-noise ratio (imaging); Key (lock)","score_opus":0.016771140461484393,"score_gpt":0.2689798549207823,"score_spread":0.25220871445929793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414348312","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015132587,0.00018511178,0.9836362,0.000026110114,0.00024075652,0.00043010816,0.00004578642,0.00023408393,0.00006924644],"genre_scores_gemma":[0.9390799,0.000058560083,0.06062928,0.000029212591,0.000021087606,0.000030245954,0.000071388524,0.000020950636,0.000059402315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928653,0.00001940941,0.00021605122,0.00027600626,0.000060357914,0.00014163538],"domain_scores_gemma":[0.9994848,0.0001341745,0.00002192472,0.00024908487,0.00007135293,0.000038698345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011444154,0.00012991199,0.0001220853,0.00010524049,0.00035580003,0.000054149572,0.00009109503,0.00006978924,0.000003030981],"category_scores_gemma":[0.0000012959487,0.00013717443,0.000027929995,0.00027279323,0.00002547448,0.000068088404,0.000002058666,0.00010538407,9.749186e-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.0000046665323,0.000032566677,3.8884795e-7,0.000032534692,0.000015740925,1.1115132e-7,0.00012170124,0.69340575,0.0028905207,0.00003115735,0.000031840653,0.303433],"study_design_scores_gemma":[0.0004398472,0.000021718753,0.0000065418494,0.00012479832,0.00003417818,0.0000018580736,0.000100895675,0.9757899,0.021579785,0.000009110445,0.0017684384,0.00012292019],"about_ca_topic_score_codex":0.000018091407,"about_ca_topic_score_gemma":0.000009263407,"teacher_disagreement_score":0.9239473,"about_ca_system_score_codex":0.00005126479,"about_ca_system_score_gemma":0.000018985074,"threshold_uncertainty_score":0.55938107},"labels":[],"label_agreement":null},{"id":"W4414404758","doi":"10.1109/tmc.2025.3612469","title":"Efficient Detection Framework Adaptation for Edge Computing: A Plug-and-Play Neural Network Toolbox Enabling Edge Deployment","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of British Columbia","funders":"Beijing Union University; National Natural Science Foundation of China","keywords":"Object detection; Enhanced Data Rates for GSM Evolution; Convolutional neural network; Edge device; Adaptation (eye); Toolbox; Object (grammar); Edge detection","score_opus":0.01918597781620886,"score_gpt":0.27286429295063575,"score_spread":0.2536783151344269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414404758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102650695,0.00024762575,0.8929461,0.00026395277,0.0021627324,0.0011999224,0.0000035715825,0.00048697644,0.000038413764],"genre_scores_gemma":[0.94754994,0.000013800127,0.05132829,0.00050344784,0.0003181371,0.00020480368,0.0000021074577,0.000025341853,0.000054118642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977404,0.00010402151,0.0005492077,0.00080943696,0.00021433514,0.00058262784],"domain_scores_gemma":[0.9978087,0.0012455966,0.00018380546,0.0004967366,0.00014095339,0.00012420736],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00042072134,0.00030478116,0.00030082845,0.00020510628,0.0015042172,0.0003221247,0.00044381418,0.00015128627,0.0000020069267],"category_scores_gemma":[0.000011500902,0.00031674982,0.00018533057,0.0011110284,0.000058033493,0.00011021996,0.000019327446,0.0004890475,0.0000056652198],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000150412125,0.00008824575,0.0000047646267,0.000021391159,0.000022539976,6.181739e-7,0.00030036268,0.6923566,0.00031010815,0.0012638749,0.000046708094,0.30556974],"study_design_scores_gemma":[0.00046202415,0.00017537325,0.000119344484,0.00019402498,0.00004148656,0.000009532022,0.00009204505,0.993583,0.0032596737,0.00059214263,0.001194455,0.0002768559],"about_ca_topic_score_codex":0.000021478781,"about_ca_topic_score_gemma":0.000014535347,"teacher_disagreement_score":0.84489924,"about_ca_system_score_codex":0.00012906345,"about_ca_system_score_gemma":0.00006299091,"threshold_uncertainty_score":0.9999285},"labels":[],"label_agreement":null},{"id":"W4414871320","doi":"10.1109/tmc.2025.3618147","title":"User-Centric Communication Service Provision for Edge-Assisted Mobile Augmented Reality","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Augmented Reality 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":"Carleton University; University of Waterloo","funders":"","keywords":"Upload; Frame (networking); Robustness (evolution); Cellular network; Service (business); Data as a service; Mobile telephony; Server; Data modeling","score_opus":0.022746937659097386,"score_gpt":0.30973428383872753,"score_spread":0.2869873461796301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414871320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008832496,0.00011394871,0.9847422,0.0013740911,0.0005002777,0.0031651119,0.00004621074,0.0008038385,0.0004217905],"genre_scores_gemma":[0.96525913,0.000053680666,0.031905353,0.00070073677,0.000026136711,0.0015832122,0.00005239935,0.000025604395,0.00039375617],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99749017,0.0002668129,0.000713468,0.000776225,0.00030407528,0.00044927438],"domain_scores_gemma":[0.9964508,0.00081823923,0.00027672865,0.0018471993,0.00048630475,0.0001207473],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00067363033,0.00028824553,0.00032058064,0.0003574994,0.0012675353,0.00022482562,0.0014794634,0.00017349445,0.000009707252],"category_scores_gemma":[0.00001230693,0.00031154795,0.00018999877,0.0022149384,0.000064422835,0.00034828618,0.00004020674,0.00040300924,0.000034577573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006172072,0.0019318066,0.000014760334,0.00027859805,0.00015802169,8.395299e-7,0.00089792087,0.36490738,0.0033858006,0.0037784455,0.002162237,0.62242246],"study_design_scores_gemma":[0.0015405903,0.00017892089,0.0003588525,0.00027855963,0.00008356538,0.000007328197,0.00028235916,0.9615355,0.016422128,0.0005313512,0.01840602,0.00037482733],"about_ca_topic_score_codex":0.00019819645,"about_ca_topic_score_gemma":0.00011102181,"teacher_disagreement_score":0.9564266,"about_ca_system_score_codex":0.00041932878,"about_ca_system_score_gemma":0.00020368864,"threshold_uncertainty_score":0.99993366},"labels":[],"label_agreement":null},{"id":"W4415123913","doi":"10.1109/tmc.2025.3620352","title":"Distributed and Controllable Mobile Text-to-Image Generation With User Preference Guarantee","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Video Analysis and Summarization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mobile edge computing; Adaptability; Reinforcement learning; Transmission (telecommunications); Mobile device; Enhanced Data Rates for GSM Evolution; Image quality; Resource allocation","score_opus":0.011616211442236677,"score_gpt":0.23733211896698778,"score_spread":0.2257159075247511,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415123913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.114082314,0.000053871667,0.8847057,0.00012996457,0.00018929866,0.000530746,0.000013114194,0.00014846928,0.00014648619],"genre_scores_gemma":[0.98140085,0.00002248251,0.017823389,0.00025295382,0.000025495265,0.000116321164,0.000009231772,0.000009219878,0.00034006572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985647,0.00009721805,0.00031334665,0.00055562216,0.00021052404,0.00025854795],"domain_scores_gemma":[0.99907583,0.0001295758,0.00007703281,0.00043507045,0.00021583638,0.00006662848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002300427,0.00019124789,0.00026198625,0.00023469552,0.00049284106,0.00039797666,0.0002951856,0.00006506667,0.000010792466],"category_scores_gemma":[0.0000063716247,0.00016632209,0.000057752142,0.0010377842,0.000046354045,0.00035660973,0.000009027707,0.00016512682,0.000014254662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030339063,0.00017493956,0.00015048272,0.000020457197,0.00009042216,0.000004245686,0.00032342723,0.87841934,0.012909647,0.00088420825,0.00025034492,0.10674216],"study_design_scores_gemma":[0.0007200159,0.0002668453,0.0001999388,0.00007698349,0.000048633723,0.0000049141713,0.000059438415,0.97696024,0.020341523,0.00005125889,0.0010575682,0.00021261074],"about_ca_topic_score_codex":0.000038843817,"about_ca_topic_score_gemma":0.00006734809,"teacher_disagreement_score":0.8673185,"about_ca_system_score_codex":0.000065181935,"about_ca_system_score_gemma":0.00007240041,"threshold_uncertainty_score":0.6782418},"labels":[],"label_agreement":null},{"id":"W4415482248","doi":"10.1109/tmc.2025.3624561","title":"Toward Seamless Hierarchical Federated Learning Under Intermittent Client Participation: A Stagewise Decision-Making Methodology","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Federated learning; Plan (archaeology); Backhaul (telecommunications); Edge device; Enhanced Data Rates for GSM Evolution; Focus (optics); Energy consumption","score_opus":0.08849740813167134,"score_gpt":0.38136382737250824,"score_spread":0.2928664192408369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415482248","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1071772,0.0004021262,0.8788337,0.0044461004,0.0063532228,0.0011135896,0.000028484814,0.001443858,0.0002017031],"genre_scores_gemma":[0.75904185,0.00013030805,0.23984945,0.00062898296,0.00006539502,0.00014578387,0.0000051749485,0.000052107716,0.0000809637],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99011135,0.0026155582,0.0020565002,0.0025833647,0.00093903864,0.0016942167],"domain_scores_gemma":[0.98381937,0.009287716,0.0006082461,0.0055073854,0.00050436246,0.0002729341],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.003127632,0.00090430176,0.0011777591,0.0013503588,0.002433085,0.0012576177,0.013121364,0.00076564774,0.00016281653],"category_scores_gemma":[0.005146982,0.0009871736,0.0005059176,0.0032546602,0.00062850025,0.00066086673,0.0045777364,0.003962485,0.00009927862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016477522,0.00056914473,0.000079026526,0.000110249304,0.0002639652,0.000074851785,0.0006457628,0.32975623,0.00020905337,0.00041131783,0.00060891104,0.6671067],"study_design_scores_gemma":[0.0011168106,0.00065704016,0.0004605569,0.0022148641,0.00015968854,0.000054041888,0.000904882,0.9691544,0.00482711,0.019173512,0.00048664556,0.0007904038],"about_ca_topic_score_codex":0.000048005815,"about_ca_topic_score_gemma":0.000034873807,"teacher_disagreement_score":0.66631633,"about_ca_system_score_codex":0.0010097258,"about_ca_system_score_gemma":0.0006429313,"threshold_uncertainty_score":0.99977916},"labels":[],"label_agreement":null},{"id":"W4415593467","doi":"10.1109/tmc.2025.3625263","title":"A QoE-Driven Personalized Incentive Mechanism Design for AIGC Services in Resource-Constrained Edge Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Distributed and Parallel Computing Systems","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Key Research and Development Program of China; Natural Science Foundation of Guangdong Province; Queen's University; National Natural Science Foundation of China; Queen's University Belfast","keywords":"Server; Mobile edge computing; Enhanced Data Rates for GSM Evolution; Service (business); Service provider; Key (lock); Incentive; Edge device; Resource allocation; Mobile telephony","score_opus":0.015474510073235338,"score_gpt":0.2570238871812326,"score_spread":0.24154937710799726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415593467","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068685464,0.00011918843,0.9894747,0.00014502698,0.0012572582,0.0014483742,0.000020935144,0.00040921723,0.0002567347],"genre_scores_gemma":[0.96578145,0.0000057825496,0.03339936,0.00034629198,0.000077979006,0.00016851963,0.0000073866972,0.000019204164,0.00019404979],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974484,0.0003689157,0.00057990546,0.00077004725,0.00021849024,0.00061423454],"domain_scores_gemma":[0.9981236,0.0010168187,0.00018280227,0.00046707725,0.00011146553,0.00009822854],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007836037,0.00032439607,0.00045030043,0.00036647543,0.0005178766,0.0002488284,0.0009820395,0.00018452463,0.000006047191],"category_scores_gemma":[0.000005184935,0.000344642,0.00022973743,0.0010618743,0.00007442999,0.00017523392,0.000017864444,0.00038608848,0.000007883638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000068706504,0.00018262278,0.00001297469,0.000092591115,0.00007847971,0.000008841979,0.0016599131,0.9647123,0.00016026977,0.005006337,0.000104035695,0.027912928],"study_design_scores_gemma":[0.001620523,0.00018123952,0.000024105502,0.00060489576,0.0000231361,0.000007726621,0.00038630833,0.99401706,0.00079625065,0.0007981885,0.0012442943,0.00029626436],"about_ca_topic_score_codex":0.00003182807,"about_ca_topic_score_gemma":0.000016943652,"teacher_disagreement_score":0.9589129,"about_ca_system_score_codex":0.0001746922,"about_ca_system_score_gemma":0.00014230167,"threshold_uncertainty_score":0.9999006},"labels":[],"label_agreement":null},{"id":"W4415748005","doi":"10.1109/tmc.2025.3627066","title":"5Guard: Isolation-Aware End-to-End Slicing of 5G Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","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":"University of Waterloo","funders":"Ministère de la Défense Nationale; Innovation for Defence Excellence and Security","keywords":"Slicing; Isolation (microbiology); Program slicing; Resource (disambiguation); Shared resource; Temporal isolation among virtual machines; Key (lock)","score_opus":0.011189251273626327,"score_gpt":0.2594960459611886,"score_spread":0.24830679468756225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415748005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013605177,0.0010018018,0.97422427,0.0003423738,0.008480566,0.0012054767,0.000027546303,0.00042797156,0.0006847996],"genre_scores_gemma":[0.9860428,0.0001888542,0.011873472,0.00090679736,0.00038765636,0.000065683955,0.0000046711575,0.00006344268,0.00046660446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945554,0.00036108744,0.0016950689,0.0015088383,0.0006725943,0.0012069893],"domain_scores_gemma":[0.9951305,0.0020758358,0.0004953535,0.001543676,0.0004194677,0.00033518535],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00095416786,0.00074315607,0.0010083803,0.00096062006,0.0013593422,0.00039706018,0.001432094,0.00044989152,0.00018224839],"category_scores_gemma":[0.000020161817,0.00085369643,0.0006039864,0.004302728,0.00018019103,0.0004054262,0.000039470415,0.0012966886,0.00005309202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041687294,0.00024082627,0.00019086039,0.00007634514,0.00013407561,0.0000058885685,0.00083038013,0.6195348,0.000066046465,0.00026882408,0.00026239824,0.37834784],"study_design_scores_gemma":[0.0008816886,0.00056174444,0.00078665273,0.0017517732,0.0001597501,0.000014019296,0.0001600872,0.9912268,0.0024030025,0.00012562097,0.001269157,0.00065968285],"about_ca_topic_score_codex":0.00033088593,"about_ca_topic_score_gemma":0.000088177396,"teacher_disagreement_score":0.9724376,"about_ca_system_score_codex":0.00029232676,"about_ca_system_score_gemma":0.00040039895,"threshold_uncertainty_score":0.99994075},"labels":[],"label_agreement":null},{"id":"W4416368409","doi":"10.1109/tmc.2025.3634587","title":"Graph Neural Network-Based Multicast Routing for On-Demand Streaming Services in 6G Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","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 Waterloo","funders":"","keywords":"Multicast; Protocol Independent Multicast; Multipath routing; Xcast; Geographic routing; Static routing; Distance Vector Multicast Routing Protocol; Routing (electronic design automation); Dynamic Source Routing; Reinforcement learning","score_opus":0.010614371773958593,"score_gpt":0.25505384241323914,"score_spread":0.24443947063928054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416368409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0668859,0.00017858672,0.929631,0.00014199177,0.0019260527,0.0007430235,0.000004337721,0.00042586203,0.000063269385],"genre_scores_gemma":[0.97815424,0.000010098538,0.020429699,0.0010265067,0.00019137592,0.00012851605,0.000004810526,0.000028956927,0.000025799969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745035,0.0001388054,0.000585638,0.0007949462,0.00020457958,0.0008256932],"domain_scores_gemma":[0.99701715,0.0020797837,0.00015547498,0.0005714003,0.00007479948,0.00010142435],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005539121,0.00035495832,0.00039790117,0.0003324197,0.0007150026,0.00027086254,0.0006952897,0.0001738976,0.0000039664956],"category_scores_gemma":[0.000005975102,0.00036361205,0.00023848336,0.0013915198,0.000043423457,0.00019580398,0.000013546003,0.0005520529,0.0000027860847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039336664,0.00014465021,0.0008062158,0.00003985915,0.00002372016,0.000005543552,0.00011766403,0.8346119,0.0000071787827,0.0002971619,0.000025738456,0.16388106],"study_design_scores_gemma":[0.0013103356,0.00020823223,0.0011064863,0.0006574673,0.000022254497,0.0000022235731,0.000044789624,0.99587905,0.00019559858,0.00018888045,0.00008591664,0.00029873327],"about_ca_topic_score_codex":0.000074685435,"about_ca_topic_score_gemma":0.00014781678,"teacher_disagreement_score":0.91126835,"about_ca_system_score_codex":0.000094037496,"about_ca_system_score_gemma":0.000054068754,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W4416582538","doi":"10.1109/tmc.2025.3636717","title":"Joint Trajectory Planning and Task Offloading in UAV-Assisted Inspection Networks: A Transformer-Based Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"UAV Applications and Optimization","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":"Beijing Nova Program; National Natural Science Foundation of China","keywords":"Trajectory; Task (project management); Benchmark (surveying); Process (computing); Task analysis; Optimization problem; Computational complexity theory; Joint (building); Trajectory optimization","score_opus":0.013349009724199334,"score_gpt":0.23516970203766574,"score_spread":0.2218206923134664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08044336,0.0013780163,0.91416395,0.000037662594,0.00084246823,0.0013919671,0.000015256894,0.0005272861,0.0012000324],"genre_scores_gemma":[0.9870729,0.00019997999,0.012123458,0.00006414212,0.00009206086,0.00031132062,0.00002112893,0.0000808378,0.000034180684],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971371,0.00014093492,0.001062657,0.00080841524,0.00021135254,0.0006395057],"domain_scores_gemma":[0.9990242,0.00025605244,0.00013615013,0.00037490393,0.000077709636,0.00013094977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00048486723,0.0005420149,0.0005960158,0.0012612762,0.0007920483,0.000202382,0.00016592967,0.0004111123,0.000016287293],"category_scores_gemma":[0.000004090588,0.0006760817,0.00020343025,0.002259523,0.000115085706,0.00023638703,0.0000019605995,0.0011354134,0.000002981066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005837774,0.0004299357,0.000105163475,0.00036778973,0.000098533405,0.0000027758363,0.0011820995,0.89620894,0.0021715444,0.000029764169,0.000017363345,0.09932773],"study_design_scores_gemma":[0.0017942402,0.00013401758,0.0021247081,0.0010835765,0.00015242348,0.0000110537885,0.0009102256,0.9902911,0.0028611394,0.000008403543,0.0001097151,0.0005193625],"about_ca_topic_score_codex":0.00010662972,"about_ca_topic_score_gemma":0.000047239933,"teacher_disagreement_score":0.90662956,"about_ca_system_score_codex":0.0006434847,"about_ca_system_score_gemma":0.000117686286,"threshold_uncertainty_score":0.99956906},"labels":[],"label_agreement":null},{"id":"W4416582540","doi":"10.1109/tmc.2025.3636225","title":"A Radical Heavy-Ball Method for Gradient Acceleration in Communication-Efficient Mobile Federated Learning","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Privacy-Preserving Technologies in Data","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":"Artificial Intelligence in Medicine (Canada)","funders":"Dalian Science and Technology Innovation Fund; Natural Science Foundation of Liaoning Province","keywords":"Stochastic gradient descent; Convergence (economics); Gradient descent; Acceleration; Momentum (technical analysis); Process (computing)","score_opus":0.032082071630689026,"score_gpt":0.3350631530160988,"score_spread":0.30298108138540975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416582540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031996578,0.0010014854,0.9560317,0.0037281662,0.0019599134,0.0040480574,0.000040051164,0.0010385162,0.00015554846],"genre_scores_gemma":[0.6830703,0.00021412129,0.31535378,0.00020818069,0.000028013492,0.0009765335,0.000023941526,0.00004135617,0.00008374482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99315345,0.0013729685,0.0017694863,0.0018867257,0.00057821104,0.0012391445],"domain_scores_gemma":[0.9895376,0.0035784722,0.0005019863,0.005790027,0.00042488275,0.00016701236],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00338928,0.0006994779,0.00088700437,0.0013105497,0.0026747107,0.0010545199,0.012632312,0.00061077264,0.000035217992],"category_scores_gemma":[0.001590017,0.00082711136,0.00037038993,0.00345322,0.0003468231,0.000465419,0.0017262232,0.0025325695,0.00002441958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009322167,0.0010428259,0.000017152275,0.00012177245,0.000082692386,0.0000040246896,0.00063493254,0.63284785,0.00061247806,0.0002738653,0.0010325785,0.36323664],"study_design_scores_gemma":[0.001957533,0.0006314301,0.000043236756,0.0010002261,0.000062559935,0.0000143515235,0.00065949064,0.9688965,0.022037273,0.0019368806,0.002143119,0.000617399],"about_ca_topic_score_codex":0.00026468444,"about_ca_topic_score_gemma":0.00013630428,"teacher_disagreement_score":0.65107375,"about_ca_system_score_codex":0.0012507949,"about_ca_system_score_gemma":0.0005730871,"threshold_uncertainty_score":0.9999825},"labels":[],"label_agreement":null},{"id":"W4416706962","doi":"10.1109/tmc.2025.3637283","title":"PEP-Policer: Eliminating the On-Off Traffic Pattern in PEP Over Satellite Networks","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Goodput; Geostationary orbit; Limiting; Satellite; Network congestion; Communications satellite","score_opus":0.008342108884710606,"score_gpt":0.25108116581208373,"score_spread":0.24273905692737313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416706962","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.105298035,0.0027567006,0.88054055,0.001840689,0.0067378525,0.0015593114,0.0000090552685,0.00036894015,0.00088887924],"genre_scores_gemma":[0.9936976,0.0010664273,0.00026799366,0.0033934556,0.00062218093,0.00017928901,0.0000023817759,0.000064042055,0.00070665625],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934567,0.0010217912,0.0015698756,0.0016595472,0.0007178741,0.0015741843],"domain_scores_gemma":[0.9944015,0.003272898,0.00043403788,0.0014866494,0.00017155512,0.00023333635],"candidate_categories":["metaepi_narrow","sts","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015504649,0.0009029012,0.00083422917,0.00066890253,0.0016999214,0.00086388143,0.0018533849,0.00044056287,0.00010210749],"category_scores_gemma":[0.0000144648875,0.0008274827,0.00057999697,0.0028220357,0.00028977802,0.0003253332,0.00003199512,0.0027183385,0.000113824615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000405734,0.00032971796,0.000038507722,0.000025543422,0.00007200086,0.000016655564,0.0011234141,0.49802965,0.0000025117336,0.00019516978,0.000082523446,0.50004375],"study_design_scores_gemma":[0.0019229101,0.00041552223,0.0011445477,0.0013986831,0.00011446255,0.000016681079,0.00039227115,0.991024,0.000054824373,0.000023261606,0.0028092028,0.00068363553],"about_ca_topic_score_codex":0.000083852756,"about_ca_topic_score_gemma":0.0003465805,"teacher_disagreement_score":0.88839954,"about_ca_system_score_codex":0.0004431574,"about_ca_system_score_gemma":0.0003271732,"threshold_uncertainty_score":0.99959975},"labels":[],"label_agreement":null},{"id":"W4417131162","doi":"10.1109/tmc.2025.3640955","title":"Leveraging Generative Artificial Intelligence for Uplink Feedback-Free Transmission in 6G FD-RAN","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced MIMO Systems Optimization","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":"National Natural Science Foundation of China","keywords":"Telecommunications link; Channel state information; Transmission (telecommunications); Autoencoder; Overhead (engineering); Spectral efficiency; Wireless; Reinforcement learning; Artificial noise","score_opus":0.023564673328594424,"score_gpt":0.2812870237724589,"score_spread":0.2577223504438645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417131162","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006681597,0.0010967545,0.9847133,0.00021639929,0.0035752878,0.003090765,0.000040728275,0.0003796808,0.00020544512],"genre_scores_gemma":[0.86868536,0.00022244695,0.13012353,0.000057858175,0.00022488442,0.00032659652,0.000012291523,0.00012126172,0.00022578707],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958011,0.00017294909,0.0018003486,0.0010731509,0.00024056014,0.00091188936],"domain_scores_gemma":[0.99766374,0.0010338111,0.00019759023,0.00070610334,0.00024084108,0.00015790555],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063239614,0.0007224062,0.000805231,0.0009712321,0.0008932473,0.00018649652,0.0005566452,0.0004412925,0.000060373302],"category_scores_gemma":[0.000029396273,0.0009037696,0.00036300984,0.0016234372,0.00009876165,0.00036141867,0.0000074113545,0.0010318093,0.00001785106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006408722,0.0001817781,0.0000022176564,0.00038997427,0.00007760295,0.0000033181122,0.0028911426,0.6313254,0.0052182344,0.00017270973,0.000015640162,0.35965785],"study_design_scores_gemma":[0.00077332935,0.0001686557,0.0000031479972,0.0018433846,0.00009932108,0.0000045488187,0.0017770518,0.86531466,0.12766682,0.0015040792,0.0002327791,0.0006122047],"about_ca_topic_score_codex":0.000058182966,"about_ca_topic_score_gemma":0.000054510616,"teacher_disagreement_score":0.86200374,"about_ca_system_score_codex":0.0008932912,"about_ca_system_score_gemma":0.00018233436,"threshold_uncertainty_score":0.9993413},"labels":[],"label_agreement":null},{"id":"W4417251850","doi":"10.1109/tmc.2025.3642535","title":"Noisy Multi-Label Aggregation With Self-Supervised Graph Transformer in Mobile Crowdsourcing","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Crowdsourcing; Transformer; Graph; Aggregate (composite); Knowledge graph; Noisy data; Labeled data; Data modeling","score_opus":0.013464037910435895,"score_gpt":0.25566481478042274,"score_spread":0.24220077686998684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417251850","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35367176,0.00092341745,0.640492,0.00009448686,0.0017157579,0.0021531817,0.000012808243,0.00062736834,0.00030918894],"genre_scores_gemma":[0.93454385,0.0003019276,0.063672855,0.00040101315,0.00010527734,0.00037158155,0.000004960784,0.00012844986,0.00047010547],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9918994,0.00069350423,0.0019855013,0.0025248977,0.00095670024,0.0019400002],"domain_scores_gemma":[0.99606067,0.00085417577,0.00044762695,0.0017362683,0.0005018743,0.0003994102],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0015261506,0.0013433017,0.0013313855,0.0021376961,0.0020777893,0.0010722218,0.0013403035,0.0006490684,0.00004718498],"category_scores_gemma":[0.00001076473,0.0014098962,0.00052005437,0.005714206,0.00035580512,0.0010338008,0.000017955279,0.00227204,0.000064999746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014248799,0.0019885604,0.000358655,0.00039005093,0.00021585825,0.00006539941,0.0078048874,0.4851727,0.0027773983,0.00004097444,0.000014130815,0.5010289],"study_design_scores_gemma":[0.0071634734,0.0010581275,0.00027312784,0.0039573885,0.0002591533,0.00008440916,0.001565154,0.9462652,0.03774242,0.0000331889,0.00024144334,0.0013569079],"about_ca_topic_score_codex":0.00038930305,"about_ca_topic_score_gemma":0.0004335536,"teacher_disagreement_score":0.58087206,"about_ca_system_score_codex":0.00077525515,"about_ca_system_score_gemma":0.00077033107,"threshold_uncertainty_score":0.9999648},"labels":[],"label_agreement":null},{"id":"W4417251858","doi":"10.1109/tmc.2025.3642569","title":"Locally Differentially Private Truth Discovery Over Data Streams","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Mobile Crowdsensing and Crowdsourcing","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":"Artificial Intelligence in Medicine (Canada)","funders":"National Natural Science Foundation of China","keywords":"Differential privacy; Ground truth; Upload; Reliability (semiconductor); Noise (video); Synthetic data; Data stream mining; Information privacy; Data stream","score_opus":0.018917808418519925,"score_gpt":0.27331478683510346,"score_spread":0.25439697841658354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417251858","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19459903,0.0004756327,0.79274803,0.00013644774,0.009957231,0.0008862949,0.00020641682,0.00049126166,0.00049963506],"genre_scores_gemma":[0.99104065,0.00018388727,0.0063686934,0.00044203954,0.0003604151,0.00002722318,0.000041282114,0.000091759015,0.0014440289],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99206364,0.00058647373,0.0016855156,0.0031110293,0.0009927581,0.0015605992],"domain_scores_gemma":[0.99205935,0.0013572115,0.0005174618,0.005496155,0.00021519163,0.00035465724],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010668556,0.0011138242,0.0011012786,0.000738465,0.0020240697,0.0030177534,0.004132587,0.00046522444,0.000082781036],"category_scores_gemma":[0.00004434345,0.0011795262,0.00052316877,0.002034201,0.0004372201,0.0016064163,0.00022706506,0.0017404784,0.00007635067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000998735,0.0010402869,0.000063857406,0.00024796682,0.0004088094,0.000052499974,0.0005098715,0.30091852,0.0014255691,0.0009316852,0.00029795684,0.6940031],"study_design_scores_gemma":[0.0018772548,0.0003936624,0.00047950257,0.0023906506,0.00035826844,0.000032858497,0.00017909387,0.9769739,0.014162,0.00023313011,0.0018110381,0.0011086403],"about_ca_topic_score_codex":0.0002776183,"about_ca_topic_score_gemma":0.00010340108,"teacher_disagreement_score":0.7964416,"about_ca_system_score_codex":0.00037640994,"about_ca_system_score_gemma":0.00076978107,"threshold_uncertainty_score":0.99927515},"labels":[],"label_agreement":null},{"id":"W6903324742","doi":"10.1109/tmc.2025.3554568","title":"Cloud-Edge-End Collaborative Computing-Enabled Intelligent Sharding Blockchain for Industrial IoT Based on PPO Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China","keywords":"Scalability; Reliability (semiconductor); Throughput; Markov decision process; Hash function; Industrial Internet; Ant colony optimization algorithms; Interoperability; Computational complexity theory","score_opus":0.0292694094569313,"score_gpt":0.2779552570227571,"score_spread":0.2486858475658258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903324742","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02068852,0.000061773644,0.9560898,0.00032972972,0.018126206,0.0021283594,0.00000982691,0.00073128956,0.0018345241],"genre_scores_gemma":[0.94861317,0.000001900863,0.048158634,0.000790746,0.001971186,0.00012675201,0.0000087617855,0.000056458524,0.00027236724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9954806,0.00041399713,0.0010130224,0.0014583591,0.00054740877,0.0010866389],"domain_scores_gemma":[0.9957479,0.0022539324,0.00034908293,0.0009381924,0.00044284115,0.00026802393],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0016880975,0.0006556768,0.0007736281,0.0009426747,0.0018262586,0.00057651225,0.0013701526,0.00036174728,0.00000788738],"category_scores_gemma":[0.00008871851,0.00068510516,0.00043228333,0.002812093,0.00012222212,0.000103433,0.0000451726,0.0010906366,0.00002213218],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001602459,0.0005712593,0.000018035844,0.000083068706,0.000117013115,0.0000054353154,0.0009978737,0.80357933,0.00014774503,0.0005984013,0.0027593444,0.19096223],"study_design_scores_gemma":[0.0022240153,0.0006952924,0.000009110031,0.0004772721,0.000056604567,0.000005055181,0.00024831522,0.9749129,0.014516194,0.00015016281,0.006095981,0.00060911954],"about_ca_topic_score_codex":0.000021508542,"about_ca_topic_score_gemma":0.000002002679,"teacher_disagreement_score":0.9279247,"about_ca_system_score_codex":0.0005286068,"about_ca_system_score_gemma":0.0006981947,"threshold_uncertainty_score":0.99956},"labels":[],"label_agreement":null},{"id":"W6903379985","doi":"10.1109/tmc.2025.3587702","title":"A Generalizable Prompt-Based Prototypical Framework for CSI-Based Few-Shot and Cross-Domain Activity Recognition","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Indoor and Outdoor Localization Technologies","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":"Simon Fraser University","funders":"National Natural Science Foundation of China; China Institute of Communications","keywords":"Activity recognition; Generalization; Representation (politics); Class (philosophy); Variety (cybernetics); Euclidean distance; Convolutional neural network; Facial recognition system; Pattern recognition (psychology)","score_opus":0.021991917191092673,"score_gpt":0.29232596668507826,"score_spread":0.2703340494939856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6903379985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22904706,0.00003267282,0.7681212,0.000051175266,0.00038033107,0.0013829537,0.000038831342,0.000895593,0.000050223498],"genre_scores_gemma":[0.9227097,0.0000042531474,0.07613226,0.00011475974,0.00003327928,0.0009417409,0.00001007075,0.000035628233,0.000018283012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989386,0.000039731563,0.0002590434,0.0003256514,0.000111843656,0.00032513242],"domain_scores_gemma":[0.99926627,0.0003231311,0.00004051825,0.00023345514,0.0000902158,0.000046422927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018120297,0.00022423628,0.0002357248,0.00024381973,0.00040987736,0.00011407127,0.00011771137,0.0002829175,0.000023482515],"category_scores_gemma":[0.000021778562,0.00024057165,0.000110055575,0.0004155559,0.00009472314,0.000083255734,0.0000017156905,0.00035406646,0.0000044960752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014031438,0.00014901462,0.00010890195,0.00046073916,0.000039135964,0.0000010081573,0.00005225381,0.9073949,0.002545977,0.00017473788,0.00004349749,0.08888951],"study_design_scores_gemma":[0.00094031065,0.00015237319,0.0001115565,0.00025156842,0.000025060894,0.0000010319078,0.00002731885,0.7014903,0.29465404,0.0015581793,0.00054894265,0.00023930427],"about_ca_topic_score_codex":0.000008884533,"about_ca_topic_score_gemma":0.000009940257,"teacher_disagreement_score":0.69366264,"about_ca_system_score_codex":0.00013772414,"about_ca_system_score_gemma":0.000055354085,"threshold_uncertainty_score":0.9810227},"labels":[],"label_agreement":null},{"id":"W7076052587","doi":"10.1109/tmc.2025.3599384","title":"Two-Tier Submodel Partition Framework for Enhancing UAV Swarm Robustness in Forest Fire Detection","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Geochemistry and Geologic Mapping","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Robustness (evolution); Backup; Software deployment; Swarm behaviour; Adaptability; Upload","score_opus":0.013729224672915876,"score_gpt":0.26504813576543185,"score_spread":0.251318911092516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7076052587","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13886827,0.000039835002,0.85896766,0.00023241434,0.0010348202,0.0004423344,0.0000017987745,0.0002081484,0.00020470598],"genre_scores_gemma":[0.9635724,0.000005494846,0.035814285,0.00011818577,0.000070655726,0.00023729028,0.000001840673,0.000005836461,0.00017401477],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998446,0.000063085994,0.00039287467,0.0005490375,0.00013320812,0.0004158254],"domain_scores_gemma":[0.9988123,0.00050561654,0.00010055198,0.00040164735,0.00012735267,0.00005249412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042357345,0.00019582853,0.00022013739,0.00016202779,0.0004625778,0.00010480053,0.0003594703,0.00016859098,0.000005809209],"category_scores_gemma":[0.000037425743,0.00021790559,0.00012864328,0.00074708473,0.000033467062,0.00021810658,0.000008980726,0.00041538643,0.000003998483],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016550737,0.00010208191,0.000037531878,0.000080356185,0.000011541549,0.0000020126856,0.00024914852,0.9208457,0.0012473416,0.0008263418,0.0000061413402,0.076575264],"study_design_scores_gemma":[0.00042128065,0.00006332226,0.00008764292,0.0002978607,0.000010554892,0.0000047758103,0.00012156165,0.90470165,0.08695792,0.006983998,0.00015941837,0.00018999976],"about_ca_topic_score_codex":0.00004735402,"about_ca_topic_score_gemma":0.00028767952,"teacher_disagreement_score":0.8247041,"about_ca_system_score_codex":0.00013237669,"about_ca_system_score_gemma":0.00006480501,"threshold_uncertainty_score":0.8885932},"labels":[],"label_agreement":null},{"id":"W7093301899","doi":"10.1109/tmc.2025.3623636","title":"Digital Twin-Assisted Space-Air-Ground Integrated Multi-Access Edge Computing for Low-Altitude Economy: An Online Decentralized Optimization Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"IoT and Edge/Fog Computing","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Lyapunov optimization; Quality of service; Optimization problem; Resource allocation; Benchmark (surveying); Edge computing; Mobile edge computing; Latency (audio); Low latency (capital markets)","score_opus":0.04652105700738119,"score_gpt":0.31146235445495984,"score_spread":0.26494129744757866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7093301899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057388376,0.00028780362,0.916482,0.00019964577,0.020306325,0.0037078592,0.000061962106,0.001156442,0.0004096172],"genre_scores_gemma":[0.7112376,0.00003373003,0.2861557,0.0005067709,0.0011151052,0.00008443539,0.00030865657,0.00015389342,0.00040410095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.991109,0.000543466,0.0026151403,0.003043993,0.0004908679,0.0021975252],"domain_scores_gemma":[0.9942471,0.0011749936,0.0010769612,0.0016249892,0.0012338439,0.0006421397],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0011260365,0.0015482332,0.0016962537,0.0014515172,0.0031839604,0.004484995,0.0030121454,0.0007049782,0.000012505531],"category_scores_gemma":[0.0000690976,0.0017658551,0.0009116159,0.0035940956,0.00037122684,0.002968511,0.00014248047,0.0015702387,0.000012606297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016348514,0.0036847184,0.00012833624,0.0004538762,0.00033458482,0.0000075063504,0.0010919415,0.6878359,0.00007486589,0.0000512931,0.000117095864,0.30605644],"study_design_scores_gemma":[0.00575373,0.00052742095,0.00045966482,0.0013087314,0.00024764275,0.000044775134,0.00046988568,0.9871048,0.0012643003,0.000026278907,0.0012407507,0.001552032],"about_ca_topic_score_codex":0.00015490998,"about_ca_topic_score_gemma":0.000028264438,"teacher_disagreement_score":0.65384924,"about_ca_system_score_codex":0.0012807546,"about_ca_system_score_gemma":0.0012743323,"threshold_uncertainty_score":0.9997266},"labels":[],"label_agreement":null},{"id":"W7108227258","doi":"10.1109/tmc.2025.3638816","title":"LearnRouter: A Reinforcement Learning-Based Routing for Opportunistic Mobile Networks Using Multi-Armed Bandit Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Opportunistic and Delay-Tolerant 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":"Dalhousie University","funders":"","keywords":"Routing protocol; Routing (electronic design automation); Reinforcement learning; Transmission (telecommunications); Protocol (science); Adaptive routing; Dynamic Source Routing; Replication (statistics); Upper and lower bounds; Hierarchical routing","score_opus":0.04299475508212949,"score_gpt":0.2975966587367513,"score_spread":0.25460190365462176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7108227258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014451821,0.00037092654,0.9858846,0.000048937705,0.0061750757,0.0049266485,0.000031264026,0.00068197295,0.00043538166],"genre_scores_gemma":[0.9491453,0.000090671536,0.046694994,0.0006619286,0.00044777556,0.0006085518,0.000078967234,0.0001435725,0.0021282507],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99112195,0.0006598494,0.00255658,0.0024702547,0.00082617556,0.0023651996],"domain_scores_gemma":[0.99410826,0.0019101471,0.0011593843,0.0015210597,0.000635445,0.0006656823],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.002246504,0.0013644943,0.0015642192,0.0008890254,0.004082379,0.001172182,0.0015486703,0.00081574684,0.000081219005],"category_scores_gemma":[0.000019047153,0.0015591019,0.0010998445,0.0020130456,0.00044841,0.00043959054,0.000063418716,0.0023668013,0.000014673871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000199598,0.00085220835,0.00003253222,0.00031738475,0.00027883792,0.000026876107,0.00049257936,0.74394625,0.00003508622,0.00014386264,0.00006862072,0.25360617],"study_design_scores_gemma":[0.0045908694,0.0012370736,0.00000557763,0.0014411458,0.00060604454,0.000034199504,0.00055121584,0.98899984,0.00016281995,0.000015507301,0.0010159715,0.001339722],"about_ca_topic_score_codex":0.000110585795,"about_ca_topic_score_gemma":0.0000059923336,"teacher_disagreement_score":0.9477001,"about_ca_system_score_codex":0.0008386041,"about_ca_system_score_gemma":0.0014511906,"threshold_uncertainty_score":0.9999348},"labels":[],"label_agreement":null},{"id":"W7117134956","doi":"10.1109/tmc.2025.3647655","title":"KAFL-HD: Knowledge Alignment in Asynchronous Federated Learning With Heterogeneous Data","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","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":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"National Natural Science Foundation of China","keywords":"Federated learning; Asynchronous communication; Convergence (economics); Training (meteorology); Order (exchange); Quality (philosophy); Recommender system; Training set","score_opus":0.03051056994780319,"score_gpt":0.29884756921556765,"score_spread":0.26833699926776444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117134956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04381994,0.002804873,0.9463036,0.00093905773,0.0028476184,0.0014407405,0.00006785331,0.0013077067,0.00046860773],"genre_scores_gemma":[0.9593496,0.00053878996,0.039625574,0.000097986645,0.00006665416,0.0001025802,0.000032173873,0.000072889234,0.000113777285],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9926671,0.0007756999,0.0013684859,0.0030397584,0.00063441094,0.001514573],"domain_scores_gemma":[0.98581904,0.0010944725,0.0004047453,0.012275968,0.00022307051,0.00018268169],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0015238173,0.0009071824,0.00094123173,0.0011603456,0.0016065494,0.0010410075,0.026540622,0.00044044052,0.000046391513],"category_scores_gemma":[0.00059037557,0.00097212667,0.00013717497,0.0036351637,0.00040473524,0.0009003129,0.0061837044,0.0027790994,0.000121084806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006901728,0.001070597,0.00013368762,0.00019484044,0.00019830871,0.00010554438,0.00030514624,0.35853884,0.00021025892,0.000016639395,0.00092867354,0.6382285],"study_design_scores_gemma":[0.0016490103,0.00072746334,0.000063010506,0.002201285,0.000090112946,0.00007955997,0.00021432966,0.97880405,0.01259065,0.00041321243,0.0023084912,0.00085884216],"about_ca_topic_score_codex":0.00021680405,"about_ca_topic_score_gemma":0.00055048615,"teacher_disagreement_score":0.9155296,"about_ca_system_score_codex":0.001174292,"about_ca_system_score_gemma":0.0009833684,"threshold_uncertainty_score":0.999996},"labels":[],"label_agreement":null},{"id":"W7117559511","doi":"10.1109/tmc.2025.3649382","title":"Cross-Sensory Transmission for 6G-Enabled Immersive Communication","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Advanced Wireless Communication Technologies","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":"National Natural Science Foundation of China","keywords":"Network packet; Packet loss; Transmission (telecommunications); Data compression; Reliability (semiconductor); Encoding (memory); Data transmission; Coding (social sciences); Transmission delay","score_opus":0.01707638603877888,"score_gpt":0.3053885496599548,"score_spread":0.28831216362117595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117559511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018748356,0.005736031,0.9691864,0.00035064833,0.0011250523,0.0023976471,0.00009177243,0.001183277,0.0011808161],"genre_scores_gemma":[0.94874054,0.004948107,0.044120766,0.00009529013,0.000027453605,0.00052833714,0.000024088878,0.00011245098,0.0014029542],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967691,0.00020132541,0.0012575265,0.000733196,0.00025043657,0.00078843255],"domain_scores_gemma":[0.9947338,0.0022199024,0.00028046482,0.0022089481,0.0004428224,0.00011404468],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00049075304,0.00065055204,0.000709695,0.0007552156,0.002031885,0.00020533965,0.001464515,0.00065204373,0.0000825964],"category_scores_gemma":[0.000033514905,0.0008034468,0.00050035253,0.0011687092,0.00042945484,0.00040962754,0.00001928207,0.0015503715,0.000035218163],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009843055,0.00020827411,0.000006273504,0.00036796692,0.0001742937,5.835615e-7,0.0005300754,0.6556363,0.013414419,0.00036035333,0.00006336485,0.32913968],"study_design_scores_gemma":[0.0019209225,0.00017557865,0.000044942135,0.001144745,0.000114159,0.0000036312238,0.00153706,0.6598333,0.32459828,0.00076847005,0.009247723,0.0006111738],"about_ca_topic_score_codex":0.000024132245,"about_ca_topic_score_gemma":0.000006883473,"teacher_disagreement_score":0.9299922,"about_ca_system_score_codex":0.00068334973,"about_ca_system_score_gemma":0.00013074982,"threshold_uncertainty_score":0.9994416},"labels":[],"label_agreement":null},{"id":"W7117720092","doi":"10.1109/tmc.2025.3649541","title":"Efficient Collision-Free Data Collection for Underwater Acoustic Sensor Networks: A Hierarchical DRL Approach","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Underwater Vehicles and Communication Systems","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":"University of Calgary","funders":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Data collection; Leverage (statistics); Network packet; Trajectory; Underwater; Reinforcement learning; Wireless sensor network","score_opus":0.02787122702188533,"score_gpt":0.26818142534530653,"score_spread":0.2403101983234212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117720092","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009815796,0.00065809017,0.9823776,0.0002998906,0.0022469102,0.0033652969,0.00017813516,0.0007115241,0.00034679525],"genre_scores_gemma":[0.9478738,0.000159373,0.05009998,0.000108272565,0.00024850966,0.00040975166,0.000055998804,0.00015374595,0.0008905995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9955943,0.0004197818,0.0013950047,0.0012134848,0.00043111347,0.0009463095],"domain_scores_gemma":[0.9937976,0.0015627603,0.0001879889,0.0039776713,0.00025827283,0.0002156862],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001118045,0.00065625604,0.00078791485,0.000598697,0.0018648581,0.0004875854,0.0024284972,0.00042066496,0.000020070698],"category_scores_gemma":[0.000013793257,0.0006946159,0.00034214728,0.0015852881,0.00016531808,0.00010858676,0.000111681766,0.0011455485,0.00002213258],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018597499,0.00078144943,0.000004375805,0.0005524342,0.00046651915,0.0000016613604,0.00060325844,0.9770013,0.0011112773,0.000019443341,0.0009889728,0.018283308],"study_design_scores_gemma":[0.0024186142,0.00022142418,0.0000119225615,0.0006751001,0.00037053623,0.000028445978,0.0010172935,0.98950934,0.0017656309,0.000059194095,0.0033315774,0.0005909266],"about_ca_topic_score_codex":0.00008157867,"about_ca_topic_score_gemma":0.000038704267,"teacher_disagreement_score":0.93805796,"about_ca_system_score_codex":0.0006226219,"about_ca_system_score_gemma":0.00020530979,"threshold_uncertainty_score":0.9995505},"labels":[],"label_agreement":null}]}