{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":175,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":175,"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":"848cf6913ec5","filters":{"topic":"Age of Information Optimization"}},"results":[{"id":"W4205984110","doi":"10.1561/1300000060","title":"Age of Information: A New Concept, Metric, and Tool","year":2017,"lang":"en","type":"article","venue":"Foundations and Trends® in Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":643,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Engineering Link (Canada)","funders":"","keywords":"Metric (unit); Computer science; Data science; Engineering; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.02380038762524058,"gpt":0.2725903291630559,"spread":0.2487899415378153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001612038,0.00006760204,0.0001032714,0.0003002511,0.0003094227,0.0006438415,0.0002346002,0.00003568345,0.00001920712],"category_scores_gemma":[0.00004589876,0.00006749618,0.00001576768,0.0003180921,0.00006067701,0.003263775,0.0001695768,0.00005696026,0.000002149846],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001581534,"about_ca_system_score_gemma":0.00002062549,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000886096,"about_ca_topic_score_gemma":0.00004727254,"domain_scores_codex":[0.9994124,0.00001185476,0.0002781301,0.000085068,0.0001085535,0.0001039753],"domain_scores_gemma":[0.9993273,0.00004797493,0.0002704525,0.0002750494,0.00004235792,0.00003687114],"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.000001685108,0.000004722588,0.002210394,0.000004572946,0.00000627351,8.894033e-7,0.001478407,0.002390177,3.754708e-7,0.0835145,0.0003841769,0.9100038],"study_design_scores_gemma":[0.001794697,0.00006840642,0.225875,0.0001144227,0.0000132367,0.00002210058,0.0001091887,0.6906187,0.00001444425,0.005291645,0.07575927,0.0003189448],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00241501,0.0001628229,0.9701391,0.0006529158,0.0003216817,0.00009151618,0.000001823257,0.00003778587,0.02617727],"genre_scores_gemma":[0.9311343,0.00009010534,0.0683164,0.00007354347,0.00006890461,0.000004431841,0.00003859751,0.000002302756,0.0002713854],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9287193,"threshold_uncertainty_score":0.6208578,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2809579289","doi":"10.1145/3209582.3209602","title":"Age-based Scheduling","year":2018,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":132,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Scheduling (production processes); Dynamic priority scheduling; Distributed computing; Maximum throughput scheduling; Information Age; Fair-share scheduling; Performance metric; Wireless ad hoc network; Earliest deadline first scheduling; Computer network; Real-time computing; Rate-monotonic scheduling; Round-robin scheduling; Wireless; Mathematical optimization; Quality of service","retraction":null,"screen_n_in":null,"score":{"opus":0.01489295798279774,"gpt":0.2397648447921899,"spread":0.2248718868093922,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009183265,0.00003274584,0.000026786,0.00005097944,0.00006804584,0.000113534,0.0002707226,0.00001742081,0.000131932],"category_scores_gemma":[0.00002676465,0.0000283366,0.00001173986,0.0001819968,0.00002232108,0.0006022065,0.00004362063,0.00001986478,0.0006704302],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001171278,"about_ca_system_score_gemma":0.00002966066,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002359577,"about_ca_topic_score_gemma":0.000001380235,"domain_scores_codex":[0.999666,0.000006426547,0.00008384581,0.0000683672,0.00009932317,0.00007598101],"domain_scores_gemma":[0.9996429,0.00001179485,0.00002845459,0.0002008616,0.00008849458,0.00002751241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000560907,0.00004798642,0.0003374984,0.00001252866,0.000009213267,0.000008087733,0.001484413,0.07432994,0.0005013807,0.8203905,0.009092141,0.09378072],"study_design_scores_gemma":[0.0000957896,0.00002075896,0.0001282169,0.000002772599,2.606228e-7,7.210286e-7,0.000005680278,0.991649,0.005500817,0.0003456059,0.002204215,0.00004619347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008692995,0.000001085759,0.9152042,0.0006149001,0.0001178193,0.00003043052,3.472345e-8,0.000222236,0.08293997],"genre_scores_gemma":[0.3413991,1.172232e-7,0.6568108,0.001405568,0.00003213441,0.000001079901,8.240275e-7,0.000001224776,0.0003491335],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.917319,"threshold_uncertainty_score":0.8617248,"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":"W3115760506","doi":"10.1109/tii.2020.3046028","title":"When Information Freshness Meets Service Latency in Federated Learning: A Task-Aware Incentive Scheme for Smart Industries","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Age of Information Optimization","field":"Computer Science","cited_by":78,"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 British Columbia","funders":"Ministry of Education, India; National Research Foundation Singapore; Israel Science Foundation; Nanyang Technological University; Ministry of Education - Singapore; National Research Foundation","keywords":"Computer science; Incentive; Latency (audio); Incentive compatibility; Task (project management); Flexibility (engineering); Service (business); Scheme (mathematics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04652460839753812,"gpt":0.2402356073179888,"spread":0.1937109989204507,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000396865,0.0003433901,0.0003669993,0.0004750939,0.0004843091,0.0007408432,0.0006787388,0.0005319173,0.00005527358],"category_scores_gemma":[0.0001713853,0.0003596154,0.00008742401,0.001848727,0.00004373698,0.009301973,0.00001878619,0.001018015,0.0001907857],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002452231,"about_ca_system_score_gemma":0.0005494242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008784595,"about_ca_topic_score_gemma":0.00003343062,"domain_scores_codex":[0.9972877,0.00008748371,0.001456906,0.0001764038,0.0005481825,0.0004433387],"domain_scores_gemma":[0.9979476,0.0001937014,0.0006553415,0.0002646066,0.0007143003,0.0002244587],"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.0005540274,0.0001955773,0.0001423685,0.0002732481,0.0001405357,0.000002277603,0.05568799,0.8590131,0.00003329864,0.001186107,0.008680127,0.07409132],"study_design_scores_gemma":[0.003591129,0.0003241733,0.00001282235,0.0001216898,0.00001756974,0.000003380802,0.003336356,0.9731821,0.003975717,0.000046821,0.01495353,0.0004346835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007002531,0.000002082229,0.9845547,0.005278417,0.0006277062,0.001328706,0.00008190766,0.000416421,0.0007075067],"genre_scores_gemma":[0.9636804,0.00002060475,0.03035327,0.005015004,0.0001207458,0.0003519715,0.0003126563,0.00003248623,0.0001128395],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9566779,"threshold_uncertainty_score":0.9998856,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3133575899","doi":"10.1109/tvt.2021.3062653","title":"Adaptive Computing Scheduling for Edge-Assisted Autonomous Driving","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":77,"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; Edge computing; Scheduling (production processes); Distributed computing; Job shop scheduling; Reinforcement learning; Real-time computing; Obstacle; Latency (audio); Dynamic priority scheduling; Enhanced Data Rates for GSM Evolution; Embedded system; Computer network; Mathematical optimization; Artificial intelligence; Quality of service","retraction":null,"screen_n_in":null,"score":{"opus":0.01446231607591557,"gpt":0.2393482040029253,"spread":0.2248858879270098,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001727802,0.0001786151,0.0002184583,0.0004581906,0.0004839397,0.0001102572,0.0004867455,0.0002801925,0.00001128168],"category_scores_gemma":[0.00003646098,0.0002042936,0.0001336556,0.001072839,0.00006943085,0.0004662839,0.00001114296,0.0003363306,0.00004069174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001643664,"about_ca_system_score_gemma":0.0001706655,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001724876,"about_ca_topic_score_gemma":0.000008244432,"domain_scores_codex":[0.9986741,0.00003837491,0.0003723753,0.000418617,0.0001691456,0.0003273784],"domain_scores_gemma":[0.9986945,0.0001159319,0.0001554049,0.0005706347,0.0004073867,0.00005616964],"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.000005825399,0.0001385193,0.000005113965,0.00001724487,0.00008326499,0.00002542337,0.0002738239,0.7471544,0.003301243,0.01430376,0.00002671131,0.2346646],"study_design_scores_gemma":[0.0004847037,0.00009696164,0.00002050438,0.00005325271,0.00001729935,0.0001267296,0.0002153641,0.8956797,0.1021377,0.0005276693,0.0004320011,0.0002080618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008201372,0.00004816809,0.9877279,0.001917713,0.0005568576,0.0002780716,0.00000340311,0.001064808,0.0002017028],"genre_scores_gemma":[0.5689675,0.000005586096,0.4307442,0.000149014,0.00001289562,0.00003657496,0.0000029484,0.00001180705,0.00006941362],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5607662,"threshold_uncertainty_score":0.833085,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4368232611","doi":"10.1109/tvt.2023.3271613","title":"Task Offloading and Resource Allocation in Vehicular Networks: A Lyapunov-Based Deep Reinforcement Learning Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lyapunov optimization; Computer science; Energy consumption; Reinforcement learning; Server; Resource allocation; Queueing theory; Mobile edge computing; Distributed computing; Queuing delay; Queue; Edge computing; Task (project management); Computer network; Enhanced Data Rates for GSM Evolution; Engineering; Artificial intelligence; Lyapunov exponent","retraction":null,"screen_n_in":null,"score":{"opus":0.00823544509153541,"gpt":0.208225010654135,"spread":0.1999895655625996,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040331,0.0002062252,0.0002077191,0.001487276,0.000315248,0.00009302944,0.0004304882,0.0003284416,0.000004402067],"category_scores_gemma":[0.00002491858,0.0002241169,0.0000581363,0.002763902,0.00009457201,0.0004510926,0.00001305686,0.0005636957,0.00003518401],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001530585,"about_ca_system_score_gemma":0.00004195961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009862314,"about_ca_topic_score_gemma":0.00000605428,"domain_scores_codex":[0.9983841,0.00008784468,0.0004225503,0.0004298064,0.0002851961,0.0003904614],"domain_scores_gemma":[0.9991609,0.00006597215,0.0001452689,0.0004879136,0.00008034637,0.00005961924],"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.000008602453,0.00003278782,0.00002819357,0.00001834519,0.000015627,0.000009708239,0.0002421755,0.9771981,0.0003696021,0.001407518,0.00001564195,0.02065368],"study_design_scores_gemma":[0.0006401262,0.0001102225,0.00003999818,0.00004899498,0.000009959289,0.00001878015,0.0002020635,0.9950144,0.002884055,0.00007551489,0.0007405372,0.000215377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01129609,0.00005015312,0.98564,0.001176074,0.00008304813,0.0004106003,2.80429e-7,0.001138717,0.0002049864],"genre_scores_gemma":[0.9789053,0.00005998303,0.02049248,0.0002075782,0.000009509077,0.0001992597,0.00002580493,0.00002077007,0.0000793356],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9676092,"threshold_uncertainty_score":0.9139222,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3170007158","doi":"10.1109/tcomm.2021.3086535","title":"Caching Transient Content for IoT Sensing: Multi-Agent Soft Actor-Critic","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":69,"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; Science, Technology and Innovation Commission of Shenzhen Municipality; National Natural Science Foundation of China; Fundamental Research Funds for the Central Universities; National Science Foundation","keywords":"Cache; Computer science; Upload; Cloud computing; Markov decision process; Reinforcement learning; Distributed computing; Computer network; Smart Cache; Enhanced Data Rates for GSM Evolution; Cache algorithms; Real-time computing; Markov process; CPU cache; Telecommunications; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1064839323359109,"gpt":0.3054570176877371,"spread":0.1989730853518262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506833,0.0001872356,0.0001903538,0.0001785834,0.001034555,0.0002292899,0.0009718205,0.00009171113,0.00002050168],"category_scores_gemma":[0.00004504271,0.0002090163,0.0002078856,0.0004364205,0.0000846796,0.0005451607,0.00001316106,0.0003130138,0.00004894088],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001943117,"about_ca_system_score_gemma":0.0002572431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000293852,"about_ca_topic_score_gemma":0.0002544216,"domain_scores_codex":[0.9985186,0.0001711526,0.0005050089,0.000285373,0.0002448238,0.0002750559],"domain_scores_gemma":[0.9965877,0.0004980516,0.0001177437,0.002072678,0.0005892059,0.0001346036],"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.00003069311,0.0020766,0.000004880621,0.0001098451,0.0002849037,0.000007701193,0.0115559,0.7546909,0.01246537,0.01681707,0.0008450946,0.201111],"study_design_scores_gemma":[0.0009330651,0.00005318596,0.00005247482,0.00006767843,0.00004297613,0.00003800518,0.000475257,0.9753634,0.01499325,0.0001193961,0.00758735,0.0002739223],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002763462,0.0001135863,0.9882828,0.009469704,0.0005690261,0.0004776995,0.00004910167,0.0003102539,0.0004514675],"genre_scores_gemma":[0.5671532,0.0001036563,0.4312495,0.000742822,0.00001071898,0.00007523561,0.00002849594,0.00001727879,0.0006190276],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5668769,"threshold_uncertainty_score":0.8523439,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2902838298","doi":"10.1109/wcsp.2018.8555643","title":"Towards Fresh and Low-Latency Content Delivery in Vehicular Networks: An Edge Caching Aspect","year":2018,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Latency (audio); Computer network; Exploit; Content delivery; Quality of service; Enhanced Data Rates for GSM Evolution; Telecommunications; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0184430772922149,"gpt":0.224350987180318,"spread":0.2059079098881031,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003185216,0.00009449269,0.00009893509,0.0001083765,0.00009991181,0.0001990721,0.0003150612,0.0000577703,0.00003872947],"category_scores_gemma":[0.00002864475,0.00008196598,0.00001750306,0.0002169959,0.00004232454,0.002052434,0.0001723613,0.0000867795,0.00002011125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004810245,"about_ca_system_score_gemma":0.00004028996,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002916937,"about_ca_topic_score_gemma":0.0001987492,"domain_scores_codex":[0.9991931,0.00004426429,0.0002355505,0.0001925439,0.0001488464,0.000185743],"domain_scores_gemma":[0.9994435,0.00001628944,0.00006344783,0.00026393,0.0001349516,0.00007786272],"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.00006331979,0.0003531457,0.02418215,0.00006585769,0.00007034781,0.0001154524,0.01818441,0.4373329,0.0007473257,0.1807161,0.004143792,0.3340251],"study_design_scores_gemma":[0.0002787769,0.00008371646,0.01346441,0.00002213503,0.000001265943,0.000008480543,0.0001049159,0.9853958,0.0002798188,0.0001880046,0.00005393996,0.0001187539],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2435464,0.00005907667,0.7509833,0.0001764685,0.0001694805,0.0001153941,2.380532e-7,0.0001009225,0.004848686],"genre_scores_gemma":[0.9541497,0.000031466,0.04493647,0.0007344793,0.00008034972,0.000003968766,0.000004283459,0.000004754871,0.00005449044],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7106033,"threshold_uncertainty_score":0.3342476,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3089314236","doi":"10.1109/tmc.2020.3025201","title":"Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"National Key Research and Development Program of China; Beijing Municipal Natural Science Foundation","keywords":"Computer science; Cache; Latency (audio); Content delivery; Computer network; Information-centric networking; Bandwidth (computing); Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01258535920928534,"gpt":0.2051456115196187,"spread":0.1925602523103334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001888323,0.0001552563,0.0001646213,0.0002040629,0.000204931,0.0002279047,0.0002934825,0.00008630605,0.00001266106],"category_scores_gemma":[0.0000126859,0.0001560707,0.00004966408,0.000738514,0.00002439132,0.001748942,0.00001179362,0.0002955395,0.00003791032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006780567,"about_ca_system_score_gemma":0.00004133232,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001343284,"about_ca_topic_score_gemma":0.000001929266,"domain_scores_codex":[0.9987206,0.00005280269,0.0005264312,0.0002173321,0.0002432987,0.0002395597],"domain_scores_gemma":[0.9993216,0.00008928403,0.0001627782,0.0001984173,0.0001003535,0.0001276124],"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.000007514798,0.00003250404,0.00004945684,0.00002385293,0.000004894202,0.00000249191,0.00157415,0.8900344,0.00001667385,0.0001342312,0.00002944876,0.1080904],"study_design_scores_gemma":[0.0006755207,0.0001316685,0.0002973716,0.00006705515,0.000003346919,0.000006728675,0.0001690842,0.9975749,0.0007968472,0.000008342514,0.0001091086,0.0001600758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04542158,0.00004026815,0.9530205,0.0003763948,0.0002736016,0.0005553384,0.00000171076,0.0002089793,0.0001016365],"genre_scores_gemma":[0.983179,0.0000528976,0.0157751,0.0009305285,0.00002509537,0.00002148811,0.000004929617,0.00000704874,0.000003859365],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9377575,"threshold_uncertainty_score":0.6364377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101422709","doi":"10.1109/tii.2020.3037299","title":"Age-of-Information Aware Scheduling for Edge-Assisted Industrial Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Industrial Informatics","topic":"Age of Information Optimization","field":"Computer Science","cited_by":60,"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":"Program of Shanghai Academic Research Leader; China Scholarship Council; National Natural Science Foundation of China","keywords":"Computer science; Reinforcement learning; Scheduling (production processes); Wireless; Distributed computing; Job shop scheduling; Wireless network; Optimization problem; Computer network; Mathematical optimization; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07284640101408263,"gpt":0.2580350642120997,"spread":0.185188663198017,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004557597,0.0003087119,0.000427465,0.0003601491,0.0003593852,0.00041157,0.000855597,0.0005899677,0.00002582011],"category_scores_gemma":[0.0001039266,0.000317605,0.0002247215,0.001262459,0.00007601832,0.005081365,0.00001265726,0.0007190306,0.00004351937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001901889,"about_ca_system_score_gemma":0.0003613734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001236149,"about_ca_topic_score_gemma":0.000001514064,"domain_scores_codex":[0.9970877,0.00005685318,0.001778453,0.000142352,0.0005456349,0.0003890012],"domain_scores_gemma":[0.9976583,0.0002805446,0.0009394207,0.0004221796,0.0004392814,0.0002603242],"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.0001807782,0.00004711164,0.000003198833,0.00005817762,0.00006815648,4.702944e-7,0.002783929,0.8445751,0.000009258831,0.00122361,0.00156389,0.1494863],"study_design_scores_gemma":[0.003311408,0.0003885876,0.000001547126,0.0001001697,0.00004257855,0.000005155013,0.001098063,0.9880748,0.003683605,0.00001694381,0.00294916,0.0003280216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001570729,0.000001870942,0.9936171,0.0006861364,0.001991851,0.001156411,0.00008224582,0.0003361753,0.0005574468],"genre_scores_gemma":[0.9024249,0.0000217732,0.09506385,0.001545458,0.0004952919,0.0001568169,0.0002298113,0.00002875381,0.00003332835],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9008542,"threshold_uncertainty_score":0.9999276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226408066","doi":"10.1109/tits.2022.3167485","title":"Data Freshness Optimization Under CAA in the UAV-Aided MECN: A Potential Game Perspective","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Brandon University","funders":"","keywords":"Computer science; Correctness; Edge computing; Minification; Channel (broadcasting); Enhanced Data Rates for GSM Evolution; Access control; Stackelberg competition; Mobile edge computing; Computation; Domain (mathematical analysis); Game theory; Distributed computing; Computer network; Mathematical optimization; Real-time computing; Server; Artificial intelligence; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03980238100395153,"gpt":0.2721762052651985,"spread":0.232373824261247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009426619,0.0002557894,0.0002381366,0.0005551303,0.0005279719,0.0002968087,0.001828665,0.00008385382,0.0002177242],"category_scores_gemma":[0.000005715225,0.0002347576,0.000108247,0.001490615,0.00004699354,0.001723752,0.000004635792,0.0004744008,0.00003302431],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004135215,"about_ca_system_score_gemma":0.0001793277,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004893149,"about_ca_topic_score_gemma":0.0003001736,"domain_scores_codex":[0.9966482,0.0004355774,0.0008960289,0.0005980544,0.001125564,0.0002965846],"domain_scores_gemma":[0.9980771,0.0001410429,0.0003084574,0.001132979,0.0002703689,0.00007006001],"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.00004412923,0.0002175007,0.000004420695,0.00001657892,0.00003963344,0.00001419297,0.01061012,0.9789606,0.00001419137,0.009484818,0.0001690526,0.000424805],"study_design_scores_gemma":[0.0005099312,0.0001114859,0.00008768091,0.00002554513,0.00003552195,0.00004021877,0.02482335,0.9732283,0.000187111,0.0001488829,0.0005284757,0.0002735404],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0008986709,0.00007742809,0.9941983,0.0009312477,0.001801634,0.001123724,0.0004973293,0.0002025778,0.0002690392],"genre_scores_gemma":[0.994278,0.00005875926,0.004171078,0.0003939408,0.00004083299,0.0004437584,0.0004079188,0.00002537004,0.0001803029],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9933794,"threshold_uncertainty_score":0.9573135,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3113239520","doi":"10.1109/twc.2020.3022895","title":"Age of Information Driven Cache Content Update Scheduling for Dynamic Contents in Heterogeneous Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":54,"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; Cache; Scheduling (production processes); Markov decision process; Reinforcement learning; Distributed computing; Performance metric; Queue; Dynamic web page; Computer network; Markov process; Artificial intelligence; Mathematical optimization; Web service","retraction":null,"screen_n_in":null,"score":{"opus":0.04134386294706945,"gpt":0.2586858165439218,"spread":0.2173419535968523,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001538712,0.0001575727,0.0002405887,0.0002256982,0.0002313801,0.0001011373,0.001418228,0.000106248,0.000004014641],"category_scores_gemma":[0.00001994359,0.0001748598,0.0001202597,0.0005602931,0.00008927394,0.001452463,0.00002224408,0.00027452,0.00001628282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001130438,"about_ca_system_score_gemma":0.00005326291,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002868499,"about_ca_topic_score_gemma":0.0001056532,"domain_scores_codex":[0.9986008,0.00009844868,0.0007568366,0.0001525417,0.000188112,0.000203242],"domain_scores_gemma":[0.9981756,0.0001866285,0.000324456,0.0009407047,0.0002758038,0.00009684135],"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.00002991315,0.00009254686,0.00001314234,0.00002492853,0.00003094965,3.275951e-7,0.001581582,0.9770046,0.0003181835,0.00217794,0.000005836534,0.01872001],"study_design_scores_gemma":[0.0009174257,0.00008072179,0.00005768125,0.00005693799,0.0000126692,0.000002481957,0.0001862182,0.996514,0.001827763,0.00003429016,0.0001563647,0.0001534454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008113962,0.00003936788,0.9880511,0.002683444,0.000130258,0.0007349313,0.00004498648,0.0001374235,0.00006448908],"genre_scores_gemma":[0.889948,0.0002962995,0.1086524,0.0007794135,0.000003738578,0.0001861975,0.0001176308,0.00001087207,0.000005452159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8818341,"threshold_uncertainty_score":0.7130576,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3000547285","doi":"10.1109/twc.2019.2962798","title":"Hierarchical Soft Slicing to Meet Multi-Dimensional QoS Demand in Cache-Enabled Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":52,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Slicing; Computer science; Quality of service; Computer network; Throughput; Cache; Bandwidth (computing); Multiplexing; Service (business); Exploit; Statistical time division multiplexing; Context (archaeology); Distributed computing; Wireless; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02665578270445505,"gpt":0.2566990754814949,"spread":0.2300432927770399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003169564,0.000220609,0.0002593202,0.0002888574,0.0005800558,0.0001524035,0.001755437,0.000143529,0.00001899025],"category_scores_gemma":[0.00002625391,0.0002394661,0.0001004094,0.001349209,0.00008615051,0.0007961572,0.00005213435,0.0005523346,0.00007039715],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001365424,"about_ca_system_score_gemma":0.0001228038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005934114,"about_ca_topic_score_gemma":0.000301632,"domain_scores_codex":[0.9981079,0.0002896586,0.0005915006,0.0003538209,0.0003243072,0.0003328363],"domain_scores_gemma":[0.9976879,0.0003692358,0.0001173248,0.00138938,0.000140716,0.0002954689],"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.00001726229,0.0001927258,0.00002607895,0.000007350006,0.00002062132,0.00000255116,0.002438607,0.9897585,0.000234804,0.002465557,0.0001808651,0.004655064],"study_design_scores_gemma":[0.000703039,0.00005993931,0.0002393423,0.00006224408,0.00001034178,0.000005403027,0.00005824779,0.9975228,0.0007758174,0.0000368458,0.0002772961,0.0002487083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005983968,0.00004042904,0.9772358,0.01559485,0.0001578487,0.0005212229,0.000008165021,0.0002905189,0.0001671939],"genre_scores_gemma":[0.8596118,0.00003961578,0.1370141,0.00310086,0.00002209909,0.000153255,0.00001272397,0.00002026279,0.00002526929],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8536279,"threshold_uncertainty_score":0.9765144,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4321608472","doi":"10.1109/jiot.2023.3244424","title":"Digital Twin Placement for Minimum Application Request Delay With Data Age Targets","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Latency (audio); Cloud computing; Algorithm; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.02443733446414848,"gpt":0.2695016408801286,"spread":0.2450643064159801,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000627787,0.0001099544,0.000131599,0.0001869852,0.00006426153,0.0004667081,0.001537313,0.00004281798,0.000005929686],"category_scores_gemma":[0.00008173119,0.00009010512,0.00003756033,0.0002127409,0.00003374047,0.004258256,0.0002322537,0.0001341481,0.00003719034],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006281151,"about_ca_system_score_gemma":0.00006311995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004372177,"about_ca_topic_score_gemma":0.000001219953,"domain_scores_codex":[0.9987654,0.00001360447,0.0004539582,0.0001957913,0.0003815994,0.0001896209],"domain_scores_gemma":[0.9986575,0.00007356501,0.0005216427,0.0004438896,0.0002262546,0.00007714467],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008759628,0.0005281156,0.001411177,0.0004221455,0.000781843,0.000254024,0.03710822,0.1616772,0.004768104,0.01276648,0.5573772,0.2220295],"study_design_scores_gemma":[0.0006067557,0.0002447287,0.00004367398,0.00009826026,0.000008743091,0.0001685396,0.0001051727,0.9834852,0.002478069,0.0005399798,0.01207345,0.0001473813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004685638,0.00001123302,0.9927527,0.0005672452,0.0003319398,0.0002237778,0.00001263334,0.00009570909,0.001319147],"genre_scores_gemma":[0.7457226,0.00001981818,0.2512677,0.0004156312,0.0001866471,0.00002502684,0.0002310295,0.00002462502,0.002106962],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.821808,"threshold_uncertainty_score":0.4500477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3107053738","doi":"10.1109/jiot.2020.3041287","title":"AoI-Aware Co-Design of Cooperative Transmission and State Estimation for Marine IoT Systems","year":2020,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":37,"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":"Dalian Science and Technology Innovation Fund; Program of Shanghai Academic Research Leader; National Key Research and Development Program of China; National Natural Science Foundation of China; Natural Science Foundation of Shanghai","keywords":"Computer science; Transmission (telecommunications); Path loss; Real-time computing; Network packet; Packet loss; Transmission delay; Estimation; Transmission loss; Channel state information; Minification; Computer network; Wireless; Telecommunications; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02389606884763176,"gpt":0.2579933767222226,"spread":0.2340973078745908,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004274763,0.00009593188,0.0001977063,0.00009037199,0.00004554549,0.0001486943,0.0003202297,0.00003947094,0.00001176946],"category_scores_gemma":[0.00006998614,0.00007983515,0.00003868433,0.00009358255,0.00003159545,0.0008332285,0.00003201223,0.0001223707,0.000001479941],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002855693,"about_ca_system_score_gemma":0.000064265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001281621,"about_ca_topic_score_gemma":5.063665e-8,"domain_scores_codex":[0.9989522,0.00006164034,0.0005478804,0.0001024599,0.0002412534,0.00009455664],"domain_scores_gemma":[0.9987726,0.00009883152,0.0005660507,0.00006738925,0.0004010736,0.00009402499],"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.0002056338,0.00002757058,0.00002957315,0.0002559623,0.00006105402,0.000003782834,0.02401832,0.9393941,0.004165977,0.0006755715,0.003223133,0.02793939],"study_design_scores_gemma":[0.0005677272,0.0004757482,0.00001280001,0.000171286,0.000007068311,0.00005699816,0.00008490762,0.9679797,0.03029128,0.000205605,0.00007301194,0.00007391861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005840485,0.0000316365,0.9930636,0.0005603721,0.0001442883,0.0002605615,0.000002858485,0.0000236916,0.0000725253],"genre_scores_gemma":[0.7452313,0.00002508395,0.2544602,0.0001737637,0.0000211654,0.00000369491,0.000002900425,0.000007522929,0.00007438802],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7393909,"threshold_uncertainty_score":0.3255583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3208711628","doi":"10.1109/tits.2021.3119961","title":"Optimizing Information Freshness for MEC-Enabled Cooperative Autonomous Driving","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University; Concordia University","funders":"","keywords":"Computer science; Schedule; Edge computing; Enhanced Data Rates for GSM Evolution; Scalability; Heuristic; Context (archaeology); Metric (unit); Distributed computing; Mathematical optimization; Engineering; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01708750433916642,"gpt":0.2413444794325863,"spread":0.2242569750934199,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003667135,0.0002938539,0.0003280383,0.0003880201,0.0005187978,0.0006564824,0.000392343,0.000173706,0.00007233544],"category_scores_gemma":[0.0000177292,0.0003131402,0.0001968557,0.0008028866,0.00003089674,0.00417812,9.762646e-7,0.0002078238,0.0001100949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002398372,"about_ca_system_score_gemma":0.0003119839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003248217,"about_ca_topic_score_gemma":0.00006298497,"domain_scores_codex":[0.9975447,0.00009130515,0.001168784,0.0003645426,0.0004891267,0.0003415419],"domain_scores_gemma":[0.9974756,0.0002198558,0.0003559585,0.0004737554,0.001327856,0.0001469264],"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.00002235461,0.00007671316,0.000004527491,0.0001066437,0.00007526929,0.000003423043,0.006686012,0.974689,0.0002320748,0.01215152,0.0001511137,0.005801365],"study_design_scores_gemma":[0.0008357703,0.0001292277,0.0000340258,0.0001878515,0.00004647122,0.00001826158,0.002704879,0.8914315,0.09681281,0.0000542645,0.007276392,0.0004686246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001094108,0.00004830062,0.9940582,0.0002346856,0.002416156,0.001050422,0.0001018432,0.0004521145,0.0005441831],"genre_scores_gemma":[0.9294078,0.00008333525,0.06854711,0.0002446113,0.00004889535,0.0006714987,0.000269596,0.00002735619,0.0006998003],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9283137,"threshold_uncertainty_score":0.9999321,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4383199388","doi":"10.1109/jsac.2023.3282543","title":"Guest Editorial xURLLC in 6G: Next Generation Ultra-Reliable and Low-Latency Communications","year":2023,"lang":"en","type":"editorial","venue":"IEEE Journal on Selected Areas in Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada)","funders":"","keywords":"Computer science; Low latency (capital markets); Performance indicator; Telecommunications; Efficient energy use; Reliability (semiconductor); Computer network; Power (physics); Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03783894875347228,"gpt":0.2957146563548993,"spread":0.257875707601427,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.002059125,0.0004983124,0.0006135016,0.001625739,0.0009908973,0.001379403,0.006353099,0.001073678,0.000006478112],"category_scores_gemma":[0.003257491,0.0005389627,0.0001037486,0.003156454,0.0002046751,0.002627116,0.0005140782,0.004627672,0.0001172989],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001002137,"about_ca_system_score_gemma":0.001583756,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002305472,"about_ca_topic_score_gemma":0.001446967,"domain_scores_codex":[0.9950043,0.0008176044,0.001862652,0.0004822883,0.001248396,0.0005847926],"domain_scores_gemma":[0.9891981,0.003079914,0.001234134,0.0041416,0.002110303,0.0002359046],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000161256,0.0002951554,0.00004964882,0.00002189624,0.00003533311,0.000004986213,0.001074617,0.005060191,0.0001759377,0.0006890677,0.9919304,0.000646611],"study_design_scores_gemma":[0.002430986,0.0002701371,0.0002059088,0.001372208,0.00004558429,0.00003437203,0.0001445013,0.2625667,0.0001143569,0.0008261057,0.7308905,0.001098603],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.0001440017,0.0005467879,0.005148904,0.002704587,0.9889109,0.0006477927,0.00005969639,0.0003051984,0.001532187],"genre_scores_gemma":[0.004910908,0.03589275,0.02975092,0.000156654,0.9264404,0.0003178266,0.002060611,0.0001373716,0.0003325924],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.2610399,"threshold_uncertainty_score":0.9997062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285277227","doi":"10.1109/twc.2022.3176874","title":"Age-Critical and Secure Blockchain Sharding Scheme for Satellite-Based Internet of Things","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Shenzhen Science and Technology Innovation Program; Science and Technology Planning Project of Guangdong Province; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Scalability; Computer science; Scheme (mathematics); Internet of Things; Block (permutation group theory); The Internet; Retransmission; Blockchain; Theoretical computer science; Metric (unit); Algorithm; Throughput; Notation; Computer network; Computer security; Mathematics; World Wide Web; Database; Wireless; Telecommunications; Combinatorics; Arithmetic; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02638762672298191,"gpt":0.2708400054447694,"spread":0.2444523787217875,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003822778,0.0001215056,0.0001637429,0.0002606613,0.0006557204,0.00008650345,0.001216682,0.00004911932,0.00002902041],"category_scores_gemma":[0.00002078696,0.000141652,0.00009222775,0.000421812,0.0001585329,0.0003720288,0.00003825009,0.0003202107,0.000002484781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008667992,"about_ca_system_score_gemma":0.00007505647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002069652,"about_ca_topic_score_gemma":0.000007025182,"domain_scores_codex":[0.9988943,0.0001384568,0.0003817051,0.0001926802,0.0002333639,0.0001595063],"domain_scores_gemma":[0.9978707,0.0007441764,0.000131374,0.00102715,0.0001611557,0.00006537244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002213536,0.002375332,0.00009324453,0.0004924919,0.0002646083,0.000004698385,0.03113586,0.2777421,0.006410913,0.4584148,0.0007106701,0.2221339],"study_design_scores_gemma":[0.0004217225,0.0001169791,0.0000105823,0.00003711823,0.00001483835,0.000007054763,0.0002816768,0.9922091,0.004955923,0.0004158843,0.00138189,0.0001472118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002254827,0.00008215926,0.9933125,0.003367954,0.0001316812,0.0003503395,0.00004228553,0.0001459006,0.0003124003],"genre_scores_gemma":[0.7223166,0.00002778865,0.2769171,0.0003703239,0.000002885274,0.0002632052,0.00001762109,0.00001093999,0.00007349275],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7200618,"threshold_uncertainty_score":0.5776401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206186328","doi":"10.1109/jiot.2021.3139044","title":"Minimizing Age of Information in Multiaccess-Edge-Computing-Assisted IoT Networks","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University; Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Edge computing; Network packet; Distributed computing; Optimization problem; Computer network; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01335723907737441,"gpt":0.2472261944592268,"spread":0.2338689553818524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535558,0.0001247258,0.0002618953,0.0003830047,0.00004131019,0.000306689,0.0008111837,0.0001035347,0.00002457019],"category_scores_gemma":[0.0002345041,0.0001239267,0.0001123918,0.0004928251,0.00003832397,0.003185627,0.0001848787,0.0003812883,0.000004952554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009658772,"about_ca_system_score_gemma":0.0001090025,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002929432,"about_ca_topic_score_gemma":0.000003754232,"domain_scores_codex":[0.998,0.00008983516,0.001211864,0.0001034904,0.0003921016,0.0002027154],"domain_scores_gemma":[0.9978279,0.000112437,0.00120806,0.0002167882,0.0005661855,0.00006865075],"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.00006746254,0.0001860783,0.002779556,0.000172171,0.0001033712,0.000119553,0.0383479,0.8119191,0.001998686,0.001607314,0.002330636,0.1403682],"study_design_scores_gemma":[0.0007048431,0.00004412671,0.003580529,0.0004428102,0.000005234756,0.0002523069,0.0002157302,0.9797,0.01461475,0.0001195904,0.0001976941,0.00012239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1145,0.00005344867,0.8831827,0.0001675063,0.0008387083,0.0000567957,2.675842e-7,0.00002660445,0.001173956],"genre_scores_gemma":[0.8041106,0.00001764072,0.1954208,0.0003511379,0.00004190164,5.597037e-7,0.000005465084,0.000004864131,0.00004697984],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6896106,"threshold_uncertainty_score":0.5053583,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285274232","doi":"10.1109/tcomm.2022.3171450","title":"Grant Free Age-Optimal Random Access Protocol for Satellite-Based Internet of Things","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Random access; Computer science; Computer network; Throughput; Frame (networking); Markov chain; Protocol (science); Markov process; Transmission (telecommunications); Real-time computing; Distributed computing; Telecommunications; Wireless; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.059858787999661,"gpt":0.3227953658612915,"spread":0.2629365778616305,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005361005,0.0001503087,0.0001946607,0.0003552485,0.0007075606,0.0001674579,0.004781474,0.00004575702,0.0001436606],"category_scores_gemma":[0.00002249159,0.0001587203,0.0001832543,0.0006530983,0.0001211119,0.001186788,0.00007386468,0.0003252281,0.000006112504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001252799,"about_ca_system_score_gemma":0.0001684311,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005989508,"about_ca_topic_score_gemma":0.00002105981,"domain_scores_codex":[0.9984542,0.0002238965,0.0005876695,0.0002047696,0.0003517916,0.000177686],"domain_scores_gemma":[0.9963779,0.0005674713,0.000340602,0.002422289,0.0002333272,0.00005843162],"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.0006595618,0.001729233,0.000008783831,0.0001377522,0.0001059906,0.000001144702,0.00586303,0.923736,0.0002709092,0.0150072,0.003321301,0.04915908],"study_design_scores_gemma":[0.004345191,0.0002862564,0.00001453743,0.00003715779,0.00001944988,0.000004844502,0.00008537614,0.9582257,0.01004882,0.0006816448,0.02603905,0.0002120197],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001480401,0.000004876466,0.9631397,0.002338789,0.0001195951,0.03231908,0.00004440159,0.0002058158,0.001812919],"genre_scores_gemma":[0.1514644,0.000008068122,0.4888691,0.0008338826,0.000007129644,0.3580687,0.00005287394,0.00002872805,0.000667058],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4742706,"threshold_uncertainty_score":0.8885248,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312040304","doi":"10.1109/tcomm.2022.3217574","title":"Age of Information With Hybrid-ARQ: A Unified Explicit Result","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Computer science; Automatic repeat request; Decoding methods; Robustness (evolution); Minification; Real-time computing; Coding (social sciences); Algorithm; Computer network; Mathematics; Telecommunications link","retraction":null,"screen_n_in":null,"score":{"opus":0.02154446694462322,"gpt":0.2362473509092995,"spread":0.2147028839646763,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003073458,0.0001235233,0.000137558,0.0004467578,0.0008937706,0.00009038739,0.001924642,0.00002552306,0.00006404223],"category_scores_gemma":[0.000008437504,0.0001280846,0.0000632755,0.00105881,0.00007821141,0.001845177,0.00003524241,0.0003535863,0.00003409134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001379056,"about_ca_system_score_gemma":0.00015008,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007650942,"about_ca_topic_score_gemma":0.00002883621,"domain_scores_codex":[0.9986329,0.0001648643,0.0004958013,0.0001195812,0.0004365245,0.0001502985],"domain_scores_gemma":[0.9970426,0.000178545,0.0003043928,0.002194088,0.0002215465,0.00005884033],"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.00009226577,0.0005171524,0.000004749681,0.00002311834,0.0000758099,0.000001935173,0.00828189,0.8889325,0.0002779589,0.07042453,0.0008478631,0.03052018],"study_design_scores_gemma":[0.002448285,0.000843502,0.0002050437,0.00005690685,0.0000544227,0.0001113749,0.00257689,0.9312108,0.01034562,0.001410301,0.05009243,0.0006444562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006947953,0.00001059975,0.9867591,0.002055642,0.0001090958,0.0003643069,0.00007367648,0.0002232535,0.009709516],"genre_scores_gemma":[0.8939264,0.00005453944,0.1049749,0.0003888759,0.000002575215,0.0002991073,0.0001019785,0.000008481148,0.0002431099],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8932316,"threshold_uncertainty_score":0.6874251,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3102260691","doi":"10.1109/iccc49849.2020.9238859","title":"Multiuser Scheduling for Minimizing Age of Information in Uplink MIMO Systems","year":2020,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Chinese University of Hong Kong","keywords":"Computer science; Scheduling (production processes); MIMO; Telecommunications link; Information Age; Channel state information; Markov decision process; Job shop scheduling; Wireless; Performance metric; Markov process; Computer network; Channel (broadcasting); Mathematical optimization; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02547031811657962,"gpt":0.2382778940647458,"spread":0.2128075759481662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002097459,0.00006738737,0.000121326,0.0001256746,0.00002897961,0.00011684,0.0003074722,0.00004987774,0.000003152692],"category_scores_gemma":[0.0001933004,0.00006440326,0.00003049436,0.0003116082,0.00000838431,0.002891873,0.00007574094,0.0000454864,0.00001909641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002360621,"about_ca_system_score_gemma":0.00003546909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001535033,"about_ca_topic_score_gemma":9.36509e-7,"domain_scores_codex":[0.9991604,0.00001132513,0.0005041874,0.00007881928,0.0001324579,0.0001127726],"domain_scores_gemma":[0.9994245,0.00006540604,0.0001925903,0.0001328653,0.0001402775,0.0000444145],"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.00001310918,0.00001029891,0.0001969363,0.0002549173,0.000006000198,4.634459e-7,0.008222374,0.9458529,0.0002579555,0.03991356,0.0002090618,0.005062426],"study_design_scores_gemma":[0.0005087063,0.00002723113,0.00008578743,0.00002948573,0.000001014316,5.073709e-7,0.0004411795,0.9970101,0.001108351,0.00002236606,0.0006915779,0.00007376017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003851357,0.00001107697,0.9933853,0.0006032321,0.0001128795,0.0003828308,0.000001165505,0.0000903543,0.001561803],"genre_scores_gemma":[0.4222414,0.000002644165,0.5772685,0.0004182579,0.00001472965,0.00001896832,0.00001984753,0.000002578921,0.00001311946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.41839,"threshold_uncertainty_score":0.2626289,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3205916482","doi":"10.3390/rs13193981","title":"Benchmarking Deep Learning for On-Board Space Applications","year":2021,"lang":"en","type":"article","venue":"Remote Sensing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Narodowe Centrum Badań i Rozwoju; Canadian Space Agency; Silesian University of Technology; European Space Agency","keywords":"Benchmarking; Benchmark (surveying); Deep learning; Computer science; Artificial intelligence; Machine learning; Software deployment; Data science; Systems engineering; Software engineering; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01098269126438164,"gpt":0.2409360433024878,"spread":0.2299533520381061,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001609252,0.00008661323,0.00009226924,0.00007787874,0.0003214228,0.0002054335,0.0001279034,0.00004844222,0.000003683019],"category_scores_gemma":[0.0001317581,0.00009862231,0.00005398006,0.0003525497,0.00001197,0.0002967465,0.00007745979,0.0001107688,0.00003706886],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007121545,"about_ca_system_score_gemma":0.00005689129,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003075982,"about_ca_topic_score_gemma":0.000003329177,"domain_scores_codex":[0.9992234,0.00003457107,0.0001722293,0.0002233413,0.0001639974,0.0001824516],"domain_scores_gemma":[0.9991085,0.0001747995,0.0001168637,0.0003071683,0.0002426922,0.00004997082],"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.000001341075,0.000003189477,0.000001515815,0.00001303991,0.000006079752,0.000003136202,0.0004381983,0.1813635,0.0004577378,0.008081323,0.00007823122,0.8095527],"study_design_scores_gemma":[0.0001257051,0.00001414703,0.00001532807,0.00003368565,0.000003305355,0.00002231952,0.00007625516,0.9770953,0.002978876,0.0008707902,0.01865383,0.0001104511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004310419,0.00003238474,0.9866049,0.001050336,0.0001416233,0.0001692444,1.423373e-7,0.0001760325,0.01139428],"genre_scores_gemma":[0.05364523,0.00001744055,0.9453368,0.0004409023,0.0001487547,1.128725e-7,0.00001683595,0.00001086903,0.0003830419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8094422,"threshold_uncertainty_score":0.4021701,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4385191450","doi":"10.1109/tits.2023.3294546","title":"Joint Security and Resources Allocation Scheme Design in Edge Intelligence Enabled CBTCs: A Two-Level Game Theoretic Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Beijing Jiaotong University; Natural Science Foundation of Beijing Municipality; National Natural Science Foundation of China; China Railway","keywords":"Computer science; Resource allocation; Game theory; Nash equilibrium; Edge computing; Sequential game; Distributed computing; Enhanced Data Rates for GSM Evolution; Scheme (mathematics); Computation; Potential game; Resource management (computing); Reinforcement learning; Mobile edge computing; Computer security; Computer network; Mathematical optimization; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.05234589820079547,"gpt":0.256435605123491,"spread":0.2040897069226955,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001420754,0.0003398279,0.0003578463,0.001062923,0.0002035681,0.0003012732,0.0004813927,0.000175465,0.00002170238],"category_scores_gemma":[0.00001852606,0.0003420147,0.0001035334,0.001934753,0.0001140627,0.00118759,0.000002188574,0.0003460698,0.0001419159],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001694037,"about_ca_system_score_gemma":0.00009495805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001815747,"about_ca_topic_score_gemma":0.00004935892,"domain_scores_codex":[0.9968266,0.0002940902,0.001199817,0.0006285445,0.000638939,0.0004120068],"domain_scores_gemma":[0.9985081,0.0002519586,0.0002920836,0.0005178768,0.0002691461,0.0001608556],"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.00004937484,0.0001367056,0.00002735152,0.0002021109,0.00003408962,0.00000682733,0.02901036,0.9509702,0.0002226657,0.01479106,0.0000231616,0.004526054],"study_design_scores_gemma":[0.00038172,0.0001073276,0.0002414034,0.0002052948,0.00001708241,0.00001413445,0.004023693,0.9818111,0.01175285,0.0009997957,0.00007295937,0.0003726242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.014516,0.00007293199,0.9825585,0.0001393083,0.0005297841,0.001315296,0.0000267129,0.0005243958,0.0003170068],"genre_scores_gemma":[0.9786572,0.0003490842,0.02013258,0.00006359513,0.00002773309,0.0004895314,0.0000447476,0.00003100391,0.0002045359],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9641412,"threshold_uncertainty_score":0.9999032,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4287887984","doi":"10.1109/tits.2022.3190799","title":"Deep Deterministic Policy Gradient to Minimize the Age of Information in Cellular V2X Communications","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Reinforcement learning; Markov decision process; Computer science; Curse of dimensionality; Scheduling (production processes); Optimization problem; Heuristic; Lagrangian relaxation; Markov process; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02230575097350222,"gpt":0.251026718656627,"spread":0.2287209676831247,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056805,0.000182149,0.0002287827,0.0009755688,0.0004328306,0.0001115619,0.001348334,0.00005188926,0.00003084154],"category_scores_gemma":[0.00001222762,0.0001731458,0.0001233893,0.001783205,0.0000633332,0.0007659422,0.000005488379,0.0002772416,0.00004699921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003185292,"about_ca_system_score_gemma":0.0001445851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004857087,"about_ca_topic_score_gemma":0.0001300658,"domain_scores_codex":[0.9974439,0.0002381268,0.001253549,0.0001887851,0.0006440007,0.0002317106],"domain_scores_gemma":[0.9981616,0.0002189514,0.0003511186,0.001004894,0.0001822265,0.0000812393],"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.00002850254,0.000125931,0.00002495047,0.00003748788,0.00001786902,0.000002171524,0.01989411,0.9627561,0.00008304909,0.01096291,0.00002201859,0.006044909],"study_design_scores_gemma":[0.0006219365,0.0002629876,0.0008969389,0.00007646859,0.00003101467,0.00001412883,0.007969459,0.9781677,0.003060678,0.0001661335,0.008348389,0.0003841838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002354215,0.00002964812,0.9945463,0.000750064,0.0007242449,0.001069142,0.00007816061,0.00009480865,0.0003534454],"genre_scores_gemma":[0.9896024,0.00004193159,0.008927329,0.000390758,0.0000107372,0.000820688,0.00010606,0.00001209482,0.00008803137],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9872482,"threshold_uncertainty_score":0.706068,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2917973182","doi":"10.1109/glocom.2018.8647289","title":"Deep Reinforcement Learning for Reducing Latency in Mission Critical Services","year":2018,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":28,"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":"Reinforcement learning; Computer science; Latency (audio); Scheduling (production processes); Distributed computing; Wireless network; Wireless; Telecommunications link; Computer network; Artificial intelligence; Mathematical optimization; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01400689538035274,"gpt":0.2801654541452226,"spread":0.2661585587648699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000237652,0.00005978444,0.00005919695,0.0001011178,0.0001395202,0.0001134573,0.0002525996,0.00003969395,0.0001124582],"category_scores_gemma":[0.000103894,0.00005274751,0.00001709788,0.0001815943,0.00001647919,0.001251101,0.0001019356,0.00004956223,0.00006437953],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003597352,"about_ca_system_score_gemma":0.0000215579,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002341421,"about_ca_topic_score_gemma":0.000004737122,"domain_scores_codex":[0.9993146,0.00001460514,0.0002350426,0.000134437,0.0001304212,0.0001708926],"domain_scores_gemma":[0.9995407,0.00005984248,0.00004728052,0.0001428829,0.0001633159,0.00004593555],"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.00002225655,0.00003312569,0.000386637,0.0001467567,0.000004367976,0.000001486831,0.01122964,0.8223873,0.0004224728,0.1277829,0.0003915604,0.03719153],"study_design_scores_gemma":[0.0001747525,0.0001001393,0.0001347529,0.00004535522,7.247556e-7,0.000001534072,0.0001538575,0.9964098,0.001698971,0.0005723294,0.0006340077,0.00007378333],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001469882,0.000006766386,0.9792963,0.0008751164,0.0001395267,0.0001239937,1.057519e-8,0.0001010794,0.01798734],"genre_scores_gemma":[0.7354699,0.000003128067,0.2635221,0.0003611649,0.00004498933,0.000006114087,0.000003746649,0.000003309462,0.0005855202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.734,"threshold_uncertainty_score":0.2150981,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4388019181","doi":"10.1109/tcc.2023.3328614","title":"AoI-Aware Partial Computation Offloading in IIoT With Edge Computing: A Deep Reinforcement Learning Based Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Cloud Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":28,"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":"Fundamental Research Funds for the Central Universities; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Computation offloading; Deep learning; Energy consumption; Computation; Distributed computing; Latency (audio); Cloud computing; Edge computing; Artificial intelligence; Enhanced Data Rates for GSM Evolution; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0212314986026088,"gpt":0.2493298882073399,"spread":0.2280983896047311,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008328969,0.0003384387,0.0003275441,0.0007982873,0.0007804082,0.0003314341,0.0005223384,0.0001290895,0.000009164311],"category_scores_gemma":[0.00001570152,0.0003522225,0.0001056167,0.002539799,0.0000565379,0.0005750915,0.00001856958,0.0006268095,0.00008722387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002907517,"about_ca_system_score_gemma":0.0001483543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003330445,"about_ca_topic_score_gemma":0.00000763034,"domain_scores_codex":[0.9971361,0.0002039779,0.0007664773,0.000590246,0.0006692854,0.0006339484],"domain_scores_gemma":[0.9985964,0.0003671862,0.0003563967,0.0003525963,0.0001880644,0.0001393341],"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.00003037861,0.00007542848,0.00006188277,0.00005431617,0.00002073301,0.00001087577,0.002948783,0.9737402,0.00001871006,0.000224624,0.00003130007,0.02278282],"study_design_scores_gemma":[0.001434994,0.0002163165,0.000158159,0.0001816851,0.00001108914,0.00001658052,0.0005175153,0.9959363,0.001086715,0.00001292977,0.00003696582,0.0003907542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01715161,0.000003420877,0.9796512,0.0001904549,0.0006257418,0.0005127725,6.259202e-7,0.001203048,0.0006611108],"genre_scores_gemma":[0.9384023,0.000001849061,0.0611687,0.0002073533,0.00008713068,0.00001885513,0.00003245125,0.00003393468,0.00004742603],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9212507,"threshold_uncertainty_score":0.999893,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4378697064","doi":"10.1109/jiot.2023.3280746","title":"Stochastic Cumulative DNN Inference With RL-Aided Adaptive IoT Device-Edge Collaboration","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Huawei Technologies (Canada); Toronto Metropolitan University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Huawei Technologies","keywords":"Computer science; Inference; Edge device; Edge computing; Enhanced Data Rates for GSM Evolution; Artificial intelligence; Artificial neural network; Machine learning; Distributed computing; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.02726780046543794,"gpt":0.2834111906519792,"spread":0.2561433901865413,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816369,0.0001705684,0.0002171297,0.0004209775,0.0001120193,0.0003532292,0.0007609074,0.00007297387,0.00002724514],"category_scores_gemma":[0.0003358369,0.0001408177,0.00005022417,0.0009695244,0.00007184131,0.002931021,0.0001171683,0.0003214565,0.00009807601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001686202,"about_ca_system_score_gemma":0.0002917851,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002686603,"about_ca_topic_score_gemma":0.000009483681,"domain_scores_codex":[0.9983044,0.00009721842,0.0005622936,0.0001835263,0.0006182934,0.0002342262],"domain_scores_gemma":[0.997377,0.0002742965,0.0008701049,0.0002090757,0.001157393,0.0001121637],"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.0001837771,0.00005624805,0.0001759657,0.00003010534,0.0001620992,0.0000436864,0.05649527,0.9172772,0.0006529817,0.01085048,0.005087782,0.00898441],"study_design_scores_gemma":[0.0005431784,0.0003826421,0.0003471342,0.0003047951,0.00001234914,0.00008364609,0.0006882254,0.9925395,0.003441674,0.001421882,0.00005727934,0.0001777179],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07018638,0.00001163786,0.9275889,0.0004642774,0.0005295611,0.0001633721,0.000001528945,0.0001238272,0.0009304894],"genre_scores_gemma":[0.9407119,0.000005203431,0.05850315,0.0002166269,0.00006336209,0.00000648345,0.000003232293,0.00001180829,0.0004782864],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8705255,"threshold_uncertainty_score":0.5742378,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386025741","doi":"10.1109/tnsm.2023.3306179","title":"Optimizing Age of Information in RIS-Empowered Uplink Cooperative NOMA Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Age of Information Optimization","field":"Computer Science","cited_by":26,"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":"Telecommunications link; Noma; Computer science; Base station; Convex optimization; Optimization problem; Transmitter power output; Reduction (mathematics); Power (physics); Channel (broadcasting); Mathematical optimization; Power control; Regular polygon; Computer network; Mathematics; Algorithm; Transmitter; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01008918111272147,"gpt":0.2159558038780796,"spread":0.2058666227653581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003941721,0.0001477918,0.0001675786,0.0003598794,0.0001734607,0.0001379236,0.0002995533,0.00007111067,0.00001323832],"category_scores_gemma":[0.000001014561,0.0001527164,0.00003481658,0.001897165,0.00001786856,0.001276532,0.00001793609,0.000145082,0.00003786377],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004973792,"about_ca_system_score_gemma":0.00001503887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002662665,"about_ca_topic_score_gemma":0.00005784697,"domain_scores_codex":[0.9988388,0.00004575795,0.0004599432,0.0001681758,0.0001952233,0.0002920565],"domain_scores_gemma":[0.9993717,0.00006024987,0.0001313063,0.0002888448,0.00008633958,0.0000615376],"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.00002156563,0.00002103898,0.000005304527,0.00004994335,0.00002684914,0.000004937099,0.002034022,0.9626625,8.593586e-7,0.001466163,0.0001585688,0.03354821],"study_design_scores_gemma":[0.0006235672,0.00005355913,0.0005920817,0.00008738376,0.000010024,0.000001086188,0.0003978802,0.9971343,0.00002526611,0.00007074491,0.0008587788,0.0001453535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001769446,0.00001172903,0.9922965,0.0005840971,0.0003690454,0.0004395317,0.000001777127,0.0001720811,0.004355755],"genre_scores_gemma":[0.9246247,0.001172993,0.07184195,0.001951474,0.00003242389,0.0001266808,0.00006355709,0.00001456371,0.0001716526],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9228553,"threshold_uncertainty_score":0.6227595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2990179824","doi":"10.1109/tvt.2019.2956038","title":"Energy Harvesting Wireless Sensor Networks With Channel Estimation: Delay and Packet Loss Performance Analysis","year":2019,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network packet; Wireless sensor network; Channel (broadcasting); Computer science; Channel state information; Sink (geography); Context (archaeology); Real-time computing; Performance metric; Node (physics); Energy harvesting; Packet loss; Energy (signal processing); Computer network; Wireless; Engineering; Telecommunications; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.004040957086162419,"gpt":0.181070330876305,"spread":0.1770293737901426,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001319869,0.0001999963,0.0002538121,0.0008044355,0.0002475671,0.0001030709,0.0003379983,0.0002341619,0.00001209472],"category_scores_gemma":[0.000001950649,0.0001811962,0.00005457654,0.002198568,0.0001125467,0.0008748688,0.00000716451,0.0002617481,0.00001986056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005360942,"about_ca_system_score_gemma":0.00003173135,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001968894,"about_ca_topic_score_gemma":0.00003061463,"domain_scores_codex":[0.9988263,0.00003167866,0.0002746129,0.00037291,0.0002175691,0.0002769322],"domain_scores_gemma":[0.9990102,0.00004182285,0.0001450378,0.0005791933,0.0001632677,0.00006048723],"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.000009703769,0.00002463447,0.0002359152,0.00001073739,0.0001298525,0.000008262287,0.00006792037,0.9613597,0.00002106209,0.0007245338,0.000001805744,0.03740582],"study_design_scores_gemma":[0.0003600866,0.0001756332,0.0001619979,0.00003406202,0.00007410718,0.0001503859,0.00003952075,0.9946827,0.004038188,0.00002174472,0.00004005967,0.0002214966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2223212,0.00001893156,0.7765983,0.0004087905,0.00008381368,0.0001203073,0.000001564418,0.0003815737,0.00006549702],"genre_scores_gemma":[0.9437834,0.00006334957,0.05575771,0.0001438035,0.000007027158,0.00004220639,0.000006414016,0.00001339982,0.000182673],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7214622,"threshold_uncertainty_score":0.7388968,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3191484621","doi":"10.1109/tvt.2021.3100591","title":"LSTM-Based Channel Access Scheme for Vehicles in Cognitive Vehicular Networks With Multi-Agent Settings","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":25,"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","funders":"","keywords":"Computer science; Cognitive radio; Computer network; Channel (broadcasting); Quality of service; Control channel; Network packet; Vehicular ad hoc network; Markov process; Distributed computing; Wireless; Base station; Wireless ad hoc network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01974146207413222,"gpt":0.2644563411045447,"spread":0.2447148790304125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002341139,0.00027743,0.0002993743,0.0006775368,0.0002792137,0.0001592418,0.0006483918,0.0003986991,0.00001092168],"category_scores_gemma":[0.00003622045,0.0002768462,0.0001127403,0.001823971,0.0001317295,0.0007412692,0.0000137046,0.0004966534,0.00001166637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001381751,"about_ca_system_score_gemma":0.0001960417,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007217089,"about_ca_topic_score_gemma":0.00005369413,"domain_scores_codex":[0.9982116,0.00006034251,0.0004099858,0.0005923886,0.000260499,0.000465134],"domain_scores_gemma":[0.9985262,0.0001284822,0.000183301,0.0005396322,0.0005468585,0.00007549219],"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.00004803743,0.0003570144,0.00006457703,0.00003997334,0.00006882266,0.00008507671,0.000121627,0.9861228,0.0004175485,0.0003187362,0.00003244681,0.01232337],"study_design_scores_gemma":[0.002379794,0.0001619189,0.00007679503,0.0001913717,0.00002461776,0.00003976587,0.0001625124,0.8888038,0.107601,0.0000761913,0.0001772696,0.0003048517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02453481,0.00009872459,0.9703065,0.003573454,0.0001835402,0.0007516645,0.00001356233,0.0005184497,0.00001936249],"genre_scores_gemma":[0.8593325,0.00003122113,0.1386902,0.001214833,0.00001312164,0.0006084901,0.00002922884,0.00003090746,0.00004956745],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8347977,"threshold_uncertainty_score":0.9999683,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4206090210","doi":"10.1109/twc.2022.3142172","title":"Age-Oriented Transmission Protocol Design in Space-Air-Ground Integrated Networks","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Science and Technology Planning Project of Guangdong Province; National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Retransmission; Hybrid automatic repeat request; Computer science; Algorithm; Automatic repeat request; Notation; Mathematical notation; Redundancy (engineering); Theoretical computer science; Mathematics; Discrete mathematics; Transmission (telecommunications); Arithmetic; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.0280532183693484,"gpt":0.2718902866566433,"spread":0.2438370682872949,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006634823,0.0002450282,0.0002275071,0.0005846031,0.001370905,0.000119901,0.002271463,0.0001004229,0.0001302963],"category_scores_gemma":[0.000005462698,0.0002652113,0.0001058763,0.002493866,0.0001171069,0.001018183,0.00003677034,0.001045809,0.00002100697],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000502152,"about_ca_system_score_gemma":0.0002315239,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001451733,"about_ca_topic_score_gemma":0.00006423129,"domain_scores_codex":[0.9973153,0.0009310193,0.0006530216,0.0003360486,0.0004337368,0.0003308477],"domain_scores_gemma":[0.9971914,0.0003425709,0.000221072,0.001983097,0.000144128,0.0001177381],"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.0000656577,0.0006379613,0.000002946382,0.000007643994,0.000015507,0.000004316354,0.001687849,0.9425612,0.0001122182,0.005987574,0.0002324801,0.04868463],"study_design_scores_gemma":[0.001099066,0.000174451,0.00004807351,0.00005799332,0.000006688022,0.0000160514,0.0003114172,0.9861379,0.0006740046,0.0001622205,0.01103653,0.0002755601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00008180131,0.000009046003,0.9798369,0.0018674,0.0001345718,0.01674753,0.000009587508,0.0004249383,0.0008882192],"genre_scores_gemma":[0.6772283,0.0000509149,0.2224938,0.0004409387,0.000007787502,0.09915379,0.00005375546,0.00004010171,0.0005306509],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7573431,"threshold_uncertainty_score":0.99998,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4386362960","doi":"10.1109/tnsm.2023.3310790","title":"Age of Information Optimization in RIS-Assisted Wireless Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Age of Information Optimization","field":"Computer Science","cited_by":24,"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; Optimization problem; Wireless; Scheduling (production processes); Wireless network; Network packet; Distributed computing; Base station; Mathematical optimization; Computer network; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00966022925799449,"gpt":0.2061082348590664,"spread":0.1964480056010719,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747285,0.0001297976,0.0001461894,0.0004149908,0.0001404274,0.0001111427,0.0002810665,0.00007455295,0.00001136188],"category_scores_gemma":[6.91467e-7,0.0001378,0.00003185068,0.002383415,0.00001468504,0.001182994,0.00001340148,0.0001108093,0.00001978817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004939169,"about_ca_system_score_gemma":0.00001209678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003074225,"about_ca_topic_score_gemma":0.00006527635,"domain_scores_codex":[0.9988611,0.00005120168,0.0004446711,0.0001495112,0.000233067,0.000260455],"domain_scores_gemma":[0.9993836,0.00004653199,0.0001476875,0.000291771,0.00007542503,0.00005498319],"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.00001594241,0.00002403983,0.00001070292,0.00006940924,0.00001806825,0.000002903656,0.0005146224,0.9109457,3.805698e-7,0.001279464,0.0001119109,0.08700687],"study_design_scores_gemma":[0.0005376062,0.00003137391,0.002035872,0.00008143486,0.00001101242,0.000001259882,0.0001834359,0.9965363,0.00000914264,0.0000609352,0.0003856631,0.0001259484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001209407,0.000005215449,0.9941183,0.0004756819,0.0003438683,0.0003701588,0.000001681513,0.0002067106,0.003269027],"genre_scores_gemma":[0.9223331,0.001508509,0.07413907,0.001593781,0.00003058034,0.000130906,0.0001109412,0.00001593232,0.0001371371],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9211237,"threshold_uncertainty_score":0.561932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4292971126","doi":"10.1109/jiot.2022.3200392","title":"Adaptive Edge Sensing for Industrial IoT Systems: Estimation Task Offloading and Sensor Scheduling","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":24,"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":"Fundamental Research Funds for the Central Universities; Program for Innovation Team Building at Institutions of Higher Education in Chongqing; China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Computer science; Estimator; Scheduling (production processes); Real-time computing; Enhanced Data Rates for GSM Evolution; Edge computing; Mathematical optimization; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.03315507696369736,"gpt":0.2471404086028432,"spread":0.2139853316391458,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001261223,0.0001166412,0.0001948872,0.0002959195,0.0002936019,0.0003562867,0.0003498546,0.00005665397,0.000005011955],"category_scores_gemma":[0.000229959,0.0001203231,0.00006465276,0.0001661089,0.00002901048,0.0009683503,0.0001576411,0.0004003266,0.000001379119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002097279,"about_ca_system_score_gemma":0.00009459072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002321713,"about_ca_topic_score_gemma":1.283045e-7,"domain_scores_codex":[0.9985923,0.0001090448,0.0005832241,0.0001521821,0.0003839612,0.0001792475],"domain_scores_gemma":[0.9984989,0.000171508,0.0008714854,0.0001153035,0.0002687871,0.00007405232],"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.00009973862,0.00001919126,0.00002637509,0.00003509413,0.00007638723,0.0000104118,0.01066842,0.9550362,0.001507076,0.002393099,0.001427456,0.02870052],"study_design_scores_gemma":[0.0006649375,0.0002070343,0.000002761579,0.000158618,0.00001387715,0.0007814464,0.0009143778,0.99475,0.00192135,0.0002903634,0.000176391,0.0001188896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09472293,0.00005358537,0.9027725,0.0002301516,0.0018548,0.000210268,0.000003008876,0.00004175489,0.0001110407],"genre_scores_gemma":[0.7166613,0.000001468657,0.2830022,0.0001017165,0.000142593,0.000003178602,0.000001501059,0.000008896978,0.00007718726],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6219383,"threshold_uncertainty_score":0.4906634,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4382119947","doi":"10.1109/twc.2023.3287885","title":"Maximizing Age-Energy Efficiency in Wireless Powered Industrial IoE Networks: A Dual-Layer DQN-Based Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":23,"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":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Computer science; Dual (grammatical number); Wireless; Wireless network; Computer network; Efficient energy use; Layer (electronics); Telecommunications; Electrical engineering; Chemistry; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05238179641331529,"gpt":0.2620039865547206,"spread":0.2096221901414053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006804904,0.0003420144,0.0003649627,0.001187236,0.0008715208,0.0003429386,0.002472317,0.0003185168,0.00001629739],"category_scores_gemma":[0.00001765709,0.000380907,0.0001741998,0.004776748,0.0002149096,0.001000792,0.00004883729,0.000811036,0.00007292096],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002792632,"about_ca_system_score_gemma":0.000281669,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001793842,"about_ca_topic_score_gemma":0.0001530302,"domain_scores_codex":[0.997049,0.0004620214,0.0008778962,0.0004931274,0.0005309975,0.0005869849],"domain_scores_gemma":[0.9959734,0.0005881023,0.0002904416,0.002799377,0.0001830057,0.0001656617],"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.00002219667,0.0005095728,0.00001652427,0.000009150148,0.00002456748,0.000006704084,0.0007178794,0.9558101,0.00009946826,0.009430887,0.0002475996,0.0331053],"study_design_scores_gemma":[0.001287562,0.00005650534,0.00007021634,0.00009218304,0.00001326714,0.000007142302,0.0001880506,0.9967236,0.0006994128,0.00008264249,0.0003923495,0.000387088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002926218,0.00002813221,0.9909932,0.001466672,0.0004901235,0.0004676646,0.00001709822,0.000941687,0.002669228],"genre_scores_gemma":[0.9792313,0.0002827023,0.01927083,0.0003564598,0.0000312504,0.0004677561,0.0001222008,0.00004387605,0.0001936538],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9763051,"threshold_uncertainty_score":0.9998643,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4362654030","doi":"10.1109/jiot.2023.3264618","title":"Average Age-of-Information Minimization in Aerial IRS-Assisted Data Delivery","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Fundamental Research Funds for the Central Universities; Royal Society; Shenzhen Research Institute of Big Data; National Key Research and Development Program of China; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Upload; Benchmark (surveying); Coordinate descent; Base station; Real-time computing; Relay; Minification; Optimization problem; Wireless; Channel (broadcasting); Mathematical optimization; Algorithm; Computer network; Power (physics); Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03200294871970705,"gpt":0.2613346246592571,"spread":0.2293316759395501,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808447,0.0001067062,0.0001904112,0.0007157621,0.00003930316,0.0002415058,0.001606514,0.00008581969,0.00003819118],"category_scores_gemma":[0.0003030061,0.0001045085,0.00005211409,0.000621276,0.00003456672,0.00938658,0.0003519524,0.0002084438,0.00004423864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007295029,"about_ca_system_score_gemma":0.0001184678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005993908,"about_ca_topic_score_gemma":0.000004220178,"domain_scores_codex":[0.9981627,0.00007417506,0.0009912468,0.0001118249,0.0004890849,0.0001710106],"domain_scores_gemma":[0.9982706,0.0000868073,0.0009058173,0.0003981968,0.000284647,0.0000539322],"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.0004888747,0.0002713556,0.001795218,0.0004358248,0.0002257623,0.0001817856,0.08375193,0.558159,0.005708129,0.005904854,0.09889753,0.2441797],"study_design_scores_gemma":[0.0007534716,0.00006249861,0.001475564,0.0001905779,0.000004705869,0.00008374488,0.0001527671,0.9933026,0.002787104,0.0002808635,0.0007914603,0.0001146517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05941548,0.000007945814,0.9372511,0.0002256179,0.001517051,0.0001083255,0.000006259243,0.00006915502,0.001399092],"genre_scores_gemma":[0.9200121,0.00007466631,0.07937247,0.0001851293,0.0000720213,0.000001729324,0.0001573977,0.000007448252,0.0001171023],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8605965,"threshold_uncertainty_score":0.6805044,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3082773235","doi":"10.1145/3392156","title":"Staleness Control for Edge Data Analytics","year":2020,"lang":"en","type":"article","venue":"Proceedings of the ACM on Measurement and Analysis of Computing Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":22,"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":"Austrian Science Fund","keywords":"Computer science; Analytics; Distributed computing; Generality; Overhead (engineering); Synchronization (alternating current); Enhanced Data Rates for GSM Evolution; Data analysis; Edge computing; Data synchronization; Data modeling; Edge device; Real-time computing; Data science; Data mining; Wireless sensor network; Computer network; Database; Artificial intelligence; Cloud computing","retraction":null,"screen_n_in":null,"score":{"opus":0.09909636978250341,"gpt":0.2650699645050925,"spread":0.165973594722589,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673939,0.0001134672,0.0003952376,0.0002145021,0.0001071661,0.0001394152,0.002761111,0.00002817078,2.792122e-7],"category_scores_gemma":[0.001532241,0.00008268478,0.0001127709,0.001127713,0.00003151205,0.0003643251,0.0006597553,0.00004992211,2.39589e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002387757,"about_ca_system_score_gemma":0.00003217241,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003180583,"about_ca_topic_score_gemma":2.009178e-7,"domain_scores_codex":[0.9983219,0.00001385338,0.0005638332,0.0002598412,0.0007187951,0.0001217649],"domain_scores_gemma":[0.9973175,0.00008968922,0.0008714962,0.0005667396,0.001091661,0.00006292123],"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.0002030663,0.0002105551,0.07918795,0.003314269,0.006707487,1.799031e-7,0.005920046,0.8029611,0.008111066,0.0782691,0.009276427,0.005838742],"study_design_scores_gemma":[0.0003576691,0.00004489432,0.002136657,0.0001195524,0.0004907038,1.240528e-7,0.0001417616,0.9958894,0.0005524562,0.00004742244,0.0001343201,0.00008502734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03966501,0.0001909693,0.9553734,0.003763173,0.0001339236,0.0005674221,0.00002877793,0.00005682773,0.0002205052],"genre_scores_gemma":[0.9914888,0.000005259554,0.008288132,0.0001546591,0.00004554956,0.0000023408,0.000004820236,0.000004667834,0.000005833883],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9518237,"threshold_uncertainty_score":0.5130876,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964906425","doi":"10.1109/tnet.2019.2926142","title":"TailCutter: Wisely Cutting Tail Latency in Cloud CDNs Under Cost Constraints","year":2019,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":22,"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":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Latency (audio); Scheduling (production processes); Workload; Distributed computing; Minification; Benchmark (surveying); Computer network; Operating system; Mathematical optimization; World Wide Web","retraction":null,"screen_n_in":null,"score":{"opus":0.01896882680793668,"gpt":0.2376831121359373,"spread":0.2187142853280006,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000441959,0.0002495018,0.0002418018,0.0003390886,0.0002423926,0.0002523471,0.000831041,0.0001621119,0.000199025],"category_scores_gemma":[0.00000989815,0.0002721367,0.0001025976,0.0009545158,0.00006813547,0.001219411,0.0000185389,0.0004984968,0.0004550967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002244262,"about_ca_system_score_gemma":0.0001065668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002071665,"about_ca_topic_score_gemma":0.00002664711,"domain_scores_codex":[0.9979748,0.0001016033,0.0005833501,0.0004290811,0.0003801811,0.0005309946],"domain_scores_gemma":[0.9985796,0.0002360351,0.0002209339,0.000751473,0.0001037324,0.0001081883],"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.000011619,0.0000605813,0.0006636564,0.00001458507,0.00002232216,0.000007809619,0.000882313,0.8820739,0.00006047947,0.001250222,0.0001517188,0.1148008],"study_design_scores_gemma":[0.001711383,0.0001097762,0.0008039603,0.0004435958,0.00001660865,0.00005721522,0.000385574,0.9898506,0.0006859042,0.001768931,0.003471986,0.0006944565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.010617,0.00002226164,0.978921,0.001031399,0.002949067,0.0005324318,0.000003262317,0.0002956661,0.005627934],"genre_scores_gemma":[0.9697728,0.00005387986,0.02843103,0.001160701,0.0001558709,0.00003513299,0.000006605629,0.00002508336,0.0003589268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9591558,"threshold_uncertainty_score":0.9999731,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3202685228","doi":"10.1109/tvt.2021.3117536","title":"Age-Optimal Information Gathering in Linear Underwater Networks: A Deep Reinforcement Learning Approach","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Leverage (statistics); Robustness (evolution); Computer science; Reinforcement learning; Scheduling (production processes); Underwater; Linear programming; Cluster analysis; Real-time computing; Artificial intelligence; Mathematical optimization; Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.007968541285158708,"gpt":0.2068045061829934,"spread":0.1988359648978347,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002027568,0.000178571,0.0001849268,0.0006488888,0.0001983309,0.0001216123,0.0003771821,0.00029357,0.00002525413],"category_scores_gemma":[0.00001320131,0.000189668,0.00007403722,0.001314436,0.00005327482,0.001408014,0.00001524228,0.0006229996,0.00006990584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001734921,"about_ca_system_score_gemma":0.00005455848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006111848,"about_ca_topic_score_gemma":0.000007508015,"domain_scores_codex":[0.9986588,0.00005385251,0.000473927,0.0002396737,0.000238627,0.0003351395],"domain_scores_gemma":[0.9992265,0.00002143929,0.0001268693,0.0004415667,0.0001383065,0.00004539351],"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.000005883697,0.00004248528,0.000006086145,0.00001574894,0.00001882569,0.00001927911,0.0006240982,0.9793057,0.00008692023,0.001187244,0.000003644962,0.01868413],"study_design_scores_gemma":[0.0005292428,0.00007295141,0.000008408724,0.00002957062,0.000006375081,0.00007375226,0.0004031466,0.9905093,0.007389531,0.00005999998,0.0007255559,0.0001921966],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004027464,0.00002419274,0.993963,0.0004140474,0.0001957409,0.000217498,1.833851e-7,0.0005178255,0.000640025],"genre_scores_gemma":[0.8466815,0.00006882014,0.1527395,0.0002352973,0.00000991197,0.00009257971,0.00001977545,0.00001130613,0.0001413607],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.842654,"threshold_uncertainty_score":0.7734438,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4384788000","doi":"10.1109/tgcn.2023.3290007","title":"AoI-Minimal Online Scheduling for Wireless-Powered IoT: A Lyapunov Optimization-Based Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Green Communications and Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; China Scholarship Council; National Natural Science Foundation of China","keywords":"Lyapunov optimization; Scheduling (production processes); Computer science; Wireless; Mathematical optimization; Lyapunov function; Discrete time and continuous time; Wireless power transfer; Fading; Channel (broadcasting); Computer network; Mathematics; Lyapunov exponent; Lyapunov equation; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.04751076545740728,"gpt":0.2768445410944582,"spread":0.2293337756370509,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004338929,0.0002118323,0.0002125555,0.0004197269,0.001218497,0.0002279935,0.001021731,0.0001312313,0.000005603489],"category_scores_gemma":[0.000002539412,0.0002289057,0.000108208,0.00140321,0.0001100582,0.0004480087,0.00002526221,0.0002682072,0.0000071086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006174397,"about_ca_system_score_gemma":0.0001045682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003051292,"about_ca_topic_score_gemma":0.00003085308,"domain_scores_codex":[0.9985482,0.00009517827,0.0004888358,0.0003272482,0.0002185434,0.0003220064],"domain_scores_gemma":[0.9977037,0.0005539783,0.0002121466,0.001209981,0.0002150472,0.0001051098],"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.00001605451,0.0001209745,0.00001020978,0.00002202382,0.00002808411,2.095292e-7,0.0003543336,0.823514,0.00001295269,0.0003436352,0.00003740969,0.17554],"study_design_scores_gemma":[0.0006854095,0.00007905583,0.000009764867,0.00007721882,0.0000226431,0.000003919531,0.0001099082,0.9973884,0.00004347141,0.00007968147,0.001258904,0.0002416078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000286513,0.0001260909,0.9958811,0.001968772,0.0002156982,0.000547877,0.00003634337,0.0005711609,0.0003664668],"genre_scores_gemma":[0.4734916,0.0004322203,0.5252283,0.0003543821,0.00005230953,0.0001845503,0.0001404594,0.00002514059,0.00009101271],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4732051,"threshold_uncertainty_score":0.9371819,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4407826180","doi":"10.1109/tits.2025.3542365","title":"Task Offloading and Resource Allocation in Vehicular Cooperative Perception With Integrated Sensing, Communication, and Computation","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Age of Information Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Science and Technology Innovation Foundation of Harbin; National Natural Science Foundation of China","keywords":"Computer science; Task (project management); Perception; Resource allocation; Computation; Resource management (computing); Distributed computing; Resource (disambiguation); Human–computer interaction; Computer network; Engineering; Psychology; Systems engineering; Neuroscience","retraction":null,"screen_n_in":null,"score":{"opus":0.01095580748412794,"gpt":0.2379987194150532,"spread":0.2270429119309252,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003956132,0.0002174783,0.0002284117,0.0006248559,0.0003037428,0.0002716806,0.0001517426,0.0001250659,0.000003001101],"category_scores_gemma":[0.000006012666,0.0002079446,0.00002706593,0.0009510525,0.00009930573,0.0009748442,0.000001086423,0.0002494479,0.000005466422],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001801652,"about_ca_system_score_gemma":0.0000823405,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003193041,"about_ca_topic_score_gemma":0.0003798323,"domain_scores_codex":[0.9983535,0.0002108594,0.000654022,0.0003660017,0.0002590771,0.00015658],"domain_scores_gemma":[0.9990202,0.0001496465,0.0001828463,0.0002676017,0.000316866,0.0000628273],"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.00007691164,0.00007246312,0.0001966905,0.00009103737,0.00005399078,0.000002475759,0.01089094,0.9553465,0.0004722339,0.003856558,0.00005625118,0.02888395],"study_design_scores_gemma":[0.0007219,0.0001151105,0.002239051,0.0006486076,0.0000325067,0.00001352744,0.00528241,0.9881828,0.001954284,0.00005278648,0.0005057478,0.0002512741],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06317187,0.0001003335,0.9350471,0.0004537359,0.0001199204,0.0007213374,0.000008480419,0.00015504,0.000222204],"genre_scores_gemma":[0.9863019,0.0001941326,0.01300894,0.0001579749,0.00000426827,0.00005925039,0.0000967199,0.00001256042,0.0001642739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.92313,"threshold_uncertainty_score":0.8479734,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4387885634","doi":"10.1109/tvt.2023.3310516","title":"Age-of-Information Minimization for UAV-Based Multi-View Sensing and Communication","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"Shenzhen Research Institute of Big Data; China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Benchmark (surveying); Wireless; Real-time computing; Wireless sensor network; Sequence (biology); Minification; Convex optimization; Software deployment; Trajectory; Ground truth; Transmitter power output; Regular polygon; Channel (broadcasting); Artificial intelligence; Computer network; Mathematics; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01737453395657438,"gpt":0.2516315824351075,"spread":0.2342570484785331,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002536596,0.000120765,0.0001599494,0.0009638073,0.0002500508,0.00006031527,0.0003029869,0.0002057548,0.000002042987],"category_scores_gemma":[0.00004111469,0.000129853,0.00005487119,0.00123257,0.0001010988,0.0008134507,0.000006068047,0.0001293125,0.00002256046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004529515,"about_ca_system_score_gemma":0.00004638007,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007520599,"about_ca_topic_score_gemma":0.00001005306,"domain_scores_codex":[0.9991102,0.00004065356,0.0003947192,0.0001473931,0.0001454563,0.0001616051],"domain_scores_gemma":[0.9988745,0.0001082715,0.0002046327,0.000515949,0.0002667261,0.00002988137],"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.00001710623,0.00005631596,0.000007277722,0.0001399106,0.00003139006,0.000001309972,0.0006263077,0.5969554,0.001088295,0.005723286,0.00009092266,0.3952625],"study_design_scores_gemma":[0.0007140952,0.00007646294,0.00003699564,0.00005970274,0.00001401335,0.000006735692,0.0001032237,0.9716694,0.02534821,0.0004656889,0.001383301,0.000122152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002442905,0.00002460768,0.9941774,0.001956119,0.0001231844,0.0005242045,0.00001002347,0.000713804,0.00002772526],"genre_scores_gemma":[0.5073206,0.0001122515,0.4922048,0.0001798676,0.000002549068,0.00006570507,0.0000779503,0.00001020225,0.00002614845],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5048777,"threshold_uncertainty_score":0.529525,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226072761","doi":"10.1109/twc.2022.3160857","title":"Edge-Assisted Spectrum Sharing for Freshness-Aware Industrial Wireless Networks: A Learning-Based Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; McMaster University","funders":"National Key Research and Development Program of China; Natural Science Foundation of Chongqing; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Wireless; Wireless network; Enhanced Data Rates for GSM Evolution; Computer network; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.05038313646449438,"gpt":0.2603911029343829,"spread":0.2100079664698885,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006582124,0.0002936466,0.0003133244,0.0005052661,0.003638054,0.0003471754,0.003750494,0.0001561055,0.00006357193],"category_scores_gemma":[0.00001134349,0.0003536265,0.0002387056,0.00165115,0.0001365427,0.000780015,0.00008584855,0.00128043,0.00001128783],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006111611,"about_ca_system_score_gemma":0.0002963346,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007649759,"about_ca_topic_score_gemma":0.00006426426,"domain_scores_codex":[0.9975432,0.0003636685,0.0006671299,0.0005054902,0.0004732806,0.0004472125],"domain_scores_gemma":[0.9962584,0.0005113519,0.0004103285,0.002485796,0.0001922585,0.0001418901],"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.00004794331,0.0005522685,0.00002283149,0.0000138321,0.00004885599,4.703399e-7,0.0004057333,0.9736701,0.00001424393,0.005792264,0.000301585,0.01912984],"study_design_scores_gemma":[0.001441165,0.0001699649,0.0000190102,0.00002820981,0.00003331176,0.0000122128,0.000468121,0.9944982,0.0002954048,0.00007347036,0.002589475,0.0003714805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007212991,0.00002924576,0.9940904,0.002089333,0.0005763714,0.001046108,0.00006455874,0.0007368549,0.0006457982],"genre_scores_gemma":[0.9734825,0.00003429888,0.02312325,0.0002968027,0.00004805493,0.002269278,0.0002709043,0.00005128099,0.0004235665],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9727613,"threshold_uncertainty_score":0.9998916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3045606678","doi":"10.1109/icc40277.2020.9148764","title":"A Deep Reinforcement Learning Approach for Dynamic Contents Caching in HetNets","year":2020,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":18,"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; Cache; Reinforcement learning; Markov decision process; Scheduling (production processes); Performance metric; Queue; Exploit; Distributed computing; Computer network; Markov process; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02047196116263191,"gpt":0.236086587424027,"spread":0.2156146262613951,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001367608,0.00007457971,0.00008969496,0.00006422946,0.00007032599,0.0001010554,0.0003071813,0.00002991681,0.000008612502],"category_scores_gemma":[0.00007454102,0.00007077451,0.00002838571,0.0001923219,0.000006068721,0.0008595443,0.00008675199,0.00008864084,0.00001213774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005797469,"about_ca_system_score_gemma":0.00001321972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000931009,"about_ca_topic_score_gemma":0.00000257548,"domain_scores_codex":[0.999278,0.00001848012,0.0002464362,0.000154983,0.0001440612,0.0001580182],"domain_scores_gemma":[0.9996865,0.00002257636,0.00008673959,0.0001003187,0.00004674527,0.00005716959],"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.000005066919,0.000005123094,0.00007906293,0.00001605849,0.000002870838,3.305067e-7,0.002464836,0.9898435,0.00002492463,0.004032257,0.0000309018,0.003495028],"study_design_scores_gemma":[0.0005510998,0.00005545763,0.00008708395,0.000004313277,7.955092e-7,0.000001136434,0.0002108678,0.9988194,0.00004436956,0.00001768923,0.0001214156,0.00008643212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005751384,0.000007482413,0.9900712,0.0005986435,0.00002818144,0.0003493231,4.899397e-8,0.0001285281,0.008241405],"genre_scores_gemma":[0.7400603,0.000002651671,0.2587223,0.0009773764,0.000005686003,0.00002778211,0.00002051198,0.000003911134,0.0001794526],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7394852,"threshold_uncertainty_score":0.2886101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3044716756","doi":"10.1109/lcomm.2020.3010324","title":"Optimal Resource Allocation for Wireless Powered Sensors: A Perspective From Age of Information","year":2020,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"Energy harvesting; Computer science; Wireless sensor network; Bandwidth (computing); Base station; Wireless; Resource allocation; Transmitter power output; Real-time computing; Energy (signal processing); Computer network; Mathematical optimization; Telecommunications; Channel (broadcasting); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0244651112847504,"gpt":0.2523668865431249,"spread":0.2279017752583745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001796309,0.0001298742,0.0001699145,0.0001412007,0.0001871318,0.0001511431,0.001807213,0.00006411618,0.000004482808],"category_scores_gemma":[0.0001803291,0.0001472895,0.00008438633,0.0004691347,0.0001180133,0.002136249,0.0002243798,0.0001411278,0.00003262164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00011741,"about_ca_system_score_gemma":0.00005801115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006974628,"about_ca_topic_score_gemma":0.000003348611,"domain_scores_codex":[0.9988446,0.0001095232,0.0005111118,0.0001553621,0.0002339888,0.0001453768],"domain_scores_gemma":[0.9975729,0.0002782799,0.0004327889,0.001258161,0.0003827139,0.00007513163],"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.000255786,0.0002536957,0.00009592208,0.000134867,0.0003528361,0.000001877136,0.2514172,0.4421498,0.06877553,0.1827904,0.03791,0.01586213],"study_design_scores_gemma":[0.0008535248,0.00006899486,0.0002118532,0.00003562977,0.00002046674,0.000001572254,0.002829768,0.9753169,0.006153616,0.0001653543,0.01409037,0.0002518935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01419646,0.00002667568,0.9339526,0.05015777,0.00005542876,0.0005021422,0.00004831404,0.0001719373,0.0008886201],"genre_scores_gemma":[0.5629781,0.00002283805,0.431529,0.004931066,0.00003448411,0.00007072888,0.0004193533,0.000009442101,0.000004987217],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5487816,"threshold_uncertainty_score":0.6006292,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3130754803","doi":"10.1109/access.2021.3059966","title":"A Whittle Index Approach to Minimizing Age of Multi-Packet Information in IoT Network","year":2021,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":17,"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","keywords":"Computer science; Network packet; Index (typography); Internet of Things; Computer network; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.0343874121063206,"gpt":0.2805110687342046,"spread":0.246123656627884,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002643456,0.00009383741,0.0001525918,0.0001987598,0.00004563254,0.0003087615,0.0007238457,0.00006853599,0.000006996318],"category_scores_gemma":[0.00009442289,0.00009940552,0.00003017751,0.001338687,0.00001333761,0.00302484,0.00027111,0.00009422708,0.00001921424],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004995365,"about_ca_system_score_gemma":0.00009293805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003567549,"about_ca_topic_score_gemma":0.00002590249,"domain_scores_codex":[0.9989296,0.00004410452,0.0004456537,0.0001336569,0.0002482301,0.0001987525],"domain_scores_gemma":[0.9991702,0.00003683173,0.0001808759,0.0003586522,0.0001951313,0.00005830982],"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.000006017225,0.00004884182,0.002194508,0.00004566228,0.000005421029,0.000002777194,0.003253685,0.9822344,0.00002932995,0.0008722404,0.001384163,0.009922921],"study_design_scores_gemma":[0.0005214665,0.00001044353,0.01450136,0.00005435487,0.000001630351,0.000005318781,0.0001352344,0.9815844,0.002020027,0.0001162032,0.0008936915,0.0001558748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02128277,0.00001505513,0.9717141,0.0001194819,0.000282471,0.0001983131,0.000001742048,0.0000506774,0.006335396],"genre_scores_gemma":[0.717726,0.000005006659,0.2814002,0.0007199497,0.00003822943,0.00002760936,0.00002587423,0.000005010154,0.00005209634],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6964433,"threshold_uncertainty_score":0.4053639,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4290996600","doi":"10.1109/icc45855.2022.9838670","title":"Leveraging Reconfigurable Intelligent Surface to Minimize Age of Information in Wireless Networks","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":17,"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; Wireless; Base station; Wireless network; Scheduling (production processes); Wireless sensor network; Computer network; Distributed computing; Real-time computing; Mathematical optimization; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.07378218549108034,"gpt":0.3058475342207101,"spread":0.2320653487296298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582744,0.0001536972,0.0001949066,0.0005316978,0.0002716557,0.0002119269,0.003831196,0.00004496301,0.0004473747],"category_scores_gemma":[0.00008401236,0.000187053,0.00006309494,0.0008502771,0.00005184117,0.001272751,0.0007833486,0.0004640023,0.00005886529],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004124335,"about_ca_system_score_gemma":0.0001718519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001863086,"about_ca_topic_score_gemma":0.0000429661,"domain_scores_codex":[0.9979398,0.0002351807,0.0008206993,0.0001994984,0.000598133,0.0002067333],"domain_scores_gemma":[0.9976418,0.0002502548,0.0004226227,0.001238889,0.0003708957,0.00007551409],"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.00004010264,0.0001664021,0.0002743692,0.000006066402,0.00002664986,0.000001852652,0.005403247,0.7991485,0.0004296238,0.1782094,0.001211948,0.01508186],"study_design_scores_gemma":[0.0003199072,0.00006179058,0.000577577,0.00005338434,0.000002377718,0.000006249395,0.001413659,0.989729,0.0004998888,0.00102178,0.006112902,0.0002015106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01131451,0.00001890506,0.9263769,0.0081302,0.0009952277,0.0005073344,0.00004513897,0.0001036791,0.05250814],"genre_scores_gemma":[0.9698584,0.0001837575,0.02804883,0.001042584,0.00001196288,0.000163848,0.0003337051,0.000008502629,0.0003483937],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9585439,"threshold_uncertainty_score":0.7627801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393285839","doi":"10.1109/tnsm.2024.3382301","title":"Safety-Aware Age of Information (S-AoI) for Collision Risk Minimization in Cell-Free mMIMO Platooning Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Network and Service Management","topic":"Age of Information Optimization","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Qatar National Research Fund","keywords":"Computer science; Metric (unit); Overhead (engineering); Collision; Minification; Real-time computing; Reduction (mathematics); Performance metric; Simulation; Embedded system; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.005780169401622869,"gpt":0.1985500495338979,"spread":0.192769880132275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004499842,0.0001715274,0.0001702502,0.0003681597,0.0002303361,0.0002439738,0.0003509028,0.0001018246,0.000006698569],"category_scores_gemma":[0.000001925983,0.0001757882,0.00005779721,0.001214487,0.00001323496,0.001563472,0.00001762373,0.0001552477,0.000006218993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007965844,"about_ca_system_score_gemma":0.0000224923,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002850659,"about_ca_topic_score_gemma":0.0001020228,"domain_scores_codex":[0.998668,0.0000498909,0.0005810853,0.0002221667,0.0002418936,0.0002369884],"domain_scores_gemma":[0.9991606,0.0001621084,0.0001604219,0.0003734607,0.0000916463,0.00005175122],"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.00006089934,0.00002825036,0.000004022087,0.0002888976,0.00002563119,0.00000168467,0.0009967281,0.9115409,2.900518e-7,0.002249961,0.0004983352,0.08430444],"study_design_scores_gemma":[0.0009913555,0.00008700605,0.0001387078,0.0002652651,0.00003996188,0.00000111658,0.0002525228,0.9923306,0.00003800971,0.0003834711,0.005305613,0.00016634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003658007,0.00005895715,0.9952334,0.0003605408,0.0006823333,0.0008346848,0.00001910322,0.0001481858,0.002297022],"genre_scores_gemma":[0.7763497,0.004905061,0.2166394,0.001215088,0.0001002565,0.0002945611,0.0002190325,0.00003717033,0.0002397284],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.778594,"threshold_uncertainty_score":0.7168435,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4389880088","doi":"10.1109/mcom.002.2300317","title":"Signaling Storm in O-RAN: Challenges and Research Opportunities","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Magazine","topic":"Age of Information Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Ericsson (Canada); University of Waterloo","funders":"University of Waterloo","keywords":"Ran; Computer science; Storm; Telecommunications; Computer network; Oceanography; Geology","retraction":null,"screen_n_in":null,"score":{"opus":0.296812401978851,"gpt":0.3733287622596291,"spread":0.07651636028077813,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001817561,0.00007575547,0.0001005425,0.0007347408,0.0002547334,0.0001209218,0.001404915,0.00004970215,0.000005991466],"category_scores_gemma":[0.0001550242,0.00008169677,0.00001460176,0.0008421541,0.0001597345,0.001024821,0.0007177787,0.0002467196,0.0002166117],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005334097,"about_ca_system_score_gemma":0.00006970081,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001058698,"about_ca_topic_score_gemma":0.0001113011,"domain_scores_codex":[0.9988622,0.0002417525,0.0002685924,0.0001425171,0.0002687742,0.0002161524],"domain_scores_gemma":[0.9976434,0.0005851895,0.00006167608,0.001398739,0.0002519363,0.00005906584],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000008359591,0.000155619,0.0001562064,0.0001131659,0.00002185705,0.00001928352,0.04364065,0.006552063,0.0008600694,0.5134845,0.009758512,0.4252297],"study_design_scores_gemma":[0.000737291,0.0001017143,0.009051773,0.0001940098,0.000003298514,0.00002134988,0.005791285,0.8604047,0.000277717,0.01292358,0.1101044,0.0003889732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1037473,0.02571133,0.1560108,0.3193914,0.001273052,0.002718813,0.00002585596,0.003875183,0.3872463],"genre_scores_gemma":[0.9012251,0.04237871,0.05437191,0.0001751728,0.000040288,0.0001508989,0.00003950179,0.00001717327,0.001601271],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8538526,"threshold_uncertainty_score":0.3331497,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4383752889","doi":"10.1109/lcomm.2023.3292859","title":"A New Design of CR-NOMA and Its Application to AoI Reduction","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; National Science Foundation","keywords":"Noma; Computer science; Reduction (mathematics); Cognitive radio; Simple (philosophy); Scheme (mathematics); Computer network; Division (mathematics); Telecommunications link; Telecommunications; Wireless; Mathematics; Arithmetic","retraction":null,"screen_n_in":null,"score":{"opus":0.03849227615074147,"gpt":0.273831604589912,"spread":0.2353393284391705,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002983157,0.00007996039,0.00008910846,0.0003161903,0.0001613924,0.00005946699,0.001122354,0.0000356525,0.000002178276],"category_scores_gemma":[0.00004498144,0.00009135684,0.00002013897,0.001161494,0.00002885149,0.0007404112,0.0002558483,0.00007348364,0.0001609954],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004342844,"about_ca_system_score_gemma":0.0000443735,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002060306,"about_ca_topic_score_gemma":0.000001289505,"domain_scores_codex":[0.9992151,0.00008298586,0.0002785899,0.000149685,0.0001548289,0.0001188469],"domain_scores_gemma":[0.9983137,0.0001006479,0.0001497677,0.001251592,0.0001097951,0.00007455346],"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.00001495921,0.00004853728,0.00004471083,0.0000356509,0.00003820491,4.679777e-7,0.009939075,0.5198223,0.2570161,0.03350565,0.06756605,0.1119683],"study_design_scores_gemma":[0.0002294345,0.00003522443,0.0009368364,0.00002797788,0.000007513537,0.00001170439,0.00008777643,0.9820691,0.01312956,0.0004275727,0.002861139,0.0001761307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004127374,0.00003409396,0.9691845,0.02571183,0.00008429081,0.0004465598,0.000001399391,0.0002330122,0.0001769225],"genre_scores_gemma":[0.5205901,0.0001336315,0.4781256,0.0008475224,0.00002937154,0.0001191227,0.00002025955,0.00001066668,0.0001236999],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5164627,"threshold_uncertainty_score":0.3725424,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}