{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":317,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":317,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"20acd20d0682","filters":{"venue":"IEEE Transactions on Mobile Computing"}},"results":[{"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02226726386392214,"gpt":0.2558794744901244,"spread":0.2336122106262022,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000861219,0.0004709186,0.0006327463,0.0003720366,0.000993864,0.00045464,0.001002543,0.0001731303,0.000003306915],"category_scores_gemma":[0.00003143181,0.000529443,0.0002875438,0.001180838,0.00004873766,0.0004235222,0.0000457966,0.0008914106,0.00006485995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003242058,"about_ca_system_score_gemma":0.0001072879,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004453414,"about_ca_topic_score_gemma":0.000002049572,"domain_scores_codex":[0.9961433,0.0002083576,0.001078821,0.001066899,0.0004441071,0.001058549],"domain_scores_gemma":[0.9978626,0.0008800861,0.0003491618,0.0004462533,0.0001708956,0.0002910202],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001960201,0.00007100459,0.00006087646,0.0001611728,0.00003382581,0.00001194898,0.005286566,0.8934547,0.0009427708,0.00005724947,0.0001370867,0.09976321],"study_design_scores_gemma":[0.001106913,0.000649619,0.00001740321,0.0002960178,0.00001762147,0.00001963269,0.0004688464,0.9901747,0.002231258,0.00001137083,0.004463548,0.0005430584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03407081,0.0003229656,0.9554053,0.00009058824,0.007533656,0.001539171,3.212618e-7,0.0007601437,0.0002770724],"genre_scores_gemma":[0.9878485,0.00001390696,0.01022428,0.0003391456,0.00133516,0.0001194495,0.000005155816,0.000060666,0.000053799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9537776,"threshold_uncertainty_score":0.9997157,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00660713434968295,"gpt":0.2152329872001624,"spread":0.2086258528504795,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002258695,0.0001779119,0.0001744081,0.0003093061,0.0001561089,0.00003292063,0.0001364467,0.000183519,0.00002475252],"category_scores_gemma":[0.000001420783,0.0002028205,0.00007374308,0.0005802877,0.00006447786,0.00006595327,0.000001110883,0.0004544824,0.00001212445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002113449,"about_ca_system_score_gemma":0.00001248849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001897664,"about_ca_topic_score_gemma":0.0000752593,"domain_scores_codex":[0.9989307,0.00001694072,0.0003330677,0.000197739,0.0001268431,0.0003947173],"domain_scores_gemma":[0.9995358,0.0001740636,0.00002860047,0.0001820588,0.00002895938,0.0000505344],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000106124,0.00003793475,0.0001332224,0.00001654619,0.000008215058,0.00001532238,0.00006756084,0.8971224,0.0002710889,0.00004231575,0.00001066582,0.1022641],"study_design_scores_gemma":[0.0003892984,0.00004469633,0.0002108109,0.0001205356,0.000006716151,0.000006080251,0.0002123541,0.9343386,0.06441826,0.00001600958,0.00003552295,0.0002010716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1834049,0.00004577894,0.8145505,0.000006379765,0.0005125252,0.0001621801,0.000001951851,0.0009308183,0.0003850001],"genre_scores_gemma":[0.9987633,0.000009775722,0.001061441,0.00006046759,0.00003762225,0.00001574943,0.000004884414,0.00003839425,0.000008380427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8153583,"threshold_uncertainty_score":0.8270779,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03505927190919694,"gpt":0.3012624449758595,"spread":0.2662031730666625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0003774536,0.0003034532,0.0003164282,0.0001593265,0.0008577806,0.000537669,0.006801773,0.0002821468,0.0000245495],"category_scores_gemma":[0.0003045835,0.0003330011,0.000113442,0.0009788818,0.00005558765,0.0008420306,0.0004554318,0.0008098097,0.0000258238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001024298,"about_ca_system_score_gemma":0.00005804011,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003023306,"about_ca_topic_score_gemma":0.000004942447,"domain_scores_codex":[0.9976143,0.0001920432,0.0004259883,0.0009481212,0.0003049359,0.0005146266],"domain_scores_gemma":[0.9972332,0.0005020637,0.0002094874,0.00172572,0.0001634876,0.0001661052],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001848549,0.0004495603,0.00007388591,0.0005950576,0.0002112087,0.00003000978,0.002625394,0.3877023,0.006400516,0.0002892104,0.004455661,0.5969824],"study_design_scores_gemma":[0.0003478647,0.0004824022,0.00003375476,0.0001379634,0.0000156609,0.00001311511,0.0003824825,0.9812654,0.01450145,0.002094787,0.0003844517,0.0003407203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04917139,0.00002398605,0.9364901,0.002934918,0.000845201,0.0005727956,0.00001885034,0.009912499,0.00003028728],"genre_scores_gemma":[0.713295,0.0000127704,0.2861842,0.0003179002,0.00007762094,0.0000641336,0.00001024754,0.00003283546,0.000005268318],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6641237,"threshold_uncertainty_score":0.9999122,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02419609435824047,"gpt":0.257902385930298,"spread":0.2337062915720575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003171613,0.0003322525,0.0002874389,0.0001383711,0.000282863,0.00005634453,0.0002639992,0.000216256,0.0001100239],"category_scores_gemma":[0.000002672255,0.0003565712,0.0002336769,0.0002841468,0.00004601769,0.000168246,0.000002807167,0.0004296465,0.00004156229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001261479,"about_ca_system_score_gemma":0.00001983733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002163493,"about_ca_topic_score_gemma":0.000009559524,"domain_scores_codex":[0.9982651,0.00005947148,0.0004798672,0.000401204,0.0002059358,0.0005884298],"domain_scores_gemma":[0.9990602,0.0001311973,0.00008782905,0.0004944969,0.00007345287,0.0001528786],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003995953,0.0001180628,0.00000303724,0.0001011268,0.00007779239,0.000004724744,0.0006186349,0.931643,0.0003927146,0.00001375395,0.0003019766,0.06668518],"study_design_scores_gemma":[0.0009560643,0.0001861181,0.00004613433,0.0001773753,0.00005418657,0.0000127157,0.00006466563,0.9838651,0.006887808,0.00004824334,0.007333979,0.0003675668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009215251,0.0001017479,0.9387267,0.000005909324,0.0008298985,0.04998974,0.000007588069,0.0008964445,0.0002267152],"genre_scores_gemma":[0.8578534,0.000013323,0.00952734,0.00003446851,0.0002692289,0.1320663,0.00000909979,0.0001354967,0.00009128283],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9291994,"threshold_uncertainty_score":0.9998886,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02472693146374924,"gpt":0.2508126557456515,"spread":0.2260857242819023,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004171395,0.0003078218,0.0003685085,0.0001276382,0.0009656443,0.0003242706,0.0003742551,0.0001349746,0.000001028591],"category_scores_gemma":[0.00001402131,0.0003373686,0.0001723812,0.000572415,0.00005483276,0.0003843052,0.0000137687,0.0004534071,0.00001054069],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007003028,"about_ca_system_score_gemma":0.00006468798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001224344,"about_ca_topic_score_gemma":5.348272e-7,"domain_scores_codex":[0.9977696,0.0001213553,0.0004863706,0.0007963874,0.0002387951,0.0005874702],"domain_scores_gemma":[0.9986468,0.0005777563,0.0001847137,0.0002129712,0.0001308361,0.0002469006],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003488158,0.00004300765,0.00001278474,0.00003651044,0.00004851855,0.000006203336,0.001253152,0.886963,0.0006391864,0.0001025465,0.00007568648,0.1107846],"study_design_scores_gemma":[0.000879815,0.0004268959,0.0000217555,0.0001116078,0.00003311936,0.00001358357,0.00007492003,0.9933382,0.004300579,0.0001138028,0.0003291877,0.0003565109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06115924,0.000153693,0.9335665,0.0003059561,0.003604615,0.0006791963,8.562358e-7,0.000486394,0.00004351659],"genre_scores_gemma":[0.9253139,0.000007446035,0.07281548,0.0004880166,0.001297906,0.00003646128,0.000002882349,0.00003315453,0.000004702647],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8641547,"threshold_uncertainty_score":0.9999079,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01993404008538232,"gpt":0.2675560315958228,"spread":0.2476219915104404,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006557053,0.0003032736,0.0003163973,0.0002575885,0.0006790939,0.0005472902,0.0003958681,0.0001362835,0.000006110122],"category_scores_gemma":[0.00002000058,0.0003266775,0.0001332809,0.0004548291,0.0000458656,0.0009839063,0.00001834852,0.0003243844,0.00002135933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001146151,"about_ca_system_score_gemma":0.00008437839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003624948,"about_ca_topic_score_gemma":0.000005439365,"domain_scores_codex":[0.9977033,0.0001087059,0.0005086687,0.0008519339,0.000293941,0.0005335234],"domain_scores_gemma":[0.9979889,0.0006592889,0.0002378275,0.0007453962,0.0002423456,0.0001262586],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002552367,0.00009600605,0.00005417348,0.0001242471,0.00004015221,0.00000158498,0.001992033,0.706493,0.03854324,0.0003552851,0.00002874984,0.252246],"study_design_scores_gemma":[0.0008127232,0.0003350676,0.00009845931,0.0002152957,0.00002441419,0.00002594656,0.0003551937,0.9562449,0.03987595,0.0001289589,0.001503416,0.000379633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4141004,0.00007103515,0.5839243,0.0000501791,0.0006183991,0.0009208458,0.000002964496,0.0002601046,0.00005172852],"genre_scores_gemma":[0.9723435,0.00001803308,0.02705693,0.0001208918,0.0001130922,0.00009021145,0.000005704294,0.00004187648,0.0002097436],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5582431,"threshold_uncertainty_score":0.9999185,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006099576699461959,"gpt":0.199510078762262,"spread":0.1934105020628,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004224367,0.0002076663,0.000223225,0.0001133249,0.0004385183,0.0002466665,0.0004393764,0.000116001,0.00002043217],"category_scores_gemma":[0.00001191179,0.0001636236,0.0000933465,0.0004268526,0.0001355665,0.0007596166,0.00002197607,0.0004190639,0.00001315534],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005459932,"about_ca_system_score_gemma":0.00003546466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001361316,"about_ca_topic_score_gemma":0.000008146869,"domain_scores_codex":[0.9983819,0.0001518913,0.0005169392,0.0003210233,0.000274087,0.0003541752],"domain_scores_gemma":[0.9982471,0.0005838967,0.0002424577,0.000664714,0.000160128,0.0001016985],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004069218,0.00004229069,0.00003587795,0.00001496513,0.00001238052,3.567706e-7,0.0004824866,0.7545261,0.0002386986,0.00008909313,0.00001102729,0.2445427],"study_design_scores_gemma":[0.0002917932,0.0000932079,0.0008038989,0.00003783595,0.0000107805,0.00001381268,0.0001125188,0.9951211,0.003233763,0.00002032624,0.00009291942,0.0001680068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3485014,0.0000316252,0.6503396,0.0000464715,0.0004603184,0.0004423587,0.000001667148,0.0001063239,0.00007028482],"genre_scores_gemma":[0.9895834,0.00002500855,0.01002973,0.0002305098,0.00005080627,0.000044056,9.682836e-7,0.00001192787,0.00002356279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6410821,"threshold_uncertainty_score":0.6672375,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02524906189674071,"gpt":0.297452862958172,"spread":0.2722038010614313,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003887846,0.0003513974,0.0004249429,0.0002369085,0.0004745313,0.0002542275,0.001252091,0.0001940647,0.00001278135],"category_scores_gemma":[0.000002320859,0.0003554705,0.0002027667,0.00096175,0.0001201963,0.0002584426,0.0000278527,0.0005930508,0.000007852034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001542717,"about_ca_system_score_gemma":0.00004391899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001134195,"about_ca_topic_score_gemma":0.00000985146,"domain_scores_codex":[0.9974097,0.0002274933,0.0005476612,0.0008270742,0.000282881,0.0007052067],"domain_scores_gemma":[0.9981617,0.0007473413,0.0001568866,0.0007244124,0.00006217873,0.0001474228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000068546,0.0001941859,0.00001547527,0.000035106,0.00004337251,0.00007188554,0.0007934815,0.8549477,0.000003198433,0.002673076,0.00006513466,0.1410889],"study_design_scores_gemma":[0.0009731241,0.0003377336,0.0000364354,0.0003647327,0.00001269432,0.00007078046,0.00003590444,0.9948493,0.001033241,0.001039085,0.0008255782,0.0004214105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01884471,0.0001062511,0.9734726,0.00008309462,0.0005266604,0.006524037,0.000003434925,0.0002614236,0.0001778053],"genre_scores_gemma":[0.9572805,0.00009287579,0.03771351,0.0003860368,0.0001867229,0.004219206,0.000001860723,0.00004679952,0.00007246859],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9384358,"threshold_uncertainty_score":0.9998897,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01853816813043831,"gpt":0.227551144046231,"spread":0.2090129759157927,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001557437,0.0002609722,0.0002865916,0.00007197038,0.0001754535,0.00006656546,0.0001743365,0.0001112355,0.00003849682],"category_scores_gemma":[0.000001435187,0.0002957333,0.0001386017,0.0003752175,0.00001041781,0.00009658679,5.819874e-7,0.000296236,0.00006305744],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000146006,"about_ca_system_score_gemma":0.00002418483,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001645543,"about_ca_topic_score_gemma":0.00003493943,"domain_scores_codex":[0.9985615,0.00003283701,0.0004698171,0.0003278739,0.0002029007,0.0004050915],"domain_scores_gemma":[0.9993266,0.0001433985,0.00005543647,0.0001935016,0.0000977352,0.0001832565],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003685543,0.00004192227,0.000002448777,0.0004453542,0.0001085649,0.000003422627,0.001195632,0.9879525,0.001536145,0.00001179774,0.0004051192,0.008260179],"study_design_scores_gemma":[0.0005640522,0.0001564703,0.000006175758,0.0001308234,0.00007535568,0.000003187211,0.0005584572,0.9820247,0.009605334,0.00000242438,0.006596151,0.0002768536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09417287,0.0002298055,0.9020668,0.00006519171,0.001307336,0.001308196,0.00004659992,0.0007314015,0.00007181217],"genre_scores_gemma":[0.9973987,0.00003512013,0.001694639,0.0001997399,0.0002666609,0.0002530311,0.00003830821,0.00008636096,0.00002738752],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9032259,"threshold_uncertainty_score":0.9999495,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.00898458552482317,"gpt":0.2157471476304182,"spread":0.206762562105595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002391115,0.0001810583,0.0001862067,0.0002020761,0.0001941698,0.0001816303,0.00005246562,0.00009921037,0.000002724763],"category_scores_gemma":[0.000002903412,0.0001812291,0.00003640607,0.0002889903,0.00003777648,0.0001249905,0.000003035889,0.0002363794,0.000001154324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007574567,"about_ca_system_score_gemma":0.00001659022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003256812,"about_ca_topic_score_gemma":0.00007027698,"domain_scores_codex":[0.9990066,0.0000303546,0.0003196856,0.000325804,0.00007719536,0.0002403099],"domain_scores_gemma":[0.9995416,0.0002051618,0.00002726199,0.0001385567,0.00002739822,0.00006006997],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003449658,0.00001778115,0.00000945314,0.0000873637,0.00002488665,0.000001096664,0.0008551745,0.9301977,0.001638197,0.00002870131,0.0000294384,0.06707576],"study_design_scores_gemma":[0.0006088026,0.0001201066,0.000151923,0.0003518809,0.00003468959,0.00001846685,0.0002540684,0.9971988,0.0006605079,0.000008228595,0.0003950001,0.0001974917],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3524148,0.0001883851,0.6463615,0.00003180753,0.00025247,0.0005265468,0.000006843959,0.000184953,0.00003266027],"genre_scores_gemma":[0.9915559,0.0000396517,0.007978885,0.00002422694,0.0002380106,0.00007626639,0.00002021116,0.00005487863,0.00001191838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6391411,"threshold_uncertainty_score":0.7390309,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01055061540507008,"gpt":0.2410141750016289,"spread":0.2304635595965588,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003014017,0.0003951692,0.0003895308,0.0003136307,0.0003481299,0.0003080452,0.0008058235,0.000206449,0.000007503915],"category_scores_gemma":[0.000001345316,0.000417496,0.0001822205,0.0009434989,0.00005743259,0.0002951244,0.000008487608,0.0007114681,0.00002199491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002143268,"about_ca_system_score_gemma":0.00006026176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004106196,"about_ca_topic_score_gemma":0.00005605136,"domain_scores_codex":[0.9970561,0.0002192359,0.0006210654,0.000860695,0.0004066223,0.0008363168],"domain_scores_gemma":[0.9985041,0.0002900454,0.0001563856,0.0008224791,0.00006077325,0.000166211],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001542054,0.0003218868,0.00001569924,0.000004762696,0.00001449723,0.0001005585,0.0003001918,0.9172361,0.0004291899,0.0003203724,0.00001009595,0.08123117],"study_design_scores_gemma":[0.0005282138,0.0002757644,0.000121995,0.0001373445,0.000008253273,0.00007448826,0.00007114378,0.993118,0.005159176,0.00002701129,0.00006208264,0.0004165455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2923323,0.0001097289,0.7057081,0.0001049358,0.0008121876,0.0002634352,8.226395e-7,0.0004986699,0.0001698099],"genre_scores_gemma":[0.97672,0.00006528255,0.02257472,0.0004306049,0.0001079823,0.00002281195,0.000001436345,0.00003379957,0.00004334523],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6843877,"threshold_uncertainty_score":0.9998277,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006405290231647739,"gpt":0.213832053223924,"spread":0.2074267629922762,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004488025,0.00043102,0.0004692321,0.0004038929,0.0004830196,0.0002705588,0.0006922786,0.0002763239,0.000006753166],"category_scores_gemma":[0.000004323962,0.0004049353,0.0001014062,0.001139939,0.0001875135,0.0002632634,0.00002255538,0.001019321,0.000003076074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006015755,"about_ca_system_score_gemma":0.00007017201,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009502238,"about_ca_topic_score_gemma":0.0002827995,"domain_scores_codex":[0.9970289,0.0001879337,0.0005730912,0.001019704,0.0003760697,0.0008143024],"domain_scores_gemma":[0.9979711,0.0007196646,0.0002015739,0.0007705773,0.0001041503,0.0002329928],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005739146,0.0002322256,0.00004659437,0.000009075839,0.00002025759,0.0000548301,0.0003280012,0.9551851,0.001029641,0.0003032131,0.000001908499,0.04273181],"study_design_scores_gemma":[0.001663818,0.0002159508,0.00003754112,0.0001478149,0.00001433422,0.0001585124,0.0000747662,0.9941791,0.002991668,0.000005318082,0.00003696909,0.0004741548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4136662,0.00004296944,0.5849963,0.00004884403,0.0007663228,0.0001794888,7.458779e-7,0.0002259779,0.00007315469],"genre_scores_gemma":[0.8844156,0.00003266739,0.1151676,0.000151749,0.0001043053,0.0000370873,0.000001472078,0.00004716697,0.00004240035],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4707493,"threshold_uncertainty_score":0.9998403,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01566470809883549,"gpt":0.2273635668665228,"spread":0.2116988587676873,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000731233,0.0003260265,0.0003282964,0.0001303401,0.0009711552,0.0002200506,0.0005795907,0.0001124827,0.000004305076],"category_scores_gemma":[0.000006565274,0.0002227928,0.0001583113,0.000545593,0.0002077388,0.00006810672,0.00002158768,0.0006091496,0.000001377494],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009012601,"about_ca_system_score_gemma":0.00003530527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002311243,"about_ca_topic_score_gemma":0.00000456185,"domain_scores_codex":[0.9975739,0.000312861,0.00056457,0.0005671508,0.0004286708,0.0005528819],"domain_scores_gemma":[0.9971382,0.001685634,0.0002977739,0.000700748,0.00008296572,0.0000946663],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001287717,0.0001094991,0.000002098122,0.00000426106,0.00002812981,0.000008594167,0.0006589685,0.938198,0.0006390206,0.01040379,0.000009811517,0.04992492],"study_design_scores_gemma":[0.0003101165,0.0002072213,0.0001131951,0.0003488415,0.00001484141,0.00005490595,0.0004822262,0.9944375,0.003712153,0.00007101281,0.00001124547,0.0002367705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2932103,0.00006948303,0.7053595,0.0002794212,0.0004965003,0.0002025484,0.000001420698,0.0001417844,0.000239035],"genre_scores_gemma":[0.9972095,0.00002083444,0.001609764,0.00101869,0.00008836528,0.00001060785,5.679087e-7,0.00002207937,0.00001955376],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7039993,"threshold_uncertainty_score":0.9085227,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.02644118996341843,"gpt":0.2862196929497967,"spread":0.2597785029863782,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005650203,0.0002799231,0.0002587357,0.0001341844,0.001475856,0.0002528538,0.0007213908,0.00006745871,0.00002198663],"category_scores_gemma":[0.000009103613,0.000242541,0.0001025873,0.0007611904,0.0001390625,0.0001523396,0.00002283585,0.0003051184,0.00004596293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000144145,"about_ca_system_score_gemma":0.00007857921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002289909,"about_ca_topic_score_gemma":0.00006148602,"domain_scores_codex":[0.9981275,0.0001815983,0.0003859159,0.0006105826,0.0002008231,0.0004936116],"domain_scores_gemma":[0.9979382,0.000493601,0.0001395759,0.000729951,0.000575358,0.0001233343],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000036839,0.0002097398,0.00001375508,0.000006643451,0.00004737965,9.871502e-7,0.002230219,0.6373525,0.0002649946,0.001472657,0.00004483663,0.3583194],"study_design_scores_gemma":[0.000856852,0.0007223054,0.00006113148,0.0001706757,0.00001549185,0.000005835068,0.0001217108,0.987036,0.007971344,0.000005204639,0.002721931,0.0003114923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01308436,0.0002059946,0.9837743,0.000117592,0.0009017491,0.001024236,0.000002486634,0.0003274315,0.0005618293],"genre_scores_gemma":[0.957207,0.00007884223,0.04188072,0.0002724561,0.0002170731,0.0001453991,0.000002523308,0.00002701169,0.0001689511],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9441227,"threshold_uncertainty_score":0.9998241,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; 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","retraction":null,"screen_n_in":null,"score":{"opus":0.01862706309625283,"gpt":0.2786956921354312,"spread":0.2600686290391783,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001319485,0.0001857736,0.000177941,0.0001499756,0.0004267426,0.00007464106,0.000296217,0.0001530787,0.00000804931],"category_scores_gemma":[0.00001169497,0.0002114968,0.00006084007,0.0002483854,0.0001234104,0.0002424392,0.000009193372,0.0003308604,0.000004308358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007244744,"about_ca_system_score_gemma":0.00001190034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002492107,"about_ca_topic_score_gemma":0.00001209004,"domain_scores_codex":[0.9990727,0.00001659297,0.0002948872,0.0002556198,0.0000868917,0.0002732665],"domain_scores_gemma":[0.9990452,0.0003563226,0.00006596943,0.0003790752,0.0001030561,0.00005037935],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001768165,0.00003112475,0.00003741019,0.00001823435,0.000031457,2.052532e-7,0.00009799511,0.9032174,0.002134395,0.00002380851,0.00001006142,0.09438023],"study_design_scores_gemma":[0.0004536546,0.0001061452,0.0004138499,0.00008135205,0.00001163584,0.000006171928,0.000126614,0.9740628,0.02433793,0.00001721807,0.0001696852,0.0002129716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3432869,0.00008093131,0.6553039,0.00002152231,0.0003162068,0.0003260178,0.000005029384,0.0006311571,0.00002833388],"genre_scores_gemma":[0.8940264,0.00007438617,0.1056167,0.00002165353,0.00005137645,0.0001478845,0.000006322601,0.00004747219,0.000007770522],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5507395,"threshold_uncertainty_score":0.8624589,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Task (project management); Computer network; Distributed computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02761307984930746,"gpt":0.2406868773261701,"spread":0.2130737974768627,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006474506,0.000233056,0.0002974908,0.0003151582,0.0009819097,0.000148716,0.0004650166,0.000052969,0.000006501209],"category_scores_gemma":[0.000003979056,0.0002613639,0.0001316567,0.0004906835,0.00003762522,0.0002671485,0.00003134171,0.0009464494,0.000003402002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002708922,"about_ca_system_score_gemma":0.00004144052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007892254,"about_ca_topic_score_gemma":0.0001270266,"domain_scores_codex":[0.9978647,0.0003482413,0.0003986505,0.0006653922,0.0002771546,0.0004458288],"domain_scores_gemma":[0.9990016,0.0003786232,0.0001231204,0.0003566093,0.00003571184,0.0001043795],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002798649,0.0001851475,0.0002472721,0.000005939242,0.00003153255,0.00004319229,0.002016041,0.9418213,0.001491397,0.00006424876,0.00000841262,0.05405755],"study_design_scores_gemma":[0.001390142,0.0001909514,0.0006213927,0.00005641648,0.0000118453,0.0000801648,0.0009596798,0.9962077,0.0001479505,0.00001933683,0.00003279271,0.0002816492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3520311,0.0002142687,0.6464669,0.00005778798,0.0007488251,0.0002877615,0.000003673269,0.0001670605,0.00002255392],"genre_scores_gemma":[0.9952306,0.00002743027,0.00415349,0.0003346392,0.00003601737,0.0001085987,0.000001466761,0.00002112188,0.00008664921],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6431994,"threshold_uncertainty_score":0.9999838,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03529612275739086,"gpt":0.2549687856965256,"spread":0.2196726629391347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003061498,0.000221045,0.0002604363,0.00006157958,0.0005528133,0.0002646359,0.00037077,0.0001111509,0.000005771997],"category_scores_gemma":[0.000009553301,0.0002309989,0.0003359019,0.0003696694,0.00003503501,0.0001141413,0.00001113474,0.0003252933,0.00001434423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001514159,"about_ca_system_score_gemma":0.00009214785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002624335,"about_ca_topic_score_gemma":0.000008542007,"domain_scores_codex":[0.9981486,0.0001125069,0.0004101245,0.0006208883,0.0002588468,0.0004490052],"domain_scores_gemma":[0.9986663,0.0004189851,0.0001113169,0.0005139961,0.0001598219,0.0001296173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005601083,0.0003403149,0.00002269117,0.00001697205,0.00005795275,0.00002080247,0.0001108907,0.7986159,0.001859316,0.0004504228,0.0001047054,0.198344],"study_design_scores_gemma":[0.001059635,0.0001588479,0.00006173993,0.0001040227,0.00002341375,0.00002930934,0.00008407024,0.989256,0.007815286,0.0000159403,0.001132935,0.0002588631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1050354,0.0002866841,0.8903679,0.0001497175,0.003407703,0.0004053624,0.00003112459,0.0002985639,0.00001753836],"genre_scores_gemma":[0.9967113,0.00003437927,0.002627089,0.0001542468,0.0002412014,0.00006374239,0.00004083434,0.0000166208,0.0001106512],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8916758,"threshold_uncertainty_score":0.9419861,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.00782092328080329,"gpt":0.2028059329538449,"spread":0.1949850096730417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008202008,0.0002026863,0.0002446013,0.0003038901,0.0001107086,0.00003421439,0.00005170772,0.00005683567,0.00002510749],"category_scores_gemma":[7.786571e-7,0.0002001867,0.00004088107,0.0003728907,0.00002723202,0.0002341626,0.000001670446,0.0002309838,0.00002207568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001046078,"about_ca_system_score_gemma":0.000005251886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005245012,"about_ca_topic_score_gemma":0.00002400533,"domain_scores_codex":[0.9990333,0.00002682928,0.0002854934,0.0002851162,0.0001103336,0.0002589091],"domain_scores_gemma":[0.9996458,0.00007380831,0.00003920261,0.0001375921,0.00003490209,0.00006869471],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008657405,0.00003736906,0.0003091769,0.00003588226,0.0001040485,0.000001197231,0.000888964,0.9782736,0.0002592416,1.507311e-7,1.363877e-7,0.02008153],"study_design_scores_gemma":[0.0007247818,0.00006416305,0.0001073894,0.0001225689,0.00009335826,0.000004068473,0.0006229213,0.9964542,0.001578326,0.000001416055,6.693924e-7,0.0002261336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4474095,0.00007066752,0.5519846,0.000001235234,0.0000360977,0.000379173,0.000003390191,0.00007665914,0.00003861983],"genre_scores_gemma":[0.9857266,0.00009045214,0.01392671,0.000008543382,0.00001724244,0.0001715124,0.00000592178,0.00003635977,0.00001665232],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5383171,"threshold_uncertainty_score":0.8163376,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02471518104194979,"gpt":0.2561665114549453,"spread":0.2314513304129955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000734592,0.0004405168,0.0005498101,0.0002929762,0.0002126903,0.0001581102,0.0009367818,0.0002048512,0.0001240484],"category_scores_gemma":[0.00001567317,0.000504969,0.00009466655,0.0008051113,0.00004145967,0.0003325328,0.0000287356,0.001071684,0.0002943736],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002950121,"about_ca_system_score_gemma":0.00005342506,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004909071,"about_ca_topic_score_gemma":0.00009964019,"domain_scores_codex":[0.9971853,0.0001233503,0.000688088,0.0009153482,0.0003041188,0.0007837819],"domain_scores_gemma":[0.9978195,0.0006112599,0.00008567909,0.001275358,0.00006557547,0.0001425897],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001628314,0.00009178638,0.0002484531,0.00007309677,0.00008329466,0.00002359693,0.0003136692,0.9517846,0.001200652,0.000004583916,0.0001623019,0.04599766],"study_design_scores_gemma":[0.001004396,0.00009349066,0.0006504115,0.0003828264,0.00002892964,0.00004307789,0.0001030455,0.9951136,0.001611527,0.000005405361,0.0004569297,0.0005063505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3061428,0.0001727435,0.690425,0.000008583281,0.001360773,0.000739268,0.00003175,0.0008310408,0.0002879669],"genre_scores_gemma":[0.9847299,0.00002191123,0.01474176,0.00006667185,0.0001364893,0.00001894462,0.00007479017,0.0001325293,0.00007700127],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6785871,"threshold_uncertainty_score":0.9997402,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005773359184752195,"gpt":0.2109810775830105,"spread":0.2052077183982583,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002353854,0.0002959818,0.0003348182,0.0001763804,0.0002537037,0.00007179641,0.0001074706,0.0001870899,0.000004349175],"category_scores_gemma":[0.00000122471,0.000351439,0.00006317966,0.0004844959,0.00002627125,0.000218916,0.000001105357,0.00033,0.00000192226],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002240669,"about_ca_system_score_gemma":0.00001833705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008395866,"about_ca_topic_score_gemma":0.0004011721,"domain_scores_codex":[0.9985331,0.00005287828,0.0004970155,0.0003745673,0.00009657443,0.0004458203],"domain_scores_gemma":[0.999126,0.0004227953,0.00009224847,0.0001951818,0.00009629167,0.00006750885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000508411,0.00004219285,0.00006895461,0.00009164233,0.0000231707,0.000001076793,0.00007780988,0.9660026,0.0009952105,0.00002689998,0.00001600439,0.03260363],"study_design_scores_gemma":[0.001846962,0.00004544086,0.0001277087,0.0002168236,0.00003376689,0.000004467073,0.00004436073,0.9934088,0.003834318,0.00005847167,0.00004520506,0.0003336746],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1336914,0.0002790983,0.8641117,0.00003186599,0.0006398769,0.0008617631,0.00001274387,0.0003496845,0.00002178824],"genre_scores_gemma":[0.9960331,0.0001478734,0.003144532,0.00009062503,0.0002590505,0.0001771815,0.00003149264,0.00009506175,0.00002103804],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8623417,"threshold_uncertainty_score":0.9998938,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007355821565909815,"gpt":0.2115931803607943,"spread":0.2042373587948845,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002303754,0.0001854884,0.0001897707,0.0001749455,0.0001399193,0.00003094288,0.0001400162,0.0001163825,0.000004104365],"category_scores_gemma":[0.000005894549,0.000232348,0.00005208692,0.0003588491,0.00001335612,0.0001581539,9.803119e-7,0.0001949544,0.00001009717],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003153687,"about_ca_system_score_gemma":0.00001476047,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000925439,"about_ca_topic_score_gemma":0.00001830731,"domain_scores_codex":[0.9988877,0.0000714706,0.0003728648,0.0002911608,0.00008485384,0.0002919364],"domain_scores_gemma":[0.9993023,0.0002180671,0.00005934714,0.0002737118,0.00007340616,0.00007315676],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007966804,0.00008021224,0.00001220016,0.00007356356,0.00001105785,2.903217e-7,0.0004035069,0.9757096,0.0146135,0.0000148045,0.00001816057,0.0090551],"study_design_scores_gemma":[0.0005173421,0.00009844275,0.00005170045,0.00008076152,0.00001441355,0.000003988924,0.0001648318,0.97224,0.0258314,0.00002209656,0.0007491503,0.0002258815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06299397,0.00003052848,0.9350355,0.000007049938,0.0004058793,0.0006351555,0.00002377608,0.0008282034,0.00003993474],"genre_scores_gemma":[0.9455836,0.00000613394,0.05406154,0.00001563376,0.0001077535,0.00009468129,0.00005285641,0.00006817872,0.000009602427],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8825896,"threshold_uncertainty_score":0.9474875,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02373602989164232,"gpt":0.2440994077803274,"spread":0.2203633778886851,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002563953,0.0002760783,0.0002741522,0.000167645,0.0004677213,0.000181264,0.000537723,0.00008132964,0.00002781497],"category_scores_gemma":[0.000006764085,0.0002881056,0.0001676329,0.0005083957,0.00003583826,0.0001451849,0.000007166668,0.0005149404,0.0001404529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001131319,"about_ca_system_score_gemma":0.0001126755,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002638862,"about_ca_topic_score_gemma":0.00004581895,"domain_scores_codex":[0.9978886,0.000167205,0.0003924705,0.0006590932,0.0004586503,0.0004339736],"domain_scores_gemma":[0.9988197,0.0002926317,0.0001149584,0.0004674293,0.0000851654,0.0002200939],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004088093,0.0003837963,0.00003865002,0.00002819095,0.00002040999,0.00002511516,0.0009692824,0.9041981,0.0001970613,0.00007089536,0.0009286879,0.09309898],"study_design_scores_gemma":[0.0008404877,0.0006130598,0.0000362362,0.00005844924,0.0000218207,0.000003995857,0.0001132157,0.9950192,0.00158954,0.000006397413,0.001397937,0.0002996665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0736872,0.00002633367,0.9238586,0.000492807,0.0008512982,0.0003362807,0.00007064074,0.0005840546,0.00009277093],"genre_scores_gemma":[0.9768414,0.000003714101,0.02105977,0.0018025,0.0001177874,0.00002753616,0.00001537038,0.00003173995,0.0001001683],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9031542,"threshold_uncertainty_score":0.9999571,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01097947883319094,"gpt":0.2077546191934288,"spread":0.1967751403602379,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001255196,0.0001363258,0.0001170487,0.00009294018,0.0002143507,0.00006915024,0.00006262434,0.00005811933,0.00002849992],"category_scores_gemma":[1.975401e-7,0.0001187922,0.00002009334,0.0001877534,0.00003770733,0.0002521458,0.000001437939,0.0001098728,0.00004128086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008945039,"about_ca_system_score_gemma":0.000007855505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001492449,"about_ca_topic_score_gemma":0.000005361174,"domain_scores_codex":[0.9993162,0.00005021582,0.0001950576,0.0001137057,0.0001265527,0.0001983261],"domain_scores_gemma":[0.99965,0.00003785539,0.00003630469,0.0001621905,0.00005337864,0.00006029099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008007542,0.00004068687,0.0002495913,0.00006042464,0.0000339632,1.387294e-7,0.001428023,0.9577324,0.004052916,0.000007848302,0.00001327328,0.03637267],"study_design_scores_gemma":[0.0003202647,0.00007341527,0.00008817967,0.00008835849,0.00002426514,0.00001728328,0.0003722462,0.9484512,0.0494304,0.000009398436,0.0009285175,0.0001964682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.149358,0.000101118,0.8496948,0.0000132648,0.00007975922,0.0002627064,0.000001665005,0.0002957718,0.0001928475],"genre_scores_gemma":[0.9983972,0.00002769579,0.001321296,0.00002472611,0.00005719198,0.00001702457,0.00001050976,0.00003582021,0.0001085461],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8490391,"threshold_uncertainty_score":0.4844206,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01156234265538069,"gpt":0.2615333743360205,"spread":0.2499710316806398,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0008185407,0.0003588816,0.0003851719,0.0003769851,0.002001011,0.0004592591,0.0004746933,0.0001817886,0.000003092744],"category_scores_gemma":[0.00003454018,0.0003986437,0.0002480524,0.001227081,0.00005847747,0.000209264,0.00002827142,0.0006997288,0.0001533501],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001948323,"about_ca_system_score_gemma":0.0001122502,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008410825,"about_ca_topic_score_gemma":0.000002168443,"domain_scores_codex":[0.9972393,0.000210259,0.0005146299,0.000841121,0.0002871662,0.0009075251],"domain_scores_gemma":[0.9973773,0.001775399,0.0001962735,0.0003657477,0.0001247563,0.0001605349],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002089969,0.00003671347,0.000006601584,0.00002039962,0.00003686419,0.00002391154,0.0006297493,0.8150173,0.0008161502,0.000006352389,0.0001126214,0.1832725],"study_design_scores_gemma":[0.0005712708,0.000261998,0.00009011202,0.0001949751,0.00002499548,0.00003114389,0.00006999909,0.9961573,0.001287309,0.00003922858,0.0008406492,0.0004309604],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1367433,0.00002098374,0.8574579,0.00005540661,0.003637205,0.0004989825,9.914123e-7,0.001463379,0.0001218581],"genre_scores_gemma":[0.984525,0.000004321582,0.01393336,0.0001651664,0.0005961833,0.00004074203,0.00001393708,0.00007017308,0.0006511743],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8477817,"threshold_uncertainty_score":0.9998465,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007109315937893406,"gpt":0.1888526938662236,"spread":0.1817433779283301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001209536,0.0001936131,0.0001906425,0.0001787136,0.0002274979,0.00005767572,0.00006568389,0.0001186514,0.00001620143],"category_scores_gemma":[0.000004392136,0.0001821902,0.00003580741,0.0002730523,0.0001031636,0.00009829022,0.000001623258,0.0002179845,0.00001450718],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001385037,"about_ca_system_score_gemma":0.00001532478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001181679,"about_ca_topic_score_gemma":0.00001491616,"domain_scores_codex":[0.9990805,0.00003268461,0.000253448,0.0002302683,0.0001820982,0.0002209464],"domain_scores_gemma":[0.9995699,0.00005564935,0.00004592517,0.0001932656,0.00007856493,0.00005668604],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001248152,0.0000239778,0.0001470883,0.00006911458,0.0000343016,0.000001157361,0.0002158566,0.8817252,0.0006679806,0.0001266378,0.00004939138,0.1169268],"study_design_scores_gemma":[0.000780605,0.0002116816,0.00009306915,0.0001197198,0.00003496465,0.00004078864,0.0002836809,0.8999435,0.09685645,0.0000547779,0.001315038,0.0002656789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1192241,0.00006148214,0.8786746,0.0000213652,0.0004363166,0.0002692268,0.000002925075,0.001169107,0.0001409495],"genre_scores_gemma":[0.9947288,0.00004788492,0.00504247,0.00004793722,0.00004088329,0.00003180586,0.000003445589,0.00004147319,0.00001529448],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8755047,"threshold_uncertainty_score":0.74295,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01351600933497423,"gpt":0.2399856508324441,"spread":0.2264696414974699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.001139103,0.0003138655,0.0003879467,0.0002887907,0.001538821,0.0003401244,0.0007296455,0.00009491498,0.000006722754],"category_scores_gemma":[0.00001423262,0.0003470116,0.0001764963,0.0006802458,0.0001221995,0.0001787704,0.00004704215,0.0005291111,0.000004980365],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002619228,"about_ca_system_score_gemma":0.0001028505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001984365,"about_ca_topic_score_gemma":2.793062e-7,"domain_scores_codex":[0.9970086,0.0003834858,0.0005666564,0.0008903491,0.0004535145,0.0006974377],"domain_scores_gemma":[0.9982199,0.0007548566,0.0001922804,0.0005382693,0.0001033105,0.0001914023],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000136379,0.0006359576,0.00002495413,0.000349342,0.0001503748,0.00001289129,0.008690648,0.7816132,0.001502205,0.01129207,0.00209439,0.1934976],"study_design_scores_gemma":[0.0009858247,0.0002834237,0.000009480201,0.00006678738,0.00003814958,0.0001387466,0.000588179,0.9849585,0.0008936703,0.0001990766,0.01145151,0.0003866932],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0360377,0.0002595021,0.9562631,0.0001420408,0.005508957,0.001118071,0.00000629951,0.0004820071,0.000182266],"genre_scores_gemma":[0.9859099,0.00000722595,0.01293913,0.0001664619,0.0005657465,0.0002864996,0.00001307812,0.00004556018,0.0000663765],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9498722,"threshold_uncertainty_score":0.9998982,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006133857085514785,"gpt":0.2100135791032065,"spread":0.2038797220176917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001357819,0.0002583022,0.0002500395,0.0002780332,0.0001174746,0.00008350317,0.0001307092,0.0001087621,0.00002024684],"category_scores_gemma":[0.000001410973,0.0002952831,0.00004419416,0.0006737526,0.00001933936,0.0002030625,0.000004229199,0.0006110452,0.00001596296],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002372219,"about_ca_system_score_gemma":0.00001097583,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002028276,"about_ca_topic_score_gemma":0.0002816023,"domain_scores_codex":[0.9986291,0.00004607944,0.0003816086,0.0004225823,0.00009198009,0.0004286579],"domain_scores_gemma":[0.9995606,0.00007940694,0.00005821139,0.0001746347,0.00003015084,0.00009697431],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004625214,0.00006681974,0.0001782203,0.0001184948,0.00001298632,7.595989e-7,0.0005822895,0.9891158,0.0008444355,0.00000425879,0.000001922515,0.009069366],"study_design_scores_gemma":[0.0005802814,0.00004477129,0.000289609,0.00008661793,0.00001276295,0.00002404422,0.0001104842,0.9979864,0.0005353032,0.0000434224,0.00001423664,0.0002721109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2538052,0.00009421011,0.7445288,0.000007415224,0.0002069392,0.0006629925,7.874996e-7,0.0003702135,0.0003234415],"genre_scores_gemma":[0.9830303,0.0000498444,0.01652247,0.00003424997,0.00006418682,0.000146225,0.000004609119,0.00007875564,0.00006935567],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7292251,"threshold_uncertainty_score":0.9999499,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01696949112275252,"gpt":0.2824695090405268,"spread":0.2655000179177743,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000922318,0.0002001658,0.0002450495,0.0001935652,0.001391431,0.00007991568,0.0001634747,0.0001823154,0.0004836571],"category_scores_gemma":[0.00004278506,0.0002070349,0.0001643561,0.0003373809,0.000644048,0.00008954979,0.000001871894,0.0005089688,0.00005995149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002631441,"about_ca_system_score_gemma":0.0002392077,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001524888,"about_ca_topic_score_gemma":0.01258803,"domain_scores_codex":[0.9978501,0.0005917759,0.000359736,0.0005138544,0.0003504976,0.0003340866],"domain_scores_gemma":[0.9983894,0.0009463283,0.00008700944,0.0002759263,0.0001392905,0.000162021],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007171087,0.0006858265,0.000146151,0.00001545123,0.00002840813,7.385361e-7,0.01390056,0.4954812,0.00007263164,0.0001329336,0.00006616745,0.4893982],"study_design_scores_gemma":[0.002241086,0.0009905389,0.001254079,0.0001750846,0.0001694316,0.000002394286,0.007978141,0.9594303,0.002026176,0.0001889578,0.0249202,0.0006235731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2845886,0.00004663844,0.7122755,0.0002537689,0.0002829645,0.0005737967,0.00007026038,0.0002293981,0.001679058],"genre_scores_gemma":[0.9986923,0.000007455563,0.0002828099,0.0002567809,0.0004587797,0.00006724349,0.0000129285,0.00001504506,0.0002066571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7141037,"threshold_uncertainty_score":0.9999086,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01632178714720007,"gpt":0.2634931279648677,"spread":0.2471713408176676,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008208459,0.0003772733,0.0005148206,0.0004628868,0.000614871,0.0004599463,0.0004435814,0.0001824135,0.000001211711],"category_scores_gemma":[0.000009659779,0.0004201853,0.0001537851,0.000792718,0.0000556802,0.0005388622,0.00002584619,0.0005141296,0.0000259351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002466717,"about_ca_system_score_gemma":0.00009666346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002127781,"about_ca_topic_score_gemma":0.000007820567,"domain_scores_codex":[0.9970714,0.0001604508,0.0007941233,0.0009478259,0.0003203918,0.0007057962],"domain_scores_gemma":[0.9982366,0.0007998647,0.0002826918,0.0003741513,0.0001681743,0.0001385435],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000024628,0.000140212,0.0003057756,0.0001610653,0.00002732329,0.000003746917,0.001898352,0.8064643,0.0004866135,0.00004096523,0.0000403491,0.1904067],"study_design_scores_gemma":[0.001355182,0.0003834273,0.0008541499,0.0003594335,0.00001614094,0.0000677319,0.0002472418,0.9953398,0.0004856019,0.00004887795,0.0004089913,0.0004334964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4564725,0.00006963244,0.5360403,0.0000483613,0.006396563,0.0007015783,0.000001653129,0.0002407319,0.00002864288],"genre_scores_gemma":[0.9558908,0.000004453604,0.04309195,0.00008173697,0.0007786987,0.00001954093,0.000008817241,0.00004461131,0.00007937503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4994183,"threshold_uncertainty_score":0.999825,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01758299061223584,"gpt":0.2640407087262677,"spread":0.2464577181140319,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002281556,0.0001930371,0.0002705591,0.0002351995,0.0002915297,0.000174225,0.000335144,0.0001048935,0.000002008198],"category_scores_gemma":[0.00002247542,0.0002139586,0.00007844024,0.0006943817,0.00003512807,0.0003600449,0.000008180146,0.0002881788,0.000002469215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009576807,"about_ca_system_score_gemma":0.00009051298,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002287314,"about_ca_topic_score_gemma":0.00001617424,"domain_scores_codex":[0.9985483,0.00006379384,0.0005276854,0.0003638486,0.0001627708,0.0003336217],"domain_scores_gemma":[0.9990134,0.0003679121,0.0001833162,0.0001992777,0.00009502868,0.0001410683],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002281767,0.00007116493,0.00001858215,0.00003024301,0.00001537287,0.000001723776,0.0009819935,0.8767053,0.0001518481,0.0001886512,0.000004902025,0.1218074],"study_design_scores_gemma":[0.001717457,0.00013986,0.00018502,0.00009345226,0.000008959605,0.000009064243,0.0001817853,0.9970815,0.0003285865,0.00001051213,0.0000447498,0.0001990351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05072679,0.00004418376,0.9467002,0.001422193,0.0002169145,0.0006261028,0.000008862384,0.0002350999,0.00001967016],"genre_scores_gemma":[0.8282045,0.00001619845,0.1702039,0.00137565,0.0001405635,0.00003415328,0.000004434855,0.00001649947,0.000004109672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7774777,"threshold_uncertainty_score":0.8724978,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007684205611487831,"gpt":0.2150057179334359,"spread":0.207321512321948,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008856938,0.0002099816,0.0002093278,0.0001440718,0.0002757817,0.00005636906,0.0001759698,0.000171983,0.00001487688],"category_scores_gemma":[0.000005114347,0.0001767722,0.00007141991,0.0002475378,0.00007747475,0.0001446215,0.000003979013,0.0001262442,0.000005687927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008371785,"about_ca_system_score_gemma":0.000009672026,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004882218,"about_ca_topic_score_gemma":0.00001328398,"domain_scores_codex":[0.9990151,0.00002177871,0.0002767945,0.0002585163,0.0001038749,0.0003239209],"domain_scores_gemma":[0.9993731,0.000190367,0.00004518406,0.0002708046,0.00006488505,0.00005565622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005413448,0.00001398447,0.00001405371,0.00002362981,0.00002275194,8.640951e-7,0.00005650364,0.4505641,0.000170026,0.00005322355,0.0001002892,0.5489752],"study_design_scores_gemma":[0.001156379,0.0001034935,0.00002021629,0.0001057056,0.00002583767,0.000007491338,0.00009717536,0.985476,0.01204688,0.0001404809,0.0005827845,0.0002375466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007800764,0.0001329313,0.9896553,0.00003590095,0.000741384,0.0004807909,0.00004346431,0.001076658,0.00003282667],"genre_scores_gemma":[0.9934993,0.0002812533,0.005855089,0.00004032955,0.0001026722,0.000102248,0.000003884501,0.00005667922,0.00005853882],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9856985,"threshold_uncertainty_score":0.720856,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03566837131189985,"gpt":0.2586394198419578,"spread":0.2229710485300579,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004047213,0.0003338863,0.000326469,0.0002245104,0.0006133729,0.0003251992,0.0008266117,0.000132622,0.00001473272],"category_scores_gemma":[0.00001969146,0.0003402282,0.0002946814,0.0007010092,0.00007126243,0.0001467718,0.000008403132,0.0003603057,0.0001250384],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001609167,"about_ca_system_score_gemma":0.0001055027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004268925,"about_ca_topic_score_gemma":0.000002732365,"domain_scores_codex":[0.9973245,0.0001426528,0.0005995664,0.0009122225,0.0005310885,0.0004900144],"domain_scores_gemma":[0.9982449,0.0003762429,0.0002240739,0.0007157941,0.0001827572,0.0002562381],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001074538,0.001639968,0.00001164709,0.0002453692,0.00007003922,0.000005488378,0.03375952,0.8621715,0.02945295,0.0005798876,0.0001617883,0.07179435],"study_design_scores_gemma":[0.0009424231,0.0009081524,0.000014084,0.0001123534,0.00002045758,0.000001737102,0.0003389747,0.9405131,0.05543472,0.00001837543,0.001350981,0.0003445907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2426762,0.00001789947,0.7531756,0.0005552627,0.0006283296,0.002280074,0.00002043475,0.0005830465,0.00006313984],"genre_scores_gemma":[0.99472,0.000001124448,0.00327659,0.001102372,0.0001193649,0.000683756,0.00001000978,0.00004641771,0.00004030873],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7520438,"threshold_uncertainty_score":0.999905,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01480978653165515,"gpt":0.2728077714048264,"spread":0.2579979848731713,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001080348,0.0002698029,0.0001736454,0.0001502731,0.000431422,0.0004009852,0.0002104933,0.0001085907,0.00009282867],"category_scores_gemma":[0.000002837871,0.0002441353,0.0002017616,0.0003710012,0.00006283342,0.0005728304,0.000004088999,0.0003633069,0.00006311621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004282534,"about_ca_system_score_gemma":0.00003001299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002735371,"about_ca_topic_score_gemma":0.00001321215,"domain_scores_codex":[0.9986705,0.00001659387,0.0004671248,0.0002960321,0.0002189248,0.0003308537],"domain_scores_gemma":[0.9992107,0.0003324239,0.00003555697,0.0002815887,0.00005884444,0.00008087904],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000005779645,0.00007212481,0.000001195964,0.0001231999,0.00007121421,0.000001930426,0.0002784347,0.9429432,0.0003008975,0.00001401827,0.0006030884,0.05558494],"study_design_scores_gemma":[0.0004156559,0.00008333142,0.000003705333,0.0002440273,0.00004747161,0.00003236282,0.0003234468,0.9915484,0.002589603,0.00002691219,0.004412284,0.0002727952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03726784,0.000168458,0.9574957,0.0001009375,0.00136242,0.0009052803,0.0006351826,0.001244741,0.0008194041],"genre_scores_gemma":[0.9977412,0.00001506118,0.0009366345,0.00003490106,0.0001164098,0.0002115435,0.0002396869,0.00009328951,0.0006112338],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9604734,"threshold_uncertainty_score":0.9955548,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.05278846182168014,"gpt":0.2837829283760228,"spread":0.2309944665543427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005422694,0.0002609216,0.0002918922,0.0001659323,0.002957668,0.0009015522,0.0005228788,0.00008287116,7.038965e-7],"category_scores_gemma":[0.000005408515,0.0002605785,0.0001130948,0.00005944732,0.0000679293,0.0007210392,0.00005244759,0.0003654935,9.065402e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001093062,"about_ca_system_score_gemma":0.00001742602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001880329,"about_ca_topic_score_gemma":0.00003264789,"domain_scores_codex":[0.9982989,0.0000617819,0.0003001425,0.0007768548,0.0001953319,0.0003669674],"domain_scores_gemma":[0.9989777,0.00007601848,0.0002455216,0.0004566932,0.0001288903,0.0001151499],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00009562194,0.0004218447,0.00007353216,0.0002194882,0.0004887441,0.00004007421,0.01769181,0.006943555,0.008107212,0.01679034,0.000007483118,0.9491203],"study_design_scores_gemma":[0.0009756391,0.0003704097,0.0004138273,0.0002685995,0.0000478724,0.00001555429,0.00332162,0.9891779,0.003781088,0.001268443,0.00000697503,0.0003520925],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2226137,0.00002803388,0.7756706,0.0001793545,0.0005463616,0.0007177271,0.00001026667,0.0001553268,0.00007857595],"genre_scores_gemma":[0.994805,0.00001966863,0.004786354,0.0001147228,0.00007649204,0.0001173075,0.00000162301,0.00002403137,0.00005481253],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9822343,"threshold_uncertainty_score":0.9999846,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.04258256282409849,"gpt":0.2678853654331454,"spread":0.2253028026090469,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007520822,0.0004649989,0.0005942729,0.0002557048,0.00128221,0.0006873123,0.0006134525,0.0001539019,0.000005240901],"category_scores_gemma":[0.0000183945,0.0004979768,0.0001398992,0.001735167,0.00007220558,0.0007495112,0.00009999346,0.001174021,0.00001370955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002066665,"about_ca_system_score_gemma":0.0001004243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009362509,"about_ca_topic_score_gemma":0.00001396313,"domain_scores_codex":[0.9964961,0.0003370069,0.00083423,0.001068932,0.0003638837,0.0008998481],"domain_scores_gemma":[0.9987528,0.0002609162,0.0002836609,0.000250086,0.0001892906,0.0002632469],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002081317,0.0001000168,0.000961416,0.0000886684,0.00005028033,0.000009296182,0.006231633,0.9498606,0.0003975806,0.00004573738,0.00005359219,0.04218034],"study_design_scores_gemma":[0.001497376,0.0002346647,0.0007252085,0.0002168309,0.00001655707,0.00003268642,0.0001732185,0.9939332,0.00251974,0.000005539438,0.0001209644,0.0005240308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1634386,0.00009620263,0.833613,0.00007729264,0.001572592,0.0006401585,1.04847e-7,0.0004164495,0.0001455762],"genre_scores_gemma":[0.9775497,0.00001625544,0.02116618,0.0004997625,0.0006579152,0.00002668135,0.000003008217,0.00004485272,0.00003565951],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8141111,"threshold_uncertainty_score":0.9997472,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.006467901101342321,"gpt":0.2365291250792432,"spread":0.2300612239779009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005265278,0.0002707817,0.0003131999,0.0002062029,0.0004266783,0.0001750796,0.0003804078,0.0002580825,0.00001020962],"category_scores_gemma":[0.00001343603,0.0002895014,0.0001051397,0.0008453476,0.0001027329,0.0001148586,0.00001751096,0.001206842,0.00001258921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007745901,"about_ca_system_score_gemma":0.00001922679,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004743313,"about_ca_topic_score_gemma":0.0002937622,"domain_scores_codex":[0.9976815,0.0001548529,0.0004786613,0.0007990942,0.0002594907,0.0006263892],"domain_scores_gemma":[0.9983208,0.0005328725,0.0001218957,0.000763974,0.00007599682,0.0001844524],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002425926,0.0002876447,0.00007058722,0.000009555974,0.00001004001,0.00001544355,0.0005828402,0.9246076,0.002234787,0.00004051285,0.000003085276,0.0721136],"study_design_scores_gemma":[0.001002518,0.00009009562,0.0005010189,0.00004746982,0.000009938182,0.00008213755,0.0001085423,0.9898652,0.007798124,0.00001470348,0.0001937736,0.0002864406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4238471,0.00001846354,0.5745193,0.00004722292,0.0009733731,0.0003229681,0.000005752593,0.0002545499,0.00001121817],"genre_scores_gemma":[0.9842697,0.00001164452,0.01544834,0.00008964903,0.0001066074,0.00004038631,0.000002567249,0.00002535752,0.00000576756],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5604226,"threshold_uncertainty_score":0.9999557,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01455674706783932,"gpt":0.2249536827157202,"spread":0.2103969356478809,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009299974,0.0004290008,0.0004771193,0.0004354166,0.001175505,0.0001516731,0.001136149,0.00008402446,0.00001496233],"category_scores_gemma":[0.000005127328,0.0004540636,0.0001747863,0.001706477,0.0000585125,0.0002971098,0.00007441606,0.001368471,0.00001759064],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009599427,"about_ca_system_score_gemma":0.0004047168,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004330824,"about_ca_topic_score_gemma":0.0001199086,"domain_scores_codex":[0.9964226,0.0003368109,0.0006535223,0.001118586,0.0005968864,0.000871527],"domain_scores_gemma":[0.9981371,0.0005311397,0.0002362847,0.000772109,0.0001554716,0.0001679643],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006404418,0.0009824954,0.0002553344,0.00004849015,0.00003465339,0.0001063887,0.004254371,0.9157004,0.001167539,0.00001826153,0.00006278099,0.07730524],"study_design_scores_gemma":[0.001313059,0.000861434,0.0002388809,0.0001560306,0.00002039172,0.00009106351,0.00113749,0.9915008,0.003411639,0.00006743162,0.000604855,0.0005969236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3775372,0.00006623697,0.6187878,0.00004315443,0.002552334,0.0005096758,0.000004950479,0.0003244728,0.0001741633],"genre_scores_gemma":[0.9773885,0.000003776925,0.02181118,0.0002447568,0.0002821549,0.000100001,0.000004435984,0.00004857631,0.0001166364],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5998513,"threshold_uncertainty_score":0.9997911,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0481440027074141,"gpt":0.3056492883687118,"spread":0.2575052856612977,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008964448,0.0003422954,0.0003227019,0.0004651558,0.001224425,0.0004375859,0.007588172,0.0001926463,0.00001138747],"category_scores_gemma":[0.0003468894,0.0003729885,0.000143275,0.001740583,0.0001034842,0.0007448007,0.001321848,0.0009742656,0.0001778054],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000238259,"about_ca_system_score_gemma":0.00008407328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001041893,"about_ca_topic_score_gemma":0.00002971215,"domain_scores_codex":[0.9968519,0.0002564923,0.0004699214,0.001127407,0.0005043721,0.0007899122],"domain_scores_gemma":[0.9961677,0.000291137,0.0001767327,0.003069801,0.0001346304,0.000159996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001861124,0.0001702398,0.00008629198,0.00002329523,0.00006456451,0.00005925226,0.0003738736,0.3430407,0.002579317,0.00007904616,0.0004421478,0.6530627],"study_design_scores_gemma":[0.0002873442,0.0004734458,0.0004713518,0.000087109,0.000009928302,0.00002503077,0.0002610948,0.9545748,0.04239674,0.0007133115,0.0003200055,0.0003798284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.385106,0.00001496601,0.609836,0.0002443416,0.0006547529,0.0002459028,0.00000819476,0.003797776,0.00009199554],"genre_scores_gemma":[0.9096689,0.00002577828,0.09004188,0.00007051756,0.00004917989,0.00005821419,0.000008743365,0.00003996685,0.00003688922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6526828,"threshold_uncertainty_score":0.9998722,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02477838387538315,"gpt":0.257888408299263,"spread":0.2331100244238799,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005721223,0.000333137,0.0003304546,0.0003396201,0.001227994,0.0002276518,0.001145981,0.0001304308,0.000005109867],"category_scores_gemma":[0.00001364688,0.0002897002,0.000250977,0.0004787551,0.00006062435,0.0004143496,0.00002665593,0.0002408979,0.00003849965],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002345916,"about_ca_system_score_gemma":0.00006631917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003704184,"about_ca_topic_score_gemma":0.000006526921,"domain_scores_codex":[0.9976239,0.0001745342,0.0005238454,0.0007092301,0.0003021314,0.0006663628],"domain_scores_gemma":[0.9968072,0.001686515,0.0002472168,0.0009121199,0.0001952662,0.0001517028],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006209153,0.0003117228,0.00002065109,0.00005536381,0.00009148011,0.0000048193,0.002206079,0.04734777,0.003712212,0.0006820421,0.001386477,0.9441193],"study_design_scores_gemma":[0.001424424,0.0004370241,0.00003478361,0.0009985336,0.00001965809,0.000018628,0.0001203904,0.9620715,0.02908797,0.0004804877,0.004702272,0.0006043407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01883284,0.00004178932,0.9747797,0.0004843941,0.004554543,0.0003863488,0.000004907177,0.0006553608,0.000260066],"genre_scores_gemma":[0.9840162,0.00001683482,0.01474209,0.0004003457,0.0005299161,0.0000987975,0.000004296078,0.00004777089,0.0001437621],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9651833,"threshold_uncertainty_score":0.9999555,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01529928816237755,"gpt":0.2479359653043747,"spread":0.2326366771419971,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007975856,0.0003531221,0.0004081109,0.0008104488,0.0005879312,0.0004782907,0.0005068048,0.0001541528,0.00003149333],"category_scores_gemma":[0.00004705853,0.0003762094,0.0001195427,0.004103699,0.00005525045,0.0007231638,0.00003222258,0.0006697088,0.00003408969],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003489637,"about_ca_system_score_gemma":0.0002406367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001326045,"about_ca_topic_score_gemma":0.0001377305,"domain_scores_codex":[0.9969202,0.0003579248,0.0006479015,0.001011329,0.0004209078,0.0006417566],"domain_scores_gemma":[0.997517,0.0006647137,0.0002310013,0.001040632,0.0003983633,0.0001482533],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002017201,0.000310177,0.0003246777,0.00009430973,0.00003057932,0.00007061345,0.001462624,0.6193892,0.003270329,0.00001573772,0.00005266982,0.3749589],"study_design_scores_gemma":[0.001877553,0.0003892938,0.001453959,0.001119493,0.00004147838,0.0003869195,0.001134393,0.9202744,0.07063891,0.00007417675,0.001669621,0.0009397645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3042795,0.000225074,0.6938936,0.0001538503,0.0005683441,0.0003733878,0.000001662458,0.0002987778,0.0002057283],"genre_scores_gemma":[0.968565,0.00004505388,0.03085641,0.0002178512,0.00009052904,0.00006074345,0.000007970742,0.00004713879,0.0001092307],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6642855,"threshold_uncertainty_score":0.999869,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03543056412763705,"gpt":0.2323286326801966,"spread":0.1968980685525596,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004109499,0.0001807906,0.0002305301,0.00005039564,0.0006442709,0.0001419896,0.000636172,0.00004148403,0.000002045503],"category_scores_gemma":[0.00001808182,0.0001304869,0.0001090597,0.0003322373,0.00007264503,0.0001647482,0.00001001128,0.0003922782,0.00001262453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006952052,"about_ca_system_score_gemma":0.00007386819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007091697,"about_ca_topic_score_gemma":0.000005862358,"domain_scores_codex":[0.9984457,0.0002295806,0.0003377321,0.0004007508,0.000306319,0.0002798818],"domain_scores_gemma":[0.9986383,0.0006043337,0.0001486168,0.0003992491,0.0001096831,0.00009980228],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006104114,0.00007855717,0.000009388041,0.00002514737,0.00005176854,0.000008880239,0.0006108009,0.9243668,0.00966452,0.0001088327,0.000006663918,0.06500765],"study_design_scores_gemma":[0.0003531501,0.0004358185,0.00002771432,0.00009455331,0.00002534722,0.00002090709,0.00007066323,0.9972727,0.001489942,0.00003881673,0.00001113274,0.0001592607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06196129,0.00008313343,0.936673,0.0003502492,0.0001971389,0.000480413,0.000002949339,0.000222194,0.00002962119],"genre_scores_gemma":[0.9898509,0.000006713143,0.009883049,0.0001711557,0.00001739429,0.00002062387,5.359736e-7,0.00001525345,0.00003432209],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9278896,"threshold_uncertainty_score":0.5321101,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01743833570027899,"gpt":0.255682653234459,"spread":0.23824431753418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001969874,0.000190505,0.0001998187,0.0001819634,0.0003412399,0.0002503163,0.0006690494,0.0000684309,0.00003973971],"category_scores_gemma":[0.000002695276,0.0001759622,0.00004281933,0.0008533358,0.00005280002,0.000491363,0.00001511993,0.0005377693,0.00002910843],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000131701,"about_ca_system_score_gemma":0.00006226193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008361191,"about_ca_topic_score_gemma":0.0002743338,"domain_scores_codex":[0.9986578,0.0001401047,0.0003312034,0.0004125633,0.0001388441,0.0003195247],"domain_scores_gemma":[0.9987845,0.0003264933,0.0001060891,0.0005137093,0.0001862735,0.00008289921],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004172713,0.00004604317,0.0001393011,0.000003946245,0.000007037668,0.000001366356,0.000434417,0.7422704,0.0002796396,0.0002401693,0.00000394402,0.2565696],"study_design_scores_gemma":[0.0003436075,0.0001016475,0.0004218319,0.0002693867,0.000002827257,0.000005777379,0.00007726939,0.9967272,0.001809999,0.00001843208,0.000009569947,0.0002124357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1930356,0.00008947726,0.8057873,0.0001439507,0.0002548374,0.0003689119,1.78326e-7,0.000144086,0.0001756397],"genre_scores_gemma":[0.9851868,0.0001310846,0.01432014,0.0001604945,0.00003769747,0.0001023891,0.000001147504,0.00001464924,0.00004561067],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7921512,"threshold_uncertainty_score":0.7175532,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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)","retraction":null,"screen_n_in":null,"score":{"opus":0.01245002267926181,"gpt":0.2175406416689027,"spread":0.2050906189896409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004206222,0.0004141528,0.0004137722,0.0004078097,0.0004110009,0.0001275915,0.0009640435,0.0002453592,0.0000472573],"category_scores_gemma":[0.00000367844,0.0004391177,0.0001851064,0.001287637,0.00009344093,0.00026698,0.00001655467,0.0009463563,0.0001167712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000189471,"about_ca_system_score_gemma":0.00004694932,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001863109,"about_ca_topic_score_gemma":0.00004991683,"domain_scores_codex":[0.9968559,0.0001926564,0.0006197823,0.0009935537,0.0004126396,0.0009254405],"domain_scores_gemma":[0.9980301,0.0004434928,0.0001826718,0.001063721,0.00007699399,0.0002030579],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003810635,0.0006071144,0.00004027804,0.00001249831,0.00001609691,0.00006984153,0.0006388651,0.9399546,0.00006734345,0.0008008407,0.00003610944,0.05771828],"study_design_scores_gemma":[0.0006787588,0.0003003885,0.0001501039,0.0003551157,0.000007242,0.00002740136,0.00005709158,0.9923077,0.005539562,0.00006375169,0.00005946678,0.0004533988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2732886,0.00003592693,0.7229548,0.0000209774,0.001661982,0.0002967292,0.000001433871,0.0004340812,0.001305456],"genre_scores_gemma":[0.9834566,0.00004090078,0.01580098,0.0003019423,0.0001048155,0.00004261408,0.000001396101,0.00005896419,0.0001918066],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7101679,"threshold_uncertainty_score":0.999806,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.005291760724860604,"gpt":0.204917135916427,"spread":0.1996253751915664,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001506259,0.0001784173,0.000223453,0.0001784295,0.0001225267,0.00003698153,0.00007843057,0.0001058252,0.000012324],"category_scores_gemma":[0.000001279402,0.0001974037,0.00006946298,0.0004868442,0.00001525881,0.00006992603,9.987634e-7,0.0001777974,0.000005355117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001617266,"about_ca_system_score_gemma":0.00002344182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001737223,"about_ca_topic_score_gemma":0.00001268507,"domain_scores_codex":[0.9989872,0.00002908983,0.0003162511,0.0002450324,0.00009976014,0.0003226695],"domain_scores_gemma":[0.9994726,0.0002222284,0.00004666382,0.0001458725,0.00006367345,0.00004899498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002405162,0.00003777405,0.000006267004,0.00003102003,0.00001764625,0.000001108653,0.0004151785,0.9738265,0.003395701,0.0000358391,0.000009451263,0.0221995],"study_design_scores_gemma":[0.0005262943,0.00008018614,0.00000458583,0.0001726931,0.000009777772,0.000003068828,0.0004810794,0.9875276,0.01091462,0.000002573403,0.00006559352,0.0002119217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1776766,0.00005733395,0.8206717,0.000005073858,0.000803038,0.0004516199,0.00000628122,0.0001870714,0.0001413583],"genre_scores_gemma":[0.9901372,0.00003803113,0.009534507,0.00002866931,0.00006377939,0.00006449437,0.000006441304,0.00005006094,0.00007683969],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8124606,"threshold_uncertainty_score":0.804989,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.009755353520571488,"gpt":0.2349810521049528,"spread":0.2252256985843813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003458213,0.0002779144,0.0003776886,0.0002770178,0.0003596992,0.00005427807,0.00009026401,0.0001188868,0.00002028943],"category_scores_gemma":[0.00000448357,0.0002465993,0.0001869145,0.0003451362,0.00004188831,0.0001288369,0.000005026325,0.0001923699,0.000003528203],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001296608,"about_ca_system_score_gemma":0.00001738136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003596395,"about_ca_topic_score_gemma":0.0000670434,"domain_scores_codex":[0.9985016,0.00004706351,0.0003616169,0.0004164739,0.0001843985,0.0004888417],"domain_scores_gemma":[0.9990507,0.0004338846,0.0000628851,0.000224697,0.00006414599,0.0001636336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009686783,0.00001337937,0.00003174422,0.00001987406,0.0004185111,0.000004723751,0.00009979235,0.9459402,0.01713509,0.00003000583,0.000004423309,0.03629256],"study_design_scores_gemma":[0.0007301011,0.00005615916,0.00003602922,0.0001011752,0.0005056186,0.00005417025,0.00002694898,0.9831747,0.01489504,0.0000863352,0.00003066178,0.0003031003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4583146,0.00007968117,0.5409345,0.000007961712,0.0002472325,0.0002237964,0.00001863602,0.0001658524,0.00000773918],"genre_scores_gemma":[0.9805529,0.00001252373,0.01917544,0.00003277275,0.0001119111,0.00002698179,0.000003323631,0.00006296686,0.00002113547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5222384,"threshold_uncertainty_score":0.9999986,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"National Natural Science Foundation of China","keywords":"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02346257707735367,"gpt":0.2888511330726301,"spread":0.2653885559952764,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0005756494,0.0003685187,0.0004401796,0.0003336547,0.001788742,0.000717368,0.0009899564,0.0001924802,0.000005446195],"category_scores_gemma":[0.00004311789,0.0004050098,0.0002169124,0.0003388251,0.0001006447,0.0004753152,0.00002185902,0.0004918987,0.00001957467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001882944,"about_ca_system_score_gemma":0.0001582675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000192386,"about_ca_topic_score_gemma":0.0002567735,"domain_scores_codex":[0.997364,0.00009919039,0.0006147756,0.0009238088,0.0003168775,0.000681318],"domain_scores_gemma":[0.997114,0.000445873,0.0003406796,0.001590929,0.0003485839,0.000159925],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002815684,0.0003899225,0.00002074794,0.0001097069,0.00004078171,0.00003356349,0.001826623,0.4163089,0.003865776,0.0006953287,0.0000438746,0.5766367],"study_design_scores_gemma":[0.001137207,0.0002709008,0.0001022894,0.0004248195,0.00002175375,0.00005964596,0.0004821762,0.9667752,0.02917874,0.0008073406,0.0002546532,0.0004852972],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2017986,0.00003607318,0.7954063,0.000136944,0.001426967,0.0008186185,0.00001695587,0.0003002205,0.00005934323],"genre_scores_gemma":[0.9568253,0.00001130626,0.04251064,0.0002087387,0.000182088,0.00007332097,0.000004954397,0.00005055214,0.0001330945],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7550268,"threshold_uncertainty_score":0.9998402,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02564544004550459,"gpt":0.2788105216645401,"spread":0.2531650816190355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000563504,0.0003441414,0.0003790908,0.0002849208,0.00046736,0.0004430433,0.0004219089,0.0002513293,0.00002131063],"category_scores_gemma":[0.000001482843,0.0003187277,0.000154668,0.0009795624,0.0001260359,0.0002895822,0.000008973611,0.0006737534,0.00000837035],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001797739,"about_ca_system_score_gemma":0.0001876204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001284426,"about_ca_topic_score_gemma":0.00001331473,"domain_scores_codex":[0.9976226,0.0001502142,0.0005199136,0.0008554462,0.0002592214,0.0005925741],"domain_scores_gemma":[0.9981558,0.001051214,0.00009178296,0.0004533336,0.0000926137,0.0001553079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005029851,0.00009531371,0.000004329886,0.00003958826,0.000041149,0.00004437537,0.001603354,0.6207801,0.0001086057,0.003653825,0.0001800422,0.373399],"study_design_scores_gemma":[0.0004795554,0.0005020621,0.000004519572,0.0007560809,0.00002986938,0.00005939085,0.0005575028,0.9955716,0.0001925495,0.0006021812,0.0008638689,0.0003808253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01566495,0.0001658066,0.9809897,0.0002166281,0.001082825,0.001134764,0.00001280448,0.0005228237,0.0002096819],"genre_scores_gemma":[0.9287472,0.00002766508,0.06990092,0.0005443621,0.0003182871,0.000301995,0.0000102612,0.00004522708,0.0001040793],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9130822,"threshold_uncertainty_score":0.9999265,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02912644320797005,"gpt":0.2995773100000774,"spread":0.2704508667921074,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008026164,0.0003498989,0.0003336344,0.000598254,0.0005020878,0.0005755826,0.0008459395,0.0001794851,0.000005907051],"category_scores_gemma":[0.0000258131,0.0003910242,0.00008698919,0.001492048,0.00009947527,0.001298138,0.00006319991,0.00096526,0.0000193979],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002445888,"about_ca_system_score_gemma":0.0001596676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001685424,"about_ca_topic_score_gemma":0.000168971,"domain_scores_codex":[0.9970364,0.0002869255,0.0005177187,0.001143069,0.000380361,0.0006355492],"domain_scores_gemma":[0.9980529,0.0007405056,0.0000992418,0.0008209965,0.00008310599,0.0002032671],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001686322,0.0006679016,0.00002870923,0.0001601194,0.00004754072,0.00002955432,0.05327829,0.7479234,0.001414659,0.0208437,0.0000404152,0.1755488],"study_design_scores_gemma":[0.0003618356,0.0001210037,0.0001298148,0.0002794228,0.00001704774,0.00003372967,0.001758475,0.9947116,0.001430773,0.0005829815,0.0001797397,0.0003935676],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2417116,0.0002188363,0.7562356,0.00007166824,0.0003759599,0.0004391364,0.00004963873,0.0005854545,0.0003121154],"genre_scores_gemma":[0.9838015,0.00002550236,0.01582016,0.0001166394,0.0001079061,0.0000398207,0.00003419103,0.00003346036,0.00002079754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7420899,"threshold_uncertainty_score":0.9998541,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03409540344574342,"gpt":0.2798092778000625,"spread":0.2457138743543191,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005949195,0.0001979711,0.0001887783,0.0002228389,0.0004849896,0.0001303104,0.0003815515,0.00007806368,0.00001879936],"category_scores_gemma":[0.000005629412,0.0001911564,0.00004466467,0.001105917,0.00005199519,0.0006161293,0.0000104343,0.0004399121,0.00002047186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000129898,"about_ca_system_score_gemma":0.00004666154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007797296,"about_ca_topic_score_gemma":0.00003091623,"domain_scores_codex":[0.9984835,0.0002800884,0.0003026676,0.0003338516,0.0001837183,0.000416176],"domain_scores_gemma":[0.9989061,0.0003472945,0.00009732373,0.0004165133,0.00011611,0.0001166917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003111131,0.0002855175,0.0001005565,0.000004819292,0.00001997425,0.000001095358,0.002621807,0.8474497,0.0001281971,0.0009894405,0.00005278861,0.148315],"study_design_scores_gemma":[0.0007918741,0.0001920327,0.0006231126,0.000224202,0.0000107097,0.00002234964,0.0002101624,0.9922444,0.004740575,0.000005885643,0.0006355571,0.0002991775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.027211,0.0004258467,0.9703936,0.0001801346,0.0002852274,0.0005001595,7.932974e-7,0.0002443952,0.0007588246],"genre_scores_gemma":[0.9959715,0.0001349612,0.003200466,0.0003030803,0.000107744,0.0001031297,0.00000715219,0.00001930361,0.0001526541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9687605,"threshold_uncertainty_score":0.779513,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01314218950799188,"gpt":0.2428662495530611,"spread":0.2297240600450693,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000620451,0.0004262962,0.0004728349,0.0003718615,0.0002760239,0.0001055989,0.0005128145,0.0002929893,0.0001492859],"category_scores_gemma":[0.00003293326,0.0004164698,0.0002270306,0.0006266805,0.00004393344,0.0002726662,0.00001176634,0.0008472336,0.0001879859],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084552,"about_ca_system_score_gemma":0.0000409083,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001304772,"about_ca_topic_score_gemma":0.0006156886,"domain_scores_codex":[0.9973901,0.0001816055,0.0008798923,0.0004783745,0.0002985517,0.0007714901],"domain_scores_gemma":[0.9972891,0.001430715,0.0001807234,0.0008191172,0.0001268867,0.0001534996],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001487069,0.0001621879,0.0002057252,0.00002183177,0.00008616781,0.00000484444,0.0005235271,0.9436431,0.03409021,0.00001109678,0.00004091177,0.02119554],"study_design_scores_gemma":[0.002080403,0.00003934664,0.0004539607,0.0004089388,0.00003914346,0.000005404876,0.000120586,0.9898333,0.006258319,0.000004807959,0.0002593395,0.0004964671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4790397,0.0001340446,0.5192731,0.00005481974,0.0005732088,0.0003838903,0.00001001165,0.0005167158,0.00001444515],"genre_scores_gemma":[0.9875851,0.0002107356,0.0113936,0.00006033294,0.000121327,0.0002070932,0.00001322209,0.0001401142,0.0002685212],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5085453,"threshold_uncertainty_score":0.9998287,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}