{"meta":{"query_hash":"848cf6913ec5","filters":{"topic":"Age of Information Optimization"},"cohort_total":175,"direct_labels_cover":0,"predictions_cover":175,"exported":175,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/848cf6913ec5","api":"https://metacan.xera.ac/api/v1/cohort?topic=Age+of+Information+Optimization"},"results":[{"id":"W1527869850","doi":"10.1007/11518655_18","title":"Optimal Threshold Policies for Operation of a Dedicated-Platform with Imperfect State Information – A POMDP Framework","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Partially observable Markov decision process; Computer science; Markov decision process; Task (project management); Optimal control; Markov process; Latency (audio); Heuristic; Mathematical optimization; Process (computing); Markov chain; Markov model; Artificial intelligence; Machine learning; Mathematics","score_opus":0.009928208014848852,"score_gpt":0.2376701382809395,"score_spread":0.22774193026609063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527869850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040208516,0.00006090693,0.9962353,0.00057011994,0.0003184278,0.0009792765,0.000020913314,0.00014648579,0.0012664885],"genre_scores_gemma":[0.10832477,0.000047427377,0.8900845,0.0012227836,0.00015855696,0.00003457079,0.000050295956,0.00002227406,0.000054795764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971441,0.000008543614,0.0008589267,0.0004984821,0.0009931171,0.0004968058],"domain_scores_gemma":[0.9973073,0.00027110244,0.00074967754,0.00083371805,0.00071513694,0.00012309151],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000727917,0.00044027073,0.00044591178,0.0011104746,0.0002553888,0.0006730698,0.0017632577,0.00031004555,0.000013761753],"category_scores_gemma":[0.0001024057,0.00036289243,0.00009343756,0.00059699814,0.00042745908,0.0051080375,0.00043694006,0.0004656516,0.000016416765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028576384,0.00001163383,0.000013264355,0.00005591423,0.000012651798,0.0000010257738,0.0036508236,0.8224903,0.0000111147865,0.029214961,0.00001946514,0.14449027],"study_design_scores_gemma":[0.00044420385,0.0004901823,0.00004284619,0.0003798741,0.000009203209,0.000037581525,0.0000013303767,0.9844336,0.0022473012,0.0108681135,0.00058997207,0.00045580542],"about_ca_topic_score_codex":0.000015533105,"about_ca_topic_score_gemma":0.000024759574,"teacher_disagreement_score":0.16194329,"about_ca_system_score_codex":0.0003046968,"about_ca_system_score_gemma":0.0007822324,"threshold_uncertainty_score":0.9998823},"labels":[],"label_agreement":null},{"id":"W1683981004","doi":"10.1109/acc.2015.7172192","title":"Reinforcement learning in decentralized stochastic control systems with partial history sharing","year":2015,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Artificial intelligence; Reinforcement; Control (management); Engineering","score_opus":0.022660899385748765,"score_gpt":0.21526126131914997,"score_spread":0.1926003619334012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1683981004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013714957,0.00004994896,0.9917707,0.000088551904,0.00022334352,0.00025848384,2.9115032e-8,0.00018307743,0.006054362],"genre_scores_gemma":[0.99142456,0.000001060471,0.007274736,0.00013503208,0.000015381165,0.000033851302,0.0000030464232,0.0000050697413,0.0011072432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903953,0.000031273237,0.00027739888,0.00014396598,0.00030437083,0.00020344187],"domain_scores_gemma":[0.99944323,0.00002005132,0.00013284574,0.00018914524,0.00010731998,0.00010742317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038256557,0.00008617458,0.000120157856,0.000109243156,0.000028658395,0.00009294343,0.00027742537,0.000029435014,0.000022033886],"category_scores_gemma":[0.00006127407,0.00007157818,0.000011910037,0.00012158307,0.000015025805,0.0010235702,0.000057687637,0.00008631293,0.000044555338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023642091,0.000005455052,0.0004261267,0.000004345455,0.0000043893024,0.0000027296444,0.0012189094,0.98106015,0.0000019088975,0.016899388,0.00022046643,0.00013248548],"study_design_scores_gemma":[0.0018862173,0.00007499537,0.000046002155,0.000026871297,0.000002254411,0.0000070987467,0.00012033275,0.99634665,0.0000051242837,0.0000072412367,0.0013738604,0.00010333605],"about_ca_topic_score_codex":0.00011630923,"about_ca_topic_score_gemma":0.000007222092,"teacher_disagreement_score":0.99005306,"about_ca_system_score_codex":0.0005429094,"about_ca_system_score_gemma":0.00015878597,"threshold_uncertainty_score":0.29188734},"labels":[],"label_agreement":null},{"id":"W1980209062","doi":"10.1117/12.720048","title":"A network-centric robust resource allocation strategy for unmanned systems: stability analysis","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Robustness (evolution); Distributed computing; Queueing theory; Probabilistic logic; Scheduling (production processes); Telecommunications network; Resource allocation; Computer network; Mathematical optimization","score_opus":0.016784810529917406,"score_gpt":0.22569174255191174,"score_spread":0.20890693202199434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980209062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.714575,0.0000927597,0.2810015,0.0012299846,0.00020422538,0.0010938444,0.000024051604,0.00016673215,0.001611874],"genre_scores_gemma":[0.5465958,0.000025078092,0.4524371,0.00012592187,0.00042708023,0.00017956081,0.000045112745,0.000039080165,0.00012523474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969635,3.6652136e-8,0.0011799412,0.0004642163,0.00084647874,0.00054583314],"domain_scores_gemma":[0.9952463,0.00032945295,0.0008480933,0.00012556043,0.0032987345,0.0001518941],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0025396047,0.00030461026,0.00045706413,0.00024408934,0.00016431163,0.00033739,0.0015412895,0.00022105688,0.0000043813084],"category_scores_gemma":[0.0006189667,0.00027153408,0.00064009946,0.0015842727,0.00012063464,0.0014708411,0.00019712951,0.0002150505,9.157475e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009716854,0.00010452668,0.00036047553,0.00041486436,0.00071671215,4.148283e-8,0.00030924298,0.16240628,0.0061691,0.8263509,0.0026700492,0.0004006212],"study_design_scores_gemma":[0.0008237332,0.00023038914,0.0009149472,0.00010076769,0.00027525256,0.000005117939,0.0012644939,0.98808366,0.0058503146,0.00095359894,0.0011707196,0.00032700368],"about_ca_topic_score_codex":0.000010009933,"about_ca_topic_score_gemma":4.492272e-7,"teacher_disagreement_score":0.8256774,"about_ca_system_score_codex":0.00033628388,"about_ca_system_score_gemma":0.000055827975,"threshold_uncertainty_score":0.9999737},"labels":[],"label_agreement":null},{"id":"W2022750604","doi":"10.1007/s11276-009-0196-8","title":"Packet data messaging over TETRA: network performance analysis","year":2009,"lang":"en","type":"article","venue":"Wireless Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ministry of Transportation of Ontario","funders":"","keywords":"Computer science; Computer network; Network packet; Packet loss; Transmission delay; Radio Link Protocol; Packet analyzer; Quality of service; Dimensioning; End-to-end delay; Tetra; Channel (broadcasting); Wireless; Telecommunications","score_opus":0.013291433368058398,"score_gpt":0.23771762824288895,"score_spread":0.22442619487483054,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022750604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009368439,0.00020880623,0.9820435,0.0003541409,0.00024222195,0.00011587735,0.0000021173391,0.00031628422,0.007348602],"genre_scores_gemma":[0.9748943,0.00020223598,0.02316863,0.0011371231,0.00027568114,0.0000033789531,0.0001668425,0.0000086522205,0.00014319368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980639,0.00007270618,0.00041910817,0.00044826037,0.0004956253,0.0005003865],"domain_scores_gemma":[0.9977,0.000059380356,0.00023903018,0.0017716447,0.00011590273,0.00011404361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087258616,0.0002004242,0.0002748523,0.0001664811,0.00028905226,0.0003756552,0.0019791499,0.000113729526,0.000043246226],"category_scores_gemma":[0.000012909597,0.00019284232,0.0000723021,0.0025435847,0.000030464595,0.0028989941,0.0004096351,0.00024581054,0.000022542687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032570135,0.000014791506,0.0035399934,0.000002094415,0.00007134281,0.0000023029854,0.00007323146,0.898509,2.5878205e-7,0.0036960044,0.008623701,0.08546399],"study_design_scores_gemma":[0.00021427816,0.000017556578,0.03766387,0.00002386198,0.00008138254,0.0000033309523,0.0000062939157,0.96056026,0.0000033167307,0.000078769255,0.0011151814,0.00023192455],"about_ca_topic_score_codex":0.0000046585014,"about_ca_topic_score_gemma":0.000007759088,"teacher_disagreement_score":0.9655258,"about_ca_system_score_codex":0.000057274447,"about_ca_system_score_gemma":0.00004600988,"threshold_uncertainty_score":0.78638816},"labels":[],"label_agreement":null},{"id":"W2032247137","doi":"10.1049/ic:20000038","title":"TETRA conformance testing techniques","year":2000,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"InStream Fisheries Research (Canada)","funders":"","keywords":"Conformance testing; Computer science; Tetra; Reliability engineering; Engineering; Standardization; Operating system; Chemistry","score_opus":0.011482230831729837,"score_gpt":0.21272009915480775,"score_spread":0.2012378683230779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032247137","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004219551,0.0000021508965,0.5836225,0.00015109261,0.000013900223,0.000047116995,1.2146661e-7,0.00056446827,0.41517666],"genre_scores_gemma":[0.07221477,0.000006994209,0.92294425,0.0011401214,0.000018665854,0.0000066368475,0.0000012709195,0.0000025960712,0.0036647066],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99957204,0.0000044429044,0.00014113743,0.000072501265,0.000108859684,0.00010101536],"domain_scores_gemma":[0.9996601,0.000023375464,0.000031880223,0.00019332685,0.00006382069,0.000027543432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009375776,0.00004836757,0.00003893383,0.000044842403,0.00006696731,0.00011361473,0.00032243057,0.000022881042,0.00025957258],"category_scores_gemma":[0.000020838723,0.000041780408,0.0000100282205,0.00029236532,0.000012805698,0.0016357257,0.000028971763,0.000037723516,0.0002810133],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.3705515e-7,0.000005726838,0.00009638429,0.000002893973,9.1086423e-7,7.8615324e-7,0.00012847026,0.0013869066,0.000036415502,0.019114194,0.0020585118,0.9771684],"study_design_scores_gemma":[0.00007412326,0.00003733188,0.0006555499,0.00001325801,4.8174996e-7,0.000025135349,0.000008553083,0.9538861,0.0100672105,0.0004978612,0.034593567,0.00014085563],"about_ca_topic_score_codex":0.000006213411,"about_ca_topic_score_gemma":1.9648245e-7,"teacher_disagreement_score":0.97702754,"about_ca_system_score_codex":0.000013320103,"about_ca_system_score_gemma":0.00002068904,"threshold_uncertainty_score":0.36119512},"labels":[],"label_agreement":null},{"id":"W2067217436","doi":"10.1016/j.mad.2008.09.015","title":"Modeling “frailty”: Can a simple feedback model suffice?","year":2008,"lang":"en","type":"letter","venue":"Mechanisms of Ageing and Development","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Douglas College","funders":"","keywords":"Simplicity; Computer science; Simple (philosophy); Key (lock); Contrast (vision); Basis (linear algebra); Causal model; Signature (topology); Artificial intelligence; Mathematics; Computer security; Epistemology; Statistics","score_opus":0.030299053371513757,"score_gpt":0.21778634037666242,"score_spread":0.18748728700514866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067217436","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040157692,0.000033025794,0.98273945,0.01582388,0.00013452335,0.00020803773,0.0000067153696,0.00016434336,0.00048844295],"genre_scores_gemma":[0.011006812,0.00007032246,0.91021955,0.0776888,0.00007732221,0.000029741874,0.00020334782,0.00003694506,0.0006671687],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784565,0.000028589358,0.0006662103,0.0004337005,0.00064134883,0.00038450616],"domain_scores_gemma":[0.99892133,0.000029810355,0.0002896229,0.00043184852,0.00025131903,0.00007605747],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023219796,0.00033667337,0.00038186205,0.00032017147,0.00024345302,0.00014823454,0.00066235824,0.0003757198,0.0000072400817],"category_scores_gemma":[0.000027678469,0.00033913096,0.000055037755,0.00016947181,0.000021612468,0.0004332487,0.00042401976,0.00045621765,0.0000121642215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000049888945,0.000027151724,5.468837e-7,0.0003187179,0.00008126196,0.00017785656,0.008264241,0.89306873,0.00005634647,0.0023910622,0.084158644,0.011450456],"study_design_scores_gemma":[0.00023151874,0.000023633966,0.0000014237661,0.0001039614,0.0000055016676,0.000031253818,0.000039087066,0.9891222,0.00083367416,0.0027923412,0.006393546,0.00042183205],"about_ca_topic_score_codex":0.00005697121,"about_ca_topic_score_gemma":0.000008684501,"teacher_disagreement_score":0.096053496,"about_ca_system_score_codex":0.00011957928,"about_ca_system_score_gemma":0.00050969527,"threshold_uncertainty_score":0.99990606},"labels":[],"label_agreement":null},{"id":"W2098202470","doi":"10.1109/mssc.2013.2254632","title":"Through the Looking Glass?Part 2 of 2: Trend Tracking for ISSCC 2013 [ISSCC Trends]","year":2013,"lang":"en","type":"article","venue":"IEEE Solid-State Circuits Magazine","topic":"Age of Information Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Wireline; Computer science; Telecommunications; Multimedia; Wireless; Electrical engineering; Engineering","score_opus":0.024227402092634562,"score_gpt":0.26811829214955085,"score_spread":0.24389089005691628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2098202470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006976485,0.00014920584,0.96860486,0.003596557,0.0013397346,0.00078432594,0.000054974644,0.00028183302,0.01821204],"genre_scores_gemma":[0.97488564,0.00019449543,0.014208901,0.001530707,0.0003771771,0.00024849543,0.00009198176,0.000075886994,0.008386689],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974867,0.000072584124,0.00092599535,0.00041799204,0.000494684,0.0006020589],"domain_scores_gemma":[0.99768335,0.00026196428,0.0006831442,0.00081081525,0.0004663013,0.0000944118],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040932314,0.00031866037,0.0003781743,0.00028369192,0.00028121995,0.000418227,0.0011785473,0.0001002531,0.00019226111],"category_scores_gemma":[0.000076958415,0.00025312978,0.00018911975,0.0009713105,0.00013535978,0.003446938,0.00010538669,0.00018463783,0.0002620484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001492723,0.00023388177,0.00009552754,0.00021012806,0.00019517326,0.0000070977626,0.017736666,0.1842772,0.007989998,0.0109240785,0.28575653,0.49255878],"study_design_scores_gemma":[0.0032506303,0.00041565773,0.002551201,0.00025097287,0.00008250725,0.00008459039,0.00032295837,0.80725956,0.029089954,0.011178228,0.14423066,0.0012830617],"about_ca_topic_score_codex":0.000037959508,"about_ca_topic_score_gemma":0.000046152367,"teacher_disagreement_score":0.96790916,"about_ca_system_score_codex":0.00007063157,"about_ca_system_score_gemma":0.00007167712,"threshold_uncertainty_score":0.9999921},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014892957982797744,"score_gpt":0.2397648447921899,"score_spread":0.22487188680939216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809579289","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086929946,0.0000010857594,0.9152042,0.00061490014,0.000117819305,0.000030430523,3.4723453e-8,0.00022223596,0.082939975],"genre_scores_gemma":[0.3413991,1.1722317e-7,0.6568108,0.0014055681,0.00003213441,0.0000010799014,8.240275e-7,0.0000012247759,0.00034913345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99966604,0.0000064265473,0.00008384581,0.000068367204,0.000099323166,0.00007598101],"domain_scores_gemma":[0.9996429,0.000011794852,0.000028454588,0.0002008616,0.000088494584,0.000027512411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009183265,0.00003274584,0.000026786,0.00005097944,0.00006804584,0.000113534035,0.00027072255,0.000017420809,0.00013193197],"category_scores_gemma":[0.000026764654,0.000028336603,0.000011739856,0.0001819968,0.000022321075,0.0006022065,0.00004362063,0.00001986478,0.0006704302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000560907,0.000047986425,0.00033749844,0.000012528661,0.000009213267,0.000008087733,0.0014844126,0.07432994,0.00050138065,0.82039046,0.009092141,0.09378072],"study_design_scores_gemma":[0.000095789605,0.000020758964,0.00012821691,0.0000027725991,2.6062276e-7,7.210286e-7,0.0000056802783,0.991649,0.0055008167,0.00034560595,0.0022042147,0.00004619347],"about_ca_topic_score_codex":0.000002359577,"about_ca_topic_score_gemma":0.000001380235,"teacher_disagreement_score":0.917319,"about_ca_system_score_codex":0.000011712784,"about_ca_system_score_gemma":0.00002966066,"threshold_uncertainty_score":0.8617248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"","keywords":"Computer science; Cache; Latency (audio); Computer network; Exploit; Content delivery; Quality of service; Enhanced Data Rates for GSM Evolution; Telecommunications; Computer security","score_opus":0.018443077292214897,"score_gpt":0.224350987180318,"score_spread":0.20590790988810312,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902838298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24354644,0.00005907667,0.7509833,0.0001764685,0.00016948047,0.000115394054,2.3805316e-7,0.00010092254,0.0048486856],"genre_scores_gemma":[0.9541497,0.000031466,0.044936474,0.00073447934,0.00008034972,0.0000039687657,0.0000042834586,0.000004754871,0.000054490436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991931,0.000044264292,0.00023555048,0.00019254391,0.00014884637,0.00018574305],"domain_scores_gemma":[0.99944353,0.000016289436,0.000063447835,0.00026392998,0.00013495157,0.00007786272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031852158,0.000094492694,0.00009893509,0.000108376466,0.000099911806,0.0001990721,0.0003150612,0.000057770303,0.000038729468],"category_scores_gemma":[0.000028644752,0.000081965976,0.000017503062,0.00021699593,0.000042324536,0.0020524336,0.00017236127,0.0000867795,0.000020111254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063319785,0.00035314568,0.024182154,0.00006585769,0.00007034781,0.000115452356,0.018184407,0.43733293,0.0007473257,0.18071613,0.004143792,0.33402514],"study_design_scores_gemma":[0.00027877692,0.00008371646,0.013464409,0.000022135035,0.0000012659433,0.000008480543,0.00010491589,0.9853958,0.00027981884,0.0001880046,0.00005393996,0.00011875393],"about_ca_topic_score_codex":0.0002916937,"about_ca_topic_score_gemma":0.00019874917,"teacher_disagreement_score":0.7106033,"about_ca_system_score_codex":0.000048102454,"about_ca_system_score_gemma":0.000040289964,"threshold_uncertainty_score":0.33424756},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014006895380352744,"score_gpt":0.28016545414522265,"score_spread":0.2661585587648699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2917973182","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014698815,0.0000067663864,0.97929627,0.0008751164,0.00013952666,0.00012399371,1.0575189e-8,0.00010107944,0.017987335],"genre_scores_gemma":[0.7354699,0.0000031280674,0.26352212,0.00036116492,0.000044989327,0.000006114087,0.000003746649,0.000003309462,0.0005855202],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993146,0.000014605144,0.0002350426,0.00013443702,0.00013042119,0.0001708926],"domain_scores_gemma":[0.99954075,0.000059842478,0.00004728052,0.00014288287,0.00016331594,0.000045935547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023765201,0.00005978444,0.000059196947,0.00010111779,0.00013952018,0.00011345728,0.0002525996,0.000039693954,0.00011245824],"category_scores_gemma":[0.00010389402,0.000052747513,0.000017097884,0.0001815943,0.000016479195,0.0012511009,0.000101935555,0.000049562226,0.00006437953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022256554,0.00003312569,0.00038663702,0.00014675672,0.000004367976,0.0000014868307,0.011229643,0.8223873,0.0004224728,0.12778291,0.0003915604,0.037191525],"study_design_scores_gemma":[0.00017475245,0.00010013931,0.0001347529,0.00004535522,7.247556e-7,0.0000015340719,0.00015385752,0.9964098,0.0016989711,0.00057232945,0.00063400774,0.000073783325],"about_ca_topic_score_codex":0.000023414212,"about_ca_topic_score_gemma":0.000004737122,"teacher_disagreement_score":0.734,"about_ca_system_score_codex":0.000035973517,"about_ca_system_score_gemma":0.0000215579,"threshold_uncertainty_score":0.21509811},"labels":[],"label_agreement":null},{"id":"W2948967385","doi":"10.1109/access.2019.2920662","title":"High-Reliability Multi-Agent Q-Learning-Based Scheduling for D2D Microgrid Communications","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Division of Computer and Network Systems; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Microgrid; Computer network; 3rd Generation Partnership Project 2; Smart grid; Quality of service; Real-time computing; Scheduling (production processes); Latency (audio); Distributed computing; Telecommunications link; Mathematical optimization; Engineering; Telecommunications","score_opus":0.0345348606107653,"score_gpt":0.3128113740015508,"score_spread":0.2782765133907855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2948967385","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05517158,0.000031456046,0.94189763,0.0012692257,0.0006237147,0.0006582428,0.0000054382235,0.00024967,0.00009304647],"genre_scores_gemma":[0.5864995,0.000008597247,0.4128522,0.0004361811,0.000022597143,0.00006817311,0.000035060923,0.000008301896,0.00006938528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893546,0.00007452133,0.00034868333,0.00025223696,0.00017713779,0.00021195735],"domain_scores_gemma":[0.99777305,0.00025944493,0.0002540865,0.0012655559,0.00038309256,0.00006475356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046630754,0.00012247378,0.00014507976,0.00010851503,0.00024853688,0.00043068436,0.0023785776,0.000072366325,0.00002617723],"category_scores_gemma":[0.00010868261,0.00012264783,0.000075563985,0.00031576058,0.000043697375,0.0017182176,0.00030124176,0.0001633247,0.00017022627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000076039228,0.00009986833,0.003208607,0.000052062664,0.000008910332,1.200989e-7,0.00021348025,0.9896705,0.00028646176,0.00077884237,0.00022751586,0.005445998],"study_design_scores_gemma":[0.0007496825,0.000034876986,0.0010268087,0.000021957623,0.0000045810675,4.590842e-7,0.000012827424,0.98777074,0.006861413,0.00008397597,0.003275732,0.00015693842],"about_ca_topic_score_codex":0.00004494108,"about_ca_topic_score_gemma":0.000007832706,"teacher_disagreement_score":0.5313279,"about_ca_system_score_codex":0.00009270445,"about_ca_system_score_gemma":0.00010546791,"threshold_uncertainty_score":0.50014335},"labels":[],"label_agreement":null},{"id":"W2949694388","doi":"10.48550/arxiv.1112.6220","title":"Optimal decentralized control of coupled subsystems with control sharing","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Statistic; Linear-quadratic-Gaussian control; Control (management); Sufficient statistic; Optimal control; Dynamic programming; Decomposition; Decentralised system; Mathematical optimization; Gaussian; Distributed computing; Control theory (sociology); Mathematics; Algorithm; Artificial intelligence","score_opus":0.03737537822599072,"score_gpt":0.16235542888069787,"score_spread":0.12498005065470716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949694388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.091137476,0.000035420508,0.90626556,0.00002189611,0.0002211315,0.0006623533,0.000013897371,0.00020378195,0.0014384864],"genre_scores_gemma":[0.9915919,0.00004497684,0.008034687,0.00005054327,0.000018925897,0.0000026833154,0.00001635403,0.000017535162,0.00022240725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983582,0.000085522915,0.00041536885,0.00064355764,0.0001574536,0.00033990698],"domain_scores_gemma":[0.997218,0.00007593685,0.00090321765,0.001107208,0.0005330246,0.00016261592],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033312078,0.00031489754,0.0005527018,0.0002773611,0.00009556652,0.00010882414,0.0018437807,0.0002413246,0.000055504428],"category_scores_gemma":[0.000027658221,0.0003181176,0.00015812906,0.00038891745,0.00011060507,0.0008803689,0.00046735848,0.000302006,0.000030375064],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021930836,0.000047376383,0.00373809,0.00008827294,0.00019005536,0.000050397462,0.00038785915,0.91041785,0.000016242711,0.08480543,0.0000159022,0.000023235203],"study_design_scores_gemma":[0.003743646,0.000082535116,0.0005519948,0.00014741329,0.00010622513,0.000007178842,0.00005575733,0.9942985,0.00010836105,0.0005386102,0.000021245458,0.0003385295],"about_ca_topic_score_codex":0.0001791759,"about_ca_topic_score_gemma":0.0000142164445,"teacher_disagreement_score":0.9004544,"about_ca_system_score_codex":0.00015876343,"about_ca_system_score_gemma":0.00022183469,"threshold_uncertainty_score":0.9999271},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Cloud computing; Computer science; Latency (audio); Scheduling (production processes); Workload; Distributed computing; Minification; Benchmark (surveying); Computer network; Operating system; Mathematical optimization; World Wide Web","score_opus":0.018968826807936684,"score_gpt":0.23768311213593732,"score_spread":0.21871428532800063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964906425","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010616997,0.000022261636,0.978921,0.0010313987,0.002949067,0.0005324318,0.0000032623173,0.00029566613,0.0056279344],"genre_scores_gemma":[0.96977276,0.000053879863,0.028431026,0.0011607007,0.00015587095,0.000035132995,0.000006605629,0.00002508336,0.00035892683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979748,0.00010160332,0.00058335013,0.00042908112,0.00038018113,0.0005309946],"domain_scores_gemma":[0.9985796,0.00023603514,0.00022093387,0.00075147295,0.00010373244,0.00010818832],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000441959,0.00024950178,0.00024180175,0.00033908858,0.00024239263,0.00025234706,0.000831041,0.00016211186,0.00019902505],"category_scores_gemma":[0.00000989815,0.00027213673,0.00010259756,0.0009545158,0.00006813547,0.0012194111,0.000018538902,0.0004984968,0.00045509668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011619005,0.000060581304,0.0006636564,0.000014585069,0.000022322161,0.000007809619,0.000882313,0.88207394,0.00006047947,0.0012502216,0.00015171884,0.11480078],"study_design_scores_gemma":[0.0017113835,0.00010977622,0.0008039603,0.00044359584,0.000016608648,0.000057215224,0.00038557398,0.9898506,0.00068590423,0.0017689307,0.003471986,0.00069445645],"about_ca_topic_score_codex":0.000020716647,"about_ca_topic_score_gemma":0.000026647112,"teacher_disagreement_score":0.9591558,"about_ca_system_score_codex":0.0002244262,"about_ca_system_score_gemma":0.000106566775,"threshold_uncertainty_score":0.99997306},"labels":[],"label_agreement":null},{"id":"W2978315677","doi":"10.1109/access.2019.2944463","title":"Balancing Message Criticality and Timeliness in IoT Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia","keywords":"Computer science; Criticality; Reinforcement learning; Performance metric; Distributed computing; Rendering (computer graphics); Bandwidth (computing); Computer network; Operations research; Artificial intelligence","score_opus":0.009735463760872596,"score_gpt":0.2697179449758672,"score_spread":0.2599824812149946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2978315677","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13235612,0.000029190145,0.8639607,0.00041703595,0.0003110306,0.00012565691,3.1613445e-7,0.000060604292,0.002739392],"genre_scores_gemma":[0.99167943,0.000008683523,0.007252082,0.0009490587,0.000037004425,0.000005133695,0.0000016804281,0.0000039437105,0.000063010826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992968,0.000033764645,0.0002089,0.00016640573,0.0001335652,0.0001605821],"domain_scores_gemma":[0.99949443,0.000083749146,0.00005016807,0.00026083234,0.00006744597,0.00004338112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031393731,0.000070746195,0.000105481646,0.000070404465,0.00003312645,0.00030604345,0.0004975693,0.00005277497,0.000029827652],"category_scores_gemma":[0.000031499574,0.00006762338,0.000011653315,0.00029880137,0.000016166581,0.001584446,0.00015294933,0.000095890566,0.000028266117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019551297,0.0000825467,0.15519542,0.00017422701,0.000012648618,0.000022455346,0.0010236602,0.7715536,0.00010377609,0.023051823,0.0022372485,0.046523068],"study_design_scores_gemma":[0.00022301418,0.0000055960304,0.028035505,0.000027510156,7.571251e-7,0.0000031018346,0.000007704801,0.97091943,0.00021583907,0.0003751923,0.000093083436,0.000093273615],"about_ca_topic_score_codex":0.000027666374,"about_ca_topic_score_gemma":0.0000078394905,"teacher_disagreement_score":0.85932326,"about_ca_system_score_codex":0.00002457447,"about_ca_system_score_gemma":0.0000201901,"threshold_uncertainty_score":0.29511842},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.004040957086162419,"score_gpt":0.181070330876305,"score_spread":0.17702937379014258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2990179824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22232121,0.00001893156,0.77659833,0.0004087905,0.000083813684,0.00012030732,0.0000015644176,0.00038157369,0.00006549702],"genre_scores_gemma":[0.9437834,0.00006334957,0.05575771,0.00014380353,0.000007027158,0.000042206386,0.000006414016,0.000013399817,0.00018267297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988263,0.000031678665,0.0002746129,0.00037290997,0.00021756908,0.00027693217],"domain_scores_gemma":[0.9990102,0.000041822852,0.00014503783,0.0005791933,0.00016326766,0.000060487226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001319869,0.00019999634,0.00025381215,0.0008044355,0.00024756708,0.00010307087,0.0003379983,0.00023416188,0.0000120947225],"category_scores_gemma":[0.0000019506488,0.00018119624,0.000054576536,0.0021985678,0.000112546695,0.00087486877,0.00000716451,0.00026174812,0.000019860563],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009703769,0.000024634466,0.00023591521,0.000010737392,0.00012985249,0.000008262287,0.00006792037,0.96135974,0.000021062095,0.0007245338,0.000001805744,0.03740582],"study_design_scores_gemma":[0.00036008665,0.00017563322,0.00016199789,0.000034062017,0.00007410718,0.0001503859,0.000039520753,0.9946827,0.0040381877,0.000021744721,0.000040059665,0.00022149658],"about_ca_topic_score_codex":0.000019688943,"about_ca_topic_score_gemma":0.000030614632,"teacher_disagreement_score":0.7214622,"about_ca_system_score_codex":0.000053609423,"about_ca_system_score_gemma":0.000031731346,"threshold_uncertainty_score":0.73889685},"labels":[],"label_agreement":null},{"id":"W2998077039","doi":"10.1109/access.2019.2960172","title":"Ieee Access Special Section Editorial: Cloud and Big Data-Based Next-Generation Cognitive Radio Networks","year":2019,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Nanjing Institute of Technology; University of North Carolina at Charlotte; Jyväskylän Yliopisto","keywords":"Cognitive radio; Computer science; Cloud computing; Interference (communication); Spectrum management; Big data; Computer network; Distributed computing; Wireless; Telecommunications; Channel (broadcasting); Operating system","score_opus":0.0845977986745758,"score_gpt":0.29932904745775063,"score_spread":0.21473124878317484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998077039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027841348,0.000016369884,0.77063954,0.00012670628,0.19995649,0.0004636579,0.000016169814,0.00014760521,0.0007921399],"genre_scores_gemma":[0.6830209,0.00005778515,0.001746595,0.0007864414,0.31379703,0.000031608735,0.00043563178,0.000026889998,0.00009711116],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981962,0.00011343747,0.00039501107,0.0005340048,0.00049535435,0.00026598296],"domain_scores_gemma":[0.9983445,0.00016234175,0.00035060177,0.00065843115,0.00038162654,0.00010248857],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050568813,0.00020693555,0.00020384541,0.00019976491,0.0002317272,0.0026999945,0.0015740272,0.00020202296,0.000043539498],"category_scores_gemma":[0.000072916344,0.00020911488,0.000031960877,0.00061806175,0.000045219273,0.011370289,0.0003163219,0.00023741981,0.000036167145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115757866,0.000087433014,0.0017178932,0.000052307256,0.000052732405,0.000004799162,0.00040360188,0.40540227,0.0002898969,0.00023532346,0.53461885,0.05701911],"study_design_scores_gemma":[0.0011346968,0.00006058347,0.00069846783,0.00003653146,0.000018661083,0.0000047114254,0.000012566461,0.9855891,0.0028167977,0.000039929364,0.00927824,0.00030971813],"about_ca_topic_score_codex":0.000066048466,"about_ca_topic_score_gemma":0.00006035296,"teacher_disagreement_score":0.76889294,"about_ca_system_score_codex":0.00008262761,"about_ca_system_score_gemma":0.00016534426,"threshold_uncertainty_score":0.9983353},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"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","score_opus":0.026655782704455046,"score_gpt":0.2566990754814949,"score_spread":0.23004329277703986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3000547285","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005983968,0.000040429044,0.9772358,0.015594855,0.00015784873,0.0005212229,0.0000081650205,0.00029051892,0.00016719385],"genre_scores_gemma":[0.8596118,0.000039615785,0.13701409,0.0031008602,0.000022099086,0.00015325498,0.00001272397,0.000020262794,0.000025269292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810785,0.00028965864,0.0005915006,0.0003538209,0.00032430724,0.00033283627],"domain_scores_gemma":[0.9976879,0.0003692358,0.00011732483,0.0013893803,0.00014071596,0.0002954689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031695643,0.00022060897,0.00025932022,0.00028885744,0.0005800558,0.00015240352,0.0017554371,0.00014352905,0.000018990251],"category_scores_gemma":[0.000026253914,0.0002394661,0.000100409416,0.0013492091,0.00008615051,0.00079615717,0.00005213435,0.00055233465,0.000070397145],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017262288,0.0001927258,0.000026078947,0.000007350006,0.000020621319,0.0000025511597,0.0024386067,0.9897585,0.00023480396,0.0024655573,0.00018086508,0.0046550636],"study_design_scores_gemma":[0.000703039,0.000059939306,0.0002393423,0.00006224408,0.000010341781,0.0000054030265,0.000058247788,0.9975228,0.00077581743,0.0000368458,0.00027729606,0.0002487083],"about_ca_topic_score_codex":0.000059341142,"about_ca_topic_score_gemma":0.000301632,"teacher_disagreement_score":0.85362786,"about_ca_system_score_codex":0.00013654243,"about_ca_system_score_gemma":0.00012280376,"threshold_uncertainty_score":0.9765144},"labels":[],"label_agreement":null},{"id":"W3017289904","doi":"10.48550/arxiv.2004.07911","title":"A Deep Reinforcement Learning Approach for Dynamic Contents Caching in HetNets","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cache; Reinforcement learning; Markov decision process; Scheduling (production processes); Performance metric; Dynamic web page; Exploit; Queue; Distributed computing; Computer network; Markov process; Artificial intelligence; Web service; World Wide Web; Mathematical optimization","score_opus":0.05901472695652191,"score_gpt":0.19092636670934812,"score_spread":0.13191163975282622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3017289904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065450645,0.000013609622,0.9893839,0.00007902023,0.00015465531,0.0007475635,0.0000010585419,0.00019624326,0.002878923],"genre_scores_gemma":[0.9661424,0.00004602738,0.033011563,0.00013506619,0.000013947997,0.000005888174,0.00015520291,0.00001450702,0.00047536305],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985692,0.00007950776,0.00030926242,0.0006472058,0.00010374648,0.00029108196],"domain_scores_gemma":[0.99887574,0.000051007883,0.00038882103,0.00044530004,0.0001295388,0.000109596825],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002233824,0.00024193905,0.00027472156,0.00030809303,0.00014445555,0.00014648956,0.0011546169,0.00018925175,0.0000051427382],"category_scores_gemma":[0.00007189295,0.00030280533,0.00013207138,0.00040228275,0.000028838822,0.0007834697,0.0009590187,0.0005380052,0.000015089949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024389126,0.00001864924,0.00023903824,0.00010488005,0.00002653435,0.000015737127,0.0011103225,0.9806874,0.000004571902,0.017423663,0.000013638861,0.00033118753],"study_design_scores_gemma":[0.00080783863,0.000045743374,0.00017026025,0.000051807023,0.000014085593,0.0000014997329,0.00019662717,0.9971657,0.000007788765,0.0012044932,0.000042006188,0.00029214384],"about_ca_topic_score_codex":0.000051398183,"about_ca_topic_score_gemma":0.000013041962,"teacher_disagreement_score":0.95959735,"about_ca_system_score_codex":0.00044406066,"about_ca_system_score_gemma":0.00008184399,"threshold_uncertainty_score":0.9999424},"labels":[],"label_agreement":null},{"id":"W3024589490","doi":"10.1109/access.2020.2994600","title":"Using Deep Reinforcement Learning to Improve Sensor Selection in the Internet of Things","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Criticality; Asynchronous communication; Reinforcement learning; Network packet; Data collection; Wireless sensor network; Distributed computing; Real-time computing; Computer network; Machine learning","score_opus":0.033482801312848635,"score_gpt":0.28970584147947326,"score_spread":0.2562230401666246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024589490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071310624,0.0000015570494,0.9270791,0.00050004263,0.000075971286,0.00017715026,2.6861402e-8,0.00003584852,0.0008196719],"genre_scores_gemma":[0.9699278,9.654218e-7,0.027871907,0.002139911,0.00002998763,0.0000054338225,6.459456e-7,0.0000033049869,0.000020042753],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993108,0.000040155544,0.0002359832,0.00011262579,0.00019894903,0.00010148083],"domain_scores_gemma":[0.9996251,0.000030043577,0.00015036167,0.00008327338,0.00008344827,0.000027771704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020980748,0.000059165886,0.0000701437,0.000078293,0.00003797536,0.00019686409,0.00063270633,0.000024846837,0.00000913674],"category_scores_gemma":[0.00008256975,0.000047807425,0.00001820748,0.0005522874,0.000006762773,0.0018387414,0.0001253651,0.00011099263,0.00000947141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073065316,0.0000030859571,0.00032692857,0.000014834843,0.000002987396,6.477777e-7,0.018282387,0.9751103,0.0023415368,0.00035444493,0.00006727025,0.00348826],"study_design_scores_gemma":[0.00010792439,0.00005623685,0.00019739491,0.000011902708,0.0000015482573,0.0000018898791,0.00018133735,0.98108715,0.018203981,0.00001597325,0.00008005231,0.00005463534],"about_ca_topic_score_codex":0.00011659865,"about_ca_topic_score_gemma":0.000002724852,"teacher_disagreement_score":0.8992072,"about_ca_system_score_codex":0.000040923023,"about_ca_system_score_gemma":0.00002078848,"threshold_uncertainty_score":0.19495301},"labels":[],"label_agreement":null},{"id":"W3035528052","doi":"10.1109/tccn.2020.2993976","title":"IEEE TCCN Special Section Editorial: Intelligent Resource Management for 5G and Beyond","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Engineering and Physical Sciences Research Council; National Natural Science Foundation of China","keywords":"Computer science; Special section; Resource management (computing); Resource (disambiguation); Process (computing); Section (typography); Cognition; Data science; Telecommunications; Computer network; Medicine","score_opus":0.036740780251001415,"score_gpt":0.2644072878818417,"score_spread":0.2276665076308403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3035528052","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006337681,0.00016575198,0.9843425,0.0015299782,0.0051771603,0.0005999216,0.0000122196625,0.00012630197,0.007982749],"genre_scores_gemma":[0.9021133,0.0123991305,0.062435687,0.0032141795,0.019074,0.0004934344,0.00005569523,0.000049371738,0.00016515898],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901474,0.000088449575,0.00029499797,0.00026426246,0.00016828893,0.00016927268],"domain_scores_gemma":[0.99884945,0.0004087872,0.0001288067,0.00032973653,0.00017502913,0.00010816402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023265491,0.00014803419,0.00013351388,0.00012324566,0.00084465166,0.00022383372,0.00035376512,0.00008088409,0.0000055907985],"category_scores_gemma":[0.0000052330056,0.00016396304,0.000051932006,0.00037348332,0.00009720471,0.00055597967,0.00001528419,0.00024581837,0.0000060305433],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013624296,0.000120133926,0.000005357222,0.00006271966,0.00013231934,7.061893e-7,0.004590147,0.006559329,0.000023124507,0.002939391,0.008534698,0.9768958],"study_design_scores_gemma":[0.0014395998,0.00044363187,0.000019191157,0.00021173256,0.0001164869,0.000009520325,0.0016262745,0.6387408,0.0010697445,0.00048998016,0.35537526,0.00045780753],"about_ca_topic_score_codex":0.0000026866676,"about_ca_topic_score_gemma":0.000011197695,"teacher_disagreement_score":0.97643805,"about_ca_system_score_codex":0.00004054083,"about_ca_system_score_gemma":0.000016998314,"threshold_uncertainty_score":0.66862184},"labels":[],"label_agreement":null},{"id":"W3039417973","doi":"10.1109/vtc2020-spring48590.2020.9128850","title":"Association and Scheduling in Energy Harvesting Networks: Age of Information and Fairness Trade-off","year":2020,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Knapsack problem; Network packet; Computer science; Scheduling (production processes); Fairness measure; Mathematical optimization; Dynamic programming; Job shop scheduling; Dynamic priority scheduling; Efficient energy use; Distributed computing; Computer network; Wireless; Algorithm; Throughput; Mathematics; Quality of service; Routing (electronic design automation)","score_opus":0.008501479887760743,"score_gpt":0.19147118738976548,"score_spread":0.18296970750200475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3039417973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014402658,0.000053698754,0.9827897,0.0015139016,0.000028245608,0.00005175399,3.028334e-7,0.000055076078,0.0011046465],"genre_scores_gemma":[0.9015962,0.00009809534,0.09735612,0.00090374716,0.000015839702,0.000002751263,0.000013033113,0.0000020906848,0.000012118519],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993607,0.000026651585,0.00031765894,0.00007194238,0.00013273334,0.000090322086],"domain_scores_gemma":[0.99958175,0.00007130167,0.00021224706,0.000053615287,0.000037164922,0.000043921267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023727518,0.00005750978,0.00009298804,0.00007560683,0.00003584852,0.00015855145,0.00009977137,0.00005463378,0.0000018753595],"category_scores_gemma":[0.0001897577,0.000058493108,0.00000856003,0.0003232365,0.000009688265,0.0035928253,0.00008227226,0.00005398349,4.872895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005163382,0.0000068487107,0.011312502,0.00005137352,0.000008901226,8.997411e-7,0.00548616,0.75036496,0.000042458316,0.053963907,0.00007633484,0.17868046],"study_design_scores_gemma":[0.0002499166,0.000017250428,0.008389344,0.00001593946,0.00000138589,9.548327e-7,0.00014602247,0.99061793,0.00011027872,0.00010629622,0.00028256257,0.000062088424],"about_ca_topic_score_codex":0.000032684544,"about_ca_topic_score_gemma":0.000012994782,"teacher_disagreement_score":0.88719356,"about_ca_system_score_codex":0.000026183738,"about_ca_system_score_gemma":0.00001656983,"threshold_uncertainty_score":0.26047117},"labels":[],"label_agreement":null},{"id":"W3041990688","doi":"10.1109/tcomm.2022.3207820","title":"Age-Limited Capacity of Massive MIMO","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Notation; Mathematical notation; Mathematics; Discrete mathematics; Algorithm; Computer science; Arithmetic","score_opus":0.04138377596060438,"score_gpt":0.2544963150106071,"score_spread":0.21311253905000271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041990688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009659539,0.00001758357,0.9885449,0.003189129,0.00023560313,0.00024062161,0.00006125869,0.00018671858,0.0065582315],"genre_scores_gemma":[0.8747465,0.000052533745,0.12428166,0.00035410773,0.0000029739779,0.00018055704,0.000017199676,0.000008349708,0.00035613932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987917,0.00024145085,0.0003704075,0.00014352633,0.00031847265,0.00013442237],"domain_scores_gemma":[0.9971747,0.00023166485,0.00021322387,0.00216494,0.00016118812,0.000054298696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023253543,0.00010166488,0.00012686598,0.0003125727,0.00092066603,0.000042976746,0.002105424,0.000034483593,0.00015840279],"category_scores_gemma":[0.000009660953,0.00011922671,0.00009895937,0.0009790108,0.00012409469,0.0005444726,0.00003533216,0.00037740477,0.00003217165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016529739,0.000954086,0.0000068931204,0.0000149447715,0.00008774957,0.0000016892751,0.006160123,0.91493225,0.0014847217,0.055458855,0.0016410769,0.019241089],"study_design_scores_gemma":[0.0007991049,0.00025547578,0.00020660243,0.00001975596,0.00003459626,0.000025471682,0.0008149992,0.968082,0.011101111,0.0019574875,0.016333919,0.0003694562],"about_ca_topic_score_codex":0.000043622877,"about_ca_topic_score_gemma":0.000023417571,"teacher_disagreement_score":0.87378055,"about_ca_system_score_codex":0.00013994072,"about_ca_system_score_gemma":0.00008214663,"threshold_uncertainty_score":0.70811117},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"National Natural Science Foundation of China","keywords":"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","score_opus":0.0244651112847504,"score_gpt":0.25236688654312495,"score_spread":0.22790177525837454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3044716756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014196462,0.000026675682,0.9339526,0.050157774,0.00005542876,0.00050214224,0.000048314036,0.00017193731,0.0008886201],"genre_scores_gemma":[0.5629781,0.000022838047,0.43152902,0.004931066,0.00003448411,0.00007072888,0.00041935334,0.000009442101,0.0000049872174],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988446,0.00010952318,0.0005111118,0.00015536214,0.00023398883,0.00014537685],"domain_scores_gemma":[0.9975729,0.00027827994,0.0004327889,0.001258161,0.00038271386,0.000075131626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017963086,0.00012987418,0.0001699145,0.00014120074,0.00018713175,0.00015114315,0.0018072131,0.000064116175,0.0000044828075],"category_scores_gemma":[0.00018032905,0.0001472895,0.00008438633,0.00046913468,0.00011801332,0.0021362493,0.0002243798,0.00014112778,0.000032621643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000255786,0.00025369567,0.00009592208,0.00013486703,0.00035283607,0.0000018771365,0.25141716,0.44214982,0.06877553,0.18279037,0.037909996,0.01586213],"study_design_scores_gemma":[0.00085352483,0.000068994865,0.0002118532,0.00003562977,0.000020466736,0.0000015722541,0.0028297685,0.97531694,0.006153616,0.00016535426,0.014090373,0.00025189348],"about_ca_topic_score_codex":0.00006974628,"about_ca_topic_score_gemma":0.000003348611,"teacher_disagreement_score":0.54878163,"about_ca_system_score_codex":0.00011740995,"about_ca_system_score_gemma":0.000058011152,"threshold_uncertainty_score":0.60062915},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Cache; Reinforcement learning; Markov decision process; Scheduling (production processes); Performance metric; Queue; Exploit; Distributed computing; Computer network; Markov process; Artificial intelligence","score_opus":0.020471961162631912,"score_gpt":0.23608658742402702,"score_spread":0.2156146262613951,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3045606678","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005751384,0.0000074824134,0.99007124,0.0005986435,0.000028181445,0.00034932306,4.899397e-8,0.00012852809,0.008241405],"genre_scores_gemma":[0.7400603,0.0000026516707,0.25872228,0.0009773764,0.000005686003,0.000027782113,0.000020511978,0.000003911134,0.00017945262],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999278,0.000018480125,0.0002464362,0.00015498305,0.00014406123,0.0001580182],"domain_scores_gemma":[0.9996865,0.00002257636,0.000086739594,0.000100318706,0.000046745266,0.00005716959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013676082,0.00007457971,0.00008969496,0.00006422946,0.00007032599,0.00010105543,0.0003071813,0.000029916806,0.000008612502],"category_scores_gemma":[0.00007454102,0.000070774506,0.000028385712,0.00019232194,0.0000060687207,0.00085954426,0.00008675199,0.00008864084,0.000012137735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005066919,0.000005123094,0.00007906293,0.00001605849,0.0000028708375,3.3050674e-7,0.0024648365,0.98984355,0.000024924635,0.004032257,0.000030901796,0.0034950282],"study_design_scores_gemma":[0.00055109983,0.00005545763,0.00008708395,0.0000043132773,7.9550915e-7,0.000001136434,0.00021086777,0.99881935,0.000044369564,0.00001768923,0.0001214156,0.00008643212],"about_ca_topic_score_codex":0.00000931009,"about_ca_topic_score_gemma":0.0000025754796,"teacher_disagreement_score":0.7394852,"about_ca_system_score_codex":0.000057974692,"about_ca_system_score_gemma":0.000013219724,"threshold_uncertainty_score":0.28861007},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09909636978250341,"score_gpt":0.26506996450509246,"score_spread":0.16597359472258905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082773235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039665014,0.00019096928,0.9553734,0.0037631732,0.00013392365,0.0005674221,0.000028777931,0.000056827732,0.0002205052],"genre_scores_gemma":[0.99148875,0.000005259554,0.008288132,0.00015465914,0.00004554956,0.0000023407997,0.0000048202364,0.0000046678338,0.000005833883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983219,0.000013853384,0.00056383316,0.00025984115,0.0007187951,0.000121764926],"domain_scores_gemma":[0.9973175,0.000089689216,0.0008714962,0.00056673965,0.0010916609,0.00006292123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016739387,0.00011346724,0.00039523764,0.00021450208,0.000107166125,0.00013941516,0.0027611107,0.000028170782,2.7921223e-7],"category_scores_gemma":[0.0015322411,0.00008268478,0.00011277085,0.0011277132,0.000031512052,0.00036432513,0.00065975526,0.00004992211,2.3958896e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020306626,0.00021055505,0.07918795,0.003314269,0.006707487,1.7990313e-7,0.0059200455,0.8029611,0.008111066,0.0782691,0.009276427,0.0058387415],"study_design_scores_gemma":[0.00035766905,0.00004489432,0.0021366565,0.00011955237,0.0004907038,1.2405278e-7,0.0001417616,0.9958894,0.00055245624,0.00004742244,0.00013432009,0.000085027335],"about_ca_topic_score_codex":0.0000031805828,"about_ca_topic_score_gemma":2.0091778e-7,"teacher_disagreement_score":0.9518237,"about_ca_system_score_codex":0.000023877568,"about_ca_system_score_gemma":0.00003217241,"threshold_uncertainty_score":0.51308763},"labels":[],"label_agreement":null},{"id":"W3089314236","doi":"10.1109/tmc.2020.3025201","title":"Low-Latency and Fresh Content Provision in Information-Centric Vehicular Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":63,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"National Key Research and Development Program of China; Beijing Municipal Natural Science Foundation","keywords":"Computer science; Cache; Latency (audio); Content delivery; Computer network; Information-centric networking; Bandwidth (computing); Telecommunications","score_opus":0.012585359209285336,"score_gpt":0.20514561151961874,"score_spread":0.1925602523103334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089314236","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04542158,0.00004026815,0.9530205,0.0003763948,0.00027360165,0.0005553384,0.0000017107595,0.00020897927,0.000101636506],"genre_scores_gemma":[0.98317903,0.0000528976,0.015775103,0.0009305285,0.000025095365,0.000021488106,0.0000049296173,0.00000704874,0.0000038593653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987206,0.00005280269,0.00052643125,0.00021733207,0.00024329874,0.00023955974],"domain_scores_gemma":[0.9993216,0.00008928403,0.00016277819,0.00019841726,0.0001003535,0.00012761235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018883227,0.00015525628,0.00016462126,0.00020406293,0.00020493098,0.00022790475,0.0002934825,0.00008630605,0.0000126610585],"category_scores_gemma":[0.000012685898,0.00015607067,0.000049664075,0.000738514,0.000024391316,0.001748942,0.000011793622,0.00029553947,0.00003791032],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007514798,0.000032504042,0.00004945684,0.000023852928,0.0000048942015,0.0000024919095,0.0015741504,0.8900344,0.00001667385,0.00013423123,0.00002944876,0.10809042],"study_design_scores_gemma":[0.00067552074,0.00013166854,0.00029737156,0.000067055145,0.0000033469194,0.0000067286746,0.00016908417,0.99757487,0.00079684716,0.000008342514,0.000109108616,0.0001600758],"about_ca_topic_score_codex":0.000013432837,"about_ca_topic_score_gemma":0.000001929266,"teacher_disagreement_score":0.9377575,"about_ca_system_score_codex":0.000067805675,"about_ca_system_score_gemma":0.00004133232,"threshold_uncertainty_score":0.6364377},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07284640101408263,"score_gpt":0.25803506421209965,"score_spread":0.18518866319801702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101422709","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015707288,0.0000018709418,0.9936171,0.00068613637,0.0019918515,0.0011564108,0.000082245824,0.00033617526,0.0005574468],"genre_scores_gemma":[0.90242493,0.0000217732,0.09506385,0.0015454584,0.0004952919,0.00015681688,0.00022981128,0.000028753811,0.000033328353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970877,0.00005685318,0.0017784535,0.00014235202,0.00054563495,0.0003890012],"domain_scores_gemma":[0.99765825,0.0002805446,0.0009394207,0.0004221796,0.0004392814,0.0002603242],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00045575973,0.00030871193,0.00042746504,0.00036014908,0.00035938516,0.00041156996,0.00085559697,0.0005899677,0.00002582011],"category_scores_gemma":[0.00010392658,0.00031760504,0.00022472149,0.0012624591,0.000076018325,0.0050813654,0.000012657261,0.00071903056,0.00004351937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018077824,0.000047111636,0.0000031988334,0.000058177622,0.00006815648,4.7029437e-7,0.0027839292,0.8445751,0.000009258831,0.0012236095,0.0015638905,0.14948629],"study_design_scores_gemma":[0.003311408,0.0003885876,0.0000015471262,0.00010016971,0.000042578547,0.000005155013,0.0010980627,0.9880748,0.0036836055,0.000016943814,0.0029491603,0.0003280216],"about_ca_topic_score_codex":0.000012361495,"about_ca_topic_score_gemma":0.0000015140636,"teacher_disagreement_score":0.9008542,"about_ca_system_score_codex":0.00019018886,"about_ca_system_score_gemma":0.00036137342,"threshold_uncertainty_score":0.9999276},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.025470318116579623,"score_gpt":0.2382778940647458,"score_spread":0.21280757594816618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3102260691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038513571,0.000011076967,0.9933853,0.0006032321,0.000112879476,0.0003828308,0.0000011655048,0.000090354304,0.0015618027],"genre_scores_gemma":[0.4222414,0.0000026441649,0.5772685,0.00041825793,0.000014729652,0.000018968321,0.000019847526,0.0000025789207,0.000013119462],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991604,0.000011325132,0.0005041874,0.00007881928,0.00013245788,0.000112772555],"domain_scores_gemma":[0.99942446,0.00006540604,0.0001925903,0.00013286526,0.00014027747,0.000044414497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020974592,0.00006738737,0.00012132603,0.0001256746,0.000028979608,0.00011683996,0.00030747216,0.000049877737,0.0000031526922],"category_scores_gemma":[0.0001933004,0.00006440326,0.000030494357,0.0003116082,0.00000838431,0.0028918728,0.000075740936,0.000045486402,0.000019096407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013109178,0.000010298909,0.00019693628,0.0002549173,0.0000060001985,4.6344593e-7,0.008222374,0.9458529,0.00025795554,0.039913565,0.00020906184,0.005062426],"study_design_scores_gemma":[0.00050870626,0.00002723113,0.00008578743,0.00002948573,0.0000010143156,5.073709e-7,0.00044117952,0.99701005,0.0011083509,0.00002236606,0.00069157785,0.000073760166],"about_ca_topic_score_codex":0.00001535033,"about_ca_topic_score_gemma":9.36509e-7,"teacher_disagreement_score":0.41839004,"about_ca_system_score_codex":0.000023606213,"about_ca_system_score_gemma":0.000035469086,"threshold_uncertainty_score":0.26262888},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02389606884763176,"score_gpt":0.2579933767222226,"score_spread":0.23409730787459085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3107053738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058404854,0.0000316365,0.99306357,0.0005603721,0.00014428832,0.00026056147,0.000002858485,0.000023691598,0.0000725253],"genre_scores_gemma":[0.74523133,0.000025083953,0.2544602,0.00017376366,0.0000211654,0.0000036949095,0.000002900425,0.0000075229286,0.00007438802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989522,0.00006164034,0.00054788037,0.00010245987,0.00024125335,0.000094556635],"domain_scores_gemma":[0.9987726,0.00009883152,0.0005660507,0.00006738925,0.0004010736,0.00009402499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042747628,0.00009593188,0.00019770626,0.00009037199,0.000045545494,0.00014869431,0.00032022965,0.00003947094,0.000011769461],"category_scores_gemma":[0.00006998614,0.000079835154,0.000038684328,0.00009358255,0.000031595453,0.0008332285,0.000032012234,0.00012237072,0.000001479941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002056338,0.000027570575,0.000029573146,0.0002559623,0.000061054016,0.0000037828338,0.024018323,0.93939406,0.0041659772,0.0006755715,0.003223133,0.02793939],"study_design_scores_gemma":[0.0005677272,0.00047574824,0.000012800011,0.00017128597,0.0000070683113,0.00005699816,0.00008490762,0.96797967,0.030291282,0.00020560496,0.000073011935,0.000073918614],"about_ca_topic_score_codex":0.000012816214,"about_ca_topic_score_gemma":5.0636654e-8,"teacher_disagreement_score":0.73939085,"about_ca_system_score_codex":0.000028556933,"about_ca_system_score_gemma":0.000064265005,"threshold_uncertainty_score":0.32555833},"labels":[],"label_agreement":null},{"id":"W3110243076","doi":"10.48550/arxiv.2012.02051","title":"Reinforcement Learning in Decentralized Stochastic Control Systems with Partial History Sharing","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Reinforcement learning; Computer science; Partially observable Markov decision process; Markov decision process; Benchmark (surveying); Decentralised system; Optimal control; Class (philosophy); Representation (politics); Information sharing; Mathematical optimization; Control (management); Markov process; Markov chain; Artificial intelligence; Markov model; Machine learning; Mathematics","score_opus":0.050802451928874934,"score_gpt":0.1672835236424104,"score_spread":0.11648107171353546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3110243076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00858407,0.000042970245,0.98894477,0.0000691289,0.00037921636,0.00054775097,7.706851e-7,0.00028683132,0.0011445173],"genre_scores_gemma":[0.9984658,0.000023829323,0.0008758982,0.000083757695,0.000027915461,0.000004364645,0.000021697595,0.000013604452,0.00048313604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852514,0.00008983732,0.00031913337,0.0006126781,0.00014989292,0.00030331285],"domain_scores_gemma":[0.9987189,0.000044350032,0.0004701686,0.0004904354,0.0001238285,0.0001522991],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00021370946,0.0002452853,0.0003250135,0.00024859374,0.00007506467,0.00012098288,0.0009914113,0.0001449276,0.000026691998],"category_scores_gemma":[0.000047562025,0.00027781285,0.0000671462,0.00028631248,0.0000459584,0.0007263454,0.0006392045,0.000540764,0.00004299839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079457226,0.000010830783,0.0006646968,0.000063284584,0.00003786173,0.00009015784,0.0007388548,0.9541873,0.0000019626693,0.044059966,0.00004148848,0.000024155543],"study_design_scores_gemma":[0.001540935,0.000058113023,0.00010742872,0.00017796314,0.000029985946,0.0000027856036,0.00007779172,0.9973025,0.0000021469775,0.00012823257,0.00027354716,0.00029861488],"about_ca_topic_score_codex":0.00016318855,"about_ca_topic_score_gemma":0.000009768573,"teacher_disagreement_score":0.98988175,"about_ca_system_score_codex":0.0012329848,"about_ca_system_score_gemma":0.00032600056,"threshold_uncertainty_score":0.9999674},"labels":[],"label_agreement":null},{"id":"W3111189508","doi":"10.1109/tmc.2020.3042925","title":"Online Altitude Control and Scheduling Policy for Minimizing AoI in UAV-assisted IoT Wireless Networks","year":2020,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":126,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Markov decision process; Lyapunov optimization; Scheduling (production processes); Reinforcement learning; Computer network; Base station; Online algorithm; Optimization problem; Upload; Wireless; Channel state information; Software deployment; Wireless network; Real-time computing; Markov process; Distributed computing; Mathematical optimization; Telecommunications; Artificial intelligence","score_opus":0.017582990612235838,"score_gpt":0.2640407087262677,"score_spread":0.2464577181140319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3111189508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05072679,0.000044183762,0.94670016,0.0014221935,0.00021691446,0.00062610285,0.000008862384,0.00023509993,0.000019670164],"genre_scores_gemma":[0.8282045,0.000016198446,0.1702039,0.0013756498,0.00014056347,0.000034153276,0.0000044348553,0.000016499465,0.000004109672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854827,0.00006379384,0.00052768545,0.00036384858,0.00016277077,0.00033362175],"domain_scores_gemma":[0.9990134,0.0003679121,0.00018331615,0.00019927767,0.00009502868,0.00014106827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022815564,0.00019303709,0.00027055907,0.00023519948,0.00029152972,0.00017422502,0.000335144,0.000104893494,0.0000020081977],"category_scores_gemma":[0.000022475422,0.0002139586,0.00007844024,0.00069438166,0.000035128072,0.0003600449,0.000008180146,0.00028817877,0.000002469215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022817674,0.00007116493,0.000018582154,0.000030243005,0.000015372872,0.0000017237764,0.0009819935,0.87670535,0.00015184811,0.00018865125,0.0000049020255,0.12180736],"study_design_scores_gemma":[0.0017174573,0.00013986001,0.00018501999,0.00009345226,0.000008959605,0.000009064243,0.00018178528,0.9970815,0.0003285865,0.000010512132,0.000044749802,0.00019903512],"about_ca_topic_score_codex":0.000022873137,"about_ca_topic_score_gemma":0.000016174241,"teacher_disagreement_score":0.7774777,"about_ca_system_score_codex":0.00009576807,"about_ca_system_score_gemma":0.00009051298,"threshold_uncertainty_score":0.8724978},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 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","score_opus":0.04134386294706945,"score_gpt":0.2586858165439218,"score_spread":0.21734195359685235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3113239520","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008113962,0.000039367882,0.9880511,0.0026834437,0.00013025799,0.0007349313,0.000044986482,0.00013742346,0.000064489075],"genre_scores_gemma":[0.889948,0.0002962995,0.10865237,0.0007794135,0.0000037385776,0.0001861975,0.000117630836,0.0000108720715,0.0000054521593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860084,0.00009844868,0.00075683655,0.00015254175,0.00018811195,0.00020324205],"domain_scores_gemma":[0.99817556,0.00018662855,0.000324456,0.00094070466,0.00027580376,0.00009684135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015387124,0.00015757268,0.00024058874,0.00022569824,0.00023138014,0.00010113733,0.0014182284,0.000106247986,0.0000040146415],"category_scores_gemma":[0.000019943589,0.0001748598,0.00012025974,0.00056029315,0.00008927394,0.0014524632,0.000022244083,0.00027451996,0.000016282822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029913153,0.000092546856,0.000013142344,0.00002492853,0.00003094965,3.2759507e-7,0.0015815825,0.97700465,0.00031818348,0.0021779398,0.0000058365345,0.01872001],"study_design_scores_gemma":[0.0009174257,0.000080721795,0.000057681253,0.00005693799,0.0000126691975,0.000002481957,0.00018621821,0.996514,0.001827763,0.000034290162,0.00015636467,0.0001534454],"about_ca_topic_score_codex":0.000028684994,"about_ca_topic_score_gemma":0.00010565319,"teacher_disagreement_score":0.8818341,"about_ca_system_score_codex":0.00011304377,"about_ca_system_score_gemma":0.00005326291,"threshold_uncertainty_score":0.7130576},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04652460839753812,"score_gpt":0.2402356073179888,"score_spread":0.19371099892045068,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3115760506","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007002531,0.0000020822295,0.9845547,0.0052784174,0.00062770623,0.0013287063,0.00008190766,0.00041642104,0.0007075067],"genre_scores_gemma":[0.96368045,0.000020604753,0.030353267,0.0050150044,0.00012074578,0.00035197145,0.00031265625,0.00003248623,0.00011283951],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972877,0.00008748371,0.0014569062,0.00017640379,0.00054818246,0.0004433387],"domain_scores_gemma":[0.9979476,0.00019370142,0.00065534154,0.00026460664,0.00071430026,0.0002244587],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039686498,0.0003433901,0.00036699933,0.00047509393,0.0004843091,0.0007408432,0.0006787388,0.0005319173,0.000055273576],"category_scores_gemma":[0.00017138533,0.00035961543,0.000087424014,0.001848727,0.000043736978,0.009301973,0.000018786188,0.0010180152,0.0001907857],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005540274,0.00019557728,0.00014236855,0.0002732481,0.00014053573,0.0000022776035,0.05568799,0.85901314,0.000033298642,0.0011861066,0.008680127,0.074091315],"study_design_scores_gemma":[0.0035911286,0.00032417334,0.000012822352,0.000121689816,0.000017569744,0.000003380802,0.0033363563,0.97318214,0.0039757174,0.000046821,0.014953532,0.00043468352],"about_ca_topic_score_codex":0.000087845954,"about_ca_topic_score_gemma":0.00003343062,"teacher_disagreement_score":0.9566779,"about_ca_system_score_codex":0.00024522305,"about_ca_system_score_gemma":0.0005494242,"threshold_uncertainty_score":0.99988556},"labels":[],"label_agreement":null},{"id":"W3129196275","doi":"","title":"Practical Marginalized Importance Sampling with the Successor Representation","year":2021,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Successor cardinal; Reinforcement learning; Representation (politics); Computer science; Sampling (signal processing); Variety (cybernetics); Artificial intelligence; Bridge (graph theory); Machine learning; Simple random sample; Mathematics; Sociology; Political science; Detector","score_opus":0.05150774906842189,"score_gpt":0.329534315317081,"score_spread":0.2780265662486591,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129196275","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018445016,0.000009251744,0.9518191,0.0288297,0.000043714903,0.00008835367,1.6339365e-7,0.00009747536,0.017267695],"genre_scores_gemma":[0.089689925,0.000011854277,0.9067738,0.0018985152,0.00002731704,0.000016573867,0.000012088061,0.0000043504865,0.001565559],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992829,0.000045632325,0.0001446831,0.00015454751,0.00026633145,0.00010591605],"domain_scores_gemma":[0.999056,0.00015134213,0.00011448533,0.0003991545,0.00024878822,0.000030257941],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018857665,0.0000556426,0.000057725945,0.00002020147,0.00012935144,0.00032323442,0.00020032571,0.000019925757,0.00016907572],"category_scores_gemma":[0.00013590929,0.000033846347,0.000017671795,0.00043661174,0.000022410668,0.0016231199,0.00008389655,0.00006965,0.000033373417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043721313,0.000072388924,0.00568882,0.000018750634,0.0000504462,0.00008669162,0.0019029588,0.023490727,0.00027759245,0.9383955,0.023245543,0.0067268773],"study_design_scores_gemma":[0.0013200925,0.000059323884,0.0126796905,0.000024186866,0.00002079344,0.000578884,0.0016745317,0.94677514,0.011986984,0.002017709,0.02246118,0.0004014613],"about_ca_topic_score_codex":0.0000052929236,"about_ca_topic_score_gemma":0.000017729923,"teacher_disagreement_score":0.93637776,"about_ca_system_score_codex":0.000020654108,"about_ca_system_score_gemma":0.0001196677,"threshold_uncertainty_score":0.3116957},"labels":[],"label_agreement":null},{"id":"W3129280655","doi":"10.1109/globecom42002.2020.9348172","title":"Age-optimal Transmission Policy for Markov Source with Differential Encoding","year":2020,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Encoding (memory); Computer science; Transmission (telecommunications); Markov decision process; Markov process; Markov chain; Metric (unit); Differential coding; Channel (broadcasting); Differential (mechanical device); Exploit; Reliability (semiconductor); Markov model; Algorithm; Mathematical optimization; Real-time computing; Decoding methods; Mathematics; Computer network; Statistics; Telecommunications; Artificial intelligence","score_opus":0.012903170918839224,"score_gpt":0.2263157607396021,"score_spread":0.2134125898207629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129280655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011568732,0.0000021159346,0.986362,0.006426237,0.000022553706,0.00022083116,7.6180237e-7,0.00026019916,0.0055484436],"genre_scores_gemma":[0.35049924,0.000003141666,0.6471412,0.0014508337,0.00011650861,0.000013142142,0.0000109028,0.000009233157,0.00075578445],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929017,0.000012484604,0.00016572917,0.00017381486,0.00018326768,0.00017451702],"domain_scores_gemma":[0.99959373,0.00003184704,0.00006162298,0.00012829913,0.000052801905,0.00013170787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0000442081,0.00010071199,0.000095588846,0.00006700799,0.00012257732,0.00018479573,0.0003657682,0.000037131922,0.000061654486],"category_scores_gemma":[0.0000216963,0.00007521776,0.000042071457,0.00025210375,0.000016720021,0.0007336251,0.000059371876,0.00005253355,0.000011865398],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003945095,0.00010085446,0.00009326821,0.00023794583,0.00006932561,0.000011832405,0.026111165,0.19934204,0.00513002,0.10551616,0.010430197,0.6525627],"study_design_scores_gemma":[0.00062395545,0.00015641878,0.00005169022,0.00000989028,0.0000035445476,0.0000041421,0.00005809553,0.98873246,0.0031593419,0.000029514662,0.007039543,0.00013142575],"about_ca_topic_score_codex":0.0000054575203,"about_ca_topic_score_gemma":3.3217265e-7,"teacher_disagreement_score":0.7893904,"about_ca_system_score_codex":0.000021084072,"about_ca_system_score_gemma":0.00006149773,"threshold_uncertainty_score":0.30672914},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Network packet; Index (typography); Internet of Things; Computer network; Computer security","score_opus":0.034387412106320604,"score_gpt":0.28051106873420456,"score_spread":0.24612365662788396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130754803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021282766,0.000015055128,0.9717141,0.000119481876,0.000282471,0.00019831306,0.0000017420481,0.000050677398,0.0063353963],"genre_scores_gemma":[0.717726,0.000005006659,0.28140023,0.0007199497,0.000038229427,0.000027609356,0.00002587423,0.000005010154,0.00005209634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989296,0.000044104516,0.0004456537,0.00013365688,0.00024823015,0.00019875246],"domain_scores_gemma":[0.9991702,0.00003683173,0.00018087594,0.00035865224,0.00019513132,0.000058309815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026434558,0.000093837414,0.00015259182,0.00019875981,0.000045632536,0.00030876152,0.00072384573,0.00006853599,0.000006996318],"category_scores_gemma":[0.00009442289,0.00009940552,0.000030177514,0.0013386871,0.000013337605,0.00302484,0.00027110995,0.00009422708,0.000019214236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000060172247,0.000048841815,0.0021945082,0.000045662277,0.000005421029,0.000002777194,0.0032536853,0.9822344,0.000029329954,0.0008722404,0.0013841627,0.009922921],"study_design_scores_gemma":[0.00052146654,0.0000104435285,0.014501358,0.00005435487,0.0000016303508,0.000005318781,0.00013523441,0.98158437,0.0020200268,0.000116203155,0.0008936915,0.00015587485],"about_ca_topic_score_codex":0.00003567549,"about_ca_topic_score_gemma":0.000025902495,"teacher_disagreement_score":0.69644326,"about_ca_system_score_codex":0.000049953647,"about_ca_system_score_gemma":0.000092938055,"threshold_uncertainty_score":0.40536395},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; 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","score_opus":0.014462316075915572,"score_gpt":0.23934820400292534,"score_spread":0.22488588792700975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3133575899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008201372,0.00004816809,0.9877279,0.0019177131,0.0005568576,0.00027807162,0.0000034031104,0.0010648083,0.0002017028],"genre_scores_gemma":[0.5689675,0.0000055860955,0.43074423,0.00014901404,0.000012895623,0.000036574962,0.0000029484004,0.000011807046,0.00006941362],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986741,0.000038374914,0.00037237533,0.00041861704,0.00016914555,0.00032737837],"domain_scores_gemma":[0.9986945,0.00011593189,0.00015540488,0.0005706347,0.00040738666,0.000056169643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017278019,0.00017861511,0.00021845831,0.00045819063,0.00048393974,0.00011025721,0.00048674547,0.00028019247,0.000011281682],"category_scores_gemma":[0.000036460977,0.00020429358,0.00013365562,0.001072839,0.000069430855,0.0004662839,0.000011142963,0.00033633056,0.000040691742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058253986,0.00013851932,0.000005113965,0.000017244874,0.00008326499,0.000025423371,0.0002738239,0.7471544,0.003301243,0.0143037625,0.00002671131,0.23466462],"study_design_scores_gemma":[0.00048470366,0.00009696164,0.00002050438,0.000053252712,0.000017299353,0.00012672956,0.00021536408,0.8956797,0.10213773,0.0005276693,0.0004320011,0.00020806184],"about_ca_topic_score_codex":0.0000017248764,"about_ca_topic_score_gemma":0.000008244432,"teacher_disagreement_score":0.56076616,"about_ca_system_score_codex":0.00016436643,"about_ca_system_score_gemma":0.00017066547,"threshold_uncertainty_score":0.833085},"labels":[],"label_agreement":null},{"id":"W3136113879","doi":"10.22323/1.390.0976","title":"Diversity and Inclusion Activities in the Belle II Collaboration","year":2021,"lang":"en","type":"article","venue":"Proceedings of 40th International Conference on High Energy physics — PoS(ICHEP2020)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Inclusion (mineral); Diversity (politics); Presentation (obstetrics); Session (web analytics); Representation (politics); Computer science; Population; Sociology; World Wide Web; Political science; Social science; Medicine","score_opus":0.018138862206429376,"score_gpt":0.233993596841844,"score_spread":0.21585473463541463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3136113879","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9058819,0.000025943462,0.05571793,0.009665393,0.00032801976,0.00014652363,0.00001697409,0.00006534355,0.02815197],"genre_scores_gemma":[0.9948108,0.00015876697,0.004058157,0.00066244724,0.000069475725,0.000014538356,0.000029468032,0.0000051134184,0.00019120674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986309,0.000017706068,0.00025277634,0.00026435635,0.00070801127,0.00012627924],"domain_scores_gemma":[0.99860436,0.000059430015,0.00028110427,0.00011130792,0.0009086999,0.000035130306],"candidate_categories":["sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.00021731846,0.00014213321,0.00014739862,0.00011309701,0.0025777146,0.00009880493,0.0007927038,0.000064334796,0.000015656899],"category_scores_gemma":[0.00006145482,0.00012790732,0.00003166453,0.0004914653,0.00006052182,0.0019027082,0.012225416,0.00012893522,6.789348e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020983094,0.00009891544,0.00045347647,0.000010381152,0.0000159022,0.0000014551456,0.02708884,0.00039741647,0.0014488028,0.969228,0.00011176549,0.0011240195],"study_design_scores_gemma":[0.0014975527,0.00036780044,0.0029668657,0.00021456894,0.000020098221,0.000015534635,0.0041336305,0.29527584,0.10575272,0.5880899,0.001116761,0.0005487207],"about_ca_topic_score_codex":0.00010435568,"about_ca_topic_score_gemma":0.000017915623,"teacher_disagreement_score":0.38113812,"about_ca_system_score_codex":0.00008135364,"about_ca_system_score_gemma":0.00009797285,"threshold_uncertainty_score":0.99872077},"labels":[],"label_agreement":null},{"id":"W3157985989","doi":"10.1109/jiot.2021.3076925","title":"Optimizing Information Freshness in MEC-Assisted Status Update Systems With Heterogeneous Energy Harvesting Devices","year":2021,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Key Research and Development Program of China; Shenzhen Research Institute of Big Data; Natural Science Foundation of Beijing Municipality","keywords":"Computer science; Randomness; Energy harvesting; Scheduling (production processes); Edge computing; Distributed computing; Real-time computing; Edge device; Enhanced Data Rates for GSM Evolution; Energy (signal processing); Mathematical optimization; Telecommunications","score_opus":0.010066680922714113,"score_gpt":0.21289696097229296,"score_spread":0.20283028004957884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157985989","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04529923,0.00021331491,0.9522497,0.00010401996,0.000697877,0.000054265027,0.0000014099646,0.00005650937,0.0013236665],"genre_scores_gemma":[0.85283285,0.000050025916,0.14659266,0.0003914307,0.000033412347,0.0000045047746,0.000011355084,0.000009571384,0.00007415086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793184,0.00012277465,0.0009565472,0.0001419971,0.0005388204,0.00030800237],"domain_scores_gemma":[0.99770504,0.00006288181,0.0011490698,0.00023275417,0.00072804606,0.0001222298],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00047936372,0.00016873177,0.0002585653,0.00038236374,0.00008123076,0.0012176244,0.00061526406,0.000078313424,0.000014268882],"category_scores_gemma":[0.00008428277,0.00014816417,0.000056497083,0.00043841908,0.000028620272,0.00856573,0.00013009513,0.00026237298,0.0000060106254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004938279,0.000048160142,0.00074144,0.00012252046,0.00009755554,0.00018579648,0.008770587,0.96592903,0.00031563037,0.002835704,0.00022646438,0.020677717],"study_design_scores_gemma":[0.000732278,0.0000813982,0.00023578445,0.00078936224,0.000009785523,0.0023166337,0.0004762209,0.9819752,0.011686482,0.00004528405,0.0014314319,0.00022013458],"about_ca_topic_score_codex":0.00030444094,"about_ca_topic_score_gemma":0.000048256705,"teacher_disagreement_score":0.8075337,"about_ca_system_score_codex":0.00018774542,"about_ca_system_score_gemma":0.0002205876,"threshold_uncertainty_score":0.9998192},"labels":[],"label_agreement":null},{"id":"W3166948032","doi":"10.48550/arxiv.2106.06854","title":"A Deep Reinforcement Learning Approach to Marginalized Importance Sampling with the Successor Representation","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Successor cardinal; Reinforcement learning; Representation (politics); Computer science; Sampling (signal processing); Artificial intelligence; Bridge (graph theory); Machine learning; Simple random sample; Reinforcement; Variety (cybernetics); Mathematics; Engineering; Detector; Sociology; Law; Political science","score_opus":0.057222629226841716,"score_gpt":0.19769679435100856,"score_spread":0.14047416512416686,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166948032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027445817,0.00000778849,0.95911,0.00032755188,0.000028230688,0.00018341329,8.084092e-8,0.00010026585,0.012796821],"genre_scores_gemma":[0.9559463,0.000014111436,0.041505504,0.00032748157,0.000013920621,0.000002248079,0.000017146804,0.0000059953127,0.0021672416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991647,0.00006872334,0.00012879411,0.00033327192,0.00012190504,0.00018260948],"domain_scores_gemma":[0.99901456,0.000054269218,0.00015610817,0.0004598802,0.00024259304,0.00007257977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017939362,0.00010010196,0.000095116615,0.000079476704,0.00029144716,0.0001659229,0.0004772635,0.000029787445,0.000026597183],"category_scores_gemma":[0.00004954694,0.000085464184,0.00003683249,0.0012657823,0.00002710176,0.0010595502,0.00020511441,0.00011442486,0.000027470252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020323483,0.000010491745,0.0014063884,0.0000059894796,0.000014681764,0.000015120331,0.00088762137,0.92069334,0.000015997179,0.07669377,0.000051279003,0.00018500641],"study_design_scores_gemma":[0.0004119586,0.000027305636,0.00089929136,0.000009341168,0.000011171493,0.000011452009,0.00095505774,0.99655986,0.00018455484,0.00018267667,0.0006157603,0.00013159709],"about_ca_topic_score_codex":0.0000147813735,"about_ca_topic_score_gemma":0.000012639924,"teacher_disagreement_score":0.92850053,"about_ca_system_score_codex":0.000094454095,"about_ca_system_score_gemma":0.000066657936,"threshold_uncertainty_score":0.34851283},"labels":[],"label_agreement":null},{"id":"W3168197022","doi":"","title":"Improved Regret Bound and Experience Replay in Regularized Policy Iteration","year":2021,"lang":"en","type":"article","venue":"International Conference on Machine Learning","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Markov decision process; Computer science; Function (biology); Computation; Mathematical optimization; Upper and lower bounds; Bellman equation; Simple (philosophy); Function approximation; Algorithm; Markov process; Mathematics; Artificial neural network; Artificial intelligence; Machine learning","score_opus":0.018731941990948114,"score_gpt":0.2950064456519339,"score_spread":0.27627450366098577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3168197022","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15118411,0.000053847234,0.7880596,0.018498767,0.00048843137,0.00022454084,0.0000050916233,0.00023374462,0.04125189],"genre_scores_gemma":[0.97002417,0.00007144042,0.02676416,0.0007276516,0.000053795957,0.000017605227,0.00007154986,0.0000069015646,0.0022627157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987917,0.00011364493,0.00031796,0.0003326308,0.00029280467,0.00015128215],"domain_scores_gemma":[0.9991965,0.00006214756,0.00017635412,0.00022687687,0.0002842033,0.000053917287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002498238,0.00012531488,0.000118738666,0.00027411978,0.000115523115,0.00064393034,0.0003424369,0.000060158134,0.00013340343],"category_scores_gemma":[0.0007817723,0.00012936932,0.000025034878,0.0003037145,0.00003465868,0.0012419433,0.00019904638,0.0002829858,0.000012747297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006951272,0.000065260756,0.0061618467,0.0000132299365,0.000020470005,0.00005662948,0.008518128,0.009240217,0.01755689,0.91095626,0.00003300767,0.04730856],"study_design_scores_gemma":[0.00058460026,0.00004455439,0.002494855,0.000053873664,6.928429e-7,0.000045556877,0.00013568721,0.9916584,0.0017658843,0.00210566,0.0009694129,0.00014082817],"about_ca_topic_score_codex":0.00010101342,"about_ca_topic_score_gemma":0.00004335465,"teacher_disagreement_score":0.9824182,"about_ca_system_score_codex":0.00010866389,"about_ca_system_score_gemma":0.00015739647,"threshold_uncertainty_score":0.62094355},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Science, Technology and Innovation Commission of Shenzhen Municipality; 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","score_opus":0.1064839323359109,"score_gpt":0.30545701768773714,"score_spread":0.19897308535182623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3170007158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027634617,0.00011358627,0.9882828,0.009469704,0.0005690261,0.00047769948,0.00004910167,0.0003102539,0.0004514675],"genre_scores_gemma":[0.5671532,0.00010365629,0.43124953,0.000742822,0.000010718975,0.000075235606,0.000028495939,0.000017278795,0.00061902765],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985186,0.00017115261,0.00050500885,0.00028537298,0.00024482384,0.0002750559],"domain_scores_gemma":[0.9965877,0.0004980516,0.00011774372,0.002072678,0.0005892059,0.00013460357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002506833,0.00018723558,0.00019035376,0.00017858345,0.0010345549,0.00022928989,0.0009718205,0.00009171113,0.000020501682],"category_scores_gemma":[0.00004504271,0.00020901635,0.00020788563,0.00043642047,0.000084679596,0.00054516067,0.000013161064,0.0003130138,0.000048940878],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003069311,0.0020766002,0.0000048806205,0.00010984507,0.00028490368,0.000007701193,0.011555901,0.75469095,0.012465369,0.01681707,0.00084509456,0.20111099],"study_design_scores_gemma":[0.00093306514,0.000053185962,0.00005247482,0.000067678426,0.000042976128,0.00003800518,0.00047525702,0.97536343,0.0149932485,0.000119396056,0.0075873504,0.00027392225],"about_ca_topic_score_codex":0.000029385197,"about_ca_topic_score_gemma":0.00025442155,"teacher_disagreement_score":0.5668769,"about_ca_system_score_codex":0.00019431167,"about_ca_system_score_gemma":0.00025724314,"threshold_uncertainty_score":0.8523439},"labels":[],"label_agreement":null},{"id":"W3187977197","doi":"10.1109/icc42927.2021.9500930","title":"Random Access with and without Sensing in Non-Terrestrial Networks for Timely Updates","year":2021,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Research and Development; National Natural Science Foundation of China","keywords":"Aloha; Computer science; Computer network; Random access; Network packet; Markov chain; Performance metric; Transmission (telecommunications); Latency (audio); Real-time computing; Propagation delay; Metric (unit); Stochastic geometry; Wireless; Throughput; Telecommunications","score_opus":0.012572465477111158,"score_gpt":0.25527841253803746,"score_spread":0.2427059470609263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3187977197","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011792263,0.000011537488,0.98603475,0.000448123,0.000098766104,0.00022312318,2.2484896e-7,0.000039201626,0.0013520042],"genre_scores_gemma":[0.6001936,0.000010799528,0.39913484,0.00042562356,0.000056833116,0.00000544788,0.000015831156,0.0000055646788,0.00015143184],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946874,0.000018991474,0.0001605541,0.00014680391,0.00008184357,0.00012307287],"domain_scores_gemma":[0.99962413,0.00007309302,0.00006238421,0.00013929038,0.00006817506,0.000032906555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015955146,0.00006931905,0.00011323252,0.000051344738,0.000055408414,0.0004644528,0.0001357009,0.000034154833,0.0000053977187],"category_scores_gemma":[0.000025073554,0.000054679585,0.000012108814,0.00022194991,0.00001550849,0.0013236311,0.00010753661,0.000045040375,0.000001088674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042701061,0.00002716568,0.0035780168,0.000021818068,0.000030271327,0.000014911599,0.0008560062,0.9321861,0.000025152638,0.001755334,0.0016342766,0.05944391],"study_design_scores_gemma":[0.003222287,0.00001875464,0.00035367813,0.00002460036,0.0000026577295,0.000018457496,0.000022016411,0.99546766,0.00061154243,0.00008123265,0.000091098926,0.00008600585],"about_ca_topic_score_codex":0.000014779912,"about_ca_topic_score_gemma":0.00005935158,"teacher_disagreement_score":0.5884014,"about_ca_system_score_codex":0.0000113888145,"about_ca_system_score_gemma":0.00005061285,"threshold_uncertainty_score":0.4478729},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Computer science; 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","score_opus":0.019741462074132216,"score_gpt":0.2644563411045447,"score_spread":0.24471487903041247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191484621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024534808,0.00009872459,0.97030646,0.003573454,0.00018354019,0.0007516645,0.000013562332,0.0005184497,0.000019362486],"genre_scores_gemma":[0.8593325,0.00003122113,0.13869016,0.0012148326,0.000013121638,0.0006084901,0.000029228837,0.000030907464,0.000049567447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982116,0.00006034251,0.00040998578,0.0005923886,0.000260499,0.00046513396],"domain_scores_gemma":[0.9985262,0.00012848222,0.00018330097,0.0005396322,0.00054685853,0.000075492186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023411388,0.00027743002,0.00029937434,0.0006775368,0.00027921365,0.00015924178,0.00064839184,0.0003986991,0.000010921682],"category_scores_gemma":[0.000036220452,0.00027684623,0.00011274028,0.0018239713,0.00013172947,0.0007412692,0.000013704597,0.0004966534,0.000011666374],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048037426,0.00035701436,0.00006457703,0.000039973336,0.00006882266,0.00008507671,0.000121626996,0.9861228,0.00041754852,0.00031873625,0.00003244681,0.01232337],"study_design_scores_gemma":[0.0023797941,0.00016191887,0.000076795026,0.0001913717,0.000024617762,0.000039765866,0.00016251243,0.88880384,0.10760105,0.0000761913,0.0001772696,0.0003048517],"about_ca_topic_score_codex":0.0000072170888,"about_ca_topic_score_gemma":0.00005369413,"teacher_disagreement_score":0.8347977,"about_ca_system_score_codex":0.00013817508,"about_ca_system_score_gemma":0.00019604171,"threshold_uncertainty_score":0.99996835},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National 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","score_opus":0.007968541285158708,"score_gpt":0.2068045061829934,"score_spread":0.1988359648978347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202685228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004027464,0.000024192745,0.993963,0.00041404736,0.00019574085,0.00021749797,1.8338507e-7,0.00051782554,0.00064002495],"genre_scores_gemma":[0.8466815,0.00006882014,0.15273948,0.00023529728,0.00000991197,0.000092579714,0.00001977545,0.000011306133,0.00014136072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986588,0.00005385251,0.000473927,0.00023967373,0.00023862699,0.00033513948],"domain_scores_gemma":[0.99922645,0.00002143929,0.0001268693,0.0004415667,0.00013830654,0.000045393514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020275675,0.000178571,0.00018492677,0.00064888876,0.00019833095,0.00012161228,0.0003771821,0.00029357005,0.000025254132],"category_scores_gemma":[0.000013201306,0.00018966805,0.00007403722,0.001314436,0.000053274824,0.0014080144,0.000015242277,0.00062299956,0.00006990584],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058836968,0.00004248528,0.0000060861453,0.000015748941,0.000018825694,0.000019279109,0.00062409823,0.9793057,0.000086920234,0.0011872437,0.000003644962,0.018684126],"study_design_scores_gemma":[0.0005292428,0.00007295141,0.000008408724,0.00002957062,0.0000063750813,0.00007375226,0.00040314658,0.9905093,0.007389531,0.000059999984,0.0007255559,0.0001921966],"about_ca_topic_score_codex":0.0000061118476,"about_ca_topic_score_gemma":0.0000075080147,"teacher_disagreement_score":0.842654,"about_ca_system_score_codex":0.00017349214,"about_ca_system_score_gemma":0.000054558477,"threshold_uncertainty_score":0.7734438},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010982691264381644,"score_gpt":0.24093604330248777,"score_spread":0.22995335203810613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205916482","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043104193,0.000032384738,0.9866049,0.0010503363,0.00014162326,0.00016924436,1.4233733e-7,0.00017603252,0.011394281],"genre_scores_gemma":[0.053645227,0.000017440549,0.9453368,0.00044090234,0.00014875471,1.1287254e-7,0.00001683595,0.000010869029,0.00038304192],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992234,0.00003457107,0.0001722293,0.00022334127,0.0001639974,0.00018245164],"domain_scores_gemma":[0.9991085,0.00017479947,0.000116863695,0.00030716826,0.0002426922,0.000049970822],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016092518,0.00008661323,0.00009226924,0.00007787874,0.00032142282,0.0002054335,0.00012790345,0.00004844222,0.0000036830195],"category_scores_gemma":[0.00013175809,0.00009862231,0.000053980057,0.00035254975,0.0000119700035,0.00029674647,0.00007745979,0.000110768786,0.000037068858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013410751,0.0000031894774,0.0000015158153,0.000013039913,0.000006079752,0.0000031362022,0.0004381983,0.18136354,0.0004577378,0.008081323,0.00007823122,0.80955267],"study_design_scores_gemma":[0.00012570508,0.000014147029,0.000015328067,0.000033685654,0.0000033053548,0.000022319517,0.00007625516,0.9770953,0.0029788758,0.0008707902,0.018653829,0.00011045105],"about_ca_topic_score_codex":0.000003075982,"about_ca_topic_score_gemma":0.0000033291767,"teacher_disagreement_score":0.8094422,"about_ca_system_score_codex":0.00007121545,"about_ca_system_score_gemma":0.000056891295,"threshold_uncertainty_score":0.40217012},"labels":[],"label_agreement":null},{"id":"W3208101745","doi":"10.5281/zenodo.1164584","title":"Mad Twinnet Pre-Trained Weights","year":2018,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Concordia University","funders":"","keywords":"Computer science; Remote sensing; Geology","score_opus":0.028991168178320516,"score_gpt":0.16235866964450668,"score_spread":0.13336750146618617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208101745","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08799656,0.000002311384,0.8814083,0.000113963884,0.00019790311,0.00009599578,0.000001136745,0.00025611452,0.029927766],"genre_scores_gemma":[0.9801894,0.0000069905896,0.014837838,0.0002784285,0.00007055333,1.7879505e-7,0.0000043595965,0.0000050250696,0.0046072253],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930716,0.000034115114,0.00011479874,0.00027760575,0.00006585446,0.0002004673],"domain_scores_gemma":[0.9991162,0.000028126833,0.000097294746,0.00048993324,0.00017360483,0.0000948586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011039019,0.000103099504,0.0000813915,0.00014978531,0.00017819661,0.0000721308,0.0007728515,0.00006194043,0.00014540934],"category_scores_gemma":[0.000019847743,0.000109335546,0.000043869888,0.00068126695,0.00009195014,0.0016414373,0.00019137202,0.000063150525,0.0006587613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025142239,0.00004732112,0.0010258595,0.000008057703,0.000024302219,0.000037873047,0.0012337117,0.019226654,0.00004816585,0.97317576,0.003271622,0.0018754993],"study_design_scores_gemma":[0.00043885616,0.00009671998,0.0026756902,0.000009599075,0.000006419117,0.0000058012556,0.000034858487,0.9815373,0.0006081991,0.009305247,0.005090762,0.0001905565],"about_ca_topic_score_codex":0.000012864884,"about_ca_topic_score_gemma":0.000008924024,"teacher_disagreement_score":0.9638705,"about_ca_system_score_codex":0.00006380499,"about_ca_system_score_gemma":0.000049212333,"threshold_uncertainty_score":0.84672636},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01708750433916642,"score_gpt":0.24134447943258633,"score_spread":0.2242569750934199,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3208711628","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010941083,0.000048300622,0.9940582,0.00023468565,0.0024161558,0.0010504221,0.000101843165,0.0004521145,0.0005441831],"genre_scores_gemma":[0.9294078,0.00008333525,0.068547115,0.00024461132,0.00004889535,0.0006714987,0.00026959603,0.00002735619,0.0006998003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975447,0.00009130515,0.0011687839,0.00036454262,0.00048912666,0.0003415419],"domain_scores_gemma":[0.9974756,0.00021985576,0.00035595847,0.00047375535,0.0013278559,0.00014692642],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003667135,0.0002938539,0.0003280383,0.00038802007,0.00051879784,0.00065648236,0.00039234303,0.00017370595,0.00007233544],"category_scores_gemma":[0.000017729204,0.00031314025,0.0001968557,0.0008028866,0.00003089674,0.0041781203,9.762646e-7,0.00020782376,0.0001100949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002235461,0.000076713164,0.000004527491,0.00010664365,0.00007526929,0.0000034230432,0.0066860123,0.974689,0.00023207483,0.012151518,0.00015111371,0.005801365],"study_design_scores_gemma":[0.0008357703,0.00012922766,0.000034025798,0.00018785153,0.000046471225,0.000018261577,0.0027048788,0.89143145,0.09681281,0.000054264503,0.007276392,0.00046862464],"about_ca_topic_score_codex":0.00003248217,"about_ca_topic_score_gemma":0.000062984975,"teacher_disagreement_score":0.9283137,"about_ca_system_score_codex":0.00023983722,"about_ca_system_score_gemma":0.00031198392,"threshold_uncertainty_score":0.99993205},"labels":[],"label_agreement":null},{"id":"W3212374164","doi":"10.1109/lwc.2021.3125625","title":"Age- and Correlation-Aware Information Gathering","year":2021,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Metric (unit); Set (abstract data type); Ant colony optimization algorithms; Correlation; Optimization problem; Process (computing); Data mining; Artificial intelligence; Algorithm; Mathematics; Engineering","score_opus":0.014406053489598707,"score_gpt":0.22794838047702304,"score_spread":0.21354232698742434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212374164","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016554894,0.000055707074,0.970164,0.010723227,0.00019462481,0.000124444,0.0000034480938,0.00022245011,0.0019571953],"genre_scores_gemma":[0.84880066,0.0002501293,0.14640991,0.004279642,0.00001851452,0.000041862444,0.00013133691,0.000008826896,0.000059134287],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908316,0.00009548529,0.00035553673,0.00012151107,0.00019611133,0.00014819251],"domain_scores_gemma":[0.9979977,0.00013477393,0.00018248435,0.0014306875,0.00019295156,0.00006139987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016078522,0.000112049296,0.00010958681,0.00013422409,0.00038270457,0.00043895602,0.00086713623,0.000055208184,0.000007902207],"category_scores_gemma":[0.000036158614,0.00012916968,0.000034172437,0.00046337827,0.000092593385,0.0034544407,0.0003641376,0.00018005744,0.00007950306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012054307,0.00021785071,0.0035375168,0.00020215008,0.00018371824,0.000049800536,0.03950368,0.18987262,0.010786062,0.3067958,0.016188588,0.43265015],"study_design_scores_gemma":[0.00035549048,0.000006766236,0.0025619445,0.00005361002,0.000007237432,0.00005323065,0.00029804037,0.9852542,0.0008221233,0.00016325573,0.010172549,0.00025155072],"about_ca_topic_score_codex":0.000014485895,"about_ca_topic_score_gemma":0.000011747486,"teacher_disagreement_score":0.83224577,"about_ca_system_score_codex":0.000065444634,"about_ca_system_score_gemma":0.000056890458,"threshold_uncertainty_score":0.52673864},"labels":[],"label_agreement":null},{"id":"W3217127449","doi":"10.1109/twc.2021.3127872","title":"Real-Time Status Updates in Wireless HARQ With Imperfect Feedback Channel","year":2021,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Channel (broadcasting); Hybrid automatic repeat request; Network packet; Real-time computing; Computer network; Wireless; Automatic repeat request; Telecommunications link; Telecommunications","score_opus":0.013953942912442747,"score_gpt":0.24057389352131894,"score_spread":0.2266199506088762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217127449","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037899658,0.000041334344,0.95313895,0.002814188,0.0001445715,0.0003911162,0.000050105118,0.0004531924,0.005066864],"genre_scores_gemma":[0.94545615,0.0022549925,0.05112102,0.00021901385,0.000009608498,0.00020571648,0.00009635817,0.000035980633,0.0006011639],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979518,0.00029258145,0.00053958304,0.00039813292,0.0003643657,0.00045354973],"domain_scores_gemma":[0.9960612,0.00034539503,0.00019426944,0.0028285738,0.00040400747,0.00016652487],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023816909,0.00027455259,0.0003065551,0.0003775659,0.0005738118,0.00028783738,0.0014906853,0.00013251763,0.000086789194],"category_scores_gemma":[0.0000072128896,0.0002806571,0.00009211619,0.0017732681,0.0001667795,0.0016255161,0.000033575277,0.00048660758,0.00025237308],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002620732,0.006100072,0.0003719354,0.00020752462,0.0005578753,0.00008907482,0.02179578,0.71953446,0.025840258,0.04939497,0.0015633707,0.17428258],"study_design_scores_gemma":[0.0015432867,0.00013935333,0.00078151294,0.00022673908,0.00002905187,0.000061783,0.000565795,0.9612153,0.034242395,0.00016619805,0.00039875033,0.0006298274],"about_ca_topic_score_codex":0.00020343585,"about_ca_topic_score_gemma":0.0005874063,"teacher_disagreement_score":0.9075565,"about_ca_system_score_codex":0.00026218785,"about_ca_system_score_gemma":0.000425087,"threshold_uncertainty_score":0.99996454},"labels":[],"label_agreement":null},{"id":"W4200194043","doi":"10.1109/icftic54370.2021.9647130","title":"Minimizing AoI under Covertness Constraints in Internet of Things Networks","year":2021,"lang":"en","type":"article","venue":"2021 IEEE 3rd International Conference on Frontiers Technology of Information and Computer (ICFTIC)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Retransmission; Transmission (telecommunications); Constraint (computer-aided design); Computer science; Transmitter; Network packet; Upper and lower bounds; Expression (computer science); The Internet; Real-time computing; Computer network; Mathematical optimization; Algorithm; Engineering; Mathematics; Telecommunications","score_opus":0.011274365213930874,"score_gpt":0.2223090792652237,"score_spread":0.21103471405129282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4200194043","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007662071,0.000036090874,0.9825048,0.0018095154,0.001137051,0.00012792002,0.000003629276,0.000056731016,0.0066621816],"genre_scores_gemma":[0.7327452,0.00021798957,0.2658752,0.0009816095,0.000016337717,0.000011366818,0.000055288117,0.0000052906817,0.00009177953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983758,0.000040574858,0.0008566539,0.00021008399,0.00033087013,0.00018601916],"domain_scores_gemma":[0.99832356,0.00004750113,0.000552545,0.0002908967,0.0007379205,0.000047559013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023258312,0.00017761512,0.000314692,0.0008168893,0.000035782257,0.00013812278,0.00073277054,0.00022101532,0.00007824289],"category_scores_gemma":[0.000051523155,0.00018911157,0.000057178153,0.0005034136,0.00027459158,0.002133026,0.00027529764,0.00026713448,0.000009296439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004382985,0.00009394987,0.0010921026,0.000042044252,0.00011217407,0.0000066476614,0.0018802562,0.011800512,0.00006625905,0.6861834,0.002343441,0.2963354],"study_design_scores_gemma":[0.00083793356,0.00008465798,0.00037383277,0.00020834884,0.0000047716508,0.00003233948,0.0008589406,0.9913138,0.0027807092,0.0028977904,0.00043211895,0.00017474925],"about_ca_topic_score_codex":0.000010932425,"about_ca_topic_score_gemma":0.0000021824922,"teacher_disagreement_score":0.9795133,"about_ca_system_score_codex":0.00007771851,"about_ca_system_score_gemma":0.00016478862,"threshold_uncertainty_score":0.77117455},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Engineering Link (Canada)","funders":"","keywords":"Metric (unit); Computer science; Data science; Engineering; Operations management","score_opus":0.023800387625240577,"score_gpt":0.2725903291630559,"score_spread":0.24878994153781533,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205984110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024150105,0.00016282292,0.97013915,0.0006529158,0.00032168167,0.00009151618,0.0000018232572,0.00003778587,0.026177274],"genre_scores_gemma":[0.93113434,0.000090105335,0.0683164,0.00007354347,0.000068904614,0.000004431841,0.000038597507,0.0000023027558,0.00027138536],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994124,0.000011854755,0.0002781301,0.000085068,0.00010855351,0.000103975304],"domain_scores_gemma":[0.9993273,0.000047974925,0.0002704525,0.00027504942,0.000042357922,0.00003687114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016120383,0.000067602035,0.000103271406,0.0003002511,0.00030942267,0.00064384146,0.00023460017,0.00003568345,0.000019207117],"category_scores_gemma":[0.00004589876,0.000067496185,0.000015767684,0.00031809212,0.00006067701,0.003263775,0.00016957679,0.00005696026,0.0000021498458],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016851083,0.000004722588,0.0022103945,0.000004572946,0.00000627351,8.894033e-7,0.0014784072,0.0023901765,3.754708e-7,0.083514504,0.00038417688,0.91000384],"study_design_scores_gemma":[0.0017946969,0.00006840642,0.22587496,0.000114422655,0.000013236703,0.000022100585,0.00010918871,0.6906187,0.000014444254,0.005291645,0.07575927,0.00031894477],"about_ca_topic_score_codex":0.0000886096,"about_ca_topic_score_gemma":0.000047272544,"teacher_disagreement_score":0.92871934,"about_ca_system_score_codex":0.000015815338,"about_ca_system_score_gemma":0.000020625486,"threshold_uncertainty_score":0.62085783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Science and Technology 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","score_opus":0.0280532183693484,"score_gpt":0.2718902866566433,"score_spread":0.24383706828729487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206090210","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008180131,0.000009046003,0.9798369,0.0018673998,0.00013457178,0.016747529,0.0000095875075,0.00042493833,0.0008882192],"genre_scores_gemma":[0.6772283,0.0000509149,0.22249378,0.00044093866,0.000007787502,0.099153794,0.000053755462,0.00004010171,0.0005306509],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731535,0.0009310193,0.00065302156,0.00033604863,0.00043373683,0.0003308477],"domain_scores_gemma":[0.99719137,0.00034257094,0.00022107197,0.0019830973,0.000144128,0.00011773808],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006634823,0.00024502823,0.00022750706,0.00058460305,0.0013709047,0.000119901015,0.002271463,0.00010042293,0.00013029629],"category_scores_gemma":[0.0000054626985,0.00026521133,0.00010587631,0.002493866,0.00011710693,0.0010181826,0.000036770336,0.0010458094,0.000021006968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065657696,0.0006379613,0.0000029463824,0.000007643994,0.000015507005,0.0000043163536,0.0016878489,0.9425612,0.00011221817,0.005987574,0.00023248006,0.04868463],"study_design_scores_gemma":[0.0010990655,0.00017445101,0.00004807351,0.000057993322,0.000006688022,0.000016051396,0.00031141724,0.9861379,0.00067400455,0.0001622205,0.011036529,0.0002755601],"about_ca_topic_score_codex":0.0001451733,"about_ca_topic_score_gemma":0.00006423129,"teacher_disagreement_score":0.7573431,"about_ca_system_score_codex":0.000502152,"about_ca_system_score_gemma":0.00023152385,"threshold_uncertainty_score":0.99998003},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.013357239077374412,"score_gpt":0.24722619445922678,"score_spread":0.23386895538185237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206186328","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11449999,0.000053448668,0.8831827,0.00016750631,0.0008387083,0.000056795696,2.675842e-7,0.000026604452,0.0011739555],"genre_scores_gemma":[0.80411065,0.000017640721,0.19542083,0.00035113795,0.000041901643,5.597037e-7,0.0000054650836,0.000004864131,0.000046979843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799997,0.000089835165,0.0012118644,0.000103490354,0.00039210162,0.00020271537],"domain_scores_gemma":[0.9978279,0.000112437025,0.0012080598,0.00021678825,0.00056618545,0.00006865075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007535558,0.00012472583,0.0002618953,0.00038300472,0.00004131019,0.00030668903,0.00081118365,0.00010353468,0.00002457019],"category_scores_gemma":[0.00023450414,0.00012392669,0.000112391834,0.00049282506,0.000038323975,0.003185627,0.00018487874,0.00038128832,0.0000049525543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006746254,0.00018607826,0.0027795555,0.00017217099,0.00010337117,0.000119553,0.0383479,0.8119191,0.0019986862,0.0016073145,0.0023306364,0.14036821],"study_design_scores_gemma":[0.0007048431,0.000044126715,0.0035805295,0.00044281015,0.0000052347564,0.00025230693,0.00021573018,0.97969997,0.014614748,0.00011959044,0.00019769408,0.00012239],"about_ca_topic_score_codex":0.00002929432,"about_ca_topic_score_gemma":0.0000037542325,"teacher_disagreement_score":0.6896106,"about_ca_system_score_codex":0.00009658772,"about_ca_system_score_gemma":0.00010900246,"threshold_uncertainty_score":0.50535834},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.050383136464494375,"score_gpt":0.2603911029343829,"score_spread":0.2100079664698885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226072761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072129915,0.00002924576,0.99409044,0.002089333,0.00057637144,0.0010461083,0.00006455874,0.00073685485,0.0006457982],"genre_scores_gemma":[0.97348255,0.00003429888,0.023123255,0.00029680273,0.000048054928,0.0022692776,0.00027090427,0.00005128099,0.00042356653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975432,0.00036366846,0.0006671299,0.0005054902,0.00047328055,0.00044721251],"domain_scores_gemma":[0.9962584,0.0005113519,0.0004103285,0.0024857963,0.00019225854,0.00014189006],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0006582124,0.0002936466,0.00031332442,0.00050526607,0.0036380535,0.0003471754,0.0037504944,0.00015610545,0.00006357193],"category_scores_gemma":[0.000011343491,0.00035362647,0.00023870562,0.0016511499,0.00013654266,0.00078001496,0.00008584855,0.0012804301,0.000011287832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047943315,0.0005522685,0.000022831493,0.0000138320975,0.00004885599,4.703399e-7,0.0004057333,0.9736701,0.000014243935,0.005792264,0.00030158495,0.019129835],"study_design_scores_gemma":[0.0014411649,0.00016996487,0.0000190102,0.000028209808,0.000033311757,0.000012212799,0.00046812097,0.9944982,0.0002954048,0.000073470364,0.0025894747,0.0003714805],"about_ca_topic_score_codex":0.00007649759,"about_ca_topic_score_gemma":0.000064264255,"teacher_disagreement_score":0.9727613,"about_ca_system_score_codex":0.00061116106,"about_ca_system_score_gemma":0.0002963346,"threshold_uncertainty_score":0.9998916},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03980238100395153,"score_gpt":0.27217620526519853,"score_spread":0.232373824261247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226408066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008986709,0.000077428085,0.9941983,0.00093124766,0.0018016337,0.0011237238,0.0004973293,0.00020257781,0.00026903918],"genre_scores_gemma":[0.994278,0.000058759262,0.0041710776,0.0003939408,0.00004083299,0.0004437584,0.00040791882,0.000025370038,0.00018030289],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966482,0.0004355774,0.00089602894,0.0005980544,0.0011255636,0.0002965846],"domain_scores_gemma":[0.9980771,0.00014104292,0.00030845744,0.0011329788,0.00027036885,0.000070060014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009426619,0.00025578943,0.0002381366,0.0005551303,0.0005279719,0.00029680872,0.0018286647,0.00008385382,0.00021772417],"category_scores_gemma":[0.0000057152247,0.00023475755,0.000108246975,0.0014906154,0.000046993544,0.0017237519,0.0000046357923,0.00047440076,0.000033024306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044129232,0.00021750074,0.000004420695,0.000016578922,0.00003963344,0.000014192972,0.010610123,0.9789606,0.000014191374,0.009484818,0.00016905257,0.00042480495],"study_design_scores_gemma":[0.00050993124,0.000111485875,0.000087680906,0.00002554513,0.00003552195,0.00004021877,0.024823355,0.9732283,0.00018711103,0.00014888294,0.00052847574,0.00027354035],"about_ca_topic_score_codex":0.0004893149,"about_ca_topic_score_gemma":0.0003001736,"teacher_disagreement_score":0.99337935,"about_ca_system_score_codex":0.00041352148,"about_ca_system_score_gemma":0.0001793277,"threshold_uncertainty_score":0.9573135},"labels":[],"label_agreement":null},{"id":"W4235344571","doi":"10.1049/pbpc033e_ch8","title":"Human-in-the-loop models for multi-access edge computing","year":2020,"lang":"en","type":"book-chapter","venue":"Institution of Engineering and Technology eBooks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; Institut National d'Optique","funders":"","keywords":"Loop (graph theory); Human-in-the-loop; Computer science; Edge computing; Enhanced Data Rates for GSM Evolution; Distributed computing; Human–computer interaction; Telecommunications; Mathematics","score_opus":0.041308308041168716,"score_gpt":0.2560313995214374,"score_spread":0.21472309148026866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235344571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007463852,0.000097278295,0.9724811,0.00020079856,0.00013646149,0.0003921676,0.000004769951,0.00030452912,0.026308257],"genre_scores_gemma":[0.6803368,0.000029615927,0.31414628,0.00022703038,0.00010482198,0.000084202446,0.000033677297,0.000050613846,0.0049869586],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991686,0.000002589965,0.00037724353,0.00022069419,0.00010404815,0.00012682448],"domain_scores_gemma":[0.9993794,0.000023440722,0.00019529236,0.00027046842,0.000108981796,0.00002240928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001316176,0.00018254577,0.00023761987,0.0004936566,0.000098277276,0.000055607918,0.0006920959,0.00031151526,3.2898586e-7],"category_scores_gemma":[0.00003052599,0.0001752488,0.000042477117,0.00006473153,0.00011310319,0.00023415542,0.00021231316,0.00028028424,0.0000010167628],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.9852143e-7,0.000003211438,6.6969443e-7,0.00009121909,0.000011415792,0.000003380083,0.00011481727,0.063677765,0.000033345143,0.93108964,0.000023285607,0.0049505555],"study_design_scores_gemma":[0.00042234588,0.0000496435,0.0000020653372,0.00022334354,0.000009664221,0.000020884103,0.000006734253,0.98511034,0.00033378243,0.009535273,0.004085512,0.00020041267],"about_ca_topic_score_codex":0.0000018040473,"about_ca_topic_score_gemma":0.0000015128185,"teacher_disagreement_score":0.9215544,"about_ca_system_score_codex":0.00003158012,"about_ca_system_score_gemma":0.00004614357,"threshold_uncertainty_score":0.7146439},"labels":[],"label_agreement":null},{"id":"W4243595961","doi":"10.32920/14668875","title":"Priority-Based Machine-To-Machine Overlay Network over LTE for a Smart City","year":2021,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer network; Computer science; Handshake; LTE Advanced; Cellular network; Telecommunications link","score_opus":0.014820259736101701,"score_gpt":0.2619314803594743,"score_spread":0.24711122062337257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243595961","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006356602,0.00008821066,0.9877952,0.0018539275,0.0018571948,0.0013499882,0.000051935407,0.000527466,0.0058404547],"genre_scores_gemma":[0.031238368,0.000012386916,0.95795405,0.008102901,0.0002719818,0.00020883704,0.0006292453,0.000034268498,0.0015479428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736977,0.00009748311,0.00069870095,0.0007737142,0.00057728135,0.00048303115],"domain_scores_gemma":[0.9971763,0.00021777686,0.00040281808,0.0015063002,0.00046102345,0.00023581095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008454709,0.00042993535,0.00048522744,0.00020253976,0.00022831779,0.0009707536,0.0014497368,0.0003171149,0.0002745973],"category_scores_gemma":[0.0002008721,0.00041886792,0.00031126954,0.00052821275,0.000022100285,0.00067143346,0.0019844573,0.00049347826,0.000030413947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000343868,0.00008398151,0.0020233712,0.00019930466,0.00006584061,0.0000058294813,0.00030578554,0.9673632,0.0000040368363,0.010522255,0.01403776,0.005354282],"study_design_scores_gemma":[0.00056320144,0.000048915554,0.0022400545,0.000111896465,0.000016338177,0.000002170339,0.000002094635,0.982096,0.00010333571,0.0007092229,0.013608696,0.00049803505],"about_ca_topic_score_codex":0.00022953427,"about_ca_topic_score_gemma":0.00019576114,"teacher_disagreement_score":0.030602708,"about_ca_system_score_codex":0.00019223738,"about_ca_system_score_gemma":0.0005819874,"threshold_uncertainty_score":0.9998263},"labels":[],"label_agreement":null},{"id":"W4251040394","doi":"10.5194/acp-2018-720-rc1","title":"Distribution of the ratio of ground-based measurements at noon and time of satellite overpass needs explanation","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Noon; Satellite; Distribution (mathematics); Environmental science; Meteorology; Remote sensing; Computer science; Aeronautics; Aerospace engineering; Geography; Engineering; Mathematics; Atmospheric sciences; Geology","score_opus":0.023157146941827203,"score_gpt":0.22394006128914234,"score_spread":0.20078291434731516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251040394","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08401093,0.000035204906,0.91250855,0.0001856172,0.00021081975,0.00043665254,0.000041247597,0.000028759398,0.0025422438],"genre_scores_gemma":[0.9871419,0.000019640314,0.012297686,0.00004390676,0.000014113603,0.0000084221865,0.00030086318,0.000005097266,0.00016834069],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998435,0.00009125739,0.0006040591,0.00015292142,0.0006299309,0.00008678649],"domain_scores_gemma":[0.99740136,0.000047945057,0.0010729174,0.0005604931,0.000891761,0.000025554275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005518412,0.00013430312,0.00021007724,0.00012062079,0.000051917854,0.000038421804,0.0004865556,0.0001367082,0.00003176679],"category_scores_gemma":[0.00009761477,0.00010372518,0.00006328308,0.00032632062,0.00010075527,0.00039856922,0.0005093492,0.00006653727,0.000004397247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088189595,0.0014593591,0.07598173,0.0077127526,0.0010690157,8.396953e-7,0.028225962,0.6202525,0.07983958,0.11327067,0.014199765,0.05710594],"study_design_scores_gemma":[0.0005714255,0.000086058215,0.030876728,0.00026817454,0.000032469092,9.999395e-7,0.000024685265,0.7525267,0.21477725,0.0005257297,0.000118723525,0.00019103316],"about_ca_topic_score_codex":0.00005196461,"about_ca_topic_score_gemma":0.0000059750887,"teacher_disagreement_score":0.903131,"about_ca_system_score_codex":0.00014652727,"about_ca_system_score_gemma":0.00013930921,"threshold_uncertainty_score":0.422979},"labels":[],"label_agreement":null},{"id":"W4280610782","doi":"10.1109/wcnc51071.2022.9771933","title":"Age of Information-Limited Capacity of Uncoordinated Massive Access Using Massive MIMO","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Wireless Communications and Networking Conference (WCNC)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Telecommunications link; Network packet; Base station; Limiting; Random access; Upper and lower bounds; Channel state information; Computer network; Computer science; MIMO; Transmission (telecommunications); Performance metric; Topology (electrical circuits); Metric (unit); Limit (mathematics); Stochastic geometry; Channel (broadcasting); Mathematics; Wireless; Telecommunications; Statistics; Combinatorics; Engineering; Mathematical analysis","score_opus":0.06372987904595094,"score_gpt":0.278300771601083,"score_spread":0.21457089255513206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280610782","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14140818,0.00019546885,0.8538196,0.00072582875,0.0004729975,0.00056879525,0.000075896336,0.00011497755,0.0026182828],"genre_scores_gemma":[0.9777811,0.00051134644,0.021270355,0.00012798687,0.000013444178,0.00006467154,0.00020268254,0.00000897005,0.000019436478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980328,0.00033947206,0.0007997878,0.00018091383,0.00040997448,0.00023703536],"domain_scores_gemma":[0.99659425,0.00027105137,0.0011749858,0.0013385607,0.0005485942,0.00007257623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005142763,0.00018264216,0.00033879152,0.0003774328,0.0007579977,0.00021018443,0.0025505729,0.00007278997,0.000042551455],"category_scores_gemma":[0.000025281865,0.0002047414,0.00006733808,0.0014560531,0.00028440368,0.001926958,0.0018867188,0.00038549773,8.938138e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000117300515,0.00060610066,0.007471121,0.00039674345,0.0004577802,0.000009628726,0.033774365,0.4688129,0.0062587517,0.27716047,0.0011336246,0.20380121],"study_design_scores_gemma":[0.0004092876,0.00006154704,0.00043397114,0.00008712457,0.000020993086,0.000008355427,0.00089297816,0.99495023,0.00048582995,0.0008158431,0.0016162005,0.0002176377],"about_ca_topic_score_codex":0.0002851546,"about_ca_topic_score_gemma":0.00003506223,"teacher_disagreement_score":0.8363729,"about_ca_system_score_codex":0.000116513176,"about_ca_system_score_gemma":0.00022130697,"threshold_uncertainty_score":0.8349112},"labels":[],"label_agreement":null},{"id":"W4285253777","doi":"10.1109/jiot.2022.3182006","title":"Age-Optimal Network Coding HARQ Scheme for Satellite-Based Internet of Things","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Retransmission; Computer science; Hybrid automatic repeat request; Network packet; Fading; Computer network; Transmission (telecommunications); Real-time computing; Automatic repeat request; Linear network coding; Channel (broadcasting); Algorithm; Telecommunications link; Telecommunications","score_opus":0.019323779974720144,"score_gpt":0.24495504028500595,"score_spread":0.2256312603102858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285253777","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022440488,0.000113814865,0.97399604,0.00047462952,0.0016733025,0.00021636291,0.0000024755357,0.00007017626,0.0010127026],"genre_scores_gemma":[0.5511351,0.000010847866,0.4469843,0.0011054297,0.00010648278,0.000012654466,0.000009118237,0.000019335996,0.0006167267],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974737,0.000109273395,0.0011003829,0.00023132993,0.0007179174,0.00036736057],"domain_scores_gemma":[0.9973728,0.00022571096,0.001592318,0.000296114,0.00040028399,0.00011276462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019027374,0.00020421288,0.00035963574,0.00031949877,0.00016378897,0.00029119023,0.0019197101,0.00007157631,0.00017402519],"category_scores_gemma":[0.00014091439,0.00020586737,0.000283222,0.00032315715,0.00007820824,0.0021393208,0.00037235385,0.00057952065,0.000005362998],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012060842,0.00048487616,0.0018752599,0.00048628353,0.00060326076,0.00012543213,0.060105804,0.7489774,0.007823214,0.04234679,0.09511803,0.04084753],"study_design_scores_gemma":[0.00095494644,0.00051755056,0.00003596101,0.00022778807,0.000017075625,0.00016083964,0.00015292404,0.9718266,0.019179836,0.000764141,0.0059382985,0.00022402772],"about_ca_topic_score_codex":0.000030513047,"about_ca_topic_score_gemma":3.935922e-7,"teacher_disagreement_score":0.5286946,"about_ca_system_score_codex":0.00020438668,"about_ca_system_score_gemma":0.00014298789,"threshold_uncertainty_score":0.83950275},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.059858787999661,"score_gpt":0.3227953658612915,"score_spread":0.2629365778616305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285274232","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000014804008,0.0000048764664,0.9631397,0.002338789,0.000119595126,0.032319084,0.00004440159,0.0002058158,0.0018129186],"genre_scores_gemma":[0.15146442,0.000008068122,0.4888691,0.0008338826,0.0000071296436,0.35806873,0.000052873937,0.000028728045,0.00066705805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984542,0.0002238965,0.0005876695,0.00020476965,0.00035179156,0.00017768597],"domain_scores_gemma":[0.9963779,0.00056747126,0.00034060195,0.002422289,0.00023332721,0.000058431622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053610053,0.00015030874,0.00019466071,0.00035524854,0.00070756057,0.00016745785,0.004781474,0.000045757024,0.00014366063],"category_scores_gemma":[0.000022491591,0.00015872027,0.00018325432,0.00065309834,0.00012111188,0.0011867877,0.000073864685,0.00032522812,0.000006112504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065956183,0.0017292326,0.000008783831,0.00013775217,0.00010599058,0.0000011447022,0.0058630295,0.92373604,0.00027090916,0.015007199,0.0033213012,0.049159076],"study_design_scores_gemma":[0.004345191,0.00028625643,0.000014537434,0.00003715779,0.000019449883,0.000004844502,0.000085376145,0.95822567,0.010048821,0.00068164483,0.026039053,0.00021201972],"about_ca_topic_score_codex":0.00005989508,"about_ca_topic_score_gemma":0.00002105981,"teacher_disagreement_score":0.4742706,"about_ca_system_score_codex":0.00012527994,"about_ca_system_score_gemma":0.00016843113,"threshold_uncertainty_score":0.8885248},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026387626722981908,"score_gpt":0.2708400054447694,"score_spread":0.2444523787217875,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285277227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002254827,0.00008215926,0.9933125,0.003367954,0.00013168117,0.00035033948,0.00004228553,0.00014590057,0.00031240025],"genre_scores_gemma":[0.7223166,0.000027788654,0.27691713,0.00037032392,0.000002885274,0.00026320518,0.000017621085,0.000010939991,0.000073492745],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988943,0.0001384568,0.00038170512,0.00019268016,0.00023336393,0.00015950634],"domain_scores_gemma":[0.99787074,0.0007441764,0.00013137396,0.0010271502,0.00016115574,0.00006537244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038227777,0.000121505625,0.00016374285,0.0002606613,0.0006557204,0.00008650345,0.0012166824,0.00004911932,0.000029020408],"category_scores_gemma":[0.000020786956,0.00014165201,0.00009222775,0.000421812,0.00015853287,0.00037202882,0.00003825009,0.00032021067,0.0000024847814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022135365,0.0023753317,0.00009324453,0.00049249193,0.00026460827,0.0000046983846,0.031135855,0.27774212,0.006410913,0.45841482,0.0007106701,0.22213389],"study_design_scores_gemma":[0.00042172254,0.000116979114,0.000010582304,0.00003711823,0.000014838352,0.000007054763,0.00028167682,0.99220914,0.004955923,0.0004158843,0.0013818896,0.00014721179],"about_ca_topic_score_codex":0.000020696521,"about_ca_topic_score_gemma":0.0000070251817,"teacher_disagreement_score":0.7200618,"about_ca_system_score_codex":0.000086679924,"about_ca_system_score_gemma":0.00007505647,"threshold_uncertainty_score":0.5776401},"labels":[],"label_agreement":null},{"id":"W4286909580","doi":"10.48550/arxiv.2110.02879","title":"Compositional Q-learning for electrolyte repletion with imbalanced patient sub-populations","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Cancer Institute; Stanford Engineering; Canadian Institute for Advanced Research; National Institutes of Health; Leona M. and Harry B. Helmsley Charitable Trust","keywords":"Reinforcement learning; Computer science; Task (project management); Class (philosophy); Function (biology); Reinforcement; Artificial intelligence; Markov decision process; Machine learning; Psychology; Mathematics","score_opus":0.034489622746847796,"score_gpt":0.17158011778774185,"score_spread":0.13709049504089404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286909580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21458256,0.000010890309,0.784095,0.00011497315,0.00014627929,0.00036227095,0.00000600027,0.0001964966,0.00048556554],"genre_scores_gemma":[0.93785936,0.000025084619,0.06107674,0.00010213742,0.00003146163,0.000007476897,0.0007508619,0.00001374161,0.00013315772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872524,0.00008589324,0.00023265136,0.00059166667,0.00012891181,0.00023565585],"domain_scores_gemma":[0.99831384,0.000056882407,0.0004427154,0.00050406606,0.00059899845,0.00008352113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001132406,0.00020853715,0.00020539552,0.00020102136,0.00032944998,0.00021911287,0.00043553242,0.00015166342,0.000013022665],"category_scores_gemma":[0.000030591542,0.00024200793,0.00012267588,0.0004429563,0.00003573297,0.0008126702,0.00036229784,0.0003325659,0.000007958938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043269916,0.000038959195,0.00062133535,0.000030149824,0.00003727457,0.000014693156,0.0002436171,0.94627064,0.00015645125,0.05220828,0.00008365543,0.00025168975],"study_design_scores_gemma":[0.00050304754,0.0001449994,0.0015065492,0.00008956059,0.000034689077,0.000010580953,0.000075815784,0.99432147,0.00089667534,0.0019888692,0.00011364249,0.0003141129],"about_ca_topic_score_codex":0.000011463984,"about_ca_topic_score_gemma":0.000019577647,"teacher_disagreement_score":0.7232768,"about_ca_system_score_codex":0.00028222823,"about_ca_system_score_gemma":0.00022539841,"threshold_uncertainty_score":0.9868797},"labels":[],"label_agreement":null},{"id":"W4287686341","doi":"10.48550/arxiv.2008.09590","title":"Reinforcement Learning-based Admission Control in Delay-sensitive\\n Service Systems","year":2020,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Reinforcement learning; Computer science; Probabilistic logic; Quality of service; Admission control; Queue; Service (business); Controller (irrigation); Computer network; Task (project management); Metric (unit); Distributed computing; Performance metric; End-to-end delay; Upper and lower bounds; Real-time computing; Artificial intelligence; Engineering; Mathematics","score_opus":0.045833657648934954,"score_gpt":0.17798174002167733,"score_spread":0.13214808237274236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287686341","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01164828,0.000030463976,0.9812781,0.0010163212,0.0008425329,0.0017032247,0.000010579984,0.00033447566,0.0031359831],"genre_scores_gemma":[0.9963524,0.000112017944,0.0008158264,0.0015341382,0.000087572495,0.0000045799293,0.00014390195,0.00004136315,0.00090822927],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9951602,0.00085968693,0.0011295354,0.0016546255,0.00042408393,0.0007718612],"domain_scores_gemma":[0.994964,0.00031760262,0.0016101912,0.0012100259,0.0012310315,0.00066714105],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085958943,0.0008052847,0.00089189014,0.00079364533,0.0004410557,0.00048464118,0.0019266139,0.00068304566,0.00011741622],"category_scores_gemma":[0.00021386438,0.0010192647,0.0002817017,0.0024950893,0.00010165256,0.0017381357,0.0013218957,0.0015636656,0.0007166702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042549247,0.000077743854,0.00060647883,0.00042919433,0.00008495813,0.00058721495,0.0012036739,0.98686844,0.000029823846,0.009456684,0.00009630034,0.00013396496],"study_design_scores_gemma":[0.0040222546,0.00026225136,0.00031582708,0.00091886416,0.00010016309,0.000009910188,0.0006230256,0.9916609,0.00008861128,0.00010519439,0.0009484776,0.0009445517],"about_ca_topic_score_codex":0.0006897785,"about_ca_topic_score_gemma":0.000041604995,"teacher_disagreement_score":0.9847041,"about_ca_system_score_codex":0.001276193,"about_ca_system_score_gemma":0.0012747797,"threshold_uncertainty_score":0.9992258},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.022305750973502222,"score_gpt":0.25102671865662696,"score_spread":0.22872096768312472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287887984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002354215,0.000029648121,0.9945463,0.000750064,0.0007242449,0.0010691421,0.00007816061,0.00009480865,0.00035344536],"genre_scores_gemma":[0.9896024,0.00004193159,0.008927329,0.00039075798,0.000010737204,0.000820688,0.00010605998,0.000012094815,0.000088031375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99744385,0.00023812678,0.0012535485,0.00018878511,0.00064400065,0.00023171058],"domain_scores_gemma":[0.99816155,0.00021895145,0.00035111862,0.0010048939,0.00018222653,0.000081239305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056805,0.00018214903,0.00022878268,0.00097556884,0.00043283057,0.00011156185,0.0013483338,0.000051889256,0.00003084154],"category_scores_gemma":[0.000012227624,0.00017314577,0.00012338928,0.0017832054,0.0000633332,0.0007659422,0.0000054883794,0.0002772416,0.000046999212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028502538,0.00012593096,0.00002495047,0.000037487876,0.000017869024,0.000002171524,0.019894112,0.9627561,0.00008304909,0.010962907,0.000022018588,0.006044909],"study_design_scores_gemma":[0.0006219365,0.00026298757,0.0008969389,0.00007646859,0.000031014668,0.000014128835,0.007969459,0.97816765,0.003060678,0.00016613345,0.008348389,0.00038418383],"about_ca_topic_score_codex":0.00048570868,"about_ca_topic_score_gemma":0.00013006583,"teacher_disagreement_score":0.9872482,"about_ca_system_score_codex":0.00031852917,"about_ca_system_score_gemma":0.00014458506,"threshold_uncertainty_score":0.706068},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.07378218549108034,"score_gpt":0.30584753422071015,"score_spread":0.2320653487296298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290996600","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01131451,0.000018905055,0.9263769,0.0081302,0.0009952277,0.00050733436,0.00004513897,0.00010367907,0.05250814],"genre_scores_gemma":[0.9698584,0.00018375745,0.028048828,0.0010425836,0.0000119628785,0.00016384803,0.00033370513,0.000008502629,0.00034839366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793977,0.00023518069,0.00082069926,0.00019949843,0.00059813296,0.00020673333],"domain_scores_gemma":[0.9976418,0.00025025476,0.0004226227,0.0012388892,0.00037089566,0.000075514086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007582744,0.00015369723,0.0001949066,0.0005316978,0.0002716557,0.00021192692,0.003831196,0.000044963013,0.00044737465],"category_scores_gemma":[0.00008401236,0.00018705301,0.000063094936,0.0008502771,0.000051841165,0.0012727513,0.00078334863,0.00046400225,0.000058865287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004010264,0.00016640208,0.00027436917,0.0000060664015,0.000026649863,0.0000018526516,0.005403247,0.7991485,0.00042962382,0.17820936,0.0012119481,0.015081861],"study_design_scores_gemma":[0.0003199072,0.00006179058,0.00057757704,0.000053384345,0.000002377718,0.000006249395,0.0014136592,0.989729,0.00049988885,0.0010217797,0.0061129024,0.00020151056],"about_ca_topic_score_codex":0.00018630856,"about_ca_topic_score_gemma":0.000042966098,"teacher_disagreement_score":0.9585439,"about_ca_system_score_codex":0.00041243347,"about_ca_system_score_gemma":0.00017185195,"threshold_uncertainty_score":0.7627801},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Fundamental Research Funds for the Central Universities; 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","score_opus":0.03315507696369736,"score_gpt":0.24714040860284317,"score_spread":0.21398533163914582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292971126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09472293,0.000053585372,0.9027725,0.00023015162,0.0018547997,0.00021026803,0.0000030088759,0.000041754887,0.00011104074],"genre_scores_gemma":[0.7166613,0.000001468657,0.28300217,0.00010171647,0.000142593,0.0000031786021,0.0000015010589,0.000008896978,0.00007718726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985923,0.000109044835,0.00058322406,0.00015218208,0.00038396116,0.00017924746],"domain_scores_gemma":[0.99849886,0.000171508,0.0008714854,0.00011530352,0.00026878712,0.000074052325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612228,0.00011664118,0.00019488722,0.00029591948,0.00029360194,0.00035628668,0.00034985464,0.00005665397,0.000005011955],"category_scores_gemma":[0.00022995904,0.000120323115,0.000064652755,0.00016610889,0.00002901048,0.00096835033,0.00015764113,0.00040032662,0.0000013791187],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099738616,0.000019191262,0.000026375086,0.000035094134,0.00007638723,0.0000104118035,0.010668421,0.9550362,0.0015070761,0.002393099,0.0014274562,0.028700525],"study_design_scores_gemma":[0.0006649375,0.0002070343,0.0000027615795,0.00015861804,0.000013877148,0.0007814464,0.0009143778,0.99474996,0.0019213496,0.00029036336,0.00017639101,0.00011888961],"about_ca_topic_score_codex":0.000023217131,"about_ca_topic_score_gemma":1.2830453e-7,"teacher_disagreement_score":0.62193835,"about_ca_system_score_codex":0.00020972792,"about_ca_system_score_gemma":0.000094590716,"threshold_uncertainty_score":0.4906634},"labels":[],"label_agreement":null},{"id":"W4294805053","doi":"10.36227/techrxiv.20731843.v1","title":"Multi-Operator Dynamic Spectrum Sharing for Wireless Communications: A Consortium Blockchain Enabled Framework","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; China Association for Science and Technology","keywords":"Stackelberg competition; Computer science; Computer network; Wireless; Blockchain; Quality of service; Revenue sharing; Latency (audio); Revenue; Wireless network; Distributed computing; Telecommunications; Computer security; Business","score_opus":0.02747080190421711,"score_gpt":0.297137402663563,"score_spread":0.26966660075934584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805053","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012644132,0.00020855457,0.989845,0.0040728445,0.00082692155,0.0019394066,0.000054757587,0.0007992796,0.0009888628],"genre_scores_gemma":[0.12013946,0.00015706365,0.874824,0.0010820004,0.00003581066,0.0014917584,0.0002729294,0.000043476586,0.0019535443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745685,0.00011320177,0.00088629493,0.00074520597,0.00037300203,0.00042543968],"domain_scores_gemma":[0.99457824,0.00035005301,0.0006018145,0.0041063223,0.00024360552,0.00011998058],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00085751317,0.00037034618,0.00042525897,0.00034655482,0.0006773978,0.0007819789,0.0060755513,0.00031755317,0.0002890953],"category_scores_gemma":[0.00023283636,0.00040269186,0.00019217447,0.00042659193,0.00007797244,0.00036097638,0.009449745,0.0010289504,0.000036352827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025430576,0.00037287135,0.00025700746,0.0004304547,0.00022908524,0.000005021483,0.0059034387,0.6292823,0.00004759737,0.3594538,0.0008401453,0.0031528363],"study_design_scores_gemma":[0.00040103766,0.00002853683,0.000052526382,0.0001011072,0.000014977241,0.0000049402743,0.0002826265,0.9911856,0.00008584048,0.006259693,0.0011136574,0.0004694544],"about_ca_topic_score_codex":0.00006146838,"about_ca_topic_score_gemma":0.00005576159,"teacher_disagreement_score":0.36190328,"about_ca_system_score_codex":0.0005081201,"about_ca_system_score_gemma":0.00040109182,"threshold_uncertainty_score":0.9998425},"labels":[],"label_agreement":null},{"id":"W4294805331","doi":"10.36227/techrxiv.20731843","title":"Multi-Operator Dynamic Spectrum Sharing for Wireless Communications: A Consortium Blockchain Enabled Framework","year":2022,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Government of Jiangsu Province; Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China; China Association for Science and Technology","keywords":"Stackelberg competition; Computer science; Blockchain; Wireless; Computer network; Quality of service; Revenue sharing; Latency (audio); Revenue; Wireless network; Distributed computing; Telecommunications; Computer security; Business","score_opus":0.02747080190421711,"score_gpt":0.297137402663563,"score_spread":0.26966660075934584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294805331","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012644132,0.00020855457,0.989845,0.0040728445,0.00082692155,0.0019394066,0.000054757587,0.0007992796,0.0009888628],"genre_scores_gemma":[0.12013946,0.00015706365,0.874824,0.0010820004,0.00003581066,0.0014917584,0.0002729294,0.000043476586,0.0019535443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99745685,0.00011320177,0.00088629493,0.00074520597,0.00037300203,0.00042543968],"domain_scores_gemma":[0.99457824,0.00035005301,0.0006018145,0.0041063223,0.00024360552,0.00011998058],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.00085751317,0.00037034618,0.00042525897,0.00034655482,0.0006773978,0.0007819789,0.0060755513,0.00031755317,0.0002890953],"category_scores_gemma":[0.00023283636,0.00040269186,0.00019217447,0.00042659193,0.00007797244,0.00036097638,0.009449745,0.0010289504,0.000036352827],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025430576,0.00037287135,0.00025700746,0.0004304547,0.00022908524,0.000005021483,0.0059034387,0.6292823,0.00004759737,0.3594538,0.0008401453,0.0031528363],"study_design_scores_gemma":[0.00040103766,0.00002853683,0.000052526382,0.0001011072,0.000014977241,0.0000049402743,0.0002826265,0.9911856,0.00008584048,0.006259693,0.0011136574,0.0004694544],"about_ca_topic_score_codex":0.00006146838,"about_ca_topic_score_gemma":0.00005576159,"teacher_disagreement_score":0.36190328,"about_ca_system_score_codex":0.0005081201,"about_ca_system_score_gemma":0.00040109182,"threshold_uncertainty_score":0.9998425},"labels":[],"label_agreement":null},{"id":"W4295308354","doi":"10.1109/tvt.2022.3205625","title":"Towards Age-Optimal Transmission in Satellite-Integrated IoT: A Two-Layer Coding Approach","year":2022,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Retransmission; Computer science; Hybrid automatic repeat request; Network packet; Physical layer; PHY; Forward error correction; Erasure; Error detection and correction; Automatic repeat request; Redundancy (engineering); Erasure code; Decoding methods; Bit error rate; Binary erasure channel; Coding (social sciences); Fading; Algorithm; Real-time computing; Channel (broadcasting); Computer network; Channel capacity; Wireless; Telecommunications link; Telecommunications","score_opus":0.014219951553912692,"score_gpt":0.2374731114898323,"score_spread":0.2232531599359196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4295308354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015003146,0.00007326597,0.9810516,0.0013638609,0.00022575923,0.00044459637,0.000007196017,0.0008350804,0.0009954941],"genre_scores_gemma":[0.8031297,0.00004154248,0.19618943,0.00020684881,0.000005276843,0.00025164708,0.000012602116,0.000020399759,0.00014256997],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802375,0.00014196796,0.00048828346,0.00049817923,0.0004401098,0.00040768224],"domain_scores_gemma":[0.9991173,0.000028155813,0.00011637016,0.0005891789,0.00007950696,0.00006945044],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039769043,0.00024738075,0.0002762489,0.0014905478,0.00043768546,0.00007573425,0.000976198,0.00020764633,0.00009929809],"category_scores_gemma":[0.0000059354766,0.000254817,0.000120467,0.0027924106,0.00008963894,0.00036012012,0.000015048031,0.0010218387,0.000026591319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027814936,0.00024895943,0.0000035433818,0.0000107464175,0.000020998516,0.00006488371,0.0007378837,0.8300534,0.0025408373,0.0043479432,0.000015680042,0.16192731],"study_design_scores_gemma":[0.0010969341,0.00021285129,0.000013315397,0.000019793597,0.000012475971,0.00018989215,0.0005390793,0.96370906,0.029602718,0.0003224492,0.0039722743,0.0003091617],"about_ca_topic_score_codex":0.000037791175,"about_ca_topic_score_gemma":0.000004898833,"teacher_disagreement_score":0.7881265,"about_ca_system_score_codex":0.00037396644,"about_ca_system_score_gemma":0.00013193299,"threshold_uncertainty_score":0.9999904},"labels":[],"label_agreement":null},{"id":"W4297999718","doi":"10.1145/3565022","title":"Harmony or Involution: Game Inspiring Age-of-Information Optimization for Edge Data Gathering in Internet of Things","year":2022,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"National Natural Science Foundation of China","keywords":"Computer science; Nash equilibrium; The Internet; Wireless sensor network; Mathematical optimization; Performance metric; Network packet; Game theory; Computer network; Mathematics; Mathematical economics","score_opus":0.04373056192339537,"score_gpt":0.259000561537765,"score_spread":0.21526999961436966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4297999718","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010954435,0.000020040217,0.997423,0.0002613576,0.00041654718,0.0005065208,0.000020856723,0.0001011319,0.00015512173],"genre_scores_gemma":[0.45752078,0.00005858212,0.5416187,0.00031879358,0.000015916574,0.0000815557,0.00028273853,0.00001449351,0.000088467925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848056,0.000071881055,0.0007378919,0.00021859621,0.00029232568,0.00019872464],"domain_scores_gemma":[0.99828804,0.00021184245,0.00040946607,0.00091834454,0.00013282472,0.000039491566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054202497,0.00013932002,0.00020513462,0.0005150189,0.00013369086,0.00006924269,0.0012917903,0.00007300052,0.00008304284],"category_scores_gemma":[0.00008395936,0.00014774947,0.00005790736,0.0010549407,0.000035901056,0.0034906154,0.00013134621,0.00025114688,0.0000016571461],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000103634426,0.000052129544,0.000012316512,0.000037782032,0.000016451448,7.9442816e-7,0.0028145686,0.9572791,0.000009687923,0.00031946573,0.000086163556,0.039267942],"study_design_scores_gemma":[0.000704322,0.0001492579,0.000038667,0.000055319633,0.000011027349,0.0000099929475,0.00037574864,0.99703133,0.00020321652,0.000047648744,0.0012316849,0.00014180157],"about_ca_topic_score_codex":0.000049819606,"about_ca_topic_score_gemma":0.000007018032,"teacher_disagreement_score":0.45642534,"about_ca_system_score_codex":0.00014198483,"about_ca_system_score_gemma":0.00006464032,"threshold_uncertainty_score":0.6025048},"labels":[],"label_agreement":null},{"id":"W4299880612","doi":"10.48550/arxiv.1412.3199","title":"Distortion-transmission trade-off in real-time transmission of Markov\\n sources","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies","keywords":"Transmission (telecommunications); Mathematical optimization; Distortion (music); Piecewise; Markov decision process; Piecewise linear function; Computer science; Markov chain; Lagrangian relaxation; Function (biology); Convex optimization; Lagrange multiplier; Network packet; Relaxation (psychology); Convex function; Markov process; Mathematics; Regular polygon; Bandwidth (computing); Telecommunications","score_opus":0.02057295713896978,"score_gpt":0.173527421321691,"score_spread":0.1529544641827212,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299880612","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.115563296,0.000041647312,0.87956536,0.0001547872,0.00010977076,0.0002865583,0.00000467823,0.00017109593,0.004102836],"genre_scores_gemma":[0.9833202,0.00073781214,0.015107611,0.000027465116,0.000021856988,6.148449e-7,0.0000563281,0.000016862145,0.0007112629],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982415,0.00019396958,0.0004989273,0.00062864413,0.00018163199,0.00025536248],"domain_scores_gemma":[0.9984059,0.00009749053,0.00050083257,0.0007514533,0.00008652605,0.00015782572],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00039426223,0.00028762055,0.00039693565,0.00050468324,0.00009638772,0.00005452354,0.0012813937,0.00036495476,0.00009082442],"category_scores_gemma":[0.000015478909,0.00031434986,0.00019838274,0.0005801768,0.00008728474,0.00073375367,0.00029700244,0.00034994853,0.000024809227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001093764,0.00013453665,0.0006476013,0.00028441558,0.000027093603,0.000030715353,0.0023869772,0.96474147,0.00024956485,0.0061614197,0.00028697937,0.024939835],"study_design_scores_gemma":[0.00059788616,0.00006240713,0.0022805496,0.00033845796,0.00002467928,0.0000020961888,0.00003586807,0.99199784,0.00055528997,0.0028520091,0.00090221973,0.00035071644],"about_ca_topic_score_codex":0.000083179315,"about_ca_topic_score_gemma":0.000003594919,"teacher_disagreement_score":0.8677569,"about_ca_system_score_codex":0.00018995695,"about_ca_system_score_gemma":0.00016516281,"threshold_uncertainty_score":0.99993086},"labels":[],"label_agreement":null},{"id":"W4300400667","doi":"10.1109/icc45855.2022.9839197","title":"Deep Reinforcement Learning-Assisted NOMA Age-Optimal Power Allocation for S-IoT Network","year":2022,"lang":"en","type":"article","venue":"ICC 2022 - IEEE International Conference on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Natural Science Foundation of Guangdong Province","keywords":"Computer science; Reinforcement learning; Noma; Markov decision process; Benchmark (surveying); Mathematical optimization; Optimization problem; Computer network; Markov process; Artificial intelligence; Algorithm; Telecommunications link; Mathematics","score_opus":0.06429420848862291,"score_gpt":0.3154496622714136,"score_spread":0.2511554537827907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300400667","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042009042,0.00003360934,0.9450049,0.011711002,0.0011769242,0.0006733785,0.000013059772,0.00027057537,0.0406965],"genre_scores_gemma":[0.8968642,0.00008262033,0.0958812,0.0013678869,0.00007722176,0.001204334,0.0009954958,0.00002368729,0.0035033452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761105,0.00025135768,0.00067855604,0.0003633424,0.0007820439,0.00031365672],"domain_scores_gemma":[0.996878,0.0003334593,0.00058090314,0.0014750833,0.00063618144,0.00009632832],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007089526,0.00022082287,0.00018602273,0.00029627263,0.0013999941,0.00039532193,0.0041281693,0.00006512254,0.0009456957],"category_scores_gemma":[0.0001470965,0.00026247825,0.00013622355,0.00052137824,0.00009191892,0.0006321966,0.0011148232,0.00054737926,0.000096207325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034077137,0.00011048335,0.000026467635,0.0000024926517,0.000055451324,0.0000011398669,0.00082707504,0.60259986,0.00011707395,0.387972,0.0038765047,0.0043773744],"study_design_scores_gemma":[0.00057882565,0.00029323448,0.00034630473,0.000017421924,0.000009885588,0.000014187162,0.00039161072,0.9516563,0.000043171636,0.0019457828,0.044433482,0.00026980485],"about_ca_topic_score_codex":0.000026214588,"about_ca_topic_score_gemma":0.00003707223,"teacher_disagreement_score":0.89644414,"about_ca_system_score_codex":0.0005166014,"about_ca_system_score_gemma":0.00026444753,"threshold_uncertainty_score":0.9999827},"labels":[],"label_agreement":null},{"id":"W4306763748","doi":"10.1145/3551659.3559046","title":"Average Age Upon Decisions of Wireless Networks with Truncated HARQ in the Finite Blocklength Regime","year":2022,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Network packet; Computer network; Transmitter; Wireless; Wireless network; Automatic repeat request; Preemption; Randomness; Telecommunications; Mathematics; Telecommunications link; Channel (broadcasting); Statistics","score_opus":0.011937142620132584,"score_gpt":0.20537682882106226,"score_spread":0.19343968620092966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306763748","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019337224,0.000009839124,0.97224975,0.00061275205,0.00006483786,0.00023338951,0.0000016192473,0.00006535244,0.0074252374],"genre_scores_gemma":[0.97760993,0.000012930562,0.021239724,0.0006668878,0.0000077428895,0.00003375239,0.000021163738,0.0000054899565,0.00040240466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885225,0.00013916426,0.00029551247,0.00015088587,0.00040341596,0.00015874783],"domain_scores_gemma":[0.9988571,0.00036609537,0.00016323567,0.00052409846,0.000062492996,0.0000269842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057465077,0.000089390705,0.00011436503,0.0001513386,0.00018420702,0.00007915912,0.0009997962,0.00002603419,0.000095514835],"category_scores_gemma":[0.000037880935,0.000059289774,0.00002837304,0.0012161626,0.000022830762,0.00045009248,0.00025781285,0.0001997108,0.0000049561336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015414204,0.000043525233,0.000060903574,0.0000011284833,0.00000425102,0.000018644705,0.0022346594,0.9773974,0.000002469979,0.015245612,0.0008805434,0.0040954934],"study_design_scores_gemma":[0.00040329053,0.00009768972,0.00069595245,0.000010439725,0.0000017293497,0.000016198323,0.00029109142,0.9973609,0.00002990054,0.00013680095,0.00086848676,0.00008756081],"about_ca_topic_score_codex":0.000029659373,"about_ca_topic_score_gemma":0.000039711926,"teacher_disagreement_score":0.9582727,"about_ca_system_score_codex":0.000037902446,"about_ca_system_score_gemma":0.000056461133,"threshold_uncertainty_score":0.24177669},"labels":[],"label_agreement":null},{"id":"W4310815533","doi":"10.48550/arxiv.2107.04748","title":"Resilient Edge Service Placement under Demand and Node Failure Uncertainties","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Workload; Mathematical optimization; Distributed computing; Node (physics); Resource allocation; Enhanced Data Rates for GSM Evolution; Service (business); Set (abstract data type); Resource (disambiguation); Edge computing; Operations research; Computer network; Engineering; Artificial intelligence","score_opus":0.03616013504032411,"score_gpt":0.17543156842998495,"score_spread":0.13927143338966083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310815533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13356777,0.000073677555,0.86318684,0.00084285915,0.00025516312,0.00022416419,0.000004692078,0.00012345483,0.0017213799],"genre_scores_gemma":[0.9826447,0.00021471798,0.015031173,0.00075493124,0.000029378187,0.0000013485452,0.00005216197,0.000011694107,0.0012599103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986443,0.00009540328,0.00021470044,0.0006740609,0.00012981104,0.00024174673],"domain_scores_gemma":[0.9983739,0.000056543973,0.00024277627,0.00082862616,0.0003677438,0.00013041095],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018027848,0.000258753,0.00022715284,0.00020261103,0.00019874224,0.00036683257,0.00082114775,0.00022215636,0.000058653637],"category_scores_gemma":[0.000016730084,0.00029970327,0.00006734922,0.0004798742,0.000057381563,0.0008829851,0.0023864738,0.0003084362,0.000037277194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009767226,0.000024184295,0.00035759262,0.00012253362,0.000051821487,0.00003228382,0.0011153885,0.9636542,0.0000065336562,0.034000102,0.0005701677,0.000055400622],"study_design_scores_gemma":[0.0004839543,0.000018540786,0.0007448853,0.00014376346,0.00004025819,0.0000068312106,0.002041438,0.99334055,0.0001255568,0.0022586952,0.00040880786,0.0003867199],"about_ca_topic_score_codex":0.00007934345,"about_ca_topic_score_gemma":0.00016117153,"teacher_disagreement_score":0.8490769,"about_ca_system_score_codex":0.0002361527,"about_ca_system_score_gemma":0.00023908225,"threshold_uncertainty_score":0.9999455},"labels":[],"label_agreement":null},{"id":"W4310834707","doi":"10.1109/wincom55661.2022.9966470","title":"Age of Information and Latency Analysis in Two-Tier Linear IoT Networks","year":2022,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal; Université de Sherbrooke","funders":"","keywords":"Computer science; Latency (audio); Computer network; PHY; Internet of Things; Hop (telecommunications); Routing (electronic design automation); Distributed computing; Physical layer; Telecommunications; Computer security; Wireless","score_opus":0.005503617484357967,"score_gpt":0.21965270191574923,"score_spread":0.21414908443139127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4310834707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016769592,0.000014191024,0.9787249,0.00014402246,0.000035685844,0.00007722447,7.797125e-7,0.000033146098,0.0042004827],"genre_scores_gemma":[0.90535927,0.000009387202,0.09407957,0.00038649733,0.0000044173844,0.000007966666,0.000044669436,0.0000012665707,0.00010698131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934155,0.00003187497,0.00031227904,0.00005991378,0.0001734512,0.00008091192],"domain_scores_gemma":[0.9996147,0.00002133726,0.00013100839,0.00016567421,0.00004535897,0.000021879781],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003196167,0.00004554717,0.00009470203,0.00042711227,0.00005737054,0.000038359376,0.00021272486,0.000013118374,0.00010191412],"category_scores_gemma":[0.000012696382,0.000044471475,0.000025799578,0.0015316199,0.000011297197,0.0009647626,0.00021837543,0.000071886556,0.0000024016888],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020054397,0.000006955565,0.003985984,0.000002284419,0.000011346378,5.23895e-7,0.0012141916,0.98077875,9.2773683e-7,0.008480209,0.0000535075,0.0054632947],"study_design_scores_gemma":[0.00019316073,0.000017094315,0.008013509,8.4292094e-7,0.0000061172336,9.056424e-7,0.000094469164,0.9910722,0.000009305537,0.00009782739,0.00044427306,0.00005034462],"about_ca_topic_score_codex":0.00009454283,"about_ca_topic_score_gemma":0.00002422692,"teacher_disagreement_score":0.8885896,"about_ca_system_score_codex":0.00002747626,"about_ca_system_score_gemma":0.00001797197,"threshold_uncertainty_score":0.18134941},"labels":[],"label_agreement":null},{"id":"W4311628423","doi":"10.3390/s22239455","title":"Data Freshness and End-to-End Delay in Cross-Layer Two-Tier Linear IoT Networks","year":2022,"lang":"en","type":"article","venue":"Sensors","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke; Université du Québec à Montréal","funders":"Université du Québec à Montréal","keywords":"Computer science; Network packet; Computer network; Quality of service; End-to-end principle; End-to-end delay; Relay; Metric (unit); Performance metric; Base station; Network performance; Queuing delay; Engineering","score_opus":0.027642644488812453,"score_gpt":0.29194933028327075,"score_spread":0.2643066857944583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311628423","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5840585,0.000092810486,0.4118794,0.0011145831,0.0006430884,0.0003450328,0.000062097024,0.00014960665,0.0016548542],"genre_scores_gemma":[0.93029636,0.000009147728,0.067283064,0.0015564509,0.00009772515,0.000014170384,0.000107812404,0.000015385745,0.00061989966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875957,0.00008517484,0.00027534066,0.00033158992,0.0003028943,0.00024541753],"domain_scores_gemma":[0.9989251,0.000071896946,0.00008661133,0.0007792713,0.00005232744,0.000084808766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055906153,0.00010804084,0.000113871225,0.0001636672,0.00021788824,0.00017035913,0.0009072827,0.000034800607,0.00014531436],"category_scores_gemma":[0.00005578169,0.00011392062,0.000013961169,0.00059263717,0.000033919678,0.0005668919,0.0014292464,0.00021580042,0.00002699171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008566266,0.000012252336,0.0012968441,0.000002365451,0.0000040176456,0.000015497557,0.001089053,0.9908872,0.00000390944,0.00073466206,0.0013414999,0.0046041072],"study_design_scores_gemma":[0.0003284401,0.00002269784,0.0019387079,0.000003984765,0.0000015494453,0.000024385268,0.000090635105,0.9788754,0.000024989606,0.000032028827,0.018517196,0.0001399626],"about_ca_topic_score_codex":0.00007251064,"about_ca_topic_score_gemma":0.00007593935,"teacher_disagreement_score":0.3462378,"about_ca_system_score_codex":0.000053422526,"about_ca_system_score_gemma":0.000041603245,"threshold_uncertainty_score":0.46455482},"labels":[],"label_agreement":null},{"id":"W4312007055","doi":"10.1109/tencon55691.2022.9977897","title":"IEEE Hong Kong Section 50th Anniversary 1972-2022: Advance Technology for Huminity – The Tech-Biz Intelligence","year":2022,"lang":"en","type":"article","venue":"TENCON 2022 - 2022 IEEE Region 10 Conference (TENCON)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University at Buffalo; University of California, San Diego; University of Illinois at Urbana-Champaign; SaskPower; University of Texas at Dallas; Chinese University of Hong Kong; Hong Kong Polytechnic University; University of Hong Kong; University of Toronto; University of Edinburgh; China Computer Federation; Hang Seng Management College; University of Alberta; University of Saskatchewan; Princeton University; State University of New York; University of Maryland, Baltimore County","keywords":"Section (typography); Friendship; China; Work (physics); Telecommunications; Engineering; Library science; Computer science; Sociology; Political science; Business; Advertising; Social science; Law","score_opus":0.028446873405137848,"score_gpt":0.25281485113092955,"score_spread":0.2243679777257917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312007055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008400062,0.00033706086,0.97385204,0.0065910853,0.004184853,0.0019665791,0.000060698694,0.0010597064,0.0035479157],"genre_scores_gemma":[0.96418214,0.0009566419,0.018039754,0.0017798336,0.00048516126,0.0021040612,0.00014630477,0.000099327066,0.012206783],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99532855,0.00036840304,0.001032307,0.0012607909,0.0010853937,0.0009245415],"domain_scores_gemma":[0.99560857,0.00044118552,0.0011184246,0.0018217744,0.0008192779,0.00019076241],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0013684928,0.0005880073,0.0005688474,0.0009998642,0.0022332878,0.0003109219,0.0037023837,0.00028634968,0.0008361984],"category_scores_gemma":[0.0003272767,0.00055993913,0.000276145,0.0033269431,0.00054957066,0.002711832,0.0009424664,0.0013481206,0.00011190072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008071329,0.0010325155,0.0017426001,0.00047306705,0.00045922407,0.0003786648,0.015612095,0.14594696,0.016381882,0.1868856,0.13017578,0.5001045],"study_design_scores_gemma":[0.0016361674,0.0020599957,0.00025806908,0.00015338404,0.000105626474,0.00089710107,0.021657137,0.82892096,0.019867871,0.024285093,0.097958006,0.0022005765],"about_ca_topic_score_codex":0.00007187438,"about_ca_topic_score_gemma":0.00006250232,"teacher_disagreement_score":0.9558123,"about_ca_system_score_codex":0.00070429745,"about_ca_system_score_gemma":0.00081333396,"threshold_uncertainty_score":0.9996852},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; 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","score_opus":0.021544466944623218,"score_gpt":0.2362473509092995,"score_spread":0.21470288396467627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312040304","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006947953,0.000010599747,0.9867591,0.0020556424,0.00010909581,0.00036430694,0.00007367648,0.00022325349,0.009709516],"genre_scores_gemma":[0.89392644,0.000054539443,0.10497488,0.00038887592,0.0000025752147,0.00029910725,0.00010197855,0.000008481148,0.00024310994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986329,0.00016486425,0.0004958013,0.0001195812,0.00043652445,0.00015029847],"domain_scores_gemma":[0.9970426,0.00017854497,0.0003043928,0.0021940877,0.00022154646,0.000058840327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030734576,0.0001235233,0.00013755799,0.00044675783,0.0008937706,0.00009038739,0.0019246417,0.000025523057,0.00006404223],"category_scores_gemma":[0.000008437504,0.00012808465,0.000063275496,0.0010588098,0.00007821141,0.0018451769,0.000035242407,0.00035358628,0.000034091343],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009226577,0.0005171524,0.0000047496806,0.000023118339,0.0000758099,0.0000019351733,0.00828189,0.8889325,0.00027795893,0.070424534,0.00084786315,0.030520184],"study_design_scores_gemma":[0.0024482852,0.000843502,0.00020504373,0.000056906847,0.000054422697,0.00011137488,0.0025768904,0.93121076,0.010345625,0.0014103012,0.050092433,0.0006444562],"about_ca_topic_score_codex":0.00007650942,"about_ca_topic_score_gemma":0.000028836206,"teacher_disagreement_score":0.89323163,"about_ca_system_score_codex":0.00013790565,"about_ca_system_score_gemma":0.00015007996,"threshold_uncertainty_score":0.68742514},"labels":[],"label_agreement":null},{"id":"W4312765979","doi":"10.1109/jsyst.2022.3207019","title":"Admission and Placement Policies for Latency-Compliant Secure Services in 5G Edge–Cloud System","year":2022,"lang":"en","type":"article","venue":"IEEE Systems Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Victoria; Brock University","funders":"","keywords":"Cloud computing; Computer science; Software deployment; Latency (audio); Workload; Markov decision process; Admission control; Computer network; Distributed computing; Markov process; Quality of service; Operating system","score_opus":0.013193510848935395,"score_gpt":0.23949993809437406,"score_spread":0.22630642724543867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312765979","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.191672,0.0015185341,0.7923266,0.0014545005,0.009414843,0.001554301,0.000037784135,0.00021015079,0.0018112696],"genre_scores_gemma":[0.9966375,0.00001600163,0.0026507191,0.00010910479,0.00026746982,0.00006941157,0.0000037166367,0.000010164943,0.00023588669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984281,0.00014380469,0.0005831422,0.00015931539,0.00043362606,0.0002520264],"domain_scores_gemma":[0.9990538,0.00004374547,0.00044766357,0.00018640481,0.00013952961,0.0001288522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000997977,0.00012888841,0.00019790557,0.0002733166,0.0005862742,0.0004020462,0.00050771586,0.000040737512,0.000006365099],"category_scores_gemma":[0.000007374018,0.000112538,0.000041408544,0.00025330775,0.000008663568,0.0007210208,0.000107107415,0.00019369666,0.000004447582],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004441283,0.00004633113,0.000580616,0.00071108533,0.000031124895,0.00003472613,0.015132599,0.9697522,0.00030171237,0.0068968064,0.005527992,0.0009403777],"study_design_scores_gemma":[0.0010227478,0.00017675645,0.00035392385,0.00038842484,0.0000055417236,0.0015195496,0.0058337646,0.981624,0.0000894886,0.000052310417,0.008744844,0.0001886508],"about_ca_topic_score_codex":0.00006444361,"about_ca_topic_score_gemma":0.0000052421715,"teacher_disagreement_score":0.8049655,"about_ca_system_score_codex":0.00032949587,"about_ca_system_score_gemma":0.000112637106,"threshold_uncertainty_score":0.45891663},"labels":[],"label_agreement":null},{"id":"W4312831190","doi":"10.1109/pimrc54779.2022.9977667","title":"A Reconfigurable Access Scheme for Critical Massive MTC Networks With Device Clusters","year":2022,"lang":"en","type":"article","venue":"2022 IEEE 33rd Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network packet; Scheduling (production processes); Computer network; Random access; Relay; Bandwidth (computing); Scheme (mathematics); Throughput; ALARM; Distributed computing; Real-time computing; Wireless; Mathematical optimization; Telecommunications","score_opus":0.020868135432555265,"score_gpt":0.2986112688062941,"score_spread":0.2777431333737388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312831190","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01599929,0.0014294845,0.8701575,0.07052006,0.003542671,0.0045894366,0.0018262076,0.0007522082,0.031183174],"genre_scores_gemma":[0.94998986,0.0007736431,0.036482427,0.0049595498,0.0002194439,0.0048281467,0.0007622762,0.000060186503,0.0019244499],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768066,0.00021983245,0.00052809255,0.0005359962,0.0006504006,0.000384992],"domain_scores_gemma":[0.99710375,0.00085510244,0.00031139917,0.0009391297,0.000607577,0.00018304774],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00057806406,0.00029165065,0.00027328302,0.00028874577,0.0014698643,0.0005971912,0.0030969772,0.00008936207,0.0002069613],"category_scores_gemma":[0.000068490874,0.00029677793,0.00012410468,0.00054339104,0.00023401696,0.002041596,0.0006895782,0.0005858543,0.000009951097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018689018,0.0031841784,0.0018208766,0.00023149567,0.0013214876,0.000041977415,0.0363929,0.63372666,0.0008401644,0.17538232,0.11525112,0.029937938],"study_design_scores_gemma":[0.0013486753,0.0006590361,0.00010854837,0.00005219937,0.000028138362,0.00011296175,0.002376502,0.88919455,0.00015149957,0.00010353312,0.10540713,0.00045721675],"about_ca_topic_score_codex":0.000054272725,"about_ca_topic_score_gemma":0.000019876934,"teacher_disagreement_score":0.9339906,"about_ca_system_score_codex":0.00042348402,"about_ca_system_score_gemma":0.0001660855,"threshold_uncertainty_score":0.99994844},"labels":[],"label_agreement":null},{"id":"W4313229772","doi":"10.1109/jiot.2022.3232568","title":"G-SC-IRSA: Graph-Based Spatially Coupled IRSA for Age-Critical Grant-Free Massive Access","year":2022,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"Shenzhen Science and Technology Innovation Program; National Natural Science Foundation of China","keywords":"Computer science; Network packet; Random access; Benchmark (surveying); Aloha; Bipartite graph; Graph; Computer network; Theoretical computer science; Telecommunications; Throughput; Wireless","score_opus":0.023317667690077426,"score_gpt":0.27890430222442636,"score_spread":0.25558663453434893,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313229772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066370107,0.000030462224,0.9853018,0.0046782573,0.002551907,0.0002821438,0.000014595107,0.00008360733,0.00042023795],"genre_scores_gemma":[0.7589148,0.000005665758,0.23841448,0.0022424893,0.0001480014,0.000050039904,0.000012235554,0.00002433118,0.00018792604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974947,0.00011437273,0.0008513593,0.00024734528,0.0009335091,0.00035874278],"domain_scores_gemma":[0.99759,0.00038212098,0.0007644121,0.00045096772,0.00064846664,0.00016404642],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010687007,0.0001993152,0.00030457904,0.000464831,0.00033746063,0.00070057256,0.0037271345,0.00006624263,0.00025937872],"category_scores_gemma":[0.00069129805,0.00019381988,0.00027890137,0.00032767557,0.0001174131,0.0026375584,0.00055179355,0.00053123076,0.0000046079504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015042725,0.0010730544,0.00066618086,0.00043211418,0.0005146374,0.0007043421,0.017304707,0.7436678,0.0044463966,0.051968083,0.16033576,0.017382646],"study_design_scores_gemma":[0.001812268,0.0005547889,0.000074517025,0.00008696766,0.000028390328,0.00018454887,0.000064570944,0.97925115,0.0048956275,0.011853201,0.0009428007,0.0002511925],"about_ca_topic_score_codex":0.000057667297,"about_ca_topic_score_gemma":0.000005132135,"teacher_disagreement_score":0.75227785,"about_ca_system_score_codex":0.00017914384,"about_ca_system_score_gemma":0.00024833553,"threshold_uncertainty_score":0.7903745},"labels":[],"label_agreement":null},{"id":"W4315605992","doi":"10.1109/globecom48099.2022.10001380","title":"Age-oriented Access Control in GEO/LEO Heterogeneous Network for Marine IoRT","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Computer science; Markov decision process; Satellite; Transmission (telecommunications); Throughput; Computer network; Heterogeneous network; Communications satellite; The Internet; Markov process; Distributed computing; Telecommunications; Engineering; Wireless; Wireless network","score_opus":0.031225629256287284,"score_gpt":0.2956600533729006,"score_spread":0.2644344241166133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315605992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003677084,0.00043080337,0.9723838,0.004534977,0.0014069614,0.002160156,0.00063133176,0.0004389182,0.014335971],"genre_scores_gemma":[0.92444384,0.0002544707,0.068193726,0.0031988688,0.000061578794,0.0022767563,0.00119642,0.000024722547,0.00034960272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965799,0.00058656884,0.00096094754,0.00056893256,0.0006180684,0.0006856105],"domain_scores_gemma":[0.995499,0.00027396137,0.00053197437,0.0031559605,0.00037534352,0.00016374832],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009844691,0.0003301106,0.00042898496,0.00019031082,0.001265454,0.00047109905,0.007534702,0.00008919681,0.00049267546],"category_scores_gemma":[0.000117316544,0.00040780456,0.00016247279,0.0022463247,0.0001394259,0.0011434342,0.003916363,0.0005224006,0.000030341607],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019184993,0.00066561496,0.013807729,0.00004072957,0.00015007956,0.00003146102,0.00065798574,0.6176807,0.000026594375,0.30036882,0.03046596,0.035912465],"study_design_scores_gemma":[0.0019059485,0.00018371153,0.0055322014,0.00001711926,0.00002520589,0.00007028753,0.00015872775,0.92317253,0.0000091848715,0.009390241,0.058995105,0.0005397142],"about_ca_topic_score_codex":0.00057087885,"about_ca_topic_score_gemma":0.001629404,"teacher_disagreement_score":0.9207668,"about_ca_system_score_codex":0.0008469429,"about_ca_system_score_gemma":0.00049860135,"threshold_uncertainty_score":0.9998374},"labels":[],"label_agreement":null},{"id":"W4315606032","doi":"10.1109/globecom48099.2022.10001586","title":"Reinforcement Learning-based Dynamic Resource Allocation For Grant-Free Access","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Calgary; Queen's University","funders":"","keywords":"Reinforcement learning; Computer science; Telecommunications link; 3rd Generation Partnership Project 2; Latency (audio); Computer network; Cellular network; Broadband; Distributed computing; Telecommunications; Artificial intelligence","score_opus":0.03596270922348667,"score_gpt":0.2998518492864165,"score_spread":0.26388914006292985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315606032","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000367282,0.0002597981,0.97404784,0.0127546815,0.00044158418,0.0012820971,0.00018991652,0.0005425001,0.010114298],"genre_scores_gemma":[0.9340191,0.0001808954,0.05765266,0.00235609,0.000022454704,0.0021349029,0.002470575,0.000028477269,0.0011348302],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99658215,0.0005836479,0.00084692216,0.0005567951,0.00091531634,0.00051515724],"domain_scores_gemma":[0.993743,0.00028819495,0.0007332174,0.004534934,0.0005427643,0.00015791612],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011404572,0.00032290278,0.00029762942,0.0002524083,0.0025239782,0.00065431825,0.011969704,0.00008497356,0.00035907733],"category_scores_gemma":[0.00032810736,0.00040038873,0.00017279598,0.0018016808,0.00015772985,0.0013639051,0.0046496317,0.00057270844,0.00003846181],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006429487,0.00019274555,0.00016424565,0.0000413562,0.00004869363,0.0000012907874,0.00045765695,0.84424645,0.00004784175,0.116705924,0.023980768,0.014048758],"study_design_scores_gemma":[0.0010688098,0.00020855277,0.00023710547,0.000018481183,0.000022934217,0.000012112991,0.0003597647,0.90544343,0.00004537348,0.0036049075,0.08858488,0.00039363792],"about_ca_topic_score_codex":0.0001709063,"about_ca_topic_score_gemma":0.0002292993,"teacher_disagreement_score":0.9336518,"about_ca_system_score_codex":0.0011792089,"about_ca_system_score_gemma":0.00072265445,"threshold_uncertainty_score":0.9998448},"labels":[],"label_agreement":null},{"id":"W4315629645","doi":"10.1109/globecom48099.2022.10001116","title":"Optimizing Information Freshness Leveraging Multi-RISs in NOMA-based IoT Networks","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Base station; Telecommunications link; Cluster analysis; Optimization problem; Wireless; Relaxation (psychology); Transmitter power output; Wireless sensor network; Mathematical optimization; Upload; Codebook; Computer network; Distributed computing; Algorithm; Channel (broadcasting); Telecommunications; Transmitter; Mathematics; Artificial intelligence","score_opus":0.03479680152394302,"score_gpt":0.2695380746530084,"score_spread":0.23474127312906537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315629645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036118585,0.0003955176,0.9862916,0.0031427061,0.00070341607,0.00072175846,0.00010705397,0.00041911344,0.004607016],"genre_scores_gemma":[0.8042705,0.00007677352,0.1925561,0.0020616099,0.000015277425,0.00048083183,0.00047834346,0.000012716738,0.000047840484],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964459,0.0006997318,0.0010969328,0.00041178992,0.0007481247,0.0005975173],"domain_scores_gemma":[0.9957236,0.00018921049,0.000658304,0.0028975648,0.00037254312,0.00015874702],"candidate_categories":["metaepi_narrow","sts","open_science"],"consensus_categories":[],"category_scores_codex":[0.0011716908,0.0003462095,0.00034614568,0.0004264488,0.0014637996,0.000618857,0.0060008448,0.000109042914,0.0002983084],"category_scores_gemma":[0.00011181352,0.0004434224,0.000120185345,0.0029718333,0.00013307654,0.0018071414,0.0027183564,0.00090509705,0.00006553945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001830656,0.00018196703,0.0015088221,0.000014026832,0.000016348795,0.0000041456483,0.0013821832,0.96174926,0.0000081169555,0.018749643,0.0016091748,0.014757986],"study_design_scores_gemma":[0.0011581222,0.000049328846,0.0021013187,0.00003136619,0.000008481158,0.000020147452,0.0011009852,0.9870949,0.000016703365,0.00028086524,0.007685081,0.00045271928],"about_ca_topic_score_codex":0.0006192118,"about_ca_topic_score_gemma":0.00038399672,"teacher_disagreement_score":0.80065864,"about_ca_system_score_codex":0.0013311015,"about_ca_system_score_gemma":0.00064709736,"threshold_uncertainty_score":0.99983615},"labels":[],"label_agreement":null},{"id":"W4315629947","doi":"10.1109/globecom48099.2022.10001126","title":"Analyzing Age Performance of Hybrid-ARQ: A Unified Explicit Result","year":2022,"lang":"en","type":"article","venue":"GLOBECOM 2022 - 2022 IEEE Global Communications Conference","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Key Research and Development Program of China; National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Computer science; Decoding methods; Robustness (evolution); Minification; Automatic repeat request; Coding (social sciences); Block (permutation group theory); Algorithm; Real-time computing; Transmission (telecommunications); Mathematics; Telecommunications","score_opus":0.036459702392934216,"score_gpt":0.27186259832829757,"score_spread":0.23540289593536334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315629947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18625882,0.0010918695,0.7116823,0.0054198713,0.0013251249,0.0014777029,0.00091035425,0.00091950886,0.090914436],"genre_scores_gemma":[0.9580315,0.0005668029,0.040081285,0.00033625236,0.00001401157,0.00021079513,0.00032943097,0.000011998225,0.0004179583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99677235,0.00053853827,0.0010041363,0.00046094853,0.0007848536,0.00043916167],"domain_scores_gemma":[0.994395,0.00015555936,0.00076502963,0.004097189,0.00044471156,0.00014250969],"candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0009810433,0.0002832568,0.00038000033,0.00026607292,0.0012671237,0.0002241497,0.007315103,0.00004517819,0.00034858394],"category_scores_gemma":[0.00011232139,0.00034297368,0.00014200066,0.0025200166,0.00017508352,0.0012862951,0.003960659,0.0005689936,0.000055651755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017727462,0.0009875429,0.004936109,0.00014096846,0.00026665913,0.000041927433,0.0035459853,0.12515569,0.0016234923,0.7782062,0.026080713,0.05883743],"study_design_scores_gemma":[0.00086677197,0.00027906214,0.0020556396,0.00004505219,0.000033101584,0.000102374564,0.00087807624,0.9752018,0.0006904067,0.0024208738,0.016813882,0.00061300077],"about_ca_topic_score_codex":0.00027085518,"about_ca_topic_score_gemma":0.00006812629,"teacher_disagreement_score":0.8500461,"about_ca_system_score_codex":0.000556386,"about_ca_system_score_gemma":0.00049355143,"threshold_uncertainty_score":0.99990225},"labels":[],"label_agreement":null},{"id":"W4315783207","doi":"10.1109/gcwkshps56602.2022.10008649","title":"Dynamic Unicast-Multicast Scheduling for Age-Optimal Information Dissemination in Vehicular Networks","year":2022,"lang":"en","type":"article","venue":"2022 IEEE Globecom Workshops (GC Wkshps)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University; York University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Unicast; Multicast; Computer science; Computer network; Scheduling (production processes); Distributed computing; Dissemination; Dynamic priority scheduling; Telecommunications; Engineering; Quality of service","score_opus":0.006884346218594665,"score_gpt":0.24788768321301333,"score_spread":0.24100333699441867,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4315783207","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01898123,0.000107929234,0.9765775,0.0012150005,0.0012664244,0.0010590734,0.000026733283,0.00028501876,0.0004810986],"genre_scores_gemma":[0.8092129,0.000051404117,0.18824683,0.00075315,0.00006521329,0.0006505554,0.00075521384,0.00003246618,0.00023220961],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997084,0.00017547027,0.000985451,0.00042626337,0.0007041903,0.00062459015],"domain_scores_gemma":[0.99810255,0.00032594867,0.00050397747,0.0007286828,0.00020546277,0.00013338857],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013369861,0.000314954,0.00032411818,0.00057133357,0.0006694464,0.00050367584,0.0013355393,0.00015724177,0.00010156388],"category_scores_gemma":[0.00023033678,0.0003735196,0.00016149633,0.0018698282,0.00004877701,0.0036743968,0.0005797012,0.0006241046,0.00003187615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004387676,0.00007525398,0.000061027604,0.00002579416,0.000016904343,0.000010511123,0.0013983648,0.9577018,0.000024031995,0.003181882,0.0016113372,0.035849225],"study_design_scores_gemma":[0.0009017914,0.000082330174,0.000602401,0.000047651916,0.000012536449,0.000026978849,0.0010446112,0.9930294,0.000022874772,0.00016512256,0.0036589303,0.00040533178],"about_ca_topic_score_codex":0.00001111708,"about_ca_topic_score_gemma":0.000022601787,"teacher_disagreement_score":0.7902317,"about_ca_system_score_codex":0.0008137221,"about_ca_system_score_gemma":0.00010818985,"threshold_uncertainty_score":0.9998717},"labels":[],"label_agreement":null},{"id":"W4317951147","doi":"10.48550/arxiv.2301.09497","title":"Privacy-Aware Load Balancing in Fog Networks: A Reinforcement Learning Approach","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Reinforcement learning; Workload; Software deployment; Distributed computing; Load balancing (electrical power); Baseline (sea); Real-time computing; Service provider; Service (business); Computer network; Artificial intelligence","score_opus":0.05397759402796541,"score_gpt":0.1820966360256705,"score_spread":0.12811904199770507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317951147","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005534766,0.000015315538,0.98811024,0.000055472123,0.00036937112,0.00043701447,6.688991e-7,0.00058304414,0.0048940876],"genre_scores_gemma":[0.9890601,0.00017233368,0.0074050706,0.00006937009,0.000055102846,0.0000041716316,0.00008078577,0.000022962638,0.0031301032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809015,0.00011801939,0.0003846636,0.0007736879,0.00019602494,0.00043746116],"domain_scores_gemma":[0.9982512,0.00007425942,0.00044131727,0.00091777573,0.0002002135,0.000115235016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060749357,0.00029858184,0.0003047016,0.00044152298,0.00016448056,0.0002173226,0.0017097141,0.00029557917,0.000013115153],"category_scores_gemma":[0.000091886846,0.0003702371,0.00012614645,0.001174737,0.000038130227,0.0009907619,0.003308693,0.0008620922,0.000097863674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009148425,0.000016289232,0.0016441513,0.000072918716,0.000023248871,0.000058361242,0.001002228,0.9858241,2.2761013e-7,0.010849815,0.00022708077,0.0002724051],"study_design_scores_gemma":[0.00044082507,0.000022921178,0.0005640643,0.00016614434,0.0000109721595,0.0000021729124,0.00021294241,0.99714637,0.0000029675505,0.00091420574,0.00015143843,0.00036499967],"about_ca_topic_score_codex":0.00014960647,"about_ca_topic_score_gemma":0.000017110653,"teacher_disagreement_score":0.98352534,"about_ca_system_score_codex":0.00087816763,"about_ca_system_score_gemma":0.0003000923,"threshold_uncertainty_score":0.99987495},"labels":[],"label_agreement":null},{"id":"W4319865692","doi":"10.1109/lcomm.2023.3241007","title":"Age Minimization in Outdoor and Indoor Communications With Relay-Aided Dual RIS","year":2023,"lang":"en","type":"article","venue":"IEEE Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Natural Science Foundation of Sichuan Province; Natural Science Foundation of Shenzhen City","keywords":"Relay; Computer science; Wireless; Scheduling (production processes); Minification; Iterative method; Mathematical optimization; Convex optimization; Wireless network; Regular polygon; Dual (grammatical number); Algorithm; Mathematics; Telecommunications","score_opus":0.0332817607812193,"score_gpt":0.26526376037894406,"score_spread":0.23198199959772475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319865692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19643745,0.00020819847,0.6374089,0.15718749,0.00025017853,0.0011737378,0.000023620598,0.0013358265,0.0059745633],"genre_scores_gemma":[0.7374913,0.0005629702,0.25930324,0.0021283617,0.000011588036,0.00018302686,0.00019740549,0.000019912555,0.00010220425],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868906,0.00023555414,0.00042168645,0.00020734989,0.00022167574,0.00022466057],"domain_scores_gemma":[0.9960603,0.0003913672,0.00021062332,0.0031760628,0.00009408009,0.000067576424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040415543,0.00014001918,0.0001423278,0.0005171197,0.00040291034,0.00023514683,0.0019708502,0.00007003672,0.0000036791541],"category_scores_gemma":[0.00007597547,0.0001479217,0.000027033297,0.0016881091,0.0003009178,0.0013047963,0.00076537696,0.00027584308,0.000094969095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001601355,0.0013542984,0.04515644,0.0003045328,0.0005033718,0.00018967,0.14425,0.27143958,0.01146103,0.25893682,0.14987858,0.116365544],"study_design_scores_gemma":[0.0013323348,0.00005236929,0.018549077,0.00011498232,0.00001723293,0.000037500322,0.00062198855,0.9705115,0.00028116268,0.00024663098,0.0077892053,0.00044603072],"about_ca_topic_score_codex":0.000068727524,"about_ca_topic_score_gemma":0.00022423158,"teacher_disagreement_score":0.6990719,"about_ca_system_score_codex":0.00007126749,"about_ca_system_score_gemma":0.000054522156,"threshold_uncertainty_score":0.60320723},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Latency (audio); Cloud computing; Algorithm; Operating system","score_opus":0.02443733446414848,"score_gpt":0.2695016408801286,"score_spread":0.24506430641598015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321608472","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004685638,0.000011233021,0.9927527,0.0005672452,0.00033193975,0.0002237778,0.000012633338,0.00009570909,0.0013191466],"genre_scores_gemma":[0.7457226,0.000019818175,0.25126767,0.00041563116,0.00018664706,0.000025026844,0.00023102948,0.000024625024,0.0021069625],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987654,0.000013604467,0.0004539582,0.00019579135,0.0003815994,0.00018962089],"domain_scores_gemma":[0.9986575,0.00007356501,0.0005216427,0.00044388964,0.00022625463,0.00007714467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062778697,0.00010995444,0.000131599,0.00018698521,0.000064261534,0.0004667081,0.0015373132,0.00004281798,0.0000059296863],"category_scores_gemma":[0.00008173119,0.00009010512,0.000037560334,0.00021274087,0.00003374047,0.004258256,0.0002322537,0.00013414811,0.000037190337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008759628,0.0005281156,0.0014111765,0.00042214547,0.00078184303,0.00025402397,0.037108224,0.16167723,0.0047681043,0.012766484,0.55737716,0.22202952],"study_design_scores_gemma":[0.00060675567,0.0002447287,0.00004367398,0.00009826026,0.000008743091,0.00016853958,0.00010517274,0.9834852,0.002478069,0.0005399798,0.01207345,0.0001473813],"about_ca_topic_score_codex":0.0000043721766,"about_ca_topic_score_gemma":0.0000012199528,"teacher_disagreement_score":0.82180804,"about_ca_system_score_codex":0.00006281151,"about_ca_system_score_gemma":0.00006311995,"threshold_uncertainty_score":0.4500477},"labels":[],"label_agreement":null},{"id":"W4323646063","doi":"10.1109/fnwf55208.2022.00137","title":"INGR Roadmap Energy Efficiency Chapter","year":2022,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kootenay Association for Science & Technology","funders":"","keywords":"Computer science; Efficient energy use; Key (lock); Software deployment; Process (computing); Constraint (computer-aided design); Grid; Risk analysis (engineering); Environmental economics; Process management; Business; Engineering; Computer security; Software engineering","score_opus":0.006284905994393574,"score_gpt":0.18293545508985753,"score_spread":0.17665054909546396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323646063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00027157445,0.000010352918,0.85340923,0.0007632478,0.00019076356,0.000025559259,2.4759245e-7,0.00016888624,0.14516011],"genre_scores_gemma":[0.94134146,0.0000026950934,0.05062467,0.00293503,0.000015952508,0.00001873687,0.0000038459375,0.000003851895,0.0050537805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993855,0.000015324731,0.0001300089,0.00011197932,0.00025097988,0.00010623184],"domain_scores_gemma":[0.9996313,0.000011556786,0.000052598883,0.00024031696,0.000033086682,0.00003113932],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012936995,0.000047705806,0.000039614646,0.00010139607,0.00022790559,0.00006529582,0.0005306394,0.000009251825,0.0010100976],"category_scores_gemma":[0.000007326451,0.000045716475,0.000021333879,0.00024474252,0.000008445374,0.0005627332,0.00043808183,0.000042062544,0.000053997097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2938e-7,0.000014039485,0.000012815277,4.872721e-7,0.0000012626206,0.0000015348567,0.00047390253,0.06263649,0.000017065438,0.9154493,0.001296323,0.02009615],"study_design_scores_gemma":[0.000103513805,0.000044076096,0.000042993597,4.5461044e-7,3.7364262e-7,0.000014138769,0.000051804458,0.9410606,0.000434596,0.0008264161,0.057331447,0.0000895604],"about_ca_topic_score_codex":0.000016254713,"about_ca_topic_score_gemma":7.8638027e-7,"teacher_disagreement_score":0.94106984,"about_ca_system_score_codex":0.000033062544,"about_ca_system_score_gemma":0.000020820265,"threshold_uncertainty_score":0.99990314},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"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","score_opus":0.032002948719707054,"score_gpt":0.2613346246592571,"score_spread":0.22933167593955006,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4362654030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05941548,0.000007945814,0.9372511,0.00022561794,0.0015170508,0.00010832552,0.0000062592426,0.000069155016,0.0013990924],"genre_scores_gemma":[0.92001206,0.000074666306,0.079372466,0.00018512926,0.0000720213,0.0000017293243,0.00015739774,0.000007448252,0.00011710229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981627,0.00007417506,0.0009912468,0.00011182495,0.0004890849,0.00017101063],"domain_scores_gemma":[0.9982706,0.0000868073,0.00090581726,0.0003981968,0.00028464705,0.000053932203],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009808447,0.00010670622,0.00019041124,0.0007157621,0.000039303162,0.00024150583,0.0016065143,0.00008581969,0.00003819118],"category_scores_gemma":[0.0003030061,0.00010450847,0.000052114086,0.00062127603,0.000034566725,0.00938658,0.00035195245,0.00020844383,0.000044238644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004888747,0.00027135562,0.0017952175,0.00043582483,0.00022576227,0.00018178555,0.08375193,0.558159,0.0057081287,0.005904854,0.09889753,0.24417974],"study_design_scores_gemma":[0.0007534716,0.000062498606,0.0014755636,0.00019057789,0.0000047058693,0.000083744875,0.0001527671,0.9933026,0.002787104,0.00028086346,0.0007914603,0.000114651724],"about_ca_topic_score_codex":0.000059939084,"about_ca_topic_score_gemma":0.0000042201777,"teacher_disagreement_score":0.86059654,"about_ca_system_score_codex":0.000072950286,"about_ca_system_score_gemma":0.000118467775,"threshold_uncertainty_score":0.68050444},"labels":[],"label_agreement":null},{"id":"W4366280964","doi":"10.3390/telecom4020013","title":"Analysis and Multiobjective Optimization of a Machine Learning Algorithm for Wireless Telecommunication","year":2023,"lang":"en","type":"article","venue":"Telecom","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"National Research Council Canada; Université du Québec en Outaouais","funders":"","keywords":"Hyperparameter; Computer science; Energy consumption; Machine learning; Algorithm; Artificial intelligence; Wireless; Wireless network; Engineering","score_opus":0.009830576212080956,"score_gpt":0.24809194587157565,"score_spread":0.2382613696594947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366280964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033677465,0.000024086781,0.99583703,0.0001383846,0.000026000169,0.00023139706,0.000008877462,0.00022456188,0.00014190939],"genre_scores_gemma":[0.22871326,0.00015239096,0.77064675,0.00002818558,0.000008639488,0.00003503533,0.0002820277,0.000008433032,0.00012528474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992782,0.00005626401,0.00026347328,0.00015371651,0.0001247072,0.00012366852],"domain_scores_gemma":[0.99904764,0.0002005677,0.00023596642,0.00025047254,0.00023452363,0.000030820647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036484792,0.00008086457,0.00016304148,0.00050852133,0.00015739418,0.000059051057,0.00027032834,0.000047790905,0.000007329081],"category_scores_gemma":[0.00008300461,0.00008441553,0.000054213077,0.0017760135,0.000025057167,0.0005755199,0.0001275232,0.000069200076,0.0000035805006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031747793,0.000014902687,0.00075535907,0.000010650162,0.00008477721,1.1410759e-7,0.0013571974,0.7578614,0.000029393206,0.0004591917,0.00002016321,0.2394037],"study_design_scores_gemma":[0.0003199782,0.00004808776,0.0021364726,0.00000469953,0.0000335103,8.921518e-7,0.00008577356,0.9965459,0.0006267296,0.00006071874,0.00005066314,0.000086563436],"about_ca_topic_score_codex":0.00004136197,"about_ca_topic_score_gemma":0.000011263033,"teacher_disagreement_score":0.23931713,"about_ca_system_score_codex":0.000029646126,"about_ca_system_score_gemma":0.000022438127,"threshold_uncertainty_score":0.34423655},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"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","score_opus":0.00823544509153541,"score_gpt":0.20822501065413498,"score_spread":0.19998956556259959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4368232611","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01129609,0.000050153125,0.98564005,0.0011760737,0.00008304813,0.0004106003,2.8042902e-7,0.0011387167,0.00020498638],"genre_scores_gemma":[0.97890526,0.00005998303,0.020492483,0.00020757824,0.000009509077,0.00019925965,0.000025804931,0.000020770067,0.0000793356],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983841,0.00008784468,0.00042255034,0.00042980642,0.00028519606,0.00039046144],"domain_scores_gemma":[0.9991609,0.00006597215,0.00014526893,0.0004879136,0.00008034637,0.00005961924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005040331,0.0002062252,0.00020771915,0.0014872758,0.00031524798,0.00009302944,0.00043048823,0.0003284416,0.0000044020667],"category_scores_gemma":[0.000024918581,0.0002241169,0.000058136302,0.0027639016,0.00009457201,0.0004510926,0.000013056863,0.0005636957,0.00003518401],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008602453,0.000032787822,0.000028193568,0.000018345187,0.000015627,0.000009708239,0.00024217549,0.9771981,0.00036960206,0.0014075177,0.000015641948,0.020653676],"study_design_scores_gemma":[0.00064012624,0.00011022247,0.000039998176,0.00004899498,0.000009959289,0.000018780145,0.00020206347,0.99501437,0.0028840546,0.00007551489,0.0007405372,0.000215377],"about_ca_topic_score_codex":0.000009862314,"about_ca_topic_score_gemma":0.0000060542798,"teacher_disagreement_score":0.96760917,"about_ca_system_score_codex":0.00015305849,"about_ca_system_score_gemma":0.00004195961,"threshold_uncertainty_score":0.9139222},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.027267800465437936,"score_gpt":0.28341119065197923,"score_spread":0.2561433901865413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4378697064","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07018638,0.000011637864,0.92758894,0.00046427737,0.00052956113,0.00016337211,0.0000015289448,0.00012382715,0.00093048945],"genre_scores_gemma":[0.94071186,0.0000052034306,0.058503147,0.00021662693,0.00006336209,0.0000064834503,0.0000032322926,0.000011808288,0.00047828635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983044,0.00009721842,0.00056229363,0.00018352634,0.00061829336,0.00023422622],"domain_scores_gemma":[0.997377,0.0002742965,0.00087010494,0.0002090757,0.0011573925,0.00011216374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006816369,0.00017056843,0.00021712974,0.00042097748,0.000112019254,0.00035322923,0.00076090737,0.00007297387,0.000027245142],"category_scores_gemma":[0.0003358369,0.00014081766,0.000050224167,0.0009695244,0.000071841314,0.0029310207,0.00011716832,0.00032145652,0.00009807601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018377705,0.000056248053,0.0001759657,0.000030105342,0.00016209923,0.000043686403,0.056495268,0.9172772,0.0006529817,0.010850481,0.0050877817,0.00898441],"study_design_scores_gemma":[0.0005431784,0.00038264212,0.0003471342,0.00030479507,0.000012349135,0.00008364609,0.0006882254,0.99253947,0.0034416744,0.0014218817,0.00005727934,0.00017771788],"about_ca_topic_score_codex":0.000026866028,"about_ca_topic_score_gemma":0.000009483681,"teacher_disagreement_score":0.8705255,"about_ca_system_score_codex":0.00016862024,"about_ca_system_score_gemma":0.00029178505,"threshold_uncertainty_score":0.57423776},"labels":[],"label_agreement":null},{"id":"W4379883149","doi":"10.1016/j.comnet.2023.109863","title":"Congestion-aware delay-guaranteed scheduling and routing with renewal optimization","year":2023,"lang":"en","type":"article","venue":"Computer Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Compute Canada; University of Victoria","keywords":"Computer science; Queuing delay; Goodput; Computer network; Network congestion; Network delay; Network packet; Distributed computing; Queue; Scheduling (production processes); End-to-end delay; Mathematical optimization; Throughput; Wireless","score_opus":0.008632974006670659,"score_gpt":0.20337254341311012,"score_spread":0.19473956940643947,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379883149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033886244,0.00003322747,0.9946833,0.00032118155,0.00036873037,0.0001826595,5.262249e-7,0.000798043,0.00022366049],"genre_scores_gemma":[0.503395,0.000040380397,0.49584112,0.00039799698,0.00021706228,0.000010488372,0.000050647275,0.00001612777,0.000031174346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988783,0.000047045032,0.00027678482,0.00030775197,0.00020305929,0.0002870575],"domain_scores_gemma":[0.9991864,0.00011193737,0.00015967934,0.0002916673,0.00016452669,0.00008579226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027986296,0.00016106,0.00014811162,0.00015932485,0.00028193204,0.0004294175,0.00033134606,0.00009362605,0.0000040853097],"category_scores_gemma":[0.000011594777,0.00014904627,0.000023084574,0.0008535521,0.00004128837,0.000880056,0.00027880757,0.00014297296,0.000013840245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000054409043,0.0000042296087,0.00057812076,0.0000061725864,0.0000118179605,0.0000109887515,0.0003691917,0.9825511,2.138636e-7,0.0027097962,0.00022811211,0.013524837],"study_design_scores_gemma":[0.0004282517,0.000057052075,0.00048321797,0.000099673016,0.0000053182594,0.000058311598,0.000023884682,0.99855113,0.0000029174773,0.000054657074,0.000043478485,0.00019210388],"about_ca_topic_score_codex":0.0000044539593,"about_ca_topic_score_gemma":0.0000019072227,"teacher_disagreement_score":0.5000064,"about_ca_system_score_codex":0.00002953857,"about_ca_system_score_gemma":0.00003669733,"threshold_uncertainty_score":0.60779303},"labels":[],"label_agreement":null},{"id":"W4380837421","doi":"10.2139/ssrn.4479441","title":"A Useable Multi-Level Besss Sizing Model for Low-Level Data Accessibility with Risk Assessment Application Under Marketization and High Uncertainties","year":2023,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; Université Laval","funders":"","keywords":"Marketization; Sizing; Computer science; Business; Environmental economics; Risk analysis (engineering); Econometrics; Economics; Geography","score_opus":0.08579456518411596,"score_gpt":0.3287802465965587,"score_spread":0.24298568141244273,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380837421","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042453576,0.00017983964,0.992851,0.0009803626,0.00017558012,0.0011384109,0.00023778716,0.00017681881,0.000014841298],"genre_scores_gemma":[0.48090813,0.003051753,0.5143491,0.00006869264,0.00009473872,0.00017248902,0.0008014768,0.000052663523,0.00050095306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963791,0.00015566549,0.00074126263,0.0008883066,0.0006210381,0.0012146482],"domain_scores_gemma":[0.99625254,0.00017353393,0.0013374652,0.0013563238,0.0007744449,0.00010571059],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0048513785,0.000375201,0.0003639806,0.00028346298,0.00064468704,0.0010782265,0.002031035,0.0002513771,0.0000014211925],"category_scores_gemma":[0.0001844103,0.00033309578,0.00006136068,0.00031653498,0.00006705246,0.0027621973,0.001644774,0.0017644202,0.0000021640174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005226707,0.00007385977,0.0008353785,0.00014511448,0.00020691415,2.1625057e-7,0.00025925582,0.93069685,0.0000065494887,0.030166272,0.000050463907,0.03750688],"study_design_scores_gemma":[0.0008510526,0.00004691506,0.00508305,0.00009966625,0.00006904709,0.000013654959,0.00030127377,0.83720887,0.0000070371693,0.15599242,0.0000047634126,0.00032222454],"about_ca_topic_score_codex":0.00019256005,"about_ca_topic_score_gemma":0.0011969056,"teacher_disagreement_score":0.4785019,"about_ca_system_score_codex":0.0016860045,"about_ca_system_score_gemma":0.0056299847,"threshold_uncertainty_score":0.99995875},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Calgary","funders":"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","score_opus":0.052381796413315286,"score_gpt":0.2620039865547206,"score_spread":0.20962219014140535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382119947","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029262183,0.000028132208,0.9909932,0.0014666717,0.0004901235,0.00046766465,0.000017098218,0.00094168703,0.0026692275],"genre_scores_gemma":[0.9792313,0.00028270233,0.019270826,0.00035645976,0.0000312504,0.00046775606,0.00012220078,0.000043876047,0.00019365382],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997049,0.00046202136,0.0008778962,0.0004931274,0.0005309975,0.00058698485],"domain_scores_gemma":[0.9959734,0.00058810227,0.00029044156,0.002799377,0.00018300574,0.00016566174],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006804904,0.00034201436,0.00036496267,0.0011872357,0.00087152084,0.00034293858,0.002472317,0.0003185168,0.000016297392],"category_scores_gemma":[0.000017657087,0.00038090697,0.00017419981,0.0047767484,0.00021490958,0.0010007917,0.00004883729,0.00081103604,0.00007292096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022196673,0.0005095728,0.00001652427,0.000009150148,0.000024567482,0.0000067040837,0.00071787945,0.9558101,0.00009946826,0.009430887,0.00024759956,0.0331053],"study_design_scores_gemma":[0.0012875617,0.000056505338,0.00007021634,0.000092183036,0.000013267141,0.000007142302,0.00018805065,0.9967236,0.00069941283,0.000082642495,0.00039234947,0.00038708796],"about_ca_topic_score_codex":0.00017938415,"about_ca_topic_score_gemma":0.00015303021,"teacher_disagreement_score":0.97630507,"about_ca_system_score_codex":0.0002792632,"about_ca_system_score_gemma":0.000281669,"threshold_uncertainty_score":0.9998643},"labels":[],"label_agreement":null},{"id":"W4382141796","doi":"10.48550/arxiv.2306.13284","title":"Correcting discount-factor mismatch in on-policy policy gradient methods","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Discounting; Distribution (mathematics); Variance (accounting); Applied mathematics; Mathematical optimization; Mathematics; Computer science; Statistics; Mathematical analysis; Economics; Finance","score_opus":0.1144003186648897,"score_gpt":0.27181754093605465,"score_spread":0.15741722227116495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382141796","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04028386,0.0000054468487,0.95201254,0.00084213476,0.0010295341,0.00038896507,0.000015329535,0.0004916146,0.0049305824],"genre_scores_gemma":[0.96225125,0.000110126166,0.033275485,0.00036687206,0.00021006216,0.0000038051376,0.000033190678,0.00003878508,0.0037104255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978211,0.00028274822,0.00039541593,0.0008548668,0.00015280304,0.0004930645],"domain_scores_gemma":[0.9977078,0.00032174468,0.00045934363,0.0011897358,0.000147249,0.00017413977],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000532693,0.0003606956,0.00036236653,0.001807961,0.00016420362,0.00023679777,0.0018360091,0.00027930585,0.0000139834765],"category_scores_gemma":[0.0004935062,0.00041673105,0.0001734153,0.002465417,0.00006479893,0.0007769654,0.0019297865,0.0006868049,0.00022311554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010973066,0.000045151577,0.0007136186,0.000053009262,0.000027141446,0.000061596766,0.0023350166,0.84296507,0.0000027502967,0.14731717,0.00015747348,0.0063110236],"study_design_scores_gemma":[0.00038348744,0.000038605554,0.0025954882,0.00017346695,0.0000080244145,0.000006078455,0.0002627374,0.9695925,0.00015484715,0.02610751,0.00019618012,0.00048106138],"about_ca_topic_score_codex":0.0017045937,"about_ca_topic_score_gemma":0.00010695888,"teacher_disagreement_score":0.9219674,"about_ca_system_score_codex":0.0012829257,"about_ca_system_score_gemma":0.0006408466,"threshold_uncertainty_score":0.99982846},"labels":[],"label_agreement":null},{"id":"W4382568265","doi":"10.1109/jiot.2023.3290644","title":"Optimizing Age of Information in Polar-Coded Status Update System","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Computer science; Puncturing; Polar code; Decoding methods; Real-time computing; Transmission (telecommunications); Redundancy (engineering); Tree traversal; Algorithm; Telecommunications","score_opus":0.010583765066717836,"score_gpt":0.23164433917868552,"score_spread":0.22106057411196767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382568265","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08413505,0.000016850781,0.9130161,0.000118255055,0.0007818122,0.00011645802,0.0000025059694,0.00009765262,0.0017153502],"genre_scores_gemma":[0.8900903,0.00003861259,0.10967574,0.00010890555,0.000019610623,0.0000029054015,0.000011946976,0.0000059622657,0.00004601403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813336,0.000059374885,0.0010239539,0.00007442671,0.00046672145,0.00024217679],"domain_scores_gemma":[0.99845034,0.00004477886,0.00097209564,0.00019155465,0.0002668538,0.00007440387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010394219,0.00010502372,0.00021497172,0.00086898735,0.00003414897,0.00022617234,0.000741739,0.00006773254,0.000009162114],"category_scores_gemma":[0.000100664976,0.000098931094,0.00007610909,0.00058773276,0.00002701719,0.006227682,0.000139707,0.00025325737,0.000051269493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015377611,0.00007052707,0.0014061142,0.00073378324,0.00014172248,0.00013152618,0.13502921,0.7945375,0.0040529976,0.02673441,0.0059162234,0.031092206],"study_design_scores_gemma":[0.0006245013,0.000063955,0.00040651803,0.00047568404,0.0000040786163,0.00009971401,0.0008784945,0.9879589,0.008725288,0.00021414922,0.00043330947,0.00011542517],"about_ca_topic_score_codex":0.000092492715,"about_ca_topic_score_gemma":0.0000017291438,"teacher_disagreement_score":0.80595523,"about_ca_system_score_codex":0.0001609155,"about_ca_system_score_gemma":0.00007998677,"threshold_uncertainty_score":0.4514919},"labels":[],"label_agreement":null},{"id":"W4382657674","doi":"10.1109/jsen.2023.3289883","title":"AoI-Based Sensor Selection for Target Tracking in Asynchronous Sensor Networks","year":2023,"lang":"en","type":"article","venue":"IEEE Sensors Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Asynchronous communication; Wireless sensor network; Computer science; Sorting; Selection (genetic algorithm); Sensor fusion; Greedy algorithm; Tracking (education); Real-time computing; Constraint (computer-aided design); Genetic algorithm; Artificial intelligence; Algorithm; Engineering; Machine learning; Computer network","score_opus":0.01748308770102475,"score_gpt":0.26234504284912835,"score_spread":0.2448619551481036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382657674","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058352824,0.000012997098,0.93860716,0.0009181618,0.001292243,0.00031268413,0.000002780868,0.00031106206,0.00019008927],"genre_scores_gemma":[0.6681015,0.0000362865,0.33002636,0.0005425016,0.00086179376,0.000020224206,0.000016855445,0.000046840956,0.00034766135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799854,0.00014686692,0.0006342308,0.0002585846,0.00037416728,0.0005876376],"domain_scores_gemma":[0.9986413,0.0002661449,0.00037210312,0.00020120243,0.00037309332,0.00014614247],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010808194,0.00020285997,0.00023057111,0.0006847662,0.0003858072,0.00044828444,0.00035243738,0.00015490333,0.000021998345],"category_scores_gemma":[0.0001855364,0.00020505674,0.0001379056,0.001247112,0.000027048296,0.0011345503,0.000020987753,0.00041874894,0.00006587087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025624315,0.000021696856,0.00073961954,0.000011626357,0.0000114550885,0.000027337528,0.00038805453,0.99121636,0.00028274636,0.00007386433,0.0027067487,0.004494877],"study_design_scores_gemma":[0.0009857606,0.000098989505,0.0013082955,0.000046606416,0.0000050241933,0.00023238437,0.00009230284,0.99299914,0.0029925522,0.00014522232,0.00085615314,0.0002375919],"about_ca_topic_score_codex":0.0000051606935,"about_ca_topic_score_gemma":0.000005298337,"teacher_disagreement_score":0.60974866,"about_ca_system_score_codex":0.00025699133,"about_ca_system_score_gemma":0.00016166149,"threshold_uncertainty_score":0.8361971},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03783894875347228,"score_gpt":0.2957146563548993,"score_spread":0.25787570760142703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383199388","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014400168,0.0005467879,0.005148904,0.0027045873,0.98891085,0.0006477927,0.000059696387,0.00030519837,0.001532187],"genre_scores_gemma":[0.0049109077,0.035892755,0.029750925,0.00015665403,0.92644036,0.00031782658,0.0020606108,0.00013737164,0.0003325924],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9950043,0.0008176044,0.0018626519,0.0004822883,0.001248396,0.00058479264],"domain_scores_gemma":[0.98919815,0.0030799136,0.0012341336,0.0041416,0.0021103034,0.00023590465],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020591246,0.0004983124,0.0006135016,0.0016257388,0.0009908973,0.0013794032,0.006353099,0.001073678,0.000006478112],"category_scores_gemma":[0.003257491,0.00053896266,0.00010374863,0.0031564538,0.00020467512,0.0026271162,0.00051407825,0.0046276716,0.0001172989],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016125603,0.0002951554,0.00004964882,0.000021896243,0.000035333105,0.0000049862133,0.0010746167,0.0050601913,0.00017593773,0.0006890677,0.9919304,0.00064661104],"study_design_scores_gemma":[0.0024309864,0.00027013707,0.00020590879,0.0013722077,0.000045584286,0.000034372035,0.00014450132,0.26256672,0.00011435694,0.0008261057,0.7308905,0.0010986025],"about_ca_topic_score_codex":0.00023054723,"about_ca_topic_score_gemma":0.0014469665,"teacher_disagreement_score":0.2610399,"about_ca_system_score_codex":0.0010021372,"about_ca_system_score_gemma":0.0015837564,"threshold_uncertainty_score":0.9997062},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.038492276150741474,"score_gpt":0.273831604589912,"score_spread":0.23533932843917055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383752889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041273744,0.000034093962,0.9691845,0.025711833,0.00008429081,0.00044655983,0.000001399391,0.00023301221,0.00017692253],"genre_scores_gemma":[0.5205901,0.00013363146,0.47812563,0.0008475224,0.00002937154,0.00011912268,0.000020259547,0.000010666677,0.00012369991],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921507,0.00008298586,0.00027858987,0.00014968499,0.00015482894,0.00011884694],"domain_scores_gemma":[0.99831367,0.000100647856,0.00014976774,0.0012515916,0.00010979507,0.000074553456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029831566,0.00007996039,0.00008910846,0.00031619033,0.00016139244,0.000059466987,0.001122354,0.0000356525,0.0000021782762],"category_scores_gemma":[0.000044981443,0.00009135684,0.000020138967,0.0011614943,0.00002885149,0.00074041117,0.00025584834,0.000073483636,0.00016099538],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014959213,0.000048537284,0.00004471083,0.0000356509,0.000038204915,4.679777e-7,0.009939075,0.5198223,0.25701612,0.03350565,0.06756605,0.111968316],"study_design_scores_gemma":[0.0002294345,0.00003522443,0.0009368364,0.000027977876,0.000007513537,0.000011704391,0.000087776425,0.98206913,0.01312956,0.0004275727,0.0028611394,0.00017613074],"about_ca_topic_score_codex":0.000020603056,"about_ca_topic_score_gemma":0.0000012895049,"teacher_disagreement_score":0.51646274,"about_ca_system_score_codex":0.000043428445,"about_ca_system_score_gemma":0.0000443735,"threshold_uncertainty_score":0.37254238},"labels":[],"label_agreement":null},{"id":"W4383820731","doi":"10.36227/techrxiv.23612247","title":"Energy Cost Conservation for Collaborative Edge Clouds with Online Mini-Batch Learning","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Scholarship Council; Ningbo Municipal Bureau of Science and Technology; National Science Foundation","keywords":"Provisioning; Computer science; Electricity; Revenue; Cloud computing; Service-level agreement; Task (project management); Distributed computing; Service provider; Central processing unit; Mathematical optimization; Enhanced Data Rates for GSM Evolution; Lagrange multiplier; Energy consumption; Online algorithm; Minification; Real-time computing; Service (business); Computer network; Engineering; Operating system; Algorithm; Artificial intelligence; Systems engineering","score_opus":0.038358038508578406,"score_gpt":0.273514300770433,"score_spread":0.23515626226185457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383820731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047297636,0.00001561821,0.9901257,0.0050141667,0.0005614231,0.0007781036,0.000059970673,0.000719543,0.0022524728],"genre_scores_gemma":[0.009449226,0.00011947987,0.96431154,0.0017263166,0.00022871197,0.0006626959,0.0035527558,0.00005859586,0.019890664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.000079491125,0.00048514683,0.00047452626,0.00034712194,0.0002480376],"domain_scores_gemma":[0.99698985,0.00033285283,0.00059036136,0.00046560256,0.0015416946,0.000079638696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032226794,0.00027427988,0.00029475306,0.00021521741,0.00019991364,0.00042639204,0.0006817775,0.00023788228,0.000015365027],"category_scores_gemma":[0.00016121453,0.00024493822,0.00005396246,0.0007056658,0.00005020736,0.00064117264,0.0005647512,0.00025906274,0.000021590933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093262606,0.00008781331,0.00032157733,0.000190692,0.00015169168,0.0000059212293,0.0037690909,0.8015804,0.000008969136,0.121622525,0.050371494,0.021796511],"study_design_scores_gemma":[0.0005784957,0.00015602773,0.00018830052,0.000110890425,0.000013074054,0.0000022935,0.0006248138,0.97127175,0.00028819407,0.001121449,0.025295466,0.00034923793],"about_ca_topic_score_codex":0.0001230724,"about_ca_topic_score_gemma":0.00035037132,"teacher_disagreement_score":0.16969131,"about_ca_system_score_codex":0.00014877124,"about_ca_system_score_gemma":0.00076186855,"threshold_uncertainty_score":0.99882907},"labels":[],"label_agreement":null},{"id":"W4383820770","doi":"10.36227/techrxiv.23612247.v1","title":"Energy Cost Conservation for Collaborative Edge Clouds with Online Mini-Batch Learning","year":2023,"lang":"en","type":"preprint","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"China Scholarship Council; Ningbo Municipal Bureau of Science and Technology; National Science Foundation","keywords":"Provisioning; Computer science; Electricity; Revenue; Cloud computing; Service-level agreement; Task (project management); Distributed computing; Service provider; Central processing unit; Enhanced Data Rates for GSM Evolution; Mathematical optimization; Baseline (sea); Energy consumption; Online algorithm; Lagrange multiplier; Minification; Real-time computing; Service (business); Computer network; Engineering; Algorithm; Artificial intelligence; Operating system; Systems engineering","score_opus":0.038358038508578406,"score_gpt":0.273514300770433,"score_spread":0.23515626226185457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383820770","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047297636,0.00001561821,0.9901257,0.0050141667,0.0005614231,0.0007781036,0.000059970673,0.000719543,0.0022524728],"genre_scores_gemma":[0.009449226,0.00011947987,0.96431154,0.0017263166,0.00022871197,0.0006626959,0.0035527558,0.00005859586,0.019890664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983657,0.000079491125,0.00048514683,0.00047452626,0.00034712194,0.0002480376],"domain_scores_gemma":[0.99698985,0.00033285283,0.00059036136,0.00046560256,0.0015416946,0.000079638696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032226794,0.00027427988,0.00029475306,0.00021521741,0.00019991364,0.00042639204,0.0006817775,0.00023788228,0.000015365027],"category_scores_gemma":[0.00016121453,0.00024493822,0.00005396246,0.0007056658,0.00005020736,0.00064117264,0.0005647512,0.00025906274,0.000021590933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000093262606,0.00008781331,0.00032157733,0.000190692,0.00015169168,0.0000059212293,0.0037690909,0.8015804,0.000008969136,0.121622525,0.050371494,0.021796511],"study_design_scores_gemma":[0.0005784957,0.00015602773,0.00018830052,0.000110890425,0.000013074054,0.0000022935,0.0006248138,0.97127175,0.00028819407,0.001121449,0.025295466,0.00034923793],"about_ca_topic_score_codex":0.0001230724,"about_ca_topic_score_gemma":0.00035037132,"teacher_disagreement_score":0.16969131,"about_ca_system_score_codex":0.00014877124,"about_ca_system_score_gemma":0.00076186855,"threshold_uncertainty_score":0.99882907},"labels":[],"label_agreement":null},{"id":"W4383960475","doi":"10.1109/tvt.2023.3290164","title":"Timely Status Update in Relay-Assisted Cooperative Communications","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Shenzhen Science and Technology Innovation Program; Science, Technology and Innovation Commission of Shenzhen Municipality; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Relay; Network packet; Computer network; Time division multiple access; Node (physics); Computer science; Transmission (telecommunications); Telecommunications; Engineering","score_opus":0.017016638230479292,"score_gpt":0.25817374575571067,"score_spread":0.24115710752523137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4383960475","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01216748,0.000035304336,0.9769598,0.008128311,0.00018185751,0.00032794944,0.000013581271,0.0015576981,0.0006279734],"genre_scores_gemma":[0.9371953,0.00043231715,0.061465897,0.00034052183,0.0000030132228,0.00021608024,0.000029506053,0.000017333607,0.00030002036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987024,0.000093896255,0.0003817593,0.0002823024,0.00019244212,0.00034717447],"domain_scores_gemma":[0.9982861,0.00007719856,0.00009883629,0.0013189183,0.00016396111,0.000054928543],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021151443,0.0001537941,0.0001770771,0.0013974403,0.0002974169,0.00006562752,0.0010593716,0.00024476618,0.000026772996],"category_scores_gemma":[0.000021448586,0.00016237439,0.000052793108,0.0041470663,0.00016450913,0.00062966626,0.000021442871,0.00050889567,0.0010858303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002073961,0.000399821,0.0000813999,0.000015090732,0.00008075178,0.000059388603,0.0012200734,0.8020145,0.0020314208,0.053329352,0.0009768704,0.13977054],"study_design_scores_gemma":[0.00078865857,0.000116567375,0.00040554785,0.0000366289,0.000008823647,0.000031688334,0.0002556878,0.9798708,0.011551451,0.0006720965,0.0059914715,0.00027059377],"about_ca_topic_score_codex":0.000016294805,"about_ca_topic_score_gemma":0.00008433785,"teacher_disagreement_score":0.92502785,"about_ca_system_score_codex":0.0001622131,"about_ca_system_score_gemma":0.000103444436,"threshold_uncertainty_score":0.99969196},"labels":[],"label_agreement":null},{"id":"W4384008567","doi":"10.1016/j.comcom.2023.07.010","title":"Average age upon decisions with truncated HARQ and optimization in the finite blocklength regime","year":2023,"lang":"en","type":"article","venue":"Computer Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Hybrid automatic repeat request; Computer science; Network packet; Decoding methods; Transmitter; Convexity; Throughput; Wireless; Algorithm; Mathematical optimization; Computer network; Telecommunications; Mathematics; Telecommunications link; Channel (broadcasting)","score_opus":0.03634150201452821,"score_gpt":0.2552905385347692,"score_spread":0.21894903652024097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384008567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012818733,0.0000506855,0.98906976,0.0072335415,0.000056987526,0.0003827849,0.0000034792388,0.00033647328,0.0015844384],"genre_scores_gemma":[0.36690682,0.0006203536,0.6311479,0.0008724116,0.00002062543,0.000086086904,0.00023320458,0.000014098913,0.000098475975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986907,0.0002660495,0.00034953217,0.00022563526,0.00025985957,0.00020819141],"domain_scores_gemma":[0.9963684,0.001089148,0.00014787399,0.0021995073,0.00013984882,0.00005521527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056905585,0.00014526244,0.00013697603,0.00037959803,0.0004914499,0.00045403608,0.002300433,0.00006095504,0.0000044225753],"category_scores_gemma":[0.00009334453,0.00011043254,0.000028069677,0.0020344744,0.00009350088,0.000940598,0.0008874676,0.00024065984,0.000052767744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003379814,0.00005049746,0.00007848808,0.0000034088048,0.0000094069355,0.000008763463,0.0055077695,0.960058,0.0000012681367,0.021050075,0.0013152998,0.011913671],"study_design_scores_gemma":[0.00041536512,0.0000454237,0.00305401,0.00005299523,0.0000040965624,0.0000218085,0.00008439277,0.9918294,0.0000024439894,0.000521854,0.003827812,0.0001403948],"about_ca_topic_score_codex":0.000012752867,"about_ca_topic_score_gemma":0.000046192014,"teacher_disagreement_score":0.36562493,"about_ca_system_score_codex":0.00003469201,"about_ca_system_score_gemma":0.0000559555,"threshold_uncertainty_score":0.45033085},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; 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","score_opus":0.04751076545740728,"score_gpt":0.27684454109445816,"score_spread":0.22933377563705087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384788000","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000286513,0.00012609086,0.9958811,0.0019687724,0.00021569816,0.000547877,0.000036343372,0.00057116087,0.0003664668],"genre_scores_gemma":[0.47349164,0.0004322203,0.52522826,0.00035438206,0.000052309526,0.00018455026,0.00014045941,0.000025140595,0.000091012706],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985482,0.00009517827,0.0004888358,0.00032724824,0.00021854337,0.00032200644],"domain_scores_gemma":[0.99770373,0.0005539783,0.00021214664,0.0012099813,0.00021504716,0.00010510976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004338929,0.00021183233,0.00021255552,0.0004197269,0.0012184972,0.00022799346,0.0010217314,0.0001312313,0.000005603489],"category_scores_gemma":[0.0000025394115,0.0002289057,0.00010820798,0.0014032105,0.00011005821,0.00044800874,0.000025262207,0.00026820716,0.0000071086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016054513,0.000120974495,0.000010209781,0.000022023816,0.000028084112,2.0952916e-7,0.0003543336,0.82351404,0.0000129526925,0.00034363515,0.00003740969,0.17554004],"study_design_scores_gemma":[0.0006854095,0.00007905583,0.000009764867,0.00007721882,0.0000226431,0.000003919531,0.00010990822,0.9973884,0.000043471406,0.00007968147,0.0012589038,0.00024160785],"about_ca_topic_score_codex":0.000030512916,"about_ca_topic_score_gemma":0.00003085308,"teacher_disagreement_score":0.47320515,"about_ca_system_score_codex":0.000061743965,"about_ca_system_score_gemma":0.00010456817,"threshold_uncertainty_score":0.9371819},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Beijing Jiaotong University; Natural Science Foundation of Beijing Municipality; 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","score_opus":0.05234589820079547,"score_gpt":0.256435605123491,"score_spread":0.20408970692269554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385191450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014516004,0.00007293199,0.98255855,0.00013930831,0.00052978407,0.0013152959,0.000026712903,0.0005243958,0.00031700675],"genre_scores_gemma":[0.9786572,0.00034908418,0.020132583,0.00006359513,0.00002773309,0.00048953143,0.0000447476,0.00003100391,0.0002045359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968266,0.0002940902,0.0011998173,0.0006285445,0.000638939,0.00041200678],"domain_scores_gemma":[0.9985081,0.00025195864,0.0002920836,0.0005178768,0.00026914614,0.00016085559],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014207544,0.0003398279,0.00035784626,0.0010629225,0.00020356814,0.00030127325,0.00048139266,0.00017546497,0.00002170238],"category_scores_gemma":[0.00001852606,0.0003420147,0.00010353338,0.0019347528,0.00011406266,0.0011875903,0.000002188574,0.00034606984,0.00014191591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049374845,0.00013670555,0.000027351518,0.00020211088,0.00003408962,0.0000068273303,0.029010365,0.95097023,0.00022266574,0.0147910565,0.000023161603,0.0045260545],"study_design_scores_gemma":[0.00038172002,0.00010732763,0.00024140338,0.00020529483,0.000017082408,0.000014134445,0.0040236926,0.9818111,0.011752848,0.0009997957,0.000072959374,0.00037262423],"about_ca_topic_score_codex":0.00018157472,"about_ca_topic_score_gemma":0.00004935892,"teacher_disagreement_score":0.9641412,"about_ca_system_score_codex":0.00016940368,"about_ca_system_score_gemma":0.00009495805,"threshold_uncertainty_score":0.9999032},"labels":[],"label_agreement":null},{"id":"W4385694459","doi":"10.1109/bsc57238.2023.10201459","title":"Optimum Digital Twin Response Time for Time-Sensitive Applications","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Replica; Markov decision process; Response time; Process (computing); Markov process; Stochastic process; Markov chain; Channel (broadcasting); Real-time computing; Computer network; Machine learning; Mathematics; Statistics","score_opus":0.008286575484845684,"score_gpt":0.23585962675010985,"score_spread":0.22757305126526417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385694459","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045173697,8.0639813e-7,0.9773393,0.0022130765,0.000028093717,0.0005344784,0.000026383263,0.00087043614,0.018535689],"genre_scores_gemma":[0.04456738,0.00000347344,0.7372683,0.0015209703,0.00015585036,0.0006442843,0.0006188659,0.00004689526,0.21517393],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927175,0.000018794397,0.00019052159,0.00018439506,0.00015435324,0.00018018196],"domain_scores_gemma":[0.9989617,0.00038482161,0.0000652146,0.00033614453,0.00018956623,0.00006258962],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032210787,0.00008392386,0.00008080989,0.00017845813,0.0001343425,0.00027949523,0.00033486227,0.000043175154,0.000041426578],"category_scores_gemma":[0.0001283692,0.00008076445,0.000049055776,0.0006594311,0.000024709727,0.001360611,0.00015160823,0.000031903517,0.010341532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045939873,0.00018721055,0.000018354629,0.000038605227,0.00011348546,0.0000132858495,0.004571749,0.15006916,0.0056178947,0.12085325,0.58317125,0.13488637],"study_design_scores_gemma":[0.00020259687,0.00004354218,0.000084923726,0.000003024928,0.0000015524453,0.000004830155,0.000038814982,0.9750483,0.0011129883,0.0006379301,0.022699026,0.00012243987],"about_ca_topic_score_codex":2.5020339e-7,"about_ca_topic_score_gemma":3.1164664e-8,"teacher_disagreement_score":0.8249792,"about_ca_system_score_codex":0.00003907331,"about_ca_system_score_gemma":0.00006437887,"threshold_uncertainty_score":0.99042904},"labels":[],"label_agreement":null},{"id":"W4385849326","doi":"10.48550/arxiv.2308.07242","title":"Age of Processing-Based Data Offloading for Autonomous Vehicles in Multi-RATs Open RAN","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Computer science; Cloud computing; Computation offloading; Latency (audio); Edge computing; Real-time computing; Low latency (capital markets); Enhanced Data Rates for GSM Evolution; Optimization problem; Convex optimization; Data processing; Distributed computing; Computer network; Artificial intelligence; Regular polygon","score_opus":0.26703828912890365,"score_gpt":0.26575603462172753,"score_spread":0.0012822545071761171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385849326","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009879654,0.000010145758,0.9884995,0.000092316564,0.0001668556,0.0008821782,0.000069526504,0.00016820172,0.00023160524],"genre_scores_gemma":[0.88633215,0.000010925992,0.11261594,0.00005696344,0.000010880021,0.00000425618,0.00043397408,0.00001834076,0.00051658665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855125,0.00006177387,0.00035176985,0.0007341696,0.00007742027,0.00022361164],"domain_scores_gemma":[0.9977873,0.00013051182,0.00048995955,0.0013427029,0.00018520594,0.000064301166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063767546,0.00019159343,0.00031195846,0.00043472982,0.000103125414,0.00026046767,0.0051820152,0.00018071049,0.0000032242142],"category_scores_gemma":[0.0001418868,0.00023380374,0.00005832451,0.00066968065,0.00006359821,0.0016622841,0.0043177265,0.00020733621,0.000012237712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027795595,0.000067344234,0.0005876729,0.00025579188,0.000015115665,0.00003752508,0.0005036812,0.99369985,0.000022166525,0.0034065389,0.000121252866,0.0012552644],"study_design_scores_gemma":[0.0009937156,0.000021025615,0.00078699255,0.0002604399,0.000015544889,2.51688e-7,0.00009156594,0.9960315,0.00021624759,0.0012526871,0.00009357147,0.00023646282],"about_ca_topic_score_codex":0.00017327549,"about_ca_topic_score_gemma":0.0002579966,"teacher_disagreement_score":0.8764525,"about_ca_system_score_codex":0.00016673609,"about_ca_system_score_gemma":0.0005937497,"threshold_uncertainty_score":0.962956},"labels":[],"label_agreement":null},{"id":"W4386025640","doi":"10.1109/tnse.2023.3306202","title":"To Compute or Not to Compute? Adaptive Smart Sensing in Resource-Constrained Edge Computing","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Agencia Estatal de Investigación; Ministerio de Asuntos Económicos y Transformación Digital, Gobierno de España; Ministero dell’Istruzione, dell’Università e della Ricerca; European Commission; Dipartimenti di Eccellenza","keywords":"Computer science; Wireless sensor network; Computation; Edge computing; Signal processing; Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Algorithm; Computer hardware; Computer network; Digital signal processing","score_opus":0.018368153339251715,"score_gpt":0.2298125842803477,"score_spread":0.211444430941096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386025640","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022480816,0.0000018966782,0.97513527,0.00071426696,0.00073514105,0.0003018868,0.0000016602938,0.00047036758,0.0001586921],"genre_scores_gemma":[0.74832445,0.0000029185271,0.25071144,0.00084704644,0.00006665398,0.0000039062406,5.5438994e-7,0.000010993178,0.000032036747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981492,0.00002171727,0.00033735414,0.0004348001,0.00044823962,0.0006086738],"domain_scores_gemma":[0.99904275,0.00024366731,0.0000432942,0.00027966683,0.00012135537,0.00026929486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010678902,0.00018639679,0.00019557094,0.0008753686,0.00044297863,0.00031025845,0.00047081345,0.000050385403,0.000001569028],"category_scores_gemma":[0.000027576578,0.00018873767,0.000029427662,0.005820341,0.000060109578,0.00070682494,0.000033155804,0.00021184162,0.000043998512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013231527,0.0000056027015,0.0000015681873,0.000005973486,0.0000033103959,0.000010149002,0.0015979768,0.9357502,0.00018225584,0.00025205748,0.0002634533,0.061914224],"study_design_scores_gemma":[0.00019624781,0.00010167784,0.0006893117,0.00017622676,0.0000019067771,0.000023264924,0.000108004424,0.9974397,0.00053844,0.0000046955756,0.00048905326,0.00023146166],"about_ca_topic_score_codex":0.000011911973,"about_ca_topic_score_gemma":0.000015604644,"teacher_disagreement_score":0.72584367,"about_ca_system_score_codex":0.00015256043,"about_ca_system_score_gemma":0.00012873508,"threshold_uncertainty_score":0.7696499},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010089181112721468,"score_gpt":0.2159558038780796,"score_spread":0.20586662276535814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386025741","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017694464,0.000011729027,0.9922965,0.00058409706,0.0003690454,0.0004395317,0.0000017771272,0.0001720811,0.004355755],"genre_scores_gemma":[0.9246247,0.0011729926,0.07184195,0.0019514741,0.000032423886,0.00012668075,0.00006355709,0.000014563707,0.00017165259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883884,0.00004575795,0.00045994323,0.00016817584,0.0001952233,0.0002920565],"domain_scores_gemma":[0.9993717,0.000060249873,0.00013130628,0.0002888448,0.000086339576,0.000061537605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003941721,0.00014779181,0.0001675786,0.0003598794,0.00017346068,0.00013792356,0.00029955333,0.00007111067,0.000013238317],"category_scores_gemma":[0.0000010145608,0.00015271641,0.00003481658,0.0018971651,0.000017868555,0.0012765324,0.000017936094,0.00014508203,0.00003786377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002156563,0.00002103898,0.0000053045273,0.00004994335,0.000026849139,0.0000049370988,0.0020340218,0.9626625,8.5935864e-7,0.0014661625,0.00015856879,0.033548214],"study_design_scores_gemma":[0.0006235672,0.00005355913,0.0005920817,0.00008738376,0.0000100239995,0.000001086188,0.00039788024,0.99713427,0.000025266112,0.000070744914,0.00085877883,0.00014535352],"about_ca_topic_score_codex":0.000026626652,"about_ca_topic_score_gemma":0.000057846974,"teacher_disagreement_score":0.92285526,"about_ca_system_score_codex":0.000049737915,"about_ca_system_score_gemma":0.000015038872,"threshold_uncertainty_score":0.62275946},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00966022925799449,"score_gpt":0.2061082348590664,"score_spread":0.19644800560107192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386362960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012094073,0.000005215449,0.9941183,0.00047568194,0.00034386833,0.00037015878,0.0000016815129,0.00020671058,0.003269027],"genre_scores_gemma":[0.9223331,0.0015085094,0.074139066,0.0015937813,0.000030580344,0.00013090599,0.00011094118,0.000015932319,0.00013713712],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988611,0.00005120168,0.00044467105,0.00014951116,0.00023306697,0.000260455],"domain_scores_gemma":[0.9993836,0.000046531994,0.00014768749,0.00029177096,0.00007542503,0.000054983193],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003747285,0.00012979758,0.00014618944,0.00041499076,0.00014042741,0.00011114269,0.00028106646,0.000074552954,0.000011361884],"category_scores_gemma":[6.91467e-7,0.00013779997,0.00003185068,0.0023834154,0.000014685039,0.0011829938,0.000013401484,0.000110809255,0.00001978817],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015942407,0.000024039835,0.000010702918,0.00006940924,0.000018068255,0.0000029036564,0.0005146224,0.9109457,3.8056984e-7,0.0012794641,0.00011191094,0.08700687],"study_design_scores_gemma":[0.00053760625,0.000031373907,0.0020358723,0.00008143486,0.000011012419,0.0000012598815,0.00018343594,0.9965363,0.00000914264,0.000060935196,0.0003856631,0.00012594841],"about_ca_topic_score_codex":0.000030742245,"about_ca_topic_score_gemma":0.00006527635,"teacher_disagreement_score":0.92112374,"about_ca_system_score_codex":0.000049391692,"about_ca_system_score_gemma":0.000012096775,"threshold_uncertainty_score":0.561932},"labels":[],"label_agreement":null},{"id":"W4387319234","doi":"10.1109/tnse.2023.3321764","title":"Age of Information Minimization for UAV-Assisted Internet of Things Networks: A Safe Actor-Critic With Policy Distillation Approach","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Network Science and Engineering","topic":"Age of Information Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Leverage (statistics); Computer science; Markov decision process; Lyapunov optimization; Network packet; Real-time computing; Mathematical optimization; Markov process; Computer network; Artificial intelligence","score_opus":0.009114273383029723,"score_gpt":0.20600705112653353,"score_spread":0.1968927777435038,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387319234","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029638903,0.000005172523,0.9961703,0.000056944245,0.00017763888,0.00027931642,0.0000022653805,0.00013048704,0.0002139904],"genre_scores_gemma":[0.8677169,0.000024329753,0.13212901,0.000038324484,0.000021012414,0.00003138887,0.000017032226,0.0000061048963,0.000015909913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989427,0.000008750398,0.00034054014,0.00014462789,0.00032972323,0.00023365978],"domain_scores_gemma":[0.9992432,0.00010098851,0.00014655101,0.00018195085,0.0002645687,0.000062758096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043534316,0.000112939604,0.00014310668,0.0005598251,0.00013191505,0.00011500543,0.00026258687,0.000051930358,7.277768e-7],"category_scores_gemma":[0.00003790271,0.000103808954,0.000030270381,0.002760011,0.00009482003,0.0028751574,0.0000061388987,0.00007222326,6.532276e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014075494,0.000009009089,0.000005536508,0.000072488605,0.0000075315206,8.313107e-8,0.0013636047,0.97848445,0.00008915138,0.0027858797,0.000026512793,0.017141704],"study_design_scores_gemma":[0.00024809875,0.000095800126,0.0007983383,0.000092642724,0.000007962727,0.000004435638,0.00006154839,0.99804926,0.00044194187,0.00002523184,0.00007016617,0.00010459466],"about_ca_topic_score_codex":0.000014365624,"about_ca_topic_score_gemma":7.8322614e-7,"teacher_disagreement_score":0.864753,"about_ca_system_score_codex":0.00006768517,"about_ca_system_score_gemma":0.00010481232,"threshold_uncertainty_score":0.42332062},"labels":[],"label_agreement":null},{"id":"W4387641564","doi":"10.1049/stg2.12136","title":"Control coordination in inverter‐based microgrids using AoI‐based 5G schedulers","year":2023,"lang":"en","type":"article","venue":"IET Smart Grid","topic":"Age of Information Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Multidisciplinary University Research Initiative; Office of Energy Efficiency; Division of Electrical, Communications and Cyber Systems; Manitoba Hydro; U.S. Department of Energy; Office of Energy Efficiency and Renewable Energy; National Science Foundation","keywords":"Computer science; Microgrid; Scheduling (production processes); Latency (audio); Slicing; Co-simulation; Distributed computing; Grid; Embedded system; Real-time computing; Control (management); Engineering","score_opus":0.020001719932121003,"score_gpt":0.2500171761257641,"score_spread":0.23001545619364308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387641564","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077201866,0.000007792307,0.9167118,0.0039733527,0.0010253103,0.00034883938,0.000010582138,0.0004325511,0.00028787172],"genre_scores_gemma":[0.9634618,8.0775015e-7,0.034104194,0.0021762715,0.0000837886,0.000031545092,0.00008801982,0.000015111583,0.000038443744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986408,0.00009193068,0.00037799985,0.00025297832,0.00032233962,0.0003139622],"domain_scores_gemma":[0.99914664,0.000106734136,0.0001594799,0.00035794813,0.00015197412,0.000077223434],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005623365,0.00015064162,0.00016574583,0.000568899,0.0001240337,0.0001859748,0.00043575285,0.000093899216,0.000018028984],"category_scores_gemma":[0.00010474608,0.0001622276,0.000062894556,0.0014261107,0.000041564417,0.0011177388,0.000044740485,0.00013000538,0.00019928385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003530989,0.00008931003,0.017453967,0.000058932605,0.000016363736,0.000027940154,0.00039109314,0.9597357,0.0036046798,0.001302674,0.012048587,0.005235475],"study_design_scores_gemma":[0.0016234862,0.00003297923,0.006542088,0.00004143938,0.0000039375113,0.000001950473,0.000019717478,0.9872225,0.0030229653,0.00004729471,0.0012605872,0.00018103277],"about_ca_topic_score_codex":0.000054524844,"about_ca_topic_score_gemma":0.000014174419,"teacher_disagreement_score":0.88626,"about_ca_system_score_codex":0.0001724157,"about_ca_system_score_gemma":0.00020056448,"threshold_uncertainty_score":0.6615449},"labels":[],"label_agreement":null},{"id":"W4387870148","doi":"10.1109/icc45041.2023.10278831","title":"Unequal Timeliness Protection Random Access Scheme for Satellite Internet of Things","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Random access; Computer network; Scheme (mathematics); Frame (networking); The Internet; Markov chain; Protocol (science); Internet of Things; Tracing; Markov process; Distributed computing; Computer security; Mathematics; Operating system","score_opus":0.0426033807281378,"score_gpt":0.2908343955308123,"score_spread":0.2482310148026745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870148","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031764717,0.0000038514877,0.9924049,0.00048236048,0.00021930308,0.0005109291,6.0926635e-7,0.00034414825,0.0028574578],"genre_scores_gemma":[0.46789792,0.000024494415,0.5236085,0.00048147453,0.000087050015,0.00024420058,0.00007109955,0.000018649163,0.007566612],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920917,0.000017680488,0.0003525499,0.00013150278,0.000176209,0.000112890244],"domain_scores_gemma":[0.99927175,0.00006753767,0.00018888558,0.00018146147,0.00026503237,0.000025347283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005394326,0.00006782533,0.00011775265,0.00016938419,0.00003608306,0.00013901922,0.0005049418,0.000046666493,0.00002748908],"category_scores_gemma":[0.00016570423,0.000056800916,0.00004685684,0.0005658576,0.000013307289,0.0025151726,0.00017921465,0.000041092066,0.00006461693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051915966,0.00009678716,0.00039830973,0.0006715067,0.00009601337,0.00000186891,0.00940263,0.0590767,0.0021115125,0.12178445,0.009716738,0.79612434],"study_design_scores_gemma":[0.00079520995,0.000028972687,0.00010713454,0.000018301871,0.0000013123198,6.413033e-7,0.000023668465,0.9805092,0.016388195,0.0006512312,0.0014061916,0.000069937334],"about_ca_topic_score_codex":0.000028724102,"about_ca_topic_score_gemma":8.7605014e-7,"teacher_disagreement_score":0.9214325,"about_ca_system_score_codex":0.000012904939,"about_ca_system_score_gemma":0.000033128017,"threshold_uncertainty_score":0.23162742},"labels":[],"label_agreement":null},{"id":"W4387870168","doi":"10.1109/icc45041.2023.10279275","title":"Age and Energy Analysis in Code-Based Status Update System over Fading Channels","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Natural Science Foundation of China","keywords":"Hybrid automatic repeat request; Fading; Computer science; Transmission (telecommunications); Redundancy (engineering); Block (permutation group theory); Energy (signal processing); Code (set theory); Real-time computing; Efficient energy use; Algorithm; Decoding methods; Telecommunications; Statistics; Mathematics; Engineering","score_opus":0.010825500720625306,"score_gpt":0.22449924617349715,"score_spread":0.21367374545287185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870168","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013359137,0.0000074851055,0.9833568,0.000119044096,0.000077278964,0.00004112323,0.0000028115319,0.00031085956,0.0027254599],"genre_scores_gemma":[0.98684585,0.000012490246,0.012381666,0.00027357286,0.00000705776,0.000015094138,0.0000420919,0.0000038434196,0.00041835735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920666,0.000033551718,0.0002237726,0.00016460111,0.00017914925,0.00019225325],"domain_scores_gemma":[0.9995756,0.00004196353,0.00007567535,0.00021208942,0.000034225417,0.00006044934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002385963,0.00007225277,0.00013183258,0.0007303463,0.00005108243,0.00019871599,0.00017096664,0.000035016983,0.000016234302],"category_scores_gemma":[0.000012877696,0.00006615118,0.000029722747,0.0022717628,0.0000100663665,0.0006854363,0.000098328666,0.000028410665,0.000021816139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018277874,0.000004094253,0.00092931726,0.000015607866,0.000026393687,0.000029809355,0.00039085138,0.9444311,0.000009900761,0.05093716,0.00032502387,0.0028988754],"study_design_scores_gemma":[0.00020452439,0.0000062949002,0.0027786077,0.000008875979,0.0000067426163,3.4691868e-7,0.00006824705,0.99612343,0.0001400122,0.0000313533,0.00054960366,0.000081945516],"about_ca_topic_score_codex":0.00018228347,"about_ca_topic_score_gemma":0.00011536001,"teacher_disagreement_score":0.97348666,"about_ca_system_score_codex":0.000065892,"about_ca_system_score_gemma":0.000025162335,"threshold_uncertainty_score":0.2697567},"labels":[],"label_agreement":null},{"id":"W4387870335","doi":"10.1109/icc45041.2023.10279360","title":"A Reconfigurable Access Scheme for Critical mMTC Networks with Unknown Event Occurrence","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Network packet; Computer network; Scheduling (production processes); Random access; Real-time computing; Scheme (mathematics); Reliability (semiconductor); ALARM; Greedy algorithm; Distributed computing; Algorithm; Engineering","score_opus":0.031975650265772114,"score_gpt":0.31882786603083746,"score_spread":0.28685221576506537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870335","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001527681,0.000007888651,0.98731303,0.0024884199,0.00026094136,0.0002686666,0.000002862694,0.000462744,0.009042702],"genre_scores_gemma":[0.26901233,0.000053037274,0.72259194,0.0028030938,0.00017071507,0.00049906486,0.00014652156,0.000023120607,0.0047001736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990649,0.000014391324,0.00021591321,0.00021926784,0.00018586828,0.00029965185],"domain_scores_gemma":[0.99907887,0.00021479304,0.00005654747,0.00030048,0.00026150967,0.00008777374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028755347,0.00009691818,0.00009752067,0.00009698148,0.00015595961,0.0004206271,0.0006837949,0.000047155198,0.00008782825],"category_scores_gemma":[0.00014608263,0.000077008,0.000030196185,0.0007474111,0.000033385557,0.00209303,0.00010247471,0.000072139366,0.00009239288],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029525809,0.000052579857,0.0002622637,0.00008566848,0.000020801304,0.000005884612,0.00029875737,0.43626568,0.0000072001244,0.40105888,0.12599735,0.035915416],"study_design_scores_gemma":[0.00021704262,0.0000624503,0.00012208344,0.00002884425,0.0000019083577,0.000005288764,0.000017330893,0.9926768,0.00022649678,0.00062965084,0.0058787097,0.0001334151],"about_ca_topic_score_codex":0.0000036438428,"about_ca_topic_score_gemma":0.000004337911,"teacher_disagreement_score":0.5564111,"about_ca_system_score_codex":0.00002638954,"about_ca_system_score_gemma":0.00008519019,"threshold_uncertainty_score":0.40561166},"labels":[],"label_agreement":null},{"id":"W4387870467","doi":"10.1109/icc45041.2023.10279671","title":"An Age-Critical LEC-CFDP Scheme for Dual-Hop Space-Air-Ground Integrated Networks","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Retransmission; Network packet; Computer science; Latency (audio); Computer network; Algorithm; Real-time computing; Telecommunications","score_opus":0.022135832493715108,"score_gpt":0.28727202302733496,"score_spread":0.26513619053361986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387870467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013765513,0.000007030964,0.9901631,0.0033216781,0.00047175624,0.00029002177,0.000003005503,0.0011757935,0.0031910455],"genre_scores_gemma":[0.19974895,0.000012877135,0.7941785,0.0017630478,0.0001911137,0.00008600026,0.00023654342,0.000026531792,0.0037564368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871814,0.000040666226,0.00030760016,0.00029065798,0.00023935111,0.00040355924],"domain_scores_gemma":[0.9987992,0.00022622936,0.000055196495,0.00046620457,0.00029431522,0.0001588227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004481285,0.00015251215,0.00014646718,0.00017960706,0.00021068806,0.00044579734,0.0004853907,0.00012090874,0.00007347357],"category_scores_gemma":[0.00026005154,0.00013573676,0.000059050104,0.0009959016,0.00006207074,0.002220006,0.00014188525,0.00012951386,0.00021843315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003104653,0.00010650272,0.000060996037,0.000042475986,0.000031777698,0.000036980615,0.0011286074,0.14171007,0.00031986673,0.7151088,0.118120186,0.023302656],"study_design_scores_gemma":[0.0002841621,0.00010643313,0.00018556493,0.00001246495,0.0000028129152,0.000006893769,0.000209329,0.99219894,0.00020466221,0.0011874514,0.0054133157,0.00018796454],"about_ca_topic_score_codex":0.00001943103,"about_ca_topic_score_gemma":0.000015881615,"teacher_disagreement_score":0.85048884,"about_ca_system_score_codex":0.00005774787,"about_ca_system_score_gemma":0.000072267045,"threshold_uncertainty_score":0.5535184},"labels":[],"label_agreement":null},{"id":"W4387872800","doi":"10.1109/icc45041.2023.10279272","title":"AoI-Driven Client Scheduling for Federated Learning: A Lagrangian Index Approach","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Scalability; Scheduling (production processes); Markov decision process; Convergence (economics); Lagrangian relaxation; Telecommunications link; Reinforcement learning; Distributed computing; Index (typography); Markov process; Mathematical optimization; Artificial intelligence; Computer network","score_opus":0.021879687477354234,"score_gpt":0.2519810420905067,"score_spread":0.23010135461315245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387872800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032231626,0.0000022898273,0.9799195,0.00054314366,0.00010847989,0.00032492966,4.40817e-7,0.00096225325,0.014915801],"genre_scores_gemma":[0.580279,0.0000034327236,0.4155072,0.00027893885,0.000038530994,0.000071575705,0.00008067788,0.000011716886,0.0037289143],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911666,0.00002511296,0.00021707728,0.00020340296,0.00020079964,0.0002369694],"domain_scores_gemma":[0.99947613,0.0000511763,0.00009030522,0.00015705619,0.00015976284,0.00006556295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029296597,0.000092075825,0.00009277567,0.00019388138,0.0002953777,0.00034569626,0.00029079668,0.0000656909,0.000011740391],"category_scores_gemma":[0.0000955731,0.00008392151,0.000049325354,0.0007954337,0.000012870068,0.0007270964,0.00013439365,0.00009366244,0.00017235283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050805193,0.000017258139,0.0003433711,0.000019046684,0.000011851059,5.839569e-7,0.0011256378,0.9630083,0.00003402594,0.024266355,0.0011160526,0.010052464],"study_design_scores_gemma":[0.00036817545,0.000040156567,0.00033113835,0.0000054404577,0.0000014341387,0.0000020695343,0.00033902517,0.99621004,0.00012431781,0.0001081851,0.0023543958,0.00011562165],"about_ca_topic_score_codex":0.000004694283,"about_ca_topic_score_gemma":0.0000013781582,"teacher_disagreement_score":0.5770559,"about_ca_system_score_codex":0.00003287656,"about_ca_system_score_gemma":0.000050116316,"threshold_uncertainty_score":0.342222},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Toronto Metropolitan University","funders":"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","score_opus":0.017374533956574383,"score_gpt":0.25163158243510747,"score_spread":0.2342570484785331,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387885634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024429045,0.000024607682,0.9941774,0.0019561194,0.00012318442,0.0005242045,0.000010023468,0.000713804,0.00002772526],"genre_scores_gemma":[0.5073206,0.00011225153,0.49220476,0.0001798676,0.000002549068,0.00006570507,0.000077950295,0.000010202247,0.000026148451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911016,0.00004065356,0.0003947192,0.00014739308,0.00014545629,0.0001616051],"domain_scores_gemma":[0.99887455,0.0001082715,0.0002046327,0.000515949,0.00026672613,0.000029881374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025365964,0.00012076496,0.00015994936,0.0009638073,0.00025005077,0.00006031527,0.00030298694,0.00020575483,0.0000020429866],"category_scores_gemma":[0.000041114687,0.00012985295,0.000054871187,0.0012325696,0.00010109882,0.00081345066,0.0000060680472,0.00012931247,0.000022560456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017106235,0.000056315963,0.000007277722,0.00013991055,0.00003139006,0.0000013099718,0.0006263077,0.59695536,0.0010882954,0.0057232864,0.00009092266,0.3952625],"study_design_scores_gemma":[0.0007140952,0.00007646294,0.000036995643,0.000059702736,0.000014013353,0.000006735692,0.00010322369,0.97166944,0.02534821,0.00046568894,0.0013833011,0.00012215198],"about_ca_topic_score_codex":0.0000075205994,"about_ca_topic_score_gemma":0.000010053058,"teacher_disagreement_score":0.5048777,"about_ca_system_score_codex":0.000045295154,"about_ca_system_score_gemma":0.00004638007,"threshold_uncertainty_score":0.529525},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Fundamental Research Funds for the Central Universities; 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","score_opus":0.021231498602608805,"score_gpt":0.2493298882073399,"score_spread":0.22809838960473108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388019181","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017151609,0.0000034208765,0.9796512,0.00019045487,0.0006257418,0.00051277253,6.259202e-7,0.0012030483,0.0006611108],"genre_scores_gemma":[0.9384023,0.0000018490608,0.061168704,0.0002073533,0.000087130684,0.000018855128,0.000032451248,0.00003393468,0.000047426027],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99713606,0.00020397788,0.0007664773,0.000590246,0.0006692854,0.0006339484],"domain_scores_gemma":[0.99859643,0.0003671862,0.0003563967,0.00035259634,0.00018806438,0.00013933414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00083289685,0.00033843872,0.00032754405,0.00079828734,0.00078040815,0.0003314341,0.0005223384,0.00012908947,0.000009164311],"category_scores_gemma":[0.000015701522,0.00035222253,0.00010561669,0.0025397986,0.000056537898,0.0005750915,0.000018569579,0.0006268095,0.000087223874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003037861,0.000075428485,0.00006188277,0.00005431617,0.000020733007,0.000010875766,0.0029487829,0.97374016,0.000018710056,0.00022462396,0.000031300067,0.02278282],"study_design_scores_gemma":[0.0014349938,0.00021631653,0.00015815905,0.00018168507,0.000011089138,0.000016580525,0.00051751535,0.9959363,0.0010867149,0.000012929767,0.000036965816,0.0003907542],"about_ca_topic_score_codex":0.000033304448,"about_ca_topic_score_gemma":0.00000763034,"teacher_disagreement_score":0.9212507,"about_ca_system_score_codex":0.00029075175,"about_ca_system_score_gemma":0.00014835426,"threshold_uncertainty_score":0.99989295},"labels":[],"label_agreement":null},{"id":"W4388040568","doi":"10.1109/pimrc56721.2023.10293908","title":"Co-operative Edge Intelligence for C-V2X Communication using Federated Reinforcement Learning","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Reinforcement learning; Convergence (economics); Computer science; Adaptation (eye); Enhanced Data Rates for GSM Evolution; Independent and identically distributed random variables; Distributed computing; Artificial intelligence; Mathematics; Physics; Statistics","score_opus":0.059697744240326166,"score_gpt":0.34081107140471173,"score_spread":0.2811133271643856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388040568","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000713603,0.000007557188,0.98803836,0.00043652303,0.00006932618,0.00038675842,3.9575178e-7,0.0004417174,0.009905783],"genre_scores_gemma":[0.7106851,0.000065882465,0.28469062,0.00044795574,0.000020156042,0.00006397209,0.00018454583,0.000012001606,0.003829818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914384,0.000053433494,0.0003185484,0.00013974887,0.00016552201,0.00017890247],"domain_scores_gemma":[0.999129,0.00014457092,0.00013339444,0.0002536659,0.00029799942,0.000041364267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004940854,0.000092128525,0.000087814464,0.00014570304,0.00062497426,0.00038150663,0.00040887072,0.00004328026,0.00005183243],"category_scores_gemma":[0.00014035004,0.00008793236,0.000029428575,0.00053357513,0.000026406724,0.001417654,0.00012788815,0.000086703854,0.00018746941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034803502,0.0000044023222,0.000017926159,0.0000084728135,0.000007662131,1.8104087e-7,0.0024512447,0.9506332,0.00023783676,0.03782473,0.0010737878,0.007737065],"study_design_scores_gemma":[0.00010946534,0.00004358684,0.000017742319,0.000018707107,0.0000015093759,0.0000014986942,0.0006744144,0.98503757,0.0123612,0.00023090244,0.0013910846,0.00011233744],"about_ca_topic_score_codex":0.000016982178,"about_ca_topic_score_gemma":0.0000025050551,"teacher_disagreement_score":0.7099714,"about_ca_system_score_codex":0.00009217094,"about_ca_system_score_gemma":0.00007232534,"threshold_uncertainty_score":0.480686},"labels":[],"label_agreement":null},{"id":"W4388666109","doi":"10.1109/twc.2023.3330967","title":"Channel-Aware Joint AoI and Diversity Optimization for Client Scheduling in Federated Learning With Non-IID Datasets","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Wireless Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Alliance de recherche numérique du Canada","keywords":"Computer science; Scalability; Scheduling (production processes); Markov decision process; Independent and identically distributed random variables; Telecommunications link; Convergence (economics); Distributed computing; Job shop scheduling; Channel (broadcasting); Artificial intelligence; Markov process; Mathematical optimization; Schedule; Computer network; Random variable; Database","score_opus":0.03477498577339587,"score_gpt":0.2594133022138545,"score_spread":0.22463831644045862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388666109","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008384044,0.000007298363,0.9891298,0.0014144666,0.000077837845,0.00056517735,0.000060370276,0.00031433138,0.000046672427],"genre_scores_gemma":[0.93943447,0.00037650642,0.05947813,0.00009512942,0.000004776273,0.00017459797,0.0003822669,0.000015841091,0.000038259113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99889135,0.00009573,0.00031355655,0.00026852105,0.00020226263,0.0002285714],"domain_scores_gemma":[0.99865603,0.00019866458,0.00015665582,0.0007212423,0.00018777007,0.000079659374],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00036077236,0.00015531653,0.00016626221,0.0004742306,0.0017673163,0.00019912022,0.0006181942,0.00008258362,0.0000045605007],"category_scores_gemma":[0.000011931474,0.00016399498,0.000035207977,0.0011103331,0.00007988903,0.0011630938,0.00006739494,0.00030182255,0.0000132282485],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015264444,0.00007784715,0.000021502448,0.000020641593,0.000016526203,6.8411276e-7,0.0014420082,0.99375033,0.000015166064,0.00012936007,0.000029972523,0.00448072],"study_design_scores_gemma":[0.0008014696,0.000090082656,0.00021628848,0.00010117573,0.000011555399,0.000004160096,0.00058413146,0.9974483,0.0005022799,0.000017749608,0.000037664606,0.00018510166],"about_ca_topic_score_codex":0.000068121764,"about_ca_topic_score_gemma":0.00018982151,"teacher_disagreement_score":0.9310504,"about_ca_system_score_codex":0.0001052328,"about_ca_system_score_gemma":0.00006814146,"threshold_uncertainty_score":0.9995322},"labels":[],"label_agreement":null},{"id":"W4388675097","doi":"10.1109/allerton58177.2023.10313434","title":"Communication-efficient Preference-based Federated Multi-resource Allocation","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Distributed computing; Resource allocation; Computer network; Resource (disambiguation); Convergence (economics); Enhanced Data Rates for GSM Evolution; Mathematical optimization; Telecommunications","score_opus":0.05229966922889865,"score_gpt":0.2555528834736838,"score_spread":0.20325321424478518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388675097","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024543372,0.0000071028535,0.9841692,0.0039165113,0.000048066755,0.0002455721,9.3831625e-7,0.0012378464,0.0079204505],"genre_scores_gemma":[0.823497,0.000005065003,0.17390358,0.0007501931,0.000005727405,0.000049970477,0.00017440021,0.000007487917,0.0016065609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990418,0.00007697903,0.000268416,0.00017137532,0.00026853374,0.0001728929],"domain_scores_gemma":[0.9988998,0.000101537735,0.00011560258,0.00058658357,0.00023608266,0.00006038957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00035514665,0.00009560756,0.00007309505,0.00019689628,0.00031174847,0.00029787858,0.0007034284,0.00005375107,0.0000412683],"category_scores_gemma":[0.00008823563,0.00008868775,0.000026833708,0.0010688691,0.000028770126,0.0004019203,0.00016963501,0.00007593196,0.0009304332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002214921,0.0000619464,0.000056004126,0.0000069679595,0.0000046500054,3.3777715e-7,0.0006472176,0.96319544,0.000068734575,0.023148613,0.004841628,0.007966234],"study_design_scores_gemma":[0.00034599213,0.000011665126,0.0014176357,0.000012498807,0.0000011091211,5.155567e-7,0.00008369932,0.9948315,0.0014288231,0.000038435996,0.0017170925,0.00011105455],"about_ca_topic_score_codex":0.000018862813,"about_ca_topic_score_gemma":0.000008902119,"teacher_disagreement_score":0.82104266,"about_ca_system_score_codex":0.000057725658,"about_ca_system_score_gemma":0.000093284885,"threshold_uncertainty_score":0.9998475},"labels":[],"label_agreement":null},{"id":"W4389191913","doi":"10.22215/etd/2023-15726","title":"Optimal Computational Task Offloading to a Edge Server with Firm Deadlines","year":2023,"lang":"en","type":"dissertation","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Markov decision process; Cloudlet; Dynamic programming; Curse of dimensionality; Mathematical optimization; Task (project management); Enhanced Data Rates for GSM Evolution; Signal processing; Distributed computing; State space; Computation; Markov process; Real-time computing; Digital signal processing; Cloud computing; Algorithm; Artificial intelligence; Mathematics; Computer hardware; Engineering","score_opus":0.01165578711519402,"score_gpt":0.2525150783671443,"score_spread":0.2408592912519503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389191913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026969796,0.000014357164,0.961974,0.00047893476,0.000753346,0.0005375212,0.000009065336,0.0008686047,0.0083943745],"genre_scores_gemma":[0.033638213,0.0000070781753,0.9088012,0.0009613678,0.00019014625,0.00015718165,0.003171108,0.00008641246,0.052987307],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807805,0.000022377526,0.00046465558,0.00044920368,0.0006909759,0.00029471866],"domain_scores_gemma":[0.9984592,0.000096689655,0.00025448183,0.00036973704,0.000671325,0.00014857238],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018168475,0.0003102077,0.0002587041,0.00051087845,0.00019721594,0.0004569515,0.00080599915,0.00016797917,0.00008174243],"category_scores_gemma":[0.000055556593,0.0002738229,0.000069238755,0.001099762,0.000011138251,0.0011404924,0.00011326361,0.00017678902,0.0011914106],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003397171,0.000022933367,0.000043191558,0.0001053819,0.000051664905,0.00001262199,0.003840838,0.9687926,0.000005964537,0.007908266,0.01581529,0.00336724],"study_design_scores_gemma":[0.00048061289,0.0001633396,0.0053167283,0.00031818246,0.000021493715,0.0000183283,0.00075681816,0.9901632,0.00019961229,0.0002360246,0.0015809047,0.00074474234],"about_ca_topic_score_codex":0.000037503058,"about_ca_topic_score_gemma":0.0001661048,"teacher_disagreement_score":0.053172816,"about_ca_system_score_codex":0.00009941182,"about_ca_system_score_gemma":0.00031671376,"threshold_uncertainty_score":0.9999714},"labels":[],"label_agreement":null},{"id":"W4389543055","doi":"10.1109/tmc.2023.3341082","title":"Age of Processing-Aware Offloading Decision for Autonomous Vehicles in 5G Open RAN Environment","year":2023,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mitacs","keywords":"Computer science; Cloud computing; Computation offloading; Edge computing; Distributed computing; Computation; Latency (audio); Embedded system; Enhanced Data Rates for GSM Evolution; Real-time computing; Artificial intelligence; Operating system","score_opus":0.024624974739677556,"score_gpt":0.28214784803396364,"score_spread":0.2575228732942861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389543055","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044843968,0.000009317365,0.953737,0.0000461339,0.00020831986,0.000874332,0.000006228708,0.00016938329,0.00010531755],"genre_scores_gemma":[0.90689325,0.000012148607,0.09284742,0.00004252125,0.000012048112,0.00010660618,0.000007968281,0.000014867299,0.000063144354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986426,0.000036593367,0.0005388897,0.00030853113,0.0002269062,0.000246438],"domain_scores_gemma":[0.9990767,0.00032288337,0.00019132259,0.0003077202,0.000050668288,0.000050699273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005726855,0.00013751048,0.00021372506,0.00037522314,0.00026774406,0.00017571893,0.00076365675,0.00006945536,0.000008689608],"category_scores_gemma":[0.000009604613,0.0001460182,0.00006973294,0.00063796306,0.000030464882,0.00075583684,0.000019768182,0.00012361638,0.00002699508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010412231,0.000046689962,0.0000061767605,0.000025955955,0.0000033452443,0.0000017242479,0.0013535538,0.65391463,0.00028118378,0.00003193364,0.000017310367,0.34430707],"study_design_scores_gemma":[0.00076764886,0.00012092194,0.00022463698,0.00017987886,0.0000039675765,0.0000027718972,0.0002671722,0.9894393,0.008493411,0.00014980196,0.00020318705,0.00014730194],"about_ca_topic_score_codex":0.000015269568,"about_ca_topic_score_gemma":0.0000061301193,"teacher_disagreement_score":0.8620493,"about_ca_system_score_codex":0.00013684526,"about_ca_system_score_gemma":0.00006904569,"threshold_uncertainty_score":0.5954449},"labels":[],"label_agreement":null},{"id":"W4389544890","doi":"10.1109/vtc2023-fall60731.2023.10333373","title":"Age of Information Minimization for Short-Packet Communications RSMA in Satellite-based IoT","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Block Error Rate; Computer science; Telecommunications link; Network packet; Rician fading; Minification; Computer network; Block (permutation group theory); Mathematical optimization; Fading; Algorithm; Real-time computing; Channel (broadcasting); Mathematics","score_opus":0.03820806547311557,"score_gpt":0.2840875582946097,"score_spread":0.24587949282149413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389544890","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026872274,0.0000067513174,0.9892765,0.001459895,0.00007460068,0.000533071,0.0000110383835,0.00024563906,0.005705267],"genre_scores_gemma":[0.4309986,0.000041140793,0.56702656,0.00046800458,0.000007265241,0.00011482608,0.0012237894,0.0000070151345,0.000112852125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895173,0.000039349532,0.0005753826,0.00008528264,0.00019727433,0.00015098954],"domain_scores_gemma":[0.9986663,0.00022491893,0.00015012581,0.00067832967,0.00024597134,0.000034341294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043412315,0.000084105355,0.0001180209,0.000588224,0.00007175567,0.00008919879,0.0007374954,0.00006820038,0.0000082657],"category_scores_gemma":[0.00018526925,0.00008602817,0.000043114454,0.0013778816,0.00003829142,0.0010279526,0.0001317411,0.00004825255,0.000045074987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003195346,0.00010893747,0.002348531,0.00020503593,0.000014002431,6.2637156e-7,0.00604408,0.6130255,0.00021676473,0.22082356,0.0030682613,0.15411274],"study_design_scores_gemma":[0.00037179847,0.000033220338,0.0038882894,0.000020240894,0.000001865395,2.9332307e-7,0.00016029536,0.98901016,0.0013856695,0.0005997731,0.004431766,0.000096648364],"about_ca_topic_score_codex":0.000012110786,"about_ca_topic_score_gemma":0.00003883989,"teacher_disagreement_score":0.42831135,"about_ca_system_score_codex":0.000050942035,"about_ca_system_score_gemma":0.00008364415,"threshold_uncertainty_score":0.3508127},"labels":[],"label_agreement":null},{"id":"W4389562156","doi":"10.7185/gold2023.18184","title":"Carbon pump dynamics and limited organic carbon burial during OAE1a","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Ocean Networks Canada Society; University of Victoria","funders":"","keywords":"Carbon fibers; Dynamics (music); Environmental science; Materials science; Composite material; Physics; Acoustics","score_opus":0.006387378677854899,"score_gpt":0.1935541848184186,"score_spread":0.1871668061405637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389562156","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93705535,0.0000064721735,0.048386894,0.0007919927,0.00036627697,0.00013723086,5.742916e-7,0.0008730332,0.012382199],"genre_scores_gemma":[0.9952177,0.000028772463,0.0031412826,0.00006403591,0.000043375905,0.000004821967,0.000012736502,0.0000100733205,0.0014772165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992248,0.00001797293,0.00019186272,0.00017805344,0.00019773813,0.00018956688],"domain_scores_gemma":[0.9995229,0.000030253797,0.00006320294,0.0002707016,0.00006296262,0.000049971306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001297583,0.00009359529,0.00008676342,0.00019733116,0.00007677506,0.00014839803,0.00025495456,0.00006055967,0.000011345513],"category_scores_gemma":[0.00005341736,0.00009111499,0.000014768334,0.0007472022,0.000016991567,0.00041641053,0.0002878798,0.00007056346,0.000022548473],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002794488,0.0004041924,0.05043821,0.0012110515,0.000599639,0.0006153556,0.05452239,0.2545263,0.061266713,0.45706457,0.0013492329,0.117722906],"study_design_scores_gemma":[0.000299103,0.000016531976,0.0046238285,0.0000062600316,0.0000023230552,0.0000103577995,0.00006718971,0.9923607,0.0023565392,0.00013109803,0.000009396609,0.00011668622],"about_ca_topic_score_codex":0.00004212036,"about_ca_topic_score_gemma":0.000028423805,"teacher_disagreement_score":0.7378344,"about_ca_system_score_codex":0.00007452879,"about_ca_system_score_gemma":0.00003117552,"threshold_uncertainty_score":0.37155616},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); University of Waterloo","funders":"University of Waterloo","keywords":"Ran; Computer science; Storm; Telecommunications; Computer network; Oceanography; Geology","score_opus":0.296812401978851,"score_gpt":0.37332876225962913,"score_spread":0.07651636028077813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389880088","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1037473,0.02571133,0.15601076,0.3193914,0.0012730522,0.0027188128,0.000025855956,0.0038751832,0.3872463],"genre_scores_gemma":[0.9012251,0.042378712,0.05437191,0.00017517275,0.000040288003,0.00015089892,0.000039501792,0.000017173266,0.0016012713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988622,0.0002417525,0.00026859238,0.00014251708,0.00026877417,0.0002161524],"domain_scores_gemma":[0.9976434,0.0005851895,0.00006167608,0.0013987388,0.00025193632,0.000059065842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018175606,0.000075755466,0.000100542486,0.00073474075,0.0002547334,0.000120921846,0.0014049151,0.000049702146,0.0000059914655],"category_scores_gemma":[0.00015502419,0.000081696766,0.00001460176,0.0008421541,0.00015973451,0.0010248207,0.0007177787,0.0002467196,0.00021661168],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008359591,0.000155619,0.00015620636,0.00011316588,0.00002185705,0.000019283518,0.043640655,0.0065520634,0.0008600694,0.5134845,0.009758512,0.4252297],"study_design_scores_gemma":[0.000737291,0.00010171426,0.009051773,0.00019400983,0.000003298514,0.000021349884,0.005791285,0.8604047,0.000277717,0.012923583,0.11010435,0.00038897316],"about_ca_topic_score_codex":0.000010586983,"about_ca_topic_score_gemma":0.000111301066,"teacher_disagreement_score":0.85385257,"about_ca_system_score_codex":0.00005334097,"about_ca_system_score_gemma":0.00006970081,"threshold_uncertainty_score":0.33314973},"labels":[],"label_agreement":null},{"id":"W4390422261","doi":"10.1109/jiot.2023.3348594","title":"Multitimescale Control and Communications With Deep Reinforcement Learning—Part II: Control-Aware Radio Resource Allocation","year":2023,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Computer science; Platoon; Resource allocation; Sample (material); Artificial intelligence; Function (biology); Process (computing); Control (management); Computer network","score_opus":0.009730845556524937,"score_gpt":0.22392411181249072,"score_spread":0.2141932662559658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390422261","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061121183,0.00006540727,0.9889241,0.0032130887,0.00013675194,0.00019622907,5.4896157e-7,0.000135649,0.0012161256],"genre_scores_gemma":[0.9844594,0.00009942851,0.01330142,0.0005472208,0.000042810945,0.000012236604,0.000011322217,0.000012081247,0.001514103],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985726,0.00012301753,0.00054727634,0.00013847569,0.0004125354,0.000206098],"domain_scores_gemma":[0.9982812,0.00016807465,0.00066747627,0.0003847494,0.00038559592,0.00011291898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008685019,0.00013415155,0.00020115348,0.00025362687,0.00031025076,0.00024101578,0.00091406604,0.00006214004,0.000019260791],"category_scores_gemma":[0.00009318103,0.000115621944,0.00005337308,0.00024389998,0.00012016641,0.0015623736,0.00015764091,0.0003773932,0.000020225143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019853718,0.00008108086,0.0010793229,0.000048558006,0.00030987896,0.000015895455,0.027551012,0.9322392,0.0004908856,0.00440327,0.014451516,0.019130865],"study_design_scores_gemma":[0.0017654472,0.00031397858,0.00019214278,0.00014438813,0.000019772691,0.00015654584,0.00025674034,0.99098665,0.000358036,0.000052762545,0.0056273094,0.00012623283],"about_ca_topic_score_codex":0.000021864658,"about_ca_topic_score_gemma":0.0000028969584,"teacher_disagreement_score":0.97834724,"about_ca_system_score_codex":0.00007818677,"about_ca_system_score_gemma":0.000053137093,"threshold_uncertainty_score":0.47149262},"labels":[],"label_agreement":null},{"id":"W4392175264","doi":"10.1109/globecom54140.2023.10436993","title":"Joint Admission and Power Control for Big Data Access Management Using GAT","year":2023,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; University of Victoria","funders":"National Key Research and Development Program of China; Aeronautical Science Foundation of China; National Mobile Communications Research Laboratory, Southeast University; National Natural Science Foundation of China","keywords":"Joint (building); Computer science; Control (management); Big data; Power (physics); Power control; Access control; Computer security; Computer network; Operating system; Engineering; Artificial intelligence","score_opus":0.13085101232920085,"score_gpt":0.32733134213659315,"score_spread":0.1964803298073923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392175264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007375465,0.000006060711,0.9949452,0.0013132129,0.00031523456,0.00032938085,0.0000051835295,0.0001674016,0.0021807505],"genre_scores_gemma":[0.49478257,0.0000636472,0.49979675,0.0028258222,0.00010907421,0.000019788566,0.000112946145,0.000017581431,0.0022718373],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940544,0.000009137534,0.00015411932,0.00017804201,0.00013288819,0.00012034239],"domain_scores_gemma":[0.99936575,0.000026446744,0.00006028883,0.0004497528,0.00004650775,0.000051273673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029411103,0.00005688409,0.00006221807,0.00012805371,0.0001044278,0.00033131594,0.0005539523,0.000019634612,0.0000136420695],"category_scores_gemma":[0.00003367205,0.00004633949,0.0000103938855,0.00023539754,0.000007808576,0.001636688,0.00088571233,0.000017652103,0.00001438086],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006625091,0.00009606383,0.00047330593,0.0004368292,0.00016664556,0.000027646614,0.0017922665,0.11429938,0.00055260287,0.08546241,0.23790458,0.558722],"study_design_scores_gemma":[0.00046309707,0.000011549116,0.00063336117,0.000014454643,0.0000038753274,0.0000018611221,0.000047203626,0.99318326,0.00011223346,0.0003856104,0.005074819,0.00006869872],"about_ca_topic_score_codex":0.0000032316993,"about_ca_topic_score_gemma":6.2077953e-7,"teacher_disagreement_score":0.87888384,"about_ca_system_score_codex":0.000015511429,"about_ca_system_score_gemma":0.000017383092,"threshold_uncertainty_score":0.31948873},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005780169401622869,"score_gpt":0.19855004953389788,"score_spread":0.192769880132275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393285839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036580075,0.00005895715,0.99523336,0.00036054078,0.0006823333,0.0008346848,0.00001910322,0.00014818585,0.0022970221],"genre_scores_gemma":[0.7763497,0.004905061,0.21663935,0.0012150878,0.00010025649,0.00029456112,0.00021903255,0.00003717033,0.00023972843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866796,0.0000498909,0.00058108533,0.00022216674,0.00024189359,0.00023698836],"domain_scores_gemma":[0.9991606,0.00016210835,0.0001604219,0.0003734607,0.0000916463,0.000051751224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044998425,0.00017152741,0.00017025023,0.00036815967,0.00023033614,0.00024397383,0.00035090285,0.00010182462,0.000006698569],"category_scores_gemma":[0.0000019259833,0.00017578821,0.000057797206,0.0012144871,0.000013234962,0.0015634722,0.000017623734,0.00015524772,0.0000062189933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060899343,0.000028250357,0.0000040220866,0.00028889763,0.000025631192,0.0000016846699,0.0009967281,0.91154087,2.9005176e-7,0.0022499613,0.0004983352,0.084304444],"study_design_scores_gemma":[0.0009913555,0.000087006054,0.00013870775,0.00026526515,0.000039961884,0.0000011165799,0.0002525228,0.9923306,0.00003800971,0.00038347108,0.005305613,0.00016634003],"about_ca_topic_score_codex":0.000028506585,"about_ca_topic_score_gemma":0.000102022816,"teacher_disagreement_score":0.778594,"about_ca_system_score_codex":0.000079658435,"about_ca_system_score_gemma":0.000022492304,"threshold_uncertainty_score":0.7168435},"labels":[],"label_agreement":null},{"id":"W4398220166","doi":"10.1007/978-3-031-57534-1_4","title":"Blockchain-Enabled Data Sharing Solution for HDT","year":2024,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blockchain; Data sharing; Computer science; Computer security; Medicine","score_opus":0.0477809982918062,"score_gpt":0.27524472418386375,"score_spread":0.22746372589205754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398220166","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000070854812,0.00019452334,0.9326356,0.0007500496,0.00296707,0.00071457244,0.000020215322,0.0004535574,0.062257346],"genre_scores_gemma":[0.0021943685,0.00006827432,0.95619524,0.0006725345,0.00085942243,0.000042814136,0.00006414768,0.00007785468,0.03982536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953013,0.0000067624737,0.00086557487,0.002133795,0.00097356585,0.0007190049],"domain_scores_gemma":[0.99547863,0.00011613722,0.00037422238,0.003497276,0.00035708587,0.0001766581],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.002654425,0.00045391542,0.00040885707,0.0011553102,0.0003561127,0.0016542708,0.009541097,0.00023485096,0.00002351975],"category_scores_gemma":[0.00008127836,0.00048453937,0.00010239173,0.0006161723,0.00032279713,0.002296685,0.009291203,0.0004936631,0.00018587617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043349896,0.000014365501,0.000003724086,0.00018651049,0.000017808283,0.000024637562,0.00046956548,0.02559719,0.000022708233,0.8932544,0.0010150505,0.07938968],"study_design_scores_gemma":[0.00020995479,0.000048494865,0.000011094878,0.00045928516,0.000009721235,0.000025008425,7.4674057e-7,0.93510634,0.000063884894,0.041421205,0.022139734,0.00050455926],"about_ca_topic_score_codex":0.000016277638,"about_ca_topic_score_gemma":0.000020661275,"teacher_disagreement_score":0.9095091,"about_ca_system_score_codex":0.00052838086,"about_ca_system_score_gemma":0.00058551703,"threshold_uncertainty_score":0.9997606},"labels":[],"label_agreement":null},{"id":"W4399417715","doi":"10.1109/lwc.2024.3410173","title":"Hybrid <i>k</i>-Preemptive Transmission Scheme for Minimal Age of Information in IoT Networks","year":2024,"lang":"en","type":"article","venue":"IEEE Wireless Communications Letters","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; University of Windsor","funders":"","keywords":"Computer science; Scheme (mathematics); Computer network; Transmission (telecommunications); Information transmission; Internet of Things; Mathematics; Telecommunications; Embedded system","score_opus":0.015713391623175373,"score_gpt":0.25191581789776796,"score_spread":0.2362024262745926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399417715","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016663957,0.00022030425,0.9761123,0.005852568,0.00015983763,0.00048788838,0.000014517148,0.00016486496,0.00032373975],"genre_scores_gemma":[0.7020766,0.00016545475,0.2964228,0.000969629,0.000018968323,0.00014730691,0.00017707133,0.000010851974,0.000011315459],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987034,0.00007890559,0.0006636944,0.00014458562,0.00020471295,0.0002047008],"domain_scores_gemma":[0.9983381,0.00031718324,0.00017243778,0.0010101468,0.000114071714,0.000048033413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043303292,0.00014120458,0.0001796553,0.00042080105,0.00012073965,0.00019062946,0.0015366797,0.00006440962,0.0000028580114],"category_scores_gemma":[0.000019227924,0.0001480354,0.000096542455,0.00055929495,0.000113395196,0.0020127096,0.0001293398,0.00022417454,0.0000110395995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009361771,0.00023200156,0.00015903288,0.0006429077,0.00011810822,0.000008034817,0.018286716,0.5165224,0.020838056,0.06527849,0.01349453,0.3643261],"study_design_scores_gemma":[0.00033615166,0.00002598468,0.00014451893,0.00025770205,0.000005497966,0.000004905726,0.000048788654,0.99031234,0.0020981033,0.00011417663,0.0064964998,0.000155357],"about_ca_topic_score_codex":0.00001936732,"about_ca_topic_score_gemma":0.000004401961,"teacher_disagreement_score":0.68541265,"about_ca_system_score_codex":0.00010048405,"about_ca_system_score_gemma":0.00007189643,"threshold_uncertainty_score":0.60367084},"labels":[],"label_agreement":null},{"id":"W4399728456","doi":"10.1109/tcomm.2024.3415608","title":"Age of Information Minimization for Opportunistic Channel Access","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Minification; Computer science; Channel (broadcasting); Computer network; Electronic engineering; Telecommunications; Engineering","score_opus":0.06464501266160738,"score_gpt":0.31630535704874535,"score_spread":0.25166034438713797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399728456","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010858982,0.000032029548,0.9921881,0.002304319,0.00052194006,0.0005497532,0.00012837964,0.00035673362,0.003907871],"genre_scores_gemma":[0.83722436,0.0005006591,0.16056412,0.00035307754,0.00001703003,0.00047450326,0.0004114365,0.000017860306,0.00043694087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989374,0.00005031267,0.0005413764,0.00012790863,0.00020461988,0.00013835588],"domain_scores_gemma":[0.9978887,0.00037974585,0.00015054677,0.001215411,0.00030373584,0.000061889186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002383253,0.00012473033,0.00013012392,0.00056534016,0.0003065829,0.0004040737,0.0015459846,0.00008215228,0.000020580592],"category_scores_gemma":[0.000026899559,0.00013119877,0.00010745903,0.000838804,0.00008092388,0.004144191,0.000015796119,0.00014391112,0.00004188862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037016332,0.00040744577,0.0000010566228,0.0005321411,0.00017616709,0.0000010783459,0.0076669147,0.3159695,0.00022987719,0.42450896,0.0049652946,0.24550454],"study_design_scores_gemma":[0.00020396573,0.00006527014,0.00001209688,0.0000895774,0.000026769303,0.0000049318164,0.000068902744,0.98414475,0.001266362,0.0025239827,0.011453736,0.00013964885],"about_ca_topic_score_codex":0.000013123007,"about_ca_topic_score_gemma":0.000011249196,"teacher_disagreement_score":0.8372135,"about_ca_system_score_codex":0.00007810811,"about_ca_system_score_gemma":0.00017048858,"threshold_uncertainty_score":0.535013},"labels":[],"label_agreement":null},{"id":"W4400728071","doi":"10.1109/iwcmc61514.2024.10592333","title":"Age-Aware Edge Caching and Multicast Scheduling Using Deep Reinforcement Learning","year":2024,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multicast; Computer science; Reinforcement learning; Scheduling (production processes); Computer network; Xcast; Enhanced Data Rates for GSM Evolution; Distributed computing; Artificial intelligence; Mathematical optimization; Mathematics","score_opus":0.02087263787488777,"score_gpt":0.2672204234612407,"score_spread":0.24634778558635292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400728071","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054932856,0.00009153502,0.98998785,0.00013975703,0.00018715372,0.00009018867,3.7132832e-8,0.0003689551,0.0036412156],"genre_scores_gemma":[0.73071957,0.000009994446,0.26885852,0.00009941268,0.000030325125,0.0000017439871,0.0000030133072,0.000006172087,0.0002712529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925363,0.000020670588,0.0002131698,0.00017801394,0.00016905312,0.00016547486],"domain_scores_gemma":[0.99966735,0.00005286065,0.000040095296,0.00013247928,0.00004574089,0.000061462604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024019685,0.00009424952,0.000072995295,0.00014924549,0.00022638557,0.000755989,0.00015746756,0.00003771054,0.000030354107],"category_scores_gemma":[0.000050646882,0.00008599056,0.000022918026,0.0002270719,0.000017832386,0.0017782396,0.00023319272,0.00015645177,0.000034901255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.4616343e-7,0.000001456713,0.000036695288,0.000034546654,0.0000067789206,0.000011680845,0.0020885263,0.9716483,0.00011310295,0.011945746,0.000006043432,0.014106678],"study_design_scores_gemma":[0.00008165066,0.00001308008,0.000023004472,0.00007317316,0.0000037761738,0.000025307738,0.00026074718,0.9988725,0.00021073582,0.0000370318,0.0002868379,0.000112113325],"about_ca_topic_score_codex":0.00002275778,"about_ca_topic_score_gemma":0.0000020853092,"teacher_disagreement_score":0.7252263,"about_ca_system_score_codex":0.00006610336,"about_ca_system_score_gemma":0.00003350664,"threshold_uncertainty_score":0.72900194},"labels":[],"label_agreement":null},{"id":"W4401162300","doi":"10.3390/en17153775","title":"Taking Advantage of Spare Battery Capacity in Cellular Networks to Provide Grid Frequency Regulation","year":2024,"lang":"en","type":"article","venue":"Energies","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Fonds de recherche du Québec – Nature et technologies; Mitacs","keywords":"Spare part; Battery capacity; Battery (electricity); Frequency regulation; Grid; Computer science; Telecommunications; Electrical engineering; Engineering; Operations management; Electric power system; Power (physics)","score_opus":0.017158187086252323,"score_gpt":0.22012571542902182,"score_spread":0.2029675283427695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401162300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10496531,0.000166991,0.8916646,0.00030786262,0.00056426664,0.000117854346,0.0000019792856,0.00014832121,0.0020628201],"genre_scores_gemma":[0.9186971,0.000009822763,0.08099998,0.00008759413,0.00008459706,0.00001390974,0.000013562061,0.0000067204182,0.0000867166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99916905,0.000033896533,0.00029779147,0.00017348633,0.00018402326,0.00014176458],"domain_scores_gemma":[0.99952334,0.000050392628,0.00009256024,0.00025476405,0.00005024519,0.00002871462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021060466,0.000088774716,0.00010086122,0.00023601948,0.000033997938,0.000120959456,0.00027174028,0.00004657029,0.000028335035],"category_scores_gemma":[0.000049104558,0.00008679526,0.0000283721,0.0005350463,0.00001807504,0.00147943,0.00010100918,0.00007713126,0.000010968809],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001225943,0.0000045970733,0.0004089952,0.000041406012,0.0000028569516,0.0000053284966,0.001482285,0.9644242,0.001358521,0.025376411,0.0003175751,0.006576595],"study_design_scores_gemma":[0.000066290195,0.000025112184,0.0035796927,0.00021788063,0.000002184351,0.000003169791,0.000093776136,0.97828895,0.016007362,0.0008703983,0.00069981976,0.00014538257],"about_ca_topic_score_codex":0.0000704304,"about_ca_topic_score_gemma":0.00003238836,"teacher_disagreement_score":0.8137318,"about_ca_system_score_codex":0.00007413329,"about_ca_system_score_gemma":0.000034472167,"threshold_uncertainty_score":0.3539408},"labels":[],"label_agreement":null},{"id":"W4401508542","doi":"10.1109/infocom52122.2024.10621295","title":"Backlogged Bandits: Cost-Effective Learning for Utility Maximization in Queueing Networks","year":2024,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queueing theory; Computer science; Maximization; Layered queueing network; Artificial intelligence; Mathematical optimization; Utility maximization; Machine learning; Computer network; Mathematical economics; Mathematics","score_opus":0.010986709747218423,"score_gpt":0.2576634246630168,"score_spread":0.24667671491579835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401508542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025856763,0.00007379874,0.9917886,0.0002763979,0.00037151919,0.0012293283,4.1555163e-7,0.00042288745,0.0055784318],"genre_scores_gemma":[0.9077124,0.000024924859,0.09111893,0.00019563183,0.00006135805,0.0003648304,0.00004540626,0.000011448755,0.00046505567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991267,0.00007650827,0.0002526272,0.00023876672,0.00011188203,0.0001935611],"domain_scores_gemma":[0.99935514,0.00032143164,0.000050413735,0.0001424641,0.00009490845,0.000035652498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006572255,0.000097086224,0.000100620724,0.00017254904,0.00009729422,0.00033802242,0.00019873284,0.000078319186,0.00004327607],"category_scores_gemma":[0.00017323713,0.0000911037,0.000039127117,0.00060402445,0.000013964326,0.0017571639,0.00007585874,0.00016009089,0.000021120159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007996058,0.000008809927,0.00046508628,0.000032398017,0.000006317349,0.000001469001,0.00064422475,0.7788025,0.0000038797893,0.020152424,0.00058400613,0.19929084],"study_design_scores_gemma":[0.00023030466,0.000032279506,0.0014060993,0.00004916057,0.0000019865051,0.0000023027167,0.00004322127,0.9936852,0.00009212967,0.00049698434,0.0038564822,0.00010384453],"about_ca_topic_score_codex":0.000012827253,"about_ca_topic_score_gemma":0.000017986838,"teacher_disagreement_score":0.90745384,"about_ca_system_score_codex":0.00011528957,"about_ca_system_score_gemma":0.000041605817,"threshold_uncertainty_score":0.37151012},"labels":[],"label_agreement":null},{"id":"W4401748508","doi":"10.1109/jiot.2024.3446801","title":"Digital-Twin-Empowered Resource Allocation for On-Demand Collaborative Sensing","year":2024,"lang":"en","type":"article","venue":"IEEE Internet of Things Journal","topic":"Age of Information Optimization","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University; University of Waterloo; Carleton University","funders":"","keywords":"Computer science; Resource allocation; Resource management (computing); Computer network","score_opus":0.010126489797751059,"score_gpt":0.25183746079468083,"score_spread":0.24171097099692979,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401748508","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036994996,0.000088167275,0.98246014,0.0018472637,0.0010189207,0.0001628235,0.0000032773228,0.00009457791,0.010625324],"genre_scores_gemma":[0.88315356,0.000014867049,0.11276623,0.00067802274,0.00021017261,0.0000025650652,0.0000080419595,0.00002087955,0.0031456908],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988378,0.000027054508,0.0004765615,0.00016632768,0.00034074814,0.00015148032],"domain_scores_gemma":[0.9988279,0.00020288659,0.00031110703,0.00016165701,0.00042669868,0.0000697938],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00054583343,0.0001225967,0.00014254739,0.00027478568,0.00007509599,0.0013205108,0.0004333784,0.00006333999,0.000007919353],"category_scores_gemma":[0.00017756943,0.00010637135,0.000090579306,0.0002824786,0.00003627627,0.0029876975,0.00004837071,0.00020174916,0.000024079713],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039697785,0.00014547839,0.000023388788,0.00033078305,0.0005783532,0.00009623146,0.09906135,0.08740006,0.004566348,0.053722847,0.36534268,0.3883355],"study_design_scores_gemma":[0.00033286933,0.00029374604,0.00000578175,0.00058773765,0.000009324313,0.00019159487,0.00028476713,0.9442573,0.023972949,0.0024730682,0.027436214,0.00015460825],"about_ca_topic_score_codex":0.0000011429296,"about_ca_topic_score_gemma":1.460631e-7,"teacher_disagreement_score":0.879454,"about_ca_system_score_codex":0.00011700959,"about_ca_system_score_gemma":0.000116035386,"threshold_uncertainty_score":0.9997162},"labels":[],"label_agreement":null},{"id":"W4402832984","doi":"10.1109/tvt.2024.3467255","title":"A Hybrid Collaborative Learning for Age of Information Minimization in Massive Access","year":2024,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"National Natural Science Foundation of China","keywords":"Minification; Computer science; Computer network; Artificial intelligence; World Wide Web","score_opus":0.007918751638797274,"score_gpt":0.2505636608950816,"score_spread":0.24264490925628432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402832984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056467457,0.000035346176,0.99164814,0.001194617,0.00028412053,0.00058095256,0.000013473065,0.00041213023,0.00018445261],"genre_scores_gemma":[0.9523472,0.000059237478,0.0471756,0.0000635768,0.000005259182,0.00026214868,0.000034394623,0.000009176305,0.000043397766],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904084,0.000034880934,0.00042092538,0.00017718786,0.00016476329,0.00016141214],"domain_scores_gemma":[0.99926907,0.00009191522,0.00013670643,0.00021458881,0.00026611664,0.00002161789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015600803,0.00012208117,0.0001627738,0.0016003201,0.00009218999,0.00015633248,0.00040127066,0.00015433061,0.000008764357],"category_scores_gemma":[0.00004400722,0.00012659782,0.00005495685,0.0018196807,0.00006185149,0.0025500841,0.000005919837,0.00024124743,0.000016602151],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017316874,0.000033758908,0.0000054298525,0.000083550854,0.000026506881,0.000007592222,0.0008132128,0.9191762,0.00036260232,0.013410726,0.000060580227,0.066002496],"study_design_scores_gemma":[0.00041387966,0.00017147536,0.000014393427,0.00009872896,0.000010095309,0.000009334549,0.00018686941,0.92675686,0.067907386,0.0017533238,0.0025471458,0.00013051613],"about_ca_topic_score_codex":0.0000043144864,"about_ca_topic_score_gemma":0.0000056732106,"teacher_disagreement_score":0.94670045,"about_ca_system_score_codex":0.000117251926,"about_ca_system_score_gemma":0.00012902335,"threshold_uncertainty_score":0.51625097},"labels":[],"label_agreement":null},{"id":"W4402897149","doi":"10.1109/iwqos61813.2024.10682861","title":"Game-Theoretic Dependent Task Offloading and Resource Pricing in Vehicular Edge Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Task (project management); Edge computing; Enhanced Data Rates for GSM Evolution; Game theory; Resource (disambiguation); Distributed computing; Computer network; Artificial intelligence; Microeconomics; Economics","score_opus":0.005487776844721996,"score_gpt":0.21505251430630207,"score_spread":0.20956473746158008,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402897149","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055075265,0.00023732132,0.93284297,0.0003409514,0.00009848034,0.00011193997,1.2906423e-7,0.00025449606,0.01103843],"genre_scores_gemma":[0.9594757,0.000010101081,0.040076107,0.00025390595,0.000024445188,0.0000016628074,0.00000190292,0.000006655811,0.00014950758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991403,0.000040048075,0.0002467147,0.0002185519,0.00018101216,0.00017333857],"domain_scores_gemma":[0.9996147,0.00010982945,0.0000364304,0.00017039936,0.000023438142,0.000045214343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054385315,0.0000870147,0.0000860055,0.00023005494,0.000056313835,0.000428587,0.00022972615,0.00004039754,0.0000079133215],"category_scores_gemma":[0.000037886006,0.00007864001,0.00001774399,0.0004042059,0.00002305368,0.00067973987,0.00024869767,0.00012606801,0.000033025794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033388956,0.00002159821,0.0010512333,0.00029827506,0.000018870247,0.000115129835,0.0204358,0.30364874,0.00047166212,0.5312567,0.00041532092,0.14226332],"study_design_scores_gemma":[0.00010327386,0.000011836529,0.00029323233,0.00015470345,0.0000018238388,0.000038382303,0.00014815113,0.9973748,0.00051113963,0.00073228107,0.00052916544,0.000101249105],"about_ca_topic_score_codex":0.000008410787,"about_ca_topic_score_gemma":0.0000016649024,"teacher_disagreement_score":0.90440047,"about_ca_system_score_codex":0.00007155459,"about_ca_system_score_gemma":0.000026816908,"threshold_uncertainty_score":0.41328743},"labels":[],"label_agreement":null},{"id":"W4403532758","doi":"10.1016/j.adhoc.2024.103686","title":"Approximation schemes for age of information minimization in UAV grid patrols","year":2024,"lang":"en","type":"article","venue":"Ad Hoc Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hubei Province; Huazhong University of Science and Technology; National Natural Science Foundation of China","keywords":"Minification; Grid; Computer science; Mathematical optimization; Operations research; Mathematics; Geometry","score_opus":0.007865543401457498,"score_gpt":0.22616239483861142,"score_spread":0.2182968514371539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403532758","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007135258,0.00048780127,0.9965563,0.00026609024,0.000530969,0.00052383146,0.0000052667174,0.00016409368,0.0007521427],"genre_scores_gemma":[0.4388512,0.0005532735,0.5582772,0.00038556676,0.00021236163,0.0002561894,0.0013485,0.000019894916,0.00009583564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895054,0.00002516437,0.0005391351,0.00012838749,0.00018723574,0.00016955209],"domain_scores_gemma":[0.9993357,0.000108987544,0.00017328965,0.00021740644,0.00013501996,0.000029567924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035289544,0.000105891384,0.00013032889,0.00028914097,0.00004383574,0.00023386323,0.0002675514,0.000108009146,0.0000070674373],"category_scores_gemma":[0.000070516435,0.00010551006,0.00005341117,0.000709206,0.000019534213,0.004186899,0.000060393228,0.00009020262,0.000011685743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002108969,0.000018763474,0.00004941092,0.00019753823,0.00001367521,0.000001014868,0.002322427,0.5674905,0.000012636393,0.061174627,0.002846984,0.3658513],"study_design_scores_gemma":[0.0002959983,0.000047262885,0.00018195712,0.000100753416,0.00000435679,0.0000019351778,0.00004460597,0.97902924,0.00011685425,0.0009979418,0.019073397,0.00010572456],"about_ca_topic_score_codex":0.0000013059775,"about_ca_topic_score_gemma":0.0000034156337,"teacher_disagreement_score":0.43827912,"about_ca_system_score_codex":0.000062873456,"about_ca_system_score_gemma":0.00005243382,"threshold_uncertainty_score":0.43025753},"labels":[],"label_agreement":null},{"id":"W4404626973","doi":"10.1016/j.jcss.2024.103605","title":"Time-sharing scheduling with tolerance capacities","year":2024,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mathematical optimization; Mathematics","score_opus":0.0117924527015338,"score_gpt":0.21807835862218197,"score_spread":0.20628590592064816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404626973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06651697,0.000699066,0.92999965,0.0002595857,0.00054830796,0.00003752708,1.9993605e-7,0.000058546426,0.0018801228],"genre_scores_gemma":[0.7425905,0.000010138119,0.25711566,0.00004931552,0.00017861702,4.6432282e-7,5.3849863e-8,0.00000216978,0.000053087042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990328,0.000022772516,0.000318812,0.00012600544,0.00038397347,0.00011565068],"domain_scores_gemma":[0.9995004,0.00006347465,0.00015948825,0.00008261935,0.00013723827,0.000056772773],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0008545658,0.00007618649,0.00014345528,0.00023297491,0.00017321944,0.0011034076,0.00048202716,0.000019061255,0.0000018743816],"category_scores_gemma":[0.0000032429257,0.00004749619,0.000030460324,0.00037287368,0.00012654359,0.0027214966,0.00007080763,0.00008125436,0.000007884743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009595671,0.000013175957,0.0004545411,0.00050775794,0.000060437887,0.00013800153,0.015746202,0.7973764,0.000071738126,0.14998545,0.000674513,0.03496217],"study_design_scores_gemma":[0.000079128,0.00014690851,0.00006693943,0.000768332,0.000003233507,0.0011528735,0.00038823043,0.99699116,0.000056242206,0.00009586261,0.00018135882,0.00006975588],"about_ca_topic_score_codex":0.000001176261,"about_ca_topic_score_gemma":1.4697223e-7,"teacher_disagreement_score":0.67607355,"about_ca_system_score_codex":0.00002730385,"about_ca_system_score_gemma":0.000098609074,"threshold_uncertainty_score":0.99993354},"labels":[],"label_agreement":null},{"id":"W4405933769","doi":"10.1109/ojvt.2024.3523247","title":"Beyond Single-User Scheduling: Exploiting Massive MIMO for Concurrent Data Delivery With Minimum Age of Information","year":2024,"lang":"en","type":"article","venue":"IEEE Open Journal of Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of the Fraser Valley","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Scheduling (production processes); Distributed computing; Mathematics; Mathematical optimization","score_opus":0.033577062372592635,"score_gpt":0.2788802190868233,"score_spread":0.24530315671423067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405933769","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033305045,0.0003205132,0.9632344,0.0018854864,0.0005587645,0.00040852607,0.00001754829,0.000058619193,0.00021104576],"genre_scores_gemma":[0.52619696,0.000046339013,0.47349218,0.000125949,0.00004781448,0.000013204373,0.00004916954,0.000011968014,0.000016414038],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984558,0.00002831776,0.0008369872,0.00016641464,0.0003167932,0.00019565625],"domain_scores_gemma":[0.99771667,0.0000992821,0.0008558362,0.0005284022,0.0007467537,0.000053042684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006910569,0.00014307372,0.00029848842,0.0006783414,0.000082494436,0.00045521432,0.002594982,0.00014383394,0.0000049818827],"category_scores_gemma":[0.0001852432,0.000115741146,0.000055541102,0.00060040853,0.000105533865,0.0072072577,0.0005319377,0.00026457864,0.000007535763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003018778,0.00044348688,0.00021951266,0.001097371,0.0012898193,0.0006096532,0.0052315556,0.18946768,0.035980854,0.19052045,0.009734067,0.56510365],"study_design_scores_gemma":[0.002667213,0.0017742526,0.000012541622,0.0014418488,0.00014837911,0.0008730665,0.0020783024,0.8726047,0.08304593,0.0032166594,0.031667802,0.00046924982],"about_ca_topic_score_codex":0.0000016948684,"about_ca_topic_score_gemma":0.0000017714599,"teacher_disagreement_score":0.68313706,"about_ca_system_score_codex":0.0000744537,"about_ca_system_score_gemma":0.00029772156,"threshold_uncertainty_score":0.52250874},"labels":[],"label_agreement":null},{"id":"W4407654505","doi":"10.1145/3717834","title":"Minimizing Age of Event in Artificial Intelligence of Things","year":2025,"lang":"en","type":"article","venue":"ACM Transactions on Sensor Networks","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Event (particle physics); Artificial intelligence","score_opus":0.01960976220998868,"score_gpt":0.2661830230356066,"score_spread":0.24657326082561792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407654505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024590264,0.000022505135,0.9956926,0.00044834707,0.0002902182,0.00014854159,7.8782995e-7,0.000040963696,0.00089700904],"genre_scores_gemma":[0.82075334,0.000048681675,0.17895555,0.0001534424,0.0000059244844,0.000006169357,0.000002030941,0.0000034772847,0.000071403294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989369,0.00004782349,0.00056925975,0.00015163318,0.0001570428,0.00013736667],"domain_scores_gemma":[0.99901515,0.0002470672,0.00014659426,0.00047833638,0.00009029706,0.000022529928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023796057,0.00008973199,0.0001640659,0.0003285835,0.000051785733,0.000024941743,0.0005051865,0.00008559357,0.00001627958],"category_scores_gemma":[0.000044547254,0.000094202194,0.00007085666,0.000934555,0.00004797246,0.00042349283,0.000015663662,0.00017870008,0.0000030833903],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016978805,0.000063922824,0.000010262128,0.000013498919,0.000009669364,0.0000014467726,0.0009029279,0.84238076,0.00008322992,0.0050146347,0.000006593401,0.15149605],"study_design_scores_gemma":[0.00008122437,0.000042345844,0.00015326095,0.00015474338,0.0000070999563,0.0000013323889,0.00034885178,0.9847247,0.011775609,0.002584983,0.000040495033,0.00008537783],"about_ca_topic_score_codex":0.000031273335,"about_ca_topic_score_gemma":0.000013187684,"teacher_disagreement_score":0.8182943,"about_ca_system_score_codex":0.00003974659,"about_ca_system_score_gemma":0.00003558621,"threshold_uncertainty_score":0.3841454},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01095580748412794,"score_gpt":0.23799871941505318,"score_spread":0.22704291193092524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407826180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06317187,0.000100333535,0.9350471,0.00045373593,0.00011992041,0.00072133745,0.000008480419,0.00015503996,0.00022220396],"genre_scores_gemma":[0.9863019,0.0001941326,0.013008943,0.00015797488,0.00000426827,0.00005925039,0.0000967199,0.000012560424,0.00016427391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983535,0.00021085938,0.00065402203,0.00036600168,0.0002590771,0.00015658005],"domain_scores_gemma":[0.9990202,0.00014964653,0.00018284633,0.00026760166,0.00031686603,0.0000628273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039561317,0.0002174783,0.00022841174,0.0006248559,0.0003037428,0.00027168065,0.00015174263,0.00012506591,0.000003001101],"category_scores_gemma":[0.0000060126663,0.00020794458,0.000027065931,0.0009510525,0.00009930573,0.0009748442,0.0000010864229,0.00024944788,0.0000054664224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007691164,0.000072463125,0.00019669053,0.00009103737,0.00005399078,0.0000024757592,0.010890941,0.9553465,0.0004722339,0.0038565581,0.000056251178,0.028883947],"study_design_scores_gemma":[0.0007219,0.00011511047,0.0022390508,0.00064860756,0.000032506705,0.000013527441,0.00528241,0.9881828,0.0019542838,0.000052786476,0.0005057478,0.0002512741],"about_ca_topic_score_codex":0.0003193041,"about_ca_topic_score_gemma":0.0003798323,"teacher_disagreement_score":0.92313004,"about_ca_system_score_codex":0.00018016521,"about_ca_system_score_gemma":0.0000823405,"threshold_uncertainty_score":0.8479734},"labels":[],"label_agreement":null},{"id":"W4408324679","doi":"10.1109/globecom52923.2024.10901650","title":"DTA-RL: Dynamic Topology Adaptive Reinforcement Learning Approach for Task Offloading in Mobile Edge Computing","year":2024,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Research and Development; National Natural Science Foundation of China","keywords":"Reinforcement learning; Computer science; Edge computing; Mobile edge computing; Task (project management); Distributed computing; Enhanced Data Rates for GSM Evolution; Topology (electrical circuits); Artificial intelligence; Mathematics; Engineering","score_opus":0.013457318517834396,"score_gpt":0.26051031592443213,"score_spread":0.24705299740659775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408324679","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075380586,0.000114000155,0.9809461,0.00009483888,0.00026081593,0.0005494074,4.207572e-7,0.00036231623,0.0169183],"genre_scores_gemma":[0.7115244,0.000008109128,0.28711525,0.00010456986,0.000024017168,0.0000611765,0.000028404971,0.000008723679,0.0011253053],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988353,0.000038109192,0.00038835837,0.0002978587,0.00014547276,0.0002948758],"domain_scores_gemma":[0.9994907,0.00014537702,0.0000828381,0.00017068538,0.00006893114,0.000041473624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005065086,0.00012978408,0.00015056675,0.00029937143,0.00013139396,0.00019924116,0.0003504552,0.00007314263,0.000019568737],"category_scores_gemma":[0.000037394268,0.00012269134,0.00005490926,0.00044703146,0.000027320257,0.000933271,0.0002255365,0.00018341106,0.00003006941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033872645,0.000008114669,0.000009562721,0.000039282342,0.000009795288,0.000001593462,0.0024922783,0.91226006,0.000033555312,0.057646904,0.00017203436,0.027323445],"study_design_scores_gemma":[0.00020729854,0.00013138408,0.000011708195,0.000031528296,0.0000026849002,0.000009222465,0.00071010814,0.99741054,0.000104785606,0.0001742127,0.0010620181,0.00014451303],"about_ca_topic_score_codex":0.0000144325795,"about_ca_topic_score_gemma":0.0000028972347,"teacher_disagreement_score":0.71077067,"about_ca_system_score_codex":0.00022822227,"about_ca_system_score_gemma":0.00007131294,"threshold_uncertainty_score":0.5003208},"labels":[],"label_agreement":null},{"id":"W4408700958","doi":"10.1109/itsc58415.2024.10920242","title":"Deep Reinforcement Learning for Real-Time Ground Delay Program Revision and Corresponding Flight Delay Assignments","year":2024,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of British Columbia","funders":"","keywords":"Reinforcement learning; Computer science; Propagation delay; Real-time computing; Artificial intelligence; Simulation; Computer network","score_opus":0.011524119777972087,"score_gpt":0.27041968628584134,"score_spread":0.25889556650786927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408700958","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012106192,0.00008706247,0.9875686,0.00019581644,0.00022049378,0.0007796782,1.4233103e-7,0.0006682284,0.009269327],"genre_scores_gemma":[0.26511568,0.00030503536,0.71670806,0.00019434736,0.0000899286,0.00016444306,0.000094394454,0.00003321364,0.01729488],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987253,0.000038387614,0.00037519983,0.00029760398,0.00030377222,0.00025974098],"domain_scores_gemma":[0.9993375,0.00016913161,0.00010164452,0.00020188068,0.00009547927,0.00009434042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006051994,0.00014989942,0.00012638423,0.00021046671,0.0002642593,0.0009842925,0.00025031358,0.000069578,0.00008305461],"category_scores_gemma":[0.000068446534,0.00012532981,0.00004796372,0.0003467494,0.000019364912,0.0020701122,0.00019781209,0.00009413138,0.00010526891],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004310623,0.000034149147,0.000047143207,0.00022165403,0.00006888136,0.00002112174,0.0029308754,0.22789665,0.0004171811,0.07100357,0.005640628,0.69167507],"study_design_scores_gemma":[0.00021512673,0.00026663495,0.000022447095,0.0001030696,0.000009822407,0.000024562078,0.000044676413,0.9776699,0.00018435883,0.000093108094,0.02120419,0.00016212881],"about_ca_topic_score_codex":0.0000051199477,"about_ca_topic_score_gemma":3.5342418e-7,"teacher_disagreement_score":0.74977326,"about_ca_system_score_codex":0.00012711393,"about_ca_system_score_gemma":0.00003974442,"threshold_uncertainty_score":0.94915557},"labels":[],"label_agreement":null},{"id":"W4410394621","doi":"10.1109/tvt.2025.3570505","title":"Age of Information in Digital Twin Migration","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science","score_opus":0.004111551057400613,"score_gpt":0.20644908349854643,"score_spread":0.20233753244114583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410394621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03650201,0.000008960941,0.96059626,0.0012859835,0.00016062212,0.00020494682,0.000004070837,0.00023349776,0.0010036377],"genre_scores_gemma":[0.9829624,0.000015475483,0.016759986,0.00013835164,0.0000012744033,0.000038892587,0.000010049976,0.0000024482179,0.000071119735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920505,0.000010532356,0.0004050558,0.00011386349,0.00013982612,0.00012569212],"domain_scores_gemma":[0.9993781,0.000026237258,0.00010284978,0.00036026485,0.000118452495,0.000014112658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009384425,0.00009382844,0.00012830888,0.0015790608,0.000052326683,0.00006355134,0.00037559474,0.00018886376,0.0000047218873],"category_scores_gemma":[0.000021813928,0.00009889513,0.000046647536,0.0016711571,0.000060696428,0.0019305228,0.0000044152457,0.00018263333,0.000034357967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026473377,0.00024769845,0.00021604123,0.00006598702,0.00004057051,0.000007687192,0.0008571161,0.58110577,0.0015711348,0.077609524,0.00012876025,0.33812326],"study_design_scores_gemma":[0.0014051795,0.00020618548,0.0005117834,0.00015614,0.000012121673,0.000016271975,0.00034345913,0.8379432,0.1441873,0.010324996,0.0045925234,0.00030085506],"about_ca_topic_score_codex":0.00001056828,"about_ca_topic_score_gemma":0.000020149067,"teacher_disagreement_score":0.94646037,"about_ca_system_score_codex":0.00008133864,"about_ca_system_score_gemma":0.000058211353,"threshold_uncertainty_score":0.40328264},"labels":[],"label_agreement":null},{"id":"W4411798880","doi":"10.1109/access.2025.3584645","title":"Toward Energy Efficiency and Fairness in UAV-Based Task Offloading","year":2025,"lang":"en","type":"article","venue":"IEEE Access","topic":"Age of Information Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"Mitacs","keywords":"Computer science; Efficient energy use; Task (project management); Energy consumption","score_opus":0.015074013348390532,"score_gpt":0.2663476048819398,"score_spread":0.2512735915335493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411798880","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014383336,0.000047300426,0.9787846,0.0006777038,0.00036828217,0.00007124922,5.7082383e-7,0.000091070346,0.0055758543],"genre_scores_gemma":[0.9942383,0.000009851044,0.004583414,0.0010334861,0.000013098002,0.000016381982,0.0000020080295,0.0000029516386,0.0001004823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925154,0.000029015611,0.00022200766,0.00019621395,0.00014268978,0.00015854718],"domain_scores_gemma":[0.9995291,0.00006875221,0.0000709409,0.00023139294,0.00006787597,0.000031930198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016351017,0.00008696726,0.000102125014,0.00033990594,0.00006928909,0.00036766345,0.00076323276,0.000049446982,0.000004950146],"category_scores_gemma":[0.000038266655,0.00008565032,0.000016766751,0.00087669434,0.000028019811,0.001534689,0.00014538843,0.00005638585,0.0000034162215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025605594,0.00015568247,0.008008794,0.00021157018,0.000015644026,0.000035924786,0.0019450361,0.704428,0.0004773146,0.14714953,0.0030232777,0.13452362],"study_design_scores_gemma":[0.000414569,0.000010213864,0.0018294321,0.00005672482,0.0000016285551,0.0000013475542,0.000014888769,0.9885018,0.0073748655,0.0010872777,0.00058898877,0.000118266755],"about_ca_topic_score_codex":0.000097239856,"about_ca_topic_score_gemma":0.000020212035,"teacher_disagreement_score":0.979855,"about_ca_system_score_codex":0.000050904913,"about_ca_system_score_gemma":0.00009692907,"threshold_uncertainty_score":0.3545387},"labels":[],"label_agreement":null},{"id":"W4411929627","doi":"10.9790/9622-1506139144","title":"A Parallel AI Framework for Autonomous Microgrid Control in Aerospace Systems Application Potential for NASA and the Canadian Space Agency for Deep Neural Control Module (DNCM)","year":2025,"lang":"en","type":"article","venue":"International Journal of Engineering Research and Applications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Aerospace; Agency (philosophy); Control (management); Computer science; Microgrid; Space (punctuation); Artificial neural network; Control engineering; Artificial intelligence; Control system; Aeronautics; Aerospace engineering; Systems engineering; Engineering; Electrical engineering; Operating system; Sociology","score_opus":0.007959968346947014,"score_gpt":0.2893913849530625,"score_spread":0.2814314166061155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411929627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042289053,0.000744958,0.9783071,0.018138822,0.00016707554,0.0021516904,0.000043425887,0.000012413619,0.000011620912],"genre_scores_gemma":[0.91800845,0.000062427825,0.07951994,0.00021524115,0.00019708546,0.0019473367,0.000011552346,0.000007644723,0.00003034497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990372,0.000022535012,0.0003608077,0.00014557752,0.00020637533,0.0002274996],"domain_scores_gemma":[0.9976161,0.000801553,0.00014005721,0.00014259595,0.0011978596,0.00010179719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924546,0.00008665195,0.00015175686,0.00039687997,0.0002212648,0.00044529053,0.0005466598,0.00007115391,2.8156765e-7],"category_scores_gemma":[0.00031688725,0.000073983494,0.000056925022,0.00019484341,0.00006217032,0.00031573215,0.000032533662,0.00019830295,2.9963056e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012861456,0.000021747666,0.00006322912,0.00003805572,0.00006537646,3.8172092e-7,0.000120681216,0.39250702,0.00011374878,0.60046583,0.00020146374,0.0062738196],"study_design_scores_gemma":[0.0026942275,0.000046337886,0.0004049365,0.00003230178,0.000006923989,0.000014251329,0.00003007012,0.9755006,0.000018358249,0.014998795,0.0061926343,0.000060565628],"about_ca_topic_score_codex":0.00037640394,"about_ca_topic_score_gemma":0.00028748324,"teacher_disagreement_score":0.91758555,"about_ca_system_score_codex":0.00018270232,"about_ca_system_score_gemma":0.00018932782,"threshold_uncertainty_score":0.4293947},"labels":[],"label_agreement":null},{"id":"W4412718920","doi":"10.1109/tmc.2025.3588474","title":"Minimizing Age of Semantic Information for Analytics-Oriented Video Streaming Systems","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Mobile Computing","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Jiangsu Province; National Natural Science Foundation of China","keywords":"Computer science; Analytics; Video streaming; Multimedia; World Wide Web; Computer network; Data science","score_opus":0.009948387836885798,"score_gpt":0.24869344685170364,"score_spread":0.23874505901481785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412718920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007326844,0.000017840983,0.98989147,0.000035864527,0.0011434166,0.0007561151,0.000010292346,0.00021145097,0.0006067222],"genre_scores_gemma":[0.9271798,0.0000061058154,0.07256782,0.000075246324,0.000015015622,0.000050828912,0.000016076554,0.0000063066404,0.000082760496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99854016,0.00004173862,0.000780946,0.0001823804,0.00023168465,0.00022307418],"domain_scores_gemma":[0.99851006,0.00036437123,0.00033687838,0.00037947643,0.00036619316,0.00004301813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036471453,0.000154842,0.00024215668,0.00063106365,0.00030672696,0.00017959943,0.00035559843,0.00008195959,0.0000019151703],"category_scores_gemma":[0.000027605383,0.00016669091,0.00011811905,0.00088735827,0.00003125266,0.0012050251,0.0000073551146,0.00012423801,0.000006094174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009301394,0.000040377887,0.000008943272,0.00021187525,0.000039372757,3.5146664e-7,0.000997414,0.9541377,0.00014648588,0.0023351281,0.000050090497,0.042022977],"study_design_scores_gemma":[0.00055255665,0.0000850357,0.00003283745,0.00030447828,0.000025627553,0.0000027044364,0.00060648884,0.9918861,0.0058304965,0.000025926274,0.0005178913,0.00012988779],"about_ca_topic_score_codex":0.00002506324,"about_ca_topic_score_gemma":0.0000024613205,"teacher_disagreement_score":0.919853,"about_ca_system_score_codex":0.000121938276,"about_ca_system_score_gemma":0.00008893875,"threshold_uncertainty_score":0.6797458},"labels":[],"label_agreement":null},{"id":"W4412986282","doi":"10.1109/ton.2025.3591933","title":"SC <sup>3</sup> -MDRA: A New Approach to Coordinating Bi-Level Age of Information in AAV-Enabled 6G Integrated Networks","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Hebei Province; National Natural Science Foundation of China","keywords":"Chemistry; Physics","score_opus":0.02056570086020206,"score_gpt":0.23411418651486907,"score_spread":0.213548485654667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412986282","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006309758,0.000020179115,0.9890987,0.00023686123,0.00056999363,0.00061211013,0.000003198661,0.00021370074,0.008614259],"genre_scores_gemma":[0.80724585,0.000024767887,0.19135657,0.0007076585,0.000053548214,0.0000669774,0.00002907551,0.000012733191,0.00050281564],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794173,0.00011075017,0.000923032,0.0002874729,0.00031744209,0.0004195724],"domain_scores_gemma":[0.9987808,0.00018861932,0.00024688643,0.00047426982,0.00019808,0.000111338515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006464183,0.00025378965,0.00032886423,0.0011114895,0.0002385009,0.00034765858,0.0006944619,0.00019104805,0.000012653951],"category_scores_gemma":[0.000029352546,0.00026711627,0.00009796354,0.004129226,0.000031755797,0.0020572806,0.000016266726,0.00047216166,0.000015183365],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028838564,0.000050051214,0.000017906637,0.000022724895,0.000022397518,7.382156e-7,0.0020224212,0.8329552,0.0000057973725,0.0011044304,0.00067129295,0.16309822],"study_design_scores_gemma":[0.00081191515,0.00003741175,0.000069009446,0.00042712604,0.000012519076,0.0000035131516,0.00031415393,0.9958078,0.00014745072,0.0001222714,0.0020313538,0.00021542987],"about_ca_topic_score_codex":0.00018752273,"about_ca_topic_score_gemma":0.00003515186,"teacher_disagreement_score":0.8066149,"about_ca_system_score_codex":0.000271561,"about_ca_system_score_gemma":0.00021957488,"threshold_uncertainty_score":0.9999781},"labels":[],"label_agreement":null},{"id":"W4413478210","doi":"10.1109/ton.2025.3583308","title":"Age-of-Information Minimization With Weight Limits for Semi-Asynchronous Online Distributed Optimization","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ericsson (Canada); Ontario Tech University; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Asynchronous communication; Minification; Computer science; Mathematical optimization; Distributed computing; Mathematics; Computer network; World Wide Web","score_opus":0.009984052237595681,"score_gpt":0.22689563001713187,"score_spread":0.21691157777953618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413478210","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010361063,0.000028313478,0.9970764,0.00037536494,0.0008966116,0.00068471424,0.000050936873,0.0002688695,0.0005151804],"genre_scores_gemma":[0.41307402,0.00019080982,0.58516306,0.00044252127,0.00007996233,0.00013064362,0.0007994159,0.000018318757,0.000101239275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986358,0.000041539264,0.0006007161,0.00021463458,0.00025531015,0.0002520007],"domain_scores_gemma":[0.9986289,0.00018944062,0.0003481762,0.0003718368,0.0004082461,0.000053408992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015534644,0.00020433073,0.00021869845,0.00042568802,0.0003230884,0.00016495382,0.0003624251,0.00013522586,0.000008549359],"category_scores_gemma":[0.000011239933,0.00019761994,0.00008150456,0.0013135547,0.000042673044,0.0018545314,0.0000033150045,0.00013679347,0.0000025430027],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007462817,0.00008061137,0.000011211074,0.00006281223,0.00004429155,3.829443e-7,0.00025059082,0.94638956,0.000006016914,0.00082349166,0.00019824717,0.05205815],"study_design_scores_gemma":[0.0010624046,0.0001422697,0.000028710241,0.00024818198,0.000045354565,0.0000036250426,0.000047533125,0.9941267,0.001605749,0.00007764009,0.0024217137,0.00019014797],"about_ca_topic_score_codex":0.000005217125,"about_ca_topic_score_gemma":0.000013489601,"teacher_disagreement_score":0.4129704,"about_ca_system_score_codex":0.00016594892,"about_ca_system_score_gemma":0.0001513355,"threshold_uncertainty_score":0.8058708},"labels":[],"label_agreement":null},{"id":"W4414015837","doi":"10.11159/icbes25.205","title":"Revealing End-Systolic Right Ventricle Segmentation Strengths of EfficientNetB3 in DeepLabv3+","year":2025,"lang":"en","type":"article","venue":"Proceedings of the World Congress on Electrical Engineering and Computer Systems and Science","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; HORIZON EUROPE Framework Programme; European Commission","keywords":"Segmentation; Ventricle; Computer science; Artificial intelligence; Medicine; Cardiology","score_opus":0.002833582233358619,"score_gpt":0.20349407005037004,"score_spread":0.20066048781701143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414015837","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88212514,0.0006754153,0.11403176,0.00029394997,0.0012830059,0.00057745137,0.0000012892892,0.000087968925,0.0009240113],"genre_scores_gemma":[0.99616295,0.00001456406,0.0037052773,0.00002171532,0.000013219651,0.000007997555,9.427918e-8,0.0000021268816,0.000072081246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900645,0.000006025823,0.00032280278,0.00020708525,0.00028244083,0.00017517922],"domain_scores_gemma":[0.9994538,0.000099676836,0.00016298132,0.00009332714,0.00014973122,0.000040484767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043544217,0.000092037866,0.00016360404,0.0005437199,0.000092211594,0.00015133459,0.0004734754,0.000023016251,1.7917502e-7],"category_scores_gemma":[0.000056785313,0.00006998476,0.000018559673,0.002107502,0.00006529207,0.00036621478,0.00015770673,0.00009685935,1.04136326e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013873688,0.00007659645,0.0041589835,0.00039638698,0.000017016382,6.981425e-7,0.00055679365,0.17070432,0.0060249954,0.79000914,0.0001625545,0.027878623],"study_design_scores_gemma":[0.00020958716,0.000036447615,0.0027808645,0.0003441317,0.0000025746874,0.000005104198,0.000008680798,0.9831629,0.013250243,0.000037252652,0.000095545816,0.000066681496],"about_ca_topic_score_codex":0.000011758255,"about_ca_topic_score_gemma":4.82493e-7,"teacher_disagreement_score":0.8124586,"about_ca_system_score_codex":0.000052550673,"about_ca_system_score_gemma":0.00003479052,"threshold_uncertainty_score":0.28538954},"labels":[],"label_agreement":null},{"id":"W4414647398","doi":"10.1109/vtc2025-spring65109.2025.11174596","title":"Resource Allocation in IRSA-Assisted NOMA for Massive URLLC Using Lightweight Q-Learning","year":2025,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université TÉLUQ; Université du Québec à Montréal","funders":"","keywords":"Noma; Reinforcement learning; Resource allocation; Latency (audio); Reliability (semiconductor); Resource efficiency; Aloha; Low latency (capital markets); Resource management (computing)","score_opus":0.013762903134540776,"score_gpt":0.25566193450083824,"score_spread":0.24189903136629745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414647398","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034447147,0.000015439837,0.97066146,0.0023493976,0.00010463616,0.00030372626,2.4671596e-7,0.00014464492,0.022975704],"genre_scores_gemma":[0.4158436,0.0000026286145,0.5786964,0.0008386199,0.000025275061,0.00004005174,0.000023755145,0.0000079756555,0.0045216824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910927,0.00004773096,0.00033176414,0.0002055349,0.00012975924,0.00017592369],"domain_scores_gemma":[0.9993151,0.00012368213,0.0001407492,0.00023029475,0.00016104798,0.000029167897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028371645,0.00009383301,0.00010740739,0.0003528339,0.00016062151,0.00017497379,0.0003456704,0.00007454694,0.000013030105],"category_scores_gemma":[0.00016191858,0.00009173438,0.00003631673,0.0007533951,0.00001375849,0.00090609584,0.000119031676,0.0000851916,0.000010361165],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036434554,0.00008357514,0.0014709779,0.00008795922,0.000032202355,0.0000031950392,0.0025878919,0.52289087,0.0014145228,0.4111529,0.0037584065,0.05648105],"study_design_scores_gemma":[0.0004386883,0.000019632269,0.0014357492,0.00004812056,0.0000036165382,0.0000014085891,0.00015987371,0.985665,0.0022601564,0.00036965063,0.00949217,0.00010593764],"about_ca_topic_score_codex":0.000015011899,"about_ca_topic_score_gemma":0.000009702196,"teacher_disagreement_score":0.46277413,"about_ca_system_score_codex":0.00017270398,"about_ca_system_score_gemma":0.0001037699,"threshold_uncertainty_score":0.37408194},"labels":[],"label_agreement":null},{"id":"W4414648228","doi":"10.1109/vtc2025-spring65109.2025.11174578","title":"Power Efficient Networking Support for Digital Twins with Age of Information Targets","year":2025,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Resource allocation; Markov decision process; Reinforcement learning; Frame (networking); Transmission (telecommunications); Computation; Process (computing); Power (physics); Markov process","score_opus":0.004351720437430022,"score_gpt":0.2063663564840553,"score_spread":0.20201463604662528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414648228","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004544177,0.000002495003,0.8874704,0.00013843096,0.00016327122,0.00025823002,0.0000026686992,0.00008253759,0.11142752],"genre_scores_gemma":[0.84193194,7.1773036e-7,0.15674105,0.000523843,0.000008018622,0.000016271053,0.00008107139,0.0000025477452,0.0006945455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993591,0.00000315262,0.00028212724,0.000069182024,0.0001582296,0.00012824567],"domain_scores_gemma":[0.9994241,0.000037426653,0.00012938405,0.00019094539,0.00019401958,0.00002415173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012249914,0.00006896416,0.00008415862,0.00015103428,0.000056339133,0.00019994096,0.0002541971,0.000028899169,0.000011894401],"category_scores_gemma":[0.000023582365,0.00005427857,0.000030049157,0.000337756,0.00002179695,0.0017829584,0.00008579068,0.000027052696,0.000009404735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005784067,0.000085064814,0.00077214994,0.00010540741,0.00005000214,0.0000012410391,0.0040690782,0.59264064,0.0000112035805,0.35734805,0.008867906,0.0359914],"study_design_scores_gemma":[0.00066426204,0.00014722381,0.00080956623,0.000038178554,0.0000034051925,0.0000023349637,0.0001457648,0.95672005,0.0005907408,0.00027883964,0.040467598,0.00013205463],"about_ca_topic_score_codex":9.2279083e-7,"about_ca_topic_score_gemma":4.3462612e-7,"teacher_disagreement_score":0.8414775,"about_ca_system_score_codex":0.00002882647,"about_ca_system_score_gemma":0.00008058111,"threshold_uncertainty_score":0.2213416},"labels":[],"label_agreement":null},{"id":"W4414858417","doi":"10.59350/n93z7-c2h73","title":"Personal Impressions from WATOC 2020 – Dispersion and non Born-Oppenheimer models.","year":2022,"lang":"en","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dispersion (optics); Cover (algebra); Point (geometry); Set (abstract data type)","score_opus":0.009007769824599688,"score_gpt":0.2016023005130814,"score_spread":0.1925945306884817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414858417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023892974,0.00008120424,0.96287066,0.00275521,0.00017741462,0.00015024887,0.000017240596,0.00011623156,0.009938809],"genre_scores_gemma":[0.9286609,0.000027664331,0.06931687,0.00096107164,0.000024823254,0.0000244655,0.000056719,0.0000060656307,0.0009214106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918175,0.00002880728,0.00014170229,0.00021072681,0.00030809507,0.00012893548],"domain_scores_gemma":[0.9995947,0.000027809496,0.00005797137,0.00020314333,0.00003278845,0.00008359405],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000092857954,0.00008313545,0.00007383621,0.000049836184,0.0004137426,0.000111509726,0.00034015725,0.000024553765,0.00094613846],"category_scores_gemma":[0.000005110294,0.000072323564,0.000029327368,0.00016597942,0.000016724662,0.0014107467,0.0007783861,0.00011536267,0.00003191204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011733665,0.00038459842,0.0017913963,0.000024042101,0.00013667635,0.00004445931,0.05646128,0.40025255,0.004565795,0.05169783,0.352512,0.13201202],"study_design_scores_gemma":[0.00023815478,0.00002968646,0.00045248834,0.0000028301179,0.0000033754636,0.000005630937,0.00034801243,0.99635804,0.00018096536,0.0006253068,0.0016482281,0.000107294785],"about_ca_topic_score_codex":0.00009745645,"about_ca_topic_score_gemma":0.0000017807977,"teacher_disagreement_score":0.90476793,"about_ca_system_score_codex":0.000035379944,"about_ca_system_score_gemma":0.000037679776,"threshold_uncertainty_score":0.99996716},"labels":[],"label_agreement":null},{"id":"W4415883602","doi":"10.1109/tcomm.2025.3628766","title":"2D-AoI: Age-of-Information of Distributed Sensors for Spatio-Temporal Processes","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Communications","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Deutsche Forschungsgemeinschaft","keywords":"Covariance; Wireless sensor network; Offset (computer science); Gaussian; Measure (data warehouse); Network topology; Gaussian process; Exponential function","score_opus":0.026065578182485005,"score_gpt":0.28333200764214417,"score_spread":0.25726642945965916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415883602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039009564,0.0001564536,0.9900017,0.0031530047,0.00063987606,0.0017486511,0.0014713744,0.00014804283,0.0022908477],"genre_scores_gemma":[0.8589941,0.00089355226,0.13830025,0.00012870089,0.000008563351,0.0003172928,0.0009815922,0.000014814499,0.00036113188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966954,0.00020816975,0.0020681147,0.00025803715,0.00044589632,0.0003243626],"domain_scores_gemma":[0.9919537,0.0011179473,0.0012851352,0.0028498396,0.0026935306,0.00009984826],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005700454,0.00034925927,0.00052425114,0.0010133346,0.00088285643,0.0002106626,0.002449571,0.00027427106,0.00004563693],"category_scores_gemma":[0.0002168811,0.00040295866,0.00028960305,0.0029050508,0.0005292519,0.0030449214,0.0000334579,0.0003780017,0.000023170109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038393296,0.0019129156,0.000064591455,0.0028228988,0.0005406579,2.6603976e-7,0.0101656765,0.85875714,0.00010936085,0.035027895,0.001940195,0.08827448],"study_design_scores_gemma":[0.0018564806,0.0003538651,0.0001589938,0.00089051167,0.0002867955,0.0000035015582,0.001184754,0.9507933,0.02403328,0.0014471824,0.018523939,0.0004673429],"about_ca_topic_score_codex":0.00012250198,"about_ca_topic_score_gemma":0.00018654269,"teacher_disagreement_score":0.858604,"about_ca_system_score_codex":0.00021161699,"about_ca_system_score_gemma":0.0012278436,"threshold_uncertainty_score":0.9998422},"labels":[],"label_agreement":null},{"id":"W4416011267","doi":"10.1109/tvt.2025.3630556","title":"Real-Time Tracking in a Status Update System With an Imperfect Feedback Channel","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Vehicular Technology","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Engineering Link (Canada)","funders":"Vetenskapsrådet","keywords":"Markov decision process; Partially observable Markov decision process; Markov process; Control theory (sociology); Observable; Channel (broadcasting); Markov chain; Optimization problem; Regularization (linguistics); State space","score_opus":0.00591744649366006,"score_gpt":0.2260980382219386,"score_spread":0.22018059172827856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416011267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079948254,0.00008654803,0.91459566,0.0012157845,0.00058877055,0.0014196609,0.000027715934,0.0013282552,0.00078935776],"genre_scores_gemma":[0.97992885,0.00039996163,0.018886872,0.0001314,0.000015071844,0.00036607022,0.000012548723,0.000050212922,0.00020901552],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99602485,0.00026198174,0.0010796711,0.0010786308,0.00047182193,0.0010830582],"domain_scores_gemma":[0.9972605,0.000069412425,0.0003879827,0.0016624661,0.00045131712,0.00016831241],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005586386,0.0006223447,0.0007299377,0.003563452,0.00059410936,0.0003491897,0.0011939844,0.0009396912,0.0000426965],"category_scores_gemma":[0.000011484388,0.00063539844,0.00014468271,0.0055938074,0.00033847152,0.0020285668,0.000015034043,0.0011247748,0.0002400426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028162345,0.00054470403,0.000023372453,0.00026088892,0.00019940654,0.00015171625,0.00090510055,0.891091,0.0015645045,0.006165348,0.000019234392,0.09879311],"study_design_scores_gemma":[0.0022650065,0.00095220376,0.00008964951,0.0009873713,0.00009021585,0.00015610736,0.0010627506,0.9659359,0.027635194,0.00011644319,0.00010475693,0.00060441636],"about_ca_topic_score_codex":0.00019630742,"about_ca_topic_score_gemma":0.00018230769,"teacher_disagreement_score":0.8999806,"about_ca_system_score_codex":0.0010273098,"about_ca_system_score_gemma":0.00059822056,"threshold_uncertainty_score":0.9996097},"labels":[],"label_agreement":null},{"id":"W4417281860","doi":"10.1109/pimrc62392.2025.11274624","title":"Age of Information Analysis for Full Duplex Cooperative SWIPT System: NOMA versus RSMA","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland; McMaster University","funders":"","keywords":"Telecommunications link; Noma; Wireless; Information transfer; Metric (unit); Maximum power transfer theorem; Block (permutation group theory); Block Error Rate; Information exchange","score_opus":0.01444427047795002,"score_gpt":0.252399859663876,"score_spread":0.237955589185926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417281860","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020198328,0.000039328268,0.9542379,0.0004285279,0.0012679144,0.0012705405,0.000062645144,0.00013330756,0.04054005],"genre_scores_gemma":[0.8606198,0.00002151097,0.13674912,0.0002753565,0.000032657586,0.00010048343,0.00046694465,0.0000063939115,0.0017277435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996898,0.00010154492,0.0018347154,0.0003036974,0.00049426605,0.00036779075],"domain_scores_gemma":[0.9954727,0.00035579494,0.0009516824,0.00081654167,0.0022990282,0.00010423279],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007494554,0.00032483318,0.000657687,0.0016108227,0.000371974,0.0006925701,0.00094469,0.00022591265,0.00013888848],"category_scores_gemma":[0.00038045208,0.00031886343,0.00037678078,0.005044942,0.00011189501,0.005753707,0.0003317228,0.00011524568,0.00008750444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004285723,0.000048393365,0.000055991768,0.00062003196,0.0012731403,7.0132e-7,0.003749936,0.6782204,0.00002656977,0.30450824,0.0012494859,0.009818529],"study_design_scores_gemma":[0.0025812073,0.00036864716,0.00048322015,0.000094889605,0.00059158367,8.377325e-7,0.0024272779,0.9903264,0.0011558429,0.00001169715,0.0016835108,0.0002749001],"about_ca_topic_score_codex":0.00009336909,"about_ca_topic_score_gemma":0.00008529221,"teacher_disagreement_score":0.85859996,"about_ca_system_score_codex":0.00038391302,"about_ca_system_score_gemma":0.0005071881,"threshold_uncertainty_score":0.9999263},"labels":[],"label_agreement":null},{"id":"W4417282409","doi":"10.1109/pimrc62392.2025.11274843","title":"AoI-Aware Resource Allocation with Deep Reinforcement Learning for HAPS-V2X Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Reinforcement learning; Redundancy (engineering); Reliability (semiconductor); Resource allocation; Telecommunications network; Latency (audio)","score_opus":0.007087366237993558,"score_gpt":0.22183873703132037,"score_spread":0.21475137079332682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417282409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000026079557,0.00013050911,0.95653635,0.0029686484,0.00034645066,0.001488003,2.0056548e-7,0.00028703743,0.038216744],"genre_scores_gemma":[0.8287506,0.000120387704,0.1146194,0.0037920764,0.00016579671,0.00026221765,0.00023024829,0.000036196805,0.052023042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972335,0.00009589639,0.0009597386,0.00058146974,0.00050277443,0.0006266197],"domain_scores_gemma":[0.99740094,0.00023450548,0.00058685767,0.000740429,0.00089442206,0.00014286085],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078756764,0.0003832754,0.00031004063,0.00036096724,0.0009990316,0.0009142519,0.0008706967,0.00023753096,0.00015680901],"category_scores_gemma":[0.00013914114,0.0003579129,0.00010753254,0.001298321,0.00009616473,0.0019510451,0.0003686889,0.00034354877,0.000034730874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000097346754,0.000022796647,0.00007992454,0.00009187339,0.00006508267,5.8486694e-7,0.0011330864,0.8843483,9.337763e-7,0.041301377,0.0034576568,0.06940104],"study_design_scores_gemma":[0.0013279675,0.00040758803,0.00008986244,0.000290175,0.000050895673,0.0000037995576,0.0008051779,0.9695581,0.00016044275,0.000060704344,0.026850455,0.00039478915],"about_ca_topic_score_codex":0.000022831784,"about_ca_topic_score_gemma":0.000024191626,"teacher_disagreement_score":0.8419169,"about_ca_system_score_codex":0.0003192104,"about_ca_system_score_gemma":0.00032994963,"threshold_uncertainty_score":0.9998873},"labels":[],"label_agreement":null},{"id":"W4417438744","doi":"10.1109/tccn.2025.3645402","title":"AoI Minimization for WP-IoT With PDQN-Based Hybrid Offline/Online Learning: A Joint Scheduling and Transmission Design Approach","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Cognitive Communications and Networking","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scheduling (production processes); Markov decision process; Performance metric; Parameterized complexity; Job shop scheduling; Minification; Benchmark (surveying); Online algorithm; Reinforcement learning","score_opus":0.04786514365810929,"score_gpt":0.2711998916403091,"score_spread":0.22333474798219982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417438744","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005991817,0.0005967533,0.99652356,0.0009252954,0.000057051206,0.00084627233,0.000009579476,0.00017211516,0.00027019798],"genre_scores_gemma":[0.5273658,0.0008683701,0.47122467,0.0002658362,0.000011095901,0.00014573545,0.000051761283,0.000011839129,0.000054904835],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875325,0.00021357942,0.00037631654,0.00031920543,0.00013642009,0.00020124274],"domain_scores_gemma":[0.9981348,0.0008427185,0.00018144802,0.00037892064,0.00038618478,0.00007593622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038664517,0.0002034309,0.00021256813,0.00034896864,0.0011602916,0.00020755382,0.00029188182,0.000077340344,0.0000019055263],"category_scores_gemma":[0.000015308278,0.00019226212,0.000052729538,0.00058287586,0.00014513567,0.0003446979,0.000010611441,0.0003231631,4.5996478e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000138454,0.00024598272,0.00001704194,0.000073028285,0.00006218112,2.731743e-7,0.00063057325,0.46176535,0.00005427028,0.00031097207,0.0000102144595,0.53669167],"study_design_scores_gemma":[0.0014613785,0.00022384,0.000035365443,0.0006076069,0.000083151484,0.000006995226,0.00023293226,0.995161,0.0012282656,0.00010945946,0.0006421255,0.00020786264],"about_ca_topic_score_codex":0.0000050056415,"about_ca_topic_score_gemma":0.000004189636,"teacher_disagreement_score":0.5364838,"about_ca_system_score_codex":0.0000407169,"about_ca_system_score_gemma":0.00011836191,"threshold_uncertainty_score":0.8924143},"labels":[],"label_agreement":null},{"id":"W6893104059","doi":"10.5281/zenodo.14597308","title":"Tanyxiphium breviovipositor Huber 2015","year":2024,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Natural Resources Canada","funders":"","keywords":"Holotype; Interpretation (philosophy); Measure (data warehouse); Term (time); Class (philosophy)","score_opus":0.0189924404478916,"score_gpt":0.2408847528548743,"score_spread":0.22189231240698268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893104059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024745153,0.00031385524,0.8270928,0.002989428,0.00047838793,0.0003002893,0.000034822475,0.0031880832,0.16535488],"genre_scores_gemma":[0.9046337,0.00056516647,0.065386206,0.0018635715,0.0015722587,3.2720087e-7,0.0028599019,0.004144964,0.0189739],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985072,0.00015332307,0.00026777323,0.00035945128,0.0004240766,0.00028818366],"domain_scores_gemma":[0.998771,0.000023169934,0.000060135666,0.00053953705,0.00045485815,0.00015128368],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005889817,0.00012859642,0.000098138655,0.0003036721,0.0011399837,0.003192279,0.0015443072,0.00005963188,0.0041086366],"category_scores_gemma":[0.00018669496,0.00012959419,0.00005412894,0.0009286891,0.00006283099,0.0018546772,0.0011718005,0.00020836682,0.023422863],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000067472406,0.000039304156,2.7682876e-7,0.00008048813,0.00002669445,0.000024388051,0.0018827483,0.0009913489,0.0008682598,0.07980437,0.7463847,0.1698907],"study_design_scores_gemma":[0.00012444955,0.00007279163,0.0000299223,0.0000406876,0.0000052643945,0.00015918488,0.000045687877,0.07863497,0.00037030166,0.00028588905,0.92008,0.0001508641],"about_ca_topic_score_codex":0.0000034163954,"about_ca_topic_score_gemma":3.7045783e-8,"teacher_disagreement_score":0.9043863,"about_ca_system_score_codex":0.00015731093,"about_ca_system_score_gemma":0.000007832274,"threshold_uncertainty_score":0.9978425},"labels":[],"label_agreement":null},{"id":"W6894164145","doi":"10.5445/ir/1000156224","title":"Graph Neural Networks for low-energy event classification &amp; reconstruction in IceCube","year":2022,"lang":"en","type":"article","venue":"Repository KITopen (Karlsruhe Institute of Technology)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Experimental Program to Stimulate Competitive Research; Japan Society for the Promotion of Science; Deutsches Elektronen-Synchrotron; Office of Polar Programs; College of Engineering, Michigan State University; Helmholtz Alliance for Astroparticle Physics; Institute for Global Prominent Research, Chiba University; RWTH Aachen University; Chiba University; Knut och Alice Wallenbergs Stiftelse; Villum Fonden; National Research Foundation of Korea; Fonds Wetenschappelijk Onderzoek; Marsden Fund; Bundesministerium für Bildung und Forschung; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; National Science Foundation; Belgian Federal Science Policy Office; Deutsche Forschungsgemeinschaft; Michigan State University; National Research Foundation; Vetenskapsrådet; U.S. Department of Energy; European Commission; Western Canada Research Grid; University of Oxford; Compute Canada; Marquette University; Fonds De La Recherche Scientifique - FNRS; Polarforskningssekretariatet","keywords":"Event (particle physics); Artificial neural network; Graph; Pattern recognition (psychology); Feature (linguistics)","score_opus":0.011917008200664736,"score_gpt":0.229690403651962,"score_spread":0.21777339545129726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6894164145","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.087736435,0.00016299827,0.90527374,0.0012441567,0.0032902446,0.00059362233,0.0000035250496,0.00034355692,0.0013517125],"genre_scores_gemma":[0.9414383,0.000028611743,0.05759465,0.000089111505,0.00006113253,0.00048350604,0.00004033763,0.000013465219,0.00025084923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998169,0.000054523047,0.00081063475,0.0004137887,0.000280689,0.00027134182],"domain_scores_gemma":[0.9982987,0.000025909441,0.00064696,0.0007925013,0.00019207632,0.00004381996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035066734,0.00017467071,0.0002610278,0.00086133956,0.00042845838,0.00007119886,0.0012252238,0.000187727,0.000005661414],"category_scores_gemma":[0.000058392594,0.00019890268,0.00010583166,0.0014547388,0.00015489603,0.0015005673,0.000440686,0.00029574506,0.0000012212154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057577286,0.00016562945,0.0015083551,0.00003752196,0.00003599544,0.000010300918,0.00013736034,0.73909086,0.0028399243,0.11185955,0.0010121836,0.14324471],"study_design_scores_gemma":[0.0008156396,0.00015959723,0.00090028066,0.000049577644,0.000013825472,0.00032385185,0.00014220606,0.97162056,0.004128699,0.0021245962,0.019387782,0.00033340591],"about_ca_topic_score_codex":0.00006308046,"about_ca_topic_score_gemma":0.000035217683,"teacher_disagreement_score":0.8537019,"about_ca_system_score_codex":0.0003032881,"about_ca_system_score_gemma":0.00013741298,"threshold_uncertainty_score":0.81110156},"labels":[],"label_agreement":null},{"id":"W6983537379","doi":"","title":"Monotonicity of value function and optimal policy in cross-layer design of communication systems","year":2019,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Markov decision process; GRASP; Queueing theory; Markov process; Decision theory; Bellman equation; Stochastic programming; Monotonic function; Dynamic programming; Optimal decision","score_opus":0.0191796075634835,"score_gpt":0.26272343035145007,"score_spread":0.24354382278796657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6983537379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709934,0.0006384003,0.008478975,0.00001503734,0.00081831607,0.0024066847,0.00018470916,0.00018434733,0.016280103],"genre_scores_gemma":[0.9789142,0.00035040674,0.01966507,0.000035610497,0.000008614626,0.00008287234,0.00026377066,0.000049744147,0.0006297378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99635047,0.00056334725,0.0014926635,0.00054413715,0.0007028601,0.00034649702],"domain_scores_gemma":[0.99574643,0.0003302637,0.0017936977,0.0012389097,0.0007836469,0.000107059655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0017184421,0.0004277683,0.0006965098,0.0010207823,0.0002813957,0.00015462056,0.0011724207,0.000659634,0.000008901419],"category_scores_gemma":[0.00052559195,0.00047690718,0.00012213293,0.0010274374,0.000072658506,0.0031565425,0.0002698863,0.0006653471,0.00002426923],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025979133,0.00014865145,0.00018937125,0.00062290527,0.00008444903,0.000001116247,0.00010840087,0.48477697,0.00611198,0.49423316,0.0000012107196,0.013462004],"study_design_scores_gemma":[0.0041917427,0.0008347082,0.026358103,0.0022110338,0.00013981531,0.000031736876,0.0007258577,0.89412326,0.05761806,0.011398497,0.0005828164,0.001784347],"about_ca_topic_score_codex":0.0009440247,"about_ca_topic_score_gemma":0.000032851123,"teacher_disagreement_score":0.48283464,"about_ca_system_score_codex":0.00049722573,"about_ca_system_score_gemma":0.00017595464,"threshold_uncertainty_score":0.99976826},"labels":[],"label_agreement":null},{"id":"W7015431277","doi":"","title":"Scheduling Real-time Traffic over Hybrid Channels","year":2024,"lang":"en","type":"dissertation","venue":"QSpace (Queen's University Library)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Scheduling (production processes); Reinforcement learning; Markov decision process; Dynamic priority scheduling; Queue; Wireless network; Channel (broadcasting); Round-robin scheduling","score_opus":0.004494947764974989,"score_gpt":0.18516694718676732,"score_spread":0.18067199942179232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7015431277","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3785412,0.00020794988,0.11153598,0.06983883,0.011047609,0.0034295993,0.00019416556,0.016890677,0.408314],"genre_scores_gemma":[0.02836166,0.0008751524,0.072296835,0.00023029948,0.00031857696,0.0000034252566,0.00261175,0.000144832,0.89515746],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979735,0.00008737373,0.00029094983,0.00070062664,0.0005210524,0.00042651087],"domain_scores_gemma":[0.9985607,0.00007509962,0.0003511921,0.0006829954,0.00010487248,0.0002251144],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000071366514,0.00045673898,0.000385714,0.0010247489,0.0002783219,0.0007502352,0.001470669,0.000333253,0.00047335122],"category_scores_gemma":[0.000019145304,0.0005457485,0.0002498449,0.0011078264,0.00003697768,0.007155423,0.0003447154,0.0005142959,0.0010321729],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017370183,0.00013818474,0.000025431913,0.0008844115,0.00035054525,0.0009142758,0.01021126,0.11777902,0.000019829484,0.0395986,0.8253336,0.0045711244],"study_design_scores_gemma":[0.0028569659,0.0005865357,0.0011176766,0.0034819744,0.00055326475,0.000011911533,0.006129746,0.6136285,0.009618004,0.0021477533,0.35317147,0.006696182],"about_ca_topic_score_codex":0.00022823275,"about_ca_topic_score_gemma":0.00000305286,"teacher_disagreement_score":0.4958495,"about_ca_system_score_codex":0.00018153622,"about_ca_system_score_gemma":0.00053957687,"threshold_uncertainty_score":0.99974567},"labels":[],"label_agreement":null},{"id":"W7025097089","doi":"","title":"Thinking youth suicide otherwise and outside: A nature-based CYC approach to life promotion","year":2022,"lang":"en","type":"other","venue":"UVic’s Research and Learning Repository (University of Victoria)","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Suicide prevention; Adventure; Poison control; Injury prevention; Human factors and ergonomics; Occupational safety and health","score_opus":0.025021939857272215,"score_gpt":0.25101616042264613,"score_spread":0.2259942205653739,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7025097089","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006004427,0.0011393669,0.32017437,0.00084703206,0.0007046162,0.0017914013,0.00001970649,0.0008471534,0.66847193],"genre_scores_gemma":[0.32878757,0.00029875056,0.18367554,0.00024034719,0.0008933187,0.000016508367,0.0003639485,0.00043097368,0.48529306],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973373,0.00052483473,0.00015472158,0.00052334124,0.0011501365,0.0003097086],"domain_scores_gemma":[0.99867463,0.00012132059,0.00027224686,0.00042482073,0.00023559864,0.0002713714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011863456,0.00018415769,0.00026937763,0.00084943586,0.0009427817,0.00027040095,0.0008317341,0.0003124329,0.0001207064],"category_scores_gemma":[0.0002017885,0.00022071385,0.0000499091,0.00064302125,0.00014178525,0.00037642595,0.0006986395,0.0013288407,0.000008833358],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00183128,0.0029277403,0.048712578,0.00786599,0.0018824534,0.00059672905,0.3756352,0.10018579,0.0013503776,0.042109776,0.39107934,0.025822744],"study_design_scores_gemma":[0.005648213,0.004079344,0.006949414,0.0018022731,0.00013940553,0.000067438814,0.03834253,0.3392224,0.00012536842,0.0003732281,0.60064906,0.0026013267],"about_ca_topic_score_codex":0.00045929072,"about_ca_topic_score_gemma":0.000016758828,"teacher_disagreement_score":0.33729267,"about_ca_system_score_codex":0.00016746906,"about_ca_system_score_gemma":0.00027309346,"threshold_uncertainty_score":0.9000449},"labels":[],"label_agreement":null},{"id":"W7117767531","doi":"10.1109/smartiot66867.2025.00033","title":"A Novel Whittle Index-Based Scheduling for Age of Information Minimization in IoT Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"MQTT; Scheduling (production processes); Markov decision process; Job shop scheduling; Queueing theory; Minification; Markov process; Internet of Things; Server","score_opus":0.010891522493988963,"score_gpt":0.23989374839894245,"score_spread":0.22900222590495348,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117767531","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007537419,0.000039848368,0.99219126,0.0009983917,0.00063124445,0.0013995526,0.000007847288,0.000073741896,0.003904362],"genre_scores_gemma":[0.4976927,0.000011622431,0.50040007,0.001458052,0.000022440601,0.00006871182,0.00017391947,0.0000073492324,0.00016509475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972493,0.0000451689,0.0017246451,0.0002532946,0.00034536148,0.0003822317],"domain_scores_gemma":[0.99753726,0.0002810746,0.0007832665,0.00049259735,0.0008411925,0.0000646202],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008142733,0.00026143505,0.0003614227,0.0012900523,0.0001486648,0.00037870265,0.0006619833,0.00034193767,0.00003810632],"category_scores_gemma":[0.0005295687,0.00029412092,0.00011884514,0.002637964,0.00007787565,0.002853531,0.00015894535,0.00018842237,0.0000049834016],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000916251,0.000109977926,0.0008949086,0.00027207058,0.000015314317,1.1489978e-7,0.0007942058,0.94532967,0.000019834535,0.028971978,0.00016931344,0.02333097],"study_design_scores_gemma":[0.0032984642,0.00008065374,0.0028288353,0.00044338446,0.000014577158,4.2645922e-7,0.00021761868,0.991573,0.00057819905,0.0001817575,0.0005385022,0.0002446099],"about_ca_topic_score_codex":0.00005733117,"about_ca_topic_score_gemma":0.000052302876,"teacher_disagreement_score":0.49693897,"about_ca_system_score_codex":0.00021649174,"about_ca_system_score_gemma":0.0006964581,"threshold_uncertainty_score":0.99995106},"labels":[],"label_agreement":null},{"id":"W7125893818","doi":"10.1109/wcsp68525.2025.1010487","title":"Secrecy-Driven Robust Beamforming Under Age of Information Constraints for Satellite-Terrestrial Integrated Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Eavesdropping; Probabilistic logic; Beamforming; Artificial noise; Physical layer; Robustness (evolution); Channel state information; Channel (broadcasting); Secrecy","score_opus":0.01923470231629752,"score_gpt":0.24642674448546514,"score_spread":0.22719204216916764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7125893818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003728199,0.000054835127,0.97546965,0.00038321517,0.0024690034,0.00177777,0.000030396897,0.00015397884,0.019288352],"genre_scores_gemma":[0.5464806,0.00021911887,0.44977045,0.0012354173,0.0001217084,0.000064320564,0.0012068251,0.000016191858,0.0008853838],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99644274,0.0001006548,0.0021747423,0.00031494818,0.00040045276,0.0005664689],"domain_scores_gemma":[0.99704295,0.00042995752,0.0010156871,0.00058790157,0.0007846833,0.0001388011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00080359523,0.00041262674,0.0005470097,0.0007455051,0.0003155241,0.000783709,0.0010183222,0.00046496486,0.0001660163],"category_scores_gemma":[0.000351598,0.00040535248,0.00024757287,0.0015302763,0.00037856482,0.0058012763,0.00034051653,0.00031738207,0.000018877532],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011482508,0.000038400525,0.000059995116,0.0001044668,0.000095338975,4.1106034e-7,0.00092531886,0.69904697,0.000010799208,0.123582155,0.0004149348,0.17560637],"study_design_scores_gemma":[0.0024833062,0.00015300627,0.00018845862,0.00042595467,0.00005884568,0.0000041832036,0.0012259241,0.99031216,0.00041128593,0.0013119973,0.003076283,0.00034857178],"about_ca_topic_score_codex":0.000055170454,"about_ca_topic_score_gemma":0.000030135765,"teacher_disagreement_score":0.54610777,"about_ca_system_score_codex":0.00027045037,"about_ca_system_score_gemma":0.0008548512,"threshold_uncertainty_score":0.99983984},"labels":[],"label_agreement":null},{"id":"W7138880348","doi":"10.1109/globecom59602.2025.11431823","title":"Quantum Neural Networks for MADRL-assisted Optimal Resource Allocation in Vehicular Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Reinforcement learning; Resource allocation; Artificial neural network; Convergence (economics); Vehicular ad hoc network; Energy consumption; Resource management (computing)","score_opus":0.012341929172438156,"score_gpt":0.24335526621412376,"score_spread":0.2310133370416856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7138880348","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017001362,0.0006741638,0.9855968,0.0056825825,0.0014518023,0.0017859674,0.0000024080025,0.00023822814,0.0028679601],"genre_scores_gemma":[0.9208284,0.000106236825,0.07176641,0.003925505,0.0002422664,0.00022577615,0.00023689949,0.000036298563,0.0026322284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958297,0.00028014486,0.0016685436,0.00083614705,0.00041743624,0.0009680356],"domain_scores_gemma":[0.997295,0.00041410627,0.00054206495,0.0010270015,0.00055231736,0.00016951248],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014196469,0.0005008677,0.0005139162,0.00062207336,0.0004864144,0.00097222655,0.0013791719,0.0005749528,0.00005269017],"category_scores_gemma":[0.00021663574,0.00054116454,0.00023860001,0.002672962,0.00012952035,0.0020395773,0.0005305495,0.0005476176,0.000010052655],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012562504,0.00010239983,0.00016414835,0.000052516687,0.00003531639,0.0000039000042,0.0002823162,0.8813133,0.0000023339417,0.042309243,0.006768894,0.068840005],"study_design_scores_gemma":[0.0017921634,0.00015989594,0.002847,0.00020210973,0.00003808409,0.000008695218,0.00021759345,0.99092567,0.0000245847,0.00009547012,0.0031943351,0.0004943904],"about_ca_topic_score_codex":0.000066376706,"about_ca_topic_score_gemma":0.000048867118,"teacher_disagreement_score":0.91912824,"about_ca_system_score_codex":0.0003713428,"about_ca_system_score_gemma":0.00023097786,"threshold_uncertainty_score":0.999704},"labels":[],"label_agreement":null},{"id":"W7140843614","doi":"10.1109/ieeeconf67917.2025.11443867","title":"Quantum Connected Collaborative Learning with Superdense Coding for Wireless Internet-of-Everything Networks","year":2025,"lang":"","type":"article","venue":"","topic":"Age of Information Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"","keywords":"Coding (social sciences); Collaborative learning; Wireless; Wireless network; Linear network coding; Superdense coding","score_opus":0.008133029761026473,"score_gpt":0.23431993924157057,"score_spread":0.2261869094805441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7140843614","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020206919,0.00013623018,0.9727967,0.00056766963,0.00078098685,0.0011187189,0.0000025635634,0.00018425896,0.004205949],"genre_scores_gemma":[0.9222049,0.000075573626,0.07441484,0.00031081671,0.000034151137,0.000044678865,0.000027711063,0.00002043709,0.0028668803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99743104,0.00022075477,0.001008387,0.0005052125,0.00033410243,0.0005005276],"domain_scores_gemma":[0.9952588,0.0011736276,0.0006865975,0.0003753393,0.0024079925,0.00009766342],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007843264,0.0003641818,0.0005532702,0.00038508445,0.00042824814,0.0006969573,0.0006954652,0.00022205205,0.00006784226],"category_scores_gemma":[0.00045471513,0.00033731,0.000088036606,0.002193988,0.00020737525,0.0019318103,0.00034650412,0.00038597043,0.000005008022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003866919,0.00006203187,0.0006300572,0.00024948374,0.00024211833,0.000005142686,0.011593233,0.5915929,0.00004380591,0.38155973,0.0011220699,0.012512754],"study_design_scores_gemma":[0.001750069,0.0005360026,0.00009218137,0.001104041,0.00005984622,0.000007405103,0.004174767,0.9891649,0.0022873466,0.000099232384,0.00035222864,0.00037198814],"about_ca_topic_score_codex":0.00004233969,"about_ca_topic_score_gemma":0.000023751356,"teacher_disagreement_score":0.901998,"about_ca_system_score_codex":0.0001763607,"about_ca_system_score_gemma":0.00064631336,"threshold_uncertainty_score":0.9999079},"labels":[],"label_agreement":null}]}